Math 2.0

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

Lefschetz principle

Builds on Model theory of algebraically closed fieldsAlgebraically closed fieldCharacteristic of a fieldSentenceCompactness theoremComplex numbers

Statement

Let φ\varphi be a first-order sentence in the signature of rings {+,−,⋅,0,1}\set{+, -, \cdot, 0, 1}. The following are equivalent:

  1. φ\varphi holds in the field ℂ\C of complex numbers.
  2. φ\varphi holds in every algebraically closed field of characteristic 00.
  3. φ\varphi holds in some algebraically closed field of characteristic 00.
  4. There is an integer mm such that φ\varphi holds in every algebraically closed field of characteristic pp, for every prime p>mp > m.
  5. φ\varphi holds in algebraically closed fields of characteristic pp for infinitely many primes pp.

Remarks

Clauses 1, 2 and 3 are equivalent because the theory ACF0\mathrm{ACF}_0 of algebraically closed fields of characteristic 00 is complete. Suppose φ\varphi holds in ACF0\mathrm{ACF}_0. By the compactness theorem, φ\varphi follows from ACF\mathrm{ACF} and finitely many of the axioms 1+⋯+1≠01 + \cdots + 1 \ne 0. So it holds in characteristic pp for all large pp, which is clause 4. Clause 4 gives 5, since there are infinitely many primes. If φ\varphi fails in ACF0\mathrm{ACF}_0, then ¬φ\neg \varphi holds there, so ¬φ\neg \varphi holds in all large characteristics and 5 fails.

Example: fix nn and dd. The statement "every injective polynomial map Kn→KnK^n \to K^n whose components have degree at most dd is surjective" is a first-order sentence about the field KK. It holds in the algebraic closure of each finite field 𝔽p\F_p, so by clause 5 it holds in ℂ\C. This is the model-theoretic proof of the Ax–Grothendieck theorem.

The principle holds only for first-order sentences. The statement "every element is algebraic over the prime field" holds in the algebraic closure of each 𝔽p\F_p but fails in ℂ\C. It is not expressible by a single first-order sentence.

Going deeper

For a student

The principle lets one prove algebraic facts about ℂ\C by working over finite fields, where counting arguments are available, or the other way around. It comes from the completeness of ACFp\mathrm{ACF}_p for each pp, which itself follows from quantifier elimination or from uncountable categoricity and the Łoś–Vaught test. Take the algebraic closures of the fields 𝔽p\F_p and a non-principal ultrafilter on the primes. Their ultraproduct is an algebraically closed field of characteristic 00, which gives another view of clause 4.

Reading path

To understand this page from the ground up, read these 9 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. Model concept
  5. Model theory of algebraically closed fields concept
  6. Satisfiability concept
  7. Sentence concept
  8. Compactness theorem statement
  9. Lefschetz principle statement

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Algebraically_closed_field
About this page
TagSKTMN14X5P
URIm2://SKTMN14X5P
Kindstatement, theorem
WritingW0 stub
MSC03C60, 12L12
StatusThis copy of the site has no build data. Run m2 status SKTMN14X5P.
AboutModel theory of algebraically closed fields
UsesModel theory of algebraically closed fields, Algebraically closed field, Characteristic of a field, Sentence, Compactness theorem, Complex numbers
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

Used by