Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools


Reduced Row Echelon Form(REF)



Row Echelon Form
Reduced Row Echelon Form
Uniqueness of RREF
Pivot Columns and Free Columns
Reading Solutions from REF
Reading Solutions from RREF
Parametric Vector Form
Detecting Inconsistency
Echelon Form of Special Matrices
Echelon Form and Rank
Summary: Everything Readable from RREF



The Staircase That Reveals Everything

Row echelon form and reduced row echelon form are the standard targets of Gaussian elimination. The staircase pattern of pivots immediately exposes the rank, the free variables, and the solvability of the system. RREF goes one step further — it is unique for every matrix, making it a canonical form from which the solution can be read without any back substitution.



Row Echelon Form

A matrix is in row echelon form (REF) if it satisfies three conditions. Every zero row (a row of all zeros) sits at the bottom of the matrix. The leading entry of each nonzero row — called the pivot — is strictly to the right of the pivot in the row above. Every entry below a pivot is zero.

These conditions create a staircase pattern that descends from upper-left to lower-right:

(23−147015020004−300000)\begin{pmatrix} \boxed{2} & 3 & -1 & 4 & 7 \\ 0 & \boxed{1} & 5 & 0 & 2 \\ 0 & 0 & 0 & \boxed{4} & -3 \\ 0 & 0 & 0 & 0 & 0 \end{pmatrix}


The boxed entries are pivots. Each sits to the right of and below the previous one, with zeros filling in below and to the left. The bottom row is all zeros.

REF is not unique. Different sequences of row operations applied to the same matrix can produce different echelon forms — the pivots may have different values, and the non-pivot entries above the pivots may differ. What remains the same across all echelon forms of a given matrix is the set of pivot positions (which columns contain pivots).

Reduced Row Echelon Form

A matrix is in reduced row echelon form (RREF) if it satisfies two additional conditions beyond REF. Each pivot is equal to 11. Each pivot is the only nonzero entry in its column — all entries above the pivot are also zero, not just below.

Applying these conditions to the previous example:

(10−160294015020001−3400000)\begin{pmatrix} 1 & 0 & -16 & 0 & \frac{29}{4} \\ 0 & 1 & 5 & 0 & 2 \\ 0 & 0 & 0 & 1 & -\frac{3}{4} \\ 0 & 0 & 0 & 0 & 0 \end{pmatrix}


Every pivot is 11, and every other entry in a pivot column is 00. The pivot columns are clean unit vectors within the matrix. The non-pivot columns (columns 33 and 55 in this example) can contain anything.

RREF is achieved from REF by Gauss-Jordan elimination: scale each pivot row so the pivot becomes 11, then use row addition to eliminate all entries above each pivot.

Uniqueness of RREF

Every matrix has exactly one RREF. No matter which sequence of row operations is used to reach it, the result is the same.

This is not true of REF — different reduction paths can produce different row echelon forms of the same matrix, with different values in the non-pivot entries. But RREF is canonical: it is the unique representative of the matrix's row-equivalence class in reduced form.

The uniqueness of RREF implies that the pivot positions are intrinsic to the matrix. They do not depend on how the reduction is carried out. This means the rank (the number of pivots), the free variables (the non-pivot columns), and the entire solution structure are determined by the matrix itself, not by any particular algorithm applied to it.
Aspect Row Echelon Form (REF) Reduced Row Echelon Form (RREF)
Defining conditions zero rows at the bottom; pivots staircase strictly right; entries below each pivot are 0 all REF conditions + each pivot equals 1 + each pivot is the only nonzero entry in its column
Pivot values any nonzero number always 1
Entries above pivots anything (not constrained) always 0
Uniqueness not unique — different row-operation paths give different REFs (pivot positions stay the same) unique — every matrix has exactly one RREF, regardless of reduction path
Reached by forward elimination only Gauss-Jordan (forward + backward, plus pivot scaling)
Reading the solution by back substitution from the bottom row upward by direct inspection — each pivot variable is already isolated

Pivot Columns and Free Columns

Pivot columns are the columns that contain a pivot position in the echelon form. Free columns are everything else.

The number of pivot columns equals the rank of the matrix. The number of free columns in the coefficient matrix AA (not counting the augmented column) equals n−rank(A)n - \text{rank}(A), which is the nullity — the dimension of the null space.

In the context of a linear system, each pivot column corresponds to a pivot variable: a variable whose value is determined once the free variables are assigned. Each free column corresponds to a free variable: a parameter that can take any real value, generating a family of solutions.

For the RREF example above, columns 11, 22, and 44 are pivot columns, while columns 33 and 55 are free. The variables x1x_1, x2x_2, x4x_4 are pivot variables determined by x3x_3 and x5x_5, which are free.

Reading Solutions from REF

In row echelon form, the solution is extracted by back substitution: solve from the bottom nonzero row upward, one pivot variable at a time.

Worked Example


(13−25014−10012)\left(\begin{array}{ccc|c} 1 & 3 & -2 & 5 \\ 0 & 1 & 4 & -1 \\ 0 & 0 & 1 & 2 \end{array}\right)


Row 33: x3=2x_3 = 2.

Row 22: x2+4(2)=−1x_2 + 4(2) = -1, so x2=−9x_2 = -9.

Row 11: x1+3(−9)−2(2)=5x_1 + 3(-9) - 2(2) = 5, so x1=5+27+4=36x_1 = 5 + 27 + 4 = 36.

Each step uses values computed in previous steps. The process requires nn substitutions for an n×nn \times n system with a unique solution. When free variables are present, they appear as unresolved symbols carried through the substitution, producing a parametric expression.

Reading Solutions from RREF

In RREF, each pivot variable is already isolated. The solution is visible by inspection — no back substitution is needed.

Worked Example


The same system in RREF:

(10036010−90012)\left(\begin{array}{ccc|c} 1 & 0 & 0 & 36 \\ 0 & 1 & 0 & -9 \\ 0 & 0 & 1 & 2 \end{array}\right)


Reading directly: x1=36x_1 = 36, x2=−9x_2 = -9, x3=2x_3 = 2.

When free variables are present, RREF isolates each pivot variable in terms of the free variables:

(1030701−20100014)\left(\begin{array}{cccc|c} 1 & 0 & 3 & 0 & 7 \\ 0 & 1 & -2 & 0 & 1 \\ 0 & 0 & 0 & 1 & 4 \end{array}\right)


Column 33 is free. Reading off: x1=7−3x3x_1 = 7 - 3x_3, x2=1+2x3x_2 = 1 + 2x_3, x4=4x_4 = 4, and x3x_3 is free. Setting x3=tx_3 = t gives the parametric solution without any backward solving.

Parametric Vector Form

When free variables exist, the general solution is best expressed in parametric vector form. Each free variable becomes a parameter, and the solution is written as a particular solution plus a linear combination of direction vectors — one per free variable.

For the system with RREF

(120−150013−2)\left(\begin{array}{cccc|c} 1 & 2 & 0 & -1 & 5 \\ 0 & 0 & 1 & 3 & -2 \end{array}\right)


Pivots in columns 11 and 33. Free variables: x2=sx_2 = s, x4=tx_4 = t. Reading off: x1=5−2s+tx_1 = 5 - 2s + t, x3=−2−3tx_3 = -2 - 3t.

x=(50−20)+s(−2100)+t(10−31)\mathbf{x} = \begin{pmatrix} 5 \\ 0 \\ -2 \\ 0 \end{pmatrix} + s\begin{pmatrix} -2 \\ 1 \\ 0 \\ 0 \end{pmatrix} + t\begin{pmatrix} 1 \\ 0 \\ -3 \\ 1 \end{pmatrix}


The first vector is a particular solution xp\mathbf{x}_p. The two direction vectors form a basis for the null space of the coefficient matrix. The solution set is the null space translated by xp\mathbf{x}_p — an affine subspace of dimension 22 in R4\mathbb{R}^4.

For a homogeneous system (b=0\mathbf{b} = \mathbf{0}), the particular solution is 0\mathbf{0} and the general solution is purely a null-space combination.

Detecting Inconsistency

A system is inconsistent — has no solution — if and only if the echelon form of the augmented matrix contains a row of the form

[00⋯0∣d]with d≠0[0 \quad 0 \quad \cdots \quad 0 \mid d] \qquad \text{with } d \neq 0


This row represents the equation 0=d0 = d, which no values of the unknowns can satisfy.

In terms of rank, inconsistency occurs when rank([A∣b])>rank(A)\text{rank}([A \mid \mathbf{b}]) > \text{rank}(A). The extra column b\mathbf{b} introduces a new pivot that the coefficient matrix alone does not have — meaning b\mathbf{b} is not in the column space of AA.

If no such contradictory row appears, the system is consistent. The distinction between unique and infinite solutions then depends on whether free variables exist: rank =n= n gives a unique solution, rank <n< n gives infinitely many.

Echelon Form of Special Matrices

Several matrix types are already in echelon form or reach it with minimal work.

The identity matrix InI_n is in RREF: nn pivots, each equal to 11, each alone in its column. Rank nn, no free variables.

Any diagonal matrix is in REF. If all diagonal entries are nonzero, scaling each to 11 produces RREF. If some diagonal entries are zero, the corresponding rows are zero rows and the rank drops.

An upper triangular matrix is already in REF. Its pivots are the nonzero diagonal entries, and its rank equals the number of nonzero entries on the diagonal.

A lower triangular matrix is not in REF (the staircase goes the wrong way), but forward elimination converts it quickly — each column requires at most one elimination step.

The zero matrix is in both REF and RREF. It has rank 00, and the corresponding homogeneous system Ox=0O\mathbf{x} = \mathbf{0} has every variable free.
Matrix type Echelon status Pivot structure Rank
Identity In already in RREF n pivots, each equal to 1, each alone in its column n
Diagonal — all entries nonzero in REF; reaches RREF after scaling each row one pivot per row, equal to the diagonal entry n
Diagonal — some entries zero in REF (zero rows reorder to the bottom) a pivot only where the diagonal entry is nonzero number of nonzero diagonal entries
Upper triangular already in REF nonzero diagonal entries serve as pivots number of nonzero diagonal entries
Lower triangular NOT in REF — the staircase goes the wrong direction forward elimination converts it quickly; at most one elimination per column depends on the matrix
Zero matrix O already in both REF and RREF no pivots; every column is free 0

Echelon Form and Rank

The rank of any matrix equals the number of pivots in any echelon form. This is the standard computational method for determining rank: row reduce and count pivots.

From the rank, everything else follows. The dimension of the column space is rr. The dimension of the row space is rr. The number of free variables is n−rn - r. The dimension of the null space is n−rn - r. The system Ax=bA\mathbf{x} = \mathbf{b} is consistent if and only if the augmented matrix has the same rank rr as AA. The solution, when it exists, is unique if r=nr = n and infinite if r<nr < n.

The pivot positions also identify bases for the fundamental subspaces. The original columns at pivot positions form a basis for the column space. The nonzero rows of the echelon form are a basis for the row space. The parametric solution of Ax=0A\mathbf{x} = \mathbf{0} gives a basis for the null space. Everything flows from counting and locating the pivots.

Summary: Everything Readable from RREF

The RREF of A is a single canonical form, but it carries a remarkable amount of structural information about the matrix — the rank, the nullity, bases for the column, row, and null spaces, and the consistency, uniqueness, and invertibility verdicts for any system A·x = b. The table below collects each property that can be extracted directly from RREF alongside the rule for reading it and the underlying reason.
Property of A How to read it from RREF Why
Rank of A count the pivots pivots correspond to independent rows and to independent columns
Nullity (dim of Null(A)) n − (number of pivots) = number of free columns rank-nullity theorem
Basis for the column space the original columns of A at pivot positions row operations preserve linear dependence among columns
Basis for the row space the nonzero rows of the RREF row operations preserve the row space
Basis for the null space parametric solution to A x = 0; one basis vector per free variable each free variable parametrizes one direction in Null(A)
Consistency of A x = b no row of the form [0 ⋯ 0 | d] with d ≠ 0 in the reduced augmented matrix rank(A) = rank([A | b]); b ∈ Col(A)
Uniqueness of solution every column of A has a pivot (no free variables) rank(A) = n; Null(A) = {0}
Invertibility (square A) RREF of A equals In full rank n + square ⟺ invertible