Math 2.0

Field theory and polynomials Proof

Proof of the uniqueness of the algebraic closure

Builds on FieldAlgebraic closureAlgebraic extensionAlgebraic elementAlgebraically closed fieldSubfieldField generated by adjoining elementsRing homomorphismMinimal polynomial of an algebraic elementThe minimal polynomial is irreducibleRoot of a polynomialUniversal property of the polynomial ringKernel of a ring homomorphismK[x] is a Euclidean domainEuclidean domains are principal ideal domainsIn a PID a nonzero element is irreducible iff it generates a maximal idealMaximal idealFirst isomorphism theorem for ringsK(a) is isomorphic to K[x] modulo the minimal polynomialPartial orderChainUpper boundZorn's lemmaMaximal elementProof by contradictionRing homomorphisms from a field are injectiveFactor theoremMathematical induction

Proof

Let LL and L′L' be algebraic closures of the field KK. First we extend embeddings by one element.

  1. Let EE be a subfield of LL containing KK, and φ ⁣:E→L′\varphi \colon E \to L' a ring homomorphism with φ(c)=c\varphi(c) = c for c∈Kc \in K. Let α∈L\alpha \in L.
  2. Since L/KL/K is algebraic, some nonzero g∈K[x]g \in K[x] has g(α)=0g(\alpha) = 0. As K⊆EK \subseteq E, α\alpha is algebraic over EE.
  3. Let mm be the minimal polynomial of α\alpha over EE. It is irreducible in E[x]E[x], so deg⁡m≥1\deg m \ge 1.
  4. Let φm∈L′[x]\varphi m \in L'[x] be the polynomial obtained by applying φ\varphi to the coefficients of mm. It is monic of degree deg⁡m≥1\deg m \ge 1.
  5. Since L′L' is algebraically closed, φm\varphi m has a root β∈L′\beta \in L'.
  6. By the universal property of the polynomial ring, ψ ⁣:E[x]→L′\psi \colon E[x] \to L', h↦(φh)(β)h \mapsto (\varphi h)(\beta), is a ring homomorphism. Its kernel contains mm, so it contains (m)(m).
  7. The kernel is not E[x]E[x], since ψ(1)=1\psi(1) = 1. The ring E[x]E[x] is a Euclidean domain, hence a PID.
  8. Since mm is irreducible, (m)(m) is a maximal ideal by the theorem on principal ideal domains. So the kernel of ψ\psi equals (m)(m).
  9. By the first isomorphism theorem, h+(m)↦(φh)(β)h + (m) \mapsto (\varphi h)(\beta) is an injective ring homomorphism E[x]/(m)→L′E[x]/(m) \to L'.
  10. By the structure of simple extensions, h(α)↦h+(m)h(\alpha) \mapsto h + (m) is a ring isomorphism E(α)→E[x]/(m)E(\alpha) \to E[x]/(m), where E(α)E(\alpha) is the generated field.
  11. Composing, φ′ ⁣:E(α)→L′\varphi' \colon E(\alpha) \to L', h(α)↦(φh)(β)h(\alpha) \mapsto (\varphi h)(\beta), is a ring homomorphism. On constants h=c∈Eh = c \in E it gives φ(c)\varphi(c), so φ′\varphi' extends φ\varphi.

Now we apply Zorn's lemma.

  1. Let PP be the set of pairs (E,φ)(E, \varphi) as in Step 1. Write (E1,φ1)≤(E2,φ2)(E_1, \varphi_1) \le (E_2, \varphi_2) when E1⊆E2E_1 \subseteq E_2 and φ2\varphi_2 restricts to φ1\varphi_1 on E1E_1.
  2. This relation is reflexive, antisymmetric and transitive, so PP is a partially ordered set. It is nonempty, since it contains KK with its inclusion map into L′L'.
  3. Let CC be a chain in PP. If CC is empty, then KK with its inclusion map is an upper bound. Assume CC is nonempty, and let UU be the union of the fields EE with (E,φ)∈C(E, \varphi) \in C.
  4. Any two elements of UU lie in a common EE from CC, since CC is a chain. So UU is a subfield of LL containing KK.
  5. For u∈Uu \in U, set φU(u)=φ(u)\varphi_U(u) = \varphi(u) for any (E,φ)∈C(E, \varphi) \in C with u∈Eu \in E. Two such pairs are comparable, so φU(u)\varphi_U(u) does not depend on the pair.
  6. Any two elements of UU lie in one EE from CC, so φU\varphi_U preserves sums and products. So (U,φU)∈P(U, \varphi_U) \in P, and it is an upper bound of CC.
  7. By Zorn's lemma, PP has a maximal element (E,σ)(E, \sigma).
  8. Suppose E≠LE \ne L, for contradiction, and pick α∈L∖E\alpha \in L \setminus E. Steps 1 to 11 give (E(α),σ′)∈P(E(\alpha), \sigma') \in P above (E,σ)(E, \sigma) and different from it. This contradicts maximality, so E=LE = L.

Finally we show that σ ⁣:L→L′\sigma \colon L \to L' is an isomorphism.

  1. The map σ\sigma is injective, so it is a ring isomorphism from LL onto the subfield σ(L)\sigma(L) of L′L'. Also σ(c)=c\sigma(c) = c for every c∈Kc \in K.
  2. The field σ(L)\sigma(L) is algebraically closed. Indeed, let g∈σ(L)[x]g \in \sigma(L)[x] with deg⁡g≥1\deg g \ge 1. Applying σ−1\sigma^{-1} to its coefficients gives g0∈L[x]g_0 \in L[x] of the same degree.
  3. Then g0g_0 has a root r∈Lr \in L, and applying σ\sigma to g0(r)=0g_0(r) = 0 gives g(σ(r))=0g(\sigma(r)) = 0.
  4. Every nonzero q∈σ(L)[x]q \in \sigma(L)[x] is a product of a constant and factors x−cjx - c_j with cj∈σ(L)c_j \in \sigma(L). This follows by induction on deg⁡q\deg q from Steps 21 and 22 and the factor theorem.
  5. Let b∈L′b \in L'. Since L′/KL'/K is algebraic, bb has a minimal polynomial mb∈K[x]m_b \in K[x], and K⊆σ(L)K \subseteq \sigma(L).
  6. By Step 23, mb=∏j(x−cj)m_b = \prod_j (x - c_j) with cj∈σ(L)c_j \in \sigma(L), since mbm_b is monic. Evaluating at bb in the field L′L' gives ∏j(b−cj)=0\prod_j (b - c_j) = 0.
  7. So b=cjb = c_j for some jj, and b∈σ(L)b \in \sigma(L). Thus σ\sigma is surjective, and σ ⁣:L→L′\sigma \colon L \to L' is a ring isomorphism fixing KK.

Idea

An embedding of a subfield of LL into L′L' over KK extends to one more element, by sending it to a root of the image of its minimal polynomial. Zorn's lemma gives an embedding of all of LL. Its image is algebraically closed, and every element of L′L' is a root of a polynomial that splits over the image, so the embedding is onto.

Reading path

To understand this page from the ground up, read these 145 pages in order. The foundations come first. The path takes the proofs Proof of cancellation in an integral domain, Proof that ring homomorphisms from a field are injective, Proof of the commutativity of addition by induction, Proof of the universal property of the polynomial ring, Proof that R[x] is an integral domain iff R is, Proof of the double negation law by a truth table, 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 of the remainder theorem, 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 in a PID a nonzero element is irreducible iff it generates a maximal ideal, Proof of the factor theorem, 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. Mathematical induction concept
  5. Natural numbers object
  6. Peano axioms concept
  7. Proof of Zorn's lemma proof
  8. Proposition concept
  9. Set definition
  10. Ring definition
  11. Successor function definition
  12. Conjunction definition
  13. Disjunction definition
  14. Implication definition
  15. Negation definition
  16. Predicate definition
  17. Family of sets definition
  18. Ordered pair definition
  19. Commutative ring definition
  20. Polynomial ring definition
  21. Ring homomorphism definition
  22. Subring definition
  23. Unit of a ring definition
  24. Zero divisor definition
  25. Ideal definition
  26. Union definition
  27. Addition of natural numbers definition
  28. The successor function is injective statement
  29. Zero is not a successor statement
  30. Biconditional definition
  31. Truth table concept
  32. Modus ponens concept
  33. Existential quantifier definition
  34. Universal quantifier definition
  35. Cartesian product definition
  36. Divisibility in a commutative ring definition
  37. Degree of a polynomial definition
  38. Polynomial evaluation definition
  39. Proof of the universal property of the polynomial ring proof
  40. Field definition
  41. Kernel of a ring homomorphism definition
  42. Ring isomorphism definition
  43. Integral domain definition
  44. Ideal generated by a subset definition
  45. Proof of the commutativity of addition by induction proof
  46. Subset definition
  47. Propositional logic concept
  48. Order on the natural numbers definition
  49. Maximal ideal definition
  50. Two-sided ideal definition
  51. Union of a family of sets definition
  52. Mathematical proof concept
  53. Uniqueness quantifier definition
  54. Leading coefficient definition
  55. Root of a polynomial definition
  56. Evaluation homomorphism definition
  57. Proof of cancellation in an integral domain proof
  58. Subfield definition
  59. Binary relation definition
  60. Proof that the only ideals of a field are zero and the whole field proof
  61. Irreducible element definition
  62. Commutativity of addition statement
  63. Euclidean domain definition
  64. Quotient ring definition
  65. Proof of strong induction from ordinary induction proof
  66. Principal ideal definition
  67. Tautology definition
  68. Monic polynomial definition
  69. Split polynomial definition
  70. Proof of the remainder theorem proof
  71. Proof of the degree of a product over an integral domain proof
  72. Universal property of the polynomial ring statement
  73. Field extension definition
  74. Antisymmetric relation definition
  75. Irreducible polynomial definition
  76. Reflexive relation definition
  77. Transitive relation definition
  78. Cancellation in an integral domain statement
  79. The only ideals of a field are zero and the whole field statement
  80. Proof of the universal property of the quotient ring proof
  81. Proof that R/M is a field iff M is maximal proof
  82. Strong induction statement
  83. Principal ideal domain definition
  84. Function definition
  85. Logical equivalence definition
  86. Division algorithm for polynomials statement
  87. Algebraic element definition
  88. Degree of a product statement
  89. Algebraically closed field definition
  90. Intermediate field definition
  91. Universal property of the quotient ring statement
  92. Proof of the well-ordering principle from strong induction proof
  93. Preorder definition
  94. Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
  95. Proof of the double negation law by a truth table proof
  96. Image of a set definition
  97. Preimage of a set definition
  98. Choice function definition
  99. Codomain definition
  100. Injective function definition
  101. Minimal polynomial of an algebraic element definition
  102. Remainder theorem statement
  103. Algebraic extension definition
  104. Proof that R[x] is an integral domain iff R is proof
  105. Field generated by adjoining elements definition
  106. Partial order definition
  107. Well-ordering principle statement
  108. Proof that a ring homomorphism is injective iff its kernel is zero proof
  109. Double negation law statement
  110. In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
  111. Axiom of choice statement
  112. Surjective function definition
  113. Proof that the minimal polynomial divides every polynomial vanishing at the element proof
  114. Proof of the factor theorem proof
  115. Algebraic closure definition
  116. Proof that the minimal polynomial is irreducible proof
  117. R[x] is an integral domain iff R is statement
  118. Simple extension definition
  119. Maximal element definition
  120. Total order definition
  121. Upper bound definition
  122. A ring homomorphism is injective iff its kernel is zero statement
  123. Proof that Euclidean domains are principal ideal domains proof
  124. Proof by contradiction concept
  125. Bijective function definition
  126. The minimal polynomial divides every polynomial vanishing at the element statement
  127. Factor theorem statement
  128. The minimal polynomial is irreducible statement
  129. Proof that K[x] is a Euclidean domain proof
  130. Proof that ring homomorphisms from a field are injective proof
  131. Chain definition
  132. Proof of the first isomorphism theorem for rings proof
  133. Proof of the correspondence theorem for rings proof
  134. Euclidean domains are principal ideal domains statement
  135. K[x] is a Euclidean domain statement
  136. Ring homomorphisms from a field are injective statement
  137. First isomorphism theorem for rings statement
  138. Zorn's lemma statement
  139. Correspondence theorem for rings statement
  140. R/M is a field iff M is maximal statement
  141. Proof that K[x]/(f) is a field iff f is irreducible proof
  142. K[x]/(f) is a field iff f is irreducible statement
  143. Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial proof
  144. K(a) is isomorphic to K[x] modulo the minimal polynomial statement
  145. Proof of the uniqueness of the algebraic closure proof

Where this leads

4 pages build on this one.

Further reading

  1. Web https://www.jmilne.org/math/CourseNotes/FT.pdf, Theorem 6.6
About this page