Skip to content
The book

Field extensions, splitting fields, finite fields

Why this is asked: Tower law plus 'degree = degree of the minimal polynomial' answers most questions. Know the standard degrees: [ℚ(∛2, ω) : ℚ] = 6, [ℚ(√2, √3) : ℚ] = 4.

In one sentence

The degree of an extension is a dimension, the tower law multiplies degrees, and a splitting field is one that contains all the roots — which Q(23)\mathbb{Q}(\sqrt[3]{2}) conspicuously does not.

Why the exam asks it

Because degree computations are concrete and self-checking, and because "contains a root" and "contains all the roots" are easy to conflate. Q(23)\mathbb{Q}(\sqrt[3]{2}) is the standard test of whether that distinction has landed.

The idea

For K⊆LK \subseteq L, the degree [L:K][L:K] is the dimension of LL as a KK-vector space.

Tower law: [M:K]=[M:L] [L:K][M:K] = [M:L]\,[L:K].

This is the workhorse. Degrees multiply, so intermediate fields have degrees dividing the total — which immediately rules out, say, a degree-22 subfield of a degree-33 extension.

α\alpha is algebraic over KK if it satisfies some polynomial. Its minimal polynomial mαm_\alpha is the monic generator of the ideal of polynomials killing it; it is irreducible, and

K(α)≅K[x]/(mα),[K(α):K]=deg⁡mα.K(\alpha) \cong K[x]/(m_\alpha), \qquad [K(\alpha):K] = \deg m_\alpha .

So computing a degree means finding a minimal polynomial and proving it irreducible — which is why the previous chapter's tests matter here.

[L:K][L:K] finite ⇒\Rightarrow LL algebraic over KK. The converse fails: Q‾\overline{\mathbb{Q}} is algebraic over Q\mathbb{Q} and infinite-dimensional.

Worked degree. [Q(2,3):Q]=4[\mathbb{Q}(\sqrt2,\sqrt3):\mathbb{Q}] = 4, by the tower Q⊂Q(2)⊂Q(2,3)\mathbb{Q}\subset\mathbb{Q}(\sqrt2)\subset\mathbb{Q}(\sqrt2,\sqrt3) with degrees 22 and 22. And 2+3\sqrt2+\sqrt3 generates the whole thing: squaring gives 5+265+2\sqrt6, so it satisfies x4−10x2+1x^4-10x^2+1, which is irreducible over Q\mathbb{Q}.

Splitting fields and normality

The splitting field of ff over KK is the smallest extension in which ff factors completely. It exists and is unique up to isomorphism.

L/KL/K is normal if every irreducible polynomial over KK with one root in LL splits in LL — equivalently, LL is the splitting field of some family.

∛2 — real, in ℚ(∛2) ω∛2 — not in it ω²∛2 — not in it x³ − 2 is irreducible over ℚ, so [ℚ(∛2) : ℚ] = 3. But ℚ(∛2) ⊂ ℝ contains only one of the three roots, so it is not a splitting field: not normal, not Galois. ℚ(∛2, ω) is, with degree 6 and Galois group S₃.
ℚ(∛2) contains one of the three cube roots of 2 and misses the other two, so it is not a splitting field — not normal, and not Galois.

x3−2x^3-2 is irreducible over Q\mathbb{Q}, so [Q(23):Q]=3[\mathbb{Q}(\sqrt[3]2):\mathbb{Q}] = 3. But Q(23)\mathbb{Q}(\sqrt[3]2) lies inside R\mathbb{R}, and the other two roots ω23\omega\sqrt[3]2 and ω223\omega^2\sqrt[3]2 are not real. One root in, two out: not normal. The splitting field is Q(23,ω)\mathbb{Q}(\sqrt[3]2,\omega), of degree 66.

Contrast Q(2)\mathbb{Q}(\sqrt2): the other root −2-\sqrt2 is already there. Every degree-22 extension is normal, since the second root is determined by the first and the coefficients.

Finite fields

  • Every finite field has pnp^n elements for a prime pp, and one exists for each such size.
  • Fpn\mathbb{F}_{p^n} is unique up to isomorphism — it is the splitting field of xpn−xx^{p^n}-x.
  • Fpn⊆Fpm  ⟺  n∣m\mathbb{F}_{p^n} \subseteq \mathbb{F}_{p^m} \iff n \mid m.
  • Fq×\mathbb{F}_q^{\times} is cyclic of order q−1q-1.
  • The Frobenius x↦xpx \mapsto x^p is a field automorphism fixing Fp\mathbb{F}_p pointwise.
𝔽_p¹² 𝔽_p⁶ 𝔽_p⁴ 𝔽_p³ 𝔽_p² 𝔽_p 𝔽_pⁿ ⊆ 𝔽_pᵐ ⟺ n divides m not n ≤ m: 𝔽_p⁴ does not contain 𝔽_p³ the lattice is the divisor lattice of 12 One field of each prime-power size, and it sits inside another exactly when the exponents divide.
Subfields of a finite field mirror the divisors of the exponent. Containment is divisibility, not comparison of sizes.

The containment rule is the trap: Fp4\mathbb{F}_{p^4} does not contain Fp3\mathbb{F}_{p^3} despite being larger, because 3∤43 \nmid 4. The subfield lattice is the divisor lattice of the exponent.

Ruler and compass

A constructible number lies in a tower of quadratic extensions, so its degree over Q\mathbb{Q} is a power of 22. Hence:

  • Doubling the cube needs 23\sqrt[3]2, of degree 33. Impossible.
  • Trisecting a general angle needs a root of 8x3−6x−18x^3-6x-1, degree 33. Impossible.
  • Squaring the circle needs π\sqrt\pi, and π\pi is transcendental. Impossible.
  • Regular nn-gon: constructible   ⟺  \iff nn is a power of 22 times distinct Fermat primes.

Where intuition breaks

"LL contains a root of ff, so ff splits in LL." Q(23)\mathbb{Q}(\sqrt[3]2) contains one root of x3−2x^3-2 and not the others. This is the topic's central distinction.

"Fpn⊆Fpm\mathbb{F}_{p^n}\subseteq\mathbb{F}_{p^m} when n≤mn \le m." Divisibility, not size. F16\mathbb{F}_{16} does not contain F8\mathbb{F}_8.

"Algebraic implies finite degree." Q‾/Q\overline{\mathbb{Q}}/\mathbb{Q} is algebraic of infinite degree. Finite ⇒\Rightarrow algebraic runs one way only.

"There are several fields with pnp^n elements." Exactly one up to isomorphism. Different constructions — different irreducible polynomials of the same degree — give isomorphic fields.

"Fpn\mathbb{F}_{p^n} is Z/pn\mathbb{Z}/p^n." Z/pn\mathbb{Z}/p^n is not a field for n>1n>1; it has zero divisors. Fpn\mathbb{F}_{p^n} is Fp[x]/(f)\mathbb{F}_p[x]/(f) for an irreducible ff of degree nn.

"[Q(2,3):Q]=2[\mathbb{Q}(\sqrt2,\sqrt3):\mathbb{Q}] = 2 because both generators have degree 2." Degrees multiply, giving 44. The tower law is exactly what stops them merging.

"The additive group of a finite field is cyclic." The multiplicative group is. The additive group is elementary abelian, (Z/p)n(\mathbb{Z}/p)^n.

The exam's angle

  1. Find the minimal polynomial and prove it irreducible. The degree falls out.
  2. Use the tower law both ways — to compute a degree, and to rule out intermediate fields whose degree does not divide.
  3. For normality, count roots inside. All of them or it is not normal, and a degree-22 extension always is.
  4. For finite fields, work with exponents. Containment, subfield count and Galois group all read off divisibility of nn.
  5. For constructibility, compute the degree and check whether it is a power of 22.

The night before

  • [L:K]=dim⁡KL[L:K] = \dim_K L; tower law [M:K]=[M:L][L:K][M:K] = [M:L][L:K]; intermediate degrees divide.
  • K(α)≅K[x]/(mα)K(\alpha)\cong K[x]/(m_\alpha), degree =deg⁡mα= \deg m_\alpha, mαm_\alpha irreducible.
  • Finite ⇒\Rightarrow algebraic; converse false (Q‾\overline{\mathbb{Q}}).
  • Splitting field exists and is unique. Normal == splitting field of a family.
  • Q(23)\mathbb{Q}(\sqrt[3]2): degree 33, not normal — one real root, two complex ones missing. Splitting field Q(23,ω)\mathbb{Q}(\sqrt[3]2,\omega) has degree 66. Degree 22 is always normal.
  • [Q(2,3):Q]=4[\mathbb{Q}(\sqrt2,\sqrt3):\mathbb{Q}] = 4; 2+3\sqrt2+\sqrt3 has minimal polynomial x4−10x2+1x^4-10x^2+1.
  • Finite fields: order pnp^n, one per size, Fpn⊆Fpm  ⟺  n∣m\mathbb{F}_{p^n}\subseteq\mathbb{F}_{p^m}\iff n\mid m, Fq×\mathbb{F}_q^\times cyclic, Frobenius x↦xpx\mapsto x^p.
  • Constructible ⇒\Rightarrow degree a power of 22. Doubling the cube, trisection and squaring the circle all fail.

See it move

Degrees multiply — computing [K:ℚ] and spotting the primitive elementinteractive

This visual is part of Trap Analysis

The tower law in practice, plus the subfield rule for finite fields that decides many options.

Unlock interactive visuals

The trap here

“An algebraic extension is a finite extension” — false

The field of all algebraic numbers Q̄ over Q\mathbb{Q}

Every element is algebraic, but the extension has infinite degree (it contains Q(21/n)\mathbb{Q}(2^{1/n}) for every n).

More on this →

More in Rings and Fields

Take it further

Last revised . Found a mistake? Tell us — corrections are the fastest thing we act on.

Next: Galois theory essentials

Create a free account to keep your place and have this feed your study plan.

ShareWhatsAppTelegram

Open this in the full syllabus view · Unit 2