You are about to erase your work on this activity. Are you sure you want to do this?
Updated Version Available
There is an updated version of this activity. If you update to the most recent version of this activity, then your current progress on this activity will be erased. Regardless, your record of completion will remain. How would you like to proceed?
Mathematical Expression Editor
Elementary Row Operations and the Determinant
When we first introduced the determinant we motivated its definition for a matrix
by the fact that the value of the determinant is zero if and only if the matrix is
singular. We will soon be able to generalize this result to larger matrices, and will
eventually establish a formula for the inverse of a nonsingular matrix in terms of
determinants.
Recall that we can find the inverse of a matrix or establish that the inverse does not
exist by using elementary row operations to carry the given matrix to its reduced
row-echelon form. In order to start relating determinants to inverses we
need to find out what elementary row operations do to the determinant of a
matrix.
The Effects of Elementary Row Operations on the Determinant
Recall that there are three elementary row operations:
(a)
Switching the order of two rows
(b)
Multiplying a row by a non-zero constant
(c)
Adding a multiple of one row to another
Elementary row operations are used to carry a matrix to its reduced row-echelon
form. In Practice Problem prob:elemrowopsreverse we established that elementary row operations are
reversible. In other words, if we know what elementary row operations carried to ,
we can undo each operation with another elementary row operation to carry back to .
This will prove useful for computing the determinant. Computing the determinant of
is easy. (Why?) If we know what elementary row operations carry back to , and what
effect each of these operations has on the determinant of , we could find the
determinant of .
Let
Find .
Construct matrix by switching the first and the third rows of .
Find .
Next, try switching consecutive rows. Construct matrix by interchanging the second
and third rows of .
Find .
It appears that switching any two rows of a matrix produces a determinant that is
negative of the determinant of the original matrix.
Next, construct matrix by multiplying the last row of by .
Find .
It turns out that multiplying the first or the second row of by yields exactly the
same result as this.
Finally, construct matrix by adding twice row 3 to row 1.
Find .
This result is particularly surprising. Try a few more variations of this example to
convince yourself that adding a multiple of one row to another row does not appear
to affect the determinant.
The following theorem generalizes our observations.
Let be an matrix.
(a)
If is obtained from by interchanging two different rows, then
(b)
If is obtained from by multiplying one of the rows of by a non-zero
constant . Then
(c)
If is obtained from by adding a multiple of one row of to another row,
then
Suppose rows and of are the same. Let be a matrix
obtained from by switching and . By Theorem th:elemrowopsanddetitem:rowswapanddet we know that . But and are
the same, so . But then . We conclude that .
Because , we have the following counterpart of Theorem th:elemrowopsanddet for columns.
Elementary Column Operations and the Determinant Let be an matrix.
(a)
If is obtained from by interchanging two different columns, then
(b)
If is obtained from by multiplying one of the columns of by a non-zero
constant . Then
(c)
If is obtained from by adding a multiple of one column of to another
column, then
Computing the Determinant Using Elementary Row Operations
What we discovered about the effects of elementary row operations on the
determinant will allow us to compute determinants without using the cumbersome
process of cofactor expansion.
Suppose that a matrix is carried to the identity matrix by a sequence of elementary
row operations listed below. Find .
Let’s take a look at what happens to the determinant of one step at a
time.
Recall that (Lemma lemma:detofid). This gives us
Therefore .
Let
Find by applying elementary row operations to reduce to its row-echelon
form.
We stop when we get to a row-echelon form of because we can see that its
determinant is (Theorem lemma:triangulardet).
The following table summarizes the effect of each elementary row operation on the
determinant.
Since the determinant of the row-echelon form of in (eq:refstep5) is , we have
Therefore
You should verify this result by direct computation using cofactors.