The nilpotent operator on with , , and has the chain 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, is or , spaces are finite-dimensional, and a tuple such as stands for a column vector.
Key terms
Jordan block
Definition For and an integer , the Jordan block is the matrix with in every diagonal position, in every position just above the diagonal, and elsewhere,
In particular . A linear operator has the matrix in an ordered basis exactly when
so the basis is a Jordan chain of length listed bottom first, from the eigenvector up to the top vector . Listing the chain top first would put the ones below the diagonal instead. The matrix is nilpotent with and , so the characteristic and minimal polynomials of are both , and its eigenspace for is the line spanned by .
In plain words A Jordan block is one chain written as a matrix. The eigenvalue sits on the diagonal, and each above it records that moves a chain vector one step down.
Example The columns of
say that , and . The matrix has a single in position , while , so the minimal polynomial is . Although has algebraic multiplicity , every eigenvector is a multiple of .
Top-down basis construction
Definition Let be nilpotent on a finite-dimensional space over , and let be its index, the smallest with . For put
with . A nonzero vector of is killed by and equals for some , so it can be the bottom of a chain of length . Each image lies inside , because , so the spaces are nested,
Here is nonzero because , and it lies in because . The top-down construction chooses a basis of , extends it to a basis of , and continues down to a basis of , always keeping the vectors already chosen. A chosen vector has entry level if it first appears in the chosen basis of . Two facts follow at once. For every the chosen vectors with entry level at least form a basis of , and exactly chosen vectors have entry level .
In plain words Every nonzero vector in the kernel of is the bottom of a chain of length one, but only the nonzero vectors of can carry a chain of length . 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 , and , while . So and
Choose as the basis of , add nothing at , and add at . The vector has entry level and has entry level . Both are killed by , but only can sit at the bottom of a long chain. A kernel basis chosen without the levels, such as and , contains no vector of at all, so neither of its vectors is the bottom of a chain longer than one.
Lifting a vector to a chain
Definition Let be a vector of the top-down construction with entry level . Since , there is a vector with , found by solving one linear system. Lifting means choosing such a top and forming the chain
listed bottom first. Its bottom is . Because and , the top satisfies and , so is a generalized eigenvector of rank exactly for the eigenvalue , and none of the chain vectors is zero. For the chain is just , and its top is forced. For the top is not unique, since works equally well for every in , which contains the nonzero space .
In plain words The bottom tells you where the chain must end. Climb up by solving once, then walk back down by applying until you reach .
Example In the opening example has entry level . The matrix has a single in position , so for , and any top whose fourth coordinate is works. The top gives the chain
The top is another valid lift, giving the chain . The vector has entry level , so its chain is alone. Lifting a second time, to the chain of length two, would reuse a bottom already given to the longer chain.
Jordan basis
Definition Let be linear on a finite-dimensional space over . A Jordan chain of for is a list with , and for . A Jordan basis of is an ordered basis of made by listing the vectors of finitely many Jordan chains of , one chain after another, each bottom first. The matrix of in a Jordan basis is block diagonal, with one block for each chain of length for . For a nilpotent operator every chain has .
The construction rests on one theorem. Let be nilpotent on a finite-dimensional space over , and lift every vector of the top-down construction, a vector of entry level to a chain of length , with any choice of tops. Then all the vectors of all these chains together are linearly independent. To prove it, call the th vector of a chain, counted from the bottom, its level. Suppose a linear combination of all the chain vectors is with some coefficient nonzero, and let be the highest level carrying a nonzero coefficient. Apply . A vector at a level below goes to , a vector at level goes to the bottom of its chain, and every term above level already has coefficient . What remains is a vanishing combination of the bottoms of the chains of length at least , with the level coefficients. Those bottoms are the vectors of entry level at least , which form a basis of , so all these coefficients are zero. That contradicts the choice of , 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 pushes any relation down onto the bottoms, and the bottoms were chosen independent level by level.
Example Take the chains and found above, and suppose
Applying leaves , so . Applying to what is left gives , so . Then forces . So is a Jordan basis of , and
with the blocks and . By contrast, the chains and are each independent, but together they repeat .
Dimension count for spanning
Definition Let be nilpotent of index on with , and let , so that . The construction gives chains of length exactly . Counting their vectors chain by chain, or level by level with vectors at level , gives the same total,
To find without knowing any chains, restrict to . This restriction maps onto and its kernel is , so rank-nullity gives
The sum telescopes,
So the chain vectors form an independent list of vectors, which is a basis of . Every nilpotent operator on a nonzero finite-dimensional space over or 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 of the chains holds exactly vectors, and rank-nullity says these numbers add up to . The count uses only ranks of powers of , so it does not assume the Jordan form it is used to prove.
Example In the opening example the ranks of , , and are , , and , so , and , matching the spaces found above. There is chain of length , there are chains of length , and there is chain of length , for vectors. Watch for this. The telescoping step needs . For , which is not nilpotent, the ranks of are , so and , and the construction produces one vector in a space of dimension . It only reaches the generalized eigenspace of , which is why the construction is applied to 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 is a Jordan matrix that represents in some basis, and a Jordan form of a square matrix is a Jordan matrix similar to over . The existence theorem reads as follows. Let be finite-dimensional over and let be linear with minimal polynomial
where are distinct and every , that is, splits over . Then has a Jordan basis for , so is a Jordan matrix. For a matrix whose minimal polynomial splits, this says for a Jordan matrix and an invertible whose columns form a Jordan basis. Over the hypothesis always holds, by the fundamental theorem of algebra. The hypothesis is also necessary. A Jordan matrix is upper triangular, so if has a Jordan basis, then is a product of linear factors over , and so is its divisor .
The proof joins the pieces. The generalized eigenspace decomposition gives with each invariant under , and on the operator is nilpotent of index . A Jordan basis of for is a Jordan basis for the restriction of , with eigenvalue , because there. Joining these bases gives a basis of because the sum is direct. The blocks for fill , so their sizes add up to the algebraic multiplicity of , and the largest has size . The Jordan basis is not unique, since every chain can be rescaled by a scalar . In addition, a chain of length at least 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 is nilpotent, and place the pieces side by side. Over this works exactly when every root of the minimal polynomial is real.
Example With the chains found above, the matrix on satisfies for
with the blocks and . The other lift changes but not , and listing the chain first gives the Jordan matrix with blocks and in that order. Over the quarter turn with rows and has minimal polynomial , which does not split, so it has no Jordan basis in . Over its Jordan form is .
Check yourself
- A nilpotent operator on has , , and , where . How many chains of each length does the construction produce, what is , and what is the rank of ?
Show the answer
The number of chains of length exactly is . That gives chains of length , chains of length and chain of length . So the dimension of is , which agrees with the level count . Since has dimension , rank-nullity gives .
- Let act on by , and . Its kernel has basis , , 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 in it.
Show the answer
For we have , so and . A chain of length two with bottom would need a top with , which is impossible because . The levels detect this, since while . Choose as the basis of and add at . Lift with the top . The Jordan basis is , and since ,
with the blocks and . The count agrees, with vectors.
- Find a Jordan basis and the Jordan form of
Show the answer
The matrix is upper triangular, so . For the eigenvalue ,
has kernel , so the eigenvalue has a single block, of size because its generalized eigenspace has dimension . That space is , and , so is a chain. For the eigenvalue the rows of give and , so is an eigenvector, and indeed . The matrix with columns , and has determinant , and
with the blocks and .