Lecture 2: Echelon Form and Reduced Echelon Form
- All zero rows are below all nonzero rows.
- The leading entry of of each row to be to the right of the leading entry of the row above.
Example 1
For example, this matrix is in Row Echelon Form:
- The leading entries are all 1..
- The leading entries are the only non-zero entries in their column.
Example 2
The same matrix from example 1 is not in RREF because column 2 for example still has non-zero entries above its leading entry.
- \(R_i \leftrightarrow R_j \)
- \(cR_i\) where \(c \neq 0\)
- \(R_i \rightarrow R_i + cR_j\)
Proof: by construction (Gaussian Elimination) … TODO?
Example 3
Consider the system with augmented matrix as follows:
The last row has a single non-zero entry in the last column. This tells us that this system will not have a solution. To see this, translate back the system of linear equations
We can see here that \(0=1\) has no solutions.
Example 4
Consider the system with augmented matrix as follows:
The last row has has all zeros. This tells us that we will have infinitely many solutions. To see this, translate back the system of linear equations
This time we have infinitely many solutions. The convention is to look for a column without a leading entry like Column 3. The convention is to use the third variable \(x_3\) to parameterize the solution set. so set \(x_3 = t\), then
The solution set is \((x_1,x_2,x_3) = \{(t, t, 0) | t \in \mathbf{R}\}\).
Example 5
Consider the system with augmented matrix as follows:
This is a system of three equations in 5 unknowns. Column one is \(x_1\), column two is \(x_2\) and so on. This matrix is also in Row Reduced Echelon Form because the leading entries are 1 and the leading entries are the only non-zero entries in their columns. Also, we don’t have a leading entry in the very last column so we do have a solution. This translates to the system of linear:
We have infinitely many solutions. So we’ll go by the convention which is to look for the columns without a leading entries and assign them variables. Here, columns 2 and 4 have no leading entries so set \(x_2 = t_1\) and \(x_4 = t_2\). This means that \(x_3 = 3 - 3t_2\) and \(x_1 = 2 - 2t_1 - t_2\). Writing this a solution vector:
References:
- Math416 by Ely Kerman