1. What is RREF?
RREF stands for Reduced Row Echelon Form.
A matrix is in RREF when its entries follow four specific rules. These rules make the matrix easier to interpret and help us solve systems of linear equations.
First, remind students that a matrix is a rectangular arrangement of numbers in rows and columns.
For example:
Explain that we must examine the matrix row by row and column by column to decide whether it is in RREF.
2. Why do we need RREF?
Connect this topic to the previous lesson on systems of linear equations.
RREF helps us organize equations systematically, identify leading variables, and determine whether a system has a unique solution, no solution, or infinitely many solutions.
Important teaching point: The matrix above is in row echelon form, but it is not in RREF because the leading 1 in column 3 has nonzero entries above it.
This distinction is central to the slide.
3. How to teach the four conditions
Teach one rule at a time. Ask students to check the rule against the examples at the bottom of the slide.
Rule 1: All zero rows must be at the bottom
A zero row contains only zeros.
Example:
This condition is satisfied because the row of zeros is at the bottom.
But this matrix violates the condition:
The zero row appears before a nonzero row.
Ask students: Can a matrix have no zero rows?
Yes. This rule applies only if zero rows exist.
Rule 2: The first nonzero entry in each nonzero row must be 1
This first nonzero entry is called the leading 1 or pivot 1.
Example:
Each nonzero row begins with a leading 1.
Compare it with:
The first row begins with 2, not 1, so the matrix is not in RREF.
Rule 3: Each leading 1 must be to the right of the leading 1 in the row above
This creates a staircase pattern.
The second row's leading 1 is to the left of the first row's leading 1.
Ask students: Must the leading 1 in the first row be in column 1?
No. It can appear in a later column, provided the staircase pattern is maintained.
Rule 4: Each leading 1 must be the only nonzero entry in its column
This is the rule that distinguishes reduced row echelon form from ordinary row echelon form.
This is not in RREF because the pivot in column 2 has a nonzero entry (2) above it.
Important: Non-pivot columns may contain nonzero entries. Only the columns containing leading 1s must have zeros everywhere else.
4. Explain the three examples on your slide
This is a useful activity because the slide already provides three matrices.
Example 1
Leading 1s occur in columns 1, 2, and 3.
Each pivot column contains zeros everywhere else.
The pivots move to the right.
There are no zero rows, so the zero-row condition is satisfied.
Example 2
Leading 1s occur in columns 1, 2, and 4.
The pivot columns have zeros in all other positions.
The zero row is at the bottom.
Column 3 contains 7 and 4, which is allowed because it is not a pivot column.
Students commonly confuse these two forms. Explain that RREF has all the requirements of row echelon form plus the additional requirement that each pivot column has zeros above and below its leading 1.
Property | Row echelon form (REF) | Reduced row echelon form (RREF) |
|---|---|---|
Zero rows at bottom | Yes | Yes |
Leading entries are 1 | Not necessarily | Yes |
Pivots move right down the rows | Yes | Yes |
Zeros below each pivot | Yes | Yes |
Zeros above each pivot | Not required | Yes |
Pivot is the only nonzero entry in its column | Not required | Yes |
Explanation of the Three Matrix Transformations
These three examples demonstrate an important concept in your Linear Algebra syllabus: how to convert a matrix into Reduced Row Echelon Form (RREF).
The main idea is to make each leading 1 the only nonzero entry in its column, while maintaining the correct row order.
Example 1: Eliminate the 3 above a pivot
Left matrix → Right matrix
What is happening?
The leading 1 in row 2, column 2 is already in the correct position. However, there is a 3 above it in row 1, column 2.
For RREF, the pivot column must contain zeros everywhere except at the leading 1.
How do we remove the 3?
Perform the row operation:
Here, \(R_1\) means row 1 and \(R_2\) means row 2.
Calculate the new first row:
The other rows remain unchanged.
Point: Subtracting three times row 2 from row 1 eliminates the 3 without changing the leading 1 in row 1.
Example 2: Move the pivot row upward
What is happening?
The leading 1 in row 3 is in column 2, but row 2 already has its leading 1 in column 2.
This violates the staircase condition: the leading 1 of a lower row must be to the right of the leading 1 of the row above.
How do we correct it?
Subtract row 2 from row 3:
Calculate:
[0,1,4,1]-[0,1,4,0] =[0,0,0,1]
Therefore, the new third row becomes:
[0,0,0,1]
The leading 1 now appears in column 4, which is to the right of the pivots in columns 1 and 2.
Point: When two rows have their leading 1s in the same column, use row operations to eliminate the lower leading entry and create the correct staircase pattern.
Example 3: Move a nonzero row above a zero row
The left matrix is:
The third row is a zero row, but the fourth row is nonzero.
What is wrong?
A matrix in RREF must have all zero rows at the bottom. The nonzero fourth row must therefore be moved above the zero row.
How do we correct it?
Interchange rows 3 and 4:
The result is:
Now the nonzero row is above the zero row, and the leading 1s occur in columns 1, 4, and 6. The pivot columns contain zeros everywhere else.
Point: A row interchange changes the order of the rows without changing the solution set of the corresponding system.
Summary for students
Example | Problem | Row operation |
|---|---|---|
1 | Nonzero entry above a pivot | \(R_1\rightarrow R_1-3R_2\) |
2 | Duplicate pivot column in consecutive rows | \(R_3\rightarrow R_3-R_2\) |
3 | Zero row above a nonzero row | \(R_3\leftrightarrow R_4\) |
Remember the three basic elementary row operations:
Row interchange: Swap two rows, \(R_i\leftrightarrow R_j\).
Row scaling: Multiply a row by a nonzero constant, \(R_i\rightarrow kR_i\).
Row replacement: Add a multiple of one row to another, \(R_i\rightarrow R_i+kR_j\).
These operations are used to transform a matrix into RREF without changing the solution set of its system of linear equations



















