RREF Calculator - Reduced Row Echelon Form with Steps
Free RREF calculator with step-by-step working. Row reduce any matrix to reduced row echelon form using exact fractions, with every row operation named, pivots highlighted and the rank shown.
RREF Calculator
Enter a matrix to row reduce it to reduced row echelon form. Every row operation is named and shown, answers stay as exact fractions rather than rounded decimals, and pivot positions are highlighted so you can read off the rank. Tick the box under the grid to treat the last column as the constants of a linear system and get the solution too.
What reduced row echelon form means
A matrix is in reduced row echelon form when all four of these hold. Miss any one and it is not RREF.
- The first non-zero entry of every row is a 1, called the leading 1 or pivot.
- Each pivot sits strictly to the right of the pivot in the row above.
- Every other entry in a pivot's column is zero — above it as well as below.
- Rows of all zeros are at the bottom.
Every matrix has exactly one RREF. That uniqueness is what makes it useful: two people who row reduce the same matrix by different sequences of operations still finish with the identical result. Ordinary row echelon form is not unique, which is why RREF is the form worth computing.
A worked example
The matrix loaded into the calculator is the augmented matrix of this system:
2x + y − z = 8 −3x − y + 2z = −11 −2x + y + 2z = −3
Row reducing it gives the identity matrix on the left and the solution on the right:
1 0 0 | 2 0 1 0 | 3 0 0 1 | −1
So x = 2, y = 3, z = −1. Substituting back into the first equation gives 2(2) + 3 − (−1) = 8, which confirms it. Three pivots for three unknowns means the solution is unique.
How to read the answer
Once a matrix is in RREF, the shape of the result tells you everything about the system it came from.
| What you see | What it means |
|---|---|
| A pivot in every variable column | Exactly one solution; read it straight off the last column. |
| A row of 0 0 0 | c, with c ≠ 0 | That row says 0 = c, which is impossible. The system is inconsistent — no solution. |
| A variable column with no pivot | That variable is free. Infinitely many solutions, described in terms of the free variables. |
| A row of all zeros | That equation was a combination of the others and carried no new information. |
| Number of pivots | The rank of the matrix. The pivot columns of the original matrix form a basis for its column space. |
RREF compared with REF
| Row echelon form (REF) | Reduced row echelon form (RREF) | |
|---|---|---|
| Leading entry | Any non-zero number | Must be exactly 1 |
| Above the pivot | May be anything | Must be zero |
| Uniqueness | Many valid forms | Exactly one per matrix |
| Method | Gaussian elimination | Gauss-Jordan elimination |
| Getting the solution | Needs back-substitution | Read directly off the matrix |
If you only need row echelon form and the back-substitution written out, use the Gaussian elimination calculator instead.
Mistakes that cost marks
- Clearing only below the pivot. That gives REF, not RREF. The entries above each pivot must be zero too.
- Rounding too early. Turning 1/3 into 0.333 and carrying it through will not give clean pivots. This calculator keeps exact fractions for that reason.
- Operating on columns. Only row operations preserve the solution set. Swapping columns changes which variable is which.
- Multiplying a row by zero. Allowed operations are: swap two rows, multiply a row by a non-zero constant, and add a multiple of one row to another.
- Reading a free variable as zero. A column with no pivot means that variable can be anything; the answer is a family of solutions, not a single point.
What row reduction is used for
Solving linear systems
Row reduce the augmented matrix and the solution can be read straight off, including when there are infinitely many.
Rank and independence
The number of pivots is the rank, and it tells you whether a set of vectors is linearly independent.
Inverting a matrix
Row reduce [A | I]. If the left half becomes the identity, the right half is A⁻¹.
Null space and column space
Free variables give a basis for the null space; pivot columns give a basis for the column space.
Related matrix calculators
Frequently asked questions
What is RREF (Reduced Row Echelon Form)? ▾
RREF is a standardized form of a matrix where: 1) The first non-zero element in each row (leading coefficient) is 1, 2) Each column containing a leading 1 has zeros in all other entries, 3) Any rows of all zeros appear at the bottom, 4) Each leading 1 is to the right of all leading 1's in rows above it.
Why is RREF important in linear algebra? ▾
RREF is crucial in linear algebra for several reasons: It simplifies solving systems of linear equations, helps in determining matrix rank, aids in finding null space and column space, and assists in matrix inversion and determinant computation.
How is RREF different from REF? ▾
While both are reduced forms, RREF is more standardized. In REF, leading non-zero entries can be any number, while in RREF they must be 1. RREF requires zeros above and below leading 1s, while REF only requires zeros below. RREF gives a unique form for each matrix, while REF may have multiple forms.
Can RREF be used to solve systems of equations? ▾
Yes, RREF is particularly useful for solving systems of linear equations. The augmented matrix is converted to RREF, making it easy to read off the solution. Variables corresponding to columns without leading 1s are free variables.
What are the steps to calculate RREF? ▾
The steps are: 1) Find the leftmost non-zero column for a pivot, 2) Make the topmost non-zero entry 1 by dividing its row, 3) Make all other entries in that column 0 using row operations, 4) Repeat for the next column to the right, working only with rows below the current pivot row.
About this Calculator
Free RREF calculator with step-by-step working. Row reduce any matrix to reduced row echelon form using exact fractions, with every row operation named, pivots highlighted and the rank shown.