Post 04 ended by building new fields: C=R[x]/(x2+1)\mathbb{C} = \mathbb{R}[x]/(x^2+1) and F4=F2[x]/(x2+x+1)\mathbb{F}_4 = \mathbb{F}_2[x]/(x^2+x+1). This post studies such constructions systematically. A bigger field EE containing FF is a vector space over FF, and its dimension, the degree, turns out to be a very strong invariant: a single divisibility argument proves that no ruler-and-compass construction doubles a cube or trisects a 60° angle. Galois theory then attaches to a polynomial a finite group, the permutations of its roots that respect all algebraic relations, and the Fundamental Theorem matches the subfields of the splitting field with the subgroups of that group. Everything from posts 01–04 comes together here: groups, normal subgroups and quotients, group actions, Sylow-type counting, irreducible polynomials and quotient rings. The chapter ends with the reason there is no quintic formula.

Series map: 00 Integers, Relations & Modular Arithmetic → 01 Groups & Subgroups → 02 Cosets, Lagrange & Quotient Groups → 03 Homomorphisms, Group Actions & Sylow → 04 Rings, Ideals & Fields → 05 Field Extensions & Galois Theory (this post).


Learning Outcome

  • Compute the degree of a field extension, and prove and use the tower law.
  • Find minimal polynomials, and prove that F(α)≅F[x]/(mα)F(\alpha) \cong F[x]/(m_\alpha) with degree deg⁡mα\deg m_\alpha.
  • Show that Q(2,3)\mathbb{Q}(\sqrt2, \sqrt3) has degree 4 and is generated by 2+3\sqrt2 + \sqrt3.
  • Prove that doubling the cube and trisecting a 60° angle are impossible with ruler and compass.
  • Build splitting fields, and prove that there is one finite field of each prime-power order, up to isomorphism.
  • Define separable, normal and Galois extensions and the Galois group.
  • State the Fundamental Theorem of Galois Theory and draw the subfield/subgroup lattices for Q(2,3)\mathbb{Q}(\sqrt2, \sqrt3) and for the splitting field of x3−2x^3 - 2.
  • Define solvable groups and outline why the roots of x5−4x+2x^5 - 4x + 2 cannot be written with radicals.

Chapter 1 — Field extensions and degree

Terminology

  • Extension — a pair of fields F⊆EF \subseteq E, written E/FE/F ("EE over FF"). FF is the base field.
  • Degree — [E:F]=dim⁡FE[E : F] = \dim_F E, the dimension of EE as a vector space over FF. The extension is finite if the degree is finite.
  • Generated extension — for α∈E\alpha \in E, F(α)F(\alpha) is the smallest subfield of EE containing FF and α\alpha. Likewise F(α1,…,αn)F(\alpha_1, \dots, \alpha_n). An extension F(α)/FF(\alpha)/F is simple and α\alpha is a primitive element.
  • Intermediate field — a field KK with F⊆K⊆EF \subseteq K \subseteq E.

Examples: [C:R]=2[\mathbb{C} : \mathbb{R}] = 2 with basis 1,i1, i. [Q(2):Q]=2[\mathbb{Q}(\sqrt2) : \mathbb{Q}] = 2 with basis 1,21, \sqrt2, since Q(2)={a+b2:a,b∈Q}\mathbb{Q}(\sqrt2) = \{a + b\sqrt2 : a, b \in \mathbb{Q}\} and 2∉Q\sqrt2 \notin \mathbb{Q}. [R:Q][\mathbb{R} : \mathbb{Q}] is infinite (a countable field cannot span the uncountable R\mathbb{R} with finitely many vectors). A field with qq elements that contains Fp\mathbb{F}_p has q=pnq = p^n where n=[E:Fp]n = [E : \mathbb{F}_p], because an nn-dimensional vector space over Fp\mathbb{F}_p has pnp^n elements.

The tower law

Theorem (tower law). If F⊆K⊆EF \subseteq K \subseteq E are fields, then

[E:F]=[E:K] [K:F],[E : F] = [E : K]\,[K : F],

in the sense that the left side is finite exactly when both factors are, and then equality holds.

Proof (finite case). Let α1,…,αm\alpha_1, \dots, \alpha_m be a basis of KK over FF and β1,…,βn\beta_1, \dots, \beta_n a basis of EE over KK. The claim is that the mnmn products αiβj\alpha_i\beta_j form a basis of EE over FF.

  • Spanning. Any e∈Ee \in E is ∑jkjβj\sum_j k_j \beta_j with kj∈Kk_j \in K, and each kj=∑ifijαik_j = \sum_i f_{ij}\alpha_i with fij∈Ff_{ij} \in F. So e=∑i,jfij αiβje = \sum_{i,j} f_{ij}\,\alpha_i\beta_j.
  • Independence. If ∑i,jfijαiβj=0\sum_{i,j} f_{ij}\alpha_i\beta_j = 0, regroup as ∑j(∑ifijαi)βj=0\sum_j \big(\sum_i f_{ij}\alpha_i\big)\beta_j = 0. The inner sums are in KK and the βj\beta_j are independent over KK, so each inner sum is 00. The αi\alpha_i are independent over FF, so every fij=0f_{ij} = 0. ∎

Corollaries. (1) If KK is intermediate in a finite extension E/FE/F, then [K:F][K : F] divides [E:F][E : F]. (2) If [E:F][E : F] is prime, there is no intermediate field other than FF and EE. (3) If α∈E\alpha \in E, then [F(α):F][F(\alpha) : F] divides [E:F][E : F].

Trick: most degree computations are "bound above by a tower, bound below by divisibility". If [K:F]=2[K : F] = 2 and [L:F]=3[L : F] = 3 are both inside EE, then 6∣[E:F]6 \mid [E : F].


Chapter 2 — Algebraic elements and minimal polynomials

Terminology

  • Algebraic — α∈E\alpha \in E is algebraic over FF if f(α)=0f(\alpha) = 0 for some nonzero f∈F[x]f \in F[x]. Otherwise α\alpha is transcendental over FF.
  • Algebraic extension — every element of EE is algebraic over FF.
  • Minimal polynomial — the monic polynomial mα∈F[x]m_\alpha \in F[x] of least degree with mα(α)=0m_\alpha(\alpha) = 0.

2\sqrt2, ii, 23\sqrt[3]{2} and e2πi/5e^{2\pi i/5} are algebraic over Q\mathbb{Q}. Hermite proved in 1873 that ee is transcendental and Lindemann in 1882 that π\pi is transcendental; both proofs are analytic and are not needed below.

The minimal polynomial

Theorem. Let α\alpha be algebraic over FF. Then:

  1. mαm_\alpha exists, is unique, and is irreducible over FF;
  2. for f∈F[x]f \in F[x]: f(α)=0f(\alpha) = 0 if and only if mα∣fm_\alpha \mid f;
  3. F(α)≅F[x]/(mα)F(\alpha) \cong F[x]/(m_\alpha), so [F(α):F]=deg⁡mα[F(\alpha) : F] = \deg m_\alpha, with basis 1,α,…,αn−11, \alpha, \dots, \alpha^{n-1} where n=deg⁡mαn = \deg m_\alpha.

Proof. Evaluation evα:F[x]→E\mathrm{ev}_\alpha : F[x] \to E, f↦f(α)f \mapsto f(\alpha), is a ring homomorphism. Its kernel II is nonzero because α\alpha is algebraic, and F[x]F[x] is a PID (post 04), so I=(m)I = (m) for a unique monic mm; this mm has least degree among nonzero elements of II, so m=mαm = m_\alpha, and statement 2 is "f∈I  ⟺  mα∣ff \in I \iff m_\alpha \mid f". The image of evα\mathrm{ev}_\alpha is a subring of the field EE, hence a domain, so by the First Isomorphism Theorem F[x]/(mα)F[x]/(m_\alpha) is a domain: (mα)(m_\alpha) is prime, so mαm_\alpha is irreducible. Then (mα)(m_\alpha) is maximal (post 04, Chapter 6), so the image F[α]F[\alpha] is a field containing FF and α\alpha; it is therefore F(α)F(\alpha). The basis claim is the division algorithm: every class has a unique representative of degree <n< n. ∎

So to find [F(α):F][F(\alpha) : F]: find a polynomial with root α\alpha and prove it irreducible with the tests of post 04.

Common pitfall: the minimal polynomial depends on the base field. m2m_{\sqrt2} over Q\mathbb{Q} is x2−2x^2 - 2; over R\mathbb{R} it is x−2x - \sqrt2.

Arithmetic in Q(23)\mathbb{Q}(\sqrt[3]{2}). Let a=23a = \sqrt[3]{2}, with ma=x3−2m_a = x^3 - 2 (Eisenstein at 2), so [Q(a):Q]=3[\mathbb{Q}(a) : \mathbb{Q}] = 3 with basis 1,a,a21, a, a^2. To invert 1+a1 + a, use (1+a)(1−a+a2)=1+a3=3(1 + a)(1 - a + a^2) = 1 + a^3 = 3:

11+23=1−23+433.\frac{1}{1 + \sqrt[3]{2}} = \frac{1 - \sqrt[3]{2} + \sqrt[3]{4}}{3}.

Finite implies algebraic. If [E:F]=n[E : F] = n and α∈E\alpha \in E, the n+1n + 1 elements 1,α,…,αn1, \alpha, \dots, \alpha^n are linearly dependent over FF, and a dependence relation is a nonzero polynomial with root α\alpha. Consequently, if α\alpha and β\beta are algebraic then F(α,β)F(\alpha, \beta) is finite (tower law), so α±β\alpha \pm \beta, αβ\alpha\beta and α/β\alpha/\beta are algebraic too: the algebraic numbers form a field.

Worked example: Q(√2, √3)

Degree. [Q(2):Q]=2[\mathbb{Q}(\sqrt2) : \mathbb{Q}] = 2. Next, 3∉Q(2)\sqrt3 \notin \mathbb{Q}(\sqrt2): if (a+b2)2=3(a + b\sqrt2)^2 = 3 with a,b∈Qa, b \in \mathbb{Q}, then a2+2b2=3a^2 + 2b^2 = 3 and 2ab=02ab = 0. b=0b = 0 gives a2=3a^2 = 3 and a=0a = 0 gives b2=3/2b^2 = 3/2, neither possible in Q\mathbb{Q}. So x2−3x^2 - 3 stays irreducible over Q(2)\mathbb{Q}(\sqrt2), and by the tower law

[Q(2,3):Q]=[Q(2,3):Q(2)] [Q(2):Q]=2⋅2=4,[\mathbb{Q}(\sqrt2, \sqrt3) : \mathbb{Q}] = [\mathbb{Q}(\sqrt2, \sqrt3) : \mathbb{Q}(\sqrt2)]\,[\mathbb{Q}(\sqrt2) : \mathbb{Q}] = 2 \cdot 2 = 4,

with basis 1,2,3,61, \sqrt2, \sqrt3, \sqrt6 (products of the two bases, as in the proof of the tower law).

A primitive element. Let θ=2+3\theta = \sqrt2 + \sqrt3. Then θ2=5+26\theta^2 = 5 + 2\sqrt6, so (θ2−5)2=24(\theta^2 - 5)^2 = 24, that is

θ4−10θ2+1=0.\theta^4 - 10\theta^2 + 1 = 0.

Also θ3=112+93\theta^3 = 11\sqrt2 + 9\sqrt3, which gives 2=(θ3−9θ)/2\sqrt2 = (\theta^3 - 9\theta)/2 and 3=(11θ−θ3)/2\sqrt3 = (11\theta - \theta^3)/2. So Q(θ)\mathbb{Q}(\theta) contains 2\sqrt2 and 3\sqrt3, hence Q(θ)=Q(2,3)\mathbb{Q}(\theta) = \mathbb{Q}(\sqrt2, \sqrt3) has degree 4. A degree-4 monic polynomial with root θ\theta must then be the minimal polynomial: mθ=x4−10x2+1m_\theta = x^4 - 10x^2 + 1, irreducible over Q\mathbb{Q} (its four roots are ±2±3\pm\sqrt2 \pm \sqrt3).

This is an instance of the primitive element theorem: every finite separable extension (Chapter 5; in particular every finite extension of Q\mathbb{Q}) is simple.


Chapter 3 — Ruler and compass

Start with the points 00 and 11 in the plane C\mathbb{C}. A ruler draws the line through two constructed points; a compass draws a circle with a constructed centre through a constructed point. New points are intersections of lines and circles. A real number is constructible if it is a coordinate of a constructible point.

Key observation. If all points so far have coordinates in a field KK, then:

  • the intersection of two lines solves a linear system, so it has coordinates in KK;
  • an intersection involving a circle solves a quadratic equation over KK, so it has coordinates in KK or in some K(d)K(\sqrt d) with d∈Kd \in K, an extension of degree 2.

Theorem. If α\alpha is constructible, then [Q(α):Q][\mathbb{Q}(\alpha) : \mathbb{Q}] is a power of 2.

Proof. By the observation, α\alpha lies in the top field of a tower Q=K0⊂K1⊂⋯⊂Kr\mathbb{Q} = K_0 \subset K_1 \subset \cdots \subset K_r with each [Ki+1:Ki]=2[K_{i+1} : K_i] = 2. By the tower law [Kr:Q]=2r[K_r : \mathbb{Q}] = 2^r, and [Q(α):Q][\mathbb{Q}(\alpha) : \mathbb{Q}] divides it. ∎

Doubling the cube. A cube of volume 2 needs side 23\sqrt[3]{2}, whose minimal polynomial x3−2x^3 - 2 has degree 3. Not a power of 2, so impossible.

Trisecting 60°. A 60° angle is constructible (equilateral triangle). Trisecting it means constructing c=cos⁡20∘c = \cos 20^\circ. From cos⁡3θ=4cos⁡3θ−3cos⁡θ\cos 3\theta = 4\cos^3\theta - 3\cos\theta with θ=20∘\theta = 20^\circ and cos⁡60∘=12\cos 60^\circ = \tfrac12:

4c3−3c=12⟺8c3−6c−1=0.4c^3 - 3c = \tfrac12 \quad\Longleftrightarrow\quad 8c^3 - 6c - 1 = 0.

By the rational root test, a rational root would be one of ±1,±12,±14,±18\pm1, \pm\tfrac12, \pm\tfrac14, \pm\tfrac18; substituting gives 1,−3,−3,1,−198,38,−11164,−17641, -3, -3, 1, -\tfrac{19}{8}, \tfrac38, -\tfrac{111}{64}, -\tfrac{17}{64}, never 00. A cubic without rational roots is irreducible, so [Q(c):Q]=3[\mathbb{Q}(c) : \mathbb{Q}] = 3 and the trisection is impossible. (Some angles, such as 90°, can be trisected; the theorem is that no method works for every angle.)

Squaring the circle. A square of area π\pi needs side π\sqrt\pi. If π\sqrt\pi were constructible it would be algebraic, so π\pi would be algebraic, contradicting Lindemann.

Watch out: "degree a power of 2" is necessary, not sufficient. The exact criterion is that the splitting field of the minimal polynomial has degree a power of 2. The Gauss–Wantzel theorem answers the polygon question: a regular nn-gon is constructible if and only if nn is a power of 2 times a product of distinct Fermat primes 3,5,17,257,655373, 5, 17, 257, 65537.


Chapter 4 — Splitting fields and finite fields

Splitting fields

A splitting field of a nonconstant f∈F[x]f \in F[x] is an extension E/FE/F in which ff factors into linear factors, f=c(x−α1)⋯(x−αn)f = c(x - \alpha_1)\cdots(x - \alpha_n), and which is generated by the roots: E=F(α1,…,αn)E = F(\alpha_1, \dots, \alpha_n).

Theorem. Every nonconstant f∈F[x]f \in F[x] has a splitting field EE, with [E:F]≤n![E : F] \le n! where n=deg⁡fn = \deg f. Any two splitting fields of ff over FF are isomorphic by an isomorphism that fixes FF.

(Existence: take an irreducible factor pp of ff; in F[x]/(p)F[x]/(p) it has a root (post 04), so ff gains a linear factor over an extension of degree ≤n\le n; repeat on the quotient, whose degree is n−1n - 1. Uniqueness is proved by the same induction, extending an isomorphism one root at a time.)

Examples:

  • x2−2x^2 - 2 over Q\mathbb{Q}: splitting field Q(2)\mathbb{Q}(\sqrt2), degree 2.
  • x4−10x2+1x^4 - 10x^2 + 1: roots ±2±3\pm\sqrt2 \pm \sqrt3, splitting field Q(2,3)\mathbb{Q}(\sqrt2, \sqrt3), degree 4.
  • x3−2x^3 - 2: roots α\alpha, αω\alpha\omega, αω2\alpha\omega^2 with α=23\alpha = \sqrt[3]{2} and ω=e2πi/3\omega = e^{2\pi i/3}, a root of x2+x+1x^2 + x + 1. The splitting field is E=Q(α,ω)E = \mathbb{Q}(\alpha, \omega) (it contains ω=αω/α\omega = \alpha\omega/\alpha). [Q(α):Q]=3[\mathbb{Q}(\alpha) : \mathbb{Q}] = 3, and ω∉Q(α)⊂R\omega \notin \mathbb{Q}(\alpha) \subset \mathbb{R}, so [E:Q(α)]=2[E : \mathbb{Q}(\alpha)] = 2. Hence [E:Q]=6=3![E : \mathbb{Q}] = 6 = 3!, the maximum.

Finite fields

Let EE be a finite field. Its characteristic is a prime pp (post 04), so it contains Fp\mathbb{F}_p and has pnp^n elements, n=[E:Fp]n = [E : \mathbb{F}_p].

Lemma (freshman's dream). In a commutative ring of characteristic pp, (a+b)p=ap+bp(a + b)^p = a^p + b^p.

Proof. Expand with the binomial theorem. For 0<k<p0 < k < p, (pk)=p!k!(p−k)!\binom{p}{k} = \frac{p!}{k!(p-k)!} is divisible by pp: pp divides the numerator but not the denominator. So all middle terms vanish. ∎

Hence the Frobenius map Fr(a)=ap\mathrm{Fr}(a) = a^p is a ring homomorphism. On a field it is injective (post 04: homomorphisms out of fields are injective), so on a finite field it is an automorphism, and it fixes exactly the elements of Fp\mathbb{F}_p (the roots of xp−xx^p - x; there are at most pp of them, and all of Fp\mathbb{F}_p qualifies by Fermat's little theorem from post 00).

Theorem (existence and uniqueness of finite fields). For every prime pp and n≥1n \ge 1 there is a field with q=pnq = p^n elements, and any two such fields are isomorphic. It is written Fq\mathbb{F}_q.

Proof. Existence. Let EE be a splitting field of g=xq−xg = x^q - x over Fp\mathbb{F}_p, and SS the set of roots of gg in EE. The derivative g′=qxq−1−1=−1g' = qx^{q-1} - 1 = -1 has no common root with gg, so the roots are distinct and ∣S∣=q|S| = q. SS is a subfield: if aq=aa^q = a and bq=bb^q = b, then (a+b)q=aq+bq=a+b(a + b)^q = a^q + b^q = a + b (apply the lemma nn times), (ab)q=ab(ab)^q = ab, and (a−1)q=a−1(a^{-1})^q = a^{-1}. A subfield containing all roots is the whole splitting field, so E=SE = S has qq elements.

Uniqueness. In any field KK with qq elements, the multiplicative group has order q−1q - 1, so aq−1=1a^{q-1} = 1 for a≠0a \ne 0 by Lagrange, and aq=aa^q = a for all aa. So KK consists of the qq roots of xq−xx^q - x, and is a splitting field of xq−xx^q - x over Fp\mathbb{F}_p. Splitting fields are unique up to isomorphism. ∎

Two further facts, stated without proof: the multiplicative group Fq×\mathbb{F}_q^\times is cyclic (post 04's F8\mathbb{F}_8 table showed a generator), and Fpd\mathbb{F}_{p^d} sits inside Fpn\mathbb{F}_{p^n} exactly when d∣nd \mid n.

Worked example. Over F2\mathbb{F}_2:

x4−x=x (x+1) (x2+x+1),x8−x=x (x+1) (x3+x+1) (x3+x2+1).\begin{aligned} x^4 - x &= x\,(x + 1)\,(x^2 + x + 1), \\ x^8 - x &= x\,(x + 1)\,(x^3 + x + 1)\,(x^3 + x^2 + 1). \end{aligned}

The first line lists the minimal polynomials of the 4 elements of F4\mathbb{F}_4; the second those of the 8 elements of F8\mathbb{F}_8. The two cubics are the two irreducible cubics over F2\mathbb{F}_2, each with three roots in F8\mathbb{F}_8. No quadratic appears in the second line, matching 2∤32 \nmid 3: F4⊈F8\mathbb{F}_4 \not\subseteq \mathbb{F}_8.


Chapter 5 — Galois extensions and the Galois group

Terminology

  • FF-automorphism of EE — a field automorphism σ:E→E\sigma : E \to E with σ(a)=a\sigma(a) = a for every a∈Fa \in F. They form a group Aut⁡(E/F)\operatorname{Aut}(E/F).
  • Fixed field — for a subgroup H≤Aut⁡(E)H \le \operatorname{Aut}(E), EH={e∈E:σ(e)=e for all σ∈H}E^H = \{ e \in E : \sigma(e) = e \text{ for all } \sigma \in H \}.
  • Separable polynomial — one with no repeated root in its splitting field. An algebraic extension is separable if every minimal polynomial is separable.
  • Normal extension — an algebraic E/FE/F such that every irreducible polynomial in F[x]F[x] with one root in EE splits completely in EE.
  • Galois extension — a finite extension that is normal and separable. Its Galois group is Gal⁡(E/F)=Aut⁡(E/F)\operatorname{Gal}(E/F) = \operatorname{Aut}(E/F).
  • Galois group of a polynomial — Gal⁡(E/F)\operatorname{Gal}(E/F) for EE a splitting field of the (separable) polynomial.

Separability is automatic in the cases you meet most. Over a field of characteristic 0, and over any finite field, every irreducible polynomial is separable. (An irreducible ff has a repeated root only if gcd⁡(f,f′)≠1\gcd(f, f') \ne 1, which forces f′=0f' = 0; in characteristic 0 that is impossible for nonconstant ff.) The standard inseparable example is xp−tx^p - t over the field Fp(t)\mathbb{F}_p(t) of rational functions: it is irreducible (Eisenstein at the prime tt), but over its splitting field it equals (x−t1/p)p(x - t^{1/p})^p.

Automorphisms permute roots

Lemma. If f∈F[x]f \in F[x], α∈E\alpha \in E is a root of ff, and σ∈Aut⁡(E/F)\sigma \in \operatorname{Aut}(E/F), then σ(α)\sigma(\alpha) is a root of ff.

Proof. If f=∑ckxkf = \sum c_k x^k with ck∈Fc_k \in F, then f(σ(α))=∑ckσ(α)k=σ(∑ckαk)=σ(0)=0f(\sigma(\alpha)) = \sum c_k \sigma(\alpha)^k = \sigma\big(\sum c_k\alpha^k\big) = \sigma(0) = 0, since σ\sigma fixes each ckc_k. ∎

So if E=F(α1,…,αn)E = F(\alpha_1, \dots, \alpha_n) is a splitting field of ff, an FF-automorphism is determined by how it permutes α1,…,αn\alpha_1, \dots, \alpha_n, and Aut⁡(E/F)\operatorname{Aut}(E/F) is (isomorphic to) a subgroup of SnS_n, an action on the roots in the sense of post 03.

Theorem (characterisations of Galois extensions). For a finite extension E/FE/F the following are equivalent:

  1. E/FE/F is Galois (normal and separable);
  2. EE is the splitting field over FF of a separable polynomial;
  3. ∣Aut⁡(E/F)∣=[E:F]\lvert\operatorname{Aut}(E/F)\rvert = [E : F];
  4. the fixed field of Aut⁡(E/F)\operatorname{Aut}(E/F) is exactly FF.

In general ∣Aut⁡(E/F)∣≤[E:F]\lvert\operatorname{Aut}(E/F)\rvert \le [E : F] and equality is what "Galois" means in practice.

Examples.

  • Gal⁡(C/R)={id,complex conjugation}≅Z/2Z\operatorname{Gal}(\mathbb{C}/\mathbb{R}) = \{\mathrm{id}, \text{complex conjugation}\} \cong \mathbb{Z}/2\mathbb{Z}.
  • Q(23)/Q\mathbb{Q}(\sqrt[3]{2})/\mathbb{Q} is not Galois. An automorphism must send 23\sqrt[3]{2} to a root of x3−2x^3 - 2 inside Q(23)⊂R\mathbb{Q}(\sqrt[3]{2}) \subset \mathbb{R}, and the only real root is 23\sqrt[3]{2} itself. So Aut⁡\operatorname{Aut} is trivial, of order 1<31 < 3. It fails normality: x3−2x^3 - 2 has one root in the field but does not split there.
  • Gal⁡(Fpn/Fp)\operatorname{Gal}(\mathbb{F}_{p^n}/\mathbb{F}_p) is cyclic of order nn, generated by Frobenius. (Frk\mathrm{Fr}^k fixes exactly the roots of xpk−xx^{p^k} - x, so Fr\mathrm{Fr} has order exactly nn; and the group has order [Fpn:Fp]=n[\mathbb{F}_{p^n} : \mathbb{F}_p] = n because Fpn\mathbb{F}_{p^n} is the splitting field of the separable xpn−xx^{p^n} - x.)

Chapter 6 — The Fundamental Theorem of Galois Theory

Theorem (Fundamental Theorem of Galois Theory). Let E/FE/F be a finite Galois extension with group G=Gal⁡(E/F)G = \operatorname{Gal}(E/F). Then the maps

H⟼EHandK⟼Gal⁡(E/K)H \longmapsto E^H \qquad\text{and}\qquad K \longmapsto \operatorname{Gal}(E/K)

are mutually inverse bijections between subgroups H≤GH \le G and intermediate fields F⊆K⊆EF \subseteq K \subseteq E, and:

  1. they reverse inclusion: H1≤H2H_1 \le H_2 if and only if EH1⊇EH2E^{H_1} \supseteq E^{H_2};
  2. degrees match indices: [E:EH]=∣H∣[E : E^H] = |H| and [EH:F]=[G:H][E^H : F] = [G : H];
  3. K/FK/F is Galois if and only if Gal⁡(E/K)\operatorname{Gal}(E/K) is a normal subgroup of GG, and then Gal⁡(K/F)≅G/Gal⁡(E/K)\operatorname{Gal}(K/F) \cong G / \operatorname{Gal}(E/K).

So the lattice of intermediate fields is the lattice of subgroups turned upside down: the big field EE matches the trivial group, the base FF matches all of GG. Part 3 is where normal subgroups and quotient groups (post 02) acquire their original meaning.

Worked example 1: Q(√2, √3)

E=Q(2,3)E = \mathbb{Q}(\sqrt2, \sqrt3) is the splitting field of the separable (x2−2)(x2−3)(x^2 - 2)(x^2 - 3), so it is Galois of degree 4 and GG has 4 elements. Each automorphism sends 2↦±2\sqrt2 \mapsto \pm\sqrt2 and 3↦±3\sqrt3 \mapsto \pm\sqrt3, and all four sign choices occur. Let

σ:2↦−2, 3↦3,τ:2↦2, 3↦−3.\sigma : \sqrt2 \mapsto -\sqrt2,\ \sqrt3 \mapsto \sqrt3, \qquad \tau : \sqrt2 \mapsto \sqrt2,\ \sqrt3 \mapsto -\sqrt3.

Each has order 2 and they commute, so G={id,σ,τ,στ}≅Z/2×Z/2G = \{\mathrm{id}, \sigma, \tau, \sigma\tau\} \cong \mathbb{Z}/2 \times \mathbb{Z}/2. The subgroups and their fixed fields:

Subgroup Order Fixed field Degree over Q\mathbb{Q}
{id}\{\mathrm{id}\} 1 Q(2,3)\mathbb{Q}(\sqrt2, \sqrt3) 4
⟨σ⟩\langle\sigma\rangle 2 Q(3)\mathbb{Q}(\sqrt3) 2
⟨τ⟩\langle\tau\rangle 2 Q(2)\mathbb{Q}(\sqrt2) 2
⟨στ⟩\langle\sigma\tau\rangle 2 Q(6)\mathbb{Q}(\sqrt6) 2
GG 4 Q\mathbb{Q} 1

(στ(6)=(−2)(−3)=6\sigma\tau(\sqrt6) = (-\sqrt2)(-\sqrt3) = \sqrt6.) By the theorem these are all the intermediate fields: exactly three quadratic subfields, which is not obvious without Galois theory. GG is abelian, so every subgroup is normal and every intermediate field is Galois over Q\mathbb{Q}.

Worked example 2: the splitting field of x³ − 2

E=Q(α,ω)E = \mathbb{Q}(\alpha, \omega) with α=23\alpha = \sqrt[3]{2}, of degree 6 (Chapter 4). It is Galois, so ∣G∣=6|G| = 6, and GG acts on the three roots α,αω,αω2\alpha, \alpha\omega, \alpha\omega^2, so GG is a subgroup of S3S_3 of order 6: G≅S3G \cong S_3. Concretely an automorphism is fixed by α↦αωa\alpha \mapsto \alpha\omega^a (a∈{0,1,2}a \in \{0, 1, 2\}) and ω↦ω\omega \mapsto \omega or ω2\omega^2. Let

σ:α↦αω, ω↦ω(order 3),τ:α↦α, ω↦ω2(complex conjugation, order 2).\sigma : \alpha \mapsto \alpha\omega,\ \omega \mapsto \omega \quad(\text{order } 3), \qquad \tau : \alpha \mapsto \alpha,\ \omega \mapsto \omega^2 \quad(\text{complex conjugation, order } 2).

Composing right to left (apply τ\tau first in στ\sigma\tau): στ\sigma\tau sends α↦αω\alpha \mapsto \alpha\omega and ω↦ω2\omega \mapsto \omega^2, so στ(αω2)=αω⋅ω4=αω2\sigma\tau(\alpha\omega^2) = \alpha\omega \cdot \omega^4 = \alpha\omega^2. Similarly σ2τ\sigma^2\tau fixes αω\alpha\omega. The six subgroups of S3S_3 and their fixed fields:

Subgroup Order Normal? Fixed field Degree over Q\mathbb{Q}
{id}\{\mathrm{id}\} 1 yes Q(α,ω)\mathbb{Q}(\alpha, \omega) 6
⟨τ⟩\langle\tau\rangle 2 no Q(α)\mathbb{Q}(\alpha) 3
⟨στ⟩\langle\sigma\tau\rangle 2 no Q(αω2)\mathbb{Q}(\alpha\omega^2) 3
⟨σ2τ⟩\langle\sigma^2\tau\rangle 2 no Q(αω)\mathbb{Q}(\alpha\omega) 3
⟨σ⟩=A3\langle\sigma\rangle = A_3 3 yes Q(ω)\mathbb{Q}(\omega) 2
S3S_3 6 yes Q\mathbb{Q} 1

Each order-2 subgroup fixes one real or complex cube root, so its fixed field contains that root; the degree count [G:H]=3=[Q(αωk):Q][G : H] = 3 = [\mathbb{Q}(\alpha\omega^k) : \mathbb{Q}] makes it equal to Q(αωk)\mathbb{Q}(\alpha\omega^k). σ\sigma fixes ω\omega, and [G:⟨σ⟩]=2=[Q(ω):Q][G : \langle\sigma\rangle] = 2 = [\mathbb{Q}(\omega) : \mathbb{Q}].

The Galois correspondence for the splitting field of x cubed minus 2: the subfield lattice from Q up to Q(alpha, omega) drawn beside the subgroup lattice of S3 turned upside down, with matching fields and subgroups in the same position

Part 3 of the theorem, checked on this example: A3=⟨σ⟩A_3 = \langle\sigma\rangle is normal, and Q(ω)\mathbb{Q}(\omega) is Galois over Q\mathbb{Q} (it is the splitting field of x2+x+1x^2 + x + 1), with Gal⁡(Q(ω)/Q)≅S3/A3≅Z/2\operatorname{Gal}(\mathbb{Q}(\omega)/\mathbb{Q}) \cong S_3/A_3 \cong \mathbb{Z}/2. The three subgroups of order 2 are not normal (they are conjugate, like the three Sylow 2-subgroups of S3S_3 in post 03), and correspondingly Q(23)\mathbb{Q}(\sqrt[3]{2}) and its two conjugate fields are not Galois over Q\mathbb{Q}.

Common pitfall: the correspondence reverses order. A bigger subgroup fixes more conditions and so has a smaller fixed field. Draw the two lattices with EE at the top and {id}\{\mathrm{id}\} at the top.


Chapter 7 — Solvable groups and the quintic

Solvable groups

A group GG is solvable if there is a chain of subgroups

{e}=G0⊴G1⊴⋯⊴Gk=G\{e\} = G_0 \trianglelefteq G_1 \trianglelefteq \cdots \trianglelefteq G_k = G

with each GiG_i normal in Gi+1G_{i+1} and each quotient Gi+1/GiG_{i+1}/G_i abelian.

  • Abelian groups are solvable (k=1k = 1).
  • S3S_3: {e}⊴A3⊴S3\{e\} \trianglelefteq A_3 \trianglelefteq S_3 with quotients Z/3\mathbb{Z}/3 and Z/2\mathbb{Z}/2.
  • S4S_4: {e}⊴V4⊴A4⊴S4\{e\} \trianglelefteq V_4 \trianglelefteq A_4 \trianglelefteq S_4 with quotients Z/2×Z/2\mathbb{Z}/2 \times \mathbb{Z}/2, Z/3\mathbb{Z}/3, Z/2\mathbb{Z}/2. So every subgroup of S4S_4 is solvable too (subgroups and quotients of solvable groups are solvable).
  • S5S_5 is not solvable. Its only normal subgroups are {e}\{e\}, A5A_5, S5S_5, and A5A_5 is simple and non-abelian (post 02). A chain would have to pass through A5A_5, and the step below A5A_5 would need a normal subgroup of A5A_5 with abelian quotient; the only candidates are A5A_5 itself (quotient trivial, no progress) and {e}\{e\} (quotient A5A_5, not abelian). Equivalently, the commutator subgroup of A5A_5 is A5A_5, so the derived series S5⊃A5⊃A5⊃⋯S_5 \supset A_5 \supset A_5 \supset \cdots never reaches {e}\{e\}.

Radicals

A polynomial f∈Q[x]f \in \mathbb{Q}[x] is solvable by radicals if its roots can be written starting from rational numbers using +,−,×,÷+, -, \times, \div and kk-th roots. The quadratic formula shows this for degree 2; Cardano's and Ferrari's formulas do it for degrees 3 and 4.

Theorem (Galois, characteristic 0). ff is solvable by radicals if and only if its Galois group is solvable.

(Idea of "only if": adjoining a kk-th root to a field that already contains the kk-th roots of unity gives a Galois extension with cyclic group; adjoining roots of unity gives an abelian group. A tower of such steps gives, through part 3 of the Fundamental Theorem, a chain of normal subgroups with abelian quotients.)

Since S4S_4 is solvable and the Galois group of a degree-nn polynomial embeds in SnS_n, every polynomial of degree ≤4\le 4 is solvable by radicals. The Abel–Ruffini theorem says the general quintic is not: the generic polynomial x5+a4x4+⋯+a0x^5 + a_4x^4 + \cdots + a_0 with independent indeterminate coefficients has Galois group S5S_5 over Q(a0,…,a4)\mathbb{Q}(a_0, \dots, a_4), which is not solvable, so there is no formula in radicals valid for all quintics. Galois theory gives more: specific quintics with rational coefficients have unsolvable roots.

A concrete unsolvable quintic

Lemma. Let pp be prime and f∈Q[x]f \in \mathbb{Q}[x] irreducible of degree pp with exactly two non-real roots. Then Gal⁡(f)≅Sp\operatorname{Gal}(f) \cong S_p.

Proof. View G=Gal⁡(f)G = \operatorname{Gal}(f) as a subgroup of SpS_p acting on the pp roots. For a root α\alpha, [Q(α):Q]=p[\mathbb{Q}(\alpha) : \mathbb{Q}] = p divides [E:Q]=∣G∣[E : \mathbb{Q}] = |G|, so by Cauchy's theorem (post 03) GG has an element of order pp; in SpS_p the elements of order pp are the pp-cycles. Complex conjugation restricts to an element of GG that swaps the two non-real roots and fixes the p−2p - 2 real ones: a transposition. For prime pp, a pp-cycle and a transposition generate all of SpS_p. ∎

Theorem. f(x)=x5−4x+2f(x) = x^5 - 4x + 2 is not solvable by radicals over Q\mathbb{Q}.

Proof. Irreducible: Eisenstein at p=2p = 2 (2∣−42 \mid -4, 2∣22 \mid 2, 4∤24 \nmid 2, leading coefficient 1).

Exactly three real roots: f′(x)=5x4−4f'(x) = 5x^4 - 4 vanishes only at x=±cx = \pm c with c=(4/5)1/4≈0.9457c = (4/5)^{1/4} \approx 0.9457. So ff increases, then decreases on [−c,c][-c, c], then increases. The local maximum f(−c)≈5.03>0f(-c) \approx 5.03 > 0 and the local minimum f(c)≈−1.03<0f(c) \approx -1.03 < 0, while f→−∞f \to -\infty as x→−∞x \to -\infty and f→+∞f \to +\infty as x→+∞x \to +\infty. So ff crosses zero once on each of the three monotone pieces: three real roots, approximately −1.5185-1.5185, 0.50850.5085 and 1.24361.2436, and the other two roots are a complex-conjugate pair.

By the lemma with p=5p = 5, Gal⁡(f)≅S5\operatorname{Gal}(f) \cong S_5, which is not solvable. By Galois's theorem, ff is not solvable by radicals. ∎

Watch out: "not solvable by radicals" does not mean the roots are hard to compute. Numerically they are easy (the values above). It means there is no finite expression in +,−,×,÷, k+, -, \times, \div, \sqrt[k]{\ } for them.


Practice Exercises

1. Find [Q(2,23):Q][\mathbb{Q}(\sqrt2, \sqrt[3]{2}) : \mathbb{Q}].

Solution

Q(2)\mathbb{Q}(\sqrt2) has degree 2 and Q(23)\mathbb{Q}(\sqrt[3]{2}) has degree 3, both intermediate, so 2 and 3 divide the degree, and so does 6. On the other hand [Q(2,23):Q(23)]≤2[\mathbb{Q}(\sqrt2, \sqrt[3]{2}) : \mathbb{Q}(\sqrt[3]{2})] \le 2 (root of x2−2x^2 - 2), so the degree is at most 2⋅3=62 \cdot 3 = 6. Hence it is exactly 6.

2. Find the minimal polynomial of 2+i\sqrt2 + i over Q\mathbb{Q}.

Solution

Let θ=2+i\theta = \sqrt2 + i. Then θ2=1+22 i\theta^2 = 1 + 2\sqrt2\,i, so (θ2−1)2=−8(\theta^2 - 1)^2 = -8, giving θ4−2θ2+9=0\theta^4 - 2\theta^2 + 9 = 0. As in the 2+3\sqrt2 + \sqrt3 example, Q(θ)=Q(2,i)\mathbb{Q}(\theta) = \mathbb{Q}(\sqrt2, i), which has degree 4 (i∉Q(2)⊂Ri \notin \mathbb{Q}(\sqrt2) \subset \mathbb{R}). So mθ=x4−2x2+9m_\theta = x^4 - 2x^2 + 9.

3. Show that the regular 7-gon is not constructible, using that 2cos⁡(2π/7)2\cos(2\pi/7) is a root of x3+x2−2x−1x^3 + x^2 - 2x - 1.

Solution

Rational roots could only be ±1\pm 1, which give −1-1 and 11, so the cubic has no rational root and is irreducible. Then [Q(2cos⁡(2π/7)):Q]=3[\mathbb{Q}(2\cos(2\pi/7)) : \mathbb{Q}] = 3, not a power of 2, so cos⁡(2π/7)\cos(2\pi/7) is not constructible, and neither is the 7-gon. (Consistent with Gauss–Wantzel: 7 is prime but not a Fermat prime.)

4. List all subfields of F64\mathbb{F}_{64} and draw their inclusions. What is Gal⁡(F64/F2)\operatorname{Gal}(\mathbb{F}_{64}/\mathbb{F}_2)?

Solution

64=2664 = 2^6 and the divisors of 6 are 1, 2, 3, 6, so the subfields are F2,F4,F8,F64\mathbb{F}_2, \mathbb{F}_4, \mathbb{F}_8, \mathbb{F}_{64}. Inclusions: F2⊂F4⊂F64\mathbb{F}_2 \subset \mathbb{F}_4 \subset \mathbb{F}_{64} and F2⊂F8⊂F64\mathbb{F}_2 \subset \mathbb{F}_8 \subset \mathbb{F}_{64}, while F4⊈F8\mathbb{F}_4 \not\subseteq \mathbb{F}_8. The Galois group is cyclic of order 6, generated by Frobenius; its subgroups (orders 1, 2, 3, 6) match the subfields F64,F8,F4,F2\mathbb{F}_{64}, \mathbb{F}_8, \mathbb{F}_4, \mathbb{F}_2 in that order.

5. In Q(2,3)\mathbb{Q}(\sqrt2, \sqrt3), which automorphism fixes 6\sqrt6, and what is the fixed field of {id,σ}\{\mathrm{id}, \sigma\}? Why does the Fundamental Theorem guarantee that Q(2+3)\mathbb{Q}(\sqrt2 + \sqrt3) is the whole field without computing θ3\theta^3?

Solution

στ\sigma\tau fixes 6\sqrt6 (both signs flip). σ\sigma fixes 3\sqrt3, so E⟨σ⟩⊇Q(3)E^{\langle\sigma\rangle} \supseteq \mathbb{Q}(\sqrt3), and both have degree 2, so they are equal. For θ=2+3\theta = \sqrt2 + \sqrt3: the non-identity automorphisms send θ\theta to −2+3-\sqrt2 + \sqrt3, 2−3\sqrt2 - \sqrt3, −2−3-\sqrt2 - \sqrt3, all different from θ\theta. So only the trivial subgroup fixes θ\theta, and Q(θ)\mathbb{Q}(\theta) corresponds to {id}\{\mathrm{id}\}, i.e. it is all of EE.

6. Explain why every polynomial of degree at most 4 over Q\mathbb{Q} is solvable by radicals, but this argument says nothing about degree 5.

Solution

The Galois group of a degree-nn polynomial is a subgroup of SnS_n. For n≤4n \le 4, SnS_n is solvable (chains above), and subgroups of solvable groups are solvable, so Galois's theorem applies. For n=5n = 5 the group may be a solvable subgroup of S5S_5 (for example x5−2x^5 - 2 is solvable by radicals, since 25\sqrt[5]{2} is already a radical), or all of S5S_5, as for x5−4x+2x^5 - 4x + 2. The degree alone does not decide.


Cheat-sheet

Concept Key fact
Degree [E:F]=dim⁡FE[E : F] = \dim_F E
Tower law [E:F]=[E:K][K:F][E : F] = [E : K][K : F]
Minimal polynomial monic, irreducible, divides every ff with f(α)=0f(\alpha) = 0
Simple extension F(α)≅F[x]/(mα)F(\alpha) \cong F[x]/(m_\alpha), degree deg⁡mα\deg m_\alpha
Q(2,3)\mathbb{Q}(\sqrt2, \sqrt3) degree 4, primitive element 2+3\sqrt2 + \sqrt3, min poly x4−10x2+1x^4 - 10x^2 + 1
Constructible degree over Q\mathbb{Q} is a power of 2 (necessary)
Impossible constructions 23\sqrt[3]{2} (degree 3), cos⁡20∘\cos 20^\circ (root of 8x3−6x−18x^3 - 6x - 1), π\sqrt\pi
Splitting field exists, unique up to isomorphism, degree at most n!n!
Finite fields one field of each order pnp^n: the roots of xpn−xx^{p^n} - x
Frobenius a↦apa \mapsto a^p; generates Gal⁡(Fpn/Fp)≅Z/n\operatorname{Gal}(\mathbb{F}_{p^n}/\mathbb{F}_p) \cong \mathbb{Z}/n
Galois extension normal and separable; ∣Aut⁡(E/F)∣=[E:F]\lvert\operatorname{Aut}(E/F)\rvert = [E : F]
Fundamental Theorem subgroups ↔ intermediate fields, order-reversing; normal ↔ Galois
x3−2x^3 - 2 splitting field degree 6, group S3S_3, subfield Q(ω)\mathbb{Q}(\omega) ↔ A3A_3
Solvable group chain of normal steps with abelian quotients; S4S_4 yes, S5S_5 no
Galois's criterion solvable by radicals ⇔ solvable Galois group (char 0)
Unsolvable quintic x5−4x+2x^5 - 4x + 2: Eisenstein at 2, three real roots, group S5S_5

What's next

This post completes the core course: from the integers and modular arithmetic (post 00), through groups, actions and Sylow theory (posts 01–03), rings and fields (post 04), to Galois theory. The table below lists the planned extensions. Each builds directly on the material here, so the series can grow without renumbering the existing posts.

Planned future extensions

Post Topic What it covers
06 Modules and linear algebra over rings Modules, free modules, the structure theorem for finitely generated modules over a PID; the finite abelian groups of post 03 and the rational and Jordan canonical forms as two special cases
07 Representation theory of finite groups Group representations, Maschke's theorem, Schur's lemma, characters and orthogonality, character tables of S3S_3, S4S_4 and A5A_5
08 Algebraic number theory Rings of integers, Dedekind domains, how unique factorisation of ideals repairs Z[−5]\mathbb{Z}[\sqrt{-5}], the class group, cyclotomic fields
09 Commutative algebra and a first look at algebraic geometry Noetherian rings, the Hilbert basis theorem, localisation, the Nullstellensatz, varieties and their coordinate rings
10 Algebra in cryptography Finite-field arithmetic in practice (AES uses F28\mathbb{F}_{2^8}), Diffie–Hellman and discrete logarithms, elliptic-curve groups, lattices and lattice-based cryptography

References

  • D. S. Dummit and R. M. Foote, Abstract Algebra, 3rd edition, Wiley, 2004 — Chapters 13 (field extensions, constructions, splitting fields, finite fields) and 14 (Galois theory, finite fields, Galois groups of polynomials, solvability by radicals).
  • M. Artin, Algebra, 2nd edition, Pearson, 2011 — Chapters 15 (fields, ruler and compass) and 16 (Galois theory, quintic equations).
  • I. Stewart, Galois Theory, 4th edition, CRC Press, 2015 — a readable, historically informed development, including Abel–Ruffini.
  • J. S. Milne, Fields and Galois Theory, course notes (free).
  • E. Artin, Galois Theory, Notre Dame Mathematical Lectures 2, 1942 (Dover reprint) — the classic linear-algebra approach to the Fundamental Theorem.
  • MIT OpenCourseWare, 18.702 Algebra II (Spring 2011) — lecture notes on fields and Galois theory.
  • K. Conrad, Expository papers ("blurbs") — short notes on Galois theory, including Galois groups of cubics and quartics.

Note: this post is in progress. Planned additions: a full proof of the Fundamental Theorem (Artin's lemma on fixed fields), cyclotomic extensions and the constructible 17-gon, the discriminant as a test for Gal⁡⊆An\operatorname{Gal} \subseteq A_n, and a worked Cardano solution of a cubic read through its Galois group.