The theorem is often given as this special case: If P is an injective polynomial function from an n-dimensional complex vector space to itself then P is bijective. That is, if P always maps distinct arguments to distinct values, then the values of P cover all of Cn.
Proof via finite fieldsEdit
Grothendieck's proof of the theorem is based on proving the analogous theorem for finite fields and their algebraic closures. That is, for any field F that is itself finite or that is the closure of a finite field, if a polynomial P from Fn to itself is injective then it is bijective.
If F is a finite field, then Fn is finite. In this case the theorem is true for trivial reasons having nothing to do with the representation of the function as a polynomial: any injection of a finite set to itself is a bijection. When F is the algebraic closure of a finite field, the result follows from Hilbert's Nullstellensatz. The Ax–Grothendieck theorem for complex numbers can therefore be proven by showing that a counterexample over C would translate into a counterexample in some algebraic extension of a finite field.
This method of proof is noteworthy in that it is an example of the idea that finitistic algebraic relations in fields of characteristic 0 translate into algebraic relations over finite fields with large characteristic. Thus, one can use the arithmetic of finite fields to prove a statement about C even though there is no homomorphism from any finite field to C. The proof thus uses model-theoretic principles to prove an elementary statement about polynomials. The proof for the general case uses a similar method.
There are other proofs of the theorem. Armand Borel gave a proof using topology. The case of n = 1 and field C follows since C is algebraically closed and can also be thought of as a special case of the result that for any analytic function f on C, injectivity of f implies surjectivity of f. This is a corollary of Picard's theorem.
Another example of reducing theorems about morphisms of finite type to finite fields can be found in EGA IV: There, it is proved that a radicial S-endomorphism of a scheme X of finite type over S is bijective (10.4.11), and that if X/S is of finite presentation, and the endomorphism is a monomorphism, then it is an automorphism (17.9.6). Therefore, a scheme of finite presentation over a base S is a cohopfian object in the category of S-schemes.
The Ax–Grothendieck theorem may also be used to prove the Garden of Eden theorem, a result that like the Ax–Grothendieck theorem relates injectivity with surjectivity but in cellular automata rather than in algebraic fields. Although direct proofs of this theorem are known, the proof via the Ax–Grothendieck theorem extends more broadly, to automata acting on amenable groups.
Some partial converses to the Ax-Grothendieck Theorem:
- A generically surjective polynomial map of n-dimensional affine space over a finitely generated extension of Z or Z/pZ[t] is bijective with a polynomial inverse rational over the same ring (and therefore bijective on affine space of the algebraic closure).
- A generically surjective rational map of n-dimensional affine space over a Hilbertian field is generically bijective with a rational inverse defined over the same field. ("Hilbertian field" being defined here as a field for which Hilbert's Irreducibility Theorem holds, such as the rational numbers and function fields.)
- Ax, James (1968), "The elementary theory of finite fields", Annals of Mathematics, Second Series, 88 (2): 239–271, doi:10.2307/1970573, JSTOR 1970573.
- Grothendieck, A. (1966), Éléments de géométrie algébrique. IV. Étude locale des schémas et des morphismes de schémas. III., Inst. Hautes Études Sci. Publ. Math., 28, pp. 103–104, Theorem 10.4.11.
- Tao, Terence (2009-03-07). "Infinite fields, finite fields, and the Ax-Grothendieck theorem". What's New. Archived from the original on 11 March 2009. Retrieved 2009-03-08. Cite uses deprecated parameter
- Serre, Jean-Pierre (2009), "How to use finite fields for problems concerning infinite fields", Arithmetic, geometry, cryptography and coding theory, Contemp. Math., 487, Providence, R.I.: Amer. Math. Soc., pp. 183–193, arXiv:0903.0517, Bibcode:2009arXiv0903.0517S, MR 2555994
- Éléments de géométrie algébrique, IV3, Proposition 10.4.11.
- Ceccherini-Silberstein, Tullio; Coornaert, Michel (2010), On algebraic cellular automata, arXiv:1011.4759, Bibcode:2010arXiv1011.4759C.
- McKenna, Ken; van den Dries, Lou (1990), "Surjective polynomial maps, and a remark on the Jacobian problem", Manuscripta Mathematica, 67 (1): 1–15, doi:10.1007/BF02568417, MR 1037991.
- O’Connor, Michael (2008), Ax’s Theorem: An Application of Logic to Ordinary Mathematics.