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).

The term "Tarski's axiomatization of real numbers" also refers to the theory of real-closed fields, which Tarski showed completely axiomatizes the first-order theory of the structure 〈R, +, ·, <〉.

The axioms

"Axioms of order" (primitives: R, <):

;Axiom 1 :"<" is an asymmetric relation.

;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", "x" ≤ "z" and "z" ≤ "y". Here, "u" ≤ "v" is a shorthand for "u" < "v" or "u" = "v".

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" &isin; "X" and every "y" &isin; "Y", "x" < "y".

:The real number "z separates" "X" and "Y" if and only if for every "x" &isin; "X" with "x" &ne; "z" and every "y" &isin; "Y" with "y" &ne; "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."

"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.

These axioms imply that R is a linearly ordered Abelian group under addition with distinguished element 1. R is also Dedekind-complete and divisible.

These axioms require but three existential quantifiers, one for each of axioms 2, 3, and 5. 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 these 8 axioms and 4 primitive notions 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 addition being an abelian group over the integers and has its origins in Eudoxus' definition of magnitude.

A recent elegant derivation of this result, due to [http://arxiv.org/pdf/math/0405454.pdf Arthan,] [http://arxiv.org/pdf/math/0301015.pdf A'Campo,] and [http://www.maths.mq.edu.au/~street/reals.pdf Ross Street,] can be sketched as follows. An "almost homomorphism" is a map "f":Z→Z such that {"f"("n+m")-"f"("m")-"f"("n"): "n,m"∈Z} is finite. Two almost homomorphisms "f,g" are "almost equal" if {"f"("n")-"g"("n"): "n"∈Z} is finite. This defines an equivalence relation on the set of almost homomorphisms, and the equivalence classes of that relation are simply the real numbers. The sum and product of two real numbers defined in this manner are simply the pointwise sum and composition, respectively, of the corresponding almost homomorphisms. Thus R is a complete ordered field with respect to "<" and the binary operations of addition and multiplication.

References

* Alfred Tarski, 1994 (1936). "Introduction to Logic and to the Methodology of Deductive Sciences". Dover.