Math 2.0

Field theory and polynomials Proof

Proof of the fundamental theorem of Galois theory

Builds on Galois extensionGalois groupIntermediate fieldFixed fieldSubfieldArtin's theorem on fixed fieldsCharacterizations of Galois extensionsOrder of the Galois group of a Galois extension equals its degreeTower lawSplitting fieldSeparable polynomialField generated by adjoining elementsSubgroupNormal subgroupGroup homomorphismQuotient groupFirst isomorphism theoremNormal extensionMinimal polynomial of an algebraic elementThe minimal polynomial is irreducibleSplit polynomial

Proof

The main tool is Artin's theorem on fixed fields. We prove the four parts in order.

  1. Let L/KL/K be a finite Galois extension and G=Gal⁡(L/K)G = \operatorname{Gal}(L/K). By the order of the Galois group, GG is finite with ∣G∣=[L:K]|G| = [L : K].
  2. Let HH be a subgroup of GG. Its fixed field LHL^H is a subfield of LL. Each element of HH fixes KK, so K⊆LHK \subseteq L^H. Thus LHL^H is an intermediate field.
  3. By Artin's theorem applied to the finite group HH, we get [L:LH]=∣H∣[L : L^H] = |H| and Gal⁡(L/LH)=H\operatorname{Gal}(L/L^H) = H.
  4. Let EE be an intermediate field. By the characterizations of Galois extensions, LL is a splitting field over KK of a separable polynomial f∈K[x]f \in K[x].
  5. Write f=c(x−a1)⋯(x−an)f = c(x - a_1) \cdots (x - a_n) in L[x]L[x], with L=K(a1,…,an)L = K(a_1, \dots, a_n). Then L⊇E(a1,…,an)⊇K(a1,…,an)=LL \supseteq E(a_1, \dots, a_n) \supseteq K(a_1, \dots, a_n) = L, so L=E(a1,…,an)L = E(a_1, \dots, a_n).
  6. Also f∈E[x]f \in E[x] is separable over EE, because the identity uf+vf′=1u f + v f' = 1 with u,v∈K[x]u, v \in K[x] also holds in E[x]E[x]. So LL is a splitting field of a separable polynomial over EE.
  7. The extension L/EL/E is finite, since [L:K]=[L:E][E:K][L : K] = [L : E][E : K] by the tower law. By the characterizations again, L/EL/E is Galois.
  8. Every automorphism of LL fixing EE fixes KK. So Gal⁡(L/E)\operatorname{Gal}(L/E) is a subset of GG. It contains the identity and is closed under composition and inverses, so it is a subgroup of GG.
  9. Let H=Gal⁡(L/E)H = \operatorname{Gal}(L/E) and E′=LHE' = L^H. Every element of HH fixes EE, so E⊆E′E \subseteq E'.
  10. Since L/EL/E is Galois, ∣H∣=[L:E]|H| = [L : E] by step 1 applied to L/EL/E. By step 3, [L:E′]=∣H∣[L : E'] = |H|.
  11. By the tower law, [L:E]=[L:E′][E′:E][L : E] = [L : E'][E' : E]. Step 10 gives [E′:E]=1[E' : E] = 1. So E′E' is a 11-dimensional EE-space that contains EE, and E′=EE' = E.
  12. Steps 3 and 11 show that Gal⁡(L/LH)=H\operatorname{Gal}(L/L^H) = H and LGal⁡(L/E)=EL^{\operatorname{Gal}(L/E)} = E. So the two maps are inverse bijections. This proves part 1.
  13. For part 2, let H1⊆H2H_1 \subseteq H_2 be subgroups. An element fixed by all of H2H_2 is fixed by all of H1H_1. So LH1⊇LH2L^{H_1} \supseteq L^{H_2}.
  14. Conversely, suppose LH1⊇LH2L^{H_1} \supseteq L^{H_2}. An automorphism fixing LH1L^{H_1} fixes LH2L^{H_2}. So Gal⁡(L/LH1)⊆Gal⁡(L/LH2)\operatorname{Gal}(L/L^{H_1}) \subseteq \operatorname{Gal}(L/L^{H_2}), that is, H1⊆H2H_1 \subseteq H_2 by step 3. This proves part 2.
  15. For part 3, step 3 gives [L:LH]=∣H∣[L : L^H] = |H|. The tower law gives [L:K]=[L:LH][LH:K][L : K] = [L : L^H][L^H : K]. With step 1, [LH:K]=∣G∣/∣H∣[L^H : K] = |G| / |H|.
  16. For part 4, fix a subgroup HH and let E=LHE = L^H. Suppose first that E/KE/K is normal. Let σ∈G\sigma \in G and a∈Ea \in E.
  17. Let qq be the minimal polynomial of aa over KK. It is irreducible and has the root a∈Ea \in E. By normality, qq splits over EE as q=(x−e1)⋯(x−em)q = (x - e_1) \cdots (x - e_m) with ei∈Ee_i \in E.
  18. Since σ\sigma fixes the coefficients of qq, we get q(σ(a))=σ(q(a))=0q(\sigma(a)) = \sigma(q(a)) = 0. So ∏i(σ(a)−ei)=0\prod_i (\sigma(a) - e_i) = 0 in the field LL, and σ(a)=ei\sigma(a) = e_i for some ii. Hence σ(E)⊆E\sigma(E) \subseteq E for every σ∈G\sigma \in G.
  19. Let τ∈H\tau \in H, σ∈G\sigma \in G and a∈Ea \in E. By step 18 for σ−1\sigma^{-1}, σ−1(a)∈E\sigma^{-1}(a) \in E, so τ(σ−1(a))=σ−1(a)\tau(\sigma^{-1}(a)) = \sigma^{-1}(a). Thus στσ−1(a)=a\sigma \tau \sigma^{-1}(a) = a.
  20. So στσ−1\sigma \tau \sigma^{-1} fixes EE and lies in Gal⁡(L/E)=H\operatorname{Gal}(L/E) = H, by step 3. Hence HH is a normal subgroup of GG.
  21. Now suppose that HH is normal in GG. Let σ∈G\sigma \in G, a∈Ea \in E and τ∈H\tau \in H. Then σ−1τσ∈H\sigma^{-1} \tau \sigma \in H, so τ(σ(a))=σ(σ−1τσ(a))=σ(a)\tau(\sigma(a)) = \sigma(\sigma^{-1} \tau \sigma(a)) = \sigma(a).
  22. So σ(a)∈LH=E\sigma(a) \in L^H = E, that is, σ(E)⊆E\sigma(E) \subseteq E for every σ∈G\sigma \in G. Applying this to σ−1\sigma^{-1} gives E⊆σ(E)E \subseteq \sigma(E). So σ(E)=E\sigma(E) = E.
  23. Hence the restriction σ∣E\sigma|_E is an automorphism of EE fixing KK. The map r ⁣:G→Aut⁡(E)r \colon G \to \operatorname{Aut}(E), σ↦σ∣E\sigma \mapsto \sigma|_E, is a group homomorphism, since restriction respects composition.
  24. Its kernel is the set of σ∈G\sigma \in G that fix EE pointwise. This is Gal⁡(L/E)=H\operatorname{Gal}(L/E) = H, by step 3.
  25. The image r(G)r(G) is a finite group of automorphisms of EE. An element a∈Ea \in E fixed by all of r(G)r(G) lies in LGL^G. By step 12 with E=KE = K, LG=LGal⁡(L/K)=KL^G = L^{\operatorname{Gal}(L/K)} = K. So Er(G)=KE^{r(G)} = K.
  26. By Artin's theorem applied to EE and r(G)r(G), the extension E/KE/K is Galois, so it is normal. This proves that E/KE/K is normal if and only if HH is normal in GG.
  27. Artin's theorem also gives Gal⁡(E/K)=r(G)\operatorname{Gal}(E/K) = r(G). By the first isomorphism theorem and step 24, the quotient group G/HG/H is isomorphic to r(G)=Gal⁡(LH/K)r(G) = \operatorname{Gal}(L^H/K).
  28. In both directions of part 4, HH is normal, so steps 21 to 27 apply. This proves part 4 and the theorem.

Idea

Artin's theorem says that a finite group HH of automorphisms is exactly the group of symmetries of LL over its fixed field, and that [L:LH]=∣H∣[L : L^H] = |H|. This gives one round trip. For the other, LL stays Galois over every intermediate field, and a degree count shows that the fixed field of Gal⁡(L/E)\operatorname{Gal}(L/E) cannot be larger than EE. Normality matches because σ\sigma moves LHL^H to LσHσ−1L^{\sigma H \sigma^{-1}}, so LHL^H is stable under GG exactly when HH is.

Reading path

To understand this page from the ground up, read these 321 pages in order. The foundations come first. The path takes the proofs Proof of the Steinitz exchange lemma by induction, Proof of Bézout's identity, Proof that the automorphism group of a finite extension has order at most the degree, Proof that in a UFD irreducible elements are prime, Proof of cancellation in an integral domain, Proof that a subspace of full dimension is the whole space, Proof of the generalized Euclid's lemma, 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 equivalence classes form a partition, Proof that g to the n equals 1 iff the order divides n, Proof of the tower law, Proof that every polynomial has a root in some extension field, Proof that R[x] is an integral domain iff R is, Proof that g to the order of the group is the identity, Proof that finite extensions are algebraic, Proof that the Galois group of a finite Galois extension has order equal to the degree, Proof that the degree of a simple extension is the degree of the minimal polynomial, Proof that the product of primitive polynomials is primitive, Proof that finite subgroups of the multiplicative group of a field are cyclic, Proof of the first isomorphism theorem for rings, Proof that a ring homomorphism is injective iff its kernel is zero, Proof that the kernel is a normal subgroup, Proof that the order of an element divides the order of the group, Proof of the degree of a product over an integral domain, Proof of strong induction from ordinary induction, Proof of the laws of exponents in a group, Proof of the universal property of the quotient group, Proof that a homomorphism is injective iff its kernel is trivial, Proof of the correspondence theorem for rings, Proof that a subgroup is normal iff its left and right cosets agree, Proof that a product of two finite cyclic groups is cyclic iff their orders are coprime, Proof that R/M is a field iff M is maximal, Proof that an injective endomorphism of a finite-dimensional space is surjective, Proof of the first isomorphism theorem, Proof that the only ideals of a field are zero and the whole field, Proof of the primitive element theorem, 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 the existence of splitting fields, Proof of Zorn's lemma, Proof that a finite abelian group is cyclic iff its exponent equals its order, Proof that the order of a cyclic subgroup equals the order of its generator, 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 of the division algorithm, Proof that the minimal polynomial divides every polynomial vanishing at the element, Proof of the uniqueness of inverses, Proof of Gauss's lemma on irreducibility over a UFD, Proof that cyclic groups of the same order are isomorphic, Proof of Bézout's identity in a Euclidean domain, Proof that K[x]/(f) is a field iff f is irreducible, Proof of the derivative test for repeated roots, Proof that prime elements are irreducible in an integral domain, 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 Lagrange's theorem, Proof that homomorphisms preserve identity and inverses, Proof of the factor theorem, Proof that cosets have the same cardinality as the subgroup, Proof of the rank–nullity theorem by extending a basis of the kernel, Proof that the multiplicative group of a finite field is cyclic, 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, Proof of the cancellation laws.

  1. Automorphism group concept
  2. Basis concept
  3. Binary operation definition
  4. Definition by recursion concept
  5. Dimension concept
  6. Divisibility definition
  7. Element definition
  8. Group concept
  9. Image of a linear map concept
  10. Kernel of a linear map concept
  11. Left coset concept
  12. Linear combination concept
  13. Linear independence concept
  14. Linear map concept
  15. Linear subspace concept
  16. Mathematical induction concept
  17. Natural numbers object
  18. Nullity concept
  19. Peano axioms concept
  20. Proof of Zorn's lemma proof
  21. Proposition concept
  22. Rank of a linear map concept
  23. Spanning set concept
  24. Vector space definition
  25. Commutativity definition
  26. Identity element definition
  27. Greatest common divisor definition
  28. Set definition
  29. Conjugate elements definition
  30. Direct product of groups definition
  31. Group homomorphism definition
  32. Order of a group definition
  33. Ring definition
  34. Subgroup definition
  35. Proof that a linear map is injective iff its kernel is trivial proof
  36. Successor function definition
  37. Conjunction definition
  38. Disjunction definition
  39. Implication definition
  40. Predicate definition
  41. External direct sum definition
  42. Linear combination definition
  43. Linear map definition
  44. Linear subspace definition
  45. Inverse element definition
  46. Coprime integers definition
  47. Empty set object
  48. Family of sets definition
  49. Ordered pair definition
  50. Abelian group definition
  51. Group isomorphism definition
  52. Kernel of a homomorphism definition
  53. Conjugate subgroup definition
  54. Intersection definition
  55. Union definition
  56. Ideal definition
  57. Image of a homomorphism definition
  58. Commutative ring definition
  59. Polynomial ring definition
  60. Ring homomorphism definition
  61. Subring definition
  62. Unit of a ring definition
  63. Zero divisor definition
  64. Left coset definition
  65. Right coset definition
  66. Set-builder notation concept
  67. Addition of natural numbers definition
  68. Biconditional definition
  69. The successor function is injective statement
  70. Zero is not a successor statement
  71. Existential quantifier definition
  72. Universal quantifier definition
  73. Linear independence definition
  74. Image of a linear map definition
  75. Kernel of a linear map definition
  76. Linear span definition
  77. Proof of the cancellation laws proof
  78. Proof of the uniqueness of inverses proof
  79. Cartesian product definition
  80. Disjoint sets definition
  81. Normal subgroup definition
  82. Maximal ideal definition
  83. Two-sided ideal definition
  84. Group of units of a ring definition
  85. Ideal generated by a subset definition
  86. Subset definition
  87. Divisibility in a commutative ring definition
  88. Union of a family of sets definition
  89. Degree of a polynomial definition
  90. Formal derivative definition
  91. Polynomial evaluation definition
  92. Proof of the universal property of the polynomial ring proof
  93. Axiom of extensionality statement
  94. Field definition
  95. Kernel of a ring homomorphism definition
  96. Ring isomorphism definition
  97. Integral domain definition
  98. Proof of the commutativity of addition by induction proof
  99. Order on the natural numbers definition
  100. A linear map is injective iff its kernel is trivial statement
  101. Uniqueness quantifier definition
  102. Spanning set definition
  103. Uniqueness of inverses statement
  104. Cancellation laws statement
  105. Binary relation definition
  106. Quotient ring definition
  107. Partition of a set definition
  108. Principal ideal definition
  109. Proof that a subgroup is normal iff its left and right cosets agree proof
  110. Leading coefficient definition
  111. Separable polynomial definition
  112. Associate elements definition
  113. Prime element definition
  114. Proof of cancellation in an integral domain proof
  115. Proof that the only ideals of a field are zero and the whole field proof
  116. Root of a polynomial definition
  117. Evaluation homomorphism definition
  118. Subfield definition
  119. Finite field definition
  120. Field of fractions definition
  121. Irreducible element definition
  122. Commutativity of addition statement
  123. Proof of strong induction from ordinary induction proof
  124. Euclidean domain definition
  125. Finite-dimensional vector space definition
  126. Proof of the Steinitz exchange lemma by induction proof
  127. Basis definition
  128. Antisymmetric relation definition
  129. Reflexive relation definition
  130. Symmetric relation definition
  131. Transitive relation definition
  132. Proof that homomorphisms preserve identity and inverses proof
  133. Proof of the laws of exponents in a group proof
  134. Monic polynomial definition
  135. Proof that R/M is a field iff M is maximal proof
  136. Proof of the universal property of the quotient ring proof
  137. Normality via left and right cosets statement
  138. Multiplicity of a root definition
  139. Principal ideal domain definition
  140. Function definition
  141. Greatest common divisor in an integral domain definition
  142. Proof of the degree of a product over an integral domain proof
  143. The only ideals of a field are zero and the whole field statement
  144. Proof of the remainder theorem proof
  145. Split polynomial definition
  146. Universal property of the polynomial ring statement
  147. Cancellation in an integral domain statement
  148. Unique factorisation domain definition
  149. Field extension definition
  150. Irreducible polynomial definition
  151. Fixed field definition
  152. Strong induction statement
  153. Dimension definition
  154. Dimension theorem for vector spaces statement
  155. Steinitz exchange lemma statement
  156. Equivalence relation definition
  157. Preorder definition
  158. Homomorphisms preserve identity and inverses statement
  159. Laws of exponents in a group statement
  160. Image of a set definition
  161. Preimage of a set definition
  162. Division algorithm for polynomials statement
  163. Quotient group definition
  164. Universal property of the quotient ring statement
  165. Choice function definition
  166. Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
  167. Codomain definition
  168. Injective function definition
  169. Polynomial greatest common divisor definition
  170. Degree of a product statement
  171. Galois group definition
  172. Proof that prime elements are irreducible in an integral domain proof
  173. Algebraic element definition
  174. Content of a polynomial definition
  175. Euclidean algorithm in a Euclidean domain concept
  176. Intermediate field definition
  177. Proof of the well-ordering principle from strong induction proof
  178. Degree of a field extension definition
  179. Proof that a subspace of a finite-dimensional space has smaller or equal dimension proof
  180. Proof that n independent or n spanning vectors in an n-dimensional space form a basis proof
  181. Rank of a linear map definition
  182. Nullity definition
  183. Partial order definition
  184. Proof that the kernel is a normal subgroup proof
  185. Proof that a homomorphism is injective iff its kernel is trivial proof
  186. Order of an element definition
  187. Cyclic subgroup generated by an element definition
  188. Proof of the universal property of the quotient group proof
  189. In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
  190. Axiom of choice statement
  191. Equivalence class definition
  192. Surjective function definition
  193. Minimal polynomial of an algebraic element definition
  194. Remainder theorem statement
  195. Proof that R[x] is an integral domain iff R is proof
  196. Proof that a ring homomorphism is injective iff its kernel is zero proof
  197. Prime elements are irreducible in an integral domain statement
  198. Primitive polynomial definition
  199. Field generated by adjoining elements definition
  200. Algebraic extension definition
  201. Well-ordering principle statement
  202. Finite extension definition
  203. Dimension of a subspace statement
  204. Linearly independent set of the right size is a basis statement
  205. Maximal element definition
  206. Total order definition
  207. Upper bound definition
  208. Exponent of a group definition
  209. The kernel is a normal subgroup statement
  210. A homomorphism is injective iff its kernel is trivial statement
  211. Cyclic group definition
  212. Proof that equivalence classes form a partition proof
  213. Universal property of the quotient group statement
  214. Bijective function definition
  215. Separable extension definition
  216. Proof that the minimal polynomial divides every polynomial vanishing at the element proof
  217. Proof of the factor theorem proof
  218. Proof that Euclidean domains are principal ideal domains proof
  219. Proof that in a UFD irreducible elements are prime proof
  220. R[x] is an integral domain iff R is statement
  221. A ring homomorphism is injective iff its kernel is zero statement
  222. Proof that the minimal polynomial is irreducible proof
  223. Simple extension definition
  224. Proof of the division algorithm proof
  225. Splitting field definition
  226. Normal extension definition
  227. Proof that a subspace of full dimension is the whole space proof
  228. Chain definition
  229. Equivalence classes form a partition statement
  230. Proof of the correspondence theorem for rings proof
  231. Proof of the first isomorphism theorem proof
  232. Equinumerous sets definition
  233. The minimal polynomial divides every polynomial vanishing at the element statement
  234. Division algorithm statement
  235. Factor theorem statement
  236. Proof of the first isomorphism theorem for rings proof
  237. Proof that K[x] is a Euclidean domain proof
  238. Proof that ring homomorphisms from a field are injective proof
  239. Euclidean domains are principal ideal domains statement
  240. In a UFD irreducible elements are prime statement
  241. Characterizations of Galois extensions statement
  242. Galois extension definition
  243. The minimal polynomial is irreducible statement
  244. A subspace of full dimension is the whole space statement
  245. Cardinality definition
  246. Proof that g to the n equals 1 iff the order divides n proof
  247. Correspondence theorem for rings statement
  248. Zorn's lemma statement
  249. First isomorphism theorem statement
  250. Proof of Bézout's identity proof
  251. First isomorphism theorem for rings statement
  252. Proof of Bézout's identity in a Euclidean domain proof
  253. Proof of the derivative test for repeated roots proof
  254. K[x] is a Euclidean domain statement
  255. Proof that a polynomial over a field has at most as many roots as its degree proof
  256. Ring homomorphisms from a field are injective statement
  257. Proof that the product of primitive polynomials is primitive proof
  258. Proof of Gauss's lemma on irreducibility over a UFD proof
  259. g to the n equals 1 iff the order divides n statement
  260. Bézout's identity statement
  261. R/M is a field iff M is maximal statement
  262. Proof that cosets have the same cardinality as the subgroup proof
  263. A polynomial over a field has at most as many roots as its degree statement
  264. Repeated roots and the derivative statement
  265. Proof that every linearly independent set extends to a basis, by Zorn's lemma proof
  266. Proof that every vector space has a basis, by Zorn's lemma proof
  267. Product of primitive polynomials is primitive statement
  268. Bézout's identity in a Euclidean domain statement
  269. Proof of the generalized Euclid's lemma proof
  270. Proof that the order of a cyclic subgroup equals the order of its generator proof
  271. Proof that K[x]/(f) is a field iff f is irreducible proof
  272. Cosets have the same cardinality as the subgroup statement
  273. Every vector space has a basis statement
  274. Gauss's lemma statement
  275. Every linearly independent set extends to a basis statement
  276. Generalized Euclid's lemma statement
  277. Order of a cyclic subgroup equals the order of its generator statement
  278. Proof of Lagrange's theorem proof
  279. K[x]/(f) is a field iff f is irreducible statement
  280. Polynomial ring over a UFD is a UFD statement
  281. Proof of the rank–nullity theorem by extending a basis of the kernel proof
  282. Proof of the tower law proof
  283. Proof that finite extensions are algebraic proof
  284. Proof that a product of two finite cyclic groups is cyclic iff their orders are coprime proof
  285. Proof that cyclic groups of the same order are isomorphic proof
  286. Lagrange's theorem statement
  287. Adjoining a root of a polynomial definition
  288. Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial proof
  289. Finite extensions are algebraic statement
  290. Tower law statement
  291. Rank–nullity theorem statement
  292. Proof that the order of an element divides the order of the group proof
  293. Cyclic groups of the same order are isomorphic statement
  294. K(a) is isomorphic to K[x] modulo the minimal polynomial statement
  295. Proof that an injective endomorphism of a finite-dimensional space is surjective proof
  296. Order of an element divides the order of the group statement
  297. Product of cyclic groups is cyclic iff the orders are coprime statement
  298. An injective endomorphism of a finite-dimensional space is surjective statement
  299. Proof that the degree of a simple extension is the degree of the minimal polynomial proof
  300. Proof that g to the order of the group is the identity proof
  301. Classification of finite abelian groups statement
  302. Degree of a simple extension is the degree of the minimal polynomial statement
  303. g to the order of the group is the identity statement
  304. Proof that a finite abelian group is cyclic iff its exponent equals its order proof
  305. Proof that the automorphism group of a finite extension has order at most the degree proof
  306. Proof that the Galois group of a finite Galois extension has order equal to the degree proof
  307. Proof that every polynomial has a root in some extension field proof
  308. A finite abelian group is cyclic iff its exponent equals its order statement
  309. Every polynomial has a root in some extension field statement
  310. The Galois group has order at most the degree statement
  311. Proof that finite subgroups of the multiplicative group of a field are cyclic proof
  312. Order of the Galois group of a Galois extension equals its degree statement
  313. Proof of the existence of splitting fields proof
  314. Finite subgroups of the multiplicative group of a field are cyclic statement
  315. Existence of splitting fields statement
  316. Proof that the multiplicative group of a finite field is cyclic proof
  317. The multiplicative group of a finite field is cyclic statement
  318. Proof of the primitive element theorem proof
  319. Primitive element theorem statement
  320. Artin's theorem on fixed fields statement
  321. Proof of the fundamental theorem of Galois theory proof

Where this leads

4 pages build on this one.

Further reading

  1. Web https://www.jmilne.org/math/CourseNotes/FT.pdf, Theorem 3.17
About this page
TagTQDCTTCKVX
URIm2://TQDCTTCKVX
Kindproof
WritingW0 stub
MSC12F10
ProvesFundamental theorem of Galois theory
UsesGalois extension, Galois group, Intermediate field, Fixed field, Subfield, Artin's theorem on fixed fields, Characterizations of Galois extensions, Order of the Galois group of a Galois extension equals its degree, Tower law, Splitting field, Separable polynomial, Field generated by adjoining elements, Subgroup, Normal subgroup, Group homomorphism, Quotient group, First isomorphism theorem, Normal extension, Minimal polynomial of an algebraic element, The minimal polynomial is irreducible, Split polynomial
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.