## Determining Generalized Eigenvectors

Our definition of a generalized eigenvector looks a lot like the one for an eigenvector. But finding them may not be as straightforward as our method for finding eigenvectors. In particular, we’re asking that the vector be in the kernel of not one transformation, but some transformation in a whole infinite list of them. We can’t just go ahead and apply each transformation, hoping to find one that sends our vector to zero.

Maybe the form of this list can help us. We’re really just taking the one transformation and applying it over and over again. So we could start with and calculate , and then , and so on, until we end up with . That’s all well and good if *is* a generalized eigenvector, but what if it isn’t? At what point do we stop and say we’re never going to get to zero?

The first thing we have to notice is that as we go along the list of transformations, the kernel never shrinks. That is, if then

Thus, we have an increasing sequence of subspaces

Next we have to recognize that this sequence is *strictly* increasing until it levels out. That is, if then . Then, of course, we can use an inductive argument to see that all the kernels from that point on are the same. But why does this happen? Well, let’s say that implies that (the other implication we’ve already taken care of above). Then we can see that implies that by rewriting them:

where we have used the assumed implication between the second and third lines.

So once this sequence stops growing at one step, it never grows again. That is, if the kernels ever stabilize the sequence looks like

and is as large as it ever gets.

So does the sequence top out? Of course, it has to! Indeed, each step before it stops growing raises the dimension by at least one, so if it didn’t stop by step it would get bigger than the space itself, which is absurd because these are all *sub*spaces of . So is the largest of these kernels.

Where does this leave us? We’ve established that if is in the kernel of *any* power of it will be in . Thus the space of generalized eigenvectors with eigenvalue is exactly this kernel. Now finding generalized eigenvectors is just as easy as finding eigenvectors.

[…] points, it’s going to be useful to have a sort of dual to the increasing chain of subspaces we found yesterday. Instead of kernels, we’ll deal with […]

Pingback by Images of Powers of Transformations « The Unapologetic Mathematician | February 18, 2009 |

[…] turns out that generalized eigenspaces do capture this notion, and we have a way of calculating them to boot! That is, I’m asserting that the multiplicity of an eigenvalue is both the number of […]

Pingback by The Multiplicity of an Eigenvalue « The Unapologetic Mathematician | February 19, 2009 |

[…] a single transformation whose only eigenvalue is . That is, for sufficiently large powers . We’ve seen that is sufficiently large a power to take to check if is nilpotent. We’ve also seen that […]

Pingback by Nilpotent Transformations I « The Unapologetic Mathematician | February 26, 2009 |

[…] polynomial of , whose roots are the eigenvalues of . For each eigenvalue , we can define the generalized eigenspace as the kernel , since if some power of kills a vector then the th power […]

Pingback by Jordan Normal Form « The Unapologetic Mathematician | March 4, 2009 |

[…] same argument as before tells us that the kernel will stabilize by the time we take powers of an operator, so we […]

Pingback by Generalized Eigenvectors of an Eigenpair « The Unapologetic Mathematician | April 6, 2009 |