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 Z\mathbb{Z} are the prototypical Euclidean domain, polynomial rings F[x]F[x] 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 Z\mathbb{Z} and F[x]F[x] 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 RR be a commutative ring with unity. The polynomial ring R[x]R[x] consists of all finite formal sums:f(x)=a0+a1x+⋯+anxn,ai∈R.f(x) = a_0 + a_1 x + \cdots + a_n x^n, \quad a_i \in R.Addition and multiplication are defined coefficient-wise and by convolution:

  • (f+g)(x)=∑(ai+bi)xi(f + g)(x) = \sum (a_i + b_i)x^i
  • (fg)(x)=∑k(∑i+j=kaibj)xk(fg)(x) = \sum_k (\sum_{i+j=k} a_i b_j)x^k

Definition 9.2. The degree of a nonzero polynomial f(x)=anxn+⋯+a0f(x) = a_n x^n + \cdots + a_0 with an≠0a_n \neq 0 is nn, denoted deg⁡f(x)\deg f(x). The zero polynomial has degree undefined (or −∞-\infty).

Definition 9.3. A polynomial is monic if its leading coefficient is 11.

Theorem 9.4. If RR is an integral domain, then R[x]R[x] is an integral domain. Moreover, for nonzero f,g∈R[x]f, g \in R[x]:
deg⁡(fg)=deg⁡f+deg⁡g.\deg(fg) = \deg f + \deg g.

Theorem 9.5. If RR is a commutative ring with unity, then R[x]R[x] is a commutative ring with unity.

Example 9.6. Z[x]\mathbb{Z}[x] is an integral domain. Its units are ±1\pm 1.

Example 9.7. Z5[x]\mathbb{Z}_5[x] has units 1,2,3,41, 2, 3, 4.

Example 9.8. Z[x]\mathbb{Z}[x] has infinitely many irreducible polynomials.

Exercise 9.9. Show that R[x]R[x] is commutative iff RR is commutative.

Exercise 9.10. Prove Theorem 9.4.

Exercise 9.11. Show that the units of F[x]F[x] (where FF is a field) are precisely the nonzero constant polynomials.


The Division Algorithm#

Theorem 9.12 (Division Algorithm). Let FF be a field, and let f(x),g(x)∈F[x]f(x), g(x) \in F[x] with g(x)≠0g(x) \neq 0. Then there exist unique polynomials q(x),r(x)∈F[x]q(x), r(x) \in F[x] such that:
f(x)=g(x)q(x)+r(x),f(x) = g(x)q(x) + r(x),
where either r(x)=0r(x) = 0 or deg⁡r(x)<deg⁡g(x)\deg r(x) < \deg g(x).

Corollary 9.13 (Remainder Theorem). When f(x)f(x) is divided by x−ax - a, the remainder is f(a)f(a).

Corollary 9.14 (Factor Theorem). For a∈Fa \in F, x−ax - a divides f(x)f(x) iff f(a)=0f(a) = 0.

Example 9.15. Divide x3+2x2+3x+4x^3 + 2x^2 + 3x + 4 by x2+1x^2 + 1 in Q[x]\mathbb{Q}[x]. Quotient: x+2x + 2, Remainder: 2x+22x + 2.

Example 9.16. In Z3[x]\mathbb{Z}_3[x], divide x4+2x3+x+1x^4 + 2x^3 + x + 1 by x+1x + 1. Remainder: f(−1)=f(2)=16+16+2+1=35≡2(mod3)f(-1) = f(2) = 16 + 16 + 2 + 1 = 35 \equiv 2 \pmod{3}.

Exercise 9.17. Divide x5−2x3+x2−1x^5 - 2x^3 + x^2 - 1 by x2+x+1x^2 + x + 1 in Q[x]\mathbb{Q}[x].

Exercise 9.18. Show that x3+1x^3 + 1 is divisible by x+1x + 1 in Z3[x]\mathbb{Z}_3[x].

Exercise 9.19. Prove the Remainder Theorem using the Division Algorithm.


Greatest Common Divisors#

Definition 9.20. Let f,g∈F[x]f, g \in F[x] be nonzero. A polynomial d∈F[x]d \in F[x] is a greatest common divisor (gcd) of ff and gg if:

  1. dd divides both ff and gg.
  2. If hh divides both ff and gg, then hh divides dd.

We take the gcd to be monic, denoted gcd⁡(f,g)\gcd(f, g).

Theorem 9.21 (Euclidean Algorithm). The gcd of two polynomials in F[x]F[x] can be computed by repeated application of the division algorithm.

Theorem 9.22. For any nonzero f,g∈F[x]f, g \in F[x], there exist polynomials s,t∈F[x]s, t \in F[x] such that:gcd⁡(f,g)=sf+tg.\gcd(f, g) = s f + t g.

Definition 9.23. Polynomials f,g∈F[x]f, g \in F[x] are relatively prime if gcd⁡(f,g)=1\gcd(f, g) = 1.

Example 9.24. In Q[x]\mathbb{Q}[x], gcd⁡(x4−1,x3−1)=x−1\gcd(x^4 - 1, x^3 - 1) = x - 1.

Exercise 9.25. Find gcd⁡(x4−1,x3−1)\gcd(x^4 - 1, x^3 - 1) in Q[x]\mathbb{Q}[x] and express it as a linear combination of the two polynomials.

Exercise 9.26. Show that x2+1x^2 + 1 and x3+xx^3 + x are not relatively prime in R[x]\mathbb{R}[x].

Exercise 9.27. Prove Theorem 9.22.


Irreducible Polynomials#

Definition 9.28. A nonconstant polynomial f∈F[x]f \in F[x] is irreducible over FF if whenever f=ghf = gh with g,h∈F[x]g, h \in F[x], either gg or hh is constant. Otherwise, ff is reducible.

Theorem 9.29. A polynomial f∈F[x]f \in F[x] of degree 22 or 33 is irreducible over FF iff it has no root in FF.

Theorem 9.30. If f∈F[x]f \in F[x] is irreducible and deg⁡f=n\deg f = n, then ff has no roots in FF.

Theorem 9.31. A polynomial has at most deg⁡f\deg f roots in FF.

Example 9.32. x2+1x^2 + 1 is irreducible over R\mathbb{R} but reducible over C\mathbb{C}.

Example 9.33. x2−2x^2 - 2 is irreducible over Q\mathbb{Q} but reducible over R\mathbb{R}.

Example 9.34. x3+x+1x^3 + x + 1 is irreducible over Z2\mathbb{Z}_2 (no roots: f(0)=1,f(1)=1f(0) = 1, f(1) = 1).

Exercise 9.35. Determine whether x3+x2+1x^3 + x^2 + 1 is irreducible over Z2\mathbb{Z}_2.

Exercise 9.36. Show that x4+4x^4 + 4 is reducible over Q\mathbb{Q}. (Hint: x4+4=(x2−2x+2)(x2+2x+2)x^4 + 4 = (x^2 - 2x + 2)(x^2 + 2x + 2).)

Exercise 9.37. Prove Theorem 9.29.


Unique Factorization in F[x]F[x]#

Theorem 9.38. Every nonconstant polynomial in F[x]F[x] factors uniquely (up to order and constant factors) into a product of irreducible polynomials.

Definition 9.39. An integral domain RR is a unique factorization domain (UFD) if every nonzero nonunit element factors uniquely into irreducibles.

Theorem 9.40. If FF is a field, then F[x]F[x] is a UFD.

Theorem 9.41. In a UFD, irreducible elements are prime.

Theorem 9.42. If RR is a UFD, then R[x]R[x] is a UFD.

Example 9.43. Z\mathbb{Z} is a UFD. Z[x]\mathbb{Z}[x] is a UFD.

Exercise 9.44. Factor x4−1x^4 - 1 into irreducibles over Q\mathbb{Q}, over R\mathbb{R}, and over C\mathbb{C}.

Exercise 9.45. Show that Z[x]\mathbb{Z}[x] is a UFD but not a PID.


Principal Ideal Domains#

Definition 9.46. An integral domain RR is a principal ideal domain (PID) if every ideal is principal, i.e., every ideal is of the form (a)={ra∣r∈R}(a) = \{ra \mid r \in R\}.

Theorem 9.47. If FF is a field, then F[x]F[x] is a PID.

Theorem 9.48. Every PID is a UFD.

Theorem 9.49. In a PID, irreducible elements are prime.

Example 9.50. Z\mathbb{Z} is a PID. Z[x]\mathbb{Z}[x] 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 (a)(a) is maximal iff aa is irreducible.

Theorem 9.53. In a PID, an ideal (a)(a) is prime iff a=0a = 0 or aa is irreducible.

Exercise 9.54. Show that the ideal (x,2)(x, 2) in Z[x]\mathbb{Z}[x] is not principal, proving Z[x]\mathbb{Z}[x] 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 DD be a UFD and f(x)∈D[x]f(x) \in D[x]. The content of ff, denoted cont⁡(f)\operatorname{cont}(f), is the gcd of all coefficients of ff.

Definition 9.58. A polynomial is primitive if cont⁡(f)=1\operatorname{cont}(f) = 1.

Theorem 9.59 (Gauss's Lemma, Product Form). If f,g∈D[x]f, g \in D[x] are primitive, then fgfg is primitive. Equivalently:cont⁡(fg)=cont⁡(f)⋅cont⁡(g).\operatorname{cont}(fg) = \operatorname{cont}(f) \cdot \operatorname{cont}(g).

Theorem 9.60 (Gauss's Lemma, Factorization Form). If DD is a UFD with field of fractions FF, and f∈D[x]f \in D[x] is primitive, then ff is irreducible in D[x]D[x] iff ff is irreducible in F[x]F[x].

Corollary 9.61. If f∈D[x]f \in D[x] is primitive and reducible in D[x]D[x], it is reducible in F[x]F[x]. Conversely, any factorization in F[x]F[x] can be cleared of denominators to give a factorization in D[x]D[x].

Example 9.62. 2x+22x + 2 is irreducible over Q[x]\mathbb{Q}[x] but reducible over Z[x]\mathbb{Z}[x] (since 22 is not a unit in Z\mathbb{Z}).

Exercise 9.63. Show that f(x)=2x2+2x+2f(x) = 2x^2 + 2x + 2 has content 22 and primitive part x2+x+1x^2 + x + 1.

Exercise 9.64. Prove the product form of Gauss's Lemma.

Exercise 9.65. Use Gauss's Lemma to show that x3+x2+1x^3 + x^2 + 1 is irreducible over Q\mathbb{Q} iff it is irreducible over Z\mathbb{Z}.


Irreducibility Criteria#

Theorem 9.66 (Eisenstein's Criterion). Let f(x)=anxn+⋯+a0∈Z[x]f(x) = a_n x^n + \cdots + a_0 \in \mathbb{Z}[x]. Suppose there exists a prime pp such that:

  1. p∤anp \nmid a_n.
  2. p∣aip \mid a_i for all i<ni < n.
  3. p2∤a0p^2 \nmid a_0.

Then f(x)f(x) is irreducible over Q\mathbb{Q}.

Example 9.67. x5−3x2+6x^5 - 3x^2 + 6 is irreducible over Q\mathbb{Q} by Eisenstein with p=3p = 3.

Example 9.68. 2x3+4x2+6x+22x^3 + 4x^2 + 6x + 2 is not Eisenstein (all coefficients divisible by 22, but 22∣a02^2 \mid a_0).

Example 9.69. xp−px^p - p is irreducible over Q\mathbb{Q} by Eisenstein with pp.

Theorem 9.70 (Reduction Mod pp). Let f∈Z[x]f \in \mathbb{Z}[x] be monic. If the reduction f‾∈Zp[x]\overline{f} \in \mathbb{Z}_p[x] is irreducible for some prime pp, then ff is irreducible over Q\mathbb{Q}.

Example 9.71. x4+x3+x2+x+1x^4 + x^3 + x^2 + x + 1 is irreducible over Q\mathbb{Q}. Its reduction mod 22 is irreducible.

Example 9.72. x3−x−1x^3 - x - 1 is irreducible over Q\mathbb{Q} since its reduction mod 22 is x3+x+1x^3 + x + 1, which is irreducible over Z2\mathbb{Z}_2.

Exercise 9.73. Use Eisenstein's criterion to show x4+2x3+4x2+8x+16x^4 + 2x^3 + 4x^2 + 8x + 16 is irreducible over Q\mathbb{Q}.

Exercise 9.74. Show that x3−2x2+2x+2x^3 - 2x^2 + 2x + 2 is irreducible over Q\mathbb{Q} by Eisenstein's criterion.

Exercise 9.75. Use reduction mod 22 to show that x4+x+1x^4 + x + 1 is irreducible over Q\mathbb{Q}.


Formal Derivatives and Multiple Roots#

Definition 9.76. The formal derivative of f(x)=anxn+⋯+a0∈F[x]f(x) = a_n x^n + \cdots + a_0 \in F[x] is:f′(x)=nanxn−1+⋯+a1.f'(x) = n a_n x^{n-1} + \cdots + a_1.

Theorem 9.77 (Product Rule). In any field FF, for all f,g∈F[x]f, g \in F[x]:(fg)′=f′g+fg′.(fg)' = f'g + fg'.

Definition 9.78. A polynomial f∈F[x]f \in F[x] has a multiple root α\alpha (in some extension of FF) if (x−α)2(x - \alpha)^2 divides f(x)f(x).

Theorem 9.79. A polynomial f∈F[x]f \in F[x] has a multiple root iff gcd⁡(f,f′)≠1\gcd(f, f') \neq 1.

Theorem 9.80. If FF has characteristic 00, then every irreducible polynomial over FF has no multiple roots (i.e., is separable).

Theorem 9.81. If FF has characteristic p>0p > 0, an irreducible polynomial ff may have multiple roots only if f(x)=g(xp)f(x) = g(x^p) for some g∈F[x]g \in F[x].

Example 9.82. In Zp[x]\mathbb{Z}_p[x], the polynomial xp−ax^p - a may have multiple roots. For example, xp−1=(x−1)px^p - 1 = (x - 1)^p in Zp[x]\mathbb{Z}_p[x].

Exercise 9.83. Compute the derivative of x5+2x3+x+1∈Z5[x]x^5 + 2x^3 + x + 1 \in \mathbb{Z}_5[x].

Exercise 9.84. Show that x4−2x2+1x^4 - 2x^2 + 1 has multiple roots in Q[x]\mathbb{Q}[x].

Exercise 9.85. Prove Theorem 9.79 using the product rule.

Exercise 9.86. Show that in characteristic 00, every irreducible polynomial has no multiple roots.


Cyclotomic Polynomials#

Definition 9.87. The nnth cyclotomic polynomial is:Φn(x)=∏1≤k≤ngcd⁡(k,n)=1(x−ζk),\Phi_n(x) = \prod_{\substack{1 \leq k \leq n \\ \gcd(k,n)=1}} (x - \zeta^k),where ζ\zeta is a primitive nnth root of unity.

Theorem 9.88. Φn(x)∈Z[x]\Phi_n(x) \in \mathbb{Z}[x] for all nn.

Theorem 9.89. For each nn, Φn(x)\Phi_n(x) is irreducible over Q\mathbb{Q}.

Theorem 9.90. xn−1=∏d∣nΦd(x)x^n - 1 = \prod_{d \mid n} \Phi_d(x).

Example 9.91. Φ1(x)=x−1\Phi_1(x) = x - 1.
Φ2(x)=x+1\Phi_2(x) = x + 1.
Φ3(x)=x2+x+1\Phi_3(x) = x^2 + x + 1.
Φ4(x)=x2+1\Phi_4(x) = x^2 + 1.
Φ5(x)=x4+x3+x2+x+1\Phi_5(x) = x^4 + x^3 + x^2 + x + 1.

Exercise 9.92. Compute Φ6(x)\Phi_6(x).

Exercise 9.93. Compute Φ8(x)\Phi_8(x).

Exercise 9.94. Show that x6−1=Φ1(x)Φ2(x)Φ3(x)Φ6(x)x^6 - 1 = \Phi_1(x)\Phi_2(x)\Phi_3(x)\Phi_6(x).


Summary#

We have introduced:

  • Polynomial rings R[x]R[x] and their properties
  • The Division Algorithm for F[x]F[x]
  • Greatest common divisors and the Euclidean Algorithm
  • Irreducible polynomials
  • Unique Factorization Domain (UFD) structure of F[x]F[x]
  • Principal Ideal Domains (PIDs)
  • Content and Gauss's Lemma
  • Eisenstein's Criterion and Reduction Mod pp
  • Formal derivatives and multiple roots
  • Cyclotomic polynomials