Let be a finite-dimensional vector space, and let be a linear operator. Assume that has all real eigenvalues (alternatively, assume we’re working over the complex numbers). Let be the matrix of with respect to some standard basis of
Our goal will be to replace the basis with a basis such that the matrix of with respect to is as simple as possible. (Where we agree that the "simplest" possible matrix would be diagonal.)
Recall the following results that we’ve observed so far:
The characteristic polynomial of does not depend on the choice of basis.
The eigenvalues of are the roots of this polynomial.
The eigenspaces are -invariant subspaces of
The matrix can be diagonalized if and only if there is a basis of consisting of eigenvectors of
Suppose
Then can be diagonalized if and only if for each
In the case where can be diagonalized, we have the direct sum decomposition
The question is: what do we do if there aren’t enough eigenvectors to form a basis of When that happens, the direct sum of all the eigenspaces will not give us all of
The idea: replace with a generalized eigenspace whose dimension is
Our candidate: instead of we use where is the multiplicity of
1.
Recall that in class we proved that and are -invariant subspaces. Let be any polynomial, and prove that and are also -invariant.
Hint: first show that for any polynomial
Applying the result of Problem 1 to the polynomial shows that is -invariant. It is possible to show that but I won’t ask you to do that. (A proof is in the book by Nicholson if you really want to see it.)
Instead, we will try to understand what’s going on by exploring an example.
Consider the following matrix.
2.
3.
Find the eigenvectors. What are the dimensions of the eigenspaces? Based on this observation, can be diagonalized?
4.
Prove that for any matrix we have
It turns out that at some point, the null spaces stabilize. If for some then for all
5.
For each eigenvalue found in
Worksheet Exercise 5.5.2, compute the nullspace of
etc. until you find two consecutive nullspaces that are the same.
By
Worksheet Exercise 5.5.4, any vector in
will also be a vector in
In particular, at each step, we can find a basis for
that includes the basis for
For each eigenvalue found in
Worksheet Exercise 5.5.2, determine such a basis for the corresponding generalized eigenspace. You will want to list your vectors so that the vectors from the basis of the nullspace for
come first, then the vectors for the basis of the nullspace for
and so on.
6.
Finally, let’s see how all of this works. Let be the matrix whose columns consist of the vectors found in Problem 4. What do you get when you compute the matrix