Math 2.0

Proposition

Robinson's principle

Statement

The compactness theorem implies the following result, stated by Abraham Robinson in his 1949 dissertation.

Robinson's principle: If a first-order sentence holds in every field of characteristic zero, then there exists a constant pp such that the sentence holds for every field of characteristic larger than p.p. This can be seen as follows: suppose φ\varphi is a sentence that holds in every field of characteristic zero. Then its negation ¬φ,\lnot \varphi, together with the field axioms and the infinite sequence of sentences

1+1≠0,    1+1+1≠0,  …1 + 1 \neq 0, \;\; 1 + 1 + 1 \neq 0, \; \ldots

is not satisfiable (because there is no field of characteristic 0 in which ¬φ\lnot \varphi holds, and the infinite sequence of sentences ensures any model would be a field of characteristic 0). Therefore, there is a finite subset AA of these sentences that is not satisfiable. AA must contain ¬φ\lnot \varphi because otherwise it would be satisfiable. Because adding more sentences to AA does not change unsatisfiability, we can assume that AA contains the field axioms and, for some k,k, the first kk sentences of the form 1+1+⋯+1≠0.1 + 1 + \cdots + 1 \neq 0. Let BB contain all the sentences of AA except ¬φ.\lnot \varphi. Then any field with a characteristic greater than kk is a model of B,B, and ¬φ\lnot \varphi together with BB is not satisfiable. This means that φ\varphi must hold in every model of B,B, which means precisely that φ\varphi holds in every field of characteristic greater than k.k. This completes the proof.

The Lefschetz principle, one of the first examples of a transfer principle, extends this result. A first-order sentence φ\varphi in the language of rings is true in some (or equivalently, in every) algebraically closed field of characteristic 0 (such as the complex numbers for instance) if and only if there exist infinitely many primes pp for which φ\varphi is true in some algebraically closed field of characteristic p,p, in which case φ\varphi is true in all algebraically closed fields of sufficiently large non-0 characteristic p.p. One consequence is the following special case of the Ax–Grothendieck theorem: all injective complex polynomials ℂn→ℂn\mathbb{C}^n \to \mathbb{C}^n are surjective (indeed, it can even be shown that its inverse will also be a polynomial). In fact, the surjectivity conclusion remains true for any injective polynomial Fn→FnF^n \to F^n where FF is a finite field or the algebraic closure of such a field.

Further reading

  1. Wikipedia, page 152207, revision 1312261892, Compactness theorem, section Applications > Robinson's principle. adopted
About this page
TagY5C37JR9RR
URIm2://Y5C37JR9RR
Kindstatement, proposition
WritingW0 stub
StatusThis copy of the site has no build data. Run m2 status Y5C37JR9RR.
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • edge uses out: each definition that the statement needs (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.