The Fundamental Theorem of Galois Theory
The Fundamental Theorem of Galois Theory (FTGT) establishes an order-reversing bijection between the intermediate fields of a finite Galois extension and the subgroups of its Galois group . In words: the lattice of fields between and is the mirror image of the lattice of subgroups of the symmetry group of the extension. Where it applies: finite (and with care, infinite) Galois extensions of arbitrary fields; central to solvability of polynomials, algebraic number theory, and arithmetic geometry. Who/when: envisioned by Évariste Galois (1830–1832), made rigorous by Dedekind, Weber, Emil Artin (1940s), and Krull (infinite case, 1928).A finite extension is Galois when it is normal and separable, equivalently when the fixed field of is exactly , equivalently when . The Fundamental Theorem asserts that the maps and (the fixed field of ) are mutually inverse, inclusion-reversing bijections between intermediate fields and subgroups . This dictionary translates field-theoretic questions — which are continuous, geometric, and hard — into group-theoretic questions, which are finite, combinatorial, and often tractable. The surprising fact is its rigidity: normal subgroups correspond exactly to those intermediate fields that are themselves Galois over , and the corresponding quotient group is the Galois group of that sub-extension. This single correspondence powers the classical proof that the general quintic is not solvable by radicals.
The Core Insight
Symmetry organizes structure. The automorphisms of fixing form a group whose subgroup lattice is a faithful, inverted photograph of the field lattice. Bigger groups fix smaller fields; bigger fields are fixed by smaller groups. The dimension counts and the symmetry counts coincide exactly () only in the Galois case — that exact equality is what makes the correspondence a bijection rather than a mere injection.
Formal Statement
Galois Extension and Galois Group
Let be a field extension.
- is the group of field automorphisms with , under composition.
- For a subset , the fixed field is
- is finite Galois iff it is finite, normal (every irreducible with a root in splits in ), and separable (the minimal polynomial of every has no repeated roots). In that case we write .
The defining numerical criterion (Artin) is:
Fundamental Theorem of Galois Theory
Let be a finite Galois extension with group , . Define
Then:
(1) Bijection. and are mutually inverse:Why It Holds / Derivation
Proof of the Fundamental Theorem
The engine is Artin's Lemma: if is a finite group of automorphisms of a field , then .
Step 1 — Artin's Lemma (linear independence of characters). Distinct automorphisms are linearly independent over as functions (Dedekind). For put . One shows : any elements of are -linearly dependent, by solving a homogeneous system whose coefficient matrix has rows and exploiting a minimal nontrivial dependence to land in . Conversely since the distinct embeddings of over are linearly independent. HenceThus for all (i.e. normal) iff is invariant under all conjugations, i.e. .
Step 6 — The quotient. When , every satisfies , so restriction maps . Its kernel is exactly . Surjectivity follows because every -automorphism of extends to (normality of ). The first isomorphism theorem yields [7].Évariste Galois | 1811–1832
Galois, dead in a duel at twenty, never wrote "the Fundamental Theorem" — he wrote of the group of permutations of the roots that leaves all rational relations invariant. His 1831 memoir, rejected and nearly lost, contained the decisive idea: solvability by radicals corresponds to a chain of subgroups with abelian quotients (a solvable group). The modern lattice-theoretic statement, the fixed-field formalism, and the clean bijection are due to later hands — Dedekind introduced field automorphisms abstractly, Heinrich Weber systematized "Galois groups," and Emil Artin reorganized the entire theory around linear algebra and Artin's lemma, dethroning the primitive-element argument and making the proof characteristic-free and conceptually transparent.
Building Intuition
Think of as a crystal and as its symmetry group. Each intermediate field is a substructure you can carve out by demanding invariance under part of the symmetry. Demand invariance under the whole group : you get the smallest possible field, (the most symmetric part). Demand invariance under only the trivial subgroup : nothing is forced, you get all of .
The order reversal is the natural "more constraints smaller object" logic: a larger subgroup imposes more symmetry constraints, so its fixed field is smaller. The degree of over literally counts how many symmetries you have left after pinning down — exactly .
Normality is the subtle part. A subfield is "stable" — globally fixed as a set, not pointwise — exactly when the symmetries fixing it form a normal subgroup. Normal subgroups are the ones you can quotient by to get a new group; correspondingly normal subfields are the ones that carry their own self-contained Galois theory, with group the quotient.
The Galois correspondence for $\mathbb{Q}(\sqrt 2,\sqrt 3)/\mathbb{Q}$: fields (left) mirror subgroups (right)
Worked Examples
The biquadratic field $\mathbb{Q}(\sqrt2,\sqrt3)$
Given. , . The minimal polynomials and split in and are separable (char 0), so is Galois. Step 1 — Degree. and , so . Step 2 — Group. Each automorphism sends , independently, giving automorphisms. Thus , the Klein four-group . Write (fixes ), (fixes ). Step 3 — Subgroups → fixed fields.- fixes ⟹ .
- fixes ⟹ .
- fixes ⟹ .
:::example[A non-abelian group: ] Given. Splitting field of over , where . Roots: .
Step 1 — Degree. (Eisenstein), and (since ). Tower law: . Step 2 — Group. permutes the three roots faithfully, , so . Step 3 — Subgroup lattice. has: trivial; three order-2 subgroups (transpositions); one order-3 subgroup ; and itself. Step 4 — Correspondence.- ⟹ its fixed field is normal over . (order 3, index 2) ⟹ fixed field has degree 2: , which is Galois (cyclotomic) ✓, with .
- The three order-2 subgroups are not normal ⟹ their fixed fields are not Galois over (each degree 3, but does not split in any one of them). They are the three conjugates of each other, matching the three conjugate subgroups.
Common Misconceptions
Galois is not automatic
The bijection requires to be both normal and separable. Either failure breaks the theorem:
- Inseparable failure: , . Then has a single repeated root, , yet . The fixed field of the trivial group is all of , not , so [5] fails. The map is not surjective onto .
- Non-normal failure: has but degree 3; does not split.
Order-reversal must not be dropped, and conjugates need not coincide
In the three subfields are distinct fields of the same degree 3 over , corresponding to three distinct conjugate order-2 subgroups of . A common error is to assume "same degree ⟹ same field" or "all index-3 subgroups are normal." Both are false here: the lattice genuinely has three separate branches, and none of these subfields is Galois over because the matching subgroups are not normal. Equation [9] is what forces conjugate subgroups to give conjugate (isomorphic but possibly unequal) subfields.
Infinite extensions need topology
For an infinite Galois extension (e.g. , or ), the naive bijection fails: there are more subgroups than intermediate fields. The fix (Krull) is to topologize with the Krull (profinite) topology, where a base of open neighborhoods of is given by for finite . Then the correspondence holds between intermediate fields and closed subgroups, not all subgroups. See Infinite Galois Theory.
Connections
The FTGT is a hub linking many fields:
- Solvability by Radicals: A polynomial is solvable by radicals iff its Galois group is a solvable group; the chain of subfields obtained by adjoining radicals mirrors a chain of normal subgroups with abelian quotients via [7].
- Class Field Theory: describes abelian extensions of number fields — those with abelian Galois group — via the idele class group; the FTGT's normality/quotient structure is the foundation.
- Inverse Galois Problem: which finite groups arise as ? The correspondence makes this a precise question about realizing abstract groups.
- Covering Space Theory: the topological analogue — the deck transformation group of a covering corresponds to subgroups of the fundamental group, with normal subgroups giving regular (Galois) covers. This is the prototype of a Galois Category.
- Differential Galois Theory: replaces field automorphisms with those commuting with a derivation, yielding algebraic groups; solvability of linear ODEs in closed form mirrors solvability of the differential Galois group.
Real-World Applications
- Insolvability of the quintic (Abel–Ruffini, via Galois). of a generic quintic is , which is not solvable; FTGT translates "no radical formula" into a group fact. The cornerstone of modern algebra curricula.
- Ruler-and-compass impossibility. Doubling the cube and trisecting a general angle require degree-3 extensions whose Galois closures have non-2-power order; FTGT-based degree arguments settle 2000-year-old problems.
- Coding theory (BCH and Reed–Solomon codes). Constructed over finite fields ; the Frobenius generates the cyclic Galois group, and conjugate roots (Galois orbits) determine minimal polynomials of code generators.
- Cryptography — elliptic curves and pairings. Frobenius eigenvalues, the Weil pairing, and Galois representations on torsion points underpin ECC and isogeny-based post-quantum schemes.
- Algebraic number theory — splitting of primes. The decomposition and inertia groups (subgroups of ) govern how a prime factors in an extension; FTGT links these subgroups to the relevant subfields (decomposition/inertia fields).
- Computer algebra systems. PARI/GP, Magma, and SageMath compute Galois groups to factor polynomials, identify number fields, and verify field isomorphisms — all leaning on the lattice correspondence.
- Physics — anyons and topological order. Galois-theoretic constraints on modular tensor categories (Galois action on fusion/braiding data) classify admissible topological phases.
Historical Development
- 1770 — Lagrange. Réflexions sur la résolution algébrique des équations: studies how rational functions of roots permute, foreshadowing the "Galois resolvent."
- 1799–1813 — Ruffini. Argues (incompletely) that the general quintic is unsolvable by radicals.
- 1824 — Abel. Gives the first rigorous proof of quintic unsolvability, but without the conceptual group-theoretic framework.
- 1830–1832 — Galois. Introduces the group of an equation and the solvability criterion; memoir submitted to the Académie, rejected/lost. Dies in a duel May 1832 at 20.
- 1846 — Liouville. Publishes Galois's manuscripts in his Journal, finally making the work accessible.
- 1870 — Jordan. Traité des substitutions: first systematic treatment, framing Galois theory through permutation groups.
- 1893–1895 — Weber & Dedekind. Recast the theory abstractly using fields and automorphisms; "Galois group" enters standard language.
- 1928 — Krull. Extends the correspondence to infinite extensions via the profinite topology.
- 1942–1944 — Artin. Reformulates the entire subject around linear independence of characters and fixed fields (Artin's lemma), giving the clean, primitive-element-free proof used in modern graduate courses.
Subtleties & Limits
- Inverse Galois Problem. Is every finite group the Galois group of some extension of ? Known for all solvable groups (Shafarevich) and many simple groups, but open in general. The FTGT defines the question but does not solve it.
- Grothendieck's anabelian program. To what extent does the absolute Galois group , as a profinite group with its action on geometric fundamental groups, determine arithmetic varieties? The Section Conjecture remains open. This generalizes FTGT to a correspondence between covers and group actions (Grothendieck's Galois Theory).
- Explicit Langlands reciprocity. The Langlands program seeks to understand all (including non-abelian) Galois representations via automorphic forms — a vast generalization of the abelian case settled by class field theory; large parts are conjectural.
- Differential and difference Galois theory extend FTGT to linear ODEs/recurrences (Picard–Vessiot theory), with subtle constraints (algebraic closure of constants) and open inverse problems for differential Galois groups.