Math 2.0

Field theory and polynomials Proof

Proof of the uniqueness of splitting fields

Builds on FieldSplitting fieldSplit polynomialField generated by adjoining elementsUniversal property of the polynomial ringMinimal polynomial of an algebraic elementThe minimal polynomial divides every polynomial vanishing at the elementThe minimal polynomial is irreducibleK(a) is isomorphic to K[x] modulo the minimal polynomialDegree of a simple extension is the degree of the minimal polynomialTower lawFirst isomorphism theorem for ringsRing isomorphismK[x] is a Euclidean domainEuclidean domains are principal ideal domainsPID implies UFDIn a UFD irreducible elements are primePrime elementDegree of a productMathematical induction

Proof

We prove a stronger claim, which allows a change of base field, by strong induction on the degree [L:K][L : K].

  1. For a ring isomorphism τ ⁣:K→K′\tau \colon K \to K' of fields and h=∑icixi∈K[x]h = \sum_i c_i x^i \in K[x], write τh=∑iτ(ci)xi\tau h = \sum_i \tau(c_i) x^i. By the universal property of the polynomial ring, h↦τhh \mapsto \tau h is a ring isomorphism K[x]→K′[x]K[x] \to K'[x], with inverse h↦τ−1hh \mapsto \tau^{-1} h.
  2. Claim: let τ ⁣:K→K′\tau \colon K \to K' be a ring isomorphism of fields, and f∈K[x]f \in K[x] nonzero. Let LL be a splitting field of ff over KK, and L′L' one of τf\tau f over K′K'. Then some ring isomorphism σ ⁣:L→L′\sigma \colon L \to L' extends τ\tau.
  3. The statement is the case K′=KK' = K and τ=id⁡\tau = \id, so it suffices to prove the claim. First, [L:K][L : K] is finite. Indeed, L=K(a1,…,an)L = K(a_1, \dots, a_n) for roots aia_i of ff, which are algebraic over KK.
  4. Adjoining a1,…,ana_1, \dots, a_n one at a time gives a chain of fields from KK to LL. Each step is finite by the degree of a simple extension, so [L:K][L : K] is finite by the tower law.
  5. Write f=c(x−a1)⋯(x−an)f = c (x - a_1) \cdots (x - a_n) in L[x]L[x] and τf=c′(x−b1)⋯(x−bn)\tau f = c' (x - b_1) \cdots (x - b_n) in L′[x]L'[x], with L=K(a1,…,an)L = K(a_1, \dots, a_n) and L′=K′(b1,…,bn)L' = K'(b_1, \dots, b_n), as in the definitions of splitting and generated field. Let d=[L:K]d = [L : K].
  6. Case d=1d = 1. Then L=KL = K, so all ai∈Ka_i \in K. Applying the ring homomorphism of Step 1 gives τf=τ(c)(x−τ(a1))⋯(x−τ(an))\tau f = \tau(c) (x - \tau(a_1)) \cdots (x - \tau(a_n)) in K′[x]K'[x].
  7. Comparing with Step 5 by unique factorisation in L′[x]L'[x], which is a Euclidean domain, hence a PID and a UFD, each bjb_j is some τ(ai)∈K′\tau(a_i) \in K'. So L′=K′L' = K', and σ=τ\sigma = \tau works.
  8. Case d>1d > 1, assuming the claim whenever the degree is less than dd. If all aia_i were in KK, then L=KL = K and d=1d = 1. So some root a=aia = a_i is not in KK.
  9. Let mm be the minimal polynomial of aa over KK. It is irreducible, it divides ff, and deg⁡m=[K(a):K]>1\deg m = [K(a) : K] > 1 since a∉Ka \notin K.
  10. By Step 1, τm\tau m is monic, irreducible in K′[x]K'[x], of degree deg⁡m\deg m, and τm\tau m divides τf\tau f. So τm\tau m divides ∏j(x−bj)\prod_j (x - b_j) in L′[x]L'[x], as c′≠0c' \ne 0.
  11. Let π\pi be a monic divisor of τm\tau m in L′[x]L'[x] of least degree ≥1\ge 1. A factorisation of π\pi into two nonunits would give a monic divisor of smaller degree ≥1\ge 1.
  12. So π\pi is irreducible. By Step 7, L′[x]L'[x] is a UFD, so π\pi is prime.
  13. By the definition of a prime element, π\pi divides some factor x−bjx - b_j. Comparing degrees, π=x−bj\pi = x - b_j. So b=bjb = b_j is a root of τm\tau m.
  14. Since τm\tau m is monic, irreducible and τm(b)=0\tau m(b) = 0, divisibility gives that τm\tau m is the minimal polynomial of bb over K′K'.
  15. Let ψ ⁣:K[x]→K′(b)\psi \colon K[x] \to K'(b), h↦(τh)(b)h \mapsto (\tau h)(b). It is a ring homomorphism, and it is surjective because K′(b)={u(b):u∈K′[x]}K'(b) = \set{ u(b) : u \in K'[x] } by the structure of simple extensions.
  16. Its kernel is the set of hh with τm∣τh\tau m \mid \tau h, by Step 14 and divisibility. By Step 1, this is the set of hh with m∣hm \mid h, that is, (m)(m).
  17. By the first isomorphism theorem, K[x]/(m)≅K′(b)K[x]/(m) \cong K'(b) through h+(m)↦(τh)(b)h + (m) \mapsto (\tau h)(b). Also K[x]/(m)≅K(a)K[x]/(m) \cong K(a) through h+(m)↦h(a)h + (m) \mapsto h(a), by the structure of simple extensions.
  18. Composing, σ1 ⁣:K(a)→K′(b)\sigma_1 \colon K(a) \to K'(b), h(a)↦(τh)(b)h(a) \mapsto (\tau h)(b), is a ring isomorphism. On constants it equals τ\tau, so it extends τ\tau, and σ1f=τf\sigma_1 f = \tau f.
  19. The field LL is a splitting field of ff over K(a)K(a): ff splits over LL, and LL is generated over K(a)K(a) by a1,…,ana_1, \dots, a_n, since K(a)⊆LK(a) \subseteq L.
  20. In the same way, L′L' is a splitting field of σ1f=τf\sigma_1 f = \tau f over K′(b)K'(b), because bb is one of the bjb_j.
  21. By the tower law, [L:K(a)]=d/[K(a):K]<d[L : K(a)] = d / [K(a) : K] < d. The induction hypothesis, for σ1\sigma_1, gives a ring isomorphism σ ⁣:L→L′\sigma \colon L \to L' extending σ1\sigma_1.
  22. Then σ\sigma extends τ\tau, which proves the claim. With τ=id⁡K\tau = \id_K, we get σ ⁣:L→L′\sigma \colon L \to L' with σ(c)=c\sigma(c) = c for all c∈Kc \in K.

Idea

Build the isomorphism one root at a time. A root aa of ff outside KK has a minimal polynomial mm, and its image τm\tau m has a root bb among the roots of τf\tau f. Both K(a)K(a) and K′(b)K'(b) are copies of K[x]/(m)K[x]/(m), so τ\tau extends to them. Over these larger fields the degree is smaller, and induction finishes.

Reading path

To understand this page from the ground up, read these 160 pages in order. The foundations come first. The path takes the proofs 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 every principal ideal domain is a unique factorisation domain, Proof of the tower law, Proof that R[x] is an integral domain iff R is, Proof that the degree of a simple extension is the degree of the minimal polynomial, Proof that maximal ideals are prime, Proof of the first isomorphism theorem for rings, Proof that a ring homomorphism is injective iff its kernel is zero, 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 that R/M is a field iff M is maximal, Proof that the only ideals of a field are zero and the whole field, Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial, Proof of Zorn's lemma, Proof of the well-ordering principle from strong induction, Proof that the minimal polynomial is irreducible, Proof that the minimal polynomial divides every polynomial vanishing at the element, Proof that K[x]/(f) is a field iff f is irreducible, 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 that every vector space has a basis, by Zorn's lemma, Proof that Euclidean domains are principal ideal domains, Proof of the universal property of the quotient ring, Proof that K[x] is a Euclidean domain.

  1. Definition by recursion concept
  2. Element definition
  3. Group concept
  4. Linear combination concept
  5. Mathematical induction concept
  6. Natural numbers object
  7. Peano axioms concept
  8. Proof of Zorn's lemma proof
  9. Proposition concept
  10. Spanning set concept
  11. Vector space definition
  12. Set definition
  13. Ring definition
  14. Successor function definition
  15. Disjunction definition
  16. Implication definition
  17. Predicate definition
  18. Linear combination definition
  19. Linear subspace definition
  20. Family of sets definition
  21. Ordered pair definition
  22. Commutative ring definition
  23. Polynomial ring definition
  24. Ring homomorphism definition
  25. Subring definition
  26. Unit of a ring definition
  27. Zero divisor definition
  28. Union definition
  29. Ideal definition
  30. Addition of natural numbers definition
  31. The successor function is injective statement
  32. Zero is not a successor statement
  33. Existential quantifier definition
  34. Universal quantifier definition
  35. Linear independence definition
  36. Linear span definition
  37. Cartesian product definition
  38. Divisibility in a commutative ring definition
  39. Degree of a polynomial definition
  40. Polynomial evaluation definition
  41. Proof of the universal property of the polynomial ring proof
  42. Field definition
  43. Kernel of a ring homomorphism definition
  44. Ring isomorphism definition
  45. Integral domain definition
  46. Subset definition
  47. Proof of the commutativity of addition by induction proof
  48. Ideal generated by a subset definition
  49. Prime ideal definition
  50. Union of a family of sets definition
  51. Order on the natural numbers definition
  52. Maximal ideal definition
  53. Two-sided ideal definition
  54. Uniqueness quantifier definition
  55. Spanning set definition
  56. Leading coefficient definition
  57. Root of a polynomial definition
  58. Associate elements definition
  59. Evaluation homomorphism definition
  60. Prime element definition
  61. Proof of cancellation in an integral domain proof
  62. Binary relation definition
  63. Subfield definition
  64. Irreducible element definition
  65. Proof that the only ideals of a field are zero and the whole field proof
  66. Commutativity of addition statement
  67. Euclidean domain definition
  68. Quotient ring definition
  69. Proof of strong induction from ordinary induction proof
  70. Principal ideal definition
  71. Basis definition
  72. Finite-dimensional vector space definition
  73. Monic polynomial definition
  74. Split polynomial definition
  75. Proof of the degree of a product over an integral domain proof
  76. Universal property of the polynomial ring statement
  77. Irreducible polynomial definition
  78. Antisymmetric relation definition
  79. Field extension definition
  80. Reflexive relation definition
  81. Transitive relation definition
  82. Unique factorisation domain definition
  83. Cancellation in an integral domain statement
  84. The only ideals of a field are zero and the whole field statement
  85. Proof of the universal property of the quotient ring proof
  86. Proof that R/M is a field iff M is maximal proof
  87. Proof that R/P is an integral domain iff P is prime proof
  88. Strong induction statement
  89. Principal ideal domain definition
  90. Function definition
  91. Dimension theorem for vector spaces statement
  92. Dimension definition
  93. Division algorithm for polynomials statement
  94. Degree of a product statement
  95. Algebraic element definition
  96. Degree of a field extension definition
  97. Proof that prime elements are irreducible in an integral domain proof
  98. Intermediate field definition
  99. Preorder definition
  100. Universal property of the quotient ring statement
  101. Proof of the well-ordering principle from strong induction proof
  102. Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
  103. R/P is an integral domain iff P is prime statement
  104. Image of a set definition
  105. Preimage of a set definition
  106. Choice function definition
  107. Codomain definition
  108. Injective function definition
  109. Minimal polynomial of an algebraic element definition
  110. Proof that R[x] is an integral domain iff R is proof
  111. Partial order definition
  112. Field generated by adjoining elements definition
  113. Prime elements are irreducible in an integral domain statement
  114. Proof that a ring homomorphism is injective iff its kernel is zero proof
  115. Well-ordering principle statement
  116. In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
  117. Axiom of choice statement
  118. Surjective function definition
  119. Proof that the minimal polynomial divides every polynomial vanishing at the element proof
  120. Maximal element definition
  121. Total order definition
  122. Upper bound definition
  123. Proof that the minimal polynomial is irreducible proof
  124. Simple extension definition
  125. R[x] is an integral domain iff R is statement
  126. Splitting field definition
  127. A ring homomorphism is injective iff its kernel is zero statement
  128. Proof that in a UFD irreducible elements are prime proof
  129. Proof that Euclidean domains are principal ideal domains proof
  130. Bijective function definition
  131. The minimal polynomial divides every polynomial vanishing at the element statement
  132. Chain definition
  133. The minimal polynomial is irreducible statement
  134. Proof that K[x] is a Euclidean domain proof
  135. In a UFD irreducible elements are prime statement
  136. Proof of the first isomorphism theorem for rings proof
  137. Proof of the correspondence theorem for rings proof
  138. Equinumerous sets definition
  139. Euclidean domains are principal ideal domains statement
  140. Zorn's lemma statement
  141. K[x] is a Euclidean domain statement
  142. Cardinality definition
  143. First isomorphism theorem for rings statement
  144. Correspondence theorem for rings statement
  145. Proof that every vector space has a basis, by Zorn's lemma proof
  146. R/M is a field iff M is maximal statement
  147. Proof that K[x]/(f) is a field iff f is irreducible proof
  148. Every vector space has a basis statement
  149. Proof that maximal ideals are prime proof
  150. K[x]/(f) is a field iff f is irreducible statement
  151. Maximal ideals are prime statement
  152. Proof of the tower law proof
  153. Tower law statement
  154. Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial proof
  155. Proof that every principal ideal domain is a unique factorisation domain proof
  156. K(a) is isomorphic to K[x] modulo the minimal polynomial statement
  157. PID implies UFD statement
  158. Proof that the degree of a simple extension is the degree of the minimal polynomial proof
  159. Degree of a simple extension is the degree of the minimal polynomial statement
  160. Proof of the uniqueness of splitting fields proof

Where this leads

9 pages build on this one.

Further reading

  1. Web https://www.jmilne.org/math/CourseNotes/FT.pdf, Proposition 2.12 and Corollary 2.13
About this page