This sheet introduces polynomial rings and develops their factorization theory. Polynomial rings over fields are principal ideal domains and unique factorization domains—properties that make them essential for constructing field extensions and for Galois theory.
Commentary. Just as the integers are the prototypical Euclidean domain, polynomial rings over a field are also Euclidean domains. This means we have a division algorithm, greatest common divisors, and unique factorization into irreducibles—exactly the machinery needed for Galois theory. The analogy between and is one of the deepest and most fruitful in algebra.
Prerequisites. This sheet uses the following results from earlier sheets:
- Ring definition, integral domains, fields (Sheet 7)
- Ideals, quotient rings, prime/maximal ideals (Sheet 8)
- Isomorphism theorems for rings (Sheet 8)
- Field of fractions (Sheet 7)
Polynomial Rings#
Definition 9.1. Let be a commutative ring with unity. The polynomial ring consists of all finite formal sums:Addition and multiplication are defined coefficient-wise and by convolution:
Definition 9.2. The degree of a nonzero polynomial with is , denoted . The zero polynomial has degree undefined (or ).
Definition 9.3. A polynomial is monic if its leading coefficient is .
Theorem 9.4. If is an integral domain, then is an integral domain. Moreover, for nonzero :
Theorem 9.5. If is a commutative ring with unity, then is a commutative ring with unity.
Example 9.6. is an integral domain. Its units are .
Example 9.7. has units .
Example 9.8. has infinitely many irreducible polynomials.
Exercise 9.9. Show that is commutative iff is commutative.
Exercise 9.10. Prove Theorem 9.4.
Exercise 9.11. Show that the units of (where is a field) are precisely the nonzero constant polynomials.
The Division Algorithm#
Theorem 9.12 (Division Algorithm). Let be a field, and let with . Then there exist unique polynomials such that:
where either or .
Corollary 9.13 (Remainder Theorem). When is divided by , the remainder is .
Corollary 9.14 (Factor Theorem). For , divides iff .
Example 9.15. Divide by in . Quotient: , Remainder: .
Example 9.16. In , divide by . Remainder: .
Exercise 9.17. Divide by in .
Exercise 9.18. Show that is divisible by in .
Exercise 9.19. Prove the Remainder Theorem using the Division Algorithm.
Greatest Common Divisors#
Definition 9.20. Let be nonzero. A polynomial is a greatest common divisor (gcd) of and if:
- divides both and .
- If divides both and , then divides .
We take the gcd to be monic, denoted .
Theorem 9.21 (Euclidean Algorithm). The gcd of two polynomials in can be computed by repeated application of the division algorithm.
Theorem 9.22. For any nonzero , there exist polynomials such that:
Definition 9.23. Polynomials are relatively prime if .
Example 9.24. In , .
Exercise 9.25. Find in and express it as a linear combination of the two polynomials.
Exercise 9.26. Show that and are not relatively prime in .
Exercise 9.27. Prove Theorem 9.22.
Irreducible Polynomials#
Definition 9.28. A nonconstant polynomial is irreducible over if whenever with , either or is constant. Otherwise, is reducible.
Theorem 9.29. A polynomial of degree or is irreducible over iff it has no root in .
Theorem 9.30. If is irreducible and , then has no roots in .
Theorem 9.31. A polynomial has at most roots in .
Example 9.32. is irreducible over but reducible over .
Example 9.33. is irreducible over but reducible over .
Example 9.34. is irreducible over (no roots: ).
Exercise 9.35. Determine whether is irreducible over .
Exercise 9.36. Show that is reducible over . (Hint: .)
Exercise 9.37. Prove Theorem 9.29.
Unique Factorization in #
Theorem 9.38. Every nonconstant polynomial in factors uniquely (up to order and constant factors) into a product of irreducible polynomials.
Definition 9.39. An integral domain is a unique factorization domain (UFD) if every nonzero nonunit element factors uniquely into irreducibles.
Theorem 9.40. If is a field, then is a UFD.
Theorem 9.41. In a UFD, irreducible elements are prime.
Theorem 9.42. If is a UFD, then is a UFD.
Example 9.43. is a UFD. is a UFD.
Exercise 9.44. Factor into irreducibles over , over , and over .
Exercise 9.45. Show that is a UFD but not a PID.
Principal Ideal Domains#
Definition 9.46. An integral domain is a principal ideal domain (PID) if every ideal is principal, i.e., every ideal is of the form .
Theorem 9.47. If is a field, then is a PID.
Theorem 9.48. Every PID is a UFD.
Theorem 9.49. In a PID, irreducible elements are prime.
Example 9.50. is a PID. is not a PID.
Theorem 9.51. In a PID, every proper ideal is contained in a maximal ideal.
Theorem 9.52. In a PID, an ideal is maximal iff is irreducible.
Theorem 9.53. In a PID, an ideal is prime iff or is irreducible.
Exercise 9.54. Show that the ideal in is not principal, proving is not a PID.
Exercise 9.55. Prove that in a PID, every prime ideal is maximal.
Exercise 9.56. Prove Theorem 9.47.
Content and Gauss's Lemma#
Definition 9.57. Let be a UFD and . The content of , denoted , is the gcd of all coefficients of .
Definition 9.58. A polynomial is primitive if .
Theorem 9.59 (Gauss's Lemma, Product Form). If are primitive, then is primitive. Equivalently:
Theorem 9.60 (Gauss's Lemma, Factorization Form). If is a UFD with field of fractions , and is primitive, then is irreducible in iff is irreducible in .
Corollary 9.61. If is primitive and reducible in , it is reducible in . Conversely, any factorization in can be cleared of denominators to give a factorization in .
Example 9.62. is irreducible over but reducible over (since is not a unit in ).
Exercise 9.63. Show that has content and primitive part .
Exercise 9.64. Prove the product form of Gauss's Lemma.
Exercise 9.65. Use Gauss's Lemma to show that is irreducible over iff it is irreducible over .
Irreducibility Criteria#
Theorem 9.66 (Eisenstein's Criterion). Let . Suppose there exists a prime such that:
- .
- for all .
- .
Then is irreducible over .
Example 9.67. is irreducible over by Eisenstein with .
Example 9.68. is not Eisenstein (all coefficients divisible by , but ).
Example 9.69. is irreducible over by Eisenstein with .
Theorem 9.70 (Reduction Mod ). Let be monic. If the reduction is irreducible for some prime , then is irreducible over .
Example 9.71. is irreducible over . Its reduction mod is irreducible.
Example 9.72. is irreducible over since its reduction mod is , which is irreducible over .
Exercise 9.73. Use Eisenstein's criterion to show is irreducible over .
Exercise 9.74. Show that is irreducible over by Eisenstein's criterion.
Exercise 9.75. Use reduction mod to show that is irreducible over .
Formal Derivatives and Multiple Roots#
Definition 9.76. The formal derivative of is:
Theorem 9.77 (Product Rule). In any field , for all :
Definition 9.78. A polynomial has a multiple root (in some extension of ) if divides .
Theorem 9.79. A polynomial has a multiple root iff .
Theorem 9.80. If has characteristic , then every irreducible polynomial over has no multiple roots (i.e., is separable).
Theorem 9.81. If has characteristic , an irreducible polynomial may have multiple roots only if for some .
Example 9.82. In , the polynomial may have multiple roots. For example, in .
Exercise 9.83. Compute the derivative of .
Exercise 9.84. Show that has multiple roots in .
Exercise 9.85. Prove Theorem 9.79 using the product rule.
Exercise 9.86. Show that in characteristic , every irreducible polynomial has no multiple roots.
Cyclotomic Polynomials#
Definition 9.87. The th cyclotomic polynomial is:where is a primitive th root of unity.
Theorem 9.88. for all .
Theorem 9.89. For each , is irreducible over .
Example 9.91. .
.
.
.
.
Exercise 9.92. Compute .
Exercise 9.93. Compute .
Exercise 9.94. Show that .
Summary#
We have introduced:
- Polynomial rings and their properties
- The Division Algorithm for
- Greatest common divisors and the Euclidean Algorithm
- Irreducible polynomials
- Unique Factorization Domain (UFD) structure of
- Principal Ideal Domains (PIDs)
- Content and Gauss's Lemma
- Eisenstein's Criterion and Reduction Mod
- Formal derivatives and multiple roots
- Cyclotomic polynomials