Professional Documents
Culture Documents
Determinants
3.1 The Determinant of a Matrix
3.2 Evaluation of a Determinant using Elementary
Row Operations
3.3 Properties of Determinants
3.4 Introduction to Eigenvalues
3.1
3.2
a11 a12
A
a
a
21 22
det( A) | A | a11a22
a21a12
Note:
a 21 a 22
21 a22
3.3
2 3
2(2) 1( 3) 4 3 7
1 2
2 1
4 2
2(2) 4(1) 4 4 0
0 3
2 4
0(4) 2(3) 0 6 6
3.4
a( i 1)1
M ij
a( i 1)1
a n1
a1( j 1)
a( i 1)( j 1)
a( i 1)( j 1)
an ( j 1)
a1( j 1)
a( i 1)( j 1)
a( i 1)( j 1)
an ( j 1)
a1n
a( i 1) n
a( i 1) n
ann
Cofactor of aij:
Cij ( 1)i j M ij
Ex:
a11 a12
A a21 a22
a31 a32
a13
a23
a33
a12 a13
M 21
a32 a33
M 22
C21 ( 1) 21 M 21 M 21
C22 ( 1) 22 M 22 M 22
a11 a13
a31 a33
3.6
ainCin
anj Cnj
a11 a12
A a21 a22
a31 a32
a13
a23
a33
0 2 1
A 3 1 2 det( A) ?
4 0 1
Sol:
2
11 1 2
1 2 3
C11 (1)
1 C12 (1)
(1)(5) 5
0 1
4 1
1 3
C13 (1)
3 1
4
4 0
a11
A a21
a31
a12
a22
a32
a13
a23
a33
a11 a12
a21 a22
a31 a32
a13
a23
a33
a11 a12
a21 a22
a31 a32
3.10
det( A) | A | 0 16 0 (4) 0 6 14
This method is only valid for matrices with the order of 3
3.11
1 2
1 1
A
0
2
4
3
3 0
0 2
det( A) ?
0 3
0 2
3.12
Sol:
1 1 2
3(1)13 0 2 3
3 4 2
2
2
2 1 1
2 2 1
23 1 1
3(0)( 1)
(2)( 1)
(3)( 1)
2
3
2
3
4
Ex:
upper triangular
a11 0 0
a21 a22 0
a a a
31 32 33
lower triangular
a11 0 0
0 a22 0
0 0 a
33
diagonal
3.14
On the next slide, we only take the case of upper triangular matrices
for example to prove Theorem 3.2. It is straightforward to apply the
following proof for the cases of lower triangular and diagonal
matrices.
3.15
0
0
1
3
0
0
0
3
Sol:
1
0
(b) B 0
0
0
0
3
0
0
0
0
0
2
0
0
0
0
0
0
0
0
4
0
0 2
3.16
(a) B Ii , j ( A)
det( B) det( A)
(c) B Ai(,kj) ( A)
det( B) det( A)
3.17
Ex:
1 2 3
A 0 1 4 det( A) 2
1 2 1
4 8 12
(4)
A
1 M 1 ( A)
A1 0 1 4 det( A1 ) 8
det( A1) 4det( A) (4)(2) 8
1 2 1
0
A2 1
1
1
A3 2
1
1 4
A2 I 1, 2( A)
2 3 det( A2 ) 2
det( A2) det( A) (2) 2
2 1
2 3
( 2)
A
3 A1,2 ( A)
3 2 det( A3 ) 2
det( A3) det( A) 2
2 1
3.18
2 3 10
A 1 2 2 det( A) ?
0 1 3
Sol:
2 3 10
1 2 2
I1,2
det( A) 1 2 2 2 3 10
1
0 1 3
0 1 3
Notes:
det( A1 ) det( A)
det( A) det( A1 )
3.19
1 2 2
1 2 2
1)
(
( 2)
1
A1,2
M2 7
0 7 14
( 1) (
) 0 1 2
(1/ 7)
2
3
0 1 3
0 1 3
1 2 2
( 1)
A2,3
7 0 1 2 7(1) 7
4
0 0 1
Notes:
det( A2 ) det( A1 )
1
1
det( A3 ) det( A2 ) det( A2 )
det( A3 )
7
(1/ 7)
det( A4 ) det( A3 )
3.20
Row Reduction
Order n
Additions
Multiplications
Additions
Multiplications
10
119
205
30
45
10
3,628,799
6,235,300
285
339
3.21
Notes:
det( A1 A2
An ) det( A1 ) det( A2 )
det( An )
3.22
1 2 2
A 0 3 2
1 0 1
1
2 0
B 0 1 2
3 1 2
1 2 2
| A | 0 3 2 7
1 0 1
2 0
1
| B | 0 1 2 11
3 1 2
3.23
1 8 4
1
1 2 2 2 0
AB 0 3 2 0 1 2 6 1 10
1 0 1 3 1 2 5 1
1
8 4
1
| AB | 6 1 10 77
5 1 1
Check:
|AB| = |A| |B|
3.24
Ex:
1 2 2 1 2 2 1 2 2
?
A 0 3 2 1 1 2 1 2 0 B C
1 0 1 1 0 1 1 0 1
Pf:
| A | 0(1)
2 1
| B | 1(1)
| C | 1(1)
2 2
22 1 2
2 3 1 2
3(1)
2(1)
0 1
1 1
1 0
2 1
2 1
2 2
2 2 1 2
2 3 1 2
1(1)
2(1)
0 1
1 1
1 0
2 2
2 2 1 2
2 3 1 2
2(1)
0(1)
0 1
1 1
1 0
3.25
Ex 2:
1 2 4
10 20 40
A 30
0 50 , if 3 0 5 5, find |A|
20 30 10
2 3 1
Sol:
1 2 4
1 2 4
3
0 5 (1000)(5) 5000
A 10 3
0 5 A 10 3
2 3 1
2 3 1
3.26
3.27
0 2 1
A 3 2 1
3 2 1
0 2 1
B 3 2 1
3 2
1
Sol:
A 0
B 12 0
3.28
Ex 4:
1 0 3
A 0 1 2
2 1 0
(a) A1 ?
(b)
AT ?
Sol:
1 0 3
| A | 0 1 2 4
2 1 0
1 1
A 4
AT A 4
A1
3.29
Matrix A
Invertible
Real number c
det( A) 0
A1 exists and det( A1 )
Noninvertible det( A) 0
c0
1
det( A)
c 1 exists and c 1 =
1
c
c0
1
1
1
det( A )
det(
A
)
0
1 1 1
c = =
c 0
3.30
3x1
3x1
2 x2
2 x2
2 x2
x3
x3
x3
4
4
3x1
3x1
2 x2
2 x2
2 x2
4
4
(a)
(b)
x3
x3
x3
3.31
Sol:
(a) Ax b (the coefficient matrix is the matrix A in Ex 3)
A 0 (from Ex 3)
This system does not have a unique solution
B 12 0 (from Ex 3)
3.32