Converting REF to RREF
What you'll learn: How to transform a matrix already in row echelon form (REF) into reduced row echelon form (RREF) using systematic upward elimination.
The Core Idea
Once you have a matrix in row echelon form—with leading entries (pivots) stepped down from left to right—you're halfway to RREF. The remaining work is called back substitution or backward elimination: you use each pivot to eliminate all entries above it in its column.
Think of REF as a staircase you've climbed up. Converting to RREF means sweeping back down those stairs, cleaning each step by removing the "clutter" (non-zero entries) above each pivot.
The Process
Starting from the bottom-most pivot and working upward:
- Scale the pivot row so the pivot becomes exactly 1 (if it isn't already)
- Use row operations to make every entry above that pivot equal to zero
- Move up to the next pivot and repeat
Example
Suppose you have this REF matrix:
[ 2 4 6 ]
[ 0 3 9 ]
[ 0 0 5 ]
Step 1: Scale row 3 so pivot = 1:
[ 2 4 6 ]
[ 0 3 9 ]
[ 0 0 1 ] ← R₃ ÷ 5
Step 2: Eliminate above the third pivot (column 3):
[ 2 4 0 ] ← R₁ - 6R₃
[ 0 3 0 ] ← R₂ - 9R₃
[ 0 0 1 ]
Step 3: Scale row 2:
[ 2 4 0 ]
[ 0 1 0 ] ← R₂ ÷ 3
[ 0 0 1 ]
Step 4: Eliminate above the second pivot:
[ 2 0 0 ] ← R₁ - 4R₂
[ 0 1 0 ]
[ 0 0 1 ]
Step 5: Scale row 1:
[ 1 0 0 ] ← R₁ ÷ 2
[ 0 1 0 ]
[ 0 0 1 ]
Now you have RREF!
Key Takeaway: Converting REF to RREF means scaling each pivot to 1 and using upward elimination to zero out all entries above each pivot, working from bottom to top.