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.
- Let be a finite Galois extension and . By the order of the Galois group, is finite with .
- Let be a subgroup of . Its fixed field is a subfield of . Each element of fixes , so . Thus is an intermediate field.
- By Artin's theorem applied to the finite group , we get and .
- Let be an intermediate field. By the characterizations of Galois extensions, is a splitting field over of a separable polynomial .
- Write in , with . Then , so .
- Also is separable over , because the identity with also holds in . So is a splitting field of a separable polynomial over .
- The extension is finite, since by the tower law. By the characterizations again, is Galois.
- Every automorphism of fixing fixes . So is a subset of . It contains the identity and is closed under composition and inverses, so it is a subgroup of .
- Let and . Every element of fixes , so .
- Since is Galois, by step 1 applied to . By step 3, .
- By the tower law, . Step 10 gives . So is a -dimensional -space that contains , and .
- Steps 3 and 11 show that and . So the two maps are inverse bijections. This proves part 1.
- For part 2, let be subgroups. An element fixed by all of is fixed by all of . So .
- Conversely, suppose . An automorphism fixing fixes . So , that is, by step 3. This proves part 2.
- For part 3, step 3 gives . The tower law gives . With step 1, .
- For part 4, fix a subgroup and let . Suppose first that is normal. Let and .
- Let be the minimal polynomial of over . It is irreducible and has the root . By normality, splits over as with .
- Since fixes the coefficients of , we get . So in the field , and for some . Hence for every .
- Let , and . By step 18 for , , so . Thus .
- So fixes and lies in , by step 3. Hence is a normal subgroup of .
- Now suppose that is normal in . Let , and . Then , so .
- So , that is, for every . Applying this to gives . So .
- Hence the restriction is an automorphism of fixing . The map , , is a group homomorphism, since restriction respects composition.
- Its kernel is the set of that fix pointwise. This is , by step 3.
- The image is a finite group of automorphisms of . An element fixed by all of lies in . By step 12 with , . So .
- By Artin's theorem applied to and , the extension is Galois, so it is normal. This proves that is normal if and only if is normal in .
- Artin's theorem also gives . By the first isomorphism theorem and step 24, the quotient group is isomorphic to .
- In both directions of part 4, is normal, so steps 21 to 27 apply. This proves part 4 and the theorem.
Idea
Artin's theorem says that a finite group of automorphisms is exactly the group of symmetries of over its fixed field, and that . This gives one round trip. For the other, stays Galois over every intermediate field, and a degree count shows that the fixed field of cannot be larger than . Normality matches because moves to , so is stable under exactly when 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.
- Automorphism group concept
- Basis concept
- Binary operation definition
- Definition by recursion concept
- Dimension concept
- Divisibility definition
- Element definition
- Group concept
- Image of a linear map concept
- Kernel of a linear map concept
- Left coset concept
- Linear combination concept
- Linear independence concept
- Linear map concept
- Linear subspace concept
- Mathematical induction concept
- Natural numbers object
- Nullity concept
- Peano axioms concept
- Proof of Zorn's lemma proof
- Proposition concept
- Rank of a linear map concept
- Spanning set concept
- Vector space definition
- Commutativity definition
- Identity element definition
- Greatest common divisor definition
- Set definition
- Conjugate elements definition
- Direct product of groups definition
- Group homomorphism definition
- Order of a group definition
- Ring definition
- Subgroup definition
- Proof that a linear map is injective iff its kernel is trivial proof
- Successor function definition
- Conjunction definition
- Disjunction definition
- Implication definition
- Predicate definition
- External direct sum definition
- Linear combination definition
- Linear map definition
- Linear subspace definition
- Inverse element definition
- Coprime integers definition
- Empty set object
- Family of sets definition
- Ordered pair definition
- Abelian group definition
- Group isomorphism definition
- Kernel of a homomorphism definition
- Conjugate subgroup definition
- Intersection definition
- Union definition
- Ideal definition
- Image of a homomorphism definition
- Commutative ring definition
- Polynomial ring definition
- Ring homomorphism definition
- Subring definition
- Unit of a ring definition
- Zero divisor definition
- Left coset definition
- Right coset definition
- Set-builder notation concept
- Addition of natural numbers definition
- Biconditional definition
- The successor function is injective statement
- Zero is not a successor statement
- Existential quantifier definition
- Universal quantifier definition
- Linear independence definition
- Image of a linear map definition
- Kernel of a linear map definition
- Linear span definition
- Proof of the cancellation laws proof
- Proof of the uniqueness of inverses proof
- Cartesian product definition
- Disjoint sets definition
- Normal subgroup definition
- Maximal ideal definition
- Two-sided ideal definition
- Group of units of a ring definition
- Ideal generated by a subset definition
- Subset definition
- Divisibility in a commutative ring definition
- Union of a family of sets definition
- Degree of a polynomial definition
- Formal derivative definition
- Polynomial evaluation definition
- Proof of the universal property of the polynomial ring proof
- Axiom of extensionality statement
- Field definition
- Kernel of a ring homomorphism definition
- Ring isomorphism definition
- Integral domain definition
- Proof of the commutativity of addition by induction proof
- Order on the natural numbers definition
- A linear map is injective iff its kernel is trivial statement
- Uniqueness quantifier definition
- Spanning set definition
- Uniqueness of inverses statement
- Cancellation laws statement
- Binary relation definition
- Quotient ring definition
- Partition of a set definition
- Principal ideal definition
- Proof that a subgroup is normal iff its left and right cosets agree proof
- Leading coefficient definition
- Separable polynomial definition
- Associate elements definition
- Prime element definition
- Proof of cancellation in an integral domain proof
- Proof that the only ideals of a field are zero and the whole field proof
- Root of a polynomial definition
- Evaluation homomorphism definition
- Subfield definition
- Finite field definition
- Field of fractions definition
- Irreducible element definition
- Commutativity of addition statement
- Proof of strong induction from ordinary induction proof
- Euclidean domain definition
- Finite-dimensional vector space definition
- Proof of the Steinitz exchange lemma by induction proof
- Basis definition
- Antisymmetric relation definition
- Reflexive relation definition
- Symmetric relation definition
- Transitive relation definition
- Proof that homomorphisms preserve identity and inverses proof
- Proof of the laws of exponents in a group proof
- Monic polynomial definition
- Proof that R/M is a field iff M is maximal proof
- Proof of the universal property of the quotient ring proof
- Normality via left and right cosets statement
- Multiplicity of a root definition
- Principal ideal domain definition
- Function definition
- Greatest common divisor in an integral domain definition
- Proof of the degree of a product over an integral domain proof
- The only ideals of a field are zero and the whole field statement
- Proof of the remainder theorem proof
- Split polynomial definition
- Universal property of the polynomial ring statement
- Cancellation in an integral domain statement
- Unique factorisation domain definition
- Field extension definition
- Irreducible polynomial definition
- Fixed field definition
- Strong induction statement
- Dimension definition
- Dimension theorem for vector spaces statement
- Steinitz exchange lemma statement
- Equivalence relation definition
- Preorder definition
- Homomorphisms preserve identity and inverses statement
- Laws of exponents in a group statement
- Image of a set definition
- Preimage of a set definition
- Division algorithm for polynomials statement
- Quotient group definition
- Universal property of the quotient ring statement
- Choice function definition
- Proof that in a PID a nonzero element is irreducible iff it generates a maximal ideal proof
- Codomain definition
- Injective function definition
- Polynomial greatest common divisor definition
- Degree of a product statement
- Galois group definition
- Proof that prime elements are irreducible in an integral domain proof
- Algebraic element definition
- Content of a polynomial definition
- Euclidean algorithm in a Euclidean domain concept
- Intermediate field definition
- Proof of the well-ordering principle from strong induction proof
- Degree of a field extension definition
- Proof that a subspace of a finite-dimensional space has smaller or equal dimension proof
- Proof that n independent or n spanning vectors in an n-dimensional space form a basis proof
- Rank of a linear map definition
- Nullity definition
- Partial order definition
- Proof that the kernel is a normal subgroup proof
- Proof that a homomorphism is injective iff its kernel is trivial proof
- Order of an element definition
- Cyclic subgroup generated by an element definition
- Proof of the universal property of the quotient group proof
- In a PID a nonzero element is irreducible iff it generates a maximal ideal statement
- Axiom of choice statement
- Equivalence class definition
- Surjective function definition
- Minimal polynomial of an algebraic element definition
- Remainder theorem statement
- Proof that R[x] is an integral domain iff R is proof
- Proof that a ring homomorphism is injective iff its kernel is zero proof
- Prime elements are irreducible in an integral domain statement
- Primitive polynomial definition
- Field generated by adjoining elements definition
- Algebraic extension definition
- Well-ordering principle statement
- Finite extension definition
- Dimension of a subspace statement
- Linearly independent set of the right size is a basis statement
- Maximal element definition
- Total order definition
- Upper bound definition
- Exponent of a group definition
- The kernel is a normal subgroup statement
- A homomorphism is injective iff its kernel is trivial statement
- Cyclic group definition
- Proof that equivalence classes form a partition proof
- Universal property of the quotient group statement
- Bijective function definition
- Separable extension definition
- Proof that the minimal polynomial divides every polynomial vanishing at the element proof
- Proof of the factor theorem proof
- Proof that Euclidean domains are principal ideal domains proof
- Proof that in a UFD irreducible elements are prime proof
- R[x] is an integral domain iff R is statement
- A ring homomorphism is injective iff its kernel is zero statement
- Proof that the minimal polynomial is irreducible proof
- Simple extension definition
- Proof of the division algorithm proof
- Splitting field definition
- Normal extension definition
- Proof that a subspace of full dimension is the whole space proof
- Chain definition
- Equivalence classes form a partition statement
- Proof of the correspondence theorem for rings proof
- Proof of the first isomorphism theorem proof
- Equinumerous sets definition
- The minimal polynomial divides every polynomial vanishing at the element statement
- Division algorithm statement
- Factor theorem statement
- Proof of the first isomorphism theorem for rings proof
- Proof that K[x] is a Euclidean domain proof
- Proof that ring homomorphisms from a field are injective proof
- Euclidean domains are principal ideal domains statement
- In a UFD irreducible elements are prime statement
- Characterizations of Galois extensions statement
- Galois extension definition
- The minimal polynomial is irreducible statement
- A subspace of full dimension is the whole space statement
- Cardinality definition
- Proof that g to the n equals 1 iff the order divides n proof
- Correspondence theorem for rings statement
- Zorn's lemma statement
- First isomorphism theorem statement
- Proof of Bézout's identity proof
- First isomorphism theorem for rings statement
- Proof of Bézout's identity in a Euclidean domain proof
- Proof of the derivative test for repeated roots proof
- K[x] is a Euclidean domain statement
- Proof that a polynomial over a field has at most as many roots as its degree proof
- Ring homomorphisms from a field are injective statement
- Proof that the product of primitive polynomials is primitive proof
- Proof of Gauss's lemma on irreducibility over a UFD proof
- g to the n equals 1 iff the order divides n statement
- Bézout's identity statement
- R/M is a field iff M is maximal statement
- Proof that cosets have the same cardinality as the subgroup proof
- A polynomial over a field has at most as many roots as its degree statement
- Repeated roots and the derivative statement
- Proof that every linearly independent set extends to a basis, by Zorn's lemma proof
- Proof that every vector space has a basis, by Zorn's lemma proof
- Product of primitive polynomials is primitive statement
- Bézout's identity in a Euclidean domain statement
- Proof of the generalized Euclid's lemma proof
- Proof that the order of a cyclic subgroup equals the order of its generator proof
- Proof that K[x]/(f) is a field iff f is irreducible proof
- Cosets have the same cardinality as the subgroup statement
- Every vector space has a basis statement
- Gauss's lemma statement
- Every linearly independent set extends to a basis statement
- Generalized Euclid's lemma statement
- Order of a cyclic subgroup equals the order of its generator statement
- Proof of Lagrange's theorem proof
- K[x]/(f) is a field iff f is irreducible statement
- Polynomial ring over a UFD is a UFD statement
- Proof of the rank–nullity theorem by extending a basis of the kernel proof
- Proof of the tower law proof
- Proof that finite extensions are algebraic proof
- Proof that a product of two finite cyclic groups is cyclic iff their orders are coprime proof
- Proof that cyclic groups of the same order are isomorphic proof
- Lagrange's theorem statement
- Adjoining a root of a polynomial definition
- Proof that K(a) is isomorphic to K[x] modulo the minimal polynomial proof
- Finite extensions are algebraic statement
- Tower law statement
- Rank–nullity theorem statement
- Proof that the order of an element divides the order of the group proof
- Cyclic groups of the same order are isomorphic statement
- K(a) is isomorphic to K[x] modulo the minimal polynomial statement
- Proof that an injective endomorphism of a finite-dimensional space is surjective proof
- Order of an element divides the order of the group statement
- Product of cyclic groups is cyclic iff the orders are coprime statement
- An injective endomorphism of a finite-dimensional space is surjective statement
- Proof that the degree of a simple extension is the degree of the minimal polynomial proof
- Proof that g to the order of the group is the identity proof
- Classification of finite abelian groups statement
- Degree of a simple extension is the degree of the minimal polynomial statement
- g to the order of the group is the identity statement
- Proof that a finite abelian group is cyclic iff its exponent equals its order proof
- Proof that the automorphism group of a finite extension has order at most the degree proof
- Proof that the Galois group of a finite Galois extension has order equal to the degree proof
- Proof that every polynomial has a root in some extension field proof
- A finite abelian group is cyclic iff its exponent equals its order statement
- Every polynomial has a root in some extension field statement
- The Galois group has order at most the degree statement
- Proof that finite subgroups of the multiplicative group of a field are cyclic proof
- Order of the Galois group of a Galois extension equals its degree statement
- Proof of the existence of splitting fields proof
- Finite subgroups of the multiplicative group of a field are cyclic statement
- Existence of splitting fields statement
- Proof that the multiplicative group of a finite field is cyclic proof
- The multiplicative group of a finite field is cyclic statement
- Proof of the primitive element theorem proof
- Primitive element theorem statement
- Artin's theorem on fixed fields statement
- Proof of the fundamental theorem of Galois theory proof
Where this leads
4 pages build on this one.
Further reading
- Web https://www.jmilne.org/math/CourseNotes/FT.pdf, Theorem 3.17
About this page
| Tag | TQDCTTCKVX |
|---|---|
| URI | m2://TQDCTTCKVX |
| Kind | proof |
| Writing | W0 stub |
| MSC | 12F10 |
| Proves | Fundamental theorem of Galois theory |
| Uses | Galois 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 |
| Changed | 4 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.