# The Unapologetic Mathematician

## Generalized Eigenvectors of an Eigenpair

Just as we saw when dealing with eigenvalues, eigenvectors alone won’t cut it. We want to consider the kernel not just of one transformation, but of its powers. Specifically, we will say that $v$ is a generalized eigenvector of the eigenpair $(\tau,\delta)$ if for some power $n$ we have

$\displaystyle(T^2-\tau T+\delta I_V)^nv=0$

The same argument as before tells us that the kernel will stabilize by the time we take $d=\dim(V)$ powers of an operator, so we define the generalized eigenspace of an eigenpair $(\tau,\delta)$ to be

$\displaystyle\mathrm{Ker}\left((T^2-\tau T+\delta I_V)^d\right)$

Let’s look at these subspaces a little more closely, along with the older ones of the form $\mathrm{Ker}\left((T-\lambda I_V)^d\right)$, just to make sure they’re as well-behaved as our earlier generalized eigenspaces are. First, let $V$ be one-dimensional, so $T$ must be multiplication by $\lambda_0$. Then the kernel of $T-\lambda I_V$ is all of $V$ if $\lambda=\lambda_0$, and is trivial otherwise. On the other hand, what happens with an eigenpair $(\tau,\delta)$? Well, one application of the operator gives

$\displaystyle(T^2-\tau T+\delta I_V)v=(\lambda_0^2-\tau\lambda_0+\delta)v$

for any nonzero $v$. But this will always be itself nonzero, since we’re assuming that the polynomial $X^2-\tau X+\delta$ has no roots. Thus the generalized eigenspace of $(\tau,\delta)$ will be trivial.

Next, if $V$ is two-dimensional, either $T$ has an eigenvalue or it doesn’t. If it does, then this gives a one-dimensional invariant subspace. The argument above shows that the generalized eigenspace of any eigenpair $(\tau,\delta)$ is again trivial. But if $T$ has no eigenvalues, then the generalized eigenspace of any eigenvalue $\lambda$ is trivial. On the other hand we’ve seen that the kernel of $T^2-\tau T+\delta I_V$ is either the whole of $V$ or nothing, and the former case happens exactly when $\tau$ is the trace of $T$ and $\delta$ is its determinant.

Now if $V$ is a real vector space of any finite dimension $d$ we know we can find an almost upper-triangular form. This form is highly non-unique, but there are some patterns we can exploit as we move forward.

About these ads

### Like this:

Like Loading...

Posted by John Armstrong | Algebra, Linear Algebra

No comments yet.

« Previous | Next »

## About this weblog

This is mainly an expository blath, with occasional high-level excursions, humorous observations, rants, and musings. The main-line exposition should be accessible to the “Generally Interested Lay Audience”, as long as you trace the links back towards the basics. Check the sidebar for specific topics (under “Categories”).

I’m in the process of tweaking some aspects of the site to make it easier to refer back to older topics, so try to make the best of it for now.

• ## RSS Feeds

RSS - Posts

RSS - Comments

• ## Feedback

Got something to say? Anonymous questions, comments, and suggestions at Formspring.me!
%d bloggers like this:
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 31, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": false}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8859148025512695, "perplexity_flag": "head"}