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.

The proof of this theorem is relegated to Tedious Proofs Concerning Determinants. For a sketch of the proof, you can watch this video:
_

The following lemma is a useful consequence of parts item:rowswapanddet and item:rowconstantmultanddet of Theorem th:elemrowopsanddet.

We will prove Part item:det0lemma1. Parts item:det0lemma3 and item:det0lemma2 are left as exercises.

Proof of Part item:det0lemma1
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.

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.

Practice Problems

Let be an matrix. Show that
Prove Lemma lemma:det0lemmaitem:det0lemma2.
Apply item:rowconstantmultanddet of Theorem th:elemrowopsanddet to a matrix that has two identical rows.
Prove that if one row of a matrix is a linear combination of two other rows of the matrix, then the determinant of the matrix is 0.
Find using elementary row operations.
Answer:
Answer:
Each of the following matrices is an elementary matrix.
See Definition def:elemmatrix.
(a)
What elementary row operation does this matrix perform?
(b)
Compute the determinant of the matrix in two different ways:
(i)
By cofactor expansion.
(ii)
By thinking about how the given matrix was obtained from the identity matrix.
Answer:
Answer:
Answer: