Uniqueness of Splitting Fields

Suppose two mathematicians work independently. Each constructs a field where a polynomial f(x)f(x) factors completely into linear factors. Do they end up with the same field? This question sits at the foundation of Galois theory. Before we can speak of the splitting field of a polynomial, or the Galois group of an extension, we must know something important. We must know these objects are well-defined, at least up to a suitable notion of sameness. Existence of splitting fields was already established by an iterated quotient construction. Uniqueness is a separate and equally essential fact. The right notion of "sameness" here is not merely field isomorphism. It must be isomorphism compatible with the ground field — an FF-isomorphism that fixes FF pointwise. This distinction matters. Two splitting fields of the same polynomial over FF might be abstractly isomorphic as fields for uninteresting reasons. For example, they might simply share the same cardinality and characteristic. But the theorem we prove gives something much stronger and more structural. It ties the isomorphism directly to the coefficients of ff. The key technical tool is the isomorphism extension theorem. This is a statement about extending an isomorphism of base fields. It extends to an isomorphism of splitting fields built over them. This is proved by an induction on degree. This induction mirrors exactly how splitting fields are constructed. We adjoin one root at a time. We use the fact that an isomorphism of fields carries irreducible factorizations to irreducible factorizations. The uniqueness of splitting fields (up to FF-isomorphism) is then a special case. It is the case where the base isomorphism is the identity. This article gives the full statement of the isomorphism extension theorem. It also gives a complete, rigorous proof. From this, it deduces uniqueness of splitting fields as a corollary. It then works through two nontrivial examples showing the theorem in action. One example includes a case where the polynomial is reducible over an intermediate field. This uniqueness result is the load-bearing wall underneath Normal Extensions, Algebraic Closure, and ultimately The Galois Group of an Extension.

Key takeaways
  • Splitting fields of a given polynomial over FF always exist, but existence alone doesn't tell you there is only "one" such field.
  • The right comparison tool is an FF-isomorphism: a field isomorphism restricting to the identity on FF.
  • The isomorphism extension theorem extends any isomorphism σ:F→F′\sigma: F \to F' of base fields to an isomorphism of splitting fields of ff and σ(f)\sigma(f).
  • The proof proceeds by strong induction on [E:F][E:F], adjoining and matching one root at a time via irreducible factors.
  • Uniqueness of splitting fields is the special case F=F′F = F', σ=id\sigma = \mathrm{id}: any two splitting fields of ff over FF are FF-isomorphic.
  • The number of extensions of σ\sigma to the splitting field is bounded by, and under separability equal to, the degree of the extension — the seed of counting automorphisms in Galois theory.
  • Key idea: splitting fields are unique not just as fields, but unique relative to FF, because the extending isomorphism can always be built root by root.

Where this lives today

The uniqueness of splitting fields, and the isomorphism extension theorem behind it, is the mechanism that makes "the Galois group of ff over FF" a well-defined object rather than merely a group attached to one arbitrary construction. It underlies the construction of the Algebraic Closure of any field, since an algebraic closure can be built as a "splitting field of all polynomials at once," and its uniqueness up to isomorphism uses the same root-by-root matching argument. In coding theory and cryptography, finite fields Fpn\mathbb{F}_{p^n} are constructed as splitting fields of xpn−xx^{p^n}-x over Fp\mathbb{F}_p, and their uniqueness (any two finite fields of the same order are isomorphic) is a direct instance of this theorem, essential for the consistency of finite-field arithmetic used in AES encryption and Reed–Solomon error-correcting codes. In computer algebra systems, when a program constructs a splitting field symbolically (e.g. to compute a Galois group), the correctness of comparing outputs from different algorithms — say, different choices of which root to adjoin first — rests on exactly this uniqueness statement. The theorem's separable-case root count, [E:F][E:F] automorphisms exactly, is the starting point for the fundamental correspondence between subgroups and subfields central to The Galois Group of an Extension and the Fundamental Theorem of Galois Theory.

:::quiz[If EE and E′E' are splitting fields of the same polynomial f∈F[x]f\in F[x] over FF, what can we conclude?]

  • EE and E′E' are equal as subsets of some ambient field
  • EE and E′E' are isomorphic as abstract rings, with no further guarantee
  • There is an isomorphism E→E′E \to E' restricting to the identity on FF ✓
  • EE and E′E' must have different degrees over FF if constructed differently

:::quiz[When is the number of extensions of σ\sigma to the splitting field exactly equal to [E:F][E:F], rather than merely at most [E:F][E:F]?]

  • Always, regardless of any hypothesis
  • Only when FF has characteristic zero
  • When ff has no repeated irreducible factors, i.e. is separable over FF ✓
  • When E=FE = F

Ask the tutor: Can you show me how the root-count in the separable case fails, step by step, for f(x)=xp−tf(x) = x^p - t over Fp(t)\mathbb{F}_p(t)?

DefinitionSplitting field, FF-isomorphism, and the extension problem

Let FF be a field and f(x)∈F[x]f(x) \in F[x] a nonconstant polynomial. A splitting field of ff over FF is a field extension E/FE/F such that: 1. f(x)f(x) factors into linear factors in E[x]E[x]: f(x)=c∏i=1n(x−αi)f(x) = c\prod_{i=1}^n (x - \alpha_i) with c∈Fc \in F and αi∈E\alpha_i \in E, and 2. E=F(α1,…,αn)E = F(\alpha_1, \dots, \alpha_n), i.e. EE is generated over FF by the roots of ff. Given fields F,F′F, F' and a field isomorphism σ:F→F′\sigma: F \to F', extend σ\sigma coefficientwise to a ring isomorphism

σ:F[x]→F′[x],σ(∑aixi)=∑σ(ai)xi,\sigma: F[x] \to F'[x], \qquad \sigma\Big(\sum a_i x^i\Big) = \sum \sigma(a_i) x^i,

and write σ(f)\sigma(f) for the image of f∈F[x]f \in F[x] under this map. If E⊇FE \supseteq F and E′⊇F′E' \supseteq F' are field extensions, a map τ:E→E′\tau: E \to E' is called an extension of σ\sigma (or a σ\sigma-isomorphism) if τ\tau is a field isomorphism and τ∣F=σ\tau|_F = \sigma. When F=F′F = F' and σ=idF\sigma = \mathrm{id}_F, such a τ\tau is called an FF-isomorphism: a field isomorphism τ:E→E′\tau: E \to E' fixing FF pointwise. Two splitting fields E,E′E, E' of ff over FF are said to be isomorphic as splitting fields of ff if there is an FF-isomorphism E→E′E \to E'.

Intuition

Think of building a splitting field as laying railroad track one root at a time. Starting from FF, we pick an irreducible factor p(x)p(x) of f(x)f(x) in F[x]F[x], form F(α)=F[x]/(p(x))F(\alpha) = F[x]/(p(x)) for a root α\alpha, and repeat with the leftover factors of ff over the new bigger field. Each step is forced up to isomorphism: adjoining a root of an irreducible polynomial p(x)p(x) always produces the ring F[x]/(p(x))F[x]/(p(x)), regardless of which root of p(x)p(x), in whichever splitting field you happen to be sitting inside, you chose to adjoin. The isomorphism extension theorem says this track-laying process can be matched, step by step, between two different constructions. If someone else adjoined a different root of the same irreducible polynomial p(x)p(x), the two intermediate fields F(α)F(\alpha) and F(α′)F(\alpha') are still isomorphic via a map sending α↦α′\alpha \mapsto \alpha' and fixing FF. The heart of the proof is that this local, single-step isomorphism can always be pushed forward to the rest of the tower by induction, because the "amount of field left to build" — measured by degree — strictly decreases at each step.

Figure
Matching two constructions of a splitting field for f(x)=x3−2f(x)=x^3-2, root by root
Two towers built by adjoining roots of x³ − 2, matched at each stage ℚ ℚ(∛2) ℚ(∛2, ω∛2) = E (splitting field) ℚ ℚ(ω∛2) ℚ(ω∛2, ∛2) = E′ (splitting field) id σ₁: ∛2 ↦ ω∛2 σ₂: extends σ₁, an F-isomorphism E ≅ E′

Central result

TheoremIsomorphism Extension Theorem

Let σ:F→F′\sigma: F \to F' be a field isomorphism, let f(x)∈F[x]f(x) \in F[x] be a nonconstant polynomial, and let σ(f)∈F′[x]\sigma(f) \in F'[x] be the polynomial obtained by applying σ\sigma to the coefficients of ff. Let EE be a splitting field of ff over FF, and let E′E' be a splitting field of σ(f)\sigma(f) over F′F'. Then σ\sigma extends to a field isomorphism τ:E→E′\tau: E \to E', i.e. τ∣F=σ\tau|_F = \sigma. Moreover, the number of such extensions τ\tau is finite and at most [E:F][E:F]; if in addition every irreducible factor of ff in F[x]F[x] has distinct roots in EE (equivalently ff has no repeated irreducible factors when factored over FF, the "separable" case), then the number of extensions is exactly [E:F][E:F].

CorollaryUniqueness of Splitting Fields

Let FF be a field and f(x)∈F[x]f(x) \in F[x] a nonconstant polynomial. If EE and E′E' are both splitting fields of ff over FF, then there is an FF-isomorphism τ:E→E′\tau: E \to E'. In particular, a splitting field of ff over FF is unique up to FF-isomorphism.

Proof

Proof of the Isomorphism Extension Theorem, by strong induction on n=[E:F]n = [E:F]. Setup. Note EE is generated over FF by the roots of ff in EE, and [E:F][E:F] is finite because E=F(α1,…,αn)E = F(\alpha_1,\dots,\alpha_n) with each αi\alpha_i algebraic over FF (each root of a nonconstant polynomial). Similarly [E′:F′][E':F'] is finite. We induct on n=[E:F]n=[E:F].

Base case n=1n=1. Then E=FE = F, meaning all roots of ff already lie in FF, so ff splits into linear factors over FF. Applying σ\sigma to the coefficients, σ(f)\sigma(f) also splits into linear factors over F′F' (since σ\sigma is a ring isomorphism F[x]→F′[x]F[x]\to F'[x] sending x−α↦x−σ(α)x-\alpha \mapsto x - \sigma(\alpha) term by term, a factorization into linear factors maps to a factorization into linear factors). Hence F′F' itself already contains all the roots of σ(f)\sigma(f), and since E′E' is generated over F′F' by roots of σ(f)\sigma(f), we get E′=F′E' = F'. Set τ=σ:F→F′\tau = \sigma: F \to F'; this is a field isomorphism extending σ\sigma (trivially, since E=FE=F, E′=F′E'=F'). This proves existence in the base case, and there is exactly one extension, matching [E:F]=1[E:F]=1.

Inductive step. Suppose n=[E:F]>1n = [E:F] > 1 and assume the theorem (existence, and the degree bound / equality on the number of extensions) holds for every isomorphism of base fields and every splitting field situation with degree strictly less than nn. Since n>1n>1, ff does not split into linear factors over FF (else E=FE=F by the same generation argument as above, forcing n=1n=1). So ff has an irreducible factor p(x)∈F[x]p(x) \in F[x] with deg⁡p≥2\deg p \ge 2, or more generally we may simply pick any irreducible factor p(x)p(x) of ff in F[x]F[x] that is not linear — such a factor exists because if every irreducible factor of ff over FF were linear, ff would split over FF. Fix a root α∈E\alpha \in E of p(x)p(x) (such a root exists in EE since p(x)∣f(x)p(x) \mid f(x) and EE contains all roots of ff). Apply σ\sigma to p(x)p(x) to get σ(p)(x)∈F′[x]\sigma(p)(x) \in F'[x]. Because σ:F[x]→F′[x]\sigma: F[x]\to F'[x] is a ring isomorphism, it carries irreducible elements to irreducible elements (a factorization of σ(p)\sigma(p) in F′[x]F'[x] would pull back under σ−1\sigma^{-1} to a factorization of pp in F[x]F[x]), so σ(p)(x)\sigma(p)(x) is irreducible in F′[x]F'[x]. Also σ(p)∣σ(f)\sigma(p) \mid \sigma(f) in F′[x]F'[x], since applying the ring isomorphism σ\sigma to the equation f=p⋅qf = p\cdot q gives σ(f)=σ(p)σ(q)\sigma(f) = \sigma(p)\sigma(q). Since E′E' is a splitting field of σ(f)\sigma(f) over F′F', it contains a root α′\alpha' of σ(p)(x)\sigma(p)(x). Single-step isomorphism. By the standard simple-extension isomorphism for adjoining a root of an irreducible polynomial (a consequence of Splitting Fields and the isomorphism F[x]/(p(x))≅F(α)F[x]/(p(x)) \cong F(\alpha), x↦αx \mapsto \alpha, holding because pp is the minimal polynomial of α\alpha over FF), there is a field isomorphism

σ1:F(α)⟶F′(α′),σ1∣F=σ,σ1(α)=α′.\sigma_1 : F(\alpha) \longrightarrow F'(\alpha'), \qquad \sigma_1|_F = \sigma, \quad \sigma_1(\alpha) = \alpha'.

Concretely, σ1\sigma_1 is the composite

F(α)≅F[x]/(p(x))→ σˉ F′[x]/(σ(p)(x))≅F′(α′),F(\alpha) \cong F[x]/(p(x)) \xrightarrow{\ \bar\sigma\ } F'[x]/(\sigma(p)(x)) \cong F'(\alpha'),

where σˉ\bar\sigma is the isomorphism induced on quotient rings by σ:F[x]→F′[x]\sigma: F[x]\to F'[x] (well-defined since σ\sigma carries the ideal (p(x))(p(x)) onto the ideal (σ(p)(x))(\sigma(p)(x))), and the outer isomorphisms are x↦αx\mapsto\alpha and x↦α′x \mapsto \alpha' respectively. Reduction of degree. Now regard EE as a splitting field of ff over the new base field F(α)F(\alpha): indeed EE still contains all roots of ff and is generated over FF, hence over the larger field F(α)F(\alpha), by those roots. Likewise E′E' is a splitting field of σ1(f)=σ(f)\sigma_1(f) = \sigma(f) over F′(α′)F'(\alpha') (the coefficients of ff lie in F⊆F(α)F \subseteq F(\alpha), so σ1\sigma_1 applied to ff's coefficients agrees with σ\sigma applied to them, i.e. σ1(f)=σ(f)\sigma_1(f) = \sigma(f) as σ1\sigma_1 extends σ\sigma). We have [E:F(α)]=[E:F]/[F(α):F]=n/deg⁡p<n[E:F(\alpha)] = [E:F]/[F(\alpha):F] = n/\deg p < n, since deg⁡p≥2\deg p \ge 2 (as pp is a non-linear irreducible factor of ff, chosen above). By the tower law this is an integer, and it is strictly smaller than nn. By the induction hypothesis applied to the isomorphism σ1:F(α)→F′(α′)\sigma_1: F(\alpha)\to F'(\alpha') and the splitting field situation E/F(α)E/F(\alpha), E′/F′(α′)E'/F'(\alpha') of f,σ1(f)f, \sigma_1(f) respectively, there exists a field isomorphism

τ:E⟶E′,τ∣F(α)=σ1.\tau : E \longrightarrow E', \qquad \tau|_{F(\alpha)} = \sigma_1.

In particular τ∣F=σ1∣F=σ\tau|_F = \sigma_1|_F = \sigma, so τ\tau is the desired extension of σ\sigma. This proves existence for degree nn, completing the induction for the existence statement.

Counting extensions. We refine the induction to track the count. Fix σ:F→F′\sigma: F\to F' as above. Any extension τ:E→E′\tau: E \to E' of σ\sigma must send α\alpha to some root of σ(p)(x)\sigma(p)(x) in E′E': indeed if p(α)=0p(\alpha) = 0 then applying τ\tau to the coefficients of this equation (using τ∣F=σ\tau|_F = \sigma) gives σ(p)(τ(α))=0\sigma(p)(\tau(\alpha)) = 0. Conversely, by the single-step construction above, for each root αj′\alpha'_j of σ(p)(x)\sigma(p)(x) in E′E' there is exactly one isomorphism σ1(j):F(α)→F′(αj′)\sigma_1^{(j)}: F(\alpha) \to F'(\alpha'_j) extending σ\sigma with α↦αj′\alpha \mapsto \alpha'_j (uniqueness here holds because F(α)F(\alpha) is spanned as an FF-vector space by 1,α,…,αd−11,\alpha,\dots,\alpha^{d-1} where d=deg⁡pd = \deg p, so any field homomorphism extending σ\sigma is completely determined by where it sends α\alpha). So the extensions τ:E→E′\tau: E \to E' of σ\sigma are in bijection with pairs (a root αj′\alpha'_j of σ(p)\sigma(p) in E′E', an extension of σ1(j)\sigma_1^{(j)} to EE). Each root αj′\alpha'_j contributes, by the induction hypothesis (applied to σ1(j)\sigma_1^{(j)}, a base-field isomorphism between fields of strictly smaller relative degree), at most [E:F(α)][E:F(\alpha)] extensions to E′E', with equality under the stated separability hypothesis. Since σ(p)(x)\sigma(p)(x) has at most deg⁡(σ(p))=deg⁡p=[F(α):F]\deg(\sigma(p)) = \deg p = [F(\alpha):F] roots in E′E' (a nonzero polynomial of degree dd over a field has at most dd roots, counted without multiplicity, in any extension field), the total number of extensions τ\tau of σ\sigma to EE is at most

deg⁡(p)⋅[E:F(α)]=[F(α):F]⋅[E:F(α)]=[E:F],\deg(p) \cdot [E:F(\alpha)] = [F(\alpha):F]\cdot[E:F(\alpha)] = [E:F],

using the tower law again. This proves the general bound. Equality in the separable case. Suppose every irreducible factor of ff over FF has distinct roots in EE; in particular p(x)p(x) (an irreducible factor of ff) has deg⁡p\deg p distinct roots in EE, hence σ(p)(x)\sigma(p)(x) — an irreducible polynomial of the same degree dividing σ(f)\sigma(f) — has deg⁡p\deg p distinct roots in E′E' by the root-counting bijection under σ\sigma (roots of pp in EE correspond, after choosing any extension of σ\sigma to a splitting field of pp, to roots of σ(p)\sigma(p); concretely, since σ(p)\sigma(p) divides σ(f)\sigma(f) which splits completely in E′E' with E′E' generated by those roots, and σ(p)\sigma(p) is separable exactly when pp is by an application of formal differentiation compatible with σ\sigma: pp has a repeated root iff gcd⁡(p,p′)≠1\gcd(p,p') \ne 1 in F[x]F[x], and σ\sigma being a ring isomorphism preserves the gcd computation, transported to σ(p),σ(p)′\sigma(p), \sigma(p)' in F′[x]F'[x]). So σ(p)\sigma(p) has exactly deg⁡p\deg p roots in E′E', giving exactly deg⁡p\deg p choices of αj′\alpha'_j, each contributing (by the induction hypothesis, since ff's irreducible factors over F(α)F(\alpha) are among the irreducible factors of ff over FF refined further, still separable — an irreducible factor over the bigger field divides one over FF and inherits distinct roots) exactly [E:F(α)][E:F(\alpha)] extensions. The total is then exactly

deg⁡(p)⋅[E:F(α)]=[E:F],\deg(p)\cdot [E:F(\alpha)] = [E:F],

as claimed. ■\blacksquare

Proof of the Corollary (Uniqueness of Splitting Fields). Apply the theorem with F′=FF' = F and σ=idF\sigma = \mathrm{id}_F. Then σ(f)=f\sigma(f) = f, so any splitting field E′E' of σ(f)=f\sigma(f) = f over F′=FF' = F receives an extension τ:E→E′\tau: E \to E' of idF\mathrm{id}_F, i.e. an isomorphism τ:E→E′\tau: E \to E' with τ∣F=idF\tau|_F = \mathrm{id}_F — precisely an FF-isomorphism. Since E,E′E, E' were arbitrary splitting fields of ff over FF, this shows any two such splitting fields are FF-isomorphic. ■\blacksquare

∎

Worked examples

Example 1: Matching two different constructions of the splitting field of x3−2x^3 - 2 over Q\mathbb{Q}. Let f(x)=x3−2∈Q[x]f(x) = x^3 - 2 \in \mathbb{Q}[x], irreducible over Q\mathbb{Q} by Eisenstein at p=2p=2. Its roots in C\mathbb{C} are α=23\alpha = \sqrt[3]{2} (real cube root), ωα\omega\alpha, and ω2α\omega^2\alpha, where ω=e2πi/3\omega = e^{2\pi i/3} is a primitive cube root of unity. Construction A: E=Q(α,ωα,ω2α)=Q(α,ω)E = \mathbb{Q}(\alpha, \omega\alpha, \omega^2\alpha) = \mathbb{Q}(\alpha,\omega), built by first adjoining α\alpha (degree 3 over Q\mathbb{Q}), then ω\omega (degree 2 over Q(α)\mathbb{Q}(\alpha), since Q(α)⊂R\mathbb{Q}(\alpha)\subset \mathbb{R} while ω∉R\omega\notin\mathbb{R}, and ω\omega satisfies x2+x+1=0x^2+x+1=0). So [E:Q]=3⋅2=6[E:\mathbb{Q}] = 3\cdot 2 = 6. Construction B: someone else builds a splitting field E′E' by first adjoining the different root β=ωα\beta = \omega\alpha: set F1′=Q(β)F_1' = \mathbb{Q}(\beta), also degree 3 over Q\mathbb{Q} since β\beta has the same minimal polynomial x3−2x^3-2 (as β3=ω3α3=2\beta^3 = \omega^3\alpha^3 = 2, and x3−2x^3-2 is irreducible so it is the minimal polynomial of any of its roots). Then E′=F1′(α)=Q(β,α)E' = F_1'(\alpha) = \mathbb{Q}(\beta,\alpha), and one checks E′=Q(α,ω)E' = \mathbb{Q}(\alpha,\omega) as well since ω=β/α∈E′\omega = \beta/\alpha \in E' — but let's not assume the constructions coincide as subsets of C\mathbb{C}, and instead run the theorem's algorithm abstractly, taking E,E′E, E' as abstract splitting fields. Apply the theorem with σ=idQ\sigma = \mathrm{id}_\mathbb{Q}. Step 1: p(x)=x3−2p(x) = x^3-2 is our chosen irreducible factor of ff. In EE, pick the root α\alpha; in E′E', pick the root β\beta. By the single-step lemma there is an isomorphism

σ1:Q(α)→Q(β),σ1(α)=β,σ1∣Q=id.\sigma_1: \mathbb{Q}(\alpha) \to \mathbb{Q}(\beta), \qquad \sigma_1(\alpha) = \beta, \quad \sigma_1|_\mathbb{Q} = \mathrm{id}.

Concretely σ1(a+bα+cα2)=a+bβ+cβ2\sigma_1(a + b\alpha + c\alpha^2) = a + b\beta + c\beta^2 for a,b,c∈Qa,b,c \in \mathbb{Q}; this is well-defined and a ring isomorphism because both sides are Q[x]/(x3−2)\mathbb{Q}[x]/(x^3-2) in disguise. Step 2: now E=Q(α)(ω,…)E = \mathbb{Q}(\alpha)(\omega,\ldots) is the splitting field of ff over Q(α)\mathbb{Q}(\alpha) (all three roots α,ωα,ω2α\alpha,\omega\alpha,\omega^2\alpha lie in EE and generate it over Q(α)\mathbb{Q}(\alpha), since ω=(ωα)/α∈E\omega = (\omega\alpha)/\alpha \in E), and E′E' is the splitting field of σ1(f)=x3−2\sigma_1(f) = x^3-2 over Q(β)\mathbb{Q}(\beta). Over Q(α)\mathbb{Q}(\alpha), ff factors as (x−α)(x2+αx+α2)(x-\alpha)(x^2+\alpha x + \alpha^2); the quadratic factor is irreducible over Q(α)⊂R\mathbb{Q}(\alpha) \subset \mathbb{R} (its roots ωα,ω2α\omega\alpha,\omega^2\alpha are non-real). We adjoin a root of this quadratic, say ωα\omega\alpha, in EE; in E′E' we must send it to some root of σ1(x2+αx+α2)=x2+βx+β2\sigma_1(x^2+\alpha x+\alpha^2) = x^2+\beta x + \beta^2 in E′E', and E′E' contains such a root since E′E' splits σ1(f)\sigma_1(f). By the base case (n=1n=1 for this last step, since adjoining a root of a quadratic over Q(α)\mathbb{Q}(\alpha) already reaches all of EE), we extend σ1\sigma_1 to a full isomorphism τ:E→E′\tau: E \to E' with τ(α)=β\tau(\alpha) = \beta, τ(ωα)↦\tau(\omega\alpha) \mapsto a chosen root of x2+βx+β2x^2+\beta x+\beta^2. Since [E:Q]=6[E:\mathbb{Q}] = 6 and x3−2x^3-2 is separable (its three complex roots are distinct — check gcd⁡(x3−2,3x2)=1\gcd(x^3-2, 3x^2)=1 over Q\mathbb{Q}), the theorem guarantees exactly 66 such τ\tau's in total: 33 choices for where α\alpha goes (any of the 3 roots of x3−2x^3-2 in E′E') times 22 choices for where the adjoined quadratic root goes at the second stage. This matches ∣Gal(E/Q)∣=6|\mathrm{Gal}(E/\mathbb{Q})| = 6, foreshadowing The Galois Group of an Extension.

Example 2: A base isomorphism that is not the identity, over a finite field. Let F=F3(t)F = \mathbb{F}_3(t), the field of rational functions in one variable tt over F3=Z/3Z\mathbb{F}_3 = \mathbb{Z}/3\mathbb{Z}, and let F′=F3(u)F' = \mathbb{F}_3(u) similarly. Let σ:F→F′\sigma: F \to F' be the field isomorphism determined by σ(t)=u\sigma(t) = u (and σ∣F3=id\sigma|_{\mathbb{F}_3} = \mathrm{id}); this is a genuine, non-identity-flavored isomorphism between two different (though isomorphic) fields — a useful stress test since F≠F′F\ne F' literally as sets. Let f(x)=x2−t∈F[x]f(x) = x^2 - t \in F[x]. This is irreducible over FF: if it factored, it would have a root r(t)∈F3(t)r(t) \in \mathbb{F}_3(t) with r(t)2=tr(t)^2 = t, but comparing degrees of numerator/denominator (writing r=p/qr = p/q in lowest terms, p2=tq2p^2 = tq^2 forces deg⁡p2\deg p^2 even and deg⁡(tq2)\deg(tq^2) odd unless qq is a unit, and then p2=tq2p^2=tq^2 with q∈F3×q\in\mathbb{F}_3^\times still forces tt to be a perfect square in F3[t]\mathbb{F}_3[t], impossible by comparing degrees mod 2) — no such rational function exists. Then σ(f)(x)=x2−u∈F′[x]\sigma(f)(x) = x^2 - u \in F'[x], also irreducible over F′F' by the identical argument. A splitting field of ff over FF is E=F(t )=F3(t)(t)E = F(\sqrt t\,) = \mathbb{F}_3(t)(\sqrt t), and here we should be careful: char(F)=3≠2\mathrm{char}(F) = 3 \ne 2, so x2−tx^2 - t is separable (its two roots ±t\pm\sqrt t are distinct since 2t≠02\sqrt t \ne 0 in characteristic 33). Likewise E′=F′(u)=F3(u)(u)E' = F'(\sqrt u) = \mathbb{F}_3(u)(\sqrt u) is a splitting field of σ(f)\sigma(f) over F′F', with [E′:F′]=2[E':F'] = 2. By the theorem, σ\sigma extends to an isomorphism τ:E→E′\tau: E \to E', and since ff is separable of degree 22 there are exactly [E:F]=2[E:F] = 2 such extensions. Explicitly they are

τ1:t↦u,τ2:t↦−u,\tau_1: \sqrt t \mapsto \sqrt u, \qquad \tau_2: \sqrt t \mapsto -\sqrt u,

both restricting to σ\sigma on FF (sending t↦ut\mapsto u). One checks directly that τ1\tau_1 is a well-defined field homomorphism: every element of EE is a(t)+b(t)ta(t) + b(t)\sqrt t with a,b∈Fa,b \in F, and we set τ1(a(t)+b(t)t)=σ(a)(u)+σ(b)(u)u\tau_1(a(t)+b(t)\sqrt t) = \sigma(a)(u) + \sigma(b)(u)\sqrt u; this respects addition and multiplication because (t)2=t↦u=(u)2(\sqrt t)^2 = t \mapsto u = (\sqrt u)^2 under σ\sigma, matching the relation (u)2=u(\sqrt u)^2 = u in E′E'. This example shows the theorem working with genuinely different base fields, not merely two copies of the same field with the identity map — the mechanism is purely about matching irreducible-factor structure across σ\sigma.

CounterexampleWhy we need τ\tau to fix FF: splitting fields can be abstractly isomorphic "by accident" without any compatible isomorphism, once we allow the wrong comparison

The uniqueness theorem is a statement about FF-isomorphism, not mere field isomorphism, and this distinction is not vacuous — dropping the requirement "τ∣F=σ\tau|_F = \sigma" changes the content of the theorem entirely, even though it might seem like a technical nicety. Consider F=QF = \mathbb{Q} and two different polynomials: f(x)=x2−2f(x) = x^2-2 and g(x)=x2−3g(x) = x^2-3. Let E=Q(2 )E = \mathbb{Q}(\sqrt2\,) be the splitting field of ff, and E′=Q(3 )E' = \mathbb{Q}(\sqrt3\,) the splitting field of gg, both over Q\mathbb{Q}. As abstract fields, EE and E′E' are isomorphic: both are 22-dimensional Q\mathbb{Q}-vector spaces with a compatible ring structure of the form Q[x]/(x2−c)\mathbb{Q}[x]/(x^2 - c) for a rational non-square cc, and indeed the map

ϕ:Q(2)→Q(3),ϕ(a+b2)=a+b3(a,b∈Q)\phi: \mathbb{Q}(\sqrt2) \to \mathbb{Q}(\sqrt3), \qquad \phi(a+b\sqrt2) = a + b\sqrt3 \quad (a,b\in\mathbb{Q})

is a bijection respecting addition, but it is not a ring homomorphism: ϕ(2⋅2)=ϕ(2)=2\phi(\sqrt2\cdot\sqrt2) = \phi(2) = 2, while ϕ(2)ϕ(2)=3≠2\phi(\sqrt2)\phi(\sqrt2) = 3 \ne 2. So this particular naive map fails, and in fact no field isomorphism E→E′E \to E' exists at all that restricts to the identity on Q\mathbb{Q}, because any Q\mathbb{Q}-isomorphism τ:Q(2)→Q(3)\tau: \mathbb{Q}(\sqrt2)\to\mathbb{Q}(\sqrt3) would send a root of x2−2x^2-2 to a root of τ\tau applied to x2−2x^2-2, which (since τ\tau fixes Q\mathbb{Q}) is again x2−2x^2-2; but x2−2x^2-2 has no root in Q(3)\mathbb{Q}(\sqrt3) (if a+b3a+b\sqrt3 squared to 22 with a,b∈Qa,b\in\mathbb{Q}, expanding forces ab=0ab=0 and then either a2=2a^2=2 or 3b2=23b^2=2, both impossible for rationals). This is not a counterexample to the theorem — the theorem never claimed E,E′E,E' are isomorphic here, since they are splitting fields of different polynomials f≠gf\ne g, and the isomorphism extension theorem requires comparing ff against σ(f)\sigma(f), and here trivially σ=id\sigma=\mathrm{id} forces us to compare ff with itself. The real point: this shows that "splitting fields of ff and gg over the same FF" carry no forced relationship whatsoever when f≠gf \ne g, which is exactly consistent with — and illustrates the necessity of — the hypothesis in the theorem that we compare ff specifically against σ(f)\sigma(f) under the same σ\sigma used to identify the base fields. If one drops the hypothesis that τ\tau must restrict to a specific, prescribed σ\sigma on FF (i.e., if one only asks for splitting fields to be abstractly isomorphic as rings, forgetting the embedding of FF), uniqueness can fail to convey any information tied to ff at all: e.g. Q(2)\mathbb{Q}(\sqrt2) and Q(3)\mathbb{Q}(\sqrt3) are abstractly isomorphic as fields (both are degree-2 number fields, and in fact one can construct a ring isomorphism between them using a completely different presentation — though not the naive ϕ\phi above), yet this carries no information about roots of x2−2x^2-2 versus x2−3x^2-3. The moral: the hypothesis that we track a specific base isomorphism σ\sigma (here forced to be idQ\mathrm{id}_\mathbb{Q} when F=F′=QF=F'=\mathbb{Q}) is essential; without pinning down σ\sigma and requiring τ∣F=σ\tau|_F=\sigma, "uniqueness of splitting fields" is not even a meaningful comparison.

Scope, edge cases & common traps

SituationWhat holdsWhat can fail
E,E′E, E' splitting fields of the same ff over the same FFFF-isomorphism E≅E′E\cong E' always exists (Corollary)—
E,E′E, E' splitting fields of different polynomials f≠gf\ne g over FFNo forced relationshipE≅E′E\cong E' may fail entirely, or hold only "by accident," carrying no root information
ff separable over FFExactly [E:F][E:F] distinct FF-isomorphisms E→E′E\to E'Without separability, fewer than [E:F][E:F] extensions may exist
ff inseparable (possible only in positive characteristic)Existence of at least one τ\tau still holdsThe count can be strictly less than [E:F][E:F]; e.g. xp−ax^p - a over Fp(a)\mathbb{F}_p(a) has repeated roots, giving only one extension though [E:F]=p[E:F]=p
Base isomorphism σ≠id\sigma \ne \mathrm{id}Theorem still applies verbatim, comparing ff to σ(f)\sigma(f)Confusing "FF-isomorphism" with plain field isomorphism erases the role of σ\sigma entirely

The mathematician behind it

Origins · 1 minÉvariste Galois and how this was discovered
ÉG
Évariste Galois
1811–1832 · Paris, France, in the turbulent years following the July Revolution

Galois developed the ideas that would become Galois theory as a teenager, submitting memoirs to the French Academy of Sciences that were repeatedly lost or rejected by referees including Cauchy and Poisson. He identified the group of permutations of the roots of a polynomial that fix all algebraic relations among them — precisely the structure whose foundations require knowing that the field where those roots live is well-defined up to the relevant isomorphism. Galois died at twenty from wounds sustained in a duel; the night before, he wrote a testamentary letter summarizing his mathematical ideas, which were not properly understood and published until years after his death.

History
- 1832: Galois writes his final testament, sketching the correspondence between field extensions and permutation groups, on the eve of his fatal duel.
- 1846: Liouville publishes Galois's papers in the Journal de Mathématiques Pures et Appliquées, making the ideas accessible to the wider mathematical community.
- 1870: Camille Jordan's treatise Traité des substitutions organizes and extends Galois's group-theoretic ideas systematically.
- 1893–1910: Heinrich Weber and later Ernst Steinitz recast the theory in the abstract language of fields, formalizing splitting fields and their uniqueness as field-theoretic (rather than root-permutation) statements.
- 1930s: Emil Artin gives the now-standard modern treatment of Galois theory via automorphism groups and fixed fields, the version underlying this article's framing.
Why isn't "the splitting field is isomorphic to itself" enough — why do we need FF-isomorphism specifically?

Because plain field isomorphism forgets how FF sits inside EE, and that embedding carries exactly the information we care about: which elements are roots of ff. Two fields can be isomorphic as abstract rings for reasons having nothing to do with ff — for instance, any two number fields of the same degree with isomorphic ring structure could match up, but such an isomorphism need not send roots of ff to roots of ff unless it also fixes FF. Requiring τ∣F=idF\tau|_F = \mathrm{id}_F (or =σ=\sigma in the general theorem) pins the isomorphism to the actual algebraic data of the polynomial, so that the correspondence of roots, minimal polynomials, and eventually automorphism groups is meaningful and computable.

Does the isomorphism extension theorem require FF to be a field of characteristic zero, or algebraically special in any way?

No. The proof works over an arbitrary field FF, in any characteristic, using only that F[x]F[x] is a unique factorization domain (so irreducible factors and their images under ring isomorphisms behave predictably) and that adjoining a root of an irreducible polynomial always gives F[x]/(p(x))F[x]/(p(x)). Characteristic only becomes relevant when discussing separability: in positive characteristic, a polynomial like xp−ax^p - a can be irreducible yet have a single repeated root in its splitting field, so the "exactly [E:F][E:F] extensions" clause can fail, though existence of at least one extension always holds.

How many FF-isomorphisms can there be between two splitting fields of a separable polynomial ff of degree nn?

Exactly [E:F][E:F], where EE is the splitting field, by the counting statement in the theorem (applied with σ=idF\sigma = \mathrm{id}_F). Note [E:F][E:F] can be strictly less than n!n! — for instance for f(x)=x3−2f(x)=x^3-2 over Q\mathbb{Q}, n=3n=3 but [E:Q]=6=3![E:\mathbb{Q}]=6=3! happens to match n!n! in this case, while for other polynomials (e.g. those with Galois group a proper subgroup of SnS_n) [E:F][E:F] is a proper divisor of n!n!. This count of FF-isomorphisms E→EE\to E (taking E′=EE'=E) is precisely the order of the Galois group Gal(E/F)\mathrm{Gal}(E/F) when ff is separable.

Is the isomorphism τ\tau produced by the theorem unique, or can there be several?

In general there can be several, and the theorem's second part counts them exactly: at most [E:F][E:F], with equality in the separable case. Non-uniqueness is expected and important — it is exactly the source of nontrivial automorphisms once we set E=E′E=E' and σ=idF\sigma=\mathrm{id}_F, giving rise to the Galois group. Uniqueness of the splitting field as an object (up to isomorphism) does not mean uniqueness of the isomorphism witnessing that fact.

Does the theorem also work when ff is reducible over FF, not just irreducible?

Yes, and this is essential, since a general polynomial ff used to define a splitting field is typically reducible (that is the whole point of factoring it into linear pieces over EE). The proof handles this directly: at each inductive step we pick any non-linear irreducible factor p(x)p(x) of ff over the current base field, adjoin one of its roots, and recurse; ff itself need not be irreducible at any stage, only the chosen factor pp needs to be irreducible over the current field so that the single-step lemma applies.

How does this theorem foreshadow normal extensions and Galois groups?

An extension E/FE/F is defined to be normal precisely when every FF-isomorphism of EE into an algebraic closure has image equal to EE itself, which is closely tied to EE being a splitting field of some polynomial over FF. The isomorphism extension theorem, applied with σ=idF\sigma=\mathrm{id}_F and E=E′E=E', produces the self-maps of EE fixing FF — these are exactly the elements of Gal(E/F)\mathrm{Gal}(E/F) when E/FE/F is a splitting field extension. So uniqueness of splitting fields is the existence half of the story, and counting the extensions is the sizing half, both feeding directly into Normal Extensions and The Galois Group of an Extension.

Before this

Where this leads