The Galois Group of an Extension

Why do some polynomial equations submit to a formula? Others — like x5−x−1=0x^5 - x - 1 = 0 — provably do not. The answer is hidden not in the roots themselves. It lies in the symmetries relating them. Given a field extension K/FK/F, we can ask a key question. Which transformations of KK leave FF completely untouched? These transformations merely permute the elements of KK built from FF-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 KK that fix every element of FF. They form a group under composition. This group is called the Galois group of K/FK/F. It is written Aut(K/F)\mathrm{Aut}(K/F) or Gal(K/F)\mathrm{Gal}(K/F). When KK is the splitting field of a polynomial f(x)∈F[x]f(x) \in F[x], this group acts faithfully on the roots of ff. 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 Aut(K/F)\mathrm{Aut}(K/F) rigorously, and prove the fundamental bound ∣Aut(K/F)∣≤[K:F]|\mathrm{Aut}(K/F)| \le [K:F]. 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.

Key takeaways
  • Aut(K/F)\mathrm{Aut}(K/F) is the group of field automorphisms of KK that fix every element of FF pointwise.
  • Such an automorphism must send each root of a polynomial over FF to another root of the same polynomial.
  • The order of Aut(K/F)\mathrm{Aut}(K/F) never exceeds the degree [K:F][K:F]; equality is a special and important phenomenon.
  • Composing automorphisms and inverting them keeps you inside Aut(K/F)\mathrm{Aut}(K/F) — 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 Gal(Q‾/Q)\mathrm{Gal}(\overline{\mathbb{Q}}/\mathbb{Q}) 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 K=Q(23)⊂RK = \mathbb{Q}(\sqrt[3]{2}) \subset \mathbb{R} over F=QF=\mathbb{Q}, what is ∣Aut(K/F)∣|\mathrm{Aut}(K/F)|?]

  • 3, matching [K:F][K:F]
  • 1, since KK contains only one of the three roots of x3−2x^3-2 ✓
  • 6, since x3−2x^3-2 has three roots
  • Infinite

:::quiz[What is the key finiteness hypothesis in the theorem ∣Aut(K/F)∣≤[K:F]|\mathrm{Aut}(K/F)| \le [K:F]?]

  • FF must be algebraically closed
  • KK must be uncountable
  • [K:F][K:F] must be finite ✓
  • KK must equal FF

:::quiz[For the splitting field K=Q(23,ω)K=\mathbb{Q}(\sqrt[3]2,\omega) of x3−2x^3-2 over Q\mathbb{Q}, the Galois group is isomorphic to]

  • The trivial group
  • Z/6Z\mathbb{Z}/6\mathbb{Z}
  • S3S_3, of order 6 ✓
  • S5S_5

:::faq[Can Aut(K/F)\mathrm{Aut}(K/F) be trivial even when [K:F]>1[K:F]>1?] Yes, and this is common rather than exceptional. Whenever KK does not contain all the roots of the minimal polynomials of its generators over FF, many candidate images for a generator are simply unavailable inside KK, shrinking the group. The clean example is K=Q(23)K=\mathbb{Q}(\sqrt[3]2) over Q\mathbb{Q}: the only cube root of 2 lying in this real field is 23\sqrt[3]2 itself, forcing every automorphism to fix it, hence to be the identity. This is exactly the phenomenon that motivates requiring KK to be a splitting field (normality) when one wants the automorphism group to be as large as possible.

:::faq[Does the bound ∣Aut(K/F)∣≤[K:F]|\mathrm{Aut}(K/F)|\le [K:F] hold in every characteristic?] Yes, the inequality itself holds in every characteristic, including positive characteristic, as long as [K:F][K:F] 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 pp), the number of distinct roots is strictly less than the degree, and the equality ∣Aut(K/F)∣=[K:F]|\mathrm{Aut}(K/F)|=[K:F] 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?

DefinitionThe Automorphism Group Aut(K/F)\mathrm{Aut}(K/F)

Let K/FK/F be a field extension. An FF-automorphism of KK is a field automorphism

σ:K→K\sigma: K \to K

such that σ(a)=a\sigma(a) = a for every a∈Fa \in F. The set of all FF-automorphisms of KK is denoted

Aut(K/F):={σ:K→K∣σ is a field automorphism and σ∣F=idF}.\mathrm{Aut}(K/F) := \{\sigma : K \to K \mid \sigma \text{ is a field automorphism and } \sigma|_F = \mathrm{id}_F\}.

Under the operation of function composition, Aut(K/F)\mathrm{Aut}(K/F) is a group, called the Galois group of KK over FF (in some texts this name and notation Gal(K/F)\mathrm{Gal}(K/F) is reserved for the case when K/FK/F is additionally a Galois Extension; here we use Aut(K/F)\mathrm{Aut}(K/F) for the automorphism group of an arbitrary extension).

Intuition

Think of FF as a fixed floor and KK as a room built on top of it by adjoining new elements — typically roots of polynomials. An element σ∈Aut(K/F)\sigma \in \mathrm{Aut}(K/F) is a rigid motion of the room that leaves the floor perfectly still (every point of FF 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 α∈K\alpha \in K is a root of a polynomial f(x)∈F[x]f(x) \in F[x], applying σ\sigma to the equation f(α)=0f(\alpha) = 0 and using that σ\sigma fixes the coefficients of ff shows f(σ(α))=0f(\sigma(\alpha)) = 0 too. So σ\sigma can only move α\alpha 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 K=Q(23,ω)K = \mathbb{Q}(\sqrt[3]{2}, \omega) over F=QF = \mathbb{Q}, the splitting field of x3−2x^3 - 2, where ω=e2πi/3\omega = e^{2\pi i/3}. The three roots 23,ω23,ω223\sqrt[3]{2}, \omega\sqrt[3]{2}, \omega^2\sqrt[3]{2} sit at the vertices of an equilateral triangle in C\mathbb{C} (once we embed KK there), and automorphisms fixing Q\mathbb{Q} permute these three roots while respecting the field structure — visibly the symmetries of the triangle.

Figure
The three roots of x3−2x^3-2 in C\mathbb{C}, permuted by Aut(K/Q)\mathrm{Aut}(K/\mathbb{Q})
∛2 ω∛2 ω²∛2 σ Galois group ⊂ S₃ acting on the 3 roots

Central theorem

TheoremBound on the size of the Galois group

Let K/FK/F be a finite field extension, so [K:F]<∞[K:F] < \infty. Then Aut(K/F)\mathrm{Aut}(K/F) is a finite group, its operation is composition of functions, and

∣Aut(K/F)∣≤[K:F].|\mathrm{Aut}(K/F)| \le [K:F].

Moreover, if α∈K\alpha \in K has minimal polynomial mα(x)m_\alpha(x) over FF, then for every σ∈Aut(K/F)\sigma \in \mathrm{Aut}(K/F), σ(α)\sigma(\alpha) is also a root of mα(x)m_\alpha(x) lying in KK.

LemmaAut(K/F)\mathrm{Aut}(K/F) is a group

Let K/FK/F be any field extension. The set Aut(K/F)\mathrm{Aut}(K/F), under composition of functions, is a group.

Proof

We check the group axioms directly, using that field automorphisms of KK are bijections K→KK \to K respecting ++ and ⋅\cdot.

Closure. Let σ,τ∈Aut(K/F)\sigma, \tau \in \mathrm{Aut}(K/F). The composite σ∘τ\sigma \circ \tau is a bijection of KK (composite of bijections), and for x,y∈Kx,y \in K,

(στ)(x+y)=σ(τ(x)+τ(y))=σ(τ(x))+σ(τ(y))=(στ)(x)+(στ)(y),(\sigma\tau)(x+y) = \sigma(\tau(x)+\tau(y)) = \sigma(\tau(x)) + \sigma(\tau(y)) = (\sigma\tau)(x) + (\sigma\tau)(y),

and similarly (στ)(xy)=(στ)(x)(στ)(y)(\sigma\tau)(xy) = (\sigma\tau)(x)(\sigma\tau)(y), using that σ,τ\sigma,\tau each respect +,⋅+,\cdot. So στ\sigma\tau is a field automorphism of KK. For a∈Fa \in F, (στ)(a)=σ(τ(a))=σ(a)=a(\sigma\tau)(a) = \sigma(\tau(a)) = \sigma(a) = a, so στ\sigma\tau fixes FF pointwise. Hence στ∈Aut(K/F)\sigma\tau \in \mathrm{Aut}(K/F).

Identity. The identity map idK\mathrm{id}_K is a field automorphism fixing FF pointwise, so idK∈Aut(K/F)\mathrm{id}_K \in \mathrm{Aut}(K/F), and it is the identity for composition.

Inverses. Let σ∈Aut(K/F)\sigma \in \mathrm{Aut}(K/F). Since σ\sigma is a bijection, σ−1:K→K\sigma^{-1}: K \to K exists as a set-theoretic inverse. We check σ−1\sigma^{-1} is a field homomorphism: for x,y∈Kx, y \in K, write x=σ(x′)x = \sigma(x'), y=σ(y′)y = \sigma(y') for unique x′,y′∈Kx', y' \in K (possible since σ\sigma is bijective). Then

σ−1(x+y)=σ−1(σ(x′)+σ(y′))=σ−1(σ(x′+y′))=x′+y′=σ−1(x)+σ−1(y),\sigma^{-1}(x+y) = \sigma^{-1}(\sigma(x') + \sigma(y')) = \sigma^{-1}(\sigma(x'+y')) = x' + y' = \sigma^{-1}(x) + \sigma^{-1}(y),

using that σ\sigma preserves addition. The same argument with multiplication gives σ−1(xy)=σ−1(x)σ−1(y)\sigma^{-1}(xy) = \sigma^{-1}(x)\sigma^{-1}(y). So σ−1\sigma^{-1} is a field automorphism of KK. For a∈Fa \in F: since σ(a)=a\sigma(a) = a, applying σ−1\sigma^{-1} to both sides gives a=σ−1(a)a = \sigma^{-1}(a). So σ−1\sigma^{-1} fixes FF pointwise, hence σ−1∈Aut(K/F)\sigma^{-1} \in \mathrm{Aut}(K/F).

Associativity holds because composition of functions is always associative. All axioms hold, so Aut(K/F)\mathrm{Aut}(K/F) is a group under composition. ■\blacksquare

∎
Proof

We now prove the theorem itself, in two parts: the root-permutation claim, and the order bound. Both use induction on [K:F][K:F] and the Uniqueness of Splitting Fields machinery for extending isomorphisms.

Part 1: σ\sigma sends roots of mαm_\alpha to roots of mαm_\alpha. Let α∈K\alpha \in K with minimal polynomial mα(x)=xn+cn−1xn−1+⋯+c1x+c0∈F[x]m_\alpha(x) = x^n + c_{n-1}x^{n-1} + \cdots + c_1 x + c_0 \in F[x] over FF, so mα(α)=0m_\alpha(\alpha) = 0 and each ci∈Fc_i \in F. Let σ∈Aut(K/F)\sigma \in \mathrm{Aut}(K/F). Applying the field homomorphism σ\sigma to the equation

αn+cn−1αn−1+⋯+c1α+c0=0\alpha^n + c_{n-1}\alpha^{n-1} + \cdots + c_1\alpha + c_0 = 0

and using that σ\sigma respects addition, multiplication, and powers (a homomorphism satisfies σ(xy)=σ(x)σ(y)\sigma(xy)=\sigma(x)\sigma(y), hence σ(αk)=σ(α)k\sigma(\alpha^k) = \sigma(\alpha)^k by induction on kk), we get

σ(α)n+σ(cn−1)σ(α)n−1+⋯+σ(c1)σ(α)+σ(c0)=0.\sigma(\alpha)^n + \sigma(c_{n-1})\sigma(\alpha)^{n-1} + \cdots + \sigma(c_1)\sigma(\alpha) + \sigma(c_0) = 0.

Since each ci∈Fc_i \in F and σ\sigma fixes FF pointwise, σ(ci)=ci\sigma(c_i) = c_i. So

σ(α)n+cn−1σ(α)n−1+⋯+c1σ(α)+c0=0,\sigma(\alpha)^n + c_{n-1}\sigma(\alpha)^{n-1} + \cdots + c_1\sigma(\alpha) + c_0 = 0,

i.e., mα(σ(α))=0m_\alpha(\sigma(\alpha)) = 0. Since σ(α)∈K\sigma(\alpha) \in K (as σ:K→K\sigma: K \to K), σ(α)\sigma(\alpha) is a root of mα(x)m_\alpha(x) lying in KK. This proves Part 1.

Part 2: ∣Aut(K/F)∣≤[K:F]|\mathrm{Aut}(K/F)| \le [K:F]. We argue by strong induction on n=[K:F]n = [K:F]. Base case n=1n=1. Then K=FK = F, and any σ∈Aut(K/F)\sigma \in \mathrm{Aut}(K/F) fixes every element of F=KF = K, forcing σ=idK\sigma = \mathrm{id}_K. So ∣Aut(K/F)∣=1=[K:F]|\mathrm{Aut}(K/F)| = 1 = [K:F]. Inductive step. Suppose n=[K:F]>1n = [K:F] > 1 and the bound holds for all extensions of degree less than nn. Pick α∈K∖F\alpha \in K \setminus F, and let m(x)∈F[x]m(x) \in F[x] be its minimal polynomial over FF, of degree d=[F(α):F]>1d = [F(\alpha):F] > 1 (since α∉F\alpha \notin F). By the tower law,

[K:F]=[K:F(α)]⋅[F(α):F],so[K:F(α)]=n/d<n.[K:F] = [K:F(\alpha)]\cdot[F(\alpha):F], \quad\text{so}\quad [K:F(\alpha)] = n/d < n.

We bound ∣Aut(K/F)∣|\mathrm{Aut}(K/F)| by grouping its elements according to where they send α\alpha. By Part 1, for each σ∈Aut(K/F)\sigma \in \mathrm{Aut}(K/F), σ(α)\sigma(\alpha) is one of the roots of m(x)m(x) lying in KK; since mm has degree dd, it has at most dd roots in KK (a polynomial of degree dd over a field has at most dd roots in that field, or in any field containing it, since a field is an integral domain). Call these roots β1,…,βr∈K\beta_1, \dots, \beta_r \in K with r≤dr \le d. Fix one such root βi\beta_i. We claim the set

Si:={σ∈Aut(K/F):σ(α)=βi}S_i := \{\sigma \in \mathrm{Aut}(K/F) : \sigma(\alpha) = \beta_i\}

has ∣Si∣≤[K:F(α)]|S_i| \le [K:F(\alpha)]. Indeed, if SiS_i is nonempty, fix τ∈Si\tau \in S_i. Every FF-algebra homomorphism F(α)→KF(\alpha) \to K sending α↦βi\alpha \mapsto \beta_i is uniquely determined (since F(α)≅F[x]/(m(x))F(\alpha) \cong F[x]/(m(x)) as FF-algebras, and a homomorphism out of this quotient ring is determined by the image of xx). Hence there is a unique field embedding ιi:F(α)→K\iota_i: F(\alpha) \to K over FF with ιi(α)=βi\iota_i(\alpha) = \beta_i; concretely ιi\iota_i agrees with the restriction of any σ∈Si\sigma \in S_i to F(α)F(\alpha), since any such σ\sigma restricted to F(α)F(\alpha) is an FF-embedding sending α↦βi\alpha \mapsto \beta_i, and this embedding is unique. So every σ∈Si\sigma \in S_i restricts to the same map ιi\iota_i on F(α)F(\alpha); equivalently, writing τ∈Si\tau \in S_i for one fixed choice, every σ∈Si\sigma \in S_i satisfies σ∣F(α)=τ∣F(α)\sigma|_{F(\alpha)} = \tau|_{F(\alpha)}, so τ−1σ\tau^{-1}\sigma fixes F(α)F(\alpha) pointwise, i.e. τ−1σ∈Aut(K/F(α))\tau^{-1}\sigma \in \mathrm{Aut}(K/F(\alpha)). The map σ↦τ−1σ\sigma \mapsto \tau^{-1}\sigma is an injection Si↪Aut(K/F(α))S_i \hookrightarrow \mathrm{Aut}(K/F(\alpha)) (injective since τ\tau is invertible), so

∣Si∣≤∣Aut(K/F(α))∣.|S_i| \le |\mathrm{Aut}(K/F(\alpha))|.

Since [K:F(α)]<n[K:F(\alpha)] < n, the inductive hypothesis applies to K/F(α)K/F(\alpha): ∣Aut(K/F(α))∣≤[K:F(α)]=n/d|\mathrm{Aut}(K/F(\alpha))| \le [K:F(\alpha)] = n/d. Hence ∣Si∣≤n/d|S_i| \le n/d for every ii. Now Aut(K/F)=⋃i=1rSi\mathrm{Aut}(K/F) = \bigcup_{i=1}^r S_i (every σ\sigma sends α\alpha to one of β1,…,βr\beta_1,\dots,\beta_r, and these sets are disjoint since they are indexed by the distinct value σ(α)\sigma(\alpha) takes), so

∣Aut(K/F)∣=∑i=1r∣Si∣≤r⋅nd≤d⋅nd=n=[K:F],|\mathrm{Aut}(K/F)| = \sum_{i=1}^r |S_i| \le r \cdot \frac{n}{d} \le d \cdot \frac{n}{d} = n = [K:F],

using r≤dr \le d. This completes the induction. ■\blacksquare

∎

Worked examples

Example 1: K=Q(23)K = \mathbb{Q}(\sqrt[3]{2}) over F=QF = \mathbb{Q} — a genuinely asymmetric extension. Here x3−2x^3 - 2 is irreducible over Q\mathbb{Q} (Eisenstein at p=2p=2), so [Q(23):Q]=3[\mathbb{Q}(\sqrt[3]{2}):\mathbb{Q}] = 3, and Q(23)⊂R\mathbb{Q}(\sqrt[3]2) \subset \mathbb{R}. By the theorem, any σ∈Aut(K/Q)\sigma \in \mathrm{Aut}(K/\mathbb{Q}) sends α:=23\alpha := \sqrt[3]2 to a root in KK of the minimal polynomial x3−2x^3 - 2. The three complex roots of x3−2x^3-2 are α,ωα,ω2α\alpha, \omega\alpha, \omega^2\alpha where ω=e2πi/3\omega = e^{2\pi i/3} is a primitive cube root of unity. But ωα\omega\alpha and ω2α\omega^2\alpha are non-real (since ω∉R\omega \notin \mathbb{R} and α≠0\alpha \ne 0), while K=Q(23)⊂RK = \mathbb{Q}(\sqrt[3]2) \subset \mathbb{R}. So the only root of x3−2x^3-2 actually lying in KK is α\alpha itself. Hence any σ∈Aut(K/Q)\sigma \in \mathrm{Aut}(K/\mathbb{Q}) must send α↦α\alpha \mapsto \alpha. Since K=Q(α)K = \mathbb{Q}(\alpha) and σ\sigma fixes Q\mathbb{Q} and fixes α\alpha, and every element of KK is a Q\mathbb{Q}-polynomial expression in α\alpha (namely K={a+bα+cα2:a,b,c∈Q}K = \{a+b\alpha+c\alpha^2 : a,b,c \in \mathbb{Q}\}), σ\sigma fixes every element of KK. So σ=idK\sigma = \mathrm{id}_K. Therefore

Aut(K/Q)={id},∣Aut(K/Q)∣=1<3=[K:Q].\mathrm{Aut}(K/\mathbb{Q}) = \{\mathrm{id}\}, \qquad |\mathrm{Aut}(K/\mathbb{Q})| = 1 < 3 = [K:\mathbb{Q}].

This is a striking illustration that the inequality in the theorem is often strict: K/QK/\mathbb{Q} has a nontrivial degree but a trivial automorphism group, precisely because KK 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: K=Q(23,ω)K = \mathbb{Q}(\sqrt[3]{2}, \omega) over F=QF = \mathbb{Q} — the full splitting field. Now let KK be the splitting field of x3−2x^3-2 over Q\mathbb{Q}, i.e. K=Q(α,ω)K = \mathbb{Q}(\alpha, \omega) with α=23\alpha = \sqrt[3]2, ω=e2πi/3\omega = e^{2\pi i/3}, so ω2+ω+1=0\omega^2+\omega+1=0. First compute [K:Q][K:\mathbb{Q}]. We have [Q(α):Q]=3[\mathbb{Q}(\alpha):\mathbb{Q}]=3 as above. The minimal polynomial of ω\omega over Q(α)⊂R\mathbb{Q}(\alpha) \subset \mathbb{R} is x2+x+1x^2+x+1 (it is irreducible over Q(α)\mathbb{Q}(\alpha) since its roots ω,ω2\omega,\omega^2 are non-real, hence not in Q(α)\mathbb{Q}(\alpha), hence it has no linear factor over Q(α)\mathbb{Q}(\alpha), hence — being degree 2 — it is irreducible there). So [Q(α,ω):Q(α)]=2[\mathbb{Q}(\alpha,\omega):\mathbb{Q}(\alpha)] = 2, and by the tower law

[K:Q]=[K:Q(α)]⋅[Q(α):Q]=2⋅3=6.[K:\mathbb{Q}] = [K:\mathbb{Q}(\alpha)]\cdot[\mathbb{Q}(\alpha):\mathbb{Q}] = 2\cdot 3 = 6.

By the theorem, ∣Aut(K/Q)∣≤6|\mathrm{Aut}(K/\mathbb{Q})| \le 6. We now exhibit 6 distinct automorphisms, which forces equality. Any σ∈Aut(K/Q)\sigma \in \mathrm{Aut}(K/\mathbb{Q}) must send α\alpha to a root of x3−2x^3-2 lying in KK — and now all three roots α,ωα,ω2α\alpha, \omega\alpha, \omega^2\alpha lie in KK, since KK contains both α\alpha and ω\omega. Likewise σ\sigma must send ω\omega to a root of x2+x+1x^2+x+1 lying in KK, namely ω\omega or ω2\omega^2 (both already in KK). Since K=Q(α,ω)K = \mathbb{Q}(\alpha,\omega), an FF-automorphism of KK is completely determined once we specify σ(α)\sigma(\alpha) and σ(ω)\sigma(\omega), because every element of KK is a Q\mathbb{Q}-polynomial combination of α\alpha and ω\omega. There are at most 3×2=63 \times 2 = 6 candidate pairs (σ(α),σ(ω))(\sigma(\alpha), \sigma(\omega)). We verify each is realized by an actual automorphism, by explicitly constructing the six maps as compositions of two basic automorphisms:

  • τ\tau: the field automorphism with τ(α)=ωα\tau(\alpha) = \omega\alpha, τ(ω)=ω\tau(\omega) = \omega (a "rotation" of the roots of x3−2x^3-2).
  • ρ\rho: the field automorphism with ρ(α)=α\rho(\alpha) = \alpha, ρ(ω)=ω2\rho(\omega) = \omega^2 (complex conjugation restricted to KK, since K⊂CK\subset \mathbb{C} and conjugation fixes α∈R\alpha\in\mathbb R and swaps ω↔ωˉ=ω2\omega\leftrightarrow\bar\omega=\omega^2).

That τ,ρ\tau,\rho exist and are well-defined field automorphisms of KK follows from the isomorphism-extension theorem underlying Uniqueness of Splitting Fields: an assignment of each root of x3−2x^3-2 (resp. x2+x+1x^2+x+1) to a root of the same polynomial extends to an automorphism of the splitting field. One computes τ3=id\tau^3 = \mathrm{id}, ρ2=id\rho^2 = \mathrm{id}, and the relation ρτρ−1=τ−1\rho\tau\rho^{-1} = \tau^{-1} (check on generators: ρτρ−1(α)=ρτ(α)=ρ(ωα)=ω2α=τ−1(α)\rho\tau\rho^{-1}(\alpha) = \rho\tau(\alpha) = \rho(\omega\alpha) = \omega^2\alpha = \tau^{-1}(\alpha), and both sides fix ω\omega appropriately). The six elements

id,τ,τ2,ρ,ρτ,ρτ2\mathrm{id}, \tau, \tau^2, \rho, \rho\tau, \rho\tau^2

are pairwise distinct (they act differently on the pair (α,ω)(\alpha,\omega): e.g. τk\tau^k sends α↦ωkα\alpha \mapsto \omega^k\alpha for k=0,1,2k=0,1,2, distinguishing the first three, and multiplying by ρ\rho flips ω↦ω2\omega \mapsto \omega^2, distinguishing the last three from the first three). Hence ∣Aut(K/Q)∣≥6|\mathrm{Aut}(K/\mathbb{Q})| \ge 6, and combined with the theorem's bound ∣Aut(K/Q)∣≤6|\mathrm{Aut}(K/\mathbb{Q})| \le 6, we get equality:

Aut(K/Q)≅S3,∣Aut(K/Q)∣=6=[K:Q].\mathrm{Aut}(K/\mathbb{Q}) \cong S_3, \qquad |\mathrm{Aut}(K/\mathbb{Q})| = 6 = [K:\mathbb{Q}].

The isomorphism with S3S_3 is visible from the action on the three roots {α,ωα,ω2α}\{\alpha,\omega\alpha,\omega^2\alpha\}: τ\tau acts as a 3-cycle, ρ\rho acts as a transposition (fixing α\alpha, swapping ωα↔ω2α\omega\alpha \leftrightarrow \omega^2\alpha), and ⟨τ,ρ⟩\langle \tau,\rho\rangle with these relations is exactly the presentation of S3S_3 (equivalently the dihedral group of order 6).

:::counterexample[Why finiteness of [K:F][K:F] is needed] The theorem requires [K:F]<∞[K:F] < \infty. Drop this hypothesis and the bound ∣Aut(K/F)∣≤[K:F]|\mathrm{Aut}(K/F)|\le[K:F] becomes meaningless or false in spirit, because it is possible for ∣Aut(K/F)∣|\mathrm{Aut}(K/F)| to be infinite while comparing cardinals loses all content, but more importantly the proof method itself breaks down: the induction on [K:F][K:F] requires a well-founded finite descent, which is unavailable for infinite degree. Concretely, take F=QF = \mathbb{Q} and K=Q(x)K = \mathbb{Q}(x), wait — we need a field extension, so instead take K=Q‾K = \overline{\mathbb{Q}}, the algebraic closure of Q\mathbb{Q}, with F=QF=\mathbb{Q}. Here [K:F]=∞[K:F]=\infty. Yet Aut(K/F)\mathrm{Aut}(K/F) 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 [K:F(α)]<[K:F][K:F(\alpha)] < [K:F] 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 FF any field and K=F(t)K = F(t) a purely transcendental extension by an indeterminate tt. Then [K:F]=∞[K:F] = \infty, and Aut(K/F)\mathrm{Aut}(K/F) contains the map t↦t+1t \mapsto t+1, whose powers t↦t+nt \mapsto t+n for every integer nn give infinitely many distinct elements — again illustrating that without finiteness of [K:F][K:F], there is no meaningful finite bound, and the entire counting argument (which partitioned Aut(K/F)\mathrm{Aut}(K/F) into finitely many finite pieces SiS_i) fails to terminate.

Scope, edge cases & common traps

SituationWhat happensWhy
K/FK/F finite∣Aut(K/F)∣≤[K:F]|\mathrm{Aut}(K/F)| \le [K:F], always finiteTheorem above
K/FK/F infinite degreeNo general finite boundInduction has no base/descent
KK is not a splitting fieldBound often strict (<<)Not all roots of minimal polys lie in KK
KK is a splitting field of a separable polynomialBound is equalityEnough roots present, extension theorem applies fully
FF has characteristic pp, minimal poly inseparableBound can be strict even for splitting fieldsRepeated roots reduce the count of embeddings

The mathematician behind it

Origins · 1 minÉvariste Galois and how this was discovered
ÉG
Évariste Galois
1811–1832 · Revolutionary Paris, algebra of equations

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.

History
- 1829: Galois submits his first memoir on equation theory to the French Academy; it is lost by Cauchy.
- 1831: Galois submits a revised memoir; Poisson reports it as "incomprehensible," delaying recognition for years.
- 1832: Galois dies on May 31 from wounds sustained in a duel, having written down his results the night before.
- 1846: Liouville publishes Galois's papers in the Journal de Mathématiques Pures et Appliquées, bringing them to the wider mathematical community.
- 1870: Jordan's Traité des substitutions et des équations algébriques systematizes and popularizes Galois's group-theoretic methods.
Is Aut(K/F)\mathrm{Aut}(K/F) always the same as Gal(K/F)\mathrm{Gal}(K/F)?

In many textbooks the notation Aut(K/F)\mathrm{Aut}(K/F) is used for the automorphism group of an arbitrary extension, while Gal(K/F)\mathrm{Gal}(K/F) is reserved for the case when K/FK/F is a Galois extension (normal and separable), where the extra structure guarantees ∣Aut(K/F)∣=[K:F]|\mathrm{Aut}(K/F)| = [K:F]. 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 Q(23)/Q\mathbb{Q}(\sqrt[3]2)/\mathbb{Q} — 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 σ\sigma fixes FF pointwise and respects field operations. If m(α)=0m(\alpha)=0 for a polynomial m(x)∈F[x]m(x)\in F[x], applying the homomorphism σ\sigma to this equation only affects α\alpha, because every coefficient of mm lies in FF and is therefore fixed by σ\sigma. Since σ\sigma respects addition and multiplication, the resulting equation reads m(σ(α))=0m(\sigma(\alpha))=0. 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 KK arbitrarily.

How does the Galois group act on roots, precisely?

If f(x)∈F[x]f(x) \in F[x] has distinct roots α1,…,αn\alpha_1,\dots,\alpha_n all lying in KK, each σ∈Aut(K/F)\sigma \in \mathrm{Aut}(K/F) permutes the set {α1,…,αn}\{\alpha_1,\dots,\alpha_n\}, because σ\sigma sends each root to a root of the same polynomial and is injective. This gives a group homomorphism Aut(K/F)→Sn\mathrm{Aut}(K/F) \to S_n by recording which permutation each σ\sigma induces. If KK is generated over FF by these roots, this homomorphism is injective (an automorphism fixing all αi\alpha_i and all of FF fixes everything they generate), so Aut(K/F)\mathrm{Aut}(K/F) embeds as a subgroup of SnS_n — exactly what is seen in the S3S_3 example above.

Why is composition, rather than addition or multiplication in KK, the right group operation?

Automorphisms of KK are functions from KK 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 FF, as proved in the lemma above, so Aut(K/F)\mathrm{Aut}(K/F) 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 Aut(K/F)\mathrm{Aut}(K/F) a group compatible with its role as a symmetry group.

What is the smallest example where Aut(K/F)\mathrm{Aut}(K/F) is nontrivial?

The simplest nontrivial case is a quadratic extension, such as K=Q(2)K=\mathbb{Q}(\sqrt2) over F=QF=\mathbb{Q}. Here [K:F]=2[K:F]=2, and the nontrivial automorphism sends 2↦−2\sqrt2\mapsto -\sqrt2 while fixing Q\mathbb{Q}, extended to all of K={a+b2}K=\{a+b\sqrt2\} by σ(a+b2)=a−b2\sigma(a+b\sqrt2)=a-b\sqrt2; one checks directly this respects addition and multiplication. Both roots of x2−2x^2-2 lie in KK, so this is already a splitting field, and ∣Aut(K/F)∣=2=[K:F]|\mathrm{Aut}(K/F)|=2=[K:F], achieving equality — the simplest instance of a genuinely Galois extension.

Before this

Where this leads