95. Jordan Canonical Form

When a matrix is not diagonalizable (geometric multiplicity < algebraic multiplicity for some eigenvalue), the Jordan canonical form is the next-best thing — almost diagonal, with 1′s just above the diagonal in certain blocks.

Every square matrix 𝐴 over (or over if all eigenvalues are real) is similar to its Jordan form 𝐽:

𝐴=𝑃𝐽𝑃1

where 𝐽 is block diagonal:

𝐽=[𝐽𝜆1,𝑘1000𝐽𝜆2,𝑘2000𝐽𝜆𝑟,𝑘𝑟]

95.1. Jordan blocks

A Jordan block 𝐽𝜆,𝑘 is a 𝑘×𝑘 upper triangular matrix with 𝜆 on the diagonal and 1 on the superdiagonal:

𝐽𝜆,1=[𝜆]𝐽𝜆,2=[𝜆10𝜆]𝐽𝜆,3=[𝜆100𝜆100𝜆]

If 𝐴 has 𝑘 linearly independent eigenvectors for eigenvalue 𝜆 (geometric multiplicity 𝑘) and total multiplicity 𝑚 (algebraic multiplicity), the corresponding Jordan structure has 𝑘 blocks for 𝜆, whose sizes sum to 𝑚.

95.2. Diagonalizable as a special case

If 𝐴 is diagonalizable, every Jordan block is 1×1 — i.e., 𝐽=𝐷 is just diagonal. The Jordan form generalizes diagonalization to handle “missing eigenvectors.”

Example
𝐴=[5105]

Eigenvalue 𝜆=5 with algebraic multiplicity 2, geometric multiplicity 1 (only eigenvector [10]). Not diagonalizable.

Jordan form: 𝐽=[5105]=𝐴 (already in Jordan form).

Example
𝐴=[210020003]

Eigenvalues: 2 (algebraic mult 2, geometric mult 1) and 3 (mult 1).

Jordan form has one 2×2 block for 𝜆=2 and one 1×1 block for 𝜆=3:

𝐽=[210020003]=𝐴

95.3. Why it matters

95.4. Computation note

Computing the Jordan form numerically is unstable — small perturbations can turn a non-trivial Jordan block into a tight cluster of distinct eigenvalues. For numerical work, prefer the SVD or the Schur form (always available, real or complex, and stable).

95.5. See also