Lecture 23
Chapter V Eigenvalue and Eigenvectors
5D Diagonalizable Operators
Theorem 5.55
Suppose is a finite dimensional vector space and . let be the distinct eigenvalues of , then the followings are equal:
a) is diagonalizable b) has a basis of eigenvectors of c) d)
ideas of Proof:
look at ' recall is always a distinct sum again is always a distinct sum
Example: ,
Eigenvalues:[0], Eigenvectors
There are no basis of eigenvectors, ,
Theorem 5.58
Suppose is a finite dimensional and has . distinct eigenvalues then T is diagonalizable.
Proof:
Let be the distinct elements of.. =
Then let be eigenvectors of in the same order. Note are eigenvectors for distinct eigenvectors by Theorem 5.11 they are linearly independent thus they form a basis. So by Theorem 5.55, is diagonalizable.
Example:
is diagonalizable
Theorem 5.62
Suppose finite dimensional . Then is diagonalizable if and only if the minimal polynomial is of the form for distinct
Proof:
Suppose is diagonalizable, let be the distinct eigenvalues of . And let for be a basis of eigenvectors of . We need to show
Consider , suppose . Then
So minimal polynomial divides so the minimal polynomial has distinct linear factors.
Suppose has minimal polynomial with distinct
Induction on ,
Base case: :
Then , so is diagonalizable.
Induction step: :
Suppose the statement hold for , consider , has minimal polynomial so is diagonalizable.
has distinct eigenvector.
Need to show
Corollary
If is an invariant subspace of and is diagonalizable, then is diagonalizable.
Proof:
minimal polynomial divides minimal polynomial of .
Theorem (Gershigorem Disk Theorem)
The eigenvalue of satisfies the following:
for some where