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 , choose the positive gcd. For example, has content two and primitive part . 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 over have gcd one and generate the proper ideal . State the convention before using content to define a primitive polynomial.
For a nonzero polynomial , choose a positive integer clearing its denominators and set , where the polynomial content of an integer-coefficient polynomial is the positive greatest common divisor of its coefficients. This is independent of : if , then , hence .
The integer-coefficient product formula from Gauss lemma for polynomials givesMoreover is an integer-coefficient primitive polynomial: if , then . For example,This normalization proves a useful divisibility descent. If is primitive, and for , then is an integer. Since , it follows that .
For a polynomial over a unique factorization domain, primitive means that its polynomial content, in the gcd convention, is a unit. Thus its coefficients have no common nonunit divisor. For example, is primitive in , whereas has content two. Gauss lemma for polynomials makes products of primitive polynomials primitive.
This convention differs from requiring the coefficient ideal to be the unit ideal over an arbitrary commutative ring. The polynomial over the unique factorization domain is primitive in the gcd sense, although its coefficient ideal is proper. The distinction matters when transferring integer content arguments to more general coefficient rings.
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 for . Then . 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 , proving the formula after reversing the scaling. This compares binary-polynomial coefficient heights with the heights of their roots.
If is a unique factorization domain with fraction field , then is a unique factorization domain. A primitive polynomial irreducible in remains irreducible, hence prime, in the principal ideal domain ; Gauss lemma for polynomials brings divisibility back to .
The polynomial ring is a unique factorization domain by Gauss lemma for polynomials, but its ideal is not principal. Any generator would divide both 2 and , hence be a unit: a divisor of 2 has degree zero, and a constant dividing is . Yet evaluation at zero followed by reduction modulo 2 annihilates the ideal and not 1. It embeds in the principal ideal domain , illustrating that the property need not pass to a subring.
Every rational function in fixed by exchanging and is a quotient of coprime symmetric polynomials. In a coprime presentation , symmetry givesUnique factorization implies and . The alternative would make both divisible by , contradicting coprimality, so .
Articles by others on the same topic
There are currently no matching articles.