Math 2.0

Mathematical logic and foundations Model theory: types, categoricity, stability Theorem

Ax–Grothendieck theorem

Builds on Algebraically closed fieldPolynomial functionInjective functionSurjective functionLefschetz principleFinite field

Statement

Let KK be an algebraically closed field, let n≥1n \ge 1, and let f1,…,fn∈K[x1,…,xn]f_1, \dots, f_n \in K[x_1, \dots, x_n] be polynomials. Let F ⁣:Kn→KnF \colon K^n \to K^n be the map F(a)=(f1(a),…,fn(a))F(a) = (f_1(a), \dots, f_n(a)). If FF is injective, then FF is surjective.

Remarks

For fixed nn and a bound dd on the degrees of the fif_i, the statement is a single first-order sentence in the language of rings. It holds for every finite field, because an injective map from a finite set to itself is surjective. It also holds in the algebraic closure 𝔽p‾\overline{\F_p}, the union of the finite fields 𝔽pk\F_{p^k}. Given an injective FF over 𝔽p‾\overline{\F_p} and a point bb, the coefficients of the fif_i and the coordinates of bb lie in one finite field 𝔽pk\F_{p^k}. The map FF sends 𝔽pkn\F_{p^k}^n injectively into itself, so it is onto 𝔽pkn\F_{p^k}^n, and bb has a preimage. By the Lefschetz principle, it then holds in every algebraically closed field of characteristic 00, such as ℂ\C.

Example: over ℂ\C, the map F(x,y)=(x,y+x2)F(x, y) = (x, y + x^2) is injective, and it is surjective, since (a,b)=F(a,b−a2)(a, b) = F(a, b - a^2).

The hypothesis that KK is algebraically closed is necessary. Over ℚ\Q, the polynomial map x↦x3x \mapsto x^3 is injective but not surjective, since 22 is not the cube of a rational number.

Going deeper

For a student

The theorem was proved by James Ax with model theory and by Alexander Grothendieck with algebraic geometry. The model-theoretic proof is the standard showcase of the Lefschetz principle: a statement checked over finite fields transfers to ℂ\C. The converse fails: a surjective polynomial map need not be injective, as z↦z2z \mapsto z^2 on ℂ\C shows. It is related to the open Jacobian conjecture, which asks whether a polynomial map ℂn→ℂn\C^n \to \C^n with constant nonzero Jacobian determinant has a polynomial inverse.

Reading path

To understand this page from the ground up, read these 14 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Algebraically closed field concept
  2. Characteristic of a field concept
  3. Complex numbers object
  4. Finite field concept
  5. Injective function concept
  6. Model concept
  7. Model theory of algebraically closed fields concept
  8. Polynomial function concept
  9. Satisfiability concept
  10. Sentence concept
  11. Surjective function concept
  12. Compactness theorem statement
  13. Lefschetz principle statement
  14. Ax–Grothendieck theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Ax–Grothendieck_theorem
About this page
TagM2XAN2HGZH
URIm2://M2XAN2HGZH
Kindstatement, theorem
WritingW0 stub
MSC03C60, 14A10, 12L12
StatusThis copy of the site has no build data. Run m2 status M2XAN2HGZH.
AboutAlgebraically closed field
UsesAlgebraically closed field, Polynomial function, Injective function, Surjective function, Lefschetz principle, Finite field
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.