Skip to main content

Linear Algebra II · Rational and Jordan canonical forms

Read every nilpotent Jordan block from kernel growth

Problem

Linear Algebra II practice problem

Let NN be a nilpotent operator on a 1010-dimensional vector space over a field F\mathbb F. Set dk=dim⁡ker⁡Nkd_k=\dim\ker N^k, with d0=0d_0=0, and suppose(d0,d1,d2,d3,d4)=(0,4,7,9,10).(d_0,d_1,d_2,d_3,d_4)=(0,4,7,9,10).1. Starting from the contribution of one nilpotent Jordan block, prove thatbk=dk−dk−1b_k=d_k-d_{k-1}equals the number of Jordan blocks whose size is at least kk.
2. Deduce a formula for the number of blocks of size exactly kk, and use it
to recover the complete Jordan block multiset of NN. Check both the total dimension and the number of blocks.
3. State the Jordan form up to block order and compute the characteristic
polynomial, minimal polynomial, and
rank⁡N,rank⁡N2,rank⁡N3,rank⁡N4\operatorname{rank}N,\operatorname{rank}N^2, \operatorname{rank}N^3,\operatorname{rank}N^4.

Do not treat the nullities dkd_k themselves as block counts; justify the successive-difference rule before using it.

Hint

Hint

For a single chain, identify which of v1,…,vsv_1,\ldots,v_s are killed by NkN^k.

Check your work

Work the problem yourself first. Then open it in Training to check your answer and read the full worked solution.

The answer check and full solution for this problem come with ProofAnvil Practice membership ($19 USD monthly). See membership. Or start with the free Linear Algebra II sample problem: Try the free sample problem.

More Linear Algebra II practice problems

Back to Linear Algebra II

An original ProofAnvil practice problem, written for this course. ProofAnvil is a practice course, not a homework-answer service.