Lecture 12

[[lecture-data]]
Announcement

Exam in about 2 weeks - choose the "least bad" date.

2024-09-23

Readings

3. Chapter 3

Jordan's theorem

Recall the statement of Jordan's Theorem from last Lecture Lecture 11. Today we do the proof: uniqueness (+existence maybe later or just reading)

Theorem

For each A∈Mn there exists a Jordan Matrix J such that A is similar to J:

A=SJS−1

for S∈Mn. Further, J is unique up to reordering its Jordan blocks.

Example

A∈M3 with all eigenvalues π has 3 possible similarity classes, one for each size of largest Jordan blocks.

(see Jordan's Theorem)

Note

When we say Jordan block we mean having eigenvalues along the diagonal and all 1s on the superdiagonal.

Proof (uniqueness)

Consider a special case, A∈Mn which has only 0s as eigenvalues. A=SJS−1 where J=⊕i=1sJn2(0). What is rankA0 ?

rankA0=n1+n2+⋯+ns

Note that rankAk=rankJk and recall that

rankJk=∑i=1s(ni−k)

(this is for when the all eigenvalues are 0 !)

Dual Sequence

Consider a sequence of non-increasing natural numbers. This can be considered a partition of their sum.

Example

(5,3,3,2)

We can draw a Ferrer's Diagram of this sequence. And we can take the "transpose" or look at the number of blocks on the left side. And this gives another partition of the sum.

The dual sequence is "counting the blocks" on the left side.

Example

(5,3,3,2)∗=(4,4,3,1,1)

So order the ni of the Jordan Matrix for A in a non-increasing sequence. Then

Note

rankAℓ−1−rankAℓ=ℓth entry of the dual sequence to block sequence.

If A∈Mn has only eigenvalues zero, define sℓ:=rankAℓ−1−rankAℓ. Then (t1,t2,…)=(s1,s2,…)∗ is the block structure sequence, ie

A∼⊕i=1Jti(0)

ie, we can deduce the block structure from A itself.

More generally, suppose A∈Mn where A∼S[⊕i=1Jni(λi)]S−1. How do I convert to the case before? Consider

A−γI=S[⊕iJni(λi)−γI]S−1,γ∈C=S[⊕iJni(λi−γ)I]S−1

What if we take γ=λ1 ? Then

[Jn1(0)Jn2(0)⋱Jnq(≠0)Jnq+1(≠0)⋱]

So we have that rank(A−γI)ℓ=rank(J−γI)ℓ

=rank[Jn1(0)ℓJn2(0)ℓ⋱Jnq(≠0)ℓJnq+1(≠0)ℓ⋱]

And the blocks $$\begin{bmatrix}
J_{n_{q}}(\neq 0)^\ell & & \
& J_{n_{q+1}}(\neq 0)^\ell & \
& & \ddots
\end{bmatrix}$$ are invertible! Since we know the eigenvalues are not zero. As we increase ℓ, the rank of top of the block is going to decrease as we saw above, but the rank of the entire matrix will always include the rank of the invertible block.

Claim

If A∈Mn and we know σ(A), you can reconstruct the Jordan canonical form from
∀λ∈σ(A),rank(A−λI)ℓ∀ℓ=0,1,2,…

For A∈Mn similar to J=⊕i=1kJni(λi) such that λ1=λ2=λ3=⋯=λs≠λi∀i>s. The geometric multiplicity of λ1, call it μg=1+1+⋯+1=s , and the algebraic multiplicity of λ1, call it μa=n1+n2+n3+⋯+ns.

In particular, for any eigenvalue, the geometric multiplicity has the property that 1≤μg≤μa.

Example

A=SJS−1. Suppose J has a 3 block with π, a 2 block with π and a 2 block with e. Then the dimension of the eigenspace with eigenvalue π is the nullity of πI−A.

nullity(πI−A)=nullity(πI−SJS−1)=nullityS(πI−J)S−1=nullity(πI−J)=nullity[0−10−100−10π−eπ−e]
Exercise

So what is the geometric multiplicity of π? ie, what is the dimension of the eigenspace?

Theorem

Suppose A∈Mn. Then A∼AT.

Proof

We know that pA(t)=pAT(t). For any λ∈σ(A)[=σ(AT)] then

rank(A−λI)ℓ=[rank(A−λI)ℓ]T=rank[AT−λI]ℓ

By the theorem above, this means that we get the same Jordan canonical form for each of them, meaning they are similar to the same matrix. And since similarity is an equivalence relation, they are similar to each other as well!

FullSizeRender.jpg