Organization:Tarski's high school algebra problem

Short description: Mathematical problem

In mathematical logic, Tarski's high school algebra problem was a question posed by Alfred Tarski. It asks whether there are identities involving addition, multiplication, and exponentiation over the positive integers that cannot be proved using eleven axioms about these operations that are taught in high-school-level mathematics. The question was solved in 1980 by Alex Wilkie, who showed that such unprovable identities do exist.

Statement of the problem

Tarski considered the following eleven axioms about addition ('+'), multiplication ('·'), and exponentiation to be standard axioms taught in high school:

1. x + y = y + x
2. (x + y) + z = x + (y + z)
3. x · 1 = x
4. x · y = y · x
5. (x · y) · z = x · (y · z)
6. x · (y + z) = x · y + x ·z
7. 1^x = 1
8. x¹ = x
9. x^y + z = x^y · x^z
10. (x · y)^z = x^z · y^z
11. (x^y)^z = x^y · z

These eleven axioms, sometimes called the high school identities, are related to the axioms of a bicartesian closed category or an exponential ring. Tarski's problem then becomes: are there identities involving only addition, multiplication, and exponentiation, that are true for all positive integers, but that cannot be proved using only the axioms 1–11?

Example of a provable identity

Since the axioms seem to list all the basic facts about the operations in question, it is not immediately obvious that there should be anything provably true one can state using only the three operations, but cannot prove with the axioms. However, proving seemingly innocuous statements can require long proofs using only the above eleven axioms. Consider the following proof that [math]\displaystyle{ (x + 1)^2 = x^2 + 2 \cdot x + 1: }[/math]

[math]\displaystyle{ \begin{align} (x+1)^2 &= (x+1)^{1+1} \\ &= (x+1)^1 \cdot (x+1)^1 &&\text{by 9.} \\ &= (x+1) \cdot (x+1) &&\text{by two applications of 8.} \\ &= (x+1) \cdot x + (x+1) \cdot 1 &&\text{by 6.} \\ &= x \cdot (x+1) + (x + 1) &&\text{by 4. and 3.} \\ &= (x \cdot x + x \cdot 1) + (x \cdot 1 + 1) &&\text{by 6. and 3.} \\ &= x \cdot x + (x \cdot 1 + x \cdot 1) + 1 &&\text{by two applications of 2.} \\ &= x^1 \cdot x^1 + x \cdot (1+1) + 1 &&\text{by 6. and two applications of 8.} \\ &= x^{1+1} + x \cdot 2 + 1 &&\text{by 9.} \\ &= x^2 + 2 \cdot x + 1 &&\text{by 4.} \end{align} }[/math]

Strictly we should not write sums of more than two terms without brackets, and therefore a completely formal proof would prove the identity [math]\displaystyle{ (x + 1)^2 = \left(x^2 + 2 \cdot x\right) + 1 }[/math] (or [math]\displaystyle{ (x + 1)^2 = x^2 + (2 \cdot x + 1) }[/math]) and would have an extra set of brackets in each line from [math]\displaystyle{ x \cdot x + (x \cdot 1 + x \cdot 1) + 1 }[/math] onwards.

The length of proofs is not an issue; proofs of similar identities to that above for things like [math]\displaystyle{ (x + y)^{100} }[/math] would take a lot of lines, but would really involve little more than the above proof.

History of the problem

The list of eleven axioms can be found explicitly written down in the works of Richard Dedekind, although they were obviously known and used by mathematicians long before then. Dedekind was the first, though, who seemed to be asking if these axioms were somehow sufficient to tell us everything we could want to know about the integers. The question was put on a firm footing as a problem in logic and model theory sometime in the 1960s by Alfred Tarski, and by the 1980s it had become known as Tarski's high school algebra problem.

Solution

In 1980 Alex Wilkie proved that not every identity in question can be proved using the axioms above. He did this by explicitly finding such an identity. By introducing new function symbols corresponding to polynomials that map positive numbers to positive numbers he proved this identity, and showed that these functions together with the eleven axioms above were both sufficient and necessary to prove it. The identity in question is [math]\displaystyle{ \begin{align} & \left((1+x)^y + (1+x+x^2)^y\right)^x \cdot \left((1+x^3)^x + (1+x^2+x^4)^x\right)^y \\ ={} & \left((1+x)^x + (1+x+x^2)^x\right)^y \cdot \left((1+x^3)^y + (1+x^2+x^4)^y\right)^x. \end{align} }[/math] This identity is usually denoted [math]\displaystyle{ W(x, y) }[/math] and is true for all positive integers [math]\displaystyle{ x }[/math] and [math]\displaystyle{ y, }[/math] as can be seen by factoring [math]\displaystyle{ (1-x+x^2)^{xy} }[/math] out of the second factor on each side; yet it cannot be proved true using the eleven high school axioms.

Intuitively, the identity cannot be proved because the high school axioms can't be used to discuss the polynomial [math]\displaystyle{ 1-x+x^2. }[/math] Reasoning about that polynomial and the subterm [math]\displaystyle{ -x }[/math] requires a concept of negation or subtraction, and these are not present in the high school axioms. Lacking this, it is then impossible to use the axioms to manipulate the polynomial and prove true properties about it. Wilkie's results from his paper show, in more formal language, that the "only gap" in the high school axioms is the inability to manipulate polynomials with negative coefficients.

R. Gurevič showed in 1988 that there is no finite axiomatization for the valid equations for the positive natural numbers with 1, addition, multiplication, and exponentiation.

Generalisations

Wilkie proved that there are statements about the positive integers that cannot be proved using the eleven axioms above and showed what extra information is needed before such statements can be proved. Using Nevanlinna theory it has also been proved that if one restricts the kinds of exponential one takes then the above eleven axioms are sufficient to prove every true statement.

Another problem stemming from Wilkie's result, which remains open, is that which asks what the smallest algebra is for which [math]\displaystyle{ W(x, y) }[/math] is not true but the eleven axioms above are. In 1985 an algebra with 59 elements was found that satisfied the axioms but for which [math]\displaystyle{ W(x, y) }[/math] was false. Smaller such algebras have since been found, and it is now known that the smallest such one must have either 11 or 12 elements.

See also

• Elementary function – Mathematical function
• Elementary function arithmetic – System of arithmetic in proof theory
• Liouville's theorem (differential algebra)
• Nonelementary integral – Integrals not expressible in closed-form from elementary functions
• Richardson's theorem – Undecidability of equality of real numbers

References

• Stanley N. Burris, Karen A. Yeats, The saga of the high school identities, Algebra Universalis 52 no.2–3, (2004), pp. 325–342, MR2161657.