Why clearing denominators needs a proof
To construct a field of degree over , we often prove that an integer polynomial of degree is irreducible. Yet a possible factorization has rational coefficients, and reducing rational coefficients modulo a prime is not always defined. Gauss's lemma supplies the missing bridge: after the scalar parts are separated, a rational factorization of a primitive integer polynomial becomes an integer factorization.
The introductory irreducibility unit relies on this lemma in its proof of Eisenstein's criterion. We prove it here, including the denominator bookkeeping. We then explain why monic rational factors have integer coefficients and why reduction must preserve degree. Finally, the same argument works over any unique factorization domain : it shows that again has unique factorization, and it proves Eisenstein's criterion over rings such as . Integer unique factorization and polynomial division over a field are background; no Galois correspondence is needed.
Content separates the scalar from the polynomial
Definition 1.5.1
(Content and primitive part)
For a nonzero , its content is the positive greatest common divisor of its coefficients, including any zero coefficients. Write . Then is primitive: its coefficients have greatest common divisor one. We exclude the zero polynomial from these definitions in this chapter.
Primitive does not mean that a coefficient must equal : is primitive. Nor does it mean irreducible: is primitive and reducible. Content measures only a common integer divisor of all coefficients.
Concept lensStructural
Primitivity as avoiding every prime ideal
A nonzero is primitive exactly when for every prime , that is, when its reduction modulo every prime is nonzero. In this language the theorem below on primitive products says that each ideal is prime: if then or lies in it. That is the same as the quotient being a domain, which is how the proof runs.
Worked example 1.5.2
(Removing content without losing a factor)
For , the content is , so
Both displayed linear factors are primitive. Over , the nonzero constant is a unit and does not affect positive-degree factorization. Over , it is a nonunit. These are different notions of irreducibility: the units of are , whereas the units of are all nonzero rational constants.
Why products remain primitive
Theorem 1.5.3
(Primitive products and content)
If are nonzero and primitive, then is primitive. Consequently, for any nonzero integer polynomials,
Proof
(Proof by reduction modulo a prime)
Suppose a prime divided every coefficient of . Reducing coefficients modulo would give in . Primitivity says that neither nor is the zero polynomial. But a polynomial ring over a field is a domain: the leading coefficient of a product of nonzero polynomials is a product of nonzero elements. This is a contradiction. If had content greater than one, some prime would divide that content, so the product is primitive.
For arbitrary , write and . The product is primitive by the first part. Multiplying all its coefficients by the positive integer gives exactly the asserted content.
Proof X-ray
Why coefficient cancellation causes no problem
It is difficult to follow every coefficient of a product separately, since each is a sum and terms can cancel. Reduction modulo a hypothetical common prime packages every cancellation into one equation, . The domain property rules out that entire equation at once. The argument needs the reduced polynomials to be nonzero, but does not need their degrees to be preserved.
Tracking the rational scalar
Every nonzero has the form , where and is primitive: clear denominators, then remove content. The crucial detail is the following scalar observation.
If is primitive and for , write with coprime integers and . Integrality implies that divides every coefficient of . Coprimality forces to divide every coefficient of , hence . Thus is an integer. If is also primitive, its content is , so .
Theorem 1.5.4
(Gauss's factor-lifting lemma)
Let be primitive and of positive degree. If in with of positive degrees, then for integer polynomials of those same degrees. In particular, a primitive positive-degree polynomial is irreducible in exactly when it is irreducible in .
Proof
(Proof with the scalar visible)
Write and with primitive integer . Then , and is primitive. Both this product and are primitive integer polynomials, so the scalar observation gives . Absorb that sign into to obtain the claimed factors; scalar multiplication does not change their degrees.
An integer factorization with two positive-degree factors is already a rational factorization. Finally, a primitive polynomial cannot have an integer constant factor other than a unit: any such nonunit would divide all its coefficients. Thus, for primitive polynomials, the absence of positive-degree factorizations is also ring-theoretic irreducibility.
Proof X-ray
One rational scalar carries the whole proof
After the rational scalars are pulled out, the product theorem makes primitive, so equals the scalar times a primitive polynomial. The scalar observation then forces because is primitive. For a nonprimitive the same step gives , still an integer, so the lift to integer factors of the same degrees survives. Primitivity is needed only in the last sentence of the theorem: otherwise a constant such as in is a nonunit factor in .
Worked example 1.5.5
(Denominators can move between the factors)
The rational identity
becomes . The rational scalars multiply to , leaving the integer factorization . Simply clearing denominators in each factor without tracking these scalars would change the polynomial.
Common mistake
(The comparison needs primitivity)
The equivalence of irreducibility in and in is stated for primitive polynomials. The polynomial is irreducible in , because it has degree one and is a unit there. In it is reducible: is not a unit, and neither is . Separate the content before comparing the two rings.
Monic factors and algebraic integers
Proposition 1.5.6
(Monic factors stay integral)
If a monic factors as with monic , then . Consequently, the monic minimal polynomial over of a root of a monic integer polynomial has integer coefficients.
Proof
(Proof using leading coefficients)
A monic integer polynomial is primitive. Write and with primitive integer . As above, . Since are monic, . Multiplying gives . Both leading coefficients are integers, so each is , and then . This proves integrality of the factors.
If is a root of a monic integer , its monic minimal polynomial divides by polynomial division. The quotient is monic. Apply the factor statement to .
Definition 1.5.7
(Algebraic integer)
A complex number is an algebraic integer if it is a root of a monic polynomial in .
The proposition is a criterion using its unique monic minimal polynomial, not an assertion that every algebraic number is integral. A rational algebraic integer must be an integer, since its minimal polynomial is .
Worked example 1.5.8
(A denominator in the expression is inconclusive)
Let . Then , so is an algebraic integer despite its displayed denominator. Its minimal polynomial is , since is irrational. In contrast, has monic minimal polynomial : it is irrational and satisfies that quadratic. Because this minimal polynomial is not integral, the proposition shows that is not an algebraic integer. Multiplying it by to get gives an integer polynomial, but loses monicity.
Reduction must preserve degree
Theorem 1.5.9
(Reduction criterion with the leading coefficient stated)
Let be primitive of positive degree, and let be prime with . If is irreducible, then is irreducible over .
Proof
(Proof)
A rational factorization would lift to with integer factors of positive degrees. Their leading coefficients multiply to , so neither is divisible by . Therefore reduction preserves both positive degrees, and contradicts irreducibility. This is exactly where the leading-coefficient hypothesis is used.
Worked example 1.5.10
(A nonmonic polynomial that passes the test)
Take . It is primitive and its leading coefficient is odd. Modulo , it becomes , whose values at and are both . A reducible cubic over a field has a linear factor, so this cubic is irreducible. Thus is irreducible over , and adjoining any root gives degree .
Counterexample mode
A lost degree can hide a factor
The primitive polynomial is reducible over , but modulo becomes the irreducible linear polynomial . The factor has become a constant. Merely asking that the reduction be nonzero and irreducible is insufficient. Conversely, reducible reduction does not prove reducibility over : is irreducible there, but factors modulo as .
Turning a rational equation into field arithmetic
Worked example 1.5.11
(The primitive equation and the monic equation do different jobs)
Suppose is a root of . Multiplying the equation by gives . The primitive integer polynomial is irreducible by the preceding reduction example. The original rational polynomial is also irreducible, because multiplication by a nonzero rational constant preserves positive-degree factorizations.
The monic minimal polynomial is therefore . Its degree gives the basis of over . Its equation gives the reduction rule , which converts every polynomial expression to three coordinates in that basis. For instance,
so .
The primitive integer equation was useful for modular reduction; the monic equation identifies the minimal polynomial and controls basis arithmetic. They have the same roots and degree, but different coefficients. In particular, the noninteger coefficients of the monic minimal polynomial show that this root is not an algebraic integer. A primitive equation alone cannot establish integrality. Conversely, the inverse happens to have an integer polynomial expression in the root; that expression does not turn the root itself into an algebraic integer. Each conclusion must use the appropriate monic-polynomial condition.
The same bridge over a polynomial coefficient ring
Let be a unique factorization domain (UFD) and its fraction field. Any two nonzero elements of have a greatest common divisor, determined up to multiplication by a unit; write when and are associates. For nonzero , a content is a greatest common divisor of its coefficients, and is primitive when is a unit, that is, when no irreducible element of divides every coefficient. Every nonzero can be written with primitive. The three ingredients of the integer proof now take the following form.
Theorem 1.5.12
(Gauss's lemma over a unique factorization domain)
Let be a UFD with fraction field .
- A product of primitive polynomials in is primitive, and for all nonzero .
- If is primitive, and , then . If moreover is primitive, then is a unit of .
- If is primitive and in with , then for primitive that are nonzero scalar multiples of and ; in particular and .
Proof
(The integer proof, with primes replaced by irreducible elements)
Part 1. Let be primitive and suppose were not. Its content is then a nonunit, so, being a UFD, some irreducible divides it. In a UFD every irreducible element is prime, so is an integral domain, and so is : the leading coefficient of a product of nonzero polynomials is a product of nonzero elements of . Reducing coefficients modulo gives in , whereas primitivity says and . This contradiction shows that is primitive. For arbitrary nonzero , write and . A content of with nonzero and primitive is itself, since in a UFD. Applying this to gives .
Part 2. Write with and . Cancelling common irreducible factors, which unique factorization permits, we may assume that no irreducible element divides both and . Suppose were not a unit, and let be an irreducible factor of . For each coefficient of , the element lies in , so , and hence , divides . Since is prime and does not divide , it divides . Then divides every coefficient of , contradicting primitivity. So is a unit and . If also is primitive, then divides every coefficient of , hence divides a content of , which is a unit; so is a unit.
Part 3. Choose a nonzero with , for instance the product of the denominators of the coefficients of , and write with primitive. Then with . In the same way with and primitive. Now , where is primitive by part 1 and is primitive by hypothesis. Part 2, applied to and the scalar , shows that is a unit of . Put and . Both are primitive, they are scalar multiples of and , and .
The quotient in part 1 need not be a field; that it is a domain is enough. Taking recovers the results proved earlier in this chapter.
Worked example 1.5.13
(The extension defined by a new root of a parameter)
Let be any field and an indeterminate. Polynomial division makes a Euclidean domain, hence a UFD. For every integer , the polynomial is irreducible over .
Indeed, it is primitive over . A positive-degree factorization over would lift to in . The leading coefficients multiply to , so reduction modulo preserves both degrees. In we get . Unique factorization over the field makes each reduced factor a nonzero scalar times a positive power of . Thus both constant coefficients are divisible by , making their product divisible by . But that product is , a contradiction.
In characteristic , choose a root of . The argument gives and basis . Yet in this field. There is only one distinct root, so the extension is inseparable and every automorphism fixing fixes . Irreducibility determines the degree; it does not imply separability or distinct conjugates.
Unique factorization passes to polynomial rings
The lemma describes the irreducible elements of completely, and that description is what makes unique factorization pass from to . Recall that the units of are the units of : degrees add in products over a domain, so a unit and its inverse both have degree zero.
Proposition 1.5.14
(Irreducible elements of )
Let be a UFD with fraction field . The irreducible elements of are exactly
- the irreducible elements of , viewed as constant polynomials, and
- the primitive polynomials of positive degree that are irreducible in .
Proof
(Separate constants from positive degree)
If is irreducible and in , the degrees force , so one of them is a unit. Conversely, a constant that is irreducible in is irreducible in , because a factorization in is also one in .
Let be primitive of positive degree and irreducible in , and suppose in . Irreducibility over makes one factor, say , a nonzero constant . Then divides every coefficient of , so is a unit, and is irreducible in . Conversely, let be irreducible of positive degree. In the factor has positive degree, so it is not a unit; hence is a unit and is primitive. If were reducible in , part 3 of Gauss's lemma would factor it in into two polynomials of positive degree, neither of which is a unit. So is irreducible in .
Theorem 1.5.15
(Gauss's theorem: if is a UFD, so is )
If is a unique factorization domain, then so is . Consequently and , for a field , are unique factorization domains.
Proof
(Factor the content in and the primitive part in )
Existence. Let be nonzero and not a unit, and write . The constant is a unit or a product of irreducible elements of , which remain irreducible in . It remains to factor the primitive polynomial , by induction on its degree. A primitive constant is a unit. If has positive degree and is irreducible in , it is irreducible in by the proposition. Otherwise part 3 of Gauss's lemma writes with primitive of smaller positive degrees, and the inductive hypothesis factors each of them.
Uniqueness. Suppose that
with units , irreducible constants , and primitive irreducible polynomials of positive degree. By part 1, and are primitive, so comparing contents gives in . Unique factorization in gives and, after reordering, . Cancelling these nonzero constants in the domain leaves for a unit . The ring is a UFD, because it is a Euclidean domain, and each and is irreducible there by the proposition. Hence and, after reordering, with . Since and are both primitive, part 2 makes a unit of . So the two factorizations agree up to order and units.
For the consequences, and any field are UFDs, and ; induct on .
Counterexample mode
A UFD need not be a principal ideal domain
Claim to test: a polynomial ring with unique factorization has every ideal principal, as does. In , which is a UFD by Gauss's theorem, consider the ideal . Suppose . Then divides the constant , so is a constant, . Since also divides and does not divide in , we get , so . Then for some , and evaluating at gives , impossible in . So is not principal. The step that fails is the division algorithm: it requires the leading coefficient to be invertible, and is not a field.
Eisenstein's criterion over a unique factorization domain
The proof of Eisenstein's criterion over uses only Gauss's lemma and the fact that is a domain. Both survive in a UFD.
Theorem 1.5.16
(Eisenstein's criterion over a UFD)
Let be a UFD with fraction field , let be irreducible, and let with . Suppose , for , and . Then is irreducible in . If is also primitive, it is irreducible in .
Proof
(Compare lowest terms after reduction)
Write with and primitive. Since divides and , also . Suppose were reducible in . Then so is , because is a unit of , and part 3 of Gauss's lemma gives in with , and . Put , so that in .
Reduce modulo into , where is a domain. The leading coefficients of and multiply to , so neither is divisible by , and still have degrees and . By hypothesis with . Let and be the lowest powers of that occur in and with nonzero coefficients. Because is a domain, the coefficient of in is the product of those two nonzero coefficients, and no lower power occurs. Comparing with gives . Since , and , we conclude and . Thus and have zero constant terms: divides both and , so divides , a contradiction.
If is primitive, the proposition on irreducible elements upgrades irreducibility in to irreducibility in .
The earlier example over is the case , . Over the criterion is the version in the introductory unit, now without the primitivity assumption for irreducibility over .
Worked example 1.5.17
(A circle in two variables)
Let be a field of characteristic other than two, and regard as a polynomial in over . Its coefficients are , and . Take the irreducible element . It does not divide , it divides and , and , because does not divide : the value of at is . Since is monic in , it is primitive, so Eisenstein's criterion makes it irreducible in .
In characteristic two the conclusion fails: . The criterion does not apply there, because is divisible by .
When the coefficient ring is not a UFD
Counterexample mode
Factor lifting fails over $\mathbb Z[\sqrt5]$
Claim to test: for every integral domain with fraction field , a monic polynomial over that factors in factors in into factors of the same degrees. Take , whose fraction field is , and . Over ,
In , a factorization into two polynomials of degree one would have leading coefficients multiplying to , hence units, and would give a root in . But the roots have coordinate at in the basis , so they are not in . A constant factor of the monic divides its leading coefficient and is a unit. So is irreducible in but reducible in .
The proof breaks at part 2 of the lemma, which needs reduced fractions and prime irreducible elements. By Gauss's lemma, therefore cannot be a UFD; indeed exhibits two factorizations of . The repaired statement is the lemma as proved: the coefficient ring must be a UFD.
Practice
Quick check
(Find the content and a primitive factorization of .)
Solution · Answer
The content is . The primitive part is , so the original polynomial is . Each positive-degree factor shown is primitive.
Quick check
(Track the scalars in and give the resulting integer factorization.)
Solution · Answer
The factors are and . Their scalars multiply to one, giving .
Quick check
(Prove irreducible over by reduction modulo .)
Solution · Answer
The polynomial is monic, so the leading coefficient survives. At the reduction takes the values , and in , so it has no root. A cubic without a root is irreducible, and the reduction criterion applies.
Quick check
(Explain exactly why reduction modulo gives no irreducibility conclusion for .)
Solution · Answer
Its leading coefficient vanishes modulo . The genuine factor reduces to the unit , so the reduced linear polynomial does not retain the original quadratic degree, and the criterion's hypothesis fails.
Quick check
(Prove that a rational root of would be an integer, then show there is no such root.)
Solution · Answer
A rational root of a monic integer polynomial is an integer by the monic-factor proposition, since would be a monic rational factor. If an integer satisfied the equation, would force or . The polynomial values there are and , so neither works. Hence the quadratic is irreducible over .
Quick check
(Is an algebraic integer? Justify the answer using its minimal polynomial.)
Solution · Answer
No. It is irrational and its square is , so its monic minimal polynomial is . The noninteger constant coefficient rules out integrality by the proposition.
Quick check
(Let have characteristic zero. Find the degree of a root of over , and decide whether that root is separable.)
Solution · Answer
The argument above gives irreducibility, hence degree . The derivative is nonzero at a root, because the characteristic is zero and a root has sixth power . Thus the irreducible polynomial has no repeated root, and the root is separable.
Quick check
(In characteristic , let as above. Compute without solving a linear system.)
Solution · Answer
The characteristic- identity gives . Since is an indeterminate, , and therefore . For this is .
Quick check
(Let be any field. Prove that is irreducible over .)
Solution · Answer
Apply Eisenstein's criterion over the UFD with the irreducible element . The leading coefficient is not divisible by , the coefficients , and are, and does not divide the constant term . Hence the cubic is irreducible over the fraction field , in every characteristic.
Exercise 1.5.18
(Prove that is irreducible in , although Eisenstein's criterion does not apply directly in either variable.)
SynthesisProof
Hint(1)
View the polynomial as a monic quadratic in over , and decide whether it has a root in the fraction field .
Solution(3)
- 1
See why Eisenstein fails
As a polynomial in with constant term , the only irreducible element dividing the constant term is up to a unit, and divides . As a polynomial in , the constant term is , again divisible by the square of its only irreducible factor. So another argument is needed.
- 2
Irreducibility over the fraction field
Key step
Over , the quadratic is reducible exactly when it has a root, that is, when for nonzero . Then , and comparing degrees gives , which is impossible because the left side is even and the right side odd.
- 3
Return to the polynomial ring
∎The polynomial is monic in , hence primitive over . By the proposition on irreducible elements, a primitive polynomial of positive degree that is irreducible over is irreducible in .
Quick check
(Use Gauss's theorem to explain why is a UFD, and give an ideal of that is not principal.)
Solution · Answer
is a UFD, so is one, and then is one. In , the ideal is not principal: a generator would divide both and , which share no nonunit factor, so would be a nonzero constant and the ideal would contain . But every element of has zero constant term.