Ch02 (Linear Algebra)
Ch02 (Linear Algebra)
1 Introduction to Determinants
EXAMPLE:
1 2 3 4
5 6 7 8
A= A 23 =
9 10 11 12
13 14 15 16
a b
Recall that det = ad − bc and we let deta = a.
c d
1
1 2 0
EXAMPLE: Compute the determinant of A = 3 −1 2
2 0 1
Solution
−1 2 3 2 3 −1
det A = 1 det − 2 det + 0 det
0 1 2 1 2 0
= ______________________________ = ______
3 2 3 2
Common notation: det = .
2 1 2 1
So
1 2 0
−1 2 3 2 3 −1
3 −1 2 =1 −2 +0
0 1 2 1 2 0
2 0 1
1 2 0
3 −1 2 = 1C 11 + 2C 12 + 0C 13
2 0 1
2
THEOREM 1 The determinant of an n × n matrix A can be
computed by a cofactor expansion across any row or down any
column:
+ − + ⋯
− + − ⋯
+ − + ⋯
⋮ ⋮ ⋮ ⋱
1 2 0
EXAMPLE: Compute the determinant of A = 3 −1 2
2 0 1
using cofactor expansion down column 3.
Solution
1 2 0
3 −1 1 2 1 2
3 −1 2 =0 −2 +1 = 1.
2 0 2 0 3 −1
2 0 1
3
1 2 3 4
0 2 1 5
EXAMPLE: Compute the determinant of A =
0 0 2 1
0 0 3 5
Solution
1 2 3 4
0 2 1 5
0 0 2 1
0 0 3 5
2 1 5 2 3 4 2 3 4 2 3 4
=1 0 2 1 −0 0 2 1 +0 2 1 5 −0 2 1 5
0 3 5 0 3 5 0 3 5 0 2 1
2 1
= 1⋅2 = 14
3 5
4
Triangular Matrices:
∗ ∗ ⋯ ∗ ∗ ∗ 0 0 0 0
0 ∗ ⋯ ∗ ∗ ∗ ∗ 0 0 0
0 0 ⋱ ∗ ∗ ∗ ∗ ⋱ 0 0
0 0 0 ∗ ∗ ∗ ∗ ⋯ ∗ 0
0 0 0 0 ∗ ∗ ∗ ⋯ ∗ ∗
(upper triangular) (lower triangular)
EXAMPLE:
2 3 4 5
0 1 2 3
= _____________________ = − 24
0 0 −3 5
0 0 0 4
5
3.2 Properties of Determinants
1 2 3 4
0 5 0 0
EXAMPLE: Compute .
2 7 6 10
2 9 7 11
Solution
1 2 3 4
1 3 4 1 3 4
0 5 0 0
= 5 2 6 10 =5 0 0 2
2 7 6 10
2 7 11 2 7 11
2 9 7 11
1 3 4 1 3 4
=5 0 0 2 = −5 0 1 3 = _________ = ____.
0 1 3 0 0 2
6
∗ ∗ ∗ ∗ ∗ ∗
Theorem 3(c) indicates that −2k 5k 4k = k −2 5 4 .
∗ ∗ ∗ ∗ ∗ ∗
2 4 6
EXAMPLE: Compute 5 6 7
7 6 10
Solution
2 4 6 1 2 3 1 2 3
5 6 7 =2 5 6 7 = 2 0 −4 −8
7 6 10 7 6 10 0 −8 −11
1 2 3 1 2 3
= 2−4 0 1 2 = 2−4 0 1 2
0 −8 −11 0 0 5
= 2−4115 = − 40
7
2 3 0 1
4 7 0 3
EXAMPLE: Compute using a combination of
7 9 −2 4
1 2 0 4
row reduction and cofactor expansion.
2 3 0 1
2 3 1 2 3 1
4 7 0 3
Solution = −2 4 7 3 = −2 0 1 1
7 9 −2 4
1 2 4 1 2 4
1 2 0 4
2 3 1 1 2 4 1 2 4
=2 1 2 4 = −2 2 3 1 = −2 0 −1 −7
0 1 1 0 1 1 0 1 1
1 2 4
= −2 0 −1 −7 = −21 −1 −6 = − 12.
0 0 −6
8
■ ∗ ∗ ⋯ ∗
0 ■ ∗ ⋯ ∗
Suppose A has been reduced to U = 0 0 ■ ⋯ ∗ by
0 0 0 ⋱ ⋮
0 0 0 0 ■
row replacements and row interchanges, then
product of
−1 r
when A is invertible
det A = pivots in U
0 when A is not invertible
T
a b a c
det = det = ad − bc
c d b d
a b a c
⇒ det = det .
c d b d
9
(3 × 3 case)
a b c
e f d f d e
det d e f =a −b +c
h i g i g h
g h i
a d g
e h d g d g
det b e h =a −b +c
f i f i e h
c f i
a b c a d g
⇒ det d e f = det b e h .
g h i c f i
Implications of Theorem 5?
Theorem 3 still holds if the word row is replaced
with ___________________.
10
THEOREM 6 (Multiplicative Property)
For n × n matrices A and B, detAB = det A det B .
= ______________ = ________.
Solution: Since
det A det B = det AB = 0
and
det B ≠ 0,
11