Cayley–Hamilton Theorem
Statement
Let be an matrix over a commutative ring , and let be its characteristic polynomial. Then:
That is, substituting itself for the scalar variable in the characteristic polynomial yields the zero matrix.
Visualization
Take the concrete matrix:
Step 1 — Compute the characteristic polynomial.
Step 2 — Compute .
Step 3 — Evaluate .
Verified: .
Proof Sketch
The naive approach — "substitute for in " — is circular: the determinant expands as a scalar polynomial, not a matrix polynomial. The correct proof works over the adjugate matrix , whose entries are polynomials in . One shows as a polynomial matrix identity, then compares coefficients of on both sides to assemble the relation .
An alternative proof observes that the result holds over any field (by finding a splitting field where is upper-triangular) and then descends to general commutative rings by a universality argument.
Connections
- Spectral TheoremSpectral TheoremEvery real symmetric matrix is orthogonally diagonalizableRead more → — eigenvalues are roots of ; Cayley–Hamilton shows itself is a "root."
- Determinant MultiplicativityDeterminant MultiplicativityThe determinant of a product equals the product of determinantsRead more → — the characteristic polynomial is built from the determinant.
- Rank–Nullity TheoremRank–Nullity TheoremThe dimensions of image and kernel of a linear map sum to the domain dimensionRead more → — the minimal polynomial divides ; its degree relates to the kernel.
- Fundamental Theorem of Galois TheoryFundamental Theorem of Galois TheoryBijection between intermediate fields and subgroups of the Galois groupRead more → — Galois extensions are controlled by characteristic polynomials of Frobenius elements.
- Quadratic FormulaQuadratic FormulaSolve any quadratic equation using the discriminantRead more → — in dimension 2, is quadratic; Cayley–Hamilton is the matrix analogue of a root equation.
Lean4 Proof
/-- The Cayley–Hamilton theorem: every square matrix satisfies its own
characteristic polynomial. The Mathlib proof works over any commutative
ring via the adjugate identity. -/
theorem cayley_hamilton {n : Type*} {R : Type*}
[Fintype n] [DecidableEq n] [CommRing R]
(A : Matrix n n R) : Polynomial.aeval A A.charpoly = 0 :=
Matrix.aeval_self_charpoly AReferenced by
- Nakayama's LemmaRing Theory
- König's Theorem (Bipartite)Graph Theory
- Linear ODE General SolutionDifferential Equations
- Minimal PolynomialLinear Algebra
- Minimal PolynomialLinear Algebra
- Companion MatrixLinear Algebra
- Determinant MultiplicativityLinear Algebra
- Cramer's RuleLinear Algebra
- Spectral TheoremLinear Algebra
- Rank–Nullity TheoremLinear Algebra
- Trace Cyclic PropertyLinear Algebra
- Sylvester Determinant TheoremLinear Algebra
- Jordan Canonical FormLinear Algebra
- Schur DecompositionLinear Algebra
- Product TopologyTopology
- Spectral Radius FormulaFunctional Analysis