Math 2.0

Field theory and polynomials Proof

Proof of the reduction modulo p test for irreducibility

Builds on Irreducible polynomialMonic polynomialGauss's lemmaPrimitive polynomialUniversal property of the polynomial ringZ/pZ is a field for p primeDegree of a productUnit of a ringThe integers are a Euclidean domainEuclidean domains are principal ideal domainsPID implies UFDThe rationals as the field of fractions of the integers

Proof

  1. Let f∈ℤ[x]f \in \Z[x] be monic, let pp be a prime, and assume that fˉ\bar{f} is irreducible in 𝔽p[x]\F_p[x]. Here 𝔽p=ℤ/pℤ\F_p = \Z/p\Z is a field.
  2. Let π ⁣:ℤ[x]→𝔽p[x]\pi \colon \Z[x] \to \F_p[x] reduce each coefficient modulo pp. By the universal property of the polynomial ring, applied to ℤ→𝔽p\Z \to \F_p and x↦xx \mapsto x, the map π\pi is a ring homomorphism. Also π(f)=fˉ\pi(f) = \bar{f}.
  3. If g∈ℤ[x]g \in \Z[x] is monic, then π(g)\pi(g) is monic with deg⁡π(g)=deg⁡g\deg \pi(g) = \deg g, because the leading coefficient 11 reduces to 1≠01 \ne 0.
  4. Over a field FF, the units of F[x]F[x] are the nonzero constants. Indeed, uv=1u v = 1 forces deg⁡u=0\deg u = 0 by the degree of a product, and a nonzero constant has an inverse in FF.
  5. By the same degree argument, the units of ℤ[x]\Z[x] are the units of ℤ\Z, that is, ±1\pm 1.
  6. Since fˉ\bar{f} is irreducible, it is not a unit, so deg⁡fˉ≥1\deg \bar{f} \ge 1 by Step 4. By Step 3, deg⁡f=deg⁡fˉ≥1\deg f = \deg \bar{f} \ge 1. So ff is nonzero and not a unit of ℤ[x]\Z[x].
  7. Suppose that f=ghf = g h with g,h∈ℤ[x]g, h \in \Z[x]. Their leading coefficients multiply to 11, so both are 11 or both are −1-1.
  8. In the second case, replace g,hg, h by −g,−h-g, -h. This does not change the product, and gg is a unit if and only if −g-g is. So we may assume that gg and hh are monic.
  9. By Step 2, fˉ=π(g) π(h)\bar{f} = \pi(g) \, \pi(h). Since fˉ\bar{f} is irreducible, π(g)\pi(g) or π(h)\pi(h) is a unit, say π(g)\pi(g). By Step 4, deg⁡π(g)=0\deg \pi(g) = 0.
  10. By Step 3, deg⁡g=0\deg g = 0. A monic polynomial of degree 00 is the constant 11, so gg is a unit.
  11. By Steps 6 to 10, ff is irreducible in ℤ[x]\Z[x].
  12. The monic polynomial ff is primitive: an integer that divides every coefficient divides the leading coefficient 11, so it is ±1\pm 1.
  13. The ring ℤ\Z is a Euclidean domain, hence a principal ideal domain, hence a unique factorisation domain, with field of fractions ℚ\Q.
  14. By Gauss's lemma, with Steps 11 to 13, ff is irreducible in ℚ[x]\Q[x].

Idea

Reduction modulo pp is a ring homomorphism, and it keeps the degree of a monic polynomial. So a factorisation of ff into monic factors of positive degree would give one of fˉ\bar{f}. Gauss's lemma then moves irreducibility from ℤ[x]\Z[x] to ℚ[x]\Q[x].

Reading path

To understand this page from the ground up, read these 146 pages in order. The foundations come first. The path takes the proofs Proof of Bézout's identity, Proof that in a UFD irreducible elements are prime, Proof of cancellation in an integral domain, Proof of the commutativity of addition by induction, Proof that R/P is an integral domain iff P is prime, Proof of the universal property of the polynomial ring, Proof that Z/nZ is a field if and only if n is prime, Proof that every principal ideal domain is a unique factorisation domain, Proof that a composition of injections is injective, Proof that R[x] is an integral domain iff R is, Proof that a function is bijective iff it has a two-sided inverse, Proof that the product of primitive polynomials is primitive, Proof that maximal ideals are prime, Proof that a finite integral domain is a field, Proof of the degree of a product over an integral domain, Proof of strong induction from ordinary induction, Proof of the correspondence theorem for rings, Proof of the complement principle, Proof of the pigeonhole principle, Proof that a composition of surjections is surjective, Proof that R/M is a field iff M is maximal, Proof that the integers are a Euclidean domain, Proof that congruence is compatible with addition, Proof that the only ideals of a field are zero and the whole field, Proof that congruence is compatible with multiplication, Proof of the rule of sum, Proof of the well-ordering principle from strong induction, Proof of the division algorithm, Proof of Gauss's lemma on irreducibility over a UFD, Proof that prime elements are irreducible in an integral domain, Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal, Proof of the bijection principle, Proof that Euclidean domains are principal ideal domains.

  1. Cardinality of a finite set definition
  2. Definition by recursion concept
  3. Divisibility definition
  4. Element definition
  5. Group concept
  6. Mathematical induction concept
  7. Natural numbers object
  8. Peano axioms concept
  9. Proposition concept
  10. Congruence modulo n definition
  11. Greatest common divisor definition
  12. Prime number definition
  13. Set definition
  14. Ring definition
  15. Successor function definition
  16. Conjunction definition
  17. Implication definition
  18. Predicate definition
  19. Residue class definition
  20. Proof that congruence is compatible with addition proof
  21. Proof that congruence is compatible with multiplication proof
  22. Composite number definition
  23. Empty set object
  24. Ordered pair definition
  25. Addition of natural numbers definition
  26. Commutative ring definition
  27. Ideal definition
  28. Intersection definition
  29. Polynomial ring definition
  30. Ring homomorphism definition
  31. Unit of a ring definition
  32. Zero divisor definition
  33. The successor function is injective statement
  34. Zero is not a successor statement
  35. Existential quantifier definition
  36. Universal quantifier definition
  37. Congruence is compatible with addition statement
  38. Congruence is compatible with multiplication statement
  39. Cartesian product definition
  40. Proof of the commutativity of addition by induction proof
  41. Order on the natural numbers definition
  42. Disjoint sets definition
  43. Divisibility in a commutative ring definition
  44. The ring of integers example
  45. Ideal generated by a subset definition
  46. Prime ideal definition
  47. Subset definition
  48. Maximal ideal definition
  49. Two-sided ideal definition
  50. Proof of the universal property of the polynomial ring proof
  51. Field definition
  52. Degree of a polynomial definition
  53. Integral domain definition
  54. Polynomial evaluation definition
  55. Uniqueness quantifier definition
  56. Integers modulo n definition
  57. Commutativity of addition statement
  58. Binary relation definition
  59. Principal ideal definition
  60. Quotient ring definition
  61. Proof of strong induction from ordinary induction proof
  62. Associate elements definition
  63. Prime element definition
  64. Proof of cancellation in an integral domain proof
  65. Proof that the only ideals of a field are zero and the whole field proof
  66. Evaluation homomorphism definition
  67. Irreducible element definition
  68. Field of fractions definition
  69. Leading coefficient definition
  70. Euclidean domain definition
  71. Strong induction statement
  72. Proof that R/M is a field iff M is maximal proof
  73. Proof that R/P is an integral domain iff P is prime proof
  74. Greatest common divisor in an integral domain definition
  75. Principal ideal domain definition
  76. The rationals as the field of fractions of the integers example
  77. Function definition
  78. The only ideals of a field are zero and the whole field statement
  79. Irreducible polynomial definition
  80. Unique factorisation domain definition
  81. Universal property of the polynomial ring statement
  82. Cancellation in an integral domain statement
  83. Monic polynomial definition
  84. Proof of the degree of a product over an integral domain proof
  85. Proof of the well-ordering principle from strong induction proof
  86. Codomain definition
  87. Content of a polynomial definition
  88. Function composition definition
  89. Identity function definition
  90. Injective function definition
  91. R/P is an integral domain iff P is prime statement
  92. Image of a set definition
  93. Preimage of a set definition
  94. Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
  95. Proof that prime elements are irreducible in an integral domain proof
  96. Degree of a product statement
  97. Primitive polynomial definition
  98. Well-ordering principle statement
  99. Left inverse definition
  100. Right inverse definition
  101. Surjective function definition
  102. Proof that a composition of injections is injective proof
  103. In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
  104. Prime elements are irreducible in an integral domain statement
  105. Proof that R[x] is an integral domain iff R is proof
  106. Proof of the division algorithm proof
  107. Proof that a composition of surjections is surjective proof
  108. Composition of injections is injective statement
  109. Bijective function definition
  110. Proof that Euclidean domains are principal ideal domains proof
  111. Proof that in a UFD irreducible elements are prime proof
  112. Proof that the integers are a Euclidean domain proof
  113. R[x] is an integral domain iff R is statement
  114. Division algorithm statement
  115. Composition of surjections is surjective statement
  116. Proof of the rule of sum proof
  117. Proof that a function is bijective iff it has a two-sided inverse proof
  118. Proof of the correspondence theorem for rings proof
  119. Euclidean domains are principal ideal domains statement
  120. In a UFD irreducible elements are prime statement
  121. The integers are a Euclidean domain statement
  122. Proof of Bézout's identity proof
  123. Rule of sum statement
  124. Bijective iff it has a two-sided inverse statement
  125. Correspondence theorem for rings statement
  126. Proof that the product of primitive polynomials is primitive proof
  127. Proof of Gauss's lemma on irreducibility over a UFD proof
  128. Bézout's identity statement
  129. Proof of the bijection principle proof
  130. Proof of the complement principle proof
  131. Product of primitive polynomials is primitive statement
  132. R/M is a field iff M is maximal statement
  133. Bijection principle statement
  134. Complement principle statement
  135. Proof that Z/nZ is a field if and only if n is prime proof
  136. Gauss's lemma statement
  137. Proof that maximal ideals are prime proof
  138. Proof of the pigeonhole principle proof
  139. Maximal ideals are prime statement
  140. Pigeonhole principle statement
  141. Proof that every principal ideal domain is a unique factorisation domain proof
  142. PID implies UFD statement
  143. Proof that a finite integral domain is a field proof
  144. A finite integral domain is a field statement
  145. Z/pZ is a field for p prime statement
  146. Proof of the reduction modulo p test for irreducibility proof

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Irreducible_polynomial, Over the integers and finite fields
About this page
TagW5N7GWHAKZ
URIm2://W5N7GWHAKZ
Kindproof
WritingW0 stub
MSC12E05
ProvesReduction modulo p test for irreducibility
UsesIrreducible polynomial, Monic polynomial, Gauss's lemma, Primitive polynomial, Universal property of the polynomial ring, Z/pZ is a field for p prime, Degree of a product, Unit of a ring, The integers are a Euclidean domain, Euclidean domains are principal ideal domains, PID implies UFD, The rationals as the field of fractions of the integers
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.