Math 2.0

Field theory and polynomials Proof

Proof that the Galois group of a finite Galois extension has order equal to the degree

Builds on Galois extensionNormal extensionSeparable extensionSeparable polynomialMinimal polynomial of an algebraic elementThe minimal polynomial is irreducibleThe minimal polynomial divides every polynomial vanishing at the elementDegree of a simple extension is the degree of the minimal polynomialMultiplicity of a rootRepeated roots and the derivativeA polynomial over a field has at most as many roots as its degreeK(a) is isomorphic to K[x] modulo the minimal polynomialRing homomorphismRing homomorphisms from a field are injectiveField generated by adjoining elementsTower lawAn injective endomorphism of a finite-dimensional space is surjectiveGalois group

Proof

We count the homomorphisms L→LL \to L that fix KK, adjoining one generator at a time. Homomorphisms are ring homomorphisms that send 11 to 11.

  1. Let L/KL/K be a finite Galois extension, so L/KL/K is normal and separable. Let n=[L:K]n = [L : K].

Lemma. Let K⊆E⊆LK \subseteq E \subseteq L be a field, let a∈La \in L and E′=E(a)E' = E(a). Let ρ ⁣:E→L\rho \colon E \to L be a homomorphism with ρ(c)=c\rho(c) = c for c∈Kc \in K. Then exactly [E′:E][E' : E] homomorphisms τ ⁣:E′→L\tau \colon E' \to L restrict to ρ\rho on EE.

  1. Let ff be the minimal polynomial of aa over KK, of degree NN. Let mm be the minimal polynomial of aa over EE, of degree dd. Then d=[E′:E]d = [E' : E] by the degree of a simple extension.
  2. Since f∈E[x]f \in E[x] and f(a)=0f(a) = 0, the polynomial mm divides ff. Write f=mhf = m h with h∈E[x]h \in E[x] of degree N−dN - d.
  3. The polynomial ff is irreducible over KK and has the root aa in LL. As L/KL/K is normal, f=(x−b1)⋯(x−bN)f = (x - b_1) \cdots (x - b_N) with b1,…,bN∈Lb_1, \dots, b_N \in L.
  4. As aa is separable over KK, ff is a separable polynomial: uf+vf′=1u f + v f' = 1 for some u,v∈K[x]u, v \in K[x].
  5. Suppose bi=bj=bb_i = b_j = b for some i≠ji \neq j. Then (x−b)2(x - b)^2 divides ff, so bb has multiplicity at least 22. So f(b)=f′(b)=0f(b) = f'(b) = 0, and evaluating step 5 at bb gives 1=01 = 0. So b1,…,bNb_1, \dots, b_N are distinct.
  6. For g∈E[x]g \in E[x], let gρ∈L[x]g^\rho \in L[x] be obtained by applying ρ\rho to the coefficients. The map g↦gρg \mapsto g^\rho respects sums and products. Since ρ\rho is injective, it preserves degrees.
  7. Since ρ\rho fixes the coefficients of ff, step 3 gives f=mρhρf = m^\rho h^\rho in L[x]L[x], with deg⁡mρ=d\deg m^\rho = d and deg⁡hρ=N−d\deg h^\rho = N - d.
  8. Each bib_i is a root of mρm^\rho or of hρh^\rho, since LL is a field. The polynomial hρh^\rho has at most N−dN - d roots in LL.
  9. So at least dd of the distinct bib_i are roots of mρm^\rho. As mρm^\rho has at most dd roots, it has exactly dd roots in LL.
  10. Let τ\tau extend ρ\rho. Applying τ\tau to m(a)=0m(a) = 0 gives mρ(τ(a))=0m^\rho(\tau(a)) = 0. So τ(a)\tau(a) is one of the dd roots of mρm^\rho.
  11. By the structure of simple extensions, every element of E′E' is g(a)g(a) for some g∈E[x]g \in E[x]. Then τ(g(a))=gρ(τ(a))\tau(g(a)) = g^\rho(\tau(a)), so τ\tau is determined by τ(a)\tau(a).
  12. Let bb be a root of mρm^\rho in LL. Define τ(g(a))=gρ(b)\tau(g(a)) = g^\rho(b) for g∈E[x]g \in E[x]. If g(a)=g1(a)g(a) = g_1(a), then mm divides g−g1g - g_1, so mρm^\rho divides gρ−g1ρg^\rho - g_1^\rho, and gρ(b)=g1ρ(b)g^\rho(b) = g_1^\rho(b).
  13. So τ\tau is well defined. It respects sums and products by step 7, it extends ρ\rho, and τ(a)=b\tau(a) = b.
  14. By steps 10 to 14, the extensions τ\tau correspond to the dd roots of mρm^\rho. So there are exactly d=[E′:E]d = [E' : E] of them. This proves the lemma.

Now we count.

  1. Let a1,…,asa_1, \dots, a_s be a basis of LL over KK. Then L=K(a1,…,as)L = K(a_1, \dots, a_s). Let E0=KE_0 = K and Ej=Ej−1(aj)E_j = E_{j-1}(a_j), so Ej=K(a1,…,aj)E_j = K(a_1, \dots, a_j) and Es=LE_s = L.
  2. Claim: exactly [Ej:K][E_j : K] homomorphisms Ej→LE_j \to L fix KK. For j=0j = 0, the only one is the inclusion of KK.
  3. Let j≥1j \ge 1. Each such homomorphism on EjE_j restricts to one on Ej−1E_{j-1}. By the claim for j−1j - 1 there are [Ej−1:K][E_{j-1} : K] restrictions, and each has exactly [Ej:Ej−1][E_j : E_{j-1}] extensions by the lemma.
  4. So there are [Ej:Ej−1]⋅[Ej−1:K]=[Ej:K][E_j : E_{j-1}] \cdot [E_{j-1} : K] = [E_j : K] of them, by the tower law. With j=sj = s, exactly nn homomorphisms σ ⁣:L→L\sigma \colon L \to L fix KK.
  5. Each such σ\sigma is injective, and it is KK-linear because σ(cy)=cσ(y)\sigma(c y) = c \sigma(y) for c∈Kc \in K. As LL has finite dimension nn over KK, σ\sigma is surjective.
  6. So these nn maps are exactly the automorphisms of LL that fix KK, that is, the elements of the Galois group. Hence ∣Gal⁡(L/K)∣=[L:K]\abs{\operatorname{Gal}(L/K)} = [L : K].

Idea

An automorphism is built by choosing the image of one generator at a time. At each stage the image must be a root of a minimal polynomial. Normality puts all these roots in LL, and separability makes them distinct, so the number of choices is exactly the degree of that stage. The tower law multiplies these counts into [L:K][L : K].

Reading path

To understand this page from the ground up, read these 193 pages in order. The foundations come first. The path takes the proofs Proof of the Steinitz exchange lemma by induction, Proof of cancellation in an integral domain, Proof that a subspace of full dimension is the whole space, 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 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 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 an injective endomorphism of a finite-dimensional space is surjective, Proof that the only ideals of a field are zero and the whole field, Proof that a polynomial over a field has at most as many roots as its degree, Proof of the remainder theorem, Proof that a linear map is injective iff its kernel is trivial, Proof that every linearly independent set extends to a basis, by Zorn's lemma, 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 n independent or n spanning vectors in an n-dimensional space form a basis, 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 of the derivative test for repeated roots, Proof that a subspace of a finite-dimensional space has smaller or equal dimension, Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal, Proof of the factor theorem, Proof of the rank–nullity theorem by extending a basis of the kernel, 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. Basis concept
  2. Definition by recursion concept
  3. Dimension concept
  4. Element definition
  5. Group concept
  6. Image of a linear map concept
  7. Kernel of a linear map concept
  8. Linear combination concept
  9. Linear independence concept
  10. Linear map concept
  11. Linear subspace concept
  12. Mathematical induction concept
  13. Natural numbers object
  14. Nullity concept
  15. Peano axioms concept
  16. Proof of Zorn's lemma proof
  17. Proposition concept
  18. Rank of a linear map concept
  19. Spanning set concept
  20. Vector space definition
  21. Set definition
  22. Ring definition
  23. Proof that a linear map is injective iff its kernel is trivial proof
  24. Successor function definition
  25. Disjunction definition
  26. Implication definition
  27. Predicate definition
  28. Linear combination definition
  29. Linear map definition
  30. Linear subspace definition
  31. Family of sets definition
  32. Ordered pair definition
  33. Commutative ring definition
  34. Polynomial ring definition
  35. Ring homomorphism definition
  36. Subring definition
  37. Unit of a ring definition
  38. Zero divisor definition
  39. Union definition
  40. Ideal definition
  41. Addition of natural numbers definition
  42. Existential quantifier definition
  43. Universal quantifier definition
  44. Linear independence definition
  45. Image of a linear map definition
  46. Kernel of a linear map definition
  47. Linear span definition
  48. The successor function is injective statement
  49. Zero is not a successor statement
  50. Cartesian product definition
  51. Divisibility in a commutative ring definition
  52. Degree of a polynomial definition
  53. Formal derivative definition
  54. Polynomial evaluation definition
  55. Proof of the universal property of the polynomial ring proof
  56. Field definition
  57. Kernel of a ring homomorphism definition
  58. Ring isomorphism definition
  59. Integral domain definition
  60. Subset definition
  61. Ideal generated by a subset definition
  62. Union of a family of sets definition
  63. Proof of the commutativity of addition by induction proof
  64. A linear map is injective iff its kernel is trivial statement
  65. Maximal ideal definition
  66. Two-sided ideal definition
  67. Order on the natural numbers definition
  68. Uniqueness quantifier definition
  69. Spanning set definition
  70. Leading coefficient definition
  71. Separable polynomial definition
  72. Evaluation homomorphism definition
  73. Proof of cancellation in an integral domain proof
  74. Root of a polynomial definition
  75. Binary relation definition
  76. Subfield definition
  77. Irreducible element definition
  78. Proof that the only ideals of a field are zero and the whole field proof
  79. Quotient ring definition
  80. Euclidean domain definition
  81. Principal ideal definition
  82. Commutativity of addition statement
  83. Proof of strong induction from ordinary induction proof
  84. Proof of the Steinitz exchange lemma by induction proof
  85. Basis definition
  86. Finite-dimensional vector space definition
  87. Monic polynomial definition
  88. Proof of the remainder theorem proof
  89. Multiplicity of a root definition
  90. Proof of the degree of a product over an integral domain proof
  91. Split polynomial definition
  92. Universal property of the polynomial ring statement
  93. Antisymmetric relation definition
  94. Irreducible polynomial definition
  95. Reflexive relation definition
  96. Transitive relation definition
  97. Cancellation in an integral domain statement
  98. Field extension definition
  99. Proof of the universal property of the quotient ring proof
  100. The only ideals of a field are zero and the whole field statement
  101. Proof that R/M is a field iff M is maximal proof
  102. Principal ideal domain definition
  103. Function definition
  104. Strong induction statement
  105. Dimension theorem for vector spaces statement
  106. Steinitz exchange lemma statement
  107. Dimension definition
  108. Division algorithm for polynomials statement
  109. Degree of a product statement
  110. Algebraic element definition
  111. Galois group definition
  112. Universal property of the quotient ring statement
  113. Intermediate field definition
  114. Preorder definition
  115. Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
  116. Degree of a field extension definition
  117. Proof of the well-ordering principle from strong induction proof
  118. Image of a set definition
  119. Preimage of a set definition
  120. Choice function definition
  121. Proof that n independent or n spanning vectors in an n-dimensional space form a basis proof
  122. Codomain definition
  123. Injective function definition
  124. Proof that a subspace of a finite-dimensional space has smaller or equal dimension proof
  125. Rank of a linear map definition
  126. Nullity definition
  127. Minimal polynomial of an algebraic element definition
  128. Remainder theorem statement
  129. Proof that R[x] is an integral domain iff R is proof
  130. Partial order definition
  131. Algebraic extension definition
  132. Field generated by adjoining elements definition
  133. Proof that a ring homomorphism is injective iff its kernel is zero proof
  134. In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
  135. Well-ordering principle statement
  136. Axiom of choice statement
  137. Dimension of a subspace statement
  138. Surjective function definition
  139. Linearly independent set of the right size is a basis statement
  140. Separable extension definition
  141. Proof of the factor theorem proof
  142. Proof that the minimal polynomial divides every polynomial vanishing at the element proof
  143. Maximal element definition
  144. Total order definition
  145. Upper bound definition
  146. R[x] is an integral domain iff R is statement
  147. Proof that the minimal polynomial is irreducible proof
  148. Normal extension definition
  149. Simple extension definition
  150. A ring homomorphism is injective iff its kernel is zero statement
  151. Proof that Euclidean domains are principal ideal domains proof
  152. Bijective function definition
  153. Proof that a subspace of full dimension is the whole space proof
  154. The minimal polynomial divides every polynomial vanishing at the element statement
  155. Factor theorem statement
  156. Chain definition
  157. Galois extension definition
  158. Proof that K[x] is a Euclidean domain proof
  159. The minimal polynomial is irreducible statement
  160. Proof that ring homomorphisms from a field are injective proof
  161. Proof of the first isomorphism theorem for rings proof
  162. Proof of the correspondence theorem for rings proof
  163. Equinumerous sets definition
  164. Euclidean domains are principal ideal domains statement
  165. A subspace of full dimension is the whole space statement
  166. Proof of the derivative test for repeated roots proof
  167. Proof that a polynomial over a field has at most as many roots as its degree proof
  168. K[x] is a Euclidean domain statement
  169. Ring homomorphisms from a field are injective statement
  170. Zorn's lemma statement
  171. First isomorphism theorem for rings statement
  172. Correspondence theorem for rings statement
  173. Cardinality definition
  174. A polynomial over a field has at most as many roots as its degree statement
  175. Repeated roots and the derivative statement
  176. Proof that every linearly independent set extends to a basis, by Zorn's lemma proof
  177. Proof that every vector space has a basis, by Zorn's lemma proof
  178. R/M is a field iff M is maximal statement
  179. Proof that K[x]/(f) is a field iff f is irreducible proof
  180. Every vector space has a basis statement
  181. Every linearly independent set extends to a basis statement
  182. K[x]/(f) is a field iff f is irreducible statement
  183. Proof of the rank–nullity theorem by extending a basis of the kernel proof
  184. Proof of the tower law proof
  185. Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial proof
  186. Tower law statement
  187. Rank–nullity theorem statement
  188. K(a) is isomorphic to K[x] modulo the minimal polynomial statement
  189. Proof that an injective endomorphism of a finite-dimensional space is surjective proof
  190. An injective endomorphism of a finite-dimensional space is surjective statement
  191. Proof that the degree of a simple extension is the degree of the minimal polynomial proof
  192. Degree of a simple extension is the degree of the minimal polynomial statement
  193. Proof that the Galois group of a finite Galois extension has order equal to the degree proof

Where this leads

6 pages build on this one.

Further reading

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