RREF Calculator
Compute the reduced row echelon form of any matrix with full step-by-step Gauss-Jordan elimination. Supports 2x2 to 4x5 including augmented systems.
Matrix Size
Load a preset example:
Enter Matrix
The last column is separated as the augmented part [A|b] for systems of equations.
Elementary Row Operations
| Operation | Notation | Purpose in RREF |
|---|---|---|
| Row Swap | Ri ↔ Rj | Move the best pivot candidate to the current row |
| Row Scaling | Ri ← (1/c) x Ri | Make the pivot entry equal to 1 |
| Row Replacement | Ri ← Ri - c x Rj | Eliminate all other entries in a pivot column |
What is Reduced Row Echelon Form?
Reduced Row Echelon Form (RREF) is a standardized canonical form for matrices that makes solving linear systems straightforward. It is the end result of Gauss-Jordan elimination, the complete form of Gaussian elimination that continues beyond REF (Row Echelon Form) until each pivot column has exactly one non-zero entry.
The formal conditions for RREF are: (1) all zero rows appear at the bottom, (2) the first non-zero entry in each non-zero row is 1, called the pivot or leading 1, (3) each pivot is strictly to the right of the pivot in the row above it, and (4) each pivot is the only non-zero entry in its entire column. These four conditions together guarantee the unique RREF for any given matrix.
Applications in Linear Algebra
RREF has far-reaching applications in linear algebra. The most immediate use is solving systems of linear equations - an augmented matrix [A|b] in RREF directly reveals the solution without back substitution. The number of non-zero rows in RREF gives the matrix rank, which determines whether a system has no solution, exactly one solution, or infinitely many solutions.
RREF is also used to find the null space (kernel) of a matrix by setting up the homogeneous system [A|0], identify linearly independent columns (pivot columns), compute matrix inverses by augmenting with the identity matrix [A|I] and reducing to [I|A^-1], and determine the column space basis of a matrix.
Gauss-Jordan vs Gaussian Elimination
Gaussian elimination reduces a matrix to REF (Row Echelon Form), which requires back substitution to extract solutions. Gauss-Jordan elimination continues to RREF, eliminating above and below each pivot, so solutions are immediately readable from the final matrix without additional work. While Gauss-Jordan requires more arithmetic operations, the clarity of RREF for education and verification makes it the preferred method for calculators and software.
Interpreting RREF for Linear Systems
After computing RREF for an augmented matrix, reading the solution is straightforward. If a row reads [0 0 ... 0 | 1], the system is inconsistent (no solution). If every variable column has a pivot, the unique solution is given by the augmented column values. If some variable columns lack pivots (called free variables), the system has infinitely many solutions parameterized by the free variables. This systematic interpretation makes RREF the standard tool for linear systems in introductory linear algebra courses.