Algebraic Closure
Can every polynomial equation be solved? This depends on whether we enlarge our number system enough. Over the rational or real numbers the answer is no. The complex numbers famously repair this defect. Every nonconstant polynomial with complex coefficients has a complex root. The natural question for abstract algebra is different. Does an analogous "universal solvent" field exist over an arbitrary field, not just ? And is it unique in any meaningful sense? This article answers both questions affirmatively. The construction matters because it converts a local problem into a global one. The local problem asks: does this polynomial have a root? The global problem asks something broader. Does there exist a single field extension in which every polynomial over the base field splits completely? Having such a field available lets us reason uniformly about roots, degrees, and symmetries. We no longer need to constantly pass to new extensions. It is the ambient universe for several key theories. Galois theory, the classification of finite fields, and the theory of transcendence degree all take place there. The big picture is that algebraic closures are built in two stages. First one adjoins roots of every polynomial one at a time. This uses Splitting Fields machinery repeatedly. The construction is due in essence to Ernst Steinitz. It uses Zorn's Lemma to control the resulting infinite process. Second, one shows that any two algebraic closures of the same field are isomorphic. This is done by fixing the base field pointwise. It is a Zorn's Lemma argument extending Uniqueness of Splitting Fields to the infinite-degree setting. The uniqueness statement is delicate. An algebraic closure is unique only up to isomorphism, not on the nose. The isomorphism itself is generally far from unique. This article gives the precise definition of an algebraically closed field and of an algebraic closure of . It proves existence via a cardinality argument and Zorn's Lemma. It proves uniqueness via extending embeddings. It also works out two concrete examples. These are the algebraic closure of sitting inside , and the algebraic closure of a finite field . It closes with the role algebraic closures play in Separable Extensions and the classification of Finite Fields.
- A field is algebraically closed if every nonconstant polynomial in has a root in .
- An algebraic closure of is an algebraically closed field that is algebraic over .
- Existence is proved by adjoining roots of all polynomials over simultaneously, using a giant polynomial ring and Zorn's Lemma to complete the process.
- Uniqueness is proved by extending an embedding to a full isomorphism , again via Zorn's Lemma.
- The isomorphism between two algebraic closures is not canonical; it depends on choices, exactly as acts nontrivially on .
- Key idea: every field sits inside a smallest algebraically closed algebraic extension, and that extension is unique up to a (non-unique) isomorphism fixing the base field.
Where this lives today
Algebraic closures are the ambient setting for Galois Theory: the absolute Galois group is one of the central objects of modern number theory, controlling the arithmetic of every number field simultaneously. In algebraic geometry, varieties are typically studied over an algebraically closed field (often or ) precisely so that "enough points" exist — Hilbert's Nullstellensatz, the dictionary between ideals and varieties, requires the base field to be algebraically closed. In cryptography, elliptic curve cryptosystems over finite fields rely on understanding and its finite subfields to analyze point-counting and pairing-based schemes. In coding theory, Reed–Solomon and BCH codes are built from finite subfields of or . And in model theory and logic, algebraically closed fields form one of the first and best-understood examples of a complete, model-complete first-order theory, illustrating quantifier elimination.
Ask the tutor: How does the absolute Galois group act on , and what does it tell us about solvability of polynomial equations?
Let be a field.
(a) is algebraically closed if every nonconstant polynomial has a root in . Equivalently (and we verify this equivalence below): every nonconstant factors into linear factors over ; equivalently, has no proper algebraic field extension.
(b) Let be a field. An algebraic closure of is a field extension such that: 1. is algebraically closed, and 2. is an algebraic extension (every element of is a root of some nonzero polynomial in ).
Intuition
Think of building a field extension of as a construction project where each polynomial in that lacks a root is a "hole" that needs filling. Adjoining a root of one polynomial via patches that hole but may open new ones: the extension field has its own polynomial ring, with new polynomials that may still lack roots. An algebraic closure is the result of patching every hole, over and over, until no gaps remain — while never venturing outside the algebraic elements over , i.e., without gratuitously adjoining transcendental elements like a fresh variable . The subtlety is that there are infinitely many polynomials to handle, and handling one can create others, so a naive induction does not terminate. The resolution is to adjoin roots of all polynomials in one giant simultaneous extension, then observe that the resulting field, while huge, might still fail to be algebraically closed (a new polynomial over the new field might lack a root); iterating this a second time and taking a union completes the job. Zorn's Lemma packages this "keep going until you can't anymore" process rigorously, both for existence and for showing any two such maximal constructions are isomorphic.
Let be a field.
(Existence) There exists an algebraic closure of .
(Uniqueness) If and are two algebraic closures of , then there is a field isomorphism
with .
For a field , the following are equivalent: 1. Every nonconstant has a root in . 2. Every nonconstant factors as a product of linear polynomials over . 3. has no algebraic field extension (i.e. is algebraically closed in the sense of having no proper algebraic extension).
(1) (2). We induct on . If , is already linear. Suppose and the claim holds for all smaller degrees. By (1), has a root . Polynomial division in gives
with constant; substituting and using gives , so with . By the inductive hypothesis is a product of linear factors, hence so is .
(2) (3). Suppose is algebraic and . Let be the minimal polynomial of over ; it is irreducible. By (2), any nonconstant polynomial over , in particular any monic multiple of that is degree — namely itself if we normalize it monic — factors into linear factors over . Since is irreducible and factors into linear factors over , itself must already be linear (an irreducible polynomial cannot be a product of two or more linear factors of positive degree unless it has degree , since a factorization into nontrivial factors contradicts irreducibility). Hence , so with , forcing . Thus .
(3) (1). Suppose toward contradiction some nonconstant has no root in . Let be an irreducible factor of in with . If then for some , giving a root of in , contradiction. So . Form the quotient ring
which is a field because is irreducible in the PID , so is a maximal ideal. The composite is an injective ring homomorphism (it is nonzero, hence injective, since is a field), so we may regard as a field extension of with . This extension is algebraic (it is finite, and every finite extension is algebraic: if , the powers of any are elements of the -dimensional -vector space , hence linearly dependent over , giving a nonzero polynomial over killing ). This contradicts (3), which asserts no proper algebraic extension of exists. Hence every nonconstant has a root in .
∎We now prove the main theorem, in two parts.
Part 1: Existence. Step 1 (Adjoin one root of every polynomial simultaneously). Let be the set of all nonconstant polynomials in . For each introduce a formal indeterminate , and form the polynomial ring
in these (possibly infinitely many) variables. Let be the ideal generated by all the elements for (here means substitute the variable into ). Claim: is a proper ideal of . If not, , so there is a finite expression
for finitely many and , with all other variables not appearing (only finitely many variables can occur in a finite sum). We may build a field extension in which each has an actual root : iterate the standard construction for an irreducible factor of (as in the previous lemma's proof of (3) (1)) finitely many times, once for each , to obtain a finite extension containing roots of respectively — this uses only the finite, iterated version of Splitting Fields existence. Now specialize the identity above by mapping (and any other variable, if it appeared, to ); this is a well-defined ring homomorphism extending since is a polynomial ring, so it sends the identity to
in , since by construction. This says in , contradicting that is a field. This contradiction proves . Since is proper, by Zorn's Lemma is contained in a maximal ideal of (the union of a chain of proper ideals is proper, since lies in none of them, giving the hypothesis of Zorn's Lemma on the poset of proper ideals containing , ordered by inclusion). Set
a field. The composite is injective (nonzero ring map out of a field), so is a field extension of . By construction, for every nonconstant , the image of in is a root of (since , so in ). Thus every nonconstant polynomial over has a root in . Step 2 (Iterate and take a union). need not itself be algebraically closed (a polynomial with coefficients in might lack a root in ). Repeat Step 1 with in place of to produce such that every nonconstant polynomial over has a root in . Iterating countably often produces a chain
Let . This is a field: given , both lie in some common (as the form a chain), so (for ) are computed inside , and the field axioms for follow from those for each . Claim: is algebraically closed. Let be nonconstant. Each coefficient lies in some ; since the chain is totally ordered, all coefficients lie in a single for large enough. Then , so by the construction of , has a root in . Hence every nonconstant polynomial over has a root in ; by the Lemma (1)(2)(3), is algebraically closed. Claim: is algebraic. We show each is algebraic, and conclude by transitivity that is a union of finite steps of algebraic extensions. Fix (with the big polynomial ring over ). Every element of is a polynomial expression in finitely many of the images , and each is algebraic over (it is a root of ). A field generated over by finitely many algebraic elements is a finite, hence algebraic, extension of — this is the standard fact about Finitely Generated Algebraic Extensions: if are each algebraic over , then , and every element of a finite extension is algebraic over the base (as shown in the Lemma's proof of (3)(1)). Hence , lying in such a finitely-generated subfield, is algebraic over . As was arbitrary, is algebraic. Now if , then for some , and by transitivity of algebraicity through the finite tower (an element algebraic over a field algebraic over is algebraic over , since it satisfies a polynomial with finitely many coefficients, each algebraic over , generating a finite extension of containing ), is algebraic over . Hence is algebraic. Set . We have shown is algebraically closed and algebraic over , i.e. is an algebraic closure of . This proves existence.
Part 2: Uniqueness. Let be algebraic closures of . Consider the set of pairs where is an intermediate field and is a field embedding with . This set is nonempty since (where we regard ). Partially order by
Chains have upper bounds. Given a chain , set (a field, by the same chain argument as above) and define by for any with ; this is well-defined because the agree on overlaps (by compatibility in the chain), and it is a field homomorphism because it agrees locally with each . So is an upper bound. By Zorn's Lemma, has a maximal element . Claim: . Suppose not; pick . Since is algebraic, is algebraic over , hence over ; let be its minimal polynomial over , which is irreducible in . Apply to the coefficients of to get an irreducible polynomial (irreducibility is preserved since is a field isomorphism onto its image, inducing an isomorphism ). Since is algebraically closed, by the Lemma every nonconstant polynomial over , in particular (viewed as a polynomial over , or directly noting algebraically closed implies splits into linear factors over ), has a root . There is a standard isomorphism
where the first isomorphism sends compatibly with on coefficients (i.e. is induced by ), and the second sends (using that is a root of , so this is well-defined by the universal property of the quotient, and it is an isomorphism onto because , being irreducible over , is the minimal polynomial of ). Composing gives an embedding extending , with . Then strictly exceeds , since (as ) and . This contradicts maximality of . Hence , and is a field embedding fixing pointwise. Claim: is surjective. The image is algebraically closed: given a nonconstant , applying to coefficients gives nonconstant, which has a root since is algebraically closed; then is a root of in (apply to the identity , using that is a ring homomorphism, to get ). So is an algebraically closed subfield of . Now let . Since is algebraic, is algebraic over , hence its minimal polynomial has coefficients fixed by (as ), so splits completely over the algebraically closed field — indeed splits over because is algebraically closed and contains , hence contains all roots of by the Lemma applied to . In particular , being a root of in , must actually already lie in : this needs justification since could a priori have multiple roots in only some of which lie in . To see all roots of in coincide with the (full) root set of inside , note has degree and factors into exactly linear factors over ; since is a UFD (a polynomial ring over a field), this factorization into linear factors is the same factorization when is viewed as an element of , up to reordering and units, so every root of in already appears among the linear factors coming from . Hence . Since was arbitrary, , so is an isomorphism fixing .
∎Worked examples
Example 1: The algebraic closure of , and why it is a proper subfield of . Inside , define
We verify this is an algebraic closure of using the Fundamental Theorem of Algebra (that is algebraically closed) as a black box. is a field. If , then is a finite extension (generated by two algebraic elements), and every element of a finite extension of is algebraic over — this is the finite-implies-algebraic fact used above. Hence (for ), all lying in , are algebraic over , i.e. lie in . is algebraic by definition of as exactly the algebraic elements of . is algebraically closed. Let be nonconstant. Since is algebraically closed, has a root . The field is a finite extension of (each algebraic), and is algebraic over this field (it satisfies , of degree , with coefficients in it), so is finite, hence
So lies in a finite extension of , hence is algebraic over , hence . Thus has a root in , proving algebraically closed. Concretely, contains , , , and the real root of , but it does not contain or , since these are transcendental over (Lindemann's theorem). This shows strictly: is countable (a countable union, over , of the finite root sets of the countably many degree- polynomials over ), while is uncountable. So the algebraic closure of is a strictly smaller countable field sitting inside the uncountable field — algebraic closure is "algebraic" completion, not "complete" in any topological sense.
Example 2: The algebraic closure of a finite field . Fix a prime and consider . For each , let denote the (unique, up to isomorphism) field with elements, realized concretely as a splitting field of over . A key fact (provable via divisibility of cyclotomic-type factorizations, foreshadowing Finite Fields) is:
Concretely take : we have along the chain of exponents (doubling), but also branches like (exponents if we kept tripling — though these two chains merge again at exponent values, e.g. both and sit inside since and ). Form
where the union is taken along a fixed compatible system of inclusions for each (using , so every embeds into , giving a genuine ascending chain whose union contains an isomorphic copy of every , since every divides some ). This union is a field by the chain argument, is algebraic over (every element lies in some finite , hence is algebraic over ), and is algebraically closed: given nonconstant of degree , its finitely many coefficients lie in some common , so ; a splitting field of over is a finite field (or some finite extension) which is again one of the 's and hence sits inside by construction, so 's roots already lie in . For instance, over , the irreducible polynomial has its roots exactly in , while the irreducible cubic has its roots in — different, non-nested (except at their common intersection ) subfields of the single ambient closure , illustrating that is genuinely infinite-dimensional over , unlike the finite fields it contains.
The uniqueness theorem crucially requires that be algebraic over , not merely that it be an algebraically closed field containing . If we drop the algebraicity requirement, uniqueness fails completely. Let . The field is algebraically closed and contains , but is not algebraic — for instance is transcendental over . Likewise, let be an algebraic closure of the rational function field in one transcendental variable ; this is also algebraically closed and contains , but again is not algebraic, since itself is transcendental over . Both and are algebraically closed fields containing , yet they are not isomorphic as extensions of in any structure-preserving sense that would make the "closure" canonical — indeed they are not even isomorphic as abstract fields fixing , because they have different transcendence degrees over ( has transcendence degree equal to the cardinality of the continuum, while has transcendence degree exactly over ; transcendence degree is a field-isomorphism invariant of an extension). So without the algebraicity hypothesis, there is no meaningful uniqueness statement: "algebraically closed field containing " is far too weak a notion, admitting wildly different, non-isomorphic completions of arbitrarily large size. The algebraicity condition is precisely what pins down to be the smallest such closure, unique up to isomorphism.
Scope, edge cases & common traps
| Situation | What is true | What is not true |
|---|---|---|
| already algebraically closed | (identity extension) | — |
| finite (e.g. ) | is always infinite | is never finite: no finite field is algebraically closed, since has no root in a finite field |
| Two algebraic closures | Isomorphic via some -fixing map | The isomorphism is generally not unique; can be huge (e.g. ) |
| Constructing | Requires Zorn's Lemma / choice-type axiom | Cannot be done by a finite or even countably terminating induction alone |
| vs. algebraically closed extension | Every algebraically closed field containing contains an isomorphic copy of | It need not itself be algebraic over (see counterexample) |
The mathematician behind it
Origins · 1 minErnst Steinitz and how this was discovered
Ernst Steinitz was a German mathematician working in the early twentieth century whose 1910 paper Algebraische Theorie der Körper ("Algebraic Theory of Fields") gave the first systematic, general treatment of field theory, including the existence and uniqueness of algebraic closures for arbitrary fields — not just subfields of . His work introduced concepts such as perfect fields, transcendence degree, and the general classification of field extensions, laying groundwork that Emil Artin and others would later use to build modern Galois theory.
Does every field actually have an algebraic closure, even weird or exotic ones?
Yes. The existence proof given here uses only that is a field — no assumption on cardinality, characteristic, or any special structure — together with Zorn's Lemma (equivalently, some form of the Axiom of Choice). The construction adjoins a formal root for every nonconstant polynomial simultaneously via a large polynomial ring, shows the resulting ideal is proper, extracts a maximal ideal, and iterates. This works uniformly for , , function fields like , and fields of arbitrarily large cardinality. The axiom of choice is genuinely necessary in general; without some choice principle, the existence of algebraic closures for arbitrary fields is not provable in ZF alone.
Is the algebraic closure the same thing as the splitting field of "all polynomials"?
Almost, but the phrase "splitting field of all polynomials" is informal, since there is no single polynomial to split — you'd need infinitely many. The algebraic closure can be described as the union of splitting fields, over , of every nonconstant polynomial in , taken inside a fixed ambient algebraic closure. Concretely where ranges over and each splitting field is chosen compatibly inside . This is consistent with, and relies on, Uniqueness of Splitting Fields to make sense of "compatibly."
Why isn't the isomorphism between two algebraic closures canonical?
Because the proof uses Zorn's Lemma to extend an embedding step by step, and at each step where a new element needs a target, there may be several valid roots of its minimal polynomial to send it to. Different choices give different, but equally valid, extensions. Concretely, an automorphism of fixing can send or ; both give valid embeddings. The group of all such automorphisms is precisely the absolute Galois group , which is a rich, non-trivial (in fact profinite, uncountable) group.
Can I always realize an algebraic closure concretely, the way is realized?
For and more generally any subfield of , yes: you can take the algebraic elements inside , using the Fundamental Theorem of Algebra as a shortcut. For finite fields , you can realize concretely as the union of the finite fields under a compatible system of inclusions. In general, however, for an arbitrary field there is no "ambient universe" analogous to sitting around beforehand, so the abstract Zorn's-Lemma construction (adjoining formal roots) is what guarantees existence in full generality.
Is ever a finite extension?
Only when is already algebraically closed, in which case and the extension is trivially finite (degree ). If is not algebraically closed, is always infinite. One can see this because if with , one can show (via the Artin–Schreier theorem, a deeper structural result) that this forces very restrictive conditions on and (e.g. and ); but even setting that theorem aside, a short degree-counting argument shows a field can never have a proper finite extension that is algebraically closed unless that extension has degree exactly matching very special constraints, and generically is infinite, as seen already in the and examples.
How does this connect to separable extensions and finite fields?
Inside a fixed algebraic closure , one studies the separable closure — the subfield of elements whose minimal polynomials have no repeated roots — which is central to Separable Extensions and to defining the Galois group properly in positive characteristic. For Finite Fields, the algebraic closure organizes all finite fields of characteristic into one compatible system, with recovered as the fixed field of the -th power of the Frobenius automorphism acting on .