Lecture 19
Chapter V Eigenvalue and Eigenvectors
Invariant Subspaces 5A
Proposition 5.11
Suppose , let be eigenvectors for distinct eigenvalues . Then is linearly independent.
Proof:
Suppose is linearly dependent, we can assume that is linearly independent. So let not all . such that , then we apply (map to 0)
so
but not all of the are zero and for so they must be linearly independent.
Theorem 5.12
Suppose and then has at most distinct eigenvalues
Proof:
Since no linearly independent list has length than so by Proposition 5.11, there are at most distinct eigenvalues.
Polynomials on operators
let
Notation
(m times) must be an operator within the same space
(where is invertible)
if with and is a vector space over
Lemma 5.17
Given ,
then
a)
b)
Theorem 5.18
Suppose , then and are invariant with respect to .
5B The Minimal Polynomial
Theorem 5.15
Every operator on finite dimensional complex vector space has at least on eigenvalues.
Proof:
Let be a nonzero vector.
Now consider . Since this list is of length , there is a linear dependence. Let be the smallest integer such that is linearly dependent, then
Let , then
factors as where
but was minimal so that were linearly independent, so , so is an eigenvalue with eigenvector
Definition 5.24
Suppose is finite dimensional , then the minimal polynomial is the unique monic (the coefficient of the highest degree is 1) polynomial of minimal degree such that
Theorem 5.27
Let be finite dimensional, and , the minimal polynomial.
- The roots of are exactly the eigenvalues of .
- If , where are all the eigenvalues.