The Galois Group of an Extension
Why do some polynomial equations submit to a formula? Others — like — provably do not. The answer is hidden not in the roots themselves. It lies in the symmetries relating them. Given a field extension , we can ask a key question. Which transformations of leave completely untouched? These transformations merely permute the elements of built from -arithmetic. This question converts a problem about equations into a problem about groups. That translation is one of the most consequential ideas in algebra. The relevant symmetries are the field automorphisms of that fix every element of . They form a group under composition. This group is called the Galois group of . It is written or . When is the splitting field of a polynomial , this group acts faithfully on the roots of . It permutes them while respecting every algebraic relation between them. The structure of this permutation group encodes exactly how "solvable" or "symmetric" the roots are. The big picture is that field theory and group theory become mirror images of each other. Subgroups of the Galois group correspond to intermediate fields. The size of the group measures the degree of the extension. Normal subgroups detect which intermediate extensions are themselves splitting fields. This dictionary is made precise later by the Fundamental Theorem of Galois Theory. First, though, we must understand the group itself. We need to know what its elements are. We need to know why it acts on roots the way it does. We also need to know why its order is bounded by the degree of the extension. This article builds the Galois group from first principles. We define rigorously, and prove the fundamental bound . We show precisely how automorphisms act on roots of polynomials. We also compute the group explicitly in two genuinely different examples. We isolate exactly where the bound can fail to be an equality. This sets the stage for the notion of a Galois Extension.
- is the group of field automorphisms of that fix every element of pointwise.
- Such an automorphism must send each root of a polynomial over to another root of the same polynomial.
- The order of never exceeds the degree ; equality is a special and important phenomenon.
- Composing automorphisms and inverting them keeps you inside — it is genuinely a group under composition.
- Two extensions of the same degree can have wildly different Galois groups, from trivial to full symmetric groups.
- The group acts faithfully and transitively (for irreducible polynomials) on roots, turning root-permutations into algebra.
- Key idea: symmetries of a splitting field that fix the base field permute roots of polynomials, and this permutation action is the bridge between field extensions and group theory.
Where this lives today
The Galois group is the organizing structure behind the modern proof that the general quintic has no solution by radicals: solvability by radicals corresponds precisely to the Galois group of the splitting field being a solvable group, a criterion due to Galois himself. In number theory, the absolute Galois group is a central object of study, acting on Galois representations that encode deep arithmetic information used in the proof of Fermat's Last Theorem. In algebraic geometry and topology, Galois groups of function field extensions classify branched covering spaces, linking algebra to covering-space theory. In coding theory and cryptography, Galois groups of finite fields (generated by the Frobenius automorphism) underlie the structure of finite field arithmetic used in Reed–Solomon codes and elliptic-curve cryptosystems. In computer algebra systems, algorithms that compute Galois groups of specific polynomials (via resolvent polynomials and permutation group recognition) are used to decide solvability and to simplify radical expressions symbolically.
:::quiz[For over , what is ?]
- 3, matching
- 1, since contains only one of the three roots of ✓
- 6, since has three roots
- Infinite
:::quiz[What is the key finiteness hypothesis in the theorem ?]
- must be algebraically closed
- must be uncountable
- must be finite ✓
- must equal
:::quiz[For the splitting field of over , the Galois group is isomorphic to]
- The trivial group
- , of order 6 ✓
:::faq[Can be trivial even when ?] Yes, and this is common rather than exceptional. Whenever does not contain all the roots of the minimal polynomials of its generators over , many candidate images for a generator are simply unavailable inside , shrinking the group. The clean example is over : the only cube root of 2 lying in this real field is itself, forcing every automorphism to fix it, hence to be the identity. This is exactly the phenomenon that motivates requiring to be a splitting field (normality) when one wants the automorphism group to be as large as possible.
:::faq[Does the bound hold in every characteristic?] Yes, the inequality itself holds in every characteristic, including positive characteristic, as long as is finite; the proof given uses only general field homomorphism properties and the tower law, neither of which depends on characteristic. What can fail in positive characteristic is the equality case: even for a splitting field of an irreducible polynomial, if the polynomial is inseparable (has repeated roots in its splitting field, which can only happen in characteristic ), the number of distinct roots is strictly less than the degree, and the equality can genuinely fail. This is why the definition of a Galois extension requires separability in addition to normality.
Ask the tutor: Why does the Galois group of the splitting field of an irreducible polynomial always act transitively on its roots?
Let be a field extension. An -automorphism of is a field automorphism
such that for every . The set of all -automorphisms of is denoted
Under the operation of function composition, is a group, called the Galois group of over (in some texts this name and notation is reserved for the case when is additionally a Galois Extension; here we use for the automorphism group of an arbitrary extension).
Intuition
Think of as a fixed floor and as a room built on top of it by adjoining new elements — typically roots of polynomials. An element is a rigid motion of the room that leaves the floor perfectly still (every point of stays put) but is allowed to shuffle the newly adjoined furniture, as long as it respects all the algebraic joints (addition, multiplication) holding the room together. The key structural fact is that this shuffling is never arbitrary. If is a root of a polynomial , applying to the equation and using that fixes the coefficients of shows too. So can only move to another root of the same polynomial. This is why the Galois group naturally acts on finite sets of roots, turning an infinite-looking automorphism group into something computable: a subgroup of a symmetric group on finitely many roots. Consider over , the splitting field of , where . The three roots sit at the vertices of an equilateral triangle in (once we embed there), and automorphisms fixing permute these three roots while respecting the field structure — visibly the symmetries of the triangle.
Central theorem
Let be a finite field extension, so . Then is a finite group, its operation is composition of functions, and
Moreover, if has minimal polynomial over , then for every , is also a root of lying in .
Let be any field extension. The set , under composition of functions, is a group.
We check the group axioms directly, using that field automorphisms of are bijections respecting and .
Closure. Let . The composite is a bijection of (composite of bijections), and for ,
and similarly , using that each respect . So is a field automorphism of . For , , so fixes pointwise. Hence .
Identity. The identity map is a field automorphism fixing pointwise, so , and it is the identity for composition.
Inverses. Let . Since is a bijection, exists as a set-theoretic inverse. We check is a field homomorphism: for , write , for unique (possible since is bijective). Then
using that preserves addition. The same argument with multiplication gives . So is a field automorphism of . For : since , applying to both sides gives . So fixes pointwise, hence .
Associativity holds because composition of functions is always associative. All axioms hold, so is a group under composition.
∎We now prove the theorem itself, in two parts: the root-permutation claim, and the order bound. Both use induction on and the Uniqueness of Splitting Fields machinery for extending isomorphisms.
Part 1: sends roots of to roots of . Let with minimal polynomial over , so and each . Let . Applying the field homomorphism to the equation
and using that respects addition, multiplication, and powers (a homomorphism satisfies , hence by induction on ), we get
Since each and fixes pointwise, . So
i.e., . Since (as ), is a root of lying in . This proves Part 1.
Part 2: . We argue by strong induction on . Base case . Then , and any fixes every element of , forcing . So . Inductive step. Suppose and the bound holds for all extensions of degree less than . Pick , and let be its minimal polynomial over , of degree (since ). By the tower law,
We bound by grouping its elements according to where they send . By Part 1, for each , is one of the roots of lying in ; since has degree , it has at most roots in (a polynomial of degree over a field has at most roots in that field, or in any field containing it, since a field is an integral domain). Call these roots with . Fix one such root . We claim the set
has . Indeed, if is nonempty, fix . Every -algebra homomorphism sending is uniquely determined (since as -algebras, and a homomorphism out of this quotient ring is determined by the image of ). Hence there is a unique field embedding over with ; concretely agrees with the restriction of any to , since any such restricted to is an -embedding sending , and this embedding is unique. So every restricts to the same map on ; equivalently, writing for one fixed choice, every satisfies , so fixes pointwise, i.e. . The map is an injection (injective since is invertible), so
Since , the inductive hypothesis applies to : . Hence for every . Now (every sends to one of , and these sets are disjoint since they are indexed by the distinct value takes), so
using . This completes the induction.
∎Worked examples
Example 1: over — a genuinely asymmetric extension. Here is irreducible over (Eisenstein at ), so , and . By the theorem, any sends to a root in of the minimal polynomial . The three complex roots of are where is a primitive cube root of unity. But and are non-real (since and ), while . So the only root of actually lying in is itself. Hence any must send . Since and fixes and fixes , and every element of is a -polynomial expression in (namely ), fixes every element of . So . Therefore
This is a striking illustration that the inequality in the theorem is often strict: has a nontrivial degree but a trivial automorphism group, precisely because does not contain enough roots of the defining polynomial (it is not a splitting field, only contains one of three roots). This phenomenon — the group being too small to "see" the full symmetry of the polynomial — is exactly what the notion of a Galois Extension is built to rule out.
Example 2: over — the full splitting field. Now let be the splitting field of over , i.e. with , , so . First compute . We have as above. The minimal polynomial of over is (it is irreducible over since its roots are non-real, hence not in , hence it has no linear factor over , hence — being degree 2 — it is irreducible there). So , and by the tower law
By the theorem, . We now exhibit 6 distinct automorphisms, which forces equality. Any must send to a root of lying in — and now all three roots lie in , since contains both and . Likewise must send to a root of lying in , namely or (both already in ). Since , an -automorphism of is completely determined once we specify and , because every element of is a -polynomial combination of and . There are at most candidate pairs . We verify each is realized by an actual automorphism, by explicitly constructing the six maps as compositions of two basic automorphisms:
- : the field automorphism with , (a "rotation" of the roots of ).
- : the field automorphism with , (complex conjugation restricted to , since and conjugation fixes and swaps ).
That exist and are well-defined field automorphisms of follows from the isomorphism-extension theorem underlying Uniqueness of Splitting Fields: an assignment of each root of (resp. ) to a root of the same polynomial extends to an automorphism of the splitting field. One computes , , and the relation (check on generators: , and both sides fix appropriately). The six elements
are pairwise distinct (they act differently on the pair : e.g. sends for , distinguishing the first three, and multiplying by flips , distinguishing the last three from the first three). Hence , and combined with the theorem's bound , we get equality:
The isomorphism with is visible from the action on the three roots : acts as a 3-cycle, acts as a transposition (fixing , swapping ), and with these relations is exactly the presentation of (equivalently the dihedral group of order 6).
:::counterexample[Why finiteness of is needed] The theorem requires . Drop this hypothesis and the bound becomes meaningless or false in spirit, because it is possible for to be infinite while comparing cardinals loses all content, but more importantly the proof method itself breaks down: the induction on requires a well-founded finite descent, which is unavailable for infinite degree. Concretely, take and , wait — we need a field extension, so instead take , the algebraic closure of , with . Here . Yet is uncountably infinite (it contains, for instance, an automorphism swapping any two conjugate roots of any irreducible polynomial while fixing a chosen set of others, and by a Zorn's-lemma argument these can be combined in uncountably many consistent ways). There is no finite bound to state, and the inductive proof — which crucially used the strict decrease to invoke the inductive hypothesis on a smaller finite number — has no base case to anchor to and no well-ordering to descend along. Even more simply: take any field and a purely transcendental extension by an indeterminate . Then , and contains the map , whose powers for every integer give infinitely many distinct elements — again illustrating that without finiteness of , there is no meaningful finite bound, and the entire counting argument (which partitioned into finitely many finite pieces ) fails to terminate.
Scope, edge cases & common traps
| Situation | What happens | Why |
|---|---|---|
| finite | , always finite | Theorem above |
| infinite degree | No general finite bound | Induction has no base/descent |
| is not a splitting field | Bound often strict () | Not all roots of minimal polys lie in |
| is a splitting field of a separable polynomial | Bound is equality | Enough roots present, extension theorem applies fully |
| has characteristic , minimal poly inseparable | Bound can be strict even for splitting fields | Repeated roots reduce the count of embeddings |
The mathematician behind it
Origins · 1 minÉvariste Galois and how this was discovered
Galois was a French mathematician who, before dying at twenty in a duel, developed the theory of what we now call Galois groups to settle the ancient question of solvability of polynomial equations by radicals. Working largely outside the mainstream mathematical establishment of his day, and famously misunderstood or ignored by the leading academicians who reviewed his manuscripts, Galois introduced the idea that the symmetries permuting the roots of a polynomial — not the roots themselves — determine whether the equation can be solved using radicals. His insight that this symmetry group could be studied as an abstract algebraic object, independent of any particular formula, is the origin of group theory as a subject in its own right.
Is always the same as ?
In many textbooks the notation is used for the automorphism group of an arbitrary extension, while is reserved for the case when is a Galois extension (normal and separable), where the extra structure guarantees . Some sources use the two names interchangeably regardless of hypotheses. As shown in Example 1 of this article, when the extension is not Galois — such as — the automorphism group can be much smaller than the degree suggests, so the distinction in notation is a useful reminder to check whether the stronger equality actually holds.
Why must automorphisms send roots to roots of the same polynomial?
This follows directly from the defining property that fixes pointwise and respects field operations. If for a polynomial , applying the homomorphism to this equation only affects , because every coefficient of lies in and is therefore fixed by . Since respects addition and multiplication, the resulting equation reads . This is not a coincidence of any particular example — it is forced by the algebraic structure preserved by any homomorphism, and it is the reason the Galois group acts on the finite set of roots of a polynomial rather than on all of arbitrarily.
How does the Galois group act on roots, precisely?
If has distinct roots all lying in , each permutes the set , because sends each root to a root of the same polynomial and is injective. This gives a group homomorphism by recording which permutation each induces. If is generated over by these roots, this homomorphism is injective (an automorphism fixing all and all of fixes everything they generate), so embeds as a subgroup of — exactly what is seen in the example above.
Why is composition, rather than addition or multiplication in , the right group operation?
Automorphisms of are functions from to itself, and the natural way to combine two functions is to compose them: first apply one, then the other. This composite is again a bijective field homomorphism fixing , as proved in the lemma above, so is closed under composition. Addition or multiplication of two automorphisms as functions (pointwise) generally fails to produce another automorphism — for instance the pointwise sum of two field automorphisms typically is not even multiplicative — so composition, which respects the structural meaning of "apply one symmetry after another," is the operation that makes a group compatible with its role as a symmetry group.
What is the smallest example where is nontrivial?
The simplest nontrivial case is a quadratic extension, such as over . Here , and the nontrivial automorphism sends while fixing , extended to all of by ; one checks directly this respects addition and multiplication. Both roots of lie in , so this is already a splitting field, and , achieving equality — the simplest instance of a genuinely Galois extension.