Row-echelon Form of a Matrix
Row-Echelon
Form of a Matrix
Echelon Form of a Matrix
A matrix form used when solving linear systems of equations.

![3×4 matrix in row-echelon form: row1[1,4,-2,0,6], row2[0,1,7,-5,1], row3[0,0,0,1,5]](../e/e_assets/e13.gif)
See also
Key Formula
a1100⋮0a12a220⋮0a13a23a33⋮0⋯⋯⋯⋱⋯a1na2na3n⋮amn
Where:
- aii = Leading entry (pivot) of each row — the first nonzero entry in that row
- 0 = All entries below each pivot must be zero
- m×n = The matrix has m rows and n columns
Worked Example
Problem: Use elementary row operations to convert the following matrix into row-echelon form:
12−126−1−103
Step 1: Eliminate the entry below the first pivot. Subtract 2 times Row 1 from Row 2: R2←R2−2R1.
10−122−1−123
Step 2: Eliminate the other entry below the first pivot. Add Row 1 to Row 3: R3←R3+R1.
100221−122
Step 3: Eliminate the entry below the second pivot. Subtract 21 times Row 2 from Row 3: R3←R3−21R2.
100220−121
Answer: The row-echelon form is 100220−121. Each pivot is to the right of the one above it, and all entries below each pivot are zero.
Another Example
This example differs because the first entry is zero, requiring a row swap before elimination. It also uses an augmented matrix, showing how row-echelon form applies directly to solving a system of equations.
Problem: Convert the following augmented matrix (from a system of 3 equations in 3 unknowns) into row-echelon form:
0241493−215613
Step 1: The first pivot position has a zero, so swap Row 1 and Row 2 to get a nonzero entry in the top-left: R1↔R2.
204419−2316513
Step 2: Eliminate the entry below the first pivot. Subtract 2 times Row 1 from Row 3: R3←R3−2R1.
200411−235651
Step 3: Eliminate the entry below the second pivot. Subtract Row 2 from Row 3: R3←R3−R2.
200410−23265−4
Answer: The row-echelon form of the augmented matrix is 200410−23265−4. You can now solve by back-substitution.
Frequently Asked Questions
What is the difference between row-echelon form and reduced row-echelon form?
Row-echelon form (REF) requires that all entries below each pivot are zero, but entries above the pivots can be nonzero. Reduced row-echelon form (RREF) goes further: every pivot must equal 1, and all entries both above and below each pivot must be zero. RREF gives the solution directly, while REF requires back-substitution to finish solving.
Is row-echelon form unique for a given matrix?
No. A matrix can have many different row-echelon forms depending on which row operations you perform. However, the reduced row-echelon form of a matrix is always unique. The pivot positions (which columns contain pivots) are the same regardless of which REF you produce.
What are the three conditions for a matrix to be in row-echelon form?
A matrix is in row-echelon form when: (1) all rows consisting entirely of zeros are at the bottom, (2) the leading entry (pivot) of each nonzero row is strictly to the right of the leading entry in the row above it, and (3) all entries in a column below a pivot are zero.
Row-Echelon Form (REF) vs. Reduced Row-Echelon Form (RREF)
| Row-Echelon Form (REF) | Reduced Row-Echelon Form (RREF) | |
|---|---|---|
| Pivots | Pivots can be any nonzero value | All pivots must equal 1 |
| Entries above pivots | Can be any value | Must all be zero |
| Entries below pivots | Must all be zero | Must all be zero |
| Uniqueness | Not unique — multiple valid forms exist | Unique for any given matrix |
| How to read the solution | Requires back-substitution | Solution can be read directly |
| Method | Gaussian elimination | Gauss-Jordan elimination |
Why It Matters
Row-echelon form is the foundation of Gaussian elimination, the standard algorithm for solving systems of linear equations in algebra and linear algebra courses. You will use it extensively when finding solutions to systems, determining whether a system has zero, one, or infinitely many solutions, and computing the rank of a matrix. It also appears in applications from engineering to computer science whenever large systems of equations must be solved efficiently.
Common Mistakes
Mistake: Forgetting to check whether the pivot position is zero before proceeding with elimination.
Correction: If a pivot position contains zero, you must swap that row with a lower row that has a nonzero entry in that column. Skipping this step leads to division by zero or an incorrect result.
Mistake: Assuming row-echelon form requires pivots to equal 1.
Correction: Pivots equal to 1 is a requirement of reduced row-echelon form, not row-echelon form. In REF, the pivot just needs to be the first nonzero entry in its row — it can be any nonzero number.
Related Terms
- Matrix — The object being transformed into echelon form
- Gaussian Elimination — The algorithm that produces row-echelon form
- Reduced Row-Echelon Form — A stricter form with pivots of 1 and zeros above
- Linear System of Equations — The type of problem solved using row-echelon form
- Solve — Back-substitution completes the solving process from REF
- Augmented Matrix — Matrix form that includes the constants from a linear system
