Uniqueness of Splitting Fields
Suppose two mathematicians work independently. Each constructs a field where a polynomial 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 -isomorphism that fixes pointwise. This distinction matters. Two splitting fields of the same polynomial over 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 . 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 -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.
- Splitting fields of a given polynomial over always exist, but existence alone doesn't tell you there is only "one" such field.
- The right comparison tool is an -isomorphism: a field isomorphism restricting to the identity on .
- The isomorphism extension theorem extends any isomorphism of base fields to an isomorphism of splitting fields of and .
- The proof proceeds by strong induction on , adjoining and matching one root at a time via irreducible factors.
- Uniqueness of splitting fields is the special case , : any two splitting fields of over are -isomorphic.
- The number of extensions of 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 , 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 over " 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 are constructed as splitting fields of over , 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, 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 and are splitting fields of the same polynomial over , what can we conclude?]
- and are equal as subsets of some ambient field
- and are isomorphic as abstract rings, with no further guarantee
- There is an isomorphism restricting to the identity on ✓
- and must have different degrees over if constructed differently
:::quiz[When is the number of extensions of to the splitting field exactly equal to , rather than merely at most ?]
- Always, regardless of any hypothesis
- Only when has characteristic zero
- When has no repeated irreducible factors, i.e. is separable over ✓
- When
Ask the tutor: Can you show me how the root-count in the separable case fails, step by step, for over ?
Let be a field and a nonconstant polynomial. A splitting field of over is a field extension such that: 1. factors into linear factors in : with and , and 2. , i.e. is generated over by the roots of . Given fields and a field isomorphism , extend coefficientwise to a ring isomorphism
and write for the image of under this map. If and are field extensions, a map is called an extension of (or a -isomorphism) if is a field isomorphism and . When and , such a is called an -isomorphism: a field isomorphism fixing pointwise. Two splitting fields of over are said to be isomorphic as splitting fields of if there is an -isomorphism .
Intuition
Think of building a splitting field as laying railroad track one root at a time. Starting from , we pick an irreducible factor of in , form for a root , and repeat with the leftover factors of over the new bigger field. Each step is forced up to isomorphism: adjoining a root of an irreducible polynomial always produces the ring , regardless of which root of , 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 , the two intermediate fields and are still isomorphic via a map sending and fixing . 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.
Central result
Let be a field isomorphism, let be a nonconstant polynomial, and let be the polynomial obtained by applying to the coefficients of . Let be a splitting field of over , and let be a splitting field of over . Then extends to a field isomorphism , i.e. . Moreover, the number of such extensions is finite and at most ; if in addition every irreducible factor of in has distinct roots in (equivalently has no repeated irreducible factors when factored over , the "separable" case), then the number of extensions is exactly .
Let be a field and a nonconstant polynomial. If and are both splitting fields of over , then there is an -isomorphism . In particular, a splitting field of over is unique up to -isomorphism.
Proof of the Isomorphism Extension Theorem, by strong induction on . Setup. Note is generated over by the roots of in , and is finite because with each algebraic over (each root of a nonconstant polynomial). Similarly is finite. We induct on .
Base case . Then , meaning all roots of already lie in , so splits into linear factors over . Applying to the coefficients, also splits into linear factors over (since is a ring isomorphism sending term by term, a factorization into linear factors maps to a factorization into linear factors). Hence itself already contains all the roots of , and since is generated over by roots of , we get . Set ; this is a field isomorphism extending (trivially, since , ). This proves existence in the base case, and there is exactly one extension, matching .
Inductive step. Suppose 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 . Since , does not split into linear factors over (else by the same generation argument as above, forcing ). So has an irreducible factor with , or more generally we may simply pick any irreducible factor of in that is not linear — such a factor exists because if every irreducible factor of over were linear, would split over . Fix a root of (such a root exists in since and contains all roots of ). Apply to to get . Because is a ring isomorphism, it carries irreducible elements to irreducible elements (a factorization of in would pull back under to a factorization of in ), so is irreducible in . Also in , since applying the ring isomorphism to the equation gives . Since is a splitting field of over , it contains a root of . 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 , , holding because is the minimal polynomial of over ), there is a field isomorphism
Concretely, is the composite
where is the isomorphism induced on quotient rings by (well-defined since carries the ideal onto the ideal ), and the outer isomorphisms are and respectively. Reduction of degree. Now regard as a splitting field of over the new base field : indeed still contains all roots of and is generated over , hence over the larger field , by those roots. Likewise is a splitting field of over (the coefficients of lie in , so applied to 's coefficients agrees with applied to them, i.e. as extends ). We have , since (as is a non-linear irreducible factor of , chosen above). By the tower law this is an integer, and it is strictly smaller than . By the induction hypothesis applied to the isomorphism and the splitting field situation , of respectively, there exists a field isomorphism
In particular , so is the desired extension of . This proves existence for degree , completing the induction for the existence statement.
Counting extensions. We refine the induction to track the count. Fix as above. Any extension of must send to some root of in : indeed if then applying to the coefficients of this equation (using ) gives . Conversely, by the single-step construction above, for each root of in there is exactly one isomorphism extending with (uniqueness here holds because is spanned as an -vector space by where , so any field homomorphism extending is completely determined by where it sends ). So the extensions of are in bijection with pairs (a root of in , an extension of to ). Each root contributes, by the induction hypothesis (applied to , a base-field isomorphism between fields of strictly smaller relative degree), at most extensions to , with equality under the stated separability hypothesis. Since has at most roots in (a nonzero polynomial of degree over a field has at most roots, counted without multiplicity, in any extension field), the total number of extensions of to is at most
using the tower law again. This proves the general bound. Equality in the separable case. Suppose every irreducible factor of over has distinct roots in ; in particular (an irreducible factor of ) has distinct roots in , hence — an irreducible polynomial of the same degree dividing — has distinct roots in by the root-counting bijection under (roots of in correspond, after choosing any extension of to a splitting field of , to roots of ; concretely, since divides which splits completely in with generated by those roots, and is separable exactly when is by an application of formal differentiation compatible with : has a repeated root iff in , and being a ring isomorphism preserves the gcd computation, transported to in ). So has exactly roots in , giving exactly choices of , each contributing (by the induction hypothesis, since 's irreducible factors over are among the irreducible factors of over refined further, still separable — an irreducible factor over the bigger field divides one over and inherits distinct roots) exactly extensions. The total is then exactly
as claimed.
Proof of the Corollary (Uniqueness of Splitting Fields). Apply the theorem with and . Then , so any splitting field of over receives an extension of , i.e. an isomorphism with — precisely an -isomorphism. Since were arbitrary splitting fields of over , this shows any two such splitting fields are -isomorphic.
∎Worked examples
Example 1: Matching two different constructions of the splitting field of over . Let , irreducible over by Eisenstein at . Its roots in are (real cube root), , and , where is a primitive cube root of unity. Construction A: , built by first adjoining (degree 3 over ), then (degree 2 over , since while , and satisfies ). So . Construction B: someone else builds a splitting field by first adjoining the different root : set , also degree 3 over since has the same minimal polynomial (as , and is irreducible so it is the minimal polynomial of any of its roots). Then , and one checks as well since — but let's not assume the constructions coincide as subsets of , and instead run the theorem's algorithm abstractly, taking as abstract splitting fields. Apply the theorem with . Step 1: is our chosen irreducible factor of . In , pick the root ; in , pick the root . By the single-step lemma there is an isomorphism
Concretely for ; this is well-defined and a ring isomorphism because both sides are in disguise. Step 2: now is the splitting field of over (all three roots lie in and generate it over , since ), and is the splitting field of over . Over , factors as ; the quadratic factor is irreducible over (its roots are non-real). We adjoin a root of this quadratic, say , in ; in we must send it to some root of in , and contains such a root since splits . By the base case ( for this last step, since adjoining a root of a quadratic over already reaches all of ), we extend to a full isomorphism with , a chosen root of . Since and is separable (its three complex roots are distinct — check over ), the theorem guarantees exactly such 's in total: choices for where goes (any of the 3 roots of in ) times choices for where the adjoined quadratic root goes at the second stage. This matches , foreshadowing The Galois Group of an Extension.
Example 2: A base isomorphism that is not the identity, over a finite field. Let , the field of rational functions in one variable over , and let similarly. Let be the field isomorphism determined by (and ); this is a genuine, non-identity-flavored isomorphism between two different (though isomorphic) fields — a useful stress test since literally as sets. Let . This is irreducible over : if it factored, it would have a root with , but comparing degrees of numerator/denominator (writing in lowest terms, forces even and odd unless is a unit, and then with still forces to be a perfect square in , impossible by comparing degrees mod 2) — no such rational function exists. Then , also irreducible over by the identical argument. A splitting field of over is , and here we should be careful: , so is separable (its two roots are distinct since in characteristic ). Likewise is a splitting field of over , with . By the theorem, extends to an isomorphism , and since is separable of degree there are exactly such extensions. Explicitly they are
both restricting to on (sending ). One checks directly that is a well-defined field homomorphism: every element of is with , and we set ; this respects addition and multiplication because under , matching the relation in . 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 .
The uniqueness theorem is a statement about -isomorphism, not mere field isomorphism, and this distinction is not vacuous — dropping the requirement "" changes the content of the theorem entirely, even though it might seem like a technical nicety. Consider and two different polynomials: and . Let be the splitting field of , and the splitting field of , both over . As abstract fields, and are isomorphic: both are -dimensional -vector spaces with a compatible ring structure of the form for a rational non-square , and indeed the map
is a bijection respecting addition, but it is not a ring homomorphism: , while . So this particular naive map fails, and in fact no field isomorphism exists at all that restricts to the identity on , because any -isomorphism would send a root of to a root of applied to , which (since fixes ) is again ; but has no root in (if squared to with , expanding forces and then either or , both impossible for rationals). This is not a counterexample to the theorem — the theorem never claimed are isomorphic here, since they are splitting fields of different polynomials , and the isomorphism extension theorem requires comparing against , and here trivially forces us to compare with itself. The real point: this shows that "splitting fields of and over the same " carry no forced relationship whatsoever when , which is exactly consistent with — and illustrates the necessity of — the hypothesis in the theorem that we compare specifically against under the same used to identify the base fields. If one drops the hypothesis that must restrict to a specific, prescribed on (i.e., if one only asks for splitting fields to be abstractly isomorphic as rings, forgetting the embedding of ), uniqueness can fail to convey any information tied to at all: e.g. and 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 above), yet this carries no information about roots of versus . The moral: the hypothesis that we track a specific base isomorphism (here forced to be when ) is essential; without pinning down and requiring , "uniqueness of splitting fields" is not even a meaningful comparison.
Scope, edge cases & common traps
| Situation | What holds | What can fail |
|---|---|---|
| splitting fields of the same over the same | -isomorphism always exists (Corollary) | — |
| splitting fields of different polynomials over | No forced relationship | may fail entirely, or hold only "by accident," carrying no root information |
| separable over | Exactly distinct -isomorphisms | Without separability, fewer than extensions may exist |
| inseparable (possible only in positive characteristic) | Existence of at least one still holds | The count can be strictly less than ; e.g. over has repeated roots, giving only one extension though |
| Base isomorphism | Theorem still applies verbatim, comparing to | Confusing "-isomorphism" with plain field isomorphism erases the role of entirely |
The mathematician behind it
Origins · 1 minÉvariste Galois and how this was discovered
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.
Why isn't "the splitting field is isomorphic to itself" enough — why do we need -isomorphism specifically?
Because plain field isomorphism forgets how sits inside , and that embedding carries exactly the information we care about: which elements are roots of . Two fields can be isomorphic as abstract rings for reasons having nothing to do with — 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 to roots of unless it also fixes . Requiring (or 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 to be a field of characteristic zero, or algebraically special in any way?
No. The proof works over an arbitrary field , in any characteristic, using only that 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 . Characteristic only becomes relevant when discussing separability: in positive characteristic, a polynomial like can be irreducible yet have a single repeated root in its splitting field, so the "exactly extensions" clause can fail, though existence of at least one extension always holds.
How many -isomorphisms can there be between two splitting fields of a separable polynomial of degree ?
Exactly , where is the splitting field, by the counting statement in the theorem (applied with ). Note can be strictly less than — for instance for over , but happens to match in this case, while for other polynomials (e.g. those with Galois group a proper subgroup of ) is a proper divisor of . This count of -isomorphisms (taking ) is precisely the order of the Galois group when is separable.
Is the isomorphism 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 , with equality in the separable case. Non-uniqueness is expected and important — it is exactly the source of nontrivial automorphisms once we set and , 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 is reducible over , not just irreducible?
Yes, and this is essential, since a general polynomial used to define a splitting field is typically reducible (that is the whole point of factoring it into linear pieces over ). The proof handles this directly: at each inductive step we pick any non-linear irreducible factor of over the current base field, adjoin one of its roots, and recurse; itself need not be irreducible at any stage, only the chosen factor 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 is defined to be normal precisely when every -isomorphism of into an algebraic closure has image equal to itself, which is closely tied to being a splitting field of some polynomial over . The isomorphism extension theorem, applied with and , produces the self-maps of fixing — these are exactly the elements of when 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.