Primitive polynomial

A primitive polynomial has unit content.

Over a UFD, products of primitive polynomials are primitive and factorization over the fraction field descends after content is removed.

For a field with a Non-Archimedean absolute value, define the coefficient norm $\Vert f{\Vert }_G={\max }_i|a_i|$ for $f(T)={\sum }_i{a}_i{T}^i$. Then $\Vert fg{\Vert }_G=\Vert f{\Vert }_G\Vert g{\Vert }_G$. For nonzero polynomials, scale each by one of its coefficients of maximum absolute value; the resulting polynomials have integral coefficients and at least one unit coefficient. Their reductions in the residue field are nonzero, so their product is nonzero. The product therefore also has coefficient norm $1$, proving the formula after reversing the scaling. This compares binary-polynomial coefficient heights with the heights of their roots.

If $R$ is a unique factorization domain with fraction field $F$, then $R[X]$ is a unique factorization domain. A primitive polynomial irreducible in $R[X]$ remains irreducible, hence prime, in the principal ideal domain $F[X]$; Gauss lemma for polynomials brings divisibility back to $R[X]$.

The polynomial ring $\mathbb{Z}[X]$ is a unique factorization domain by Gauss lemma for polynomials, but its ideal $(2,X)$ is not principal. Any generator would divide both 2 and $X$, hence be a unit: a divisor of 2 has degree zero, and a constant dividing $X$ is $\pm 1$. Yet evaluation at zero followed by reduction modulo 2 annihilates the ideal and not 1. It embeds in the principal ideal domain $\mathbb{Q}[X]$, illustrating that the property need not pass to a subring.

Every rational function in $\mathbb{C}(X,Y)$ fixed by exchanging $X$ and $Y$ is a quotient of coprime symmetric polynomials. In a coprime presentation $p/q$, symmetry givesUnique factorization implies $p^{\ast }=\lambda p$ and $q^{\ast }=\lambda q$. The alternative $\lambda =-1$ would make both divisible by $X-Y$, contradicting coprimality, so $\lambda =1$.