How to use Gauss–Jordan elimination to reach reduced row-echelon form
Gauss–Jordan elimination uses row operations to make a system’s solution easier to read. We build pivot columns with a leading 1 and zeros above and below it. Let’s follow that process through a three-variable system.
Recognize echelon and reduced echelon forms
In row-echelon form, zero rows are at the bottom and each nonzero row’s leading entry is farther right than the leading entry in the row above. In reduced row-echelon form, each leading entry is 1 and is the only nonzero entry in its column. Entries in columns without pivots may still be nonzero.
Write the system as an augmented matrix
At each pivot stage, look for a nonzero entry at or below the current row. If the current entry is zero, swap a suitable row into that position. If no such entry exists in the column, move to the next column.
Create the first pivot and clear its column
First apply and .
Now apply and .
Create the second pivot and clear its column
Apply , giving row 2 equal to . Then apply and .
Create the third pivot and finish reducing
Apply , followed by .
The reduced matrix gives , , and . Substituting these values into the original equations gives , , and on their left sides, matching all three constants.
Interpret other possible reduced forms
A row with zero coefficients and a nonzero constant means the system has no solution. If a consistent system has a variable column without a pivot, that variable is free. The remaining variables can be written in terms of the free variables.