Theorems · Theorem · linear algebra
Matrix.aeval_self_charpoly
- #49 of the 100 theorems: The Cayley-Hamilton Theorem
- 1000+ list: Cayley–Hamilton theorem
∀ {R : Type u_1} [inst : CommRing R] {n : Type u_4} [inst_1 : DecidableEq n] [inst_2 : Fintype n] (M : Matrix n n R),
(Polynomial.aeval M) M.charpoly = 0The Cayley-Hamilton Theorem, that the characteristic polynomial of a matrix,
applied to the matrix itself, is zero.
This holds over any commutative ring.
See LinearMap.aeval_self_charpoly for the equivalent statement about endomorphisms.
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 125 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- CommRingDecidableEqFintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites24
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement and proof · cited by 62,936
- CommRingstatement and proof · cited by 17,173
- Semiringproof · cited by 13,802
- Fintypestatement and proof · cited by 7,736
- Polynomialstatement and proof · cited by 5,681
- Algebra.algebraMapproof · cited by 4,706
- Matrixstatement and proof · cited by 4,303
- AlgHomstatement · cited by 3,236
- AlgEquivproof · cited by 1,681
- Polynomial.Xproof · cited by 1,639
- Polynomial.Cproof · cited by 1,598
- map_mulproof · cited by 1,137
Cited by6
Results whose statement or proof uses this declaration.
- LinearMap.aeval_self_charpolyproof · cited by 6
- charpoly_leftMulMatrixproof · cited by 2
- Matrix.aeval_eq_aeval_mod_charpolyproof · cited by 1
- Matrix.minpoly_dvd_charpolyproof · cited by 0
- Matrix.isIntegralproof · cited by 0