Eisenstein's criterion
ProvedFamousTheorems.eisenstein_criterionEisenstein's criterion for irreducibility.
Let be a primitive polynomial over an integral domain and a prime ideal such that the leading coefficient is not in , every lower coefficient is in , and the constant term is not in . Then is irreducible.
The classical case takes over : if divides every coefficient except the leading one, and does not divide the constant term, then is irreducible over . So is irreducible for every , giving degree- field extensions at will.
The condition on is what makes the criterion sharp — without it would qualify while factoring as . Primitivity is needed so that irreducibility over the fraction field transfers back to the polynomial ring (Gauss's lemma).
The standard application is the -th cyclotomic polynomial: substituting in produces an Eisenstein polynomial at , proving irreducibility and hence that .
Eisenstein published it in 1850; Schönemann had it four years earlier.
Formalization note. f.degree lives in WithBot ℕ, so the coefficient hypothesis is
stated with a cast; f.IsPrimitive says the content is a unit. The result is Mathlib's
Polynomial.irreducible_of_eisenstein_criterion.
import Mathlib
namespace FamousTheorems
universe u v
open Filter Set Topology DirectSum
theorem eisenstein_criterion {R : Type*} [CommRing R] [IsDomain R] {f : Polynomial R}
{P : Ideal R} (hP : P.IsPrime) (hfl : f.leadingCoeff ∉ P)
(hfP : ∀ n : ℕ, (n : WithBot ℕ) < f.degree → f.coeff n ∈ P) (hfd0 : 0 < f.degree)
(h0 : f.coeff 0 ∉ P ^ 2) (hu : f.IsPrimitive) : Irreducible f := by sorry
end FamousTheorems