Lesson 9.31,365 words

Jordan Canonical Form

When the base field contains all the eigenvalues, the elementary divisors of an operator are powers of linear polynomials, and each cyclic summand becomes a Jordan block: an eigenvalue on the diagonal with ones just above it. Stacking the blocks gives the Jordan canonical form, unique up to reordering, as close to diagonal as the operator allows.

╌╌╌╌

The rational canonical form uses the invariant-factor decomposition of the -module . The elementary-divisor decomposition of the same module gives a different matrix — one that is nearly diagonal, at the cost of needing the eigenvalues to lie in the field.

Throughout, is a finite-dimensional vector space over , is a linear operator, is made into an -module by , and is a matrix of .

Splitting into linear prime powers

The elementary divisors of are the prime-power factors of its invariant factors. Over the primes are the monic irreducible polynomials, so an elementary divisor is for some irreducible . To make it as simple as possible, assume every irreducible factor is linear.

Under this assumption the elementary divisors are powers with an eigenvalue, and the structure theorem gives

Each summand is a cyclic -module, and the task is to choose a good basis for it.

The Jordan block

Fix one summand . Instead of the coefficient basis used for companion matrices, take the basis built from powers of :

This is a basis because the change from the coefficient basis is upper triangular with 's on the diagonal. Writing and using in the quotient, multiplication by acts as

so on each basis vector returns times itself plus the next vector up. The matrix is diagonal with an extra superdiagonal of ones.

A single Jordan block of size : the eigenvalue (here drawn as for ) repeated on the diagonal, ones on the first superdiagonal, zeros elsewhere.

A Jordan block is the sum of the scalar and a nilpotent shift on the superdiagonal. When the block is just the scalar , and the shift disappears.

Assembling the form

Applying this basis to every cyclic summand assembles the whole operator.

The Jordan canonical form: one Jordan block per elementary divisor, stacked along the diagonal, zeros off it.

The blocks for a fixed eigenvalue can share that eigenvalue in different sizes, so the same may head several blocks.

Because a Jordan block differs from a diagonal matrix only by the superdiagonal ones, the Jordan form is diagonal exactly when every block has size .

Diagonalizability is therefore a property of the minimal polynomial alone, not the characteristic polynomial: repeated eigenvalues are fine, repeated factors in are not.

Generalized eigenspaces

Grouping the Jordan blocks by eigenvalue reassembles the primary decomposition of in operator language.

On the generalized eigenspace, is nilpotent, and its Jordan blocks are the shift-only matrices with zeros on the diagonal. The kernels of successive powers of form an increasing flag that stabilizes at the whole generalized eigenspace.

On the generalized eigenspace for , the kernels nest and grow until they fill the space; the largest Jordan block sets how many steps this takes.

The flag makes the block structure computable. Let be the rank of the -th power. The count

is the number of Jordan blocks of size exactly for the eigenvalue . Taking (with ) gives the total number of blocks for , which equals the geometric multiplicity . This gives a rank-only route to the Jordan form: compute the ranks of the powers and difference them.3

Rational and Jordan forms of the same operator

Both canonical forms come from the same module, through its two decompositions. Passing between them is the invariant-factor / elementary-divisor conversion of the first lesson, run on polynomials.

Rational canonical formJordan canonical form
Module decompositioninvariant factors elementary divisors
Building blockcompanion matrix Jordan block
Field requirementany field (rational)must contain the eigenvalues
Shapeblock companionnearly diagonal
Uniquenessuniqueunique up to block order
Diagonal caserarely diagonaldiagonal iff squarefree
The same operator in both canonical forms. The rational form uses companion blocks of the invariant factors; the Jordan form uses blocks of the elementary divisors obtained by splitting those factors over the field.

Worked examples

The three matrices from the rational canonical form computation have eigenvalues and , both in , so their Jordan forms exist over :

For matrices the characteristic and minimal polynomials determine the Jordan form. From on they do not, and the rank counts take over.

The five similarity classes with characteristic polynomial : one Jordan structure per partition of . Shaded squares are the Jordan blocks; everything off the blocks is zero.

Field dependence

The Jordan form exists only when the eigenvalues lie in , and enlarging the field can create new blocks. Consider a operator over with an elementary divisor . Over this factor is irreducible, so it contributes a companion block and no Jordan block exists. Over it splits as , adding two size- blocks with eigenvalues . The rational canonical form is the same over both fields; the Jordan form appears only after adjoining the roots. This is the sense in which the rational form is rational and the Jordan form is not.5

When the field is not algebraically closed, the general-purpose canonical form is the rational one; the Jordan form is the specialization available once the characteristic polynomial splits.

Footnotes

  1. Dummit & Foote, §12.3 — Theorems 22 and 23: existence of the Jordan canonical form for operators and matrices when contains the eigenvalues, and uniqueness up to permutation of the blocks.
  2. Dummit & Foote, §12.3 — Corollaries 24 and 25: a matrix is diagonalizable if and only if its minimal polynomial has no repeated roots, in which case the Jordan form is diagonal.
  3. Dummit & Foote, §12.3 — Exercises 29 and 30 and the definition of the generalized eigenspace as the -primary component: the number of Jordan blocks of size for is with .
  4. Dummit & Foote, §12.3 — Examples 1–3: the Jordan forms of the matrices from Example 1 of §12.2, and a matrix with invariant factors illustrating that the characteristic and minimal polynomials do not determine similarity for . The matrix here is a different representative of that same similarity class, chosen so the rank computation is checkable by eye.
  5. Dummit & Foote, §12.3 — Example 4 and Corollary 18 of §12.2: over an elementary divisor splits into blocks with eigenvalues , while the rational canonical form is unchanged by the field extension.

╌╌ END ╌╌