Linear Algebra · Undergraduate
Row Reduction and Echelon Form
Quick answer
A linear system is recorded as an augmented matrix, one row per equation. Three row operations — swapping two rows, scaling a row, and adding a multiple of one row to another — change the matrix without changing the solution set. Applying them systematically produces echelon form, where each leading entry sits to the right of the one above, and then reduced echelon form, where each pivot is 1 and is alone in its column. The solution can then be read straight off the rows.
What you'll learn
- Write a linear system as an augmented matrix
- Apply the three row operations correctly
- Reduce a matrix to echelon and reduced echelon form
- Identify pivot positions and read off a solution
The system as a matrix
Solving a linear system means combining equations until each unknown stands alone. The variable names take no part in that work, so record only the coefficients. The system
becomes the augmented matrix, one row per equation, with a bar marking the right-hand side:
Three row operations rewrite it without changing what it says:
- Swap two rows.
- Scale a row by a nonzero number.
- Replace a row by itself plus a multiple of another row.
Why row operations keep every solution
Each operation is a move on whole equations, and each is reversible. Swapping two equations changes their order, and a solution of a set of equations does not depend on the order. Multiplying an equation by gives an equation with the same solutions, since dividing by returns the original. Adding a multiple of one equation to another produces an equation that every common solution already satisfies, and subtracting the same multiple undoes it. Every row operation can be undone by another row operation, so the new system has exactly the same solution set as the old one — no solutions lost, none gained.
Echelon form
Working down the matrix, the goal is a staircase shape.
A matrix is in echelon form when every all-zero row sits at the bottom. Each leading nonzero entry, called a pivot, must also stand strictly to the right of the pivot in the row above.
Going further gives the form that answers the question outright.
A matrix is in reduced row echelon form when it is in echelon form, every pivot is , and every pivot is the only nonzero entry in its column.
Each matrix has exactly one reduced row echelon form, whatever route the row operations take to get there.
The algorithm. Work left to right. In the current column, pick a nonzero entry at or below the current row and swap it up. Scale it to , then use it to clear every other entry in its column. Move down one row and right at least one column, and repeat.
Worked examples
Common mistakes
Practice problems
-
Write the system , as an augmented matrix.
Answer
Full solution
One row per equation, with the coefficients of and and then the constant.
-
Solve that system by row reduction.
Answer
Full solution
Swapping the rows puts a in the first pivot: then gives , so and .
-
Solve , , .
Answer
Full solution
Clearing the first column gives and . Subtracting, , so , and .
-
What does a row tell you?
Answer
The system has no solution.
Full solution
The row says . No values of the variables make that true, so the system is inconsistent.
-
Is in echelon form? In reduced echelon form?
Answer
Echelon yes; reduced no
Full solution
The staircase and the zero row at the bottom are correct, but the second pivot is rather than .
-
Put in reduced row echelon form.
Answer
Full solution
gives . Scaling by and then finishes it, giving and .
-
How many pivots does have, and in which columns?
Answer
Two pivots, in columns and
Full solution
The leading entries are the in row 1 column 2 and the in row 2 column 4.
-
Which row operation turns into ?
Answer
Full solution
Subtracting four times the first row from the second gives and .
-
A system of three equations in three unknowns row reduces to a matrix with pivots in columns 1, 2 and 3. How many solutions does it have?
Answer
Exactly one
Full solution
Every variable has a pivot and no pivot sits in the last column, so the reduced form reads off a single value for each variable.
-
A student solves a system, reaches , and reports “no solution”. What went wrong?
Hint
What does the second row say?
Answer
The row says , which is always true. The system has infinitely many solutions.
Full solution
A zero row on both sides carries no information: one equation was a multiple of the other. No solution requires a pivot in the last column, as in . Here the surviving equation is satisfied by a whole line of pairs.
Frequently asked questions
What are the three elementary row operations?
Swap two rows; multiply a row by a nonzero number; add a multiple of one row to another row. Each is reversible, so none changes the solution set.
What is echelon form?
Every all-zero row sits at the bottom, and each leading nonzero entry is strictly to the right of the leading entry in the row above.
What is reduced row echelon form?
Echelon form with every leading entry equal to 1 and every other entry in a pivot column equal to 0. A matrix has exactly one reduced echelon form.
What is a pivot?
The leading nonzero entry of a row in echelon form. Its position is a pivot position, and its column is a pivot column.
How do you know a system has no solution?
A row of the form [0 0 … 0 | c] with c nonzero says 0 = c, which is false, so the system is inconsistent.