Polynomial content (source code)

= Polynomial content
{title2=$c(f)$}
{wiki}

For a nonzero <polynomial> over a <unique factorization domain>, its content is a greatest common divisor of its coefficients, defined up to a <unit>. Over $\mathbb Z$, choose the positive gcd. For example, $6X^2+10X+14$ has content two and primitive part $3X^2+5X+7$. <Gauss lemma for polynomials> says that content is multiplicative up to <units> in this setting.

For a <polynomial> over a general <commutative ring>, another common convention uses the <ideal> generated by its coefficients as its content. This convention does not require gcds. The two descriptions agree through a principal coefficient <ideal> when that <ideal> is principal, but a <unit> gcd need not make the coefficient <ideal> the whole <ring>. For example, the coefficients of $xT+y$ over $k[x,y]$ have gcd one and generate the proper <ideal> $(x,y)$. State the convention before using content to define a <primitive polynomial>.