Professional Documents
Culture Documents
2. Determinants
(Section 7.7 of Kreyszig)
Contents
1 Determinants
2 Properties of Determinants
3 Cramer’s Rule
Section 1
Determinants
Introduction
det(e1 , . . . , en ) = 1.
det(A0 ) = − det(A).
Determinants of 2 × 2 matrices
By Property 3,
0 0 1 1
det( , ) = det( , ) = 0.
1 1 0 0
Determinants of 2 × 2 matrices
By Property 5,
0 1 1 0
det( , ) = − det( , ) = −1.
1 0 0 1
Thus,
a b
det( , ) = ad − bc.
c d
Determinants of 3 × 3 matrices
Similarly, we have
a11 a12 a13 1 1 1
det( a21
a22 a23 ) = a11 a12 a13 det( 0 0
0)
a31 a32 a33 0 0 0
1 1 0
+ a11 a12 a23 det(0 0 1)
0 0 0
1 1 0
+ a11 a12 a33 det(0 0 0) + · · ·
0 0 1
There are 27 terms on the right hand side, each is the product
of n entries, one from each column, and the determinant of
the corresponding 0-1 matrix.
Determinants of 3 × 3 matrices
0 5
= 0 × 2 − 1 × 5 = −5
1 2
Example
So
|A| = 0 + 16 − 12 − (−4) − 0 − 6 = 2
Determinants of n × n matrices
In general, we have
Definition
An inversion of a permutation σ is a pair i < j such that
σ(i) > σ(j).
The number of inversions of σ is denote by I (σ).
Example:
I (2, 3, 1) = 2.
I (4, 3, 1, 2) = 5.
I (3, 2, 4, 1) = 4.
Theorem
For any permutation σ,
Definition: Determinants
Let Aij be the matrix obtained by removing the i-th row and
j-th column of the matrix A
Definition
The matrix of cofactors of A is
C11 C12 · · · C1n
C21 C22 · · · C2n
C = .. .. ..
. . .
Cn1 Cn2 · · · Cnn
Cofactor Expansions
Theorem
• For any i,
n
X
det(A) = ail Cil = ai1 Ci1 + ai2 Ci2 + ... + ain Cin .
l=1
a11 a12
= a11 a22 − a21 a12 .
a21 a22
Determinant of a 3 × 3 matrix
Answer: det(A) = 15
Exercises
Find the determinant
a 0 0
1 b 0
3 −5 c
Answer: abc.
Cofactor expansions
Example
Compute
5 −7 2 2
0 3 0 −4
−5 −8 0 3
0 5 0 −6
Solution:
5 −7 2 2
0 3 −4
0 3 0 −4 1+3
= (−1) 2 −5 −8 3
−5 −8 0 3
0 5 −6
0 5 0 −6
3 −4
= 2 (−1)2+1 (−5) = 20
5 −6
Cofactor expansions
Example
Find the determinant of
1 −2 3 0
−1 1 0 2
A=
0
2 0 3
3 4 0 −2
Solution:
−1 1 2 −1 1 2
= 3(−1)1+3 0 2 3 =3 0 2 3
3 4 −2 3 4 −2
Cofactor expansions
Solution (Cont.)
−1 1 2
1 2 −1 2
0 2 3 = (0)(−1)2+1 +(2)(−1)2+2
4 −2 3 −2
3 4 −2
−1 1
+(3)(−1)2+3
3 4
= 0 + (2)(1)(−4) + (3)(−1)(−7) = 13
Thus, det(A) = 39.
Section 2
Properties of Determinants
Triangular matrices
Theorem
If A is an n × n triangular matrix (upper triangular, lower
triangular, or diagonal), then its determinant is the product of
the entries on the main diagonal. That is
Example
If
−2 0 0 0 0
10 4 0 0 0
A=
5 0 2 0 0
7 6 0 5 0
9 2 4 1 −1
then det(A) = (−2)(4)(2)(5)(−1) = 80
Determinant of Transpose
Theorem
If A is a n × n matrix A then det(AT ) = det(A).
Proof: Let A = [aij ], AT = [bij ]. Then
X
det AT = sign(σ)bσ(1),1 bσ(2),2 ...bσ(n),n
σ
We have
bσ(1),1 bσ(2),2 ...bσ(n),n = a1,σ(1) a2,σ(2) ...an,σ(n)
= aσ−1 (1),1 aσ−1 (2),2 ...aσ−1 (n),n
where σ −1 is the inverse permutation of σ.
Since sign(σ −1 ) = sign(σ), we get
sign(σ)bσ(1),1 bσ(2),2 ...bσ(n),n = sign(σ −1 )aσ−1 (1),1 aσ−1 (2),2 ...aσ−1 (n),n .
Thus the terms in det(AT ) and det A are equal, hence
det(AT ) = det(A).
Example
If
1 2 3
A= 2 1 3
3 1 2
then
1 2 3
AT = 2 1 1
3 3 2
and
|A| = 6 = AT
Determinant and elementary row operations
Theorem
Let A be a square matrix.
1 If B is obtained from A by interchanging two rows then
det(B) = − det(A).
2 If B is obtained from A by multipling on row of A with α
then det(B) = α det(A).
3 If B is obtained from A by adding multiple of one row to
another then det(B) = det(A).
Corollary
1 If two rows (columns) of A are equal, then det(A) = 0.
2 If a row (column) of A consists entirely of zeros, then
det(A) = 0.
3 det(αA) = αn det(A), where α is a constant.
Example
• Let
1 2 3 1 2 3
A = 0 1 4 , A1 = −2 −3 −2
1 2 1 1 2 1
Evaluate
1 −4 2
−2 8 −9
−1 7 0
Solution:
1 −4 2 1 −4 2
R2 +2R1
−2 8 −9 = 0 0 −5
−1 7 0 −1 7 0
1 −4
=5 = 15.
−1 7
Example
−5 −8 0 9
Solution:
Add 2 times row 1 to row 3 to obtain
3 −1 2 −5
0 5 −3 −6
det(A) = =0
0 5 −3 −6
−5 −8 0 9
Example
Compute
1 1 1 1 .. 1
1 0 1 1 .. 1
1 1 0 1 .. 1
Dn =
. . . . . .
1 1 .. 1 0 1
1 1 1 .. 1 0
Definition
An n × n elementary matrix of type I, type II, or type III is a
matrix obtained from the identity matrix In by performing a
single elementary row (or elementary column) operation of
type I, type II or type III, respectively.
Example
Let
0 0 1 1 0 0
E1 = 0 1 0 , E2 = 0 −2 0
1 0 0 0 0 1
Then E1 is an elementary matrix of type I and E2 is an
elementary matrix of type II.
Determinants of Products
Theorem
If E is an elementary matrix, then
Theorem
If A and B are n × n matrices then
Corollary
If det(A) 6= 0 then A−1 exists and
1
det(A−1 ) = .
det(A)
Determinants and Invertibility
4 det(A) 6= 0.
Corollary
If A is a square matrix, then Ax = 0 has a nontrivial solution if
and only if det(A) = 0.
Examples
Let
1 0 3
A = 0 −1 2
2 1 0
Compute det(A−1 ), det(2A).
Solution:
1 0 3
|A| = 0 −1 2 = 4.
2 1 0
Thus
1 1
A−1 = =
|A| 4
and
|2A| = 23 |A| = 32
Exercises
Cramer’s Rule
Cramer’s Rule
We have
3 −2
D = det(A) = = 2,
−5 4
6 −2 3 6
D1 = = 40, D2 = = 54.
8 4 −5 8
Therefore,
D1 40 D2 54
x= = = 20, y = = = 27.
D 2 D 2
Example
Use Cramer’s rule to solve the system
x+ y
+ z = −2
3x − y + 2z = 4
4x + 2y + z = −8
1 1 1 −2 1 1
D= 3 −1 2 = 10, D1 = 4 −1 2 = −10
4 2 1 −8 2 1
1 −2 1 1 1 −2
D2 = 3 4 2 = −30, D3 = 3 −1 4 = 20
4 −8 1 4 2 −8
Thus,
D1 D2 D3
x= = −1, y = = −3, z = =2
Example
−2 3 −1 1 3 −1
D= 1 2 −1 = −2, D1 = 4 2 −1 = −4
−2 −1 1 3 −1 1
−2 1 −1 −2 3 1
D2 = 1 4 −1 = −6, D3 = 1 2 4 = −8
−2 3 1 −2 −1 3
Thus, x1 = 2, x2 = 3, x3 = 4.
Exercises
2
2x + 3y − z = 7
x− y+ z =1
4x − 5y + 2z = 3
Adjoint Matrix and Inverse Formula
Definition
The adjoint matrix of A, denoted by adj(A), is the transpose
of the matrix of cofactors of A,
adj (A) = C T .
Therefore,
−2 −10 6
1 −1
A−1 = adj (A) = 6 −9 8
det A 26
−4 −7 12
Homework