Theorems · Theorem · field theory
Polynomial.eval_mul_X_sub_C
∀ {R : Type u} [inst : Ring R] {p : Polynomial R} (r : R), Polynomial.eval r (p * (Polynomial.X - Polynomial.C r)) = 0The evaluation map is not generally multiplicative when the coefficient ring is noncommutative,
but nevertheless any polynomial of the form p * (X - C r) is sent to zero when evaluated at r.
This is the key step in our proof of the Cayley-Hamilton theorem.
- Defined in
- Mathlib.Algebra.Polynomial.AlgebraMap
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 105 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Ring
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
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
- RingHomstatement · cited by 10,189
- Ringstatement and proof · cited by 7,463
- Polynomialstatement and proof · cited by 5,681
- Polynomial.Xstatement and proof · cited by 1,639
- Polynomial.Cstatement and proof · cited by 1,598
- sub_selfproof · cited by 996
- Polynomial.evalstatement and proof · cited by 796
- mul_subproof · cited by 201
- Polynomial.eval_subproof · cited by 124
- Polynomial.eval_mul_Xproof · cited by 11
- Polynomial.eval_mul_C_of_commuteproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- Matrix.aeval_self_charpolyproof · cited by 6
- Polynomial.not_isUnit_X_sub_Cproof · cited by 4