Reduced Row Echelon Form: Definition
You'll learn what makes a matrix in reduced row echelon form, going beyond the basic row echelon form requirements.
Beyond Row Echelon Form
You already know that a matrix is in row echelon form (REF) when:
- All leading entries (pivots) are to the right of the leading entry in the row above
- Any all-zero rows are at the bottom
- All entries below a pivot are zero
Reduced row echelon form (RREF) takes this further by requiring two additional conditions that make the matrix even cleaner and more standardized.
The Two Extra Requirements
A matrix is in reduced row echelon form if it's in row echelon form AND:
-
Every leading entry (pivot) equals 1
- Not 2, not -5, but exactly 1
-
Every leading entry is the only non-zero entry in its column
- All entries above AND below each pivot must be zero
- (Below is already guaranteed by REF; now we require above too)
Example Comparison
Row Echelon Form (but NOT reduced):
[2 4 6]
[0 3 9]
[0 0 1]
Reduced Row Echelon Form:
[1 0 0]
[0 1 0]
[0 0 1]
Think of RREF as the "cleanest possible staircase" — not only does it step down cleanly, but each step is exactly height 1, and there's nothing cluttering the space directly above each step.
Why This Matters
RREF is unique for any matrix — there's only one RREF for a given matrix. This makes it perfect for solving systems: the solution can be read directly from the RREF with no back substitution needed.
Key Takeaway: Reduced row echelon form requires all pivots to be 1, and each pivot must be the only non-zero entry in its entire column (not just below, but above too).