Lecture 28 - Continuing Jordan Block Decomposition
Last time we looked at the following:
An Example
Let's do an example to get our feet wet. Suppose with . Further, we suppose that:
So since have non-trivial nullspaces, we can choose vectors from each of them:
Choose such that . Note that
Now consider . They are vectors which are in plus something in . But we know that so then is a valid basis for it.
Now consider , is a basis for .
Consider , then is a start, but we need to add 2 more vectors. Thus add in this list. So we have .
Consider . It's dimension is 4 so have where is added on.
In general:
Choose such that for .
Find a basis for where .
Repeat for growing values of , moving over the difference in dimensions of our nullspace chain.
Notice that the dimension of the first quotient space was 1, then 1, then 3, then 4, taking the differences of each dimension as we start from the right and move to the left. In fact, we did a HW Problem that showed a similar part of this relationship, showing the iterative step:
13
Theorem
Suppose is a subspace of and is a basis of and is a basis of . Then is a basis of .
Proof
Let's determine if it's a basis by equating dimension, and determining LI.
First, the dimension of is given by the first basis, and the dimension of is via the second basis. As such, then:
so the proposed basis has the right number of vectors from .
Now for LI. Consider when:
Notice that our first basis for implies that for any that if:
Then all , which becomes:
So namely we've found that must be LI. We already know that the same thing occurs for showing those vectors are LI.
Notice that if then we are done since then:
So all as required. Now instead, say that , call it . We'll show that this is impossible via contradiction. So then:
Clearly if then we'd have which is a contradiction, so suppose the sum equals . Then:
But this is a contradiction! This is because then since . That implies that , which implies that which is a contradiction. As such, we must have one of , so then we get that all and thus the list of vectors are LI.
As such, the list of vectors is LI and of size , so then it's a valid basis for .
☐
In the end, we get the basis:
This basis is actually called a Jordan-Basis. Notice that the first vector in each cycle is an eigenvector since, for example:
since . We can repeat this process.
This will create a block diagonal matrix:
notice that the matrix for would just have 's on the diagonal.
Proposition
Given a nilpotent operator and corresponding non-negative integers such that:
is a basis for
for all , so the 's are eigenvectors of .
Jordan Form
Recall that . If we happen to find bases where each is a basis for , then:
is block diagonal. And one block looks like where is nilpotent while is diagonalizable.
Each block is called a Jordan-Block. To save notation we define:
where here is in size.
THEREFORE if you have any then we make the bases up above such that: