Proofs of The Primitivity Statement
An elementary proof of the statement that the product of primitive polynomials over Z is again primitive can be given as follows.
Proof: Suppose the product of two primitive polynomials f(x) and g(x) is not primitive, so there exists a prime number p that is a common divisor of all the coefficients of the product. But since f(x) and g(x) are primitive, p cannot divide either all the coefficients of f(x) or all those of g(x). Let arxr and bsxs be the first (i.e., highest degree) terms respectively of f(x) and of g(x) with a coefficient not divisible by p. Now consider the coefficient of xr+s in the product. Its value is given by
This sum contains a term arbs which is not divisible by p (because p is prime, by Euclid's lemma), yet all the remaining ones are (because either i > r or j > s), so the entire sum is not divisible by p. But by assumption all coefficients in the product are divisible by p, leading to a contradiction. Therefore, the coefficients of the product can have no common divisor and are thus primitive. This completes the proof.
A cleaner version of this proof can be given using the statement from abstract algebra that a polynomial ring over an integral domain is again an integral domain. We formulate this proof directly for the case of polynomials over a UFD R, which is hardly different from its special case for R = Z.
Proof: Let S,T be primitive polynomials in R, and assume that their product ST is not primitive, so that some noninvertible element d of R divides all coefficients of ST. There is some irreducible element p of R that divides d, and it is also a prime element in R (since R is a UFD). Then the principal ideal pR generated by p is a prime ideal, so R/pR is an integral domain, and (R/pR) is therefore an integral domain as well. By hypothesis the projection R→(R/pR) sends ST to 0, and also at least one of S,T individually, which means that p divides all of its coefficients, contradicting primitivity.
The somewhat tedious bookkeeping in the first proof is simplified by the fact that the reduction modulo p kills the uninteresting terms; what is left is a proof that polynomials over an integral domain cannot be zero divisors by consideration of the leading coefficient of their product.
Read more about this topic: Gauss's Lemma (polynomial)
Famous quotes containing the words proofs of, proofs and/or statement:
“A man’s women folk, whatever their outward show of respect for his merit and authority, always regard him secretly as an ass, and with something akin to pity. His most gaudy sayings and doings seldom deceive them; they see the actual man within, and know him for a shallow and pathetic fellow. In this fact, perhaps, lies one of the best proofs of feminine intelligence, or, as the common phrase makes it, feminine intuition.”
—H.L. (Henry Lewis)
“Would you convey my compliments to the purist who reads your proofs and tell him or her that I write in a sort of broken-down patois which is something like the way a Swiss waiter talks, and that when I split an infinitive, God damn it, I split it so it will stay split, and when I interrupt the velvety smoothness of my more or less literate syntax with a few sudden words of bar- room vernacular, that is done with the eyes wide open and the mind relaxed but attentive.”
—Raymond Chandler (1888–1959)
“The force of truth that a statement imparts, then, its prominence among the hordes of recorded observations that I may optionally apply to my own life, depends, in addition to the sense that it is argumentatively defensible, on the sense that someone like me, and someone I like, whose voice is audible and who is at least notionally in the same room with me, does or can possibly hold it to be compellingly true.”
—Nicholson Baker (b. 1957)