Chapter 3

Determinants
and
Diagonalization
 Contents
• 3.1. The cofactor Expansion
• 3.2.Determinants and Matrix
Inverses
• 3.3. Diagonalization and Eigenvalues
• 3.4. An Application to Linear
Recurrences
3.1. The Cofactor Expansion
 If A=[a] then the determinant of
A, denoted by detA=a
a b
 If A is an 2x2 matrix then A   
c d
a b
det A   ad  bc + - +
c d a b c
A  d e f
 If A is an 3x3 matrix then the  
determinant of A is defined by  g h i 
a b c
e f d f d e
det A  d e f  a b c
h i g i g h
g h i
 The determinant of 3x3
matrix
a b c
e f d f d e
det A  d e f  a b c
h i g i g h
g h i

 aei  bfg  cdh  ceg  afh  bdi

 The determinant of 3x3
matrix
col1 col 2 col 3 col1 col 2
col1 col 2 col 3 col1 col 2
a b c a b
1 5 4 1 5
d e f d e
0 2 6 0 2
g h i g h
0 0 3 0 0
- - - + + +

det A  aei  bfg  cdh  ceg  afh  bdi

 Find detA if
1 5 4 
A  0 2 6 
0 0 3 

col1 col 2 col 3 col1 col 2

1 5 4 1 5
0 2 6 0 2
0 0 3 0 0
- - - + + +
Note that : only use with 3x3 matrices
How to define the determinant
of an mxm matrix?
 The (i,j)-cofactor
(phần phụ đại số)
• If A is an mxm matrix then the (i,j)-cofactor of A is
defined by
cij(A)=(-1)i+jdet(Aij)
• Aij is the (m-1)x(m-1) matrix obtained from A by
deleting row i and column j of A
• For example, c23(A)=(-1)2+3det(A23)=-14
1 2 1 5  1 2 5 
0 6 4 3  0 7 0 
A   A23   
0 7 1 0 
  0 1 2 
0 1 8 2 
 Definition
If A is an mxm matrix then the determinant of
A is defined by
• detA=ai1ci1(A)+ai2ci2(A)+…+aimcim(A)
• or detA= a1jc1j(A)+a2jc2j(A)+…+amjcmj(A)
1 2 1 5
6 4 0
0 6 4 0
 1 7 1 0  68
0 7 1 0
1 8 2
0 1 8 2
 Examples
• Find the determinant of the matrices
0 2 1 5 
1 2 5  0 6 4 3
A  0 7 0  B 
0 7 1 0 
1 2 5   
0 1 8 2

1 2 1 5  1 2 1 5 
0 6 4 3 0 6 4 3
C  C'  
0 0 1 0  0 0 0 2
   
0 0 0 2 0 0 1 0 
 Properties
• If A has one row of zeros then detA=0
• If A is an triangular matrix then detA is the
product of the entries on the main diagonal

1 2 1 5
0 6 4 3
det C   1.6.  1.2  12
0 0 1 0
0 0 0 2
 Example
Suppose A is an triangular matrix, a11=4
and c11(A)=11. What is the product of all
entries on the main diagonal?

A)11 B)44 C)-11 D)-44

 Determinants and
elementary operations
• If B obtained from A by interchanging two
rows (or columns) then detB=-detA
• For example, detC’=-detC=12

1 2 1 5  1 2 1 5 
0 6 4 3 0 6 4 3
C  C'  
0 0 1 0  0 0 0 2
   
0 0 0 2 0 0 1 0 
 Examples
• If two rows (or columns) of a matrix is the
same then the determinant is zero

1 2 1 5 1 2 1 5
0 6 4 3 0 6 4 3 
C C'  C
1 2 5 6 1 2 5 6
   
1 2 5 6 1 2 5 6
 Determinants and
elementary operations
• If B is the matrix obtained from A by
multiplying one row (or column) by a nonzero
number k then detB=kdetA
• For example, detA=35, detA’=2detA=2.35=70
1 0 0  1 0 0 

A'  0 7 0  
A  0 7 0  
 
 2 4 10  1 2 5 
 Examples
Find a such that

4 8 8 1 2 2
8 4 4  a 2 1 1 ?
0 8 4 0 2 1

a) 4 b) 12 c) 48 d)64
 Examples
• Find the determinants of the matrices

1 2 5  1 2 5 
A   0 7 0  A '  0 7 0 
 2 4 10  1 2 5 
 Determinants and
elementary operations
• If B is the matrix obtained from A by adding a
multiple of one row (or column) to another
row (or column) then detB=detA
• For example,

1 2 3  1 2 3

A 0 7 0  
A '  0 7 0  
 
 2 4 10  0 0 4 
 Examples
• Find the determinants of the matrices
1 a a  1

A 2 b b2 
 
 3 c c  3 

1 a a 1 1 a a
 c c 1 3

2 b b2  2 b b 0
3 c c3 3 c c
 Examples
Find DetA and DetB:

1 2 1 5  1 2 1 5
0 6 4 3  0 6 4 
A 3
1 2 5 6 B 
1 3 4 6
   
4 8 20 24 
1 2 4 5
 Example
 6 18 
• Find det  
 1 5 

  2 6 
and compare with det  3   ?
  1 5 
 Theorem
 detA=det(AT)
 det(AB)=detA.detB
 If A is an nxn matrix then
det(kA)=kndetA

Note that det(Ak)=(detA)k

 Example
• Show that if A is an invertible matrix
then

det(A-1)=1/detA
 Example
Let A is a nxn matrix, k is a scalar.
Which of the following are false?

a) det(AT)=detA b) det(AB)=detAdetB

c) det(A+B)=detA+detB d) det(kA)=kdetA

e) det(kA)=kndetA
 Example
Let A and B are nxn matrix. Which statement is false?

a) det(A-1BA)=detB b) det(AB-1A-1B)=1

c) detAdetA-1=1 d) detAdetAT=1

e) det(ATB)=det(BTA)
 Example
1 1 1 1
0 1 1 1
det A 
0 0 3 1
0 0 0 4
a)detA=12 and det(A-1)T=12
b) detA=12 and det(A-1)T=1/12
c) detA=1/12 and det(A-1)T=12
d) detA=1/12= det(A-1)T
Determinant with block
Compute
1 7 2 6 1 7 0 0
5 2 4 1 5 2 0 0
0 0 1 2 3 1 1 2
0 0 3 4 3 2 3 4
Determinant with block
1 2 m a b 1 0 0 a b
4 5 n c d 4 5 6 c d
0 0 1 2 3 7 8 9 e f
0 0 4 0 6 0 0 0 1 2
0 0 7 0 9 0 0 0 3 4
Determinant with block
Not need be a square matrix
Square matrix

A X A 0
 det A det B
0 B Y B

Square matrix
Determinant with block
A 0
 det A det B
Y B

A X
 det A det B
0 B
3.2.Determinant and Matrix
Inverses
• If A is invertible then AIdentity matrix
• If detA ≠0 and AB by elementary
operations then detB ≠0
• A is invertible iff detA≠0
• Cramer’s Rule
• Give a formula to find A-1
 (i,j-Cofactor
(phần phụ đại số)
• cij=cij(A)=(-1)i+jdet(Aij) ( it is a number)
• Aij is the matrix obtained from A by deleting
row i and column j

1 2 1 5  1 2 5 
0 6 4 3
A  A23  0 7 0 
0 7 1 0 
  0 1 2 
0 1 8 2
 Adjugate matrix
• The adjugate matrix of A is the matrix

 c11 c21 ... cn1 

c c22 
... cn 2 
adjA   12

 ... ... ... ... 

 
c1n c2 n ... cnn 
 Theorem of Adjugate
Formula
If A is any square matrix, then
• A(adjA)=(detA)I
• In particular, if detA≠0 then A is invertible and

1
A 1
adjA
det A
Note that […]
 Example
Let A be a nxn matrix with detA=3.

Find det(adjA)?

a)1/3 b)1/2 c)2 d) 3

e) 3n-1
Example 7 p.121
Execises 1 p.126
 Cramer’s Rule
 Cramer’s system: system of n equations
involving n variables and has unique solution
 So, the coefficient matrix is invertible
 A is invertible iff detA≠0
 Cramer’s Rule
• Consider the matrix equation AX=B where A is
an invertible square matrix, X=[x1 x2 … xn]T.
That means, AX=B is a Cramer’s system. Then
the system has unique solution given by

det Ai ?
xi 
det A
Cramer’s system: AX=B
 a11 a12 ... a1n   x1   b1 
a x  b 
a22 ... a2 n   2
A   21 X   2 B
 ... ... ... ...   ...   ... 
     
 an1 an 2 ... ann   xn  bn 

 a11 b1 ... a1n 

a b2 
... a2 n  det Ai
A2   21

 ... ... ... ...  xi 


 an1 bn ... ann 
 det A
 Example 9 p.123
• Note that […]
Cramer’s rule enabled us to calculate x 1 here without
computing x2 or x3. This might seem an advantage,
but the truth of the matter is that, for large systems of
equations, the number of computations needed to find
all the variables by the Gaussian algorithm is
comparable to the number required to find one of the
determinants involved in Cramer’s rule, or the matrix
of system is not invertible and even the coefficient
matrix is not square.
 Example
Look at the following statements and choose the correct answers:

(i) If detA=0, is it true that AX=B has no solution?

(ii) If detA=0, is it true that rankA=0?

(iii) If detA is not 0, is it true that A is invertible?

(iv) If A is nxn matrix, and the equation AX=B has more than
one solution, is it true that detA=0?

a) yes, no, no, yes. b) yes, yes, no, yes.

c) no, no, yes, yes. d) no,yes,yes,no.
e) yes, no, yes, yes.
 3.3. Diagonalization and Eigenvalues

The following statements are equivalent

• A is invertible
• detA≠0
• The matrix equation AX=B has unique solution
• The homogeneous system AX=0 has only
trivial solution
• AIdentity matrix by elementary operations
 Example
 3 0 
• Compute A2,A3, and A2009 if A 
 0 2

 3 2
0  3  3
3
0
A 
2
2  , A   3
 0 2   0 2 

 3
2009
0 
A 2009
 2009 
 0 2 
 Diagonal matrices
• An nxn matrix is called diagonal matrix if all its
entries off the main diagonal are zeros
1 0 ... 0 
0  ... 0 
D 2
 diag  1 , 2 ,..., n 
 ... ... ... ... 
 
0 0 ... n 

• For example 3 0 0 0
0 2 0 0
diag 3, 2,1, 4    
0 0 1 0
 
0 0 0 4
 Theorem
• If A is an nxn matrix and P is an invertible nxn matrix
then

P AP   P A P
1 k 1 k

       AP 
k
P1
AP  P 1
AP P 1
AP P 1
AP ... P 1

 P APP APP AP...P AP  P A P

1 1 1 1 1 k
 Objective
• Find the invertible matrix P such that
• P-1AP is a diagonal matrix

P 1
AP   diag  1 , 2 ,..., n 
• Then,

P A P   P AP   diag  1 , 2 ,..., n 
1 k 1 k k k k
 Example
2009
  2 4  
Find A 2009
    ?
  1 1 
 4 1 1 1 1
P  P  
1

 1 1 5 1 4 

2009
3 0   3 0  
  P AP    
2009
P AP  
1

1
 
0 2   0 2  
 32009
0   32009
0  1
 P 1 A2009 P     A 2009
 P 2009 
P
 2    2  
2009
 0  0
 How to find P?
P   X1 X 2 ... X n 

P 1 AP  D  AP  PD  D  diag  ,  ,...,  
1 2 n

  AX 1 AX 2 ... AX n   1 X 1 2 X 2 ... n X n 

 AX i  i X i
  i I  A  X i  0, i  1, 2,..., n 
 Eigenvalues and
eigenvectors
• If A is an nxn matrix, a number λ is called an
eigenvalue of A if AX=λX for some column X≠0
• Such a nonzero column X is called an eigenvector
of A corresponding to λ, or a λ-eigenvector for
short
eigenvalue

AX   X
λ-eigenvector
 Example
• Find an eigenvalue and 3 5 
A 
eigenvector for the matrix 1 1

3 5  5  5  3 5   1  1
1 1 1  4 1 1 1  1  2  1
         
eigenvalue eigenvector
 How to find P?
P   X1 X 2 ... X n 

P AP  D  AP  PD
1
 D  diag  ,  ,...,  
1 2 n

  AX 1 AX 2 ... AX n   1 X 1 2 X 2 ... n X n 

 AX i  i X i Xi are nonzero columns
  i I  A  X i  0, i  1, 2,..., n 
det  i I  A   0, i  1, 2,..., n 
 Characteristic Polynomial
• The characteristic polynomial of an nxn matrix A is
defined by
cA(x)=det(xI-A)

3 5 
• For example, if A   
1 1
  x  3 5  
c A  x   det  xI  A   det    
  1 x  1 
  x  3 x  1  5  x 2  2 x  8
 Example
Find the eigenvalues and eigenvectors of the matrix

1 1 
A 
2 2
The characteristic polynomial of A is

x  1 1
c A ( x)   ( x  1)( x  2)  2
2 x  2
 x( x  3)
c A ( x)  0  ( x  1)( x  2)  2  0  x( x  3)  0
 1  0 we solve the equation
 1 1  1 1
 2 2    0 0 
   

The solution is
 1
X t  t is arbitrary
1
The eigenvectors of A corresponding to λ1=0 is
 1
X t  t≠0
1
  2  3 we solve the equation

 2 1  2 1
 2 1    0 0 
   

The solution is

1
X  t 2 t is arbitrary
 
1

The eigenvectors of A corresponding to 2  3 is

1
X  t 2 t≠0
 
1
 When is A diagonalizable?
Theorem

A is diagonalizable iff every eigenvalue  of multiplicity m

yields exactly m basic eigenvectors, that is,

iff the general solution of the system ( I  A) X  0

has exactly m parameters.

3.4. An Application to Linear Recurrences
 Linear Dynamical System

Definition

V0,V1,V2,… are columns such that

V0 is known and

Vk+1=AVk for each k>=0

matrix recurrence
An Application to Linear Recurrences
Thanks