The polynomial remainder theorem
ProvedFamousTheorems.polynomial_remainder_theoremThe polynomial remainder theorem. Let be a commutative ring, and . The remainder of on division by is the constant :
In particular divides if and only if (the factor theorem). This underlies the fact that a nonzero polynomial over a domain has at most roots, as well as Horner's scheme and synthetic division.
Formalization note. Mathlib's Polynomial.modByMonic_X_sub_C_eq_C_eval. Polynomial.modByMonic is division with remainder by a monic polynomial, which works over any commutative ring. Polynomial.C is the constant polynomial.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem polynomial_remainder_theorem {R : Type*} [CommRing R] (p : Polynomial R) (a : R) :
p.modByMonic (Polynomial.X - Polynomial.C a) = Polynomial.C (p.eval a) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Polynomial.modByMonic_X_sub_C_eq_C_eval`. Proof here reduces to that Mathlib result.