Gauss's lemma
Over a UFD, primitive polynomials factor over the fraction field exactly when they factor over the ring.
Gauss's lemma
Gauss’s lemma: Let be a UFD with fraction field . If is primitive , then any factorization in the polynomial ring can be written (after multiplying by nonzero scalars in ) as a factorization with primitive. In particular, a primitive is irreducible in if and only if it is irreducible in .
This rests on the content multiplicativity lemma and is the key bridge between factorization over and over its field of fractions.
Proof sketch: Clear denominators to write with and . Taking contents and using multiplicativity forces to be a unit when is primitive, so factors in . Irreducibility equivalence follows by contrapositive.