The Fundamental Theorem of Galois Theory
Why can the roots of not be expressed by radicals? Why can the roots of ? The answer hides inside a dictionary. This dictionary translates questions about fields into questions about groups. There, finiteness and combinatorics make hard problems tractable. This dictionary is the Fundamental Theorem of Galois Theory. It is arguably the single most influential correspondence in algebra. The idea is that a finite Galois extension carries a rich internal structure. Fields sit between and . Naively one might expect these intermediate fields to be hard to classify. There could be infinitely many, with no way to organize them. The theorem shows the opposite. They correspond exactly, bijectively, and order-reversingly. This correspondence is to the subgroups of a single finite group. That group is the Galois group . The big picture is that field theory questions become group theory questions. Does this equation have a solution by radicals? Is this field embeddable in that one? What are all the fields between and ? These become: is this group solvable? Does it have a subgroup of this index? What is the subgroup lattice of ? Group theory is combinatorial and computable in ways that field theory alone is not. So the correspondence is a genuine engine for solving classical problems. This article states the correspondence with full precision. It proves it from the defining properties of Galois extensions. The essential inputs are the Primitive Element Theorem and Artin's theorem on fixed fields. It works two asymmetric examples in full detail. It shows exactly which hypothesis is load-bearing — finiteness, normality, separability — by breaking each one.
- For a finite Galois extension , intermediate fields correspond bijectively to subgroups .
- The correspondence is inclusion-reversing: bigger fields go with smaller groups, and conversely.
- Degrees translate directly into group indices: and .
- An intermediate field is Galois over exactly when its corresponding subgroup is normal in , and then .
- Every step of the proof rests on two pillars: the Primitive Element Theorem (finite separable extensions are simple) and Artin's Lemma on fixed fields of finite automorphism groups.
- Key idea: a finite Galois extension packages all of its intermediate field structure into the combinatorics of one finite group.
Where this lives today
The correspondence is the computational backbone of the theory of solvability by radicals: the Galois group of over is the full symmetric group , which is not solvable because is simple, and the correspondence translates "no radical formula" directly into "no composition series of the subgroup lattice with abelian factors." In number theory, the correspondence applied to cyclotomic extensions (with Galois group ) organizes all subfields of — including quadratic subfields governing quadratic reciprocity — as fixed fields of subgroups of a completely explicit abelian group. In algebraic geometry and topology, the same correspondence appears as the classification of covering spaces of a topological space by subgroups of its fundamental group, an exact formal analogue proved by an essentially identical fixed-point argument (deck transformations replace field automorphisms). In cryptography, understanding which finite fields sit inside which others, and the Frobenius automorphism structure governing them, is Galois theory over finite fields applied directly to constructing and analyzing elliptic-curve and pairing-based cryptosystems. In computer algebra, algorithms for computing Galois groups of polynomials over rely on the correspondence to certify which subfields of a splitting field exist and to bound possible group structures via resolvent polynomials.
:::quiz[If and is Galois, and has order 6, what is ?]
- 6
- 4 ✓
- 24
- 18
:::quiz[In the example ( = splitting field of ), why is not Galois?]
- Its degree is not a power of 2
- is separable, contradicting normality
- Its corresponding subgroup is not normal in ✓
- is not a subfield of
:::faq[Is the correspondence still a bijection if we only assume is normal but allow to be infinite?] Not without modification. For infinite (algebraic) Galois extensions, is given the Krull topology, a profinite topology in which basic open subgroups are stabilizers of finite subextensions. The correspondence then holds between intermediate fields and closed subgroups of , not all abstract subgroups; e.g. for , the abstract subgroup is dense but not closed and does not correspond to any intermediate field. The finite case in this article is the setting where every subgroup is automatically closed (finite groups carry only the discrete topology), so no such subtlety arises.
Ask the tutor: Can you walk through why the compositum and intersection formulas in part 5 require separately checking two containments each, rather than following immediately from the bijection alone?
Let be a finite Galois extension: a finite extension that is both normal (every irreducible polynomial over with a root in splits completely in ) and separable (every element of has an irreducible minimal polynomial over with no repeated roots). Write
a finite group with . Define two maps between the set of intermediate fields and the set of subgroups of :
- The fixing map , sending .
- The fixed-field map , sending .
The Fundamental Theorem asserts and are mutually inverse, order-reversing bijections between (ordered by inclusion) and (ordered by inclusion), and describes how degrees, normality, and quotient groups behave under this correspondence.
Intuition
Think of as a group of symmetries of that "see" as the featureless background — every element of is invisible to every symmetry, fixed in place. An intermediate field is a partial refinement of that background: more structure than is now visible and must be preserved, so fewer symmetries can preserve it. The bigger is, the more rigid the constraint, and the smaller the group of symmetries respecting it. This is exactly why the correspondence reverses inclusions: enlarging the field shrinks the stabilizing group, just as fixing more points of a geometric figure shrinks its symmetry group. The reverse direction says the same thing from the group side. A subgroup picks out exactly those elements of that every symmetry in leaves alone — the fixed field . A bigger subgroup imposes more constraints (more symmetries that all must fix a point), so fewer points survive, and shrinks. The theorem's content is that this back-and-forth loses no information at all: starting from , fixing it, and then taking the fixed field of the resulting group returns exactly ; and dually for subgroups. The normal subgroup clause has its own geometric meaning. A subgroup is normal in exactly when conjugation by any sends to itself, which happens exactly when permutes the fixed field among itself — i.e. restricted to is again an automorphism of fixing . When this holds for every , the field is itself Galois over , and the "leftover" symmetries of over are captured exactly by the quotient .
Let be a finite Galois extension with . Let denote the set of intermediate fields with , and let denote the set of subgroups of . Then: 1. (Bijection.) The maps and are mutually inverse bijections between and ; that is,
2. (Order-reversing.) For , . 3. (Degrees and indices.) For with ,
Moreover is always Galois with . 4. (Normality.) For with : is a normal (equivalently, Galois) extension of if and only if . In that case,
via the restriction map . 5. (Compatibility with intersections and composites.) For with , ,
where denotes the compositum (smallest subfield of containing both).
We isolate the two structural facts on which everything rests, then assemble the theorem from them.
Step 0: Two pillars. (Pillar A, Artin's Lemma.) If is a finite group of automorphisms of a field and is its fixed field, then is a finite Galois extension with and . We recall why this holds, since it is the true engine of the theorem. Let with . Given any , consider the polynomial
The coefficients of are (up to sign) the elementary symmetric functions of , and any permutes this multiset (since is a group, ranges over as does), hence fixes each coefficient. So , and since . Thus every is algebraic over of degree at most , and splits into distinct linear factors over (the values may repeat as a list, but the distinct roots occurring are exactly the distinct values, each occurring with multiplicity equal to the number of 's agreeing on ; discarding repeats gives a separable polynomial over with root splitting in ). This shows is algebraic, separable, and normal (every element's minimal polynomial over divides some such and splits in ), i.e. satisfies the local Galois conditions at each element; a standard consequence (the compositum of finitely many finite normal separable extensions is finite normal separable, and by the Primitive Element Theorem is finite since it is generated by finitely many such algebraic elements once we know , established next) makes finite Galois. To pin down the degree: by the Primitive Element Theorem applied to the finite separable extension generated by finitely many elements, is finite (a priori one shows finiteness directly: pick of maximal degree over among elements of — such a maximal degree exists and is at most by the bound above; then , for if some existed, would by the Primitive Element Theorem have a primitive element of degree over , still , contradicting maximality of unless no such exists). So and . Since (each fixes by definition) and always holds for a finite extension (the number of -embeddings of into an algebraic closure is at most , with equality iff separable, and here embeddings landing back in give automorphisms), we get
forcing all inequalities to be equalities: and . This proves Pillar A. (Pillar B.) If is finite Galois with group , then . Indeed trivially, since every fixes by definition. For the reverse inclusion, apply Pillar A to the group acting on : the fixed field satisfies . But is Galois so (a basic fact about Galois extensions: the number of automorphisms of a finite normal separable extension equals its degree). Since and , the tower formula forces , i.e. .
Step 1: and are mutually inverse (part 1). Fix . Since is Galois, so is : normality and separability of persist over the larger base field (any element of has minimal polynomial over dividing its minimal polynomial over , which splits with distinct roots in ; hence the minimal polynomial over also splits with distinct roots in ). So is finite Galois with group , and by Pillar B applied to ,
This proves , i.e. . Now fix , a subgroup of . Let . By Pillar A applied to the finite group acting on , we get , i.e. . This proves . Together these show and are mutually inverse bijections, proving part 1.
Step 2: Order-reversal (part 2). If , then any fixing pointwise certainly fixes pointwise, so . Conversely if are subgroups, any fixed by every element of is in particular fixed by every element of , so . Applying (order-reversing as just shown) to and using Step 1 recovers ; this shows the reversal is genuinely an equivalence, not just one direction.
Step 3: Degrees, indices, and Galois-ness of (part 3). We already noted in Step 1 that is Galois for every intermediate , with . By Pillar A, . By the tower law,
using (Galois-ness of ) and Lagrange's theorem for the last equality. This proves part 3.
Step 4: Normality criterion and the quotient isomorphism (part 4). Fix , . For , note that is again an intermediate field, and a direct computation shows
Indeed, fixes pointwise iff fixes pointwise (apply to to get for ), iff , iff . Now suppose . Then for every , , so by the displayed identity and the bijectivity of (Step 1), . Thus every maps into (and onto , being injective on the finite set ... more precisely as sets). Hence is an -automorphism of for every . We claim this forces to be normal. Let be irreducible with a root ; since is normal, splits completely in , say with roots . Since is Galois, acts transitively on the roots of (a standard fact: for any two roots of an irreducible polynomial over , there is an -isomorphism , which extends to an automorphism of since and are both splitting fields of the same set of polynomials over these isomorphic fields, hence some sends ). So each for some , and since , we get . Thus all roots of lie in , proving is normal; combined with separability inherited from (subextensions of separable extensions are separable, as minimal polynomials over of elements of still have distinct roots), is Galois. Conversely, suppose is Galois (equivalently normal, given separability is automatic here). We show . For and , the minimal polynomial of over splits in and, by normality of , has all its roots already in . Since is a root of this same minimal polynomial (automorphisms fixing permute roots of -polynomials), . Hence , and since is injective and finite-dimensional over , . By the identity above, for every , i.e. . Finally, when , define by ; this is well-defined since we showed for all , and it is a group homomorphism since restriction respects composition. Its kernel is . It is surjective: given , since is normal and is generated by adjoining roots of polynomials that also split in over , standard extension-of-isomorphism arguments (extend the -isomorphism to an -automorphism of the splitting field ) produce with . By the First Isomorphism Theorem for groups,
This proves part 4.
Step 5: Compatibility with intersections and composites (part 5). For the first identity: iff fixes every element of pointwise, iff fixes every element of and every element of (since is generated as a field by , and fixing a generating set pointwise under a field automorphism is equivalent to fixing the whole subfield they generate), iff . So . For the second identity, apply to both sides using the bijection and order-reversal already established. We know is the smallest field containing both and is not quite immediate; instead argue directly: is the smallest subgroup containing and . By order-reversal, is not the right containment direction to chase directly; instead we verify the stated identity by checking it is the image under of . Since and , order-reversal gives and , so . Conversely, applying to gives and similarly , so ; applying the order-reversing and using gives . Combining both containments, . This completes the proof of all five parts of the theorem.
∎Worked examples
Example 1: over . This is the splitting field of over , hence normal; it is separable since . So is Galois. A short computation shows : , and (else would force for rationals , giving , forcing ; if , impossible in ; if , impossible in ), so . has order 4, generated by
which commute and each have order 2, so (the Klein four-group). Since is abelian, every subgroup is normal, so by part 4, every intermediate field is Galois over . The proper nontrivial subgroups are , , , each of order 2, hence index 2. Their fixed fields, each of degree 2 over by part 3, are found by inspection: sends , so it fixes . Thus
Together with and , this exhausts all five subgroups of and all five intermediate fields, matching the lattice in the figure above — note the correspondence really does biject the five subgroups with the five fields, with no extra intermediate fields hiding anywhere, exactly as the theorem guarantees.
Example 2: splitting field of over , an asymmetric non-abelian case. Let (real fourth root) and . The roots of are , so , the splitting field, hence Galois over (normal by construction, separable since ). Degree count: since is irreducible over by Eisenstein at . Also since , so ( has minimal polynomial over , irreducible since is real). Hence . has order 8. Define by
One checks , , and (compute , and similarly on ), so , the dihedral group of order 8 (symmetries of a square), with presentation . has ten subgroups: , the center (order 2), four other order-2 subgroups , three subgroups of order 4 (, , ), and itself. By part 3, these correspond to intermediate fields of degree over respectively (degree ). Some computed fixed fields, using the definitions of :
- (order 4, index 2, and normal since it has index 2): fixes (as ) but moves , so , degree 2. Since , part 4 predicts is Galois — true, as it is the splitting field of — with , matching the obvious fact that has order 2.
- (order 2, non-normal: check ): fixes , so , degree 4. Since is not normal, part 4 predicts is not Galois — correct, since has roots and only lie in , so does not split in , i.e. fails normality exactly as predicted.
- (order 4, index 2, hence normal): , , so this subgroup fixes but not or ; , degree 2, and (index 2, hence normal) is Galois over with quotient , matching that is visibly the splitting field of .
This example shows the correspondence at work in a genuinely non-abelian setting, with normal and non-normal subgroups both present and both correctly predicting Galois versus non-Galois intermediate fields.
Let and let , a degree-3 separable extension of (separable since ) which is not normal: the minimal polynomial has only one real root, , while the other two roots (with ) are not in . Compute : any -automorphism of must send to another root of lying in ; the only such root in is itself, so . Thus , the trivial group, even though . If the correspondence held for this non-normal extension exactly as stated, the trivial group would have to correspond to all of , and being the unique subgroup of the trivial group, there would be no room for any other intermediate field. But there are no proper intermediate fields between and (as is prime, so by the tower law any intermediate field has degree or over ) — so this particular case does not visibly contradict the count. The real failure is sharper: the theorem's proof used (Pillar B), which required Galois. Here , so the fixed-field identity fails outright. The map collapses every intermediate field to a subgroup of the trivial group, so is nowhere close to injective once there is more than one intermediate field in a bigger non-normal example, and even here it fails to be onto the "correct" answer because carries no information at all about : this is the general phenomenon that automorphism groups of non-normal extensions are too small to see the extension's structure, precisely because Pillar A and Pillar B require the group acting to have as its own splitting-field-like closure. This is why the theorem is stated for Galois (normal + separable), not merely separable, extensions.
Scope, edge cases & common traps
| Situation | What happens |
|---|---|
| finite Galois | Full correspondence holds exactly as stated. |
| separable but not normal | can be far too small (even trivial); no correspondence. |
| normal but not separable (positive characteristic) | Fixed field of need not equal ; correspondence fails (inseparable "extra" subfields are invisible to automorphisms). |
| infinite Galois (e.g. ) | A correspondence still holds, but only with closed subgroups in the Krull topology on ; arbitrary subgroups can fail to be closed and then fail to correspond to any intermediate field. |
| Composite / intersection of intermediate fields | Correctly computed via intersection / subgroup-generation of the corresponding subgroups (part 5), not via naive subgroup intersection/union confusion. |
The mathematician behind it
Origins · 1 minÉvariste Galois and how this was discovered
Galois developed the group-theoretic viewpoint on polynomial solvability as a teenager, submitted his ideas to the French Academy multiple times, and was rejected or ignored by Cauchy, Fourier, and Poisson. He died at twenty from wounds sustained in a duel, having spent the night before frantically writing down his mathematical ideas, including the sketch of what would become the correspondence bearing his name.
Does the Fundamental Theorem require to be a splitting field of a single polynomial?
Not as an extra hypothesis — it's automatic. A finite Galois extension is by definition normal and separable, and a finite normal separable extension is always the splitting field of some polynomial over : take the product of minimal polynomials of a finite generating set (which exists since ), removing repeats. Conversely, a splitting field of a separable polynomial over is automatically Galois. So "finite Galois" and "finite splitting field of a separable polynomial" name the same class of extensions, and the theorem applies to either description without modification.
What exactly breaks if is normal but the characteristic is positive and separability fails?
Take and , so has degree but is purely inseparable: the only root of is itself (in characteristic , ). Every -automorphism of must fix this unique root, forcing , so . Pillar B fails, and with it the whole correspondence: there is exactly one nontrivial intermediate-field question here ("is there a field strictly between and ?", answer no, since degree is prime) but the trivial group offers zero information, illustrating why separability is indispensable, not just normality.
How does the theorem explain why some quintics have no solution by radicals?
A polynomial's roots are expressible by radicals exactly when its splitting field sits inside a tower of extensions each obtained by adjoining a root of some , and this happens exactly when the Galois group of the splitting field is a solvable group — one with a subnormal series with abelian factors. The Fundamental Theorem is what makes this translation rigorous: it shows subfields of the splitting field correspond exactly to subgroups of the Galois group, so a radical tower of fields corresponds to a subnormal chain of subgroups with abelian (in fact cyclic) quotients. For , the Galois group is , which is not solvable because its only proper normal subgroup is simple and nonabelian, so no such chain exists, and by the correspondence no radical tower can produce the splitting field. See Solvability by Radicals for the full argument.
Does the theorem tell us how to actually compute for a given polynomial?
Not directly — it tells you what to do with the group once you know it, not how to find it. Determining for an explicit polynomial typically uses auxiliary tools: resolvent polynomials, discriminants (to detect whether the group lies in the alternating group), reduction mod primes (Dedekind's theorem, relating factorization patterns mod to cycle types in the Galois group acting on roots), and degree/prime constraints from the tower law. The Fundamental Theorem's role begins once the group is known or partially known: it converts every group-theoretic fact you can extract (subgroup lattice, normal subgroups, solvability) into a field-theoretic fact about the specific extension at hand.
Why must and both be checked, rather than just showing one map is a bijection?
Because a priori could be injective without being surjective, or vice versa, and separately checking and is exactly what rules both failure modes out simultaneously; this is the standard criterion for two maps between sets to be mutually inverse bijections. In the proof, used Pillar B (applied to ), while used Pillar A (applied to acting on ) — these are logically independent facts about fixed fields, requiring separate arguments, and neither alone would establish that every subgroup and every intermediate field is accounted for.