← Back to Math 010

2.2 Evaluating Determinants by Row Reduction: Class Notes

Theorem 2.2.1

Let A be a square matrix. If A has a row of zeros or a column of zeros, then det(A)=0.

Theorem 2.2.2

Let A be a square matrix. Then det(A)=det(AT).

Theorem 2.2.3 Elementary Row Operations

Let A be an n×n matrix.

a) If B is the matrix that results when a single row or single column of A is multiplied by a scalar k, then det(B)=kdet(A).

b) If B is the matrix that results when two rows or two columns of A are interchanged, then det(B)=−det(A).

c) If B is the matrix that results when a multiple of one row of A is added to another or when a multiple of one column is added to another, then det(B)=det(A).

Proof of (a)

Let B be the matrix that results from multiplying the ith row of A by k. By expanding along the ith row,

det(A)=∑l=1nailCil

The entries of row i of B are bil=kail, and B has the same cofactors Cil along row i as A (they are computed with row i deleted, and the other rows are unchanged). So

det(B)=∑l=1nbilCil=∑l=1nkailCil=k∑l=1nailCil=kdet(A)

Consider the determinant below. Its second row is 2 times the second row of the determinant on the right, so a factor of 2 comes out:

|213468572|=2|213234572|

Note

Multiplying a matrix by 2 multiplies every entry: if A=[abcd], then 2A=[2a2b2c2d]. But 2 times a determinant multiplies just one row:

2|abcd|=2(ad−bc)

So det(2A)=(2a)(2d)−(2b)(2c)=4(ad−bc), not 2det(A).

Theorem 2.2.4

Let E be an n×n elementary matrix.

a) If E results from multiplying a single row of In by a nonzero number k, then det(E)=k.

b) If E results from interchanging two rows of In, then det(E)=−1.

c) If E results from adding a multiple of one row of In to another, then det(E)=1.

This is a special case of Theorem 2.2.3, applied to A=In, since det(In)=1.

#12

Evaluate the determinant of the matrix by first reducing the matrix to row echelon form and then using some combination of row operations and cofactor expansion.

[1−30−2415−22]

Solution

Adding a multiple of one row to another doesn’t change the determinant (Theorem 2.2.3 (c)). R2→R2+2R1 and R3→R3−5R1:

|1−30−2415−22|=|1−300−210132|

R3→R3+132R2:

=|1−300−2100172|

Tip: Use R3→R3+(multiple)R2, not R3→2R3+…: multiplying the row being replaced by 2 would also multiply the determinant by 2.

This is upper triangular, so by Theorem 2.1.2 the determinant is 1(−2)(172)=−17.

Or, with row operations: factor −2 out of row 2 and 172 out of row 3 (Theorem 2.2.3 (a)):

=(−2)(172)|1−3001−12001|=−17

For example, call the determinant with −2 in row 2 B and the one with 1 in row 2 A (before factoring 172). Row 2 of B is row 2 of A times −2, so det(B)=−2det(A).

Answer: −17

#16

In #16 and 20, evaluate the determinant, given that |abcdefghi|=−6.

|ghidefabc|

Solution

This is the given determinant with R1↔R3. Interchanging two rows changes the sign (Theorem 2.2.3 (b)):

|ghidefabc|=−(−6)

Answer: 6

#20

|abc2d2e2fg+3ah+3bi+3c|

Solution

This comes from the given determinant by R2→2R2, which multiplies the determinant by 2, and R3→R3+3R1, which doesn’t change the determinant. So

|abc2d2e2fg+3ah+3bi+3c|=2(−6)

Answer: −12

Theorem 2.2.5

If A is a square matrix with two proportional rows or two proportional columns, then det(A)=0.

Because a row operation (adding a multiple of one of the proportional rows to the other) will yield a row of zeros (or a column of zeros, for proportional columns). That row operation doesn’t change the determinant, so det(A)=0 by Theorem 2.2.1.

Proof of Theorem 2.2.3 (b)

Mathematical induction.

Base case: 2×2. Let A=[abcd]. Then det(A)=ad−bc. Let A′=[cdab]. Then det(A′)=cb−ad=−det(A).

Inductive step: Assume n>2 and that the row-interchange property holds for matrices smaller than n×n.

Let A be an n×n matrix and B be the matrix resulting from interchanging rows i and j of A (or columns). Expanding along a row k with k≠i and k≠j (row k is the same in A and B) uses cofactors

(−1)k+r|Akr|and(−1)k+r|Bkr|

where |Akr| and |Bkr| are determinants. Bkr is Akr with two rows interchanged, and since these are of size (n−1)×(n−1), the induction hypothesis gives |Bkr|=−|Akr|: the cofactors have opposite signs. Cofactor expansion yields det(A)=−det(B).

Proof of Theorem 2.2.3 (c)

Let a→i=[ai1 ai2 ⋯ ain] be the ith row of A. Let B be the same as A except that the jth row (j≠i) results from adding ka→i to a→j, the jth row of A. Then

b→j=[kai1+aj1  kai2+aj2  ⋯  kain+ajn]

Since every row of B other than row j is the same as in A, the minors |Ajr| and |Bjr| are equal for each r, so A and B have the same cofactors Cjr along row j. Expanding along row j:

det(B)=∑r=1nbjrCjr=∑r=1n(kair+ajr)Cjr=∑r=1nkairCjr+∑r=1najrCjr=kdet(D)+det(A)

where D is the matrix obtained by replacing the jth row of A with the ith row of A. Thus the ith row of D and the jth row of D are equal. By part (b), we can interchange rows i and j of D to show

det(D)=−det(D) ⇒ det(D)=0 ⇒ det(B)=det(A)