3.1Row echelon form and Gaussian elimination
The idea
Gaussian elimination uses three row operations to turn a matrix into a staircase (echelon) form, from which rank, solutions and inverses can be read.
Think of it like this: Tidying a bookshelf: each step moves one stack so that the leftover mess gets smaller.
Why it exists
Every later tool (rank, solving, inverse, LU) is a by-product of elimination.
How it works
- Find the first non-zero entry in the leftmost column and swap it up (the pivot).
- Subtract multiples of the pivot row to clear the entries below it.
- Move to the next column and the next row. The result is an echelon form.
- Continue upwards and scale to get the reduced form (RREF).
Worked example: A rank-2 3×3 matrix
When R3 = R1 + R2, one row becomes all zeros during elimination, so only two pivots remain.
Now play with it
- →Press Next step and watch each row operation and the highlighted row.
- →Switch to the 3×4 example and count the free variables.
| 1 | 2 | 3 |
| 2 | 5 | 3 |
| 1 | 0 | 8 |
- R2 ← R2 − (2)·R1
- R3 ← R3 − (1)·R1
- R1 ← R1 − (2)·R2
- R3 ← R3 − (-2)·R2
- R3 ← R3 / -1
- R1 ← R1 − (9)·R3
- R2 ← R2 − (-3)·R3
Check yourself
Which operation changes the solution set of a system?
Exam notes (the dense version)
Use three row operations: swap two rows, scale a row, add a multiple of one row to another. Forward elimination makes zeros below each pivot (echelon form); continuing upward and scaling pivots to 1 gives the reduced row echelon form (RREF). Row operations never change the row space, the solution set of Ax = b, or the rank.
Previous year questions: Rank, Elimination & LU (4)
PYQs are grouped by topic, so this is the full set for Rank, Elimination & LU; try the ones that match this subtopic. Open all 4 on the topic page.