Lecture 22
Chapter V Eigenvalue and Eigenvectors
Upper Triangular Matrices 5C
Theorem 5.44
Let be a linear operator, then has an upper triangular matrix (with respect to some basis), if the minimal polynomial is for
Proof:
easy
Suppose the minimal polynomial of is
Then we do induction on .
Base case: , then , but has an upper triangular matrix,
Induction step: , Suppose the results holds for smaller . Let , is invariant under , consider .
Note that if , . Thus the minimal polynomial of divides
Corollary 5.47 (staring point for Jordan Canonical Form)
Suppose is a finite dimensional complex vector space, and , then has an upper triangular matrix with respect to some basis.
Recall: is upper triangular . where is a basis.
Let be a basis for such that (such thing exists because is upper triangular.
Extend to a basis of , , then
and
Thus with respect to the same basis is upper triangular.
Example:
and the minimal polynomial is
which is upper triangular.
5D Diagonalizable Operations
Definition 5.48
A Diagonal matrix is a matrix where all entries except the diagonal is zero
Example:
Definition 5.50
An operator is diagonalizable if is diagonalizable with respect to some basis.
Example:
, , so the eigenvalues are with eigenvector , and with eigenvector . The eigenvectors for are
and is diagonalizable.
Definition 5.52
Let . the eigenspace of corresponding to is the subspace defined by
Example:
,
Theorem 5.54
Suppose are distinct eigenvalues of , Then
is a direct sum. In particular if is finite dimensional.
Proof:
Need to show that if for then for . i.e eigenvectors for distinct eigenvalues are linearly independent. (Prop 5.11)