Unit 8, lesson 44

Constructing Jordan Form

How to build a Jordan basis for a nilpotent operator from nested bases chosen top down and lifted to chains, why the chains are independent and span, and how Jordan blocks assemble into the Jordan form.

  • Video 44
  • Jordan Form Construction and Computation

The nilpotent operator NN on F4\mathbb{F}^4 with Ne1=0Ne_1 = 0, Ne2=e1Ne_2 = e_1, Ne3=0Ne_3 = 0 and Ne4=e2+e3Ne_4 = e_2 + e_3 has the chain (e1,e2+e3,e4)(e_1, e_2 + e_3, e_4) in plain sight, but where should the second chain start, and how can we be sure that the chains neither overlap nor leave a direction out? A single chain is always independent, yet chains picked one at a time can share a bottom vector or miss part of the space. This lesson builds exactly the right chains from the top down, proves that together they form a basis, and assembles them into the Jordan form of any operator whose minimal polynomial splits. Throughout, F\mathbb{F} is R\mathbb{R} or C\mathbb{C}, spaces are finite-dimensional, and a tuple such as (1,0,1)(1, 0, 1) stands for a column vector.

Key terms

Jordan block

Definition For λ∈F\lambda \in \mathbb{F} and an integer k≥1k \ge 1, the Jordan block Jk(λ)J_k(\lambda) is the k×kk \times k matrix with λ\lambda in every diagonal position, 11 in every position just above the diagonal, and 00 elsewhere,

Jk(λ)=[λ1λ⋱⋱1λ].J_k(\lambda) = \begin{bmatrix} \lambda & 1 & & \\ & \lambda & \ddots & \\ & & \ddots & 1 \\ & & & \lambda \end{bmatrix}.

In particular J1(λ)=[λ]J_1(\lambda) = [\lambda]. A linear operator TT has the matrix Jk(λ)J_k(\lambda) in an ordered basis (v1,…,vk)(v_1, \dots, v_k) exactly when

(T−λI)v1=0,(T−λI)vj=vj−1for 2≤j≤k,\begin{gathered} (T - \lambda I)v_1 = 0, \\[0.4em] (T - \lambda I)v_j = v_{j-1} \\[0.2em] \text{for } 2 \le j \le k, \end{gathered}

so the basis is a Jordan chain of length kk listed bottom first, from the eigenvector v1v_1 up to the top vector vkv_k. Listing the chain top first would put the ones below the diagonal instead. The matrix Jk(λ)−λI=Jk(0)J_k(\lambda) - \lambda I = J_k(0) is nilpotent with Jk(0)k−1≠0J_k(0)^{k-1} \ne 0 and Jk(0)k=0J_k(0)^k = 0, so the characteristic and minimal polynomials of Jk(λ)J_k(\lambda) are both (t−λ)k(t - \lambda)^k, and its eigenspace for λ\lambda is the line spanned by e1e_1.

In plain words A Jordan block is one chain written as a matrix. The eigenvalue sits on the diagonal, and each 11 above it records that T−λIT - \lambda I moves a chain vector one step down.

Example The columns of

J3(2)=[210021002]J_3(2) = \begin{bmatrix} 2 & 1 & 0 \\ 0 & 2 & 1 \\ 0 & 0 & 2 \end{bmatrix}

say that e1↦2e1e_1 \mapsto 2e_1, e2↦e1+2e2e_2 \mapsto e_1 + 2e_2 and e3↦e2+2e3e_3 \mapsto e_2 + 2e_3. The matrix (J3(2)−2I)2(J_3(2) - 2I)^2 has a single 11 in position (1,3)(1, 3), while (J3(2)−2I)3=0(J_3(2) - 2I)^3 = 0, so the minimal polynomial is (t−2)3(t - 2)^3. Although 22 has algebraic multiplicity 33, every eigenvector is a multiple of e1e_1.

Top-down basis construction

Definition Let N ⁣:V→VN \colon V \to V be nilpotent on a finite-dimensional space V≠0V \ne 0 over F\mathbb{F}, and let ss be its index, the smallest s≥1s \ge 1 with Ns=0N^s = 0. For k≥1k \ge 1 put

Ek=ker⁡N∩im⁡Nk−1,E_k = \ker N \cap \operatorname{im} N^{k-1},

with N0=IN^0 = I. A nonzero vector of EkE_k is killed by NN and equals Nk−1wN^{k-1}w for some ww, so it can be the bottom of a chain of length kk. Each image im⁡Nk\operatorname{im} N^{k} lies inside im⁡Nk−1\operatorname{im} N^{k-1}, because Nkx=Nk−1(Nx)N^k x = N^{k-1}(Nx), so the spaces are nested,

ker⁡N=E1⊇E2⊇⋯⊇Es,Es≠0,Es+1=0.\begin{gathered} \ker N = E_1 \supseteq E_2 \supseteq \cdots \supseteq E_s, \\[0.4em] E_s \ne 0, \qquad E_{s+1} = 0. \end{gathered}

Here Es=im⁡Ns−1E_s = \operatorname{im} N^{s-1} is nonzero because Ns−1≠0N^{s-1} \ne 0, and it lies in ker⁡N\ker N because Ns=0N^s = 0. The top-down construction chooses a basis of EsE_s, extends it to a basis of Es−1E_{s-1}, and continues down to a basis of E1E_1, always keeping the vectors already chosen. A chosen vector has entry level kk if it first appears in the chosen basis of EkE_k. Two facts follow at once. For every h≥1h \ge 1 the chosen vectors with entry level at least hh form a basis of EhE_h, and exactly dim⁡Ek−dim⁡Ek+1\dim E_k - \dim E_{k+1} chosen vectors have entry level kk.

In plain words Every nonzero vector in the kernel of NN is the bottom of a chain of length one, but only the nonzero vectors of EkE_k can carry a chain of length kk. Working from the longest chains down gives each new bottom to the longest chain it can carry and never hands out the same direction twice.

Example In the opening example ker⁡N=span⁡(e1,e3)\ker N = \operatorname{span}(e_1, e_3), im⁡N=span⁡(e1,e2+e3)\operatorname{im} N = \operatorname{span}(e_1, e_2 + e_3) and im⁡N2=span⁡(e1)\operatorname{im} N^2 = \operatorname{span}(e_1), while N3=0N^3 = 0. So s=3s = 3 and

E1=span⁡(e1,e3),E2=E3=span⁡(e1),E4=0.\begin{gathered} E_1 = \operatorname{span}(e_1, e_3), \\[0.4em] E_2 = E_3 = \operatorname{span}(e_1), \\[0.4em] E_4 = 0. \end{gathered}

Choose e1e_1 as the basis of E3E_3, add nothing at E2E_2, and add e3e_3 at E1E_1. The vector e1e_1 has entry level 33 and e3e_3 has entry level 11. Both are killed by NN, but only e1e_1 can sit at the bottom of a long chain. A kernel basis chosen without the levels, such as e3e_3 and e1+e3e_1 + e_3, contains no vector of im⁡N\operatorname{im} N at all, so neither of its vectors is the bottom of a chain longer than one.

Lifting a vector to a chain

Definition Let bb be a vector of the top-down construction with entry level kk. Since b∈im⁡Nk−1b \in \operatorname{im} N^{k-1}, there is a vector w∈Vw \in V with Nk−1w=bN^{k-1}w = b, found by solving one linear system. Lifting bb means choosing such a top ww and forming the chain

(Nk−1w,Nk−2w,…,Nw,w),\bigl(N^{k-1}w, N^{k-2}w, \dots, Nw, w\bigr),

listed bottom first. Its bottom is bb. Because b≠0b \ne 0 and Nb=0Nb = 0, the top satisfies Nkw=0N^{k}w = 0 and Nk−1w≠0N^{k-1}w \ne 0, so ww is a generalized eigenvector of rank exactly kk for the eigenvalue 00, and none of the kk chain vectors is zero. For k=1k = 1 the chain is just (b)(b), and its top w=bw = b is forced. For k≥2k \ge 2 the top is not unique, since w+zw + z works equally well for every zz in ker⁡Nk−1\ker N^{k-1}, which contains the nonzero space ker⁡N\ker N.

In plain words The bottom tells you where the chain must end. Climb up by solving Nk−1w=bN^{k-1}w = b once, then walk back down by applying NN until you reach bb.

Example In the opening example e1e_1 has entry level 33. The matrix N2N^2 has a single 11 in position (1,4)(1, 4), so N2x=x4e1N^2 x = x_4 e_1 for x=(x1,x2,x3,x4)x = (x_1, x_2, x_3, x_4), and any top whose fourth coordinate is 11 works. The top w=e4w = e_4 gives the chain

(e1,  e2+e3,  e4).(e_1, \; e_2 + e_3, \; e_4).

The top w=e2+e4w = e_2 + e_4 is another valid lift, giving the chain (e1,  e1+e2+e3,  e2+e4)(e_1, \; e_1 + e_2 + e_3, \; e_2 + e_4). The vector e3e_3 has entry level 11, so its chain is (e3)(e_3) alone. Lifting e1e_1 a second time, to the chain (e1,e2)(e_1, e_2) of length two, would reuse a bottom already given to the longer chain.

Jordan basis

Definition Let T ⁣:V→VT \colon V \to V be linear on a finite-dimensional space over F\mathbb{F}. A Jordan chain of TT for λ∈F\lambda \in \mathbb{F} is a list (v1,…,vk)(v_1, \dots, v_k) with v1≠0v_1 \ne 0, (T−λI)v1=0(T - \lambda I)v_1 = 0 and (T−λI)vj=vj−1(T - \lambda I)v_j = v_{j-1} for 2≤j≤k2 \le j \le k. A Jordan basis of TT is an ordered basis of VV made by listing the vectors of finitely many Jordan chains of TT, one chain after another, each bottom first. The matrix of TT in a Jordan basis is block diagonal, with one block Jk(λ)J_k(\lambda) for each chain of length kk for λ\lambda. For a nilpotent operator every chain has λ=0\lambda = 0.

The construction rests on one theorem. Let NN be nilpotent on a finite-dimensional space V≠0V \ne 0 over F\mathbb{F}, and lift every vector of the top-down construction, a vector of entry level kk to a chain of length kk, with any choice of tops. Then all the vectors of all these chains together are linearly independent. To prove it, call the jjth vector of a chain, counted from the bottom, its level. Suppose a linear combination of all the chain vectors is 00 with some coefficient nonzero, and let hh be the highest level carrying a nonzero coefficient. Apply Nh−1N^{h-1}. A vector at a level below hh goes to 00, a vector at level hh goes to the bottom of its chain, and every term above level hh already has coefficient 00. What remains is a vanishing combination of the bottoms of the chains of length at least hh, with the level hh coefficients. Those bottoms are the vectors of entry level at least hh, which form a basis of EhE_h, so all these coefficients are zero. That contradicts the choice of hh, so every coefficient is zero.

In plain words A Jordan basis is a basis cut into chains, one chain per block. Independence of each chain on its own is not enough, because different chains could collide. Applying a power of NN pushes any relation down onto the bottoms, and the bottoms were chosen independent level by level.

Example Take the chains (e1,e2+e3,e4)(e_1, e_2 + e_3, e_4) and (e3)(e_3) found above, and suppose

ae1+b(e2+e3)+ce4+de3=0.\begin{gathered} a e_1 + b(e_2 + e_3) \\[0.4em] {} + c e_4 + d e_3 = 0. \end{gathered}

Applying N2N^2 leaves ce1=0c e_1 = 0, so c=0c = 0. Applying NN to what is left gives be1=0b e_1 = 0, so b=0b = 0. Then ae1+de3=0a e_1 + d e_3 = 0 forces a=d=0a = d = 0. So B=(e1,e2+e3,e4,e3)\mathcal{B} = (e_1, e_2 + e_3, e_4, e_3) is a Jordan basis of F4\mathbb{F}^4, and

[N]B←B=[0100001000000000],[N]_{\mathcal{B} \leftarrow \mathcal{B}} = \begin{bmatrix} 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 \end{bmatrix},

with the blocks J3(0)J_3(0) and J1(0)J_1(0). By contrast, the chains (e1,e2+e3,e4)(e_1, e_2 + e_3, e_4) and (e1,e2)(e_1, e_2) are each independent, but together they repeat e1e_1.

Dimension count for spanning

Definition Let NN be nilpotent of index ss on VV with dim⁡V=n≥1\dim V = n \ge 1, and let dk=dim⁡Ekd_k = \dim E_k, so that ds+1=0d_{s+1} = 0. The construction gives dk−dk+1d_k - d_{k+1} chains of length exactly kk. Counting their vectors chain by chain, or level by level with dkd_k vectors at level kk, gives the same total,

∑k=1sk (dk−dk+1)=∑k=1sdk.\sum_{k=1}^{s} k\,(d_k - d_{k+1}) = \sum_{k=1}^{s} d_k.

To find dkd_k without knowing any chains, restrict NN to im⁡Nk−1\operatorname{im} N^{k-1}. This restriction maps onto im⁡Nk\operatorname{im} N^k and its kernel is EkE_k, so rank-nullity gives

dk=rank⁡Nk−1−rank⁡Nk.d_k = \operatorname{rank} N^{k-1} - \operatorname{rank} N^{k}.

The sum telescopes,

∑k=1sdk=rank⁡N0−rank⁡Ns=n−0=n.\begin{aligned} \sum_{k=1}^{s} d_k &= \operatorname{rank} N^0 - \operatorname{rank} N^s \\[0.4em] &= n - 0 = n. \end{aligned}

So the chain vectors form an independent list of n=dim⁡Vn = \dim V vectors, which is a basis of VV. Every nilpotent operator on a nonzero finite-dimensional space over R\mathbb{R} or C\mathbb{C} therefore has a Jordan basis, and this nilpotent case needs no splitting assumption.

In plain words Independence shows that the chains do not overlap, and the count shows that they leave nothing out. Level kk of the chains holds exactly dim⁡Ek\dim E_k vectors, and rank-nullity says these numbers add up to dim⁡V\dim V. The count uses only ranks of powers of NN, so it does not assume the Jordan form it is used to prove.

Example In the opening example the ranks of N0N^0, NN, N2N^2 and N3N^3 are 44, 22, 11 and 00, so d1=2d_1 = 2, d2=1d_2 = 1 and d3=1d_3 = 1, matching the spaces found above. There is d3−d4=1d_3 - d_4 = 1 chain of length 33, there are d2−d3=0d_2 - d_3 = 0 chains of length 22, and there is d1−d2=1d_1 - d_2 = 1 chain of length 11, for 3+1=4=2+1+13 + 1 = 4 = 2 + 1 + 1 vectors. Watch for this. The telescoping step needs Ns=0N^s = 0. For M=diag⁡(0,1)M = \operatorname{diag}(0, 1), which is not nilpotent, the ranks of I,M,M2,…I, M, M^2, \dots are 2,1,1,…2, 1, 1, \dots, so E1=span⁡(e1)E_1 = \operatorname{span}(e_1) and E2=0E_2 = 0, and the construction produces one vector in a space of dimension 22. It only reaches the generalized eigenspace of 00, which is why the construction is applied to T−λIT - \lambda I restricted to each generalized eigenspace.

Jordan form

Definition A Jordan matrix is a block diagonal matrix whose diagonal blocks are Jordan blocks. A Jordan form of a linear operator TT is a Jordan matrix that represents TT in some basis, and a Jordan form of a square matrix AA is a Jordan matrix similar to AA over F\mathbb{F}. The existence theorem reads as follows. Let V≠0V \ne 0 be finite-dimensional over F\mathbb{F} and let T ⁣:V→VT \colon V \to V be linear with minimal polynomial

μT(t)=∏j=1r(t−λj)sj,\mu_T(t) = \prod_{j=1}^{r} (t - \lambda_j)^{s_j},

where λ1,…,λr∈F\lambda_1, \dots, \lambda_r \in \mathbb{F} are distinct and every sj≥1s_j \ge 1, that is, μT\mu_T splits over F\mathbb{F}. Then VV has a Jordan basis B\mathcal{B} for TT, so [T]B←B[T]_{\mathcal{B} \leftarrow \mathcal{B}} is a Jordan matrix. For a matrix A∈Fn×nA \in \mathbb{F}^{n \times n} whose minimal polynomial splits, this says P−1AP=JP^{-1}AP = J for a Jordan matrix JJ and an invertible P∈Fn×nP \in \mathbb{F}^{n \times n} whose columns form a Jordan basis. Over C\mathbb{C} the hypothesis always holds, by the fundamental theorem of algebra. The hypothesis is also necessary. A Jordan matrix is upper triangular, so if TT has a Jordan basis, then χT\chi_T is a product of linear factors over F\mathbb{F}, and so is its divisor μT\mu_T.

The proof joins the pieces. The generalized eigenspace decomposition gives V=Gλ1⊕⋯⊕GλrV = G_{\lambda_1} \oplus \cdots \oplus G_{\lambda_r} with each GλjG_{\lambda_j} invariant under TT, and on GλjG_{\lambda_j} the operator Nj=T−λjIN_j = T - \lambda_j I is nilpotent of index sjs_j. A Jordan basis of GλjG_{\lambda_j} for NjN_j is a Jordan basis for the restriction of TT, with eigenvalue λj\lambda_j, because T=λjI+NjT = \lambda_j I + N_j there. Joining these bases gives a basis of VV because the sum is direct. The blocks for λj\lambda_j fill GλjG_{\lambda_j}, so their sizes add up to the algebraic multiplicity of λj\lambda_j, and the largest has size sjs_j. The Jordan basis is not unique, since every chain can be rescaled by a scalar c∉{0,1}c \notin \{0, 1\}. In addition, a chain of length at least 22 can be lifted from a different top, and two or more blocks can be listed in another order.

In plain words Separate the eigenvalues first, build chains inside each piece where T−λIT - \lambda I is nilpotent, and place the pieces side by side. Over R\mathbb{R} this works exactly when every root of the minimal polynomial is real.

Example With the chains found above, the matrix A=2I+NA = 2I + N on F4\mathbb{F}^4 satisfies P−1AP=JP^{-1}AP = J for

P=[1000010001010010],J=[2100021000200002],\begin{gathered} P = \begin{bmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 1 & 0 & 1 \\ 0 & 0 & 1 & 0 \end{bmatrix}, \\[0.4em] J = \begin{bmatrix} 2 & 1 & 0 & 0 \\ 0 & 2 & 1 & 0 \\ 0 & 0 & 2 & 0 \\ 0 & 0 & 0 & 2 \end{bmatrix}, \end{gathered}

with the blocks J3(2)J_3(2) and J1(2)J_1(2). The other lift (e1,e1+e2+e3,e2+e4)(e_1, e_1 + e_2 + e_3, e_2 + e_4) changes PP but not JJ, and listing the chain (e3)(e_3) first gives the Jordan matrix with blocks J1(2)J_1(2) and J3(2)J_3(2) in that order. Over R\mathbb{R} the quarter turn with rows (0,−1)(0, -1) and (1,0)(1, 0) has minimal polynomial t2+1t^2 + 1, which does not split, so it has no Jordan basis in R2\mathbb{R}^2. Over C\mathbb{C} its Jordan form is diag⁡(i,−i)\operatorname{diag}(i, -i).

Check yourself

  1. A nilpotent operator NN on VV has dim⁡E1=3\dim E_1 = 3, dim⁡E2=3\dim E_2 = 3, dim⁡E3=1\dim E_3 = 1 and E4=0E_4 = 0, where Ek=ker⁡N∩im⁡Nk−1E_k = \ker N \cap \operatorname{im} N^{k-1}. How many chains of each length does the construction produce, what is dim⁡V\dim V, and what is the rank of NN?
Show the answer

The number of chains of length exactly kk is dk−dk+1d_k - d_{k+1}. That gives 3−3=03 - 3 = 0 chains of length 11, 3−1=23 - 1 = 2 chains of length 22 and 1−0=11 - 0 = 1 chain of length 33. So the dimension of VV is 2⋅2+1⋅3=72 \cdot 2 + 1 \cdot 3 = 7, which agrees with the level count 3+3+1=73 + 3 + 1 = 7. Since E1=ker⁡NE_1 = \ker N has dimension 33, rank-nullity gives rank⁡N=7−3=4\operatorname{rank} N = 7 - 3 = 4.

  1. Let NN act on F3\mathbb{F}^3 by Ne1=0Ne_1 = 0, Ne2=e1Ne_2 = e_1 and Ne3=e1Ne_3 = e_1. Its kernel has basis e1e_1, e2−e3e_2 - e_3, and a student tries to lift both basis vectors to chains of length two. What goes wrong? Find a Jordan basis and the matrix of NN in it.
Show the answer

For x=(x1,x2,x3)x = (x_1, x_2, x_3) we have Nx=(x2+x3)e1Nx = (x_2 + x_3)e_1, so im⁡N=span⁡(e1)\operatorname{im} N = \operatorname{span}(e_1) and N2=0N^2 = 0. A chain of length two with bottom e2−e3e_2 - e_3 would need a top ww with Nw=e2−e3Nw = e_2 - e_3, which is impossible because e2−e3∉im⁡Ne_2 - e_3 \notin \operatorname{im} N. The levels detect this, since E2=ker⁡N∩im⁡N=span⁡(e1)E_2 = \ker N \cap \operatorname{im} N = \operatorname{span}(e_1) while E1=ker⁡NE_1 = \ker N. Choose e1e_1 as the basis of E2E_2 and add e2−e3e_2 - e_3 at E1E_1. Lift e1e_1 with the top w=e2w = e_2. The Jordan basis is B=(e1,e2,e2−e3)\mathcal{B} = (e_1, e_2, e_2 - e_3), and since N(e2−e3)=e1−e1=0N(e_2 - e_3) = e_1 - e_1 = 0,

[N]B←B=[010000000],[N]_{\mathcal{B} \leftarrow \mathcal{B}} = \begin{bmatrix} 0 & 1 & 0 \\ 0 & 0 & 0 \\ 0 & 0 & 0 \end{bmatrix},

with the blocks J2(0)J_2(0) and J1(0)J_1(0). The count agrees, with d1+d2=2+1=3d_1 + d_2 = 2 + 1 = 3 vectors.

  1. Find a Jordan basis and the Jordan form of
A=[111011003].A = \begin{bmatrix} 1 & 1 & 1 \\ 0 & 1 & 1 \\ 0 & 0 & 3 \end{bmatrix}.
Show the answer

The matrix is upper triangular, so χA(t)=(t−1)2(t−3)\chi_A(t) = (t - 1)^2(t - 3). For the eigenvalue 11,

A−I=[011001002]A - I = \begin{bmatrix} 0 & 1 & 1 \\ 0 & 0 & 1 \\ 0 & 0 & 2 \end{bmatrix}

has kernel span⁡(e1)\operatorname{span}(e_1), so the eigenvalue 11 has a single block, of size 22 because its generalized eigenspace has dimension 22. That space is ker⁡(A−I)2=span⁡(e1,e2)\ker(A - I)^2 = \operatorname{span}(e_1, e_2), and (A−I)e2=e1(A - I)e_2 = e_1, so (e1,e2)(e_1, e_2) is a chain. For the eigenvalue 33 the rows of (A−3I)x=0(A - 3I)x = 0 give x3=2x2x_3 = 2x_2 and 2x1=x2+x3=3x22x_1 = x_2 + x_3 = 3x_2, so (3,2,4)(3, 2, 4) is an eigenvector, and indeed A(3,2,4)=(9,6,12)A(3, 2, 4) = (9, 6, 12). The matrix PP with columns e1e_1, e2e_2 and (3,2,4)(3, 2, 4) has determinant 44, and

P−1AP=[110010003],P^{-1}AP = \begin{bmatrix} 1 & 1 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 3 \end{bmatrix},

with the blocks J2(1)J_2(1) and J1(3)J_1(3).

How this lesson connects