Jordan Canonical Form
Statement
Let be an algebraically closed field and an matrix over . Then there exists an invertible matrix and a block-diagonal matrix
such that . Each Jordan block is
The form is unique up to reordering of blocks.
Visualization
Consider vs .
Matrix A (non-semisimple) Jordan form of A
+---------+ +---------+
| 2 1 | ~ similar ~ | 2 1 | (IS the Jordan block J_2(2))
| 0 2 | | 0 2 |
+---------+ +---------+
eigenvalue λ=2 (double), one Jordan block of size 2
minimal poly = (x-2)^2
Matrix B (semisimple / diagonal) Jordan form of B
+---------+ +---------+
| 2 0 | ~ similar ~ | 2 0 | (two blocks J_1(2))
| 0 2 | | 0 2 |
+---------+ +---------+
eigenvalue λ=2 (double), minimal poly = (x-2), squarefree
The key distinction: needs a block because but ; is already diagonal so each Jordan block has size .
| Matrix | Min poly | Jordan block sizes for |
|---|---|---|
Proof Sketch
- Generalised eigenspaces. For each eigenvalue , the generalised eigenspace is -invariant. The Cayley–Hamilton theorem guarantees .
- Jordan basis on each block. On , the restriction is nilpotent. A nilpotent operator on a finite-dimensional space admits a basis of Jordan chains — sequences that yield one Jordan block per chain.
- Assemble. Concatenate the Jordan bases across all generalised eigenspaces to get ; is block-diagonal by construction.
- Uniqueness. The block sizes for are determined by for , which are similarity invariants.
Connections
- Cayley–Hamilton TheoremCayley–Hamilton TheoremEvery square matrix satisfies its own characteristic polynomialRead more → — guarantees over algebraically closed fields
- Minimal PolynomialMinimal PolynomialThe minimal polynomial of a matrix is the monic polynomial of least degree that annihilates it.Read more → — block sizes for equal the size of the largest Jordan block, matching the multiplicity of in the minimal polynomial
- Spectral TheoremSpectral TheoremEvery real symmetric matrix is orthogonally diagonalizableRead more → — the real/complex spectral theorem gives the semisimple part; Jordan form extends this to the full nilpotent decomposition
Lean4 Proof
import Mathlib.LinearAlgebra.JordanChevalley
/-- The Jordan–Chevalley-Dunford decomposition: every endomorphism of a
finite-dimensional vector space over a perfect field splits as nilpotent
plus semisimple. This is the structural engine behind Jordan canonical form.
Mathlib's `Module.End.exists_isNilpotent_isSemisimple` is the direct alias. -/
theorem jordan_chevalley_decomp
{K : Type*} [Field K] [PerfectField K]
{V : Type*} [AddCommGroup V] [Module K V] [FiniteDimensional K V]
(f : V →ₗ[K] V) :
∃ᵉ (n ∈ Algebra.adjoin K {f}) (s ∈ Algebra.adjoin K {f}),
IsNilpotent n ∧ Module.End.IsSemisimple s ∧ f = n + s :=
Module.End.exists_isNilpotent_isSemisimpleReferenced by
- Minimal PolynomialLinear Algebra
- Companion MatrixLinear Algebra
- Diagonalizability CriterionLinear Algebra
- Schur DecompositionLinear Algebra