Lecture 21 - Starting Generalized Eigenvectors and Nilpotent Operators

For the last couple of chapters, we've always worked in a:

We will drop the inner product part and return to just pure vector spaces (still finite dimensional).

8.A: Generalized Eigenvectors and Nilpotent Operators

Context on Nilpotency

Starting with an example:

Example

Consider T∈L(R4), whose matrix representation w.r.t. the standard basis is:

M(T)=[0111001100010000]

Then:

M(T2)=M(T)2=[0012000100000000]

Then:

M(T3)=[0001000000000000]

and finally M(T4)=0→ and for higher powers

Such an operator such that there's some k∈N where Tk=0→ implies that T is nilpotent.

Generalized Eigenvectors

Given some T∈L(V), consider the sequence of subspaces:

null(T0),null(T1),…

Recall from HW 3 - Self-Adjoint and Normal Operators#7 that we can claim:

null(Ti)⊆null(Ti+1)

Because any v on the LHS implies that Tiv=0⇒TTiv=0 so it's in the right side. As a result:

Finding 1

The sequence of subspaces is weakly increasing

Also notice that once' we start to get equality in a item compared to the next, then we must have that all items after are equal as well (since we get ⊇ thus implying =)

Finding 2

As soon as equality holds, then the sequence stabilizes.

Namely:

null(T0)⊂null(T1)⊂⋯⊂null(Ti)=null(Ti+1)=⋯=…

Proof
Suppose null(Tj)=null(Tj+1). We want to show that null(Tj)=null(Tk) where j<k.

Clearly ⊆ is true since we can apply the first finding enough times to get this.

For ⊇, notice:

Tkv=0→⇒Tj+1(Tk−j−1)v=0→⇒Tj(Tk−j−1)v=0→⇒…⇒Tk−1v=0→⇒Tk−2v=0→⇒…⇒Tk−(k−j)v=0→⇒Tjv=0→

☐

Finding 3

The sequence must stabilize. Furthermore, it must stabilize by null(Tdim⁡(V))

Proof
Assume it didn't. We have:

null(T0)⊂null(T1)⊂…

But we have dim(null(Ti+1))>dim(null(Ti)). As such:

0<dim(null(T))<⋯<dim(null(Tdim⁡(V)))

But we can't keep going as the maximum dimension must be dim⁡(V).

At minimum, you always have to increase by 1, so at most you must stabilize once you apply T dim⁡(V) times.
☐

Bringing in the Nilpotents

An alternative way to describe nilpotency is that the sequence:

null(T0),...

must stabalize to V in order to be nilpotent (since once Tk=0→ is reached, then null(Tk)=null(0→)=V).

Fact

If T is nilpotent, Tdim⁡(V)=0→.

Proposition

V=null(Tdim⁡(V))⊕range(Tdim⁡(V))

Proof
First, we show the sum is direct. Suppose v is in both sets, so v∈null(Tdim⁡(V)) and v∈range(Tdim⁡(V)). From the former:

Tdim⁡(V)v=0→

and from the latter:

Tdim⁡(V)w=v

for some w∈V. Plug the latter into the former:

Tdim⁡(V)(Tdim⁡(V)w)=0→⇒T2dim⁡(V)w=0→⇒Tdim⁡(V)w=0→

Because we can use our fact that the sequence stabalizes by Tdim⁡(V). This implies that v=0→ showing it as direct.

To show equality, just use dimensionality:

\text{dim}(\text{null}(T^{\dim(V)}) \oplus \text{range}(T^{\dim(V)})) = \text{dim}(\text{null}(T^{\dim(V)})) + \text{dim}(\text{range}(T^{\dim(V)})) = \text{dim}(V) { #db8500}

Using first the direct sum property, and then at the end the FTOLM.

If T is nilpotent, the case is obvious since the left becomes V and the right becomes {0→}. If T is not nilpotent,
☐
Clearly null(T) is an important subspace of T. We know that:

{0→}⊂null(T)⊂…null(Tj)=null(Tj+1)=…

It seems that the first item null(T) and null(Tj) are both important properties of T. We can think of null(Tj) as all the vectors that eventually will get mapped to 0→ through repeated applications of T. Some just may not get sent to 0 right away.

Notice that null(T) was the eigenspace of all λ=0:

null(T)=E(0,T)

but what about null(Tj):

null(Tj)=G(0,T)

here G is the name for the generalized eigenspace. Notice that since null(T)⊆null(Tj) then:

E(0,T)⊆G(0,T)

so let's officially define generalized eigenvectors/spaces:

generalized eigenvectors/spaces

A vector v is a generalized eigenvector of T where T∈L(V) corresponding to λ if
v≠0→ and (T−λI)jv=0→ for some j∈N.