For a nonzero polynomial , its polynomial content is the positive greatest common divisor of its coefficients:
For nonzero , choose a positive integer with and define its rational polynomial content by
To check independence of the denominator, write with and . Then , while multiplication of all coefficients by a positive integer gives
Dividing by proves , as required.
For multiplication, write . The integer-coefficient content identity permitted in the source gives
Thus
We will also use the normalization , with content one: if , then . It is a primitive polynomial. For a nonzero rational constant , the same definition gives .
The set contains zero. It is closed under negatives because whenever . If and , then
since is an ideal of . Also, any can be written with and , giving
This proves that is an ideal of .
Clearly , by taking denominator one. Conversely, if , then for some positive integer . The condition implies . Since is a prime ideal, forces . Hence
In particular, is nonzero because it contains the nonzero ideal , and it is proper: otherwise its intersection with would contain . This is the concrete extension of an ideal and contraction of an ideal calculation for the localization that inverts nonzero integers.
The nonzero ideal is principal because is a principal ideal domain. Choose a nonzero generator . Part (a) gives
The nonzero rational scalar is a unit in , so this rescaling does not change the generated principal ideal:
Part (b) now places in , since . Thus .
For the reverse inclusion, let be nonzero. The displayed equality supplies with . Multiplicativity of rational polynomial content gives
Since has integer coefficients, is a positive integer. The normalization from part (a) gives , so multiplying it by the integer proves . Consequently . The zero polynomial belongs as well, proving
This is the divisibility descent in Gauss lemma for polynomials: dividing an integer-coefficient polynomial by a primitive polynomial cannot introduce a denominator into an exact quotient. Here it yields the description of prime ideals of the integer polynomial ring above zero. The generator has positive polynomial degree, since a primitive constant would be a unit and would put in .
Take . The ring homomorphism
is surjective. Its kernel of a ring homomorphism is exactly : a polynomial maps to zero precisely when its constant coefficient is even, in which case it has the form with and . By the first isomorphism theorem for rings,
This quotient ring is a field, so is a maximal ideal and in particular a prime ideal.
Suppose were a principal ideal. Because , the nonzero polynomial divides the constant , forcing its polynomial degree to be zero: for a nonzero integer . But also makes divide the coefficient of , so . This would give , contradicting the properness of the kernel of a ring homomorphism . Therefore
There is no conflict with part (c): . The zero-intersection hypothesis is exactly what excludes this example.

Articles by others on the same topic (0)

There are currently no matching articles.