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 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. is the standard test of whether that distinction has landed.
The idea
For , the degree is the dimension of as a -vector space.
Tower law: .
This is the workhorse. Degrees multiply, so intermediate fields have degrees dividing the total — which immediately rules out, say, a degree- subfield of a degree- extension.
is algebraic over if it satisfies some polynomial. Its minimal polynomial is the monic generator of the ideal of polynomials killing it; it is irreducible, and
So computing a degree means finding a minimal polynomial and proving it irreducible — which is why the previous chapter's tests matter here.
finite algebraic over . The converse fails: is algebraic over and infinite-dimensional.
Worked degree. , by the tower with degrees and . And generates the whole thing: squaring gives , so it satisfies , which is irreducible over .
Splitting fields and normality
The splitting field of over is the smallest extension in which factors completely. It exists and is unique up to isomorphism.
is normal if every irreducible polynomial over with one root in splits in — equivalently, is the splitting field of some family.
is irreducible over , so . But lies inside , and the other two roots and are not real. One root in, two out: not normal. The splitting field is , of degree .
Contrast : the other root is already there. Every degree- extension is normal, since the second root is determined by the first and the coefficients.
Finite fields
- Every finite field has elements for a prime , and one exists for each such size.
- is unique up to isomorphism — it is the splitting field of .
- .
- is cyclic of order .
- The Frobenius is a field automorphism fixing pointwise.
The containment rule is the trap: does not contain despite being larger, because . 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 is a power of . Hence:
- Doubling the cube needs , of degree . Impossible.
- Trisecting a general angle needs a root of , degree . Impossible.
- Squaring the circle needs , and is transcendental. Impossible.
- Regular -gon: constructible is a power of times distinct Fermat primes.
Where intuition breaks
" contains a root of , so splits in ." contains one root of and not the others. This is the topic's central distinction.
" when ." Divisibility, not size. does not contain .
"Algebraic implies finite degree." is algebraic of infinite degree. Finite algebraic runs one way only.
"There are several fields with elements." Exactly one up to isomorphism. Different constructions — different irreducible polynomials of the same degree — give isomorphic fields.
" is ." is not a field for ; it has zero divisors. is for an irreducible of degree .
" because both generators have degree 2." Degrees multiply, giving . 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, .
The exam's angle
- Find the minimal polynomial and prove it irreducible. The degree falls out.
- Use the tower law both ways — to compute a degree, and to rule out intermediate fields whose degree does not divide.
- For normality, count roots inside. All of them or it is not normal, and a degree- extension always is.
- For finite fields, work with exponents. Containment, subfield count and Galois group all read off divisibility of .
- For constructibility, compute the degree and check whether it is a power of .
The night before
- ; tower law ; intermediate degrees divide.
- , degree , irreducible.
- Finite algebraic; converse false ().
- Splitting field exists and is unique. Normal splitting field of a family.
- : degree , not normal — one real root, two complex ones missing. Splitting field has degree . Degree is always normal.
- ; has minimal polynomial .
- Finite fields: order , one per size, , cyclic, Frobenius .
- Constructible degree a power of . Doubling the cube, trisection and squaring the circle all fail.
See it move
The trap here
“An algebraic extension is a finite extension” — false
The field of all algebraic numbers Q̄ over
Every element is algebraic, but the extension has infinite degree (it contains for every n).
More in Rings and Fields
Take it further
- The mistake this prevents: finite-dimensional intuition → real wrong options, and why each one tempts
- The mistake this prevents: base field or ring → real wrong options, and why each one tempts
- Previous-year questions set on this — every option and the answer, free:June 2025 · Part CJune 2024 · Part CDecember 2024 · Part CDecember 2023 · Part B
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.
Open this in the full syllabus view · Unit 2