Gauss's lemma for polynomials
ProvedFamousTheorems.gauss_lemma_polynomialsGauss's lemma for polynomials. Let be a GCD domain (for example a UFD) with fraction field , and a primitive polynomial, so the gcd of its coefficients is . Then is irreducible in if and only if it is irreducible in .
For , a primitive integer polynomial that factors over already factors over . Gauss's lemma is the key step in proving that is a UFD when is, and it justifies irreducibility tests over such as Eisenstein's criterion and reduction modulo primes.
Formalization note. Mathlib's Polynomial.IsPrimitive.irreducible_iff_irreducible_map_fraction_map. IsFractionRing R K makes K a fraction field of R, and p.map (algebraMap R K) is viewed in . Polynomial.IsPrimitive means that the only constants dividing are units.
Preamble
import Mathlib
Formal statement
namespace FamousTheorems
theorem gauss_lemma_polynomials {R K : Type*} [CommRing R] [IsDomain R] [IsGCDMonoid R] [Field K] [Algebra R K] [IsFractionRing R K]
{p : Polynomial R} (hp : p.IsPrimitive) :
Irreducible p ↔ Irreducible (p.map (algebraMap R K)) := by sorry
end FamousTheoremsSource
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Polynomial.IsPrimitive.irreducible_iff_irreducible_map_fraction_map`. Proof here reduces to that Mathlib result.