Tarski's axiomatization of the reals
In 1936, Alfred Tarski set out an axiomatization of the real numbers and their arithmetic, consisting of only the 8 axioms shown below and a mere four primitive notions: the set of reals denoted R, a binary total order over R, denoted by infix <, a binary operation of addition over R, denoted by infix +, and the constant 1.
The literature occasionally mentions this axiomatization but never goes into detail, notwithstanding its economy and elegant metamathematical properties. This axiomatization appears little known, possibly because of its second-order nature. Tarski's axiomatization can be seen as a version of the more usual definition of real numbers as the unique Dedekind-complete ordered field; it is however made much more concise by using unorthodox variants of standard algebraic axioms and other subtle tricks (see e.g. axioms 4 and 5, which combine together the usual four axioms of abelian groups).
Axioms of order (primitives: R, <):
- Axiom 1
- If x < y, then not y < x. That is, "<" is an asymmetric relation. This implies that "<" is not a reflexive relationship, i.e. for all x, x < x is false.
- Axiom 2
- If x < z, there exists a y such that x < y and y < z. In other words, "<" is dense in R.
- Axiom 3
- "<" is Dedekind-complete. More formally, for all X, Y ⊆ R, if for all x ∈ X and y ∈ Y, x < y, then there exists a z such that for all x ∈ X and y ∈ Y, if z ≠ x and z ≠ y, then x < z and z < y.
To clarify the above statement somewhat, let X ⊆ R and Y ⊆ R. We now define two common English verbs in a particular way that suits our purpose:
- X precedes Y if and only if for every x ∈ X and every y ∈ Y, x < y.
- The real number z separates X and Y if and only if for every x ∈ X with x ≠ z and every y ∈ Y with y ≠ z, x < z and z < y.
Axiom 3 can then be stated as:
- "If a set of reals precedes another set of reals, then there exists at least one real number separating the two sets."
The three axioms imply that R is a linear continuum.
Axioms of addition (primitives: R, <, +):
- Axiom 4
- x + (y + z) = (x + z) + y.
- Axiom 5
- For all x, y, there exists a z such that x + z = y.
- Axiom 6
- If x + y < z + w, then x < z or y < w.
Axioms for one (primitives: R, <, +, 1):
- Axiom 7
- 1 ∈ R.
- Axiom 8
- 1 < 1 + 1.
Tarski stated, without proof, that these axioms gave a total ordering. The missing component was supplied in 2008 by Stefanie Ucsnay.
This axiomatization does not give rise to a first-order theory, because the formal statement of axiom 3 includes two universal quantifiers over all possible subsets of R. Tarski proved that these 8 axioms and 4 primitive notions are independent.
How these axioms imply a field
Tarski sketched the (nontrivial) proof of how these axioms and primitives imply the existence of a binary operation called multiplication and having the expected properties, so that R is a complete ordered field under addition and multiplication. This proof builds crucially on the integers with addition being an abelian group and has its origins in Eudoxus' definition of magnitude.