Algebraically Closed Fields (ACF)

Origin. Tarski's quantifier elimination for algebraically closed fields (1930s; published in A Decision Method for Elementary Algebra and Geometry, 1948/1951) established completeness and decidability of ACF_p. Robinson recast it as model completeness and used it to give a model-theoretic proof of Hilbert's Nullstellensatz. Morley's categoricity theorem (1965) has ACF as its motivating example; the stability-theoretic analysis of ACF as a strongly minimal theory is the origin of geometric model theory.

Models. Algebraically closed fields of a fixed characteristic. The axioms are the field axioms plus a schema saying every nonconstant polynomial has a root, plus a characteristic specification — and that determines the theory completely: an algebraically closed field is fixed up to isomorphism by its characteristic and transcendence degree, so ACF_p is categorical in every uncountable cardinal. Quantifier elimination makes definable sets constructible, which is the Chevalley theorem, and the entire dictionary between algebraic geometry and model theory starts here.

Formalism.

Language: +, ×, −, 0, 1 (the language of rings).

Axioms of ACF:

• The field axioms (commutative ring, 1 ≠ 0, multiplicative inverses for nonzero elements)
• Algebraic closure, one axiom per degree n ≥ 1: ∀a₀…∀a_{n−1} ∃x (xⁿ + a_{n−1}x^{n−1} + ⋯ + a₀ = 0)

ACF_p: ACF plus the characteristic: ACF_p (p prime): the axiom 1 + 1 + ⋯ + 1 = 0 (p times) ACF_0: the infinite schema p·1 ≠ 0, one axiom for each prime p. ACF itself is incomplete; each ACF_p is complete. ACF_p for p prime is finitely axiomatizable up to the closure schema; ACF_0 is not finitely axiomatizable.

Quantifier elimination (Tarski): every formula is equivalent, modulo ACF, to a Boolean combination of polynomial equations f(x̄) = 0. Consequences:

• ACF_p is complete: the quantifier-free sentences are decided by the prime field, which is fixed by p.
• ACF_p is decidable.
• Definable sets are exactly the constructible sets — finite Boolean combinations of Zariski-closed sets. This is Chevalley's theorem, and QE is its proof.
• Model completeness, hence the Nullstellensatz: a system of polynomial equations with coefficients in a field K has a solution in the algebraic closure iff 1 is not in the ideal it generates. Robinson's proof is two lines from model completeness.

Categoricity (Morley's example): An algebraically closed field is determined up to isomorphism by (characteristic, transcendence degree over the prime field). For κ > ℵ₀: a model of size κ has transcendence degree κ, so ACF_p is κ-categorical for all uncountable κ. Not ℵ₀-categorical: transcendence degrees 0, 1, 2, …, ℵ₀ give ℵ₀ + 1 pairwise non-isomorphic countable models. This is the standard witness that Morley's theorem — uncountably categorical in one uncountable cardinal implies in all — is not vacuous, and ACF is where Morley's proof was found.

Stability: ACF_p is strongly minimal: every definable subset of a model, in one variable with parameters, is finite or cofinite. (Immediate from QE — a polynomial in one variable has finitely many roots.) Hence ω-stable, of Morley rank 1, and algebraic closure in the field sense coincides with model-theoretic algebraic closure. The pregeometry is the transcendence-degree pregeometry, which is non-trivial and non-modular — the source of the Zilber trichotomy.

Lefschetz principle: a sentence in the ring language is true in ℂ iff it is true in ACF_p for all sufficiently large p. Immediate from completeness of each ACF_p plus compactness. This turns statements about characteristic 0 into statements about all large characteristics and back; the Ax–Grothendieck theorem (injective polynomial maps ℂⁿ → ℂⁿ are surjective) is the standard application.

Symbols.

Metatheory. ACF_p is the theory model theory was built on. Quantifier elimination gives completeness, decidability, model completeness, and Chevalley's theorem at once; uncountable categoricity with countable non-categoricity is the exact shape Morley's theorem describes, and ACF is the example Morley had; strong minimality with the transcendence pregeometry is the origin of geometric stability theory and of Zilber's trichotomy. The Lefschetz principle is what completeness means in practice — a transfer between characteristics that algebraic geometers use without reference to logic and that has no proof except through completeness and compactness. The theory decides everything and codes nothing: no interpretation of Q, no sequence coding, no incompleteness.

Applies to. Algebraic geometry, through the constructible-sets dictionary and the Nullstellensatz. Diophantine geometry and the model-theoretic proofs of Mordell–Lang (Hrushovski), which run through the stability theory of fields. Difference and differential fields (ACFA, DCF), which are the expansions where the technique continues. Transfer arguments between characteristics — Ax–Grothendieck and its relatives. Computer algebra, where the decision procedure is Gröbner-basis computation.

Limitations. Decidable but not feasibly: quantifier elimination for ACF is doubly exponential in the number of variables, and the Gröbner-basis implementations inherit that. The theory has no order — the field ℂ is not orderable, and everything real-algebraic requires RCF instead. It cannot express "algebraically closed" in a single axiom, nor characteristic 0 finitely. Uncountable categoricity is a strong property that ACF has for a specific reason (a dimension theory given by transcendence degree), and the entries that inherit it inherit it only as far as that reason extends.

© 2026 Lingenic LLC