Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
9 views6 pages

Section 5.3-1

A square matrix A is diagonalizable if it is similar to a diagonal matrix, represented as A = P DP −1, where P is an invertible matrix and D is a diagonal matrix. A matrix is diagonalizable if it has n linearly independent eigenvectors, and if it has distinct eigenvalues, it is guaranteed to be diagonalizable. The document also discusses the relationship between the geometric and algebraic multiplicities of eigenvalues in determining diagonalizability.

Uploaded by

attilathehun24
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
9 views6 pages

Section 5.3-1

A square matrix A is diagonalizable if it is similar to a diagonal matrix, represented as A = P DP −1, where P is an invertible matrix and D is a diagonal matrix. A matrix is diagonalizable if it has n linearly independent eigenvectors, and if it has distinct eigenvalues, it is guaranteed to be diagonalizable. The document also discusses the relationship between the geometric and algebraic multiplicities of eigenvalues in determining diagonalizability.

Uploaded by

attilathehun24
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/ 6

Section 5.

3 - Diagonalization

Definition. Let A be a square matrix. Then A is diagonalizable if A is similar to a diagonal


matrix. That is, A = P DP −1 for some invertible matrix P and diagonal matrix D. We say that
P diagonalizes A.

   1  
3 0 0 2 −1 0
Example. Let A = ,P = , and D = . Verify that A = P DP −1 , so A
8 −1 1 1 0 3
is diagonalizable.

Theorem. (Diagonalization Theorem) Let A be an n × n matrix. Then A is diagonalizable


iff A has n linearly independent eigenvectors.
In fact, A = P DP −1 where D is a diagonal matrix iff the columns of P are n linearly
independent eigenvectors of A, and in this case, the diagonal entries of D are eigenvalues of
A corresponding, respectively, to those eigenvectors in the matrix P .

7
Section 5.3 - Diagonalization

 
0 0 −2
Example. Diagonalize A = 1 2 1 , if possible.
1 0 3

Theorem. Let λ1 , λ2 , . . . , λp be distinct eigenvalues of A and let Eλ1 , Eλ2 , . . . Eλp be the
corresponding eigenspaces. If Si is a linearly independent subset of Eλi , then S1 ∪S2 ∪· · ·∪Sp
is also linearly independent.

Theorem. Let A be an n×n matrix. If A has n distinct eigenvalues, then A is diagonalizable.

8
Section 5.3 - Diagonalization

Example. Determine whether A is diagonalizable.


 
1 2 3
1. A = 0 4 5
0 0 6

 
1 0 0
2. A = 0 2 0
0 0 2

 
2 1 0
3. A = 0 2 0
0 0 0

9
Section 5.3 - Diagonalization

Theorem. Let A be an n × n matrix with distinct eigenvalues λ1 , λ2 , . . . , λp .

ˆ For all i = 1, 2, . . . , p, the dimension of the eigenspace for λi , called the


geometric multiplicity of λi , is less than or equal to the algebraic multiplicity of λi .

ˆ A is diagonalizable iff the sum of the geometric multiplicities of all of its eigenvalues
is equal to n.

ˆ A is diagonalizable iff the characteristic polynomial of A splits completely into linear


factors and for each i = 1, 2, . . . , p, the geometric multiplicity of λi is equal to the
algebraic multiplicity of λi .

ˆ If A is diagonalizable and βi is a basis for the eigenspace for λi , then β1 ∪ β2 ∪ · · · ∪ βp


is an eigenvector basis for Rn .

Powers of a Diagonalizable Matrix


If A is diagonalizable, then for some invertible matrix P and diagonal matrix D, A = P DP −1 .
Then for any positive integer k,
Ak = P Dk P −1 .

   1
3 0 0 2
Example. By the first example, A = is diagonalizable, and if P = and D =
  8 −1 1 1
−1 0
, then A = P DP −1 . Find a formula for Ak .
0 3

10

You might also like