Linear Algebra With Applications 2nd Edition Holt Solutions Manual Download

Solution Manual for Linear Algebra with Applications 2nd
Edition Holt 1464193347 9781464193347

Download full solution manual at:
https://testbankpack.com/p/solution-manual-for-linear-algebra-with-applications-2nd-
edition-holt-1464193347-9781464193347/
Download full test bank at:

https://testbankpack.com/p/test-bank-for-linear-algebra-with-applications-2nd-edition-
holt-1464193347-9781464193347/
Chapter 5
Determinants
5.1 Practice Problems

1 3
1. (a) C23 = (−1)2+3 |M23 | = − = − ((1)(−1) − (3) (5)) = 16.
5 1
−
3+1 3 −2 = 3 (−4) − (−2) 0 = −12.

C31 = (−1) |M31 | = 0 −4
2 0 2
(b) C31 = (−1)2+3 |M23 | = − 3 1 3 =
( [ ] 2[ 2 3] [ ])
− 2 det 1 3 3 3 3 1
2 3 − (0) det
=
2 3 + 2 det 2 2
− (2 (−3) + 2 (4)) = −2.

0 −1 2
C31 = (−1)3+1 |M31 | = 1 1 2 =
[ ] 2 1 3 [ ]
1 2 [ ] 1 1
1 2
(0) det 1 3 − (−1) det 2 3 + 2 det 2 1 =
0 − 1 + 2 (−1) = −3.
2. (a) Using the first row,
] 11 +(1)C12 +(0)C13 = (3)(−1) |M11 |+(1)(−1) |M12 | =
1+1 1+2
det(A)[ = a11 C11
] +a12 C12 +a[13 C13 = (3)C
2 −2 2 −2
3 det + ( 1) det = 3 (8) + ( 1) (14) = 10. Because det(A) = 0, A is invert-
− −
1 3 4 3
ible, and T is also invertible.
(b) Using the last column,
5 2 1
det(A) = a34 C34 +a44 C44 = (2)(−1)3+4 |M34 |+(2)(−1)4+4 |M44 | = (−2) +2 3 1 2 =
−1 3 4
5 2 1
3 1 2
4 0 1
(−2) (11) + 2 (−28) = −78. Because det(A) = 0, A is invertible, and T is also invertible.
([ ])
3 a = 3 (3) − a (1) = 0 ⇒ a = 9. A is not invertible if a = 9.
3. (a) det 1 3
([ ])
a 1 2 √
(b) det 0 a 3 = 2a2 + 4a + 3 = 0 ⇒ a = −1 ± 12 i 2. A is not invertible if a =
1 −2
2
√
−1 ± 12 i 2.
([ ]) ([ ])
4. (a) det (A) = det 2 −5 ( T) 2 1
= 17. det A = det = 17
1 6 −5 6
489
490 Section 5.1: The Determinant Function Chapter 5: Determinants 490
([ ]) ([ ])
1 2 −5 ( ) 1 −3 2
(b) det (A) = det −3 1 4 = 29. det A T
= det 2 1 −1 = 29.
2 −1 2 −5 4 2
([ ] [ ]) ([ ])
2 3 1 0 2−λ 3 2
5. (a) det (A − λI2 ) = det −λ = det = λ + 2λ − 11 = 0
1 −4 0 1 −4 − λ
1
√
√
⇒ λ = −1 + 2 3, or λ = −1 − 2 3
([ ] [ ]) ([ ])
1 4 1 0 1−λ 4 2
(b) det (A − λI2 ) = d − λ = det = λ − 2λ + 9 = 0

et −2 1 0 −2 1−λ
1
√ √
⇒ λ = 1 + 2i 2, or λ = 1 − 2i 2
6. (a) True. Use the zero row to compute the determinant, then det (A) = 0, and A is not invertible.
[ ]
0 0
(b) False. For example, if A = , then det (A) = 0, but T is not one-to-one.
0 0
(c) False. det (3A) = 34 det (A) = 81 det (A) . (The statement is only true if det (A) = 0.)
[ ] [ ]
1 0 0 1
(d) False. For example, if A = and B = , then A B by interchanges rows, but
0 1 1 0
∼
det (A) = 1 and det (B) = −1.
5.1 The Determinant

Function
[ ] [ ]
7 0 0 −4
1. M23 = 5 1 , M31 = 6 2
[ ] [ ]
−5 3 3 1
2. M23 = 4 4 , M31 = 2 2
[ ] [ ]
6 1 5 1 −1 5
3. M23 = 7 1 1 , M31 = 2 3 0
4 3 2 3 1 2
[ ] [ ]
0 −2 0 −2 4 0
4. M23 = 0 2 0 , M31 = 1 −1 0
3 6 6 6 1 6
4 3 1 0 3 0
3 2 4 4 1 2 1 5
5. M23 = 2 0
1 0
5 2 , M31 = 1 0 0
1 3 3
2 0 2 4 1 0
0 0
1 1 0 1 0 1 0 1
6. M23 =
8 5 4 2 , M31 = 7 9 4 5
2 1 3 1 5 3 4 1
2 3
6 3 1 3
0 −1
7. C13 = (−1)1+3 |M13 | = = (0)(0) − (−1)(4) = 4,
4
2 3
C22 = (−1)2+2 |M22 | = 0

= (2)(1) − (3)(4) = −10
2 −1
8. C13 = (−1)1+3 |M13 | = = (2)(4) − (−1)(3) = 11,
3 4
6 0
C22 = (−1)2+2 |M22 | = = (6)(1) − (0)(3) = 6
3 1
4 3
9. C13 = (−1)1+3 |M13 | = = (4)(1) − (3)(1) = 1,
1 1
C22 = (−1) 2+2 |M22 | = 6 2 = (6)(1) − (2)(1) = 4
1 1
10. C13 = (−1)1+3 |M13 | = 3 2 = (3)(0) − (2)(4) = −8,

4 0
0 −1
C22 = (−1)2+2 |M22 | = = (0)(2) − (−1)(4) = 4
4 2
11. (a) Using the second row,

1 −3
det(A) = a21 C21 + a22 C22 + a23 C23 = (0)C21 + (4)C22 + (0)C23 = (4)(−1)2+2 |M22 | = (4) =
5 0
(4)((1)(0) − (−3)(5)) = (4)(15) = 60.
(b) Using the third column,
det(A) = a13 C13 +a23 C23 +a33 C33 = (−3)C13 +(0)C22 +(0)C33 = (−3)(−1)1+3 |M13 | = (−3) 0 4 =
5 1−
(−3)((0)(−1) − (4)(5)) = (−3)(−20) = 60
Since det(A) = 0, A is invertible, and hence T is invertible.

5 0
det(A) = a11 C11 +a12 C12 +a13 C13 = (−2)C11 +(0)C12 +(0)C13 = (−2)(−1)1+1 |M11 | = (−2) =
0 6
(−2)((5)(6) − (0)(0)) = (−2)(30) = −60.
−2 0
det(A) = a13 C13 + a23 C23 + a33 C33 = (0)C13 + (0)C22 + (6)C33 = (6)(−1)3+3 |M33 | = (6) =
4 5
(6)((−2)(5) − (0)(4)) = (6)(−10) = −60
Since det(A) = 0, A is invertible, and hence T is invertible.

det(A) = a21 C21 + a22 C22 + a23 C23 + a24 C24 = (0)C21 + (3)C22 + (2)C23 + (0)C24 =
−1 −1 2 −1 1 2
(3)(−1)2+2 |M22 | + (2)(−1)2+3 |M23 | = (3) 1 0 1 − (2) 1 4 1 = 20.
0 3 −1 0 −1 −1
(b) Using the first column,
det(A) = a11 C11 + a21 C21 + a31 C31 + a41 C41 = (−1)C11 + (0)C21 + (1)C31 + (0)C41 =
3 2 0 1 −1 2
(−1)(−1)1+1 |M11 | + (1)(−1)3+1 |M31 | = (−1) 4 0 1 + (1) 3 2 0 = 20. Since
−1 3 −1 −1 3 −1
det(A) = 0, A is invertible, and hence T is invertible.

2 0 1 1 0 1 1 2 1
(2)(−1) 1+1
|M11 |+(1)(−1) 1+2
|M12 |+(3)(−1) 1+3
|M13 | = (2) 2 0 1 −(1) 4 0 1 +(3) 4 2 1 =
1 2 0 0 2 0 0 1 0
3.
1 2 1 2 1 0
(3)(−1)1+3 |M13 | + (2)(−1)4+3 |M43 | = (3) 4 2 1 − (2) 1 2 1 = 3. Since det(A) = 0, A is
0 1 0 4 2 1
invertible, and hence T is invertible.

det(A) = a11 C11 + a12 C12 + a13 C13 + a14 C14 = (−1)C11 + (1)C12 + (0)C13 + (0)C14 =
3 3 2 2 3 2
(−1)(−1)1+1 |M11 | + (1)(−1)1+2 |M12 | = (−1) −1 0 5 − (1) 0 0 5 = 51.
1 4 −1 3 4 −1
−1 1 0 −1 1 0
(3)(−1)1+3 |M13 |+(4)(−1)4+3 |M43 | = −(3) 2 3 2 = 51. Since det(A) =
0 −1 5 −(4)
3 1 −1 0 −1 5
0, A is invertible, and hence T is invertible.

det(A) = a21 C21 + a22 C22 + a23 C23 + a24 C24 = (3)C21 + (0)C22 + (−1)C23 + (0)C24 =
2 5 4 0 2 4
(3)(−1)2+1 |M21 | + (−1)(−1)2+3 |M23 | = −(3) 1 −2 1 − (−1) 1 1 1 = −14.
0 3 0 −2 0 0
(b) Using the second column,
3 −1 0 0 5 4
(2)(−1) 1+2 |M12 |+(1)(−1) 3+2 |M32 | = −(2) 3 −1 0 = −14. Since det(A) =
1 −2 1 −(1)
−2 3 0 −2 3 0
0, A is invertible, and hence T is invertible.
17. (a) Using the third row,
det(A) = a31 C31 + a32 C32 + a33 C33 + a34 C34 + a35 C35 = (0)C31 + (−1)C32 + (0)C33 + (0)C34 + (1)C35 =
4 1 0 1 4 2 1 0
(−1)(−1)3+2 |M32 | + (1)(−1)3+5 |M35 | = −(−1) + (1) = 8.
0 −1 1 2 0 3 −1 1
0 2 0 3 0 1 2 0
0 1 0 1 0 0 1 0
(b) Using the first column,

det(A) = a11 C11 + a21 C21 + a31 C31 + a41 C41 + a51 C51 = (4)C11 + (0)C21 + (0)C31 + (0)C41 + (0) C51 =
3 −1 1 2
(4)(−1)1+1 |M11 | = (4) = 8. Since det(A) = 0, A is invertible, and hence T is
−11 02 00 13
0 1 0 1
invertible.
18. (a) Using the fourth row,
det(A) = a41 C41 + a42 C42 + a43 C43 + a44 C44 + a45 C45 = (0)C41 + (0)C42 + (1)C43 + (2)C44 + (0)C45 =
1 −1 1 0 1 −1 0 0
(1)(−1)4+3 |M43 | + (2)(−1)4+4 |M44 | = −(1) + (2) = 1.
3 0 −1 1 3 0 0 1
−1 1 −2 0 −1 1 0 0
2 0 0 1 2 0 −2 1
det(A) = a13 C13 + a23 C23 + a33 C33 + a43 C43 + a53 C53 = (0)C13 + (0)C23 + (0)C33 + (1)C43 + (−2) C53 =
5+3
(1)(−1)4+3 |M43 | + (−2) (−1) |M53 | =
1 −1 1 0 1 −1 1 0
3 0 −1 1 3 0 −1 1
−(1) + (−2) = 1. Since det(A) = 0, A is invertible, and
−1 1 −2 0 −1 1 −2 0
2 0 0 1 0 0 2 0
hence T is invertible.
19. det (A) = (4) (2) − (6) (−1) = 14.
20. det (A) = (5) (−2) − (1) (−3) = −7.
21. A is not a square matrix, so det (A) is not defined.
22. A is not a square matrix, so det (A) is not defined.

23. det (A) = (3) (0) (1) + (1) (4) (1) + (−1) (2) (6) − (−1) (0) (1) − (3) (4) (6) − (1) (2) (1) = −82.
24. det (A) = (2) (4) (−2) + (2) (1) (3) + (3) (−1) (1) − (3) (4) (3) − (2) (1) (1) − (2) (−1) (−2) = −55.
25. The shortcut method is not applicable for 4 × 4 matrices.
26. The shortcut method is not applicable for 4 × 4 matrices.
([ ])
2 3
27. det 6 a = 2a − 18 = 0 ⇒ a = 9. A is not invertible if a = 9.
([ ])
12 a
28. det a 3 = 36 − a2 = 0 ⇒ a = ±6. A is not invertible if a = −6 or a − 6.
([ ])
a a
29. det 3 −1 = −4a = 0 ⇒ a = 0. A is not invertible if a = 0.
([ ])
a −3
30. det 2 a = a2 + 6 = 0 has no solutions a ∈ R. A is invertible for all a ∈ R.
([ ])
1 −1 3
31. det 0 a −2 = 12 − 3a = 0 ⇒ a = 4. A is not invertible if a = 4.
2 4 3
([ ])
−1 2 a
32. det 0 1 1 = 7 − 3a = 0 ⇒ a = 7 . A is not invertible if a = 7 .
3 3
3 0 −1
([ ])
1 a −2
33. det −1 0 1 = a2 − 4a + 3 = (a − 1) (a − 3) = 0 ⇒ a = 1 or a = 3. A is not invertible
a 3 −4
if a = 1 or a = 3.
([ ])
0 4 a
34. det a 1 3 = a3 − 4a = a (a − 2) (a + 2) = 0 ⇒ a = 0, a = 2, or a = −2. A is not
0 a 1
invertible if a = 0, a = 2, or a = −2.
35. Since A is triangular, det (A) = (2) (−1) (1) (4) = −8, the product along the diagonal.
36. Since A is triangular, det (A) = (3) (−2) (1) (5) = −30, the product along the diagonal.
37. det (A) = 0, since the third column of A contains all zeroes.
38. det (A) = 0, since the second row of A contains all zeroes.
39. det (A) = 0, since the first and third rows of A are identical.
40. det (A) = 0, since the first and fourth columns of A are identical.
([ ]) ([ ])
3 −2 ( T) 3 4
41. det (A) = det 4 1 = 11, det A = det −2 1 = 11.
([ ]) ([ ])
6 1 6 2
2 ( ) 3
42. det (A) = det = 16, det AT = det = 16.
3 1
([ ]) ([ ])
0 7 1 ( ) 0 2 4
43. det (A) = det 2 3 1 = 28, det A T
= det 7 3 −1 = 28.
4 −1 −1 1 1 −1
([ ]) ([ ])
−1 2 1 ( ) −1 2 1
44. det (A) = det 2 −1 0 = −11, det A T
= det 2 −1 0 = −11.
1 0 4 1 0 4
([ ] [ ]) ([ ])
2 4 1 0 2−λ 4
45. det (A − λI2 ) = det −λ = det = λ2 − 5λ − 14 = 0 ⇒
5 3 0 1 5 3−λ
(λ + 2) (λ − 7) = 0 ⇒ λ = −2 or λ = 7.
([ ] [ ]) ([ ])
0 3 −λ 1 0 −λ 3
46. det (A − λI2 ) = det
5 2 0 1 = det
5 2−λ = λ2 − 2λ − 15 = 0 ⇒
(λ + 3) (λ − 5) = 0 ⇒ λ = −3 or λ = 5.
([ ] [ ]) ([ ])
1 0 −λ 1 0 1−λ 0
47. det (A − λI2 ) = det = det = λ2 − 2λ + 1 = 0 ⇒
−5 1 0 1 −5 1−λ
2
(λ − 1) = 0 ⇒ λ = 1.
([ ] [ ]) ([ ])
3 −6 1 0 3−λ −6 2
48. det (A − λI2 ) = det −λ = det = λ − 2λ + 9 = 0 has
2 −1 0 1 2 −λ − 1
no real solutions, since the discriminant (−2)2 − 4(1)(9) = −32 < 0.

([ ] [ ]) ([ ])
1 0 0 1 0 0 1−λ 0 0
49. det (A − λI3 ) = det 5 3 0 −λ 0 1 0 = det 5 3−λ 0
−4 7 −2 0 0 1 −4 7 −2 − λ
= (1 − λ) (3 − λ) (−2 − λ) = 0 ⇒ λ = 1, λ = 3, or λ = −2.
([ ] [ ]) ([ ])
−5 −2 −3 1 0 0 −5 − λ −2 −3
50. det (A − λI3 ) = det 0 0 6 −λ 0 1 0 = det 0 −λ 6
0 0 4 0 0 1 0 0 4−λ
= (−5 − λ) (−λ) (4 − λ) = 0 ⇒ λ = −5, λ = 0, or λ = 4.

([ ] [ ]) ([ ])
0 2 0 1 0 0 −λ 2 0
51. det (A − λI3 ) = det 1 0 2 −λ 0 1 0 = det 1 −λ 2 = 8 − λ3 =
2 −1 0 0 0 1 2 −1 −λ
0 ⇒ λ = 2.
([ ] [ ]) ([ ])
0 1 2 1 0 0 −λ 1 2
52. det (A − λI3 ) = det 1 1 1 −λ 0 1 0 = det 1 1−λ 1 = −λ3 + λ2 +
2 −1 0 0 0 1 2 −1 −λ
4λ − 4 = − (λ − 1) (λ − 2) (λ + 2) = 0 ⇒ λ = −2, λ = 1, or λ = 2.
([ ]) ([ ])
3 5 −2 4
53. (a) det = 22; interchanging rows, det = 22. Interchanging rows
−
−2 4 3 5
changes the sign of the determinant.
([ ]) ([ ])
1 2 −1 3 0 2
(b) det 3 0 2 = 1; interchanging rows 1 and 2, det 1 2 −1 = −1. Interchang-

0 1 −1 0 1 −1
ing rows changes the sign of the determinant.

([ ]) ([ ])
1 0 2 1
54. (a) det = 1; interchanging rows, det = 1. Interchanging rows changes the
−
2 1 1 0
sign of the determinant.
([ ]) ([ ])
2 2 1 1 −1 2
(b) det 1 −1 2 = 5; interchanging rows 1 and 2, det 2 2 1 = −5. Interchang-
1 0 0 1 0 0
([ ]) ([ ])
3 1 0 1 2 3
55. (a) det 1 2 3 = −13; interchanging rows 1 and 2, det 3 1 0 = 13. Interchanging
0 2 1 0 2 1
rows changes the sign of the determinant.

([ ]) ([ ])
4 −1 0 1 1 1
(b) det 0 2 1 = 3; interchanging rows 1 and 3, det 0 2 1 = −3. Interchang-

1 1 1 4 −1 0

([ ]) ([ ])
0 −1 1 0 −1 1
56. (a) det −1 2 1 = −15; interchanging rows 2 and 3, det 4 0 3 = 15. Inter-
4 0 3 −1 2 1
changing rows changes the sign of the determinant.

([ ]) ([ ])
3 2 1 0 1 1
(b) det 0 1 1 = −6; interchanging rows 1 and 2, det 3 2 1 = 6. Interchang-

0 0 −2 0 0 −2

([ ]) ([ ])
3 5 9 15
57. (a) det = 22; multiplying row 1 by 3, det = 66. Multiplying a row by
−2 4 −2 4
3 causes the determinant to be multiplied by 3, and we conjecture that multiplying a row by c
multiplies the determinant by c.
([ ]) ([ ])
1 2 −1 3 6 −3
(b) det 3 0 2 = 1; multiplying row 1 by 3, det 3 0 2 = 3. Multiplying a row
0 1 −1 0 1 −1
by 3 causes the determinant to be multiplied by 3, and we conjecture that multiplying a row by
c multiplies the determinant by c.
([ ]) ([ ])
1 0 3 0
58. (a) det = 1; multiplying row 1 by 3, det = 3. Multiplying a row by 3 causes
2 1 2 1
the determinant to be multiplied by 3, and we conjecture that multiplying a row by c multiplies
the determinant by c.
([ ]) ([ ])
2 2 1 6 6 3
(b) det 1 −1 2 = 5; multiplying row 1 by 3, det 1 −1 2 = 15. Multiplying a
1 0 0 1 0 0
row by 3 causes the determinant to be multiplied by 3, and we conjecture that multiplying a row
by c multiplies the determinant by c.
([ ]) ([ ])
3 1 0 3 1 0
59. (a) det 1 2 3 = −13; multiplying row 2 by 3, det 3 6 9 = −39. Multiplying a
0 2 1 0 2 1
row by 3 causes the determinant to be multiplied by 3, and we conjecture that multiplying a row
by c multiplies the determinant by c.
([ ]) ([ ])
4 −1 0 4 −1 0
(b) det 0 2 1 = 3; multiplying row 2 by 3, det 0 6 3 = 9. Multiplying a row
1 1 1 1 1 1
by 3 causes the determinant to be multiplied by 3, and we conjecture that multiplying a row by
c multiplies the determinant by c.
([ ]) ([ ])
0 −1 1 0 −1 1
60. (a) det −1 2 1 = −15; multiplying row 3 by 3, det −1 2 1 = −45. Multi-
4 0 3 12 0 9
plying a row by 3 causes the determinant to be multiplied by 3, and we conjecture that multiplying
a row by c multiplies the determinant by c.
([ ]) ([ ])
3 2 1 9 6 3
(b) det 0 1 1 = −6; multiplying row 1 by 3, det 0 1 1 = −18. Multiplying
0 0 −2 0 0 −2
a row by 3 causes the determinant to be multiplied by 3, and we conjecture that multiplying a
row by c multiplies the determinant by c.
[ ]
12 0 .
61. For example, A =
0 1
[ ]
7 0 0
62. For example, A = 0 1 0 .
0 0 3
[ ]
1 4 .
63. For example, A =
1 1
[ ]
1 1 1
64. For example, A = 1 2 2 .
1 2 −3
[ ]
5 −1 π
65. For example, A = e 0 4 .
2 6 −3
1 −2 π 1
3 1 4 0
66. For example, A = 4 5 0 e .
−1 7 3 6
[ ]
π 0 5
67. For example, A = 8 1 0 .
0 e 1
[ ]
0 π 2
68. For example, A = −1 6 0 .
1 0 1
[ ]
1 3 1
69. (a) False. Every square matrix has a determinant, but nonsquare matrices such as A = 2 1 7
do not.
(b) False. The cofactors are scalars, not matrices.
[ ]
1 2
70. (a) False. Consider A = , which has det (A) = 1.
−
1 1
(b) True, by Theorem 5.8(a).
[ ]
0 1
71. (a) False. Consider A = , with det (A) = 0.
0 0
[ ] [ ]
1 0 0 0 0
(b) False. Consider A = 0 1 0 , then M31 = is not diagonal.

0 0 1 1 0
[ ]
1 1
72. (a) False. Consider A = . Then C = 1, C = 1, C = 1, and C = 1, but
1 1 11 12 − 21 − 22
det (A) = 0.
[ ] [ ]
1 0 0 0
(b) False. Consider A = and B = . Then det(A) = 0, det (B) = 0, so det (A)
−
0 0 0 −1
([ ])
1 0
det (B) = 0, but det (A − B) = det = 1.
0 1
([ ])
x y 1
73. det x1 y1 1 = xy1 −yx1 −xy2 +yx2 +x1 y2 −x2 y1 = x (y1 − y2 )+y (−x1 + x2 )+(x1 y2 − x2 y1 ) =
x2 y2 1
0 is linear in x and y, and hence gives a line. Each[point (x1 , y1 )] and (x

[ 2 , y2 ) satisfies] this equation,
x 1 y1 1 x 2 y2 1
either by direct substitution, or by observing that x1 y1 1 and x1 y1 1 have identical
x 2 y2 1 x 2 y2 1
rows, hence zero determinant. Thus, the line must pass through (x1 , y1 ) and (x2 , y2 ).
n(n−1)/2
74. Using induction, we determine det (A) = (−1) a1n a2(n− 1) · · · an1 . When n = 1,we have,
det (A) = det [a11 ] = a11 = (−1)0(0−1)/2 a11 , and the statement is true. Suppose the statement is
true
for (n − 1) × (n − 1) matrices. Then for the n × n matrix A, expanding along the first column, we have
( )
det (A) = (−1) n+1 (an1 ) (−1) (n−1)(n−2)/2 a1n a2(n−1) · · · a(n−1)2
2
2n+2+n −3n+2)/2 ( )
= (−1)( a1n a2(n −1) · · · an1
2
n −n+4)/2
( )
= (−1)( a1n a2(n−1) · · · an1
n2 −n)/2 ( )
= (−1)(
2
(−1) a1n a2(n −1) · · · an1
n(n−1)/2
( )
= (−1) a1n a2(n−1) · · · an1
and the result holds.
75. Let B be the matrix which has the same rows as A, except row j of B is the ith row of A. Then
det (B) = 0, since B has two identical rows. Using the cofactor expansion on row j of B, and
noting that the cofactors of B along row j are the same as the cofactors of A along row j, we have
det (B) = ai1 Cj1 + ai2 Cj2 + · · · + ain Cjn . Hence, ai1 Cj1 + ai2 Cj2 + · · · + ain Cjn = 0.
76. Let A be an n × n lower triangular matrix. If n = 1, then det (A) = a11 , the product along the diagonal
0
of A. Assume the result for matrices of size (n − 1)×(n − 1) and write A = Mnn .. ,
0
an1 · · · an(n−1) ann
where Mnn is a (n − 1) × (n − 1) submatrix of A, and note that Mnn is lower triangular with the same
diagonal entries as A. Using the cofactor expansion along the nth column of A, we have det (A) =
n+n n+n 2n
ann (−1) det (Mnn ). By induction, det (Mnn ) = a11 a22 · · · a(n −1)(n −1) , and since (−1) = (−1) =
1, we conclude that det (A) = a11 a22 · · · a(n−1)(n−1) ann , as desired.
77. Suppose the ith row is all zeroes, then the cofactor expansion along the ith row produces det (A) =
ai1 Ci1 + ai2 Ci2 + · · · + ain Cin = (0) Ci1 + (0) Ci2 + · · · + (0) Cin = 0. If the j th column is all zeroes,
then the cofactor expansion along the j th column produces det (A) = a1j C1j + a2j C2j + · · · + anj Cnj =
(0) C1j + (0) C2j + · · · + (0) Cnj = 0.
[ ]
a b
78. We prove by induction, beginning with n = 2. If A is 2 × 2 with identical rows, then A = a b
[ ]
a a
has determinant 0; likewise if A has identical columns, then A = b b also has determinant 0.
Now let A be n × n, and assume that the result holds for (n − 1) × (n − 1) matrices. Suppose two
rows i and j of A are identical, and consider the cofactor expansion along a row k different from i and
k+l
j, det (A) = ak1 Ck1 + ak2 Ck2 + · · · + akn Ckn . Now each Ckl = (−1) det (Mkl ), where Mkl is the
submatrix of A that corresponds to entry (k, l). Observe that this (n − 1) × (n − 1) matrix Mkl must
contain two identical rows, obtained from rows i and j of the matrix A, and hence by the induction
assumption, det (Mkl ) = 0 for all l. Therefore det(A) = 0. The proof when A has identical columns is
similar, one expands along a column different from the identical columns, and then the minors involved
are zero.
3 −4 0 5
2 1 −7 1
79. Using a computer algebra system, det 0 −3 2 2 = −26.
5 8 −2 −1
0 3 7 9
−1 4 −1 0
80. Using a computer algebra system, det = 379.
2 9 −4 3
2 3 −3 −2
3 5 0 0 2
0 1 −2 −3 −2
81. Using a computer algebra system, det 7 −2 −1 0 0 = 1215.
4 1 1 1 4
−5 −1 0 5 3
3 2 1 2 3
7 8 9 1 3
82. Using a computer algebra system, det −1 −2 3 −2 −1 = −1652.
3 6 9 6 2
4 2 1 9 4
5.2 Practice Problems

1. (a) Because A is in echelon form, det (A) = 3 (−2) (−5) = 30.
(b) Row-reduce to echelon form:
0 0 0 −2 R1 ↔R4 2 1 3 7
0 0 1 −1 R2 ↔R3 0 2 −1 7
0 2 −1 7
∼ 0 0 1 −1
2 1 3 7 0 0 0 −2
2
Thus, det(A) = (−1) (2) (2) (1) (−2) = −8.
( ) 4 4
2. (a) det A4 = (det (A)) = (3) = 81
( ) 3 2 2
(b) det −2A2 = (−2) (det (A)) = −8 (3) = −72
( ) 2 2
(c) det AB 2 = det (A) (det (B)) = 3 (−1) = 3
( )
(d) det 3A2 B = 33 (det (A))2 det (B) = 27 (3)2 (−1) = −243
2 7
3. (a) det (A) = (−1) 1 det (B) = − = −2 (−3) = 6 = 0, so A is invertible.
0 −3
2 −1 4
1
(b) det (A) = (−1) det (B) = − 0 −2 3 = − (2) (−2) (5) = 20 = 0, so A is invertible.
0 0 5
499 Section 5.2: Properties of the Determinant Chapter 5: Determinants 499
4. (a) False. Either an elementary row operation changes the sign of the determinant, leaves the deter-
minant unchanged, or multiplies the determinant by a non-zero scalar.
[ ]
1 0 ( )
(b) False. For example, A = satisfies det (A) = det A2 .
0 1
([ ] [
1 0 0 ]) ([
1 0 0 0 0 0
])
(c) False. For example, 1 = det 0 1 0 = det 0 1 0 − 0 0 0 , but
0
0 1 0 0 0 0 0 −1
([ ]) ([ ])
1 0 0 0 0 0
det 0 1 0 − det
0 0 0 = 0 − 0 = 0.
0 0 0 0 0 −1
[ ] [ ]
1 0 0 0
(d) False. For example, if A = and B = , then A is invertible, B is not, and AB
0 1 0 0
is not invertible.
5.2 Properties of the Determinant

1. Row-reduce to echelon form:
[ ] [ ]
2 8 (1/2)R1 +R2 →R2 2 8
−1 −3
∼ 0 1
Thus det(A) = (2) (1) = 2.

[ ] [ ]
9 −1 (−1/3)R1 +R2 →R2 9 −1
3 2
∼ 7
0 3
(7 )
Thus det(A) = (9) 3 = 21.
[ ] [ ]
1 −1 −3 2R1 +R2 →R2 1 −1 −3
3R1 +R3 →R3
−2 2 6 ∼ 0 0 0
−3 −3 10 [ 0 −6 1 ]
1 −1 −3
R2 ↔R3 0 −6 1
∼
0 0 0
Thus det(A) = (−1)1 (1) (−6) (0) = 0.

[ ] (1/4)R1 +R2 →R2 −4 −2

−4 2 −2 2
(3/4)R1 +R3 →R3 1 1

1 0 1 ∼ 0 2 2
3 −1 1 0 1 1
2
−2
−4 2 −2
−R2 +R3 →R3 1 1
∼ 0 2 2
1 0 0 0
(1 ) 0 0 1
Thus det(A) = (−4) 2 (−1) = 2. 0 1 0
0 1 0 0
0 0 −1
R1 ↔R2 1 0 0 0
R3 ⇔R4
∼ 0 1 0 0
0 0 0 1 0
0 0 0 0 1
2
Thus det(A) = (−1) (1) (1) (1) (1) = 1.
−3 2 −1 6 (7/3)R1 +R2 →R2 −3 2 −1 6
7 −3 2 −11 (1/3)R1 +R4 →R4 0 5

3
− 13 3
−2
∼
0 0 0 0 0 0 −2
1 0 0 −1 0 2
− 13 1
3
−3 2 −1 6
(−2/5)R2 +R4 →R4 0 5
− 31 3
∼ 3
0 0 0 −2
0 0 − 51 − 51
−3 2 −1 6
R3 ↔R4 0 5
3
− 13 3
∼
0 0 − 51 − 51
0 0 0 −2
(5)( )
Thus det(A) = (−1)1 (−3) 3 − 15 (−2) = 2.
1
7. det (A) = (−1) (1) (−4) = 4. Since det (A) = 0, A is invertible.
8. det (A) = 1
−3 (1) (3) = − 1. Since det (A) = 0, A is invertible.
1
9. det (A) = (−1) (1) (−3) (7) = 21. Since det (A) = 0, A is invertible.
1 1
10. det (A) = 1/2 (−1) (2) (−1) (6) = 24. Since det (A) = 0, A is invertible.
11. det (A) = 1

−7 (− 6) (0) (− 4) = 0. Since det (A) = 0, A is not invertible.
12. det (A) = 1

−3 ( −1) 2 (1) (4) ( −2) = 38 . Since det (A) = 0, A is invertible.
2
13. det (A) = (−1) (1) (1) (2) (4) = 8. Since det (A) = 0, A is invertible.
2
14. det (A) = 1
−5 (− 1) (1) (3) (1) (5) = − 3. Since det (A) = 0, A is invertible.
1
15. There is one row exchange, hence the value of the determinant is (−1) det (A) = (−1) (3) = −3.
2
16. There are two row exchanges, hence the value of the determinant is (−1) det (A) = (1) (3) = 3.
17. The row operations are −2R2 → R2 and R1 + R3 → R3 , hence the value of the determinant is
−2 det (A) = −2 (3) = −6.
1
18. The row operations are R2 ↔ R3 and 5R2 → R2 , hence the value of the determinant is 5 (−1) det (A) =
5 (−1) (3) = −15.
([ ]) ([ ])
2 3 = −11, det (B) = det 0 −1
19. det (A) = det = 3,
1 −4 3 7
([ ][ ]) ([ ])
2 3 0 −1 9 19
det (AB) = det = det = −33; so det (A) det (B)
1 −4 3 7 −12 −29
([ ] [ ]) ([ ])
2 3 0 −1 2 2
= (−11) (3) = −33 = det (AB). det 1 −4 +
3 7 = det 4 3 = −2; so
det (A) + det (B) = −11 + 3 = −8 = −2 = det (A + B).

([ ]) ([ ])
−1 5 7 3
20. det (A) = det 2 4 = −14, det (B) = det 2 1 = 1,
([ ][ ]) ([ ])
−1 5 7 3 3 2
det (AB) = det = det = −14; so det (A) det (B) = (−14) (1) =
2 4 2 1 22 10
−14([
= det (AB).
] [ ]) ([ ])
−1 5 7 3 6 8
det + = det = −2; so det (A) + det (B) = −14 + 1 = −13 = −2 =
2 4 2 1 4 5
det (A + B).
([ ]) ([ ])
2 0 −1 2 2 1
21. det (A) = det 1 1 0 = 1, det (B) = det 2 0 4 = −30, det (AB)
0 1 1 −1 3 1
([ ][ ]) ([ ])
2 0 −1 2 2 1 5 1 1
= det 1 1 0 2 0 4 = det 4 2 5 = −30; so det (A) det (B) = (1) (−30) =

0 1 1 −1 3 1 1 3 5
([ ] [ ]) ([ ])
2 0 −1 2 2 1 4 2 0
−30 = det (AB). det 1 1 0 + 2 0 4 = det 3 1 4 = −76; so det (A)+
0 1 1 −1 3 1 −1 4 2
det (B) = 1 + (−30) = −29 = −76 = det (A + B).

([ ]) ([ ])
0 0 −2 1 −2 0
22. det (A) = det 2 0 3 = −4, det (B) = det 1 −1 3 = −19, det (AB)
1 1 1 1 4 −1
([ ][ ]) ([ ])
0 0 −2 1 −2 0 −2 −8 2
= det 2 0 3 1 −1 3 = det 5 8 −3 = 76; so det (A) det (B) =

1 1 1 1 4 −1 3 1 2
([ ] [ ])
0 0 −2 1 −2 0
(−4) (−19) = 76 = det (AB). det 2 0 3 + 1 −1 3
1 1 1 1 4 −1
([ ])
1 −2 −2
= det 3 −1 6 = −88;
2 5 0
so det (A) + det (B) = (−4) + (−19) = −23 = −88 = det (A + B).
( ) 2 2
23. (a) det A2 = (det (A)) = (3) = 9
( 4) 4 4
(b) det A = (det (A)) = (3) = 81
( ) ( ( )) ( ( )) 2 2
(c) det A2 AT = det A2 det AT = (det (A)) det (A) = (3) (3) = 27
( −1 ) 1
(d) det A = det(A) = 31
( ) 3 3
24. (a) det B 3 = (det (B)) = (−2) = −8
( ) 5 5
(b) det B 5 = (det (B)) = (−2) = −32
( ) ( ( ))
(c) det BB T = (det B) det B T = det (B) det (B) = (−2) (−2) = 4
(( )3 ) ( ( ))3 ( 1 )3 ( 1)3
(d) det B −1 = det B −1 = det(B) = −2 = − 18
( )
25. (a) det A2 B 3 = (det (A))2 (det (B))3 = (3)2 (−2)3 = −72
( ) ( )
(b) det AB −1 = det (A) det B −1 = det (A) 1 = 3 1 = − 3
det(B) −2 2
( ) ( )
(c) det B 3 AT = (det (B))3 det AT = (det (B))3 det (A) = (−2)3 (3) = −24
( ) 2 3( ( )) 2 3 2 3
(d) det A2 B 3 B T = (det (A)) (det (B)) det B T = (det (A)) (det (B)) (det (B)) = (3) (−2) (−2) =
144
( )
26. (a) det B 3 A2 = (det (B))3 (det (A))2 = (−3)3 (4)2 = −432
( ) (( )2 ) ( ( ))2
(b) det A−2 B 4 = det A−1 (det (B)) = det A−1
4 4
(det (B))
( )2 ( )2
= 1
(det (B))4 = 1 (−3)4 = 81
det(A) 4 16
( ) ( )
(c) det A2 B = (det (A))2 det B = (det (A))2 det (B) = (4)2 (−3) = −48
T T
( ) ( (( )2 )) ( ) ( ( )) 2
(d) det B −2 A3 AT = det B −1 (det (A)) det AT = det B −1
3 3
(det (A)) det (A)
( )2 ( )2
1 3 1 3
= det(B) (det (A)) det (A) = −3 (4) (4) = 256
9
1 −3 0 0
2 5 0 0
0 0 5 −1 ([ ]) ([ ])
1 −3 5 −1
27. det (A) = det 0 0 3 3 = det det
2 5 3 3
= (11) (18) = 198

−2 0 2 0 0
1 3 1 0 0 ([ ]) ([ ])
−2 0 2
28. det (A) = det 2 0 4 0 0 = det 1 3 1 −3 2
det 1 2 = (−8) (−36) =
0 0 0 −3 2 2 0 4
0 0 0 1 2
288
4 2 1 1 ([ ]) ([ ])
3 1 5 9 4 2 3 2
29. det (A) = det = det det = ( 2) ( 2)
0 0 3 2
0 0 1 0 − −
3 1 1 0
=4
1 2 6 7 9
2 3 8 2 5
([ ]) ([ ])
0 0 1 2 1 1 2 1 2 1
30. det (A) = det 0 0 2 1 3 = det det 2 1 3 = (−1) (10)
2 3
0 0 3 2 1 3 2 1
= −10
9 3 0 0 ([ ]) ([ ])
3 1 0 0 9 3 2 2
31. det (A) = det = det 3 1 det 3 1 = (0) ( −4)
3 9 2 2
8 1 3 1
=0
2
3 0 0 0
]) ([ ])
−1 5 0 0 0 ([ 1 3 2
2 3
32. det (A) = det 6 7 1 3 2 = det
−1 5
det 0 3 1 = (13) (−7) =
−4 1 0 3 1 2 1 0
0 5 2 1 0
−91
−1
([ ]) 1 2 3 −1 0
A B 0 4 5 1
33. det = det
C D 0 −2 2 1
4 0
= −3.
det (A) det
(D) − det (B)
det (C) =
([ ]) ([ ]) ([ ]) ([ ])
1 2 2 1 −1 0 0 −2
= (4) (−4) − (−1) (−2) = −18.

([ ]) −1 0 0 1
A B 2 4 −3 2
34. det = det = −40. det (A) det (D) − det (B) det (C) =
C D 3 2 1 −1
0 −3 5 1
([ ]) ([ ]) ([ ]) ([ ])
−1 0 1 −1 0 1 3 2
3.
([ ])
6 −5
35. det (A) = det = 32 = 0, hence and the system of equations Ax = b has a unique
−2 7
solution by The Unifying Theorem.
([ ])
10 −5
36. det (A) = det = 0, hence and the system of equations Ax = b does not have a unique
−4 2
([ ])
3 2 7
37. det (A) = det 0 0 −3 = −9 = 0, hence and the system of equations Ax = b has a unique
0 −1 −4
([ ])
−2 5 −10
38. det (A) = det 1 −2 3 = −1 = 0, hence and the system of equations Ax = b has a
7 −17 34
unique solution by The Unifying Theorem.
([ ])
1 1 −2
39. det (A) = det 3 −2 2 = 49 = 0, hence and the system of equations Ax = b has a unique
6 −7 −1

([ ])
1 −3 2
40. det (A) = det −2 7 −2 = 1 = 0, hence and the system of equations Ax = b has a unique
4 −13 7

([ ]) ( [ ]) ([ ])
1 2 1 2 3 6
41. For example, 3 det = det 3 = det = 0.
2 4 2 4 6 12
([ ]) ( [ ]) ([ ])
1 1 1 1 1 1 −2 −2 −2
42. For example, −2 det 2 2 2 = det −2 2 2 2 = det −4 −4 −4
3 3 3 3 3 3 −6 −6 −6
= 0.
([ ] [ ]) ([ ])
1 2 −1 −2 0 0
43. For example, det 2 4 + −2 −4 = det 0 0 = 0, and
([ ]) ( )
1 2 −1 − 2
det 2 4 + det −2 −4 = 0 + 0 = 0.
44. Suppose A = I3 and B = −I3 . Then det(A + B) = 0 and det(A) + det(B) = 1 + (−1) = 0. More
generally, let B = −A, where A is an arbitrary 3 × 3 matrix, then det (A + B) = det (03×3 ) = 0 and
3
det (A) + det (B) = det (A) + det ((−1) A) = det (A) + (−1) det (A) = 0.
([ ])
1 1 1
45. For example, det 1 2 2 = 1.
1 1 2
1 1 1 1
1 2 2 2
46. For example, de t 1 1 2 2 = 1.
1 1 1 2
([ ])
1 1
47. (a) False. Interchanging two rows will change the sign of the determinant. For instance, det =
0 2
([ ])
0 2
2 while det 1 1 = −2.
(b) True, by The Unifying Theorem.

[ ]
0 1
48. (a) False. For example, E = is elementary with det(E) = 1.
−
1 0
[ ]
1 0
(b) False. For example, if A = B = , then det(A) + det(B) = 1 + 1 = 2, while det(A + B) =
0 1
([ ])
2 0 = 4.
det 0 2
([ ]) ([ ])
1 0 0 1 0 0
49. (a) False. For example, rank 0 1 0 = 2 but det 0 1 0 = 0.
0 0 0 0 0 0
(b) True, since det (A) = 0, null (A) = {0} and nullity (A) = 0.
( ) ( )
50. (a) True, since det (B) = det S −1 AS = det S −1 det (A) det (S) = 1
det(S) det (A) det (S) = det (A).
(b) False for all n > 1. In these cases, the columns will be equal so linearly dependent, and hence
det (A) = 0.
( )
51. (a) True. ( B T) is obtained by multiplying the third row of AT by 2, so det (B) = det B T =
2 det AT = 2 det (A).
(b) True. If every Mij is not invertible, then det (A) = 0 using any row or column cofactor expansion,
since every Mij will have determinant zero. But this contradicts A is an invertible matrix. Thus
at least one Mij is also invertible.
( )
52. (a) True. If A is m × n, then AT is n × m, so AT A is an n × n square matrix, and det AT A is
defined.
(b) False. If A is not a square matrix, det (A) is not defined.
53. Let rows i and j of matrix A be identical. Let B be the matrix obtained from A by the row operation
−Ri +Rj → Rj . Then row j of B is a row of zeroes, and therefore by considering the cofactor expansion
along row j of B, we have det (A) = det (B) = 0.
( )
54. Since A has two identical columns, AT has two identical rows. By Exercise 53 det AT = 0. Hence,
( )
applying Theorem 5.10, det (A) = det AT = 0.
( ) ( ) 2
55. det AT A = det AT det (A) = det (A) det (A) = (det (A)) ≥ 0.
( ) ( )
56. det A−1 = det(A) 1
= 21 . If A−1 has all integer entries, then det A−1 must also be an integer, since
( )
this quantity is obtained by adding and multiplying integers. But because det A−1 is not an integer,
A−1 must have at least one non-integer entry.
57. By Theorem 5.13(b) applied to the n rows of A, we obtain n factors of −1; so det (−A) = det ((−1) A) =
(−1n ) det (A).
58. By Theorem 5.13(b) applied to the n rows of A, we obtain n factors of c; so det (cA) = cn det (A).
( ) ( )
59. det A2 = det (A) det (A) = det (A)2 . Since det A2 = det (A) we have det (A)2 = det (A) ⇒
det (A) (det (A) − 1) = 0. Thus either det (A) = 0 or det (A) = 1.
( ) n ( ) n n
60. det (A) = det −AT = (−1) det AT = (−1) det (A). Since n is odd, (−1) = −1, and hence we
have det (A) = − det (A). Consequently, 2 det (A) = 0 and we conclude that det (A) = 0.
n ( ) 2
61. det (−In ) = (−1) det (In ) = (−1) det (In ) = −1, since n is odd. But det A2 = det (A) ≥ 0, so it is
impossible for A2 = −In if n is odd.
62. If the entries of each row of A add to zero, then by considering matrix multiplication we would have
1
1
Ax = 0 when x = . Hence null(A) = {0}, so by The Unifying Theorem we must have det (A) = 0.
.
1
63. A has an echelon form B which is obtained from A using row operations of the form Ri ↔ Rj or
cRi + Rj → Rj . Since the first of these operations only changes the sign of the determinant, and the
second has no effect on the determinant, we conclude that det (A) = ± det (B).
64. If E is the elementary matrix corresponding to the row operation Ri ↔ Rj , then E −1 corresponds
to Rj ↔ Ri , which is the same operation, and hence E −1 = E is an elementary matrix. If E is the
elementary matrix corresponding to the row operation cRi → Ri with c = 0, then E −1 corresponds
to c−1 Ri → Ri , which is also a row operation, and hence E −1 is an elementary matrix. If E is
the elementary matrix corresponding to the row operation cRi + Rj → Rj , then E −1 corresponds to
(−c) Ri + Rj → Rj , which is also a row operation, and hence E −1 is an elementary matrix.
65. (a) Suppose E is the matrix corresponding to the row operation cRi → Ri . det (E) = c, since E
is a diagonal matrix with all ones, expect for c in the ith diagonal entry. Consider the cofactor
expansion of row i of the matrix EB:
det (EB) = (cbi1 ) Ci1 + (cbi2 ) Ci2 + · · · + (cbin ) Cin
= c (bi1 Ci1 + bi2 Ci2 + · · · + bin Cin )
= c det (B)
= det (E) det (B)
where we have used that the cofactors Cij are the same for B and EB.
(b) Suppose E is the matrix corresponding to the row operation cRi + Rj → Rj . det (E) = 1, since
E is a triangular matrix with all ones on the diagonal. Consider the cofactor expansion of row j
of the matrix EB:
det (EB) = (cbi1 + bj1 ) Cj1 + (cbi2 + bj2 ) Cj2 + · · · + (cbjn ) Cjn
= c (bi1 Cj1 + bi2 Cj2 + · · · + bin Cjn ) + (bj1 Cj1 + bj2 Cj2 + · · · + bjn Cjn )
The first term, c (bi1 Cj1 + bi2 Cj2 + · · · + bin Cjn ) = 0, since bi1 Cj1 + bi2 Cj2 + · · · + bin Cjn is the
cofactor expansion along row j of the matrix obtained from B by replacing row j with row i. Since
this matrix has identical rows, its determinant is zero. The second term, bj1 Cj1 + bj2 Cj2 + · · · +
bjn Cjn , is the determinant of B. Thus, det (EB) = 0 + det (B) = (1) det (B) = det (E) det (B).
66. Expand along the first column,
([ ])
A B
det =
032 D
a22 b21 b22 b23 a12 b11 b12 b13
0 0
a11 det
0 D 0 D
− a21 det
0 0
followed now by an expansion along each first column,
= a11 a22 det (D) − a21 a12 det (D)

= (a11 a22 − a21 a12 ) det (D)
= det (A) det (D)
[ ]
A B
67. Let M = , A a j × j square matrix, and D any square matrix. We prove det (M ) =
0 D
det (A) det (D) by induction on j. If j = 1, then by expansion along the first column we have
([ ])
a B
det (M ) = det
0 D
= (a) det (D)
= det (A) det (D)
Now suppose that det (M ) = det (A) det (D) for all matrices A of size (j − 1) × (j − 1). Then expansion
along the first column produces
([ ]) ([ ]) ([ ])
C11 ∗ C21 ∗ Cj1 ∗
det (M ) = a11 det + a21 det + · · · + aj1 det
0 D 0 D 0 D
where each Ci1 is a (j − 1) × (j − 1) submatrix of A, each ∗ represents B with one row removed, and
the lower left matrix 0 has one fewer column. Apply the induction hypothesis to obtain
det (M ) = a11 det (C11 ) det (D) + a21 det (C21 ) det (D) + · · · + aj1 det (Cj1 ) det (D)
= (a11 det (C11 ) + a21 det (C21 ) + · · · + aj1 det (Cj1 )) det (D)
= det (A) det (D)
[ ]
A 0 ( )
If instead M = , we apply the above result to obtain det (M ) = det M T
C D
([ T ])
A CT ( ) ( )
= det T = det AT det D T = det (A) det (D).
0 D
68. (a) Using row operations, we have
1 x1 x12 1 x1 x12
0 x2 − x1 x22 − x12
0 x −x x 2 − x2
1 x2 x22 ∼
1 x 3 x2
3 3 1 3 1
Since these row operations preserve det (V ), we use Exercise 67 to obtain

( ) ( )
det (V ) = (x2 −
x1 ) x23 − x21 − x22 − x21 (x3 − x1 )
= (x2 −
x1 ) (x3 − x1 ) (x3 + x1 ) − (x2 − x1 ) (x2 + x1 ) (x3 − x1 )
= (x2 −
x1 ) (x3 − x1 ) ((x3 + x1 ) − (x2 + x1 ))
= (x2 −
x1 ) (x3 − x1 ) (x3 − x2 )
= (x3 −
x2 ) (x3 − x1 ) (x2 − x1 )
[ ]
1 x
(b) We prove this by induction on n > 1. If n = 2, then V = 1 x1 , and det (V ) = x2 − x1 , the
2
desired form. Now suppose that the result holds for n − 1. Then using row operations we have
1 x1 · · · x1n
1 x2 · · · x2n
det . . =
.. ..
. . .
1 xn · · · xnn
1 x1 ··· xn−1
1 xn1
0 x2 − x1 ··· xn−1 − xn−1 xn −. xn

2 1 2 1
. . ... . =
det . . . .
n−1 n−1 n n
0 xn−1 − x1 · · · xn−1 − x1 xn−1 − x1
0 xn − x1 · · · xn−1 − xn−1 xn − x n
n 1 n 1
x2 − x1 ··· xn−1
2 − xn−1
1 x2n − x1n
..
det . . . .
n−1 n−1 n n
xn−1 − x1 · · · xn−1 − x1 xn−1 − x1

xn − x1 · · · xn−1 − xn−1 xn − x n
n 1 n 1
Now using column operations (or transposing, using row operations, and transposing back), we
get by adding (−x1 ) times the next to the last column to the last column
x2 − x1 · · · xn−1 − xn−1 xn−1 (x2 − x1 )
2 1 2
..
= det . . .
n−1 n−1 n−1
.
xn−1 − x1 · · · xn−1 − x1 xn−1 (xn−1 − x1 )
xn − x1 · · · xn−1 − xn−1 x n−1 (xn − x1 )
n 1 n
Followed by (−x1 ) times the second to last column added to the next to last:
x2 − x1 ··· xn−2
2 (x2 − x1 ) xn−1
2 (x2 − x1 )
. .. . .
= det . . . .
xn−1 − x1 · · · xn 1 (x2 − x1 ) x (xn−1 − x1 )
n−2 n−1
− n−1
xn − x1 ··· xnn−2 (x2 − x1 ) xnn−1 (xn − x1 )
One can continue all the way back to obtain:
x2 − x1 x2 (x2 − x1 ) ··· xn−2

2 (x2 − x1 ) xn−1
2 (x2 − x1 )
x3 − x1 x3 (x2 − x1 ) ··· xn−2
3 (x2 − x1 ) xn−1
3 (x2 − x1 )
= det ..
. . . . .
n−2 n−1
xn−1 − x1 xn−1 (x2 − x1 ) · · · xn−1 (x2 − x1 ) xn−1 (xn−1 − x1 )
xn − x1 xn (x2 − x1 ) · · · xnn−2 (x2 − x1 ) xn−1
n (xn − x1 )
1 x2 · · · xn−2
2 x n−1
2
n−2 n−1
1 x ··· x x 3 3 3
∏ ..
= (xk − x1 ) det . . . . .
1<k≤n n−2 n−1
1 xn−1 ··· xn−1 xn−1

1 xn ··· xn−2
n xn−1
n
∏ ∏
= (xk − x1 ) (xk − xj )
1<k≤n 2≤i<j≤n
∏
= 1≤i<j≤n
(xj − xi ) ,
where we have applied induction to evaluate the determinant of an (n − 1) × (n − 1) Vandermonde

matrix. (As a consequence, the Vandermonde matrix is invertible if and only if the xi are distinct.)
1 0 0 0 3 −2 6 [ ]
0 −3 2 6
0 1 0 0
0 0 1 0 4 0 5 1 4 4 2
69. det (I4 + AB) = det +
0 0 0 1 2 −9 1
5 −1 −4 −8 3 0 5
−49 1 −2 44
−40 4 8 49
= det −17 −39 −31 −1 = −45, 780.
[ ] [ ] 3 −2 6
1 0 0 0 −3 2 6
4 0 5
det (I3 + BA) = det 0 1 0 + 1 4 4 2 2 −9 1
0 0 1 −8 3 0 5
([ ])
23 −24 −37
= det 37 −39 22 = −45, 780.
13 11 −52
[ ] [ ] 2 4 −6
1 0 0 6 2 3 −1 4 0 5 2
70. det (I3 + AB) = det 0 1 0 + 7 0 −2 4 5 −3 7 7
0 0 1 −8 2 4 9 0 0 2 8
−9 3 5
([ ])
−32 65 1
= det −25 38 1 = 61, 989.
−28 24 153
1 0 0 0 0 2 4 −6
[ ]
0 1 0 0 0 0 5 2 6 2 3 −1 4
det (I5 + BA) = det 0 0 1 0 0 + −3 7 7 7 0 −2 4 5
2 8 8 2 4 9 0
0 0 0 1 0 0 3 5 −
0 0 0 0 1 −9
89 −8 −26 −40 28
19 5 −2 38 25
= det −25 8 6 94 23 = 61, 989.

−50 16 28 81 10
−73 −8 −13 66 −20
5.3 Practice
[ ] [ ] [ ]
Problems 7 7 −3 5 7
[ ]
5 −3
1. (a) Let A = and b = . Then A 1 = , and A2 = . By
−1 2 −4 −4 2 −1 −4
−13
Cramer’s Rule, x1 = det(A 1)
det(A) =
2
7 and x2 = det(A2)
det(A) = 7 .
[ ] [ ] [ ] [ ]
2 1 −2 1 1 1 −2 2 1 −2
(b) Let A = 1 −3 5 and b = 1 . Then A1 = 1 −3 5 , A2 = 1 1 5 ,
−1 −4 2 −6 −6 −4 2 −1 −6 2
[ ]
2 1 1
and A3 = 1 −3 1 . By Cramer’s Rule, x1 = det(A1 )
= 26
, x2 = det(A2 )
= 67
, and
det(A) 35 det(A) 35
−1 −4 −6
det(A3 ) 42
x3 = det(A)
= 35
= 56.
([ ])
1 3
[ ]
−4 −3
2. (a) adj (A) = adj = ;
3 −4 −3 1
[ 4 ]
3
[ ]
−4 −3 13 13
A−1 = 1
1
= .
adj (A) =
det(A) −13 −3 1 3 1
13
− 13
509 Section 5.3: Applications of the Determinant Chapter 5: Determinants 509
([ ]) [ ]
2 1 4 5 3 −20
(b) adj (A) = adj 1 5 0 = −1 −6 4 ;
2 1 1 −9 0 9
− 5
−9
1 20
[ 5 3 −20 ] 27 27
A−1 = 1 1 −1 −6 4 1 2 4
− 27
det(A)
adj (A) = −27 −9 0 9 = 27
1
9
1
.
3
0 −3
3. (a)
([ ])
3 2
area = det 1 3 =7
(b)
([ ])
2 1
area = det 3 4 =5
4. (a) True. Otherwise, determinants cannot be used.

([ ]) [ ]
0 0 0 0
(b) False. adj 0 0 = .
0 0
( [ ]) ([ ]) [ ] [ ] ( )
a b 3a 3b 3d −3b d −b a b
(c) True. adj 3 c d = adj 3c 3d = −3c 3a =3 −c a = 3adj c d
.
[ ] [ ] ([ ]) [ ] ([ ]) [ ]
2 0 1 0 2 0 2 0 1 0 1 0
(d) False. 0 2
∼ , but adj = , and adj = .
0 1 0 2 0 2 0 1 0 1
5.3 Applications of the Determinant

[ ] [ ] [ ] [ ]
6 −5 12 12 −5 6 12
1. Let A = −2 7 and b = 0
. Then A1 =
0 7 , and A2 = −2 0 . By Cramer’s
det(A1 ) 84 21 det(A2 )
Rule, x1 = det(A) = 32 = 8 and x2 = det(A) = 3224 =4 3 .
[ ] [ ] [ ] [ ]
10 −5 5 5 −5 10 5
2. Let A = and b = . Then A1 = , and A2 = −4 −3 . Since
−4 2 −3 −3 2
det(A) = 0, Cramer’s Rule does not apply.

[ ] [ ] [ ] [ ]
3 2 7 0 0 2 7 3 0 7
3. Let A = 0 0 −3 , and b = −3 . Then A1 = −3 0 −3 , A2 = 0 −3 −3 ,
0 −1 −4 13 13 −1 −4 0 13 −4
[ ]
3 2 0
0 0 −3 . By Cramer’s Rule, x1 = det(A1 )
= −81 = 9, x2 = det(A2 )
= 153 = −17,
and A3 =
det(A) −9 det(A) −9
0 −1 13
and x3 = det(A)3 = −
det(A )
9
−9
= 1.
[ ] [ ] [ ]
−2 5 −10 4 4 5 −10
4. Let A = 1 −2 3 , and b = −1 . Then A1 = −1 −2 3 ,
7 −17 34 −16 −16 −17 34
[ ] [ ]
−2 4 −10 −2 5 4
A2 = 1 −1 3 , and A3 = 1 −2 −1 . By Cramer’s Rule, x1 = det(A1 )
= 12
=
det(A) −1
7 −16 34 7 −17 −16
det(A2 ) det(A3 )
−12, x2 = =
10
= −10, and x3 = =
3
= −3.
det(A) −1 det(A) −1
[ ] [ ] [ ] [ ]
1 1 −2 −3 −3 1 −2 1 −3 −2
5. Let A = 3 −2 2 , and b = 9 . Then A1 = 9 −2 2 , A2 = 3 9 2 ,
6 −7 −1 4 4 −7 −1 6 4 −1
[ ]
1 1 −3
and A3 = 3 −2 9 . By Cramer’s Rule, x1 = det(A1 )
= 79
, x2 = det(A2 )
= 22
, and x3 =
det(A) 49 det(A) 49
6 −7 4
det(A3 ) 124
det(A)
= 49
.
[ ] [ ] [ ] [ ]
1 −3 2 4 4 −3 2 1 4 2
6. Let A = −2 7 −2 , and b = −7 . Then A1 = −7 7 −2 , A2 = −2 −7 −2 ,
4 −13 7 12 12 −13 7 4 12 7
[ ]
1 −3 4
and A3 = −2 7 −7 . By Cramer’s Rule, x1 = det(A1 )
= 31
= 31, x2 = det(A2 )
= 7
= 7, and
det(A) 1 det(A) 1
4 −13 12
det(A3 )
1 = −3.
3
x3 =
([ ])
−2 3
det
det −3 −1
(A2 ) 11
7. x2 = = ([ ]) = .
det (A) −2 3 23
det −3 −7
([ ])
det 1 11
det −3 −2 31 31
(A2 )
8. x2 = = ([ ]) = =− .
det (A) 1 −4 −11 11
det
−3 1
([ ])
3 1 2
det 0 3 2
det 2 −4 1 25 25
(A2 )
9. x2 = = ([ ]) = =− .
det (A) 3 0 2 −21 21
det 0 3 2
2 3 1
([ ])
1 0 0
det 3 2 −3
det 1 −3 −2 −13 13
(A2 )
10. x2 = = ([ ]) = = .
det (A) 1 −1 0 −10 10
det 3 −1 −3
1 −3 −2
0 1 0 −3
2 −2 3 −3
det
−2 0 2 2
det 2 −1 2 1 −56 14
(A2 )
11. x2 = = = = .
det (A) 0 3 0 −3 −156 39
2 −1 3 −3
det
−2 3 2 2
2 0 2 1
3 5 0 −3
−1 0 2 1
det 1 3 3 0
det 0 1 3 3 12 1
(A2 )
12. x2 = = = =− .
det (A) 3 −3 0 −3 −48 4
−1 0 2 1
det
1 0 3 0
([ ]) 0 [ −2 3 ]3
2 5 7 −5
=
13. adj (A) = adj 3 7 −3 2 ,
[ ] [ ]
7 −5 −7 5
A−1 = 1 1
det(A) adj (A) = = .

−1 −3 2 3 −2
([ ]) [ ]
1 7 6 −7
14. adj (A) = adj = ,
1 6 −1 1
[ ] [ ]
−1 1 1 6 −7 −6 7
det(A) adj
A = (A) = = .
−1 −1 1 1 −1
([ ]) [ ]
0 1 0 0 0 1
15. adj (A) = adj 0 0 1 = 1 0 0 ,
1 0 0 0 1 0
[ ]
] [
0 0 1
0 0 1
A−1 = 1
det(A) adj
(A) = 1
1
1 0 0
1 0 = 0 .
(
[ ]0) 1 [0
0 1 ]0
2 0 1 −2 1 0
16. adj (A) = adj 0 0 2 = 2 −1 −4 ,
1 1 0 0 −2 0
[ ] 1
−2 1 0 2
− 14 0
A−1 = 1 1
2 −1 −4 = − 1 1 1 .
det(A) adj
(A) = −4 2 4
0 −2 0 0 1
2 0
([ ]) [ ]
1 2 1 1 −2 3
17. adj (A) = adj 0 1 2 = 0 1 −2 ,

0 0 1 0 0 1
[ ] [ ]
1 −2 3 1 −2 3
A−1 = 1 1
det(A) adj
(A) = 1 0 1 −2 = 0 1 −2 .
0 0 1 0 0 1
18. adj (A) = adj

([ ]) [
3 0 0
1 2 0 2
1 1 1
0
0
]
=
−
1
3
0
,
−
1
−
3
6
[ ] 1
0 0
2 0 0 3
A−1 = 1
det(A) adj (A) = 1
6
−1 3 0 = − 61 1
2 0 .
−1 −3 6 1 1
−
6
−2 1
([ ])
19. area = det 5 2
= 13.
1 3
([ ])
20. area = det 4 2
= 38.
−5 7
([ ])
3 −3
21. area = det 4 1 = 15.
([ ])
2 3
22. area = det = 17.
−5 1
([ ])
3 −1
23. area (T (D)) = |det (A)| area (D) = det (7 − 2) (5 − 2) = 165.
5 2
([ ])
−2 7
24. area (T (D)) = |det (A)| area (D) = det (5 − (−3)) (7 − 4) = 696.
3 4
[ ]
5 2
25. Since D is the image of the unit square under the mapping T (x) = Bx = 1 4 x, area (D) =
([ ]) ([ ])
|det (B)| = det 5 2 1 2
1 4 = 18. Hence area (T (D)) = |det (A)| area (D) = det 4 5 (18) =
54.
[ ]
−2 3
26. Since D is the image of the unit square under the mapping T (x) = Bx = 3 5 x, area (D) =
([ ]) ([ ])
−2 3 5 2
|det (B)| = det = 19. Hence area (T (D)) = |det (A)| area (D) = det (19) =
3 5 9 1
247.
[ ] [ ] [ ]
1 5 1 1
27. Since D is the image of the unit square under the mapping T (x) = Bx+ 2 = 2 4 x+
2
,
([ ])
area (D) = |det (B)| = det 5 1
= 18. Hence area (T (D)) = |det (A)| area (D)
2 4
([ ])
1 4
= det (18) = 54.
2 5
[ ] [ ] [ ]
−2 −2 3 −2
28. Since D is the image of the unit square under the mapping T (x) = Bx+ = x+ ,
1 3 5 1
([ ])
−2 3
area (D) = |det (B)| = det = 19.
3 5
([ ])
5 2
Hence area (T (D)) = |det (A)| area (D) = det (19) = 247.
9 1
[ ]
5 0
29. T (x) = Ax = x
0 3
[ ]
2 0
30. T (x) = Ax = x
0 4 [ √ √ ]
[ ][ ] 3
cos (45◦ ) sin (45◦ ) 3 0 2 3 2
31. T (x) = RAx = x= 2√ √ x.
− sin (45◦ ) cos (45◦ ) 0 6 − 32 2 3 2
[
7
√ ]
[ ][ ] x.
cos (120◦ ) − sin (120◦ ) 7 0 − 23 −2 3
x= 2
32. T (x) = RAx = √
sin (120◦ ) cos (120◦ ) 0 4 7
−2
([ ]) ( ) ( )
4 0 0 4 4
33. volume = det 0 3 0 π = 60 π = 80π
0 0 5 3 3
([ ]) ( ) ( )
2 0 0 4 4
34. volume = det 0 6 0 π = 48 π = 64π
0 0 4 3 3
([ ])
3 6 2
35. volume = det 5 1 0 = 82
2 3 4
([ ])
−1 0 6
36. volume = det 3 4 1 = 86
5 2 1
37. For example,
x1 + x 2 = 1
2x1 + 2x2 = 2
38. For example,
x1 + x 2 + x 3 = 1
2x1 + 2x2 + 2x3 = 2
3x1 + 3x2 + 3x3 =

3
39. For example, let the parallelogram have vertices (0, 0), (5, 0), (5, 1), and (0, 1).
40. For example, let the parallelogram have vertices (1, 1), (8, 1), (8, 2), and (1, 2).
[ ] ([ ]) [ ]
41. Let A =
1 3
, then adj (A) = adj
1 3
= 5 −3
.
2 5 2 5 −2 1
[ ] ([ ]) [ ]
7 −3 7 −3 2 3
42. Let A = then adj (A) = adj = .
,
−5 2 −5 2 5 7
43. (a) False. Cramer’s rule requires that A is invertible, so for example would not apply to the system
x1 + x 2 = 1
2x1 + 2x2 = 2
(b) True, since adj (A) has entries given by determinants of integer matrices.
−1 ( ) ( )
44. (a) False.
( If A is an )invertible 3×3 matrix, then adj (2A) = det (2A) (2A) = 23 det (A) 2−1 A−1 =
22 det (A) A−1 = 22 adj (A).
([ ]) [ ]
1 2 1 −2
(b) False, for example adj = .
1 1 −1 1
[ ]
1 0
45. (a) False. If det (A) = 0, then T (S) will be a line segment (or a point). For instance, if A = 0 0 ,
then T (S) is the line segment from (0, 0) to (1, 0).
(b) True, by Theorem 5.18.
46. (a) True, by Theorem 5.18, and the fact that adj (A) will have integer entries.
( )
(b) True. If C is the cofactor matrix of A, then C T is the cofactor matrix of AT . Hence adj AT =
( T )T T
C = (adj (A)) .
[ ] [ ]
x1 y1
47. If T (x) = T (y) where x = and y = are two points in the interior of S, then Bx = By,
x2 y2
[ ] [ ]
bx by
1 1 1 1
so = . As b and b are both nonzero, we conclude that x = y and x = y , and
1 2 1 1 2 2
b2 x 2 b2 y2
[ ]
z1
hence x = y. Thus T is one-to-one. If z =
z is in the interior of R, then 0 < z1 < b1 and
2
[ ]
z1 /b1
0 < z2 < b2 . Let x = . Then since 0 < z1 /b1 < 1 and 0 < z2 /b2 < 1, we have x is in the
z2 /b2
[ ]
z1 = z, which shows that T maps the interior of S onto the
interior of S. Also T (x) = Bx =
z2
interior of R. Thus T gives a one-to-one correspondence between S and R.

[ ] [ ]
x1 y1
48. If T (x) = T (y) where x = and y = are two points in the interior of U , then Ax = Ay,
x2 y2
[ ] [ ]
ax1 ay1
so = . As a and b are both nonzero, we conclude that x1 = y1 and x2 = y2 , and
bx2 by2
[ ]
z1 is in the interior of , then z12 z22
< 1. Let
hence x = y. Thus T is one-to-one. If z = +
E
z2 a2 b2
[ ]
z 1 /a 2 2 z2 z22
x = . Then since (z /a) + (z /b) = + < 1, we have x is in the interior of . Also
z2 /b b2
U
1 1
2 a2
[ ]
z
T (x) = Ax = 1
U E
z2 = z, which shows that T maps the interior of onto the interior of . Thus T
gives a one-to-one correspondence between U and E .
49. Since det (A) = −2 = 0, A is invertible and A−1 = det(A)

1
adj (A). Multiply both sides by det (A) A
to obtain det (A) I3 = Aadj (A). Thus Aadj (A) is a 3 × 3 diagonal matrix, with each diagonal term
det (A) = −2.
50. Since A is an n × n matrix with linearly independent columns, A is invertible, det (A) = 0, and
A−1 = det(A)
1
adj (A). Thus adj (A) = det (A) A−1 , and so adj (A) is also an invertible n × n matrix.
We conclude therefore that adj (A) also has linearly independent columns.
T ( ) T
51. From Exercise 46b, (adj (A)) = adj AT . Since A is symmetric, AT = A, and hence (adj (A)) =
adj (A). We conclude that adj (A) is symmetric.

52. Consider a cofactor Cij where i = j. Since A is diagonal, the corresponding Mij must have a row of
zeroes, and thus Cij = (−1)i+j det (Mij ) = 0. Consequently, the cofactor matrix C is diagonal, and
adj (A) = C T = C is diagonal as well.
53. Let the cofactors of A be given by Cij , and consider a cofactor Gij of the matrix cA. The corresponding
Nij is an (n − 1) × (n − 1) matrix whose entries are c times the entries of Mij of A. Thus Gij =
i+j i+j n−1
(−1) det (Nij ) = (−1) c det (Mij ) = cn−1 Cij . Consequently, C, the cofactor matrix of A,
( )T
satisfies G = cn−1 C, and hence adj (cA) = GT = cn−1 C = cn−1 C T = cn−1 adj (A).
54. From A adj (A) = det (A) In (established in the proof of Theorem 5.18), we take determinants to obtain:
det (A adj (A)) = det (det (A) In )

n
det (A) det (adj (A)) = (det (A))
n−1
If det (A) = 0, then we obtain det (adj (A)) = (det (A)) .
) −1
)
( −1
(
1
55. Since A adj (A) = det (A) In , det(A) A adj (A) = In ⇒ (adj (A))−1 = 1
A. Also, A adj A =
( −1 ) ( ) ( −1 ) −1 ( )
det A In , so adj A−1 = det A A = 1
A. Hence, (adj (A)) adj A−1 .
=det(A)
det(A)
( −1
) ( )
56. det A is an integer, since A−1 has integer entries. Thus det A−1 = 1
det(A) is an integer, from
which we conclude that det (A) = ±1.
57. Suppose i = j. Since A is diagonal, it follows that column i (and row j) of Mij consists completely of
zeroes, so the cofactor Cij = 0. Hence adj(A) is also diagonal.
[ ]
x1
58. (a) Since T is the translation of T by the vector x , we have area ( T ) = area ( T ∗ ).
∗
2
(b) The
[ parallelogram P ]is the image of the unit square under the mapping T (x) = M x where M =
x2 − x1 x3 − x1 ( )
. Thus area ( ∗ ) = 1 area ( ) = 1 det (M ) = 1 det M T = 1 det (B) ,
T P 2 |
| 2 |
|
y2 − y1 y3 − y1 2 2
[ ]
x − x y −y
where B = M T = x2 − x1 y2 − y1 .
3 1 3 1
(c) A cofactor expansion

([ of C along the third
]) column produces
x2 − x1 y2 − y1
det (C) = (1) det x − x y −y = det (B).
3 1 3 1
(d) We have
[ ] R1 +R2 →R2
[ ]
x1 y1 1 x1 y1 1
R1 +R3 →R3
C= x2 − x1 y2 − y 1 0 ∼ x2 y2 1 =A
x3 − x 1 y3 − y 1 0 x3 y3 1
Thus area (T ) = area (T ∗ ) = 1

|det (B)| = 1
|det (C)| = 1
|det (A)|.
2 2 2
det(A1 ) 1221 det(A2 ) 811 det(A3 ) 1064 133

59. x1 = = , x2 = = , and x3 = = = .
det(A) 752 det(A) 752 det(A) 752 94
det(A1 ) 37 det(A2 ) 164 82 det(A3 ) 375 125

60. x1 = −37
det(A)
= −186
= 186
, x2 = det(A)
= −186
= − 93 , and x3 = det(A)
= −186
=− 62
.
−686 −85
61. x1 = det(A1 )
det(A) = 704
245 , x2 = det(A2 )
det(A) = 245 = − 145 , x3 = det(A3 )
det(A) 245 , and x4 = det(A) = 245 = − 49 .
=247 det(A4 ) 17
det(A1 ) 181 det(A2 ) −1507 1507 det(A3 ) 947 det(A4 ) −82

62. x1 =
det(A)
= −1807
, x2 = det(A)
= −1807
= 1807
, x3 = det(A)
= −1807
, and x4 = det(A)
= −1807
=
82
1807 .
([ ]) [ ]
4 −2 5 27 53 −15
63. adj 8 3 0 = −72 41 40 ;
−1 7 9 59 −26 28
27 53 15
[
27 53 −15
]
547 547
− 547
−72 41 40
A−1 = 1
det(A) adj
(A) =
1
547 59 −26 28 =
72
− 547
41 40
547
.
547
59
547
− 547
26 28
547
([ ]) [ ]
0 3 7 −28 80 −36
64. adj −3 6 2 = 7 −35 −21 ;
5 11 −1 −63 15 9
1 4 3
[
−28 80 −36
]
15
− 21 35
A−1 = 1
det(A) adj (A) = 1
−420
7 −35 −21 = −601 1
12
1
20
.
−63 15 9 3
− 28
1 − 140
3
20
4 2 5 −1 −21 −126 60 −15
−2 3 0 6 −36 207 −18 216

65. adj ;
= 118 3 −35 −97
5 7 2 11
3 0 1 −5 11 −75 29 −113
7 14 20 5
− 141 − 47 − 141
−21 −126 60 −15 141
4 23 2 24
−36 207 −18 216 − 47 − 47
A−1 = 1 1 47 47
det(A) adj (A) = 423 118 3 −35 −97 = 118 1 35 97 .
423 141
− 423 − 423
11 −75 29 −113 11 25 29 113
423
− 141 423
− 423
8 −2 1 1 168 68 53 −80
316 328 177
−5 3 5 3 −296
66. adj = ;
0 4 4 −4 −132 −108 −28 172
3 1 9 2 184 220 −42 −124
168 68 53 −80 − 191
20
42 17 53 74
191 191 764
316 328 177 −296 − 191
A−1 = 1 1 79 82 177
191 191 764
det(A) adj
(A) = 764 −132 −108 −28 172 = 33 27 7 43
.
− 191 − 191 − 191
184 220 −42 −124 191
46 55 − 382
21 − 191
31
Chapter 5 Supplementary 191 191
Exercises
[ ] [ ]
6 −8 1 4
1. M21 = ; M13 =
3 0 4 3
[ 6 2 ] [ ]
2. M21 = 1 5 ; M13 = 4 −2
4 1
[ ] [ ]
5 −2 −2 −1 2 3
3. M21 = 4 −7 2 ; M13 = 7 4 2
1 1 8 6 1 8
517 Supplementary Exercises Chapter 5: Determinants 517
[ ] [ ]
0 0 4 0 0 3
4. M21 = 2 5 −3 ; M13 = 0 2 −3
6 1 7 3 6 7
5. Using the first row, det(A) = a11 C11 +a12 C12 = (3)C11 +(−8)C12 = (3)(−1)1+1 |M11 |+(−8)(−1)1+2 |M12 | =
3 (4) + 8 (1) = 20
6. Using the first row,
det(A) = a11 C11 + a12 C12 + a13 C13 = (1)C11 + (0)C12 + (3)C13 = (1)(−1)1+1 |M11 | + (3)(−1)1+3 |M13 |
1 2 −2 1
= +3 = ((1) (−2) − 2 (−1)) + 3 ((−2) (−1) − (1) (6)) = 0 + (−12) = −12.
−1 −2 6 −1
7. Using the second row,

det(A) = a21 C21 +a22 C22 +a23 C23 = (−1)C21 +(0)C22 +(5)C23 = (−1)(−1)2+1 |M21 |+(5)(−1)2+3 |M23 |
3 2 1 3
=
−5 = ((3) (2) − 2 (−2)) − 5 ((1) (−2) − (3) (6)) = 10 − (−100) = 110.
2 2 6 2
− −
8. Using the second column,
det(A) = a12 C12 + a22 C22 + a32 C32 + a42 C42 = (0) C12 + (0) C22 + (2) C32 + (4) C42 = 2(−1)3+2 |M32 | +
4 3 −1 4 3 −1
4(−1)4+2 |M42 | = −2 −1 5 3 +4 −1 5 3 = −2 (77) + 4 (−29) = −270
3 1 2 1 6 1
([ ])
2 a
9. det (A) = det 1 4 = 8−a =0 → a = 8.
([ ])
−5 2
10. det (A) = det 2a a = −9a = 0 → a = 0.
([ ])
1 −1 a
11. det (A) = det −1 0 4 = 2a + 3 = 0 → a = − 32 .
1 −2 1
([ ])
a −1 3
12. det (A) = det 0 0 −2 = 2a2 + 2 = 0. This equation has no real solution.
1 a 2
([ ] [ ]) ([ ])
−3 1 1 0 −3 − λ 1 2
13. det (A − λI2 ) = det −λ = det = λ − λ − 14 = 0
2 4 0 1 2 4−λ
√ √
→ λ = 12 + 12 57 or λ = 12 − 12 57.
([ ] [ ]) ([ ])
1 2 −λ 1 0 1−λ 2 = λ2 − 6λ + 13 = 0.This
14. det (A − λI2 ) = det −4 5 = det −4 5−λ
0 1
equation has no real solution.

([ ] [ ])
1 1 −1 1 0 0
15. det (A − λI3 ) = det 2 0 1 −λ 0 1 0 =

−1 1 0 0 0 1
([ ])
1−λ 1 −1
det 2 −λ 1 = −λ3 +λ2 +4λ−4 = − (λ − 1) (λ − 2) (λ + 2) = 0 → λ = 1, λ = −2,

−1 1 −λ
or λ = 2.
([ ] [ ])
−2 2 1 1 0 0
16. det (A − λI3 ) = det 2 −1 2 −λ 0 1 0 =
−3 1 4 0 0 1
([ ])
−λ − 2 2 1
det 2 −λ − 1 2 = −λ3 + λ2 + 13λ − 17 = 0, and no simple solution exists.
−3 1 4−λ

[ ] [ ]
1 5 −2R1 +R2 →R2 1 5
2 3
∼ 0 −7
Thus det(A) = (1) (−7) = −7.

[ ] [ ]
3 −2 R1 ↔R2 −1 2
−1 2 ∼ 3 −2
[ ]
3R1 +R2 →R2 −1 2
∼ 0 4
1
Thus det(A) = (−1) (−1) (4) = 4.
[ ] [ ]
2 3 1 −1 2 −2
R1 ↔R2
−1 2 −2 ∼ 2 3 1
2 1 3 [ 2 1 3 ]
2R1 +R2 →R2 −1 2 −2
2R1 +R3 →R3 0 7 −3
∼
0 5 −1
(−5/7)R2 +R 3 →R3
−1 2 −2
∼ 0 7 −3
8
0 0 7
1 (8 )
Thus det(A) = (−1) (−1) (7) 7 = 8.

[ ] [ ]
4 1 0 1 3 −2
R1 ↔R3
3 2 −1 ∼ 3 2 −1
1 3 −2 4 1 0
[ ]
−3R1 +R2 →R2 1 3 −2
−4R1 +R3 →R3
∼ 0 −7 5
0 −11 8
1 3 −2
(−11/7)R2 +R 3 →R3
∼ 0 −7 5
1
0 0 7
1 (1 )
Thus det(A) = (−1) (1) (−7) 7 = 1.
([ ])
2 −3
21. det 0 5 = 10; interchanging rows once,
1
det (A) = (−1) (10) = −10.
([ ])
1 4 = −2; multiplying a row by −5,
22. det
0 −2
( 1)
det (A) = (−2) = 2 .
−5 5
([ ])
3 −6 7
23. det 0 −1 5 = −15; interchanging rows once,

0 0 5
1
det (A) = (−1) (−15) = 15.

([ ])
−1 0 −4
24. det 0 2 5 = −14; interchanging rows once, and multiplying a row by 1
4, det (A) =
0 0 7
1
(−1) (4) (−14) = 56.
[ ] [ ] [ ] [ ]
5 −2 4 4 −2 5 4
25. Let A = 3 and b = −3 . Then A 1 = , and A2 = . By Cramer’s
1 −3 1 3 −3
det(A1 ) −2 det(A2 ) −27

Rule, x1 = det(A) = 11 and x2 = det(A) = 11 .
[ ]
6 −4
26. Let A = . Because det (A) = 0, Cramer’s Rule cannot be used.
−3 2
[ ] [ ] [ ] [ ]
3 1 2 1 1 1 2 3 1 2
27. Let A = 0 0 −2 , and b = −2 . Then A1 = −2 0 −2 , A2 = 0 −2 −2 , and
0 1 1 5 5 1 1 0 5 1
[ ]
3 1 1
−10
A3 = 0 0 −2 . By Cramer’s Rule, x1 = det(A1 )
= = − 5 , x2 = det(A2 )
= 24
= 4, and
det(A) 6 3 det(A) 6
0 1 5
det(A3 ) 6
x3 = det(A)
= 6
= 1.
[ ] [ ] [ ] [ ]
1 2 −4 1 1 2 −4 1 1 −4
28. Let A = 3 −1 2 , and b = −2 . Then A1 = −2 −1 2 , A2 = 3 −2 2 ,
2 −4 3 0 0 −4 3 2 0 3
[ ]
1 2 1
3 −1 −2 . By Cramer’s Rule, x1 = det(A1 )
= −15 = − 3 , x2 = det(A2 )
= −27 , and
and A3 =
det(A) 35 7 det(A) 35
2 −4 0
det(A3 ) 26
x3 = 35 .
([ ]) [ ]
1 2
= 5 −2
29. adj (A) = adj 2 5 −2 1 ,
[ ] [ ]
5 −2 5 −2
A−1 = 1 1
det(A) adj
(A) = =
1 −2 1 −2 1
([ ]) [ ]
2 −1 7 1
30. adj (A) = adj = ,
4 7 −4 2
[ ] [ 1
]
A−1 = 1 7 1 7 18
18
9
1
det(A) adj
(A) = =
18 −4 2 − 29 1
([ ]) [ ]
1 −1 2 2 4 −7
31. adj (A) = adj −2 4 −1 = −2 −4 −3 ,
2 2 0 −12 −4 2
1 1 7
[ ] − 10 −5
2 4 −7 20
1 1 3
A−1 = 1
det(A) adj
(A) = 1
−20 −2 −4 −3 = 10 5 20
−12 −4 2 3 1 1
5 5
− 10
([ ]) [ ]
4 −4 3 13 −1 10
32. adj (A) = adj 1 −2 −1 = 2 −22 7 ,

2 5 −4 9 −28 −4
13 1 10
[ ] − 71
13 −1 10 71 71
A−1 = 1
adj (A) =
1
2 −22 7 =
2
− 71
22 7
det(A) 71 71 71
9 −28 −4 9 28 4
71 − 71 − 71
33. (a) False. A is not a square matrix, so det (A) is not defined.
5
(b) False. For example, if A is the identity matrix, then det (−2A) = (−2) = −32 = (−2) det (A) =
−2.
[ ] [ ]
0 0 0 0
34. (a) False. For example, if A = , adj (A) =
0 0 0 0
(b) False. If A is not a square matrix, then det (A) is not defined. (But if A is square, then
det (A) = 0.)
[ ] [ ]
3 0 1 0
35. (a) False. For example, if A = and B =
0 1 0 2 , then det (A) = 3, det (B) = 2, but
([ ])
4 0
det (A + B) = det = 12 = 5.
0 3
[ ] ([ ])
( )
7 0 , then det (A) = 7, but det A −1 = det 1/7 0
=
(b) False. For example, if A =
0 1 0 1
1
7 = 7.
36. (a) True. If det (A) = 0, then A is invertible, and nullity (A) = 0.
[ ]
1 0
(b) False. For example, if A = , then det (A) = 0, but rank (A) = 1 = 0.
0 0
37. (a) False. Cramers Rule will find all of the variables if det (A) = 0, and none of the variables if
det (A) = 0.
[ ] [ ]
1 1 1 0
(b) False. For example, let A = , then det (A) = 0, but the cofactor matrix C = =
0 1 −1 1
[ ]
1 −1
adj (A) = .
0 1
38. (a) True, by Theorem 5.10

1 0 0 0 0
0 1 0 0 0
(b) False. For example, let A = 0 0 1 0 0 , then rank (A) = 3, but det (A) = 0.
0 0 0 0 0
0 0 0 0 0

Linear Algebra With Applications 2nd Edition Holt Solutions Manual Download

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Linear Algebra With Applications 2nd Edition Holt Solutions Manual Download

Uploaded by

Copyright:

Available Formats

Solution Manual for Linear Algebra with Applications 2nd

Edition Holt 1464193347 9781464193347

Download full test bank at:

5.1 Practice Problems

3+1 3 −2 = 3 (−4) − (−2) 0 = −12.

− (2 (−3) + 2 (4)) = −2.

(b) det (A − λI2 ) = d − λ = det = λ − 2λ + 9 = 0

5.1 The Determinant

C22 = (−1)2+2 |M22 | = 0

10. C13 = (−1)1+3 |M13 | = 3 2 = (3)(0) − (2)(4) = −8,

11. (a) Using the second row,

12. (a) Using the first row,

13. (a) Using the second row,

14. (a) Using the first row,

15. (a) Using the first row,

0, A is invertible, and hence T is invertible.

(−1)(−1)3+2 |M32 | + (1)(−1)3+5 |M35 | = −(−1) + (1) = 8.

(b) Using the first column,

(1)(−1)4+3 |M43 | + (2)(−1)4+4 |M44 | = −(1) + (2) = 1.

22. A is not a square matrix, so det (A) is not defined.

no real solutions, since the discriminant (−2)2 − 4(1)(9) = −32 < 0.

= (−5 − λ) (−λ) (4 − λ) = 0 ⇒ λ = −5, λ = 0, or λ = 4.

(b) det 3 0 2 = 1; interchanging rows 1 and 2, det 1 2 −1 = −1. Interchang-

ing rows changes the sign of the determinant.

rows changes the sign of the determinant.

(b) det 0 2 1 = 3; interchanging rows 1 and 3, det 0 2 1 = −3. Interchang-

ing rows changes the sign of the determinant.

changing rows changes the sign of the determinant.

(b) det 0 1 1 = −6; interchanging rows 1 and 2, det 3 2 1 = 6. Interchang-

ing rows changes the sign of the determinant.

(b) det 3 0 2 = 1; multiplying row 1 by 3, det 3 0 2 = 3. Multiplying a row

(b) det 1 −1 2 = 5; multiplying row 1 by 3, det 1 −1 2 = 15. Multiplying a

59. (a) det 1 2 3 = −13; multiplying row 2 by 3, det 3 6 9 = −39. Multiplying a

(b) det 0 2 1 = 3; multiplying row 2 by 3, det 0 6 3 = 9. Multiplying a row

60. (a) det −1 2 1 = −15; multiplying row 3 by 3, det −1 2 1 = −45. Multi-

(b) det 0 1 1 = −6; multiplying row 1 by 3, det 0 1 1 = −18. Multiplying

(b) False. Consider A = 0 1 0 , then M31 = is not diagonal.

0 is linear in x and y, and hence gives a line. Each[point (x1 , y1 )] and (x

and the result holds.

5.2 Practice Problems

(c) False. For example, 1 = det 0 1 0 = det 0 1 0 − 0 0 0 , but

5.2 Properties of the Determinant

Thus det(A) = (2) (1) = 2.

Thus det(A) = (−1)1 (1) (−6) (0) = 0.

[ ] (1/4)R1 +R2 →R2 −4 −2

(3/4)R1 +R3 →R3 1 1

6. Row-reduce to echelon form:

−3 2 −1 6 (7/3)R1 +R2 →R2 −3 2 −1 6

7 −3 2 −11 (1/3)R1 +R4 →R4 0 5

11. det (A) = 1

12. det (A) = 1

det (A) + det (B) = −11 + 3 = −8 = −2 = det (A + B).

= det 1 1 0 2 0 4 = det 4 2 5 = −30; so det (A) det (B) = (1) (−30) =

det (B) = 1 + (−30) = −29 = −76 = det (A + B).

= det 2 0 3 1 −1 3 = det 5 8 −3 = 76; so det (A) det (B) =

= (11) (18) = 198

= (4) (−4) − (−1) (−2) = −18.

solution by The Unifying Theorem.

solution by The Unifying Theorem.

(b) True, by The Unifying Theorem.

followed now by an expansion along each first column,

= a11 a22 det (D) − a21 a12 det (D)

68. (a) Using row operations, we have

Since these row operations preserve det (V ), we use Exercise 67 to obtain