Gauss lemma (content multiplicativity)

In a UFD, the content of a product equals the product of contents up to associates.
Gauss lemma (content multiplicativity)

Gauss content lemma: Let RR be a . For f,gR[x]f,g\in R[x] in the , let cont(f)\operatorname{cont}(f) denote the of ff (a gcd of its coefficients, defined up to units). Then

cont(fg)  cont(f)cont(g), \operatorname{cont}(fg)\ \sim\ \operatorname{cont}(f)\operatorname{cont}(g),

where \sim denotes equality up to . Equivalently, the product of two is primitive.

This lemma is the technical engine behind Gauss-type transfer results between R[x]R[x] and Frac(R)[x]\mathrm{Frac}(R)[x].