0% found this document useful (0 votes)
227 views3 pages

Diagonalization: Linear Algebra

This document discusses diagonalization of matrices. It defines what it means for a matrix to be diagonalizable and provides theorems and examples related to determining if a matrix is diagonalizable and finding the diagonalizing matrix P and corresponding diagonal matrix D. The key steps to diagonalize a matrix are to find its eigenvalues and eigenvectors, form the matrix P using the eigenvectors as columns, and calculate P^-1AP to obtain the diagonal matrix D.

Uploaded by

Lohit K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
227 views3 pages

Diagonalization: Linear Algebra

This document discusses diagonalization of matrices. It defines what it means for a matrix to be diagonalizable and provides theorems and examples related to determining if a matrix is diagonalizable and finding the diagonalizing matrix P and corresponding diagonal matrix D. The key steps to diagonalize a matrix are to find its eigenvalues and eigenvectors, form the matrix P using the eigenvectors as columns, and calculate P^-1AP to obtain the diagonal matrix D.

Uploaded by

Lohit K
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Diagonalization

Linear Algebra
MATH 2010

• The Diagonalization Problem: For a nxn matrix A, the diagonalization problem can be stated as,
does there exist an invertible matrix P such that P −1 AP is a diagonal matrix?
• Terminology: If such a P exists, then A is called diagonalizable and P is said to diagonalize A.
• Theorem If A is a nxn matrix, then the following are equivalent:
1. A is diagonalizable.
2. A has n linearly independent eigenvectors.
• Procedure for Diagonalizing a Matrix:
Step 1 Find n linearly independent eigenvectors of A, say p1 , p2 , ..., pn .
Step 2 Form the matrix P having p1 , p2 , ..., pn as its column vectors.
Step 3 The matrix P −1 AP will then be diagonal with λ1 , λ2 , ..., λn as its diagonal entries, where λi is
the eigenvalue corresponding to pi , for i = 1, 2, ..., n.
• Example: Find a matrix P , if possible, that diagonalizes
 
0 0 −2
A= 1 2 1 
1 0 3
The eigenvalues and eigenvectors are given by λ = 1 with corresponding eigenvector
 
−2
p1 =  1 
1
and λ = 2 with corresponding eigenvectors
   
−1 0
p2 =  0  and p3 =  1 
1 0
Since the matrix is 3x3 and has 3 eigenvectors, then A is diagonalizable and
 
−2 −1 0
P = 1 0 1 
1 1 0
and      
−1 0 −1 0 0 −2 −2 −1 0 1 0 0
P −1 AP =  1 0 2  1 2 1  1 0 1 = 0 2 0 
1 1 1 1 0 3 1 1 0 0 0 2
• Example: From the section on eigenvalues, we determined that λ1 = 1 and λ2 = 2 are eigenvalues of
 
1 −2 1
A= 0 1 4 
0 0 2
with corresponding eigenvectors
   
1 −7
p1 =  0  and p2 =  4 
0 1
Since there are only 2 basis vectors for the eigenspace of A, and A is a 3x3 matrix, A is not diagonal-
izable.
• Theorem: If v1 , v2 , ..., vk are eigenvectors of A corresponding to distinct eigenvalues of λ1 , λ2 , ...,
λk , then {v1 , v2 , ..., vk } is a linearly independent set.
• Theorem: If an nxn matrix A has n distinct eigenvalues, then A is diagonalizable.
• Example: Find P , if possible that diagonalizes
 
2 1
A=
3 0

and find the corresponding diagonal matrix D. We have eigenvalues λ1 = 3 with corresponding
eigenvector  
1
p1 =
1
and λ2 = −1 with corresponding eigenvector
 
−1/3
p2 =
1

Therefore,  
1 −1/3
P =
1 1
and  
3 0
D=
0 −1

• Example: Find P , if possible that diagonalizes


 
1 −1 −1
A= 1 3 1 
−3 1 −1

and find the corresponding diagonal matrix D. The three eigenvalues for A are λ1 = 3, λ2 = 2, and
λ3 = −2. The eigenvector for λ1 = 3:  
−1
p1 =  1 
1
The eigenvector for λ2 = 2:  
−1
p2 =  0 
1
The eigenvector for λ3 = −2:  
1/4
p3 =  −1/4 
1
So,
1
 
−1 −1 4
P = 1 0 − 14 
1 1 1
and  
3 0 0
D= 0 2 0 
0 0 −2

• Definition: If λ0 is an eigenvalue of an nxn matrix A, then the dimension of the eigenspace (the
number of eigenvectors) corresponding to λ0 is called the geometric multiplicity of λ0 . The number
of times that λ − λ0 appears as a factor in the characteristic polynomial of A is called the algebraic
multiplicity.
• Theorem: If A is a square matrix, then
1. For every eigenvalue of A, the geometric multiplicity is less than or equal to the algebraic multi-
plicity
2. A is diagonalizable if and only if, for every eigenvalue, the geometric multiplicity is equal to the
algebraic multiplicity.

• Computing powers: If A is an nxn matrix and P is an invertible matrix, then

(P −1 AP )2 = P −1 AP P −1 AP = P −1 A2 P

More generally,
(P −1 AP )k = P −1 AP P −1 AP = P −1 Ak P
Therefore, if A is diagonalizable, then

P −1 Ak P = (P −1 AP )k = Dk

thus
Ak = P Dk P −1

• Example: Find A13 for  


0 0 −2
A= 1 2 1 
1 0 3
We found previously that  
−2 −1 0
P = 1 0 1 
1 1 0
and  
1 0 0
D= 0 2 0 
0 0 2
Therefore,
   13    
−2 −1 0 1 0 0 −1 0 −1 −8190 0 −16382
A13 = P D13 P −1 = 1 0 1  0 213 0  1 0 2  =  8191 8192 8191 
1 1 0 0 0 213 1 1 1 8191 0 16383

• Definition An nxn matrix A is similar to an nxn matrix Q if there exists an invertible matrix P such
that P −1 AP = Q.

You might also like