Ax-Grothendieck Explained

People sometimes ask me for applications of proof theory to regular mathematics. I find this question very difficult – although the associativity of function composition certainly qualifies! When people ask me for applications of Model Theory, I have a much easier time: I allude to the following theorem.

Theorem. (Ax-Grothendieck) An injective polynomial map f: \mathbb{C}^n \rightarrow \mathbb{C}^n is surjective.

The Ax-Grothendieck theorem feels sensible to everyone who took Complex Analysis. However, they tend to find the proof, and the role of model theory, a bit mysterious. Here, I attempt to explain Ax’s proof to those who speak the language of Abstract Algebra, but not the language of Model Theory. I’ll try to cordon off the logical ingredient into a single, well-defined step. We’ll see that anyone could prove the analogue of this theorem over algebraically closed fields of characteristic p>0. Transferring the result to characteristic zero may feel hopeless: one does not have homomorphisms between fields of different characteristic. Fortunately, Model Theory steps in to bridge this gap.

First, let’s recall the following facts:

Theorem. (Fundamental, of Algebra) Every non-constant polynomial over \mathbb{C} has a root in \mathbb{C}.

We call fields that satisfy (their analogue of) the Fundamental Theorem of Algebra algebraically closed fields. Interestingly, the Fundamental Theorem of Algebra implies the n=1 case of the Ax-Grothendieck theorem.

Exercise. If a polynomial function f: \mathbb{C} \rightarrow \mathbb{C} is injective then it is surjective.
Since f is injective, it is not constant. Take an arbitrary z \in \mathbb{C}. Proving that z has a preimage w.r.t. f suffices to prove that f is surjective. Let’s use the Fundamental Theorem of Algebra to construct this preimage: the polynomial f(x) - z has a root $a \in \mathbb{C}$, giving f(a) - z = 0, or equivalently f(a) = z.

Another important fact about the field of complex numbers:

Theorem. (Categoricity) If the algebraically closed field \mathbb{F} has characteristic zero and is bijective with \mathbb{C}, then it is isomorphic to \mathbb{C}.
Exercise. Hint: how would you prove that two vector spaces with the same dimension are isomorphic? Similary, choose transcendence bases for \mathbb{C} and \mathbb{F} over \mathbb{Q}.

Using a clever trick, we can obtain the analogue of the Ax-Grothendieck theorem for algebraically closed fields of positive characteristic.

Theorem. Let \mathbb{F}_{p,\infty} denote the algebraic closure of \mathbb{F}_p. An injective polynomial map f: \mathbb{F}_{p,\infty}^n \rightarrow \mathbb{F}_{p,\infty}^n is surjective.
Take any such polynomial map f and any element z = (z_1,\dots,z_n) \in \mathbb{F}_{p,\infty}^n. We need to show that z has a preimage w.r.t. f. But that’s easy!
Recall that the algebraic closure \mathbb{F}_{p,\infty} can be constructed by iteratively adjoining roots of polynomials to \mathbb{F}_p: thus, it can be written as the union of a chain of finite fields \mathbb{F}_{p} \subseteq \mathbb{F}_{p,1} \subseteq \mathbb{F}_{p,2} \subseteq \dots. One of these finite fields in the chain, say \mathbb{F}_{p,k}, must contain both z and the coefficients of f.
So our polynomial maps this finite field \mathbb{F}_{p,k} into itself. But injective functions that map finite sets to themselves are surjective on that set (consider this an exercise or see here)! In particular, z has a preimage with respect to $f$. However, z was arbitrary so the function f must be surjective.

Unfortunately, this says nothing about the case of the complex numbers. Or does it? One one hand, we feel that transfer of facts between different characteristics should be possible. On the other hand, we know that the theories of finite and infinite characteristic do not interact via homomorphisms. Logic sidesteps this problem by making the two theories interact at the level of proofs.

Here, we allude to the logical ingredients: first, compactness (related, but not identical to the topological notion). In our case, compactness asserts that if you have a countable set of laws describing the behavior of some hypothetical operations, and you can exhibit examples of operations that satisfy any finite subset of the laws, then you can also exhibit an example of operations that satisfy every law in the countable set. If you find this unintuitive, you should think of it as a logic analogue of the Erdõs-de Bruijn theorem on graph coloring. Second, the Löwenheim-Skolem theorem, which shows that you can exhibit such operations on a set bijective with \mathbb{C}.

Theorem. (Ax-Grothendieck) An injective polynomial map f: \mathbb{C}^n \rightarrow \mathbb{C}^n is surjective.
We will construct an “ideal” algebraically closed field \mathbb{F} of characteristic zero that satisfies the Ax-Grothendieck theorem and is bijective with \mathbb{C}. By the Categoricity Theorem above, \mathbb{F} will turn out to be isomorphic to \mathbb{C}, i.e. \mathbb{C} too satisfies the Ax-Grothendieck theorem.
Consider a structure with two operations, additions and multiplication, that satisfy the laws of a field (finitely many), the laws asserting that the characteristic is zero (1 + 1 \neq 0, 1 + 1 + 1 \neq 0, \dots, countably many), the laws asserting algebraic closure (\forall a,b. \exists x. ax - b = 0, \dots, one for each degree, countably many), and the laws saying that every polynomial map over the field that is injective is surjective (one for each degree, countably many).

Any finite set of these laws contains only finitely many (say $p$) instances of the laws asserting that the characteristic is zero, so the addition and multiplication operations of \mathbb{F}_{p,\infty} satisfy all laws in the finite subset. By the compactness and Löwenheim-Skolem theorems, there is a set \mathbb{F} bijective with \mathbb{C} that has addition and multiplication operations satisfying all of the laws! This means that \mathbb{F} is an algebraically closed field of characteristic zero that satisfies the Ax-Grothendieck theorem. By the Categoricity Theorem, it is isomorphic to \mathbb{C}.

Leave a Reply

Your email address will not be published. Required fields are marked *