symmetric monoidal (∞,1)-category of spectra
A field is algebraically closed if every non-constant polynomial (with one variable and coefficients from ) has a root in . It follows that every polynomial of degree can be factored uniquely (up to permutation of the factors) as
where and the are elements of .
An algebraic closure of an arbitrary field is an algebraically closed field equipped with a field homomorphism (necessarily an injection) such that is an algebraic extension of (which means that every element of is the root of some non-zero polynomial with coefficients only from ). For example, is an algebraic closure of . An algebraic closure of can also be described as a maximal algebraic extension of . The axiom of choice proves the existence of for any field , as well as its uniqueness up to isomorphism over . (See splitting field for a more refined result.) However, note that need not be unique up to unique isomorphism, so it's not really appropriate to speak of the algebraic closure of . For example, complex conjugation is a nontrivial automorphism of over .
Without choice, the existence and uniqueness of algebraic closures may fail; see Chow06, Banaschewski92, Richman00.
Even with choice, algebraic closure is not functorial in any reasonable sense. For example, it is very easy to demonstrate that there is no algebraic closure functor that renders the inclusion natural:
Supposing there were such an algebraic closure functor , consider its application to the (equalizer) diagram
We would have a commutative naturality diagram (meaning serially commutative on the right)
where serial commutativity of the right square(s) forces , but functoriality applied to the equation on the top forces (no matter which isomorphism is taken to be, or ).
Thus, any two algebraic closures are isomorphic, but not naturally so.
Putting aside the concerns of constructive mathematics, and freely adopting the principle of the excluded middle and the axiom of choice, algebraically closed fields are characterized (up to non-unique isomorphism) by just two cardinal invariants:
Two algebraically closed fields are isomorphic iff they have the same characteristic (the nonnegative generator of the kernel of the unique ring map ) and the same transcendence degree (the cardinality of any maximal set of algebraically independent elements).
In outline, the proof is simple in structure. The “only if” statement is clear, provided we allow that transcendence degree is well-defined. For the “if” statement, contains a subring isomorphic to where is a transcendence basis, and similarly contains a subring isomorphic to . By hypothesis, there is a bijection , which extends uniquely to an isomorphism of integral domains , which extends uniquely to an isomorphism of their fields of fractions . Then are algebraic closures of these fields, and one applies a theorem that an isomorphism of fields can be extended to an isomorphism of their algebraic closures.
The full details of such a proof carry some themes important in model theory:
There is a notion of algebraic closure of a subset,
There are prime models (algebraic closure of prime field ),
There are notions of independence and basis, and well-defined degree or dimension,
There are extensions of isomorphisms of independent sets to isomorphisms of their algebraic closures.
Perhaps the most subtle in the list is the notion of independence and well-definedness of (transcendence) degree, which notably involves verification of the Steinitz exchange axiom:
Let be an algebraically closed field, and let be the operator that takes a subset to the smallest algebraically closed subfield that contains . Then is a pregeometry.
For the moment, please consult Jacobson, Basic Algebra II, Theorem 8.34. This may be expanded upon a little later.
Well-definedness of transcendence degree then follows from abstract considerations of pregeometries; see this result.
In constructive mathematics, for Heyting fields, one has to use the tight apartness relation of the Heyting field to define a nonconstant polynomial to mean “apart from every constant polynomial function” in the definition of an algebraically closed field.
Algebraic closure for Heyting fields is equivalent in strength to integral closure for Heyting fields:
Suppose that is integrally closed: every monic polynomial function is separable. Then is algebraically closed: every non-constant polynomial function is separable.
One can adapt the proof of theorem 1 of Geuvers, Wiedijk, & Zwanenburg 2000 to the statement that every monic polynomial function of a Heyting field is separable, replacing every statement that “there exists a zero for a polynomial function” with the statement that “the polynomial function is separable”. Lemma 6 and Corollary 1 of Geuvers, Wiedijk, & Zwanenburg 2000 hold for any Heyting field as their proofs only require the field structure of , and the equivalent of Theorem 1 here is that “every non-constant polynomial function is separable” and depends on Lemma 6, Corollary 1, and the statement that “every monic polynomial function is separable” but otherwise only depends on the field structure of .
The converse holds because every monic polynomial function is non-constant.
The algebraic closure of the rational numbers is the algebraic numbers.
The algebraic closure of a field is the splitting field of the set of all monic polynomials over .
The fundamental theorem of algebra is, classically, the statement that the complex numbers form an algebraically closed field .
There are many proofs of the algebraic closure of the complex numbers, all of which are not algebraic in some sense or another; most of them use real analysis or complex analysis in one form or another. However, there is one proof of the fundamental theorem of algebra which is somewhat algebraic, that first proves the real numbers are a real closed field, and then proves that is algebraically closed whenever is a real closed field; this second portion is algebraic classically.
In constructive mathematics, there are multiple different notions of a real closed field. In particular, one can consider the mere existence in the sense of first order logic, that there exists a root of odd degree polynomials in , or one can consider constructive existence in the sense of the BHK interpretation, that one can construct a specified root of odd degree polynomials in .
On one hand, the result that for every non-negative real number there exists a real square root and for every odd degree real polynomial there exists a root of the polynomial is constructively valid. On the other hand, the stronger statement that for every odd degree real polynomial one can construct a specified root of the polynomial is not provable in constructive mathematics without a weak form of choice: that every surjective polynomial function with odd degree and fixed point at zero has a section. This gap is analytic in nature as the weak form of choice implies the existence of discontinuous functions on the real numbers, since any section of the polynomial function is necessarily discontinuous somewhere in the closed interval , which implies the constructive taboo analytic WLPO (see definition 7.3 and proposition 7.5 of Bauer & Hanson 2026). This stronger statement is needed for the algebraic result of being able to factor real polynomials of odd degree into a real polynomial of degree 1 and a monic polynomial of even degree with coefficients in the reals, which is needed to show that the complex numbers are algebraically closed.
More generally, in constructive mathematics, there are many different versions of the fundamental theorem of algebra that are not provably equivalent to the statement that the complex numbers are algebraically closed. Some of these versions of the fundamental theorem of algebra, such as there merely existing a root of every non-constant polynomial function, are provable in constructive mathematics. However, the statement that the complex numbers are algebraically closed is only provable in constructive mathematics when using some constructive taboos, since factorization of a monic polynomial in requires being able to construct the roots of a monic polynomial function in . This in turn is equivalent to a weak form of choice that states that every surjective polynomial function in has a section. This fails in some toposes, such as the topos of sheaves on the real numbers , where all functions on are continuous functions, and any section of a monic polynomial function with degree , if it exists, necessarily has to be discontinuous at a branch cut.
Algebraic closure of Q, a thread on FOM started by Timothy Chow;
be sure to check for improperly replied posts with the same subject in that and the next two months
Bernhard Banaschewski, Algebraic closure without choice, Mathematical Logic Quarterly, Volume 38, Issue 1, 1992, Pages 383-385, [doi:10.1002/malq.19920380136]
Fred Richman, The fundamental theorem of algebra: a constructive development without choice, Pacific Journal of Mathematics 196 1 (2000) 213–230 [doi:10.2140/pjm.2000.196.213, pdf]
Wim Ruitenburg: Constructing Roots of Polynomials over the Complex Numbers, Computational Aspects of Lie Group Representations and Related Topics, CWI Tract 84 Centre for Mathematics and Computer Science, Amsterdam (1991) 107–-128 [pdf, pdf]
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg, A Constructive Proof of the Fundamental Theorem of Algebra without using the Rationals, TYPES ‘00: Selected papers from the International Workshop on Types for Proofs and Programs, Pages 96 - 111, 08 December 2000 [web, pdf]
Henri Lombardi, Claude Quitté (trans. by Tania K. Roblo): Commutative algebra: Constructive methods — Finite projective modules, Springer (2015) [doi:10.1007/978-94-017-9944-7, pdf]
Andrej Bauer, James Hanson, The Countable Reals (arXiv:2404.01256)
Last revised on June 14, 2026 at 02:56:23. See the history of this page for a list of all contributions to it.