nLab algebraically closed field

Contents

Contents

Idea

A field kk is algebraically closed if every non-constant polynomial (with one variable and coefficients from kk) has a root in kk. It follows that every polynomial of degree nn can be factored uniquely (up to permutation of the factors) as

p=c i=1 n(xa i), p = c \prod_{i = 1}^n (\mathrm{x} - a_i) ,

where cc and the a ia_i are elements of kk.

An algebraic closure of an arbitrary field kk is an algebraically closed field k¯\bar{k} equipped with a field homomorphism (necessarily an injection) i:kk¯i: k \to \bar{k} such that k¯\bar{k} is an algebraic extension of kk (which means that every element of k¯\bar{k} is the root of some non-zero polynomial with coefficients only from kk). For example, \mathbb{C} is an algebraic closure of \mathbb{R}. An algebraic closure of kk can also be described as a maximal algebraic extension of kk. The axiom of choice proves the existence of k¯\bar{k} for any field kk, as well as its uniqueness up to isomorphism over kk. (See splitting field for a more refined result.) However, note that k¯\bar{k} need not be unique up to unique isomorphism, so it's not really appropriate to speak of the algebraic closure of kk. For example, complex conjugation is a nontrivial automorphism of \mathbb{C} over \mathbb{R}.

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 FF¯F \mapsto \widebar{F} that renders the inclusion i:FF¯i: F \to \widebar{F} natural:

Example

Supposing there were such an algebraic closure functor FF¯F \mapsto \widebar{F}, consider its application to the (equalizer) diagram

conjid.\mathbb{R} \to \mathbb{C} \underoverset{conj}{id}{\rightrightarrows} \mathbb{C}.

We would have a commutative naturality diagram (meaning serially commutative on the right)

i conjid i id id ¯ i¯ ¯ conj¯id¯ ¯\array{ \mathbb{R} & \stackrel{i}{\to} & \mathbb{C} & \underoverset{conj}{id}{\rightrightarrows} & \mathbb{C} \\ \mathllap{i} \downarrow & & \mathllap{id} \downarrow & & \downarrow \mathrlap{id} \\ \widebar{\mathbb{R}} & \stackrel{\widebar{i}}{\to} & \widebar{\mathbb{C}} & \underoverset{\widebar{conj}}{\widebar{id}}{\rightrightarrows} & \widebar{\mathbb{C}} }

where serial commutativity of the right square(s) forces id¯conj¯\widebar{id} \neq \widebar{conj}, but functoriality applied to the equation idi=conjiid \circ i = conj \circ i on the top forces id¯=conj¯\widebar{id} = \widebar{conj} (no matter which isomorphism i¯\widebar{i} is taken to be, idid or conjconj).

Thus, any two algebraic closures are isomorphic, but not naturally so.

Classical invariants

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:

Theorem

Two algebraically closed fields K,KK, K' are isomorphic iff they have the same characteristic pp (the nonnegative generator of the kernel of the unique ring map K\mathbb{Z} \to K) 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, KK contains a subring isomorphic to /(p)[S]\mathbb{Z}/(p)[S] where SS is a transcendence basis, and similarly KK' contains a subring isomorphic to /(p)[S]\mathbb{Z}/(p)[S']. By hypothesis, there is a bijection f:SSf: S \to S', which extends uniquely to an isomorphism of integral domains /(p)[S]/(p)[S]\mathbb{Z}/(p)[S] \to \mathbb{Z}/(p)[S'], which extends uniquely to an isomorphism of their fields of fractions 𝔽(S)𝔽(S)\mathbb{F}(S) \to \mathbb{F}(S'). Then K,KK, K' are algebraic closures of these fields, and one applies a theorem that an isomorphism of fields 𝔽(S)𝔽(S)\mathbb{F}(S) \to \mathbb{F}(S') can be extended to an isomorphism KKK \to K' 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 /(p)\mathbb{Z}/(p)),

  • 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:

Lemma

Let KK be an algebraically closed field, and let cl:P(K)P(K)cl: P(K) \to P(K) be the operator that takes a subset SKS \subseteq K to the smallest algebraically closed subfield that contains SS. Then clcl is a pregeometry.

Proof

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

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:

Theorem

Suppose that FF is integrally closed: every monic polynomial function is separable. Then FF is algebraically closed: every non-constant polynomial function is separable.

Proof

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 FF as their proofs only require the field structure of FF, 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 FF.

The converse holds because every monic polynomial function is non-constant.

Examples

Algebraic closure of the complex numbers

The fundamental theorem of algebra is, classically, the statement that the complex numbers form an algebraically closed field \mathbb{C}.

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 R[i]R[\mathrm{i}] is algebraically closed whenever RR 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 \mathbb{R}, 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 RR.

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 xx 33xx \mapsto x^3 - 3x is necessarily discontinuous somewhere in the closed interval [2,2][-2, 2], 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 \mathbb{C} requires being able to construct the nn roots of a monic polynomial function in \mathbb{C}. This in turn is equivalent to a weak form of choice that states that every surjective polynomial function in \mathbb{C} has a section. This fails in some toposes, such as the topos of sheaves on the real numbers \mathbb{R}, where all functions on \mathbb{C} are continuous functions, and any section of a monic polynomial function with degree n2n \geq 2, if it exists, necessarily has to be discontinuous at a branch cut.

 References

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.