Math 2.0

Field theory and polynomials Proof

Proof that the automorphism group of a finite extension has order at most the degree

Builds on Finite extensionGalois groupRing homomorphismFinite extensions are algebraicMinimal polynomial of an algebraic elementDegree of a simple extension is the degree of the minimal polynomialK(a) is isomorphic to K[x] modulo the minimal polynomialA polynomial over a field has at most as many roots as its degreeTower law

Proof

We first prove a lemma by induction on the degree. All fields are commutative, and homomorphisms are ring homomorphisms that send 11 to 11.

Lemma. Let E/FE/F be a finite extension, let MM be a field and let ρ ⁣:F→M\rho \colon F \to M be a homomorphism. Then at most [E:F][E : F] homomorphisms τ ⁣:E→M\tau \colon E \to M satisfy τ(c)=ρ(c)\tau(c) = \rho(c) for all c∈Fc \in F.

  1. Let d=[E:F]d = [E : F]. If d=1d = 1, then E=FE = F, and the only such τ\tau is ρ\rho.
  2. Let d>1d > 1, and assume the lemma for all finite extensions of degree less than dd. Choose a∈Ea \in E with a∉Fa \notin F.
  3. The extension E/FE/F is finite, so aa is algebraic over FF. Let g=∑kgkxkg = \sum_k g_k x^k be its minimal polynomial, of degree rr. Then [F(a):F]=r[F(a) : F] = r by the degree of a simple extension.
  4. Since a∉Fa \notin F, we have F(a)≠FF(a) \neq F, so r≥2r \ge 2. By the tower law, [E:F(a)]=d/r<d[E : F(a)] = d/r < d.
  5. Let gρ=∑kρ(gk)xk∈M[x]g^\rho = \sum_k \rho(g_k) x^k \in M[x]. It has degree rr, because ρ(1)=1\rho(1) = 1 and a homomorphism of fields is injective.
  6. Let τ\tau extend ρ\rho. Applying τ\tau to g(a)=0g(a) = 0 gives gρ(τ(a))=0g^\rho(\tau(a)) = 0. So τ(a)\tau(a) is one of the at most rr roots of gρg^\rho in MM.
  7. By the structure of simple extensions, every element of F(a)F(a) is h(a)h(a) for some h∈F[x]h \in F[x]. Then τ(h(a))=hρ(τ(a))\tau(h(a)) = h^\rho(\tau(a)).
  8. So the restriction of τ\tau to F(a)F(a) is determined by τ(a)\tau(a). Hence there are at most rr possible restrictions σ ⁣:F(a)→M\sigma \colon F(a) \to M.
  9. For each such σ\sigma, the induction hypothesis for E/F(a)E/F(a) and σ\sigma gives at most [E:F(a)][E : F(a)] homomorphisms τ\tau that extend σ\sigma.
  10. Every τ\tau extending ρ\rho extends its own restriction σ\sigma. So there are at most r⋅[E:F(a)]=[E:F]r \cdot [E : F(a)] = [E : F] such τ\tau, by the tower law. This proves the lemma.

Now let L/KL/K be a finite extension.

  1. Every element σ\sigma of Aut⁡(L/K)\operatorname{Aut}(L/K) is a homomorphism L→LL \to L with σ(c)=c\sigma(c) = c for c∈Kc \in K.
  2. Apply the lemma with E=LE = L, F=KF = K, M=LM = L and ρ\rho the inclusion K→LK \to L. It gives at most [L:K][L : K] such homomorphisms.
  3. So Aut⁡(L/K)\operatorname{Aut}(L/K) is finite, and ∣Aut⁡(L/K)∣≤[L:K]\abs{\operatorname{Aut}(L/K)} \le [L : K].

Idea

An automorphism fixing KK must send each generator to a root of its minimal polynomial, and such a polynomial has few roots. Adjoining one element at a time, the number of choices at each stage is at most the degree of that stage. The tower law multiplies these bounds into [L:K][L : K].

Reading path

To understand this page from the ground up, read these 158 pages in order. The foundations come first. The path takes the proofs Proof of cancellation in an integral domain, 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 finite extensions are algebraic, 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 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 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 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 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. Union of a family of sets definition
  50. Order on the natural numbers definition
  51. Maximal ideal definition
  52. Two-sided ideal definition
  53. Uniqueness quantifier definition
  54. Spanning set definition
  55. Leading coefficient definition
  56. Root of a polynomial definition
  57. Evaluation homomorphism definition
  58. Proof of cancellation in an integral domain proof
  59. Binary relation definition
  60. Subfield definition
  61. Irreducible element definition
  62. Proof that the only ideals of a field are zero and the whole field proof
  63. Commutativity of addition statement
  64. Euclidean domain definition
  65. Quotient ring definition
  66. Proof of strong induction from ordinary induction proof
  67. Principal ideal definition
  68. Basis definition
  69. Finite-dimensional vector space definition
  70. Monic polynomial definition
  71. Multiplicity of a root definition
  72. Proof of the remainder theorem proof
  73. Proof of the degree of a product over an integral domain proof
  74. Universal property of the polynomial ring statement
  75. Antisymmetric relation definition
  76. Reflexive relation definition
  77. Transitive relation definition
  78. Irreducible polynomial definition
  79. Field extension definition
  80. Cancellation in an integral domain statement
  81. The only ideals of a field are zero and the whole field statement
  82. Proof of the universal property of the quotient ring proof
  83. Proof that R/M is a field iff M is maximal proof
  84. Strong induction statement
  85. Function definition
  86. Principal ideal domain definition
  87. Dimension theorem for vector spaces statement
  88. Dimension definition
  89. Division algorithm for polynomials statement
  90. Degree of a product statement
  91. Algebraic element definition
  92. Galois group definition
  93. Preorder definition
  94. Intermediate field definition
  95. Universal property of the quotient ring statement
  96. Proof of the well-ordering principle from strong induction proof
  97. Degree of a field extension definition
  98. Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
  99. Image of a set definition
  100. Preimage of a set definition
  101. Choice function definition
  102. Codomain definition
  103. Injective function definition
  104. Minimal polynomial of an algebraic element definition
  105. Remainder theorem statement
  106. Proof that R[x] is an integral domain iff R is proof
  107. Partial order definition
  108. Algebraic extension definition
  109. Field generated by adjoining elements definition
  110. Finite extension definition
  111. Proof that a ring homomorphism is injective iff its kernel is zero proof
  112. Well-ordering principle statement
  113. In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
  114. Axiom of choice statement
  115. Surjective function definition
  116. Proof of the factor theorem proof
  117. Proof that the minimal polynomial divides every polynomial vanishing at the element proof
  118. Maximal element definition
  119. Total order definition
  120. Upper bound definition
  121. R[x] is an integral domain iff R is statement
  122. Proof that the minimal polynomial is irreducible proof
  123. Simple extension definition
  124. A ring homomorphism is injective iff its kernel is zero statement
  125. Proof that Euclidean domains are principal ideal domains proof
  126. Bijective function definition
  127. The minimal polynomial divides every polynomial vanishing at the element statement
  128. Factor theorem statement
  129. Chain definition
  130. Proof that K[x] is a Euclidean domain proof
  131. The minimal polynomial is irreducible statement
  132. Proof of the first isomorphism theorem for rings proof
  133. Proof of the correspondence theorem for rings proof
  134. Equinumerous sets definition
  135. Euclidean domains are principal ideal domains statement
  136. Proof that a polynomial over a field has at most as many roots as its degree proof
  137. K[x] is a Euclidean domain statement
  138. Zorn's lemma statement
  139. First isomorphism theorem for rings statement
  140. Cardinality definition
  141. Correspondence theorem for rings statement
  142. A polynomial over a field has at most as many roots as its degree statement
  143. Proof that every linearly independent set extends to a basis, by Zorn's lemma proof
  144. Proof that every vector space has a basis, by Zorn's lemma proof
  145. R/M is a field iff M is maximal statement
  146. Proof that K[x]/(f) is a field iff f is irreducible proof
  147. Every vector space has a basis statement
  148. Every linearly independent set extends to a basis statement
  149. K[x]/(f) is a field iff f is irreducible statement
  150. Proof of the tower law proof
  151. Proof that finite extensions are algebraic proof
  152. Finite extensions are algebraic statement
  153. Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial proof
  154. Tower law statement
  155. K(a) is isomorphic to K[x] modulo the minimal polynomial statement
  156. Proof that the degree of a simple extension is the degree of the minimal polynomial proof
  157. Degree of a simple extension is the degree of the minimal polynomial statement
  158. Proof that the automorphism group of a finite extension has order at most the degree proof

Where this leads

7 pages build on this one.

Further reading

  1. Web https://www.jmilne.org/math/CourseNotes/FT.pdf
About this page
Tag1ZRAHQX5RS
URIm2://1ZRAHQX5RS
Kindproof
WritingW0 stub
MSC12F10
ProvesThe Galois group has order at most the degree
UsesFinite extension, Galois group, Ring homomorphism, Finite extensions are algebraic, Minimal polynomial of an algebraic element, Degree of a simple extension is the degree of the minimal polynomial, K(a) is isomorphic to K[x] modulo the minimal polynomial, A polynomial over a field has at most as many roots as its degree, Tower law
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)
  • a source with a locator (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.