Hilbert's tenth problem

Hilbert's tenth problem is the tenth on the list of Hilbert's problems of 1900. Its statement is as follows:

Given a Diophantine equation with any number of unknown quantities and with rational integral numerical coefficients: "To devise a process according to which it can be determined in a finite number of operations whether the equation is solvable in rational integers".

Formulation

The words "process" and "finite number of operations" have been taken to mean that Hilbert was asking for an algorithm. The term "rational integer" simply refers to the integers, positive, negative or zero: $0,pm\; 1,pm\; 2,\; ldots$. So Hilbert was asking for a general algorithm to decide whether a given polynomial Diophantine equation with integer coefficients has a solution in integers. The answer to the problem is now known to be in the negative: no such general algorithm can exist. Although it is unlikely that Hilbert had conceived of such a possibility, before going on to list the problems, he did presciently remark:

"Occasionally it happens that we seek the solution under insufficient hypothesesor in an incorrect sense, and for this reason do not succeed. The problem then arises: to show the impossibility of the solution under the given hypotheses or in the sense contemplated."

The work on the problem has been in terms of solutions in natural numbers [Following the tradition in mathematical logic, $0$ is considered to be a natural number in this article.] rather than arbitrary integers. But it is easy to see that an algorithm in either case could be used to obtain one for the other. If one possessed an algorithm to determine solvability in natural numbers, it could be used to determine whether an equation in $n$ unknowns,

:$p(x\_1,x\_2,ldots,x\_n)=0,,$

has an integer solution by applying the supposed algorithm to the $2^n$ equations

:$p(pm\; x\_1,\; pm\; x\_2,ldots,pm\; x\_n)=0.\; ,$

Conversely, an algorithm to test for solvability in arbitrary integers could be used to test a given equation for solvability in natural numbers by applying that supposed algorithm to the equation obtained from the given equation by replacing each unknown by the sum of the squares of four new unknowns. This works because of Lagrange's four-square theorem, to the effect that every natural number can be written as the sum of four squares.

Diophantine sets

Sets of natural numbers, of pairs of natural numbers (or even of $n$-tuples of natural numbers) that have Diophantine definitions are called "Diophantine sets".Diophantine definitions can be provided by simultaneous systems of equations as well as by individual equations because the system

:$p\_1=0,ldots,p\_k=0,$

is equivalent to the single equation

:$p\_1^2+ldots+p\_k^2=0.,$

A recursively enumerable set can be characterized as one for which there exists an algorithm that will ultimately halt when a member of the set is provided as input, but will continue indefinitely when the input is a non member. It was the development of computability theory (also known as recursion theory) that provided a precise explication of the intutitive notion of algorithmic computability, thus making the notion of recursive enumerability perfectly rigorous. It is evident that Diophantine sets are recursively enumerable. This is because one can arrange all possible tuples of values of the unknowns in a sequence and then, for a given value of the parameter(s), test these tuples, one after another, to see whether they are solutions of the corresponding equation. The unsolvability of Hilbert's tenth problem is a consequence of the surprising fact that the converse is true:

"Every recursively enumerable set is Diophantine."

This result is variously known as Matiyasevich's theorem (because he provided the crucial step that completed the proof) and the MRDP theorem (for Yuri Matiyasevich, Julia Robinson, Martin Davis, and Hilary Putnam). Because "there exists a recursively enumerable set that is not computable," the unsolvability of Hilbert's tenth problem is an immediate consequence. In fact, more can be said: there is a polynomial :$p(a,x\_1,ldots,x\_n)$with integer coefficients such that the set of values of $a$ for which the equation:$p(a,x\_1,ldots,x\_n)=0$has solutions in natural numbers is not computable. So, not only is there no general algorithm for testing Diophantine equations for solvability, even for this one parameter family of equations, there is no algorithm .

History

Applications

The Matiyasevich/MRDP Theorem relates two notions — one from computability theory, the other from number theory — and has some surprising consequences. Perhaps the most surprising is the existence of a "universal" Diophantine equation:

:"There exists a polynomial" $p(a,n,x\_1,ldots,x\_k)$ "such that, given any Diophantine set" $S$ "there is a number" $n\_0$ "such that"::$S\; =\; \{,a\; mid\; exists\; x\_1,\; ldots,\; x\_k\; [p(a,n\_0,x\_1,ldots,x\_k)=0]\; ,\}$

This can be seen to be true simply because there are universal Turing machines, capable of executing any algorithm. This implication of J.R. had made it seem implausible.

Hilary Putnam has pointed out that for any Diophantine set $S$ of positive integers, there is a polynomial

:$q(x\_0,x\_1,ldots,x\_n),$

such that $S$ consists of exactly the positive numbers among the values assumed by $q$ asthe variables

:$x\_0,x\_1,ldots,x\_n,$

range over all natural numbers. This can be seen as follows: If

:$p(a,y\_1,ldots,y\_n)=0,$

provides a Diophantine definition of $S$, then it suffices to set

:$q(x\_0,x\_1,ldots,x\_n)=\; x\_0\; [1-\; p(x\_0,x\_1,ldots,x\_n)^2]\; .,$

So, for example, there is a polynomial for which the positive part of its range is exactly the prime numbers. (On the other hand no polynomial can only take on prime values.)

Other applications concern what logicians refer to as $Pi^\{0\}\_1$ propositions, sometimes also called propositions of "Goldbach type". [$Pi^\{0\}\_1$ sentences are at one of the lowest levels of the so-called arithmetical hierarchy.] These are like the Goldbach Conjecture, in stating that all natural numbers possess a certain property that is algorithmically checkable for each particular number. [Thus, the Goldbach Conjecture itself can be expressed as saying that for each natural number $n$ the number $2n+4$ is the sum of two prime numbers. Of course there is a simple algorithm to test a given number for being the sum of two primes.] The Matiyasevich/MRDP Theorem implies that each such proposition is equivalent to a statement that asserts that some particular Diophantine equation has no solutions in natural numbers. [In fact the equivalence is provable in Peano Arithmetic.] A number of important and celebrated problems are of this form: in particular, Fermat's Last Theorem, the Riemann Hypothesis, and the Four Color Theorem. In addition the assertion that particular formal systems such as Peano Arithmetic or ZFC are consistent can be expressed as $Pi^\{0\}\_1$ sentences. The idea is to follow Kurt Gödel in coding proofs by natural numbers in such a way that the property of being the number representing a proof is algorithmically checkable.

$Pi^\{0\}\_1$ sentences have the special property that if they are false, that fact will be provable in any of the usual formal systems. This is because the falsity amounts to the existence of a counter-example which can be verified by simple arithmetic. So if a $Pi^\{0\}\_1$ sentence is such that neither it nor its negation is provable in one of these systems, that sentence must be true.

A particularly striking form of Gödel's incompleteness theorem is also a consequence of the Matiyasevich/MRDP Theorem:

"Let"

:$p(a,x\_1,ldots,x\_k)=0,$

"provide a Diophantine definition of a non-computable set. Let" $A$ "be an algorithm that outputs a sequence of natural numbers" $n$ "such that the corresponding equation"

:$p(n,x\_1,ldots,x\_k)=0,$

"has no solutions in natural numbers. Then there is a number" $n\_0$ "which is not output by" $A$ "while in fact the equation"

:$p(n\_0,x\_1,ldots,x\_k)=0,$

"has no solutions in natural numbers."

To see that the theorem is true, it suffices to notice that if there were no such number $n\_0$, one could algorithmically test membership of a number $n$ in this non-computable set by simultaneously running the algorithm $A$ to see whether $n$ is output while also checking all possible $k$-tuples of natural numbers seeking a solution of the equation:$p(n,x\_1,ldots,x\_k)=0.$

We may associate an algorithm $A$ with any of the usual formal systems such as Peano Arithmetic or ZFC by letting it systematically generate consequences of the axioms and then output a number $n$ whenever a sentence of the form

:$eg\; exists\; x\_1,ldots\; ,\; x\_k\; [p(n,x\_1,ldots,x\_k)=0]\; ,$

is generated. Then the theorem tells us that either a false statement of this form is proved or a true one remains unproved in the system in question.

Further results

We may speak of the "degree" of a Diophantine set as being the least degree of a polynomial in an equation defining that set. Similarly, we can call the "dimension" of such a set the least number of unknowns in a defining equation. Because of the existence of a universal Diophantine equation, it is clear that there are absolute upper bounds to both of these quantities, and there has been much interest in determining these bounds.

Already in the 1920s Thoralf Skolem showed that any Diophantine equation is equivalent to one of degree 4 or less. His trick was to introduce new unknowns by equations setting them equal to the square of an unknown or the product of two unknowns. Repetition of this process results in a system of second degree equations; then an equation of degree 4 is obtained by summing the squares. So every Diophantine set is trivially of degree 4 or less. It is not known whether this result is best possible.

Julia Robinson and Yuri Matiyasevich showed that every Diophantine set has dimension no greater than 13. Later, Matiyasevich sharpened their methods to show that 9 unknowns suffice. Although no one imagines that this striking result is the best possible, there has been no further progress. [At this point, even 3 cannot be excluded as an absolute upper bound.] So, in particular, there is no algorithm for testing Diophantine equations with 9 or fewer unknowns for solvability in natural numbers. For the case of rational integer solutions (as Hilbert had originally posed it), the 4 squares trick shows that there is no algorithm for equations with no more than 36 unknowns. But Zhi Wei Sun showed that the problem for integers is unsolvable even for equations with no more than 11 unknowns.

Martin Davis studied algorithmic questions involving the number of solutions of a Diophantine equation. Hilbert's tenth problem asks whether or not that number is 0. Let$A=\{0,1,2,3,ldots,aleph\_0\}$ and let $C$ be a proper non-empty subset of $A$. Davis proved that there is no algorithm to test a given Diophantine equation to determine whether the number of its solutions is a member of the set $C$. Thus there is no algorithm to determine whether the number of solutions of a Diophantine equationis finite, odd, a perfect square, a prime, etc.

Extensions of Hilbert's Tenth Problem

Although Hilbert posed the problem for the rational integers, it can obviously be just as well asked for many rings. Obvious examples are the rings of integers of algebraic number fields as well as the rational numbers. As Hilbert was surely aware, an algorithm such as he was requesting could have been extended to cover these other domains. For example, the equation

:$p(x\_1,ldots,x\_k)=0,$

where $p$ is a polynomial of degree $d$ is solvable in non-negative rational numbers if and only if

:$(z+1)^\{d\};pleft(frac\{x\_1\}\{z+1\},ldots,frac\{x\_k\}\{z+1\}\; ight)=0$

is solvable in natural numbers. (If one possessed an algorithm to determine solvability in non-negative rational numbers, it could easily be used to determine solvability in the rationals.) However, knowing that there is no such algorithm as Hilbert had desired says nothing about these other domains.

There has been much work on Hilbert's tenth problem for the rings of integers of algebraic number fields. Basing themselves on earlier work by Jan Denef and Leonard Lipschitz and using class field theory, Harold N. Shapiro and Alexandra Shlapentokh were able to prove:

"Hilbert's tenth problem is unsolvable for the ring of integers of any algebraic number field whose Galois group over the rationals is abelian."

Shlapentokh and Thanases Pheidas (independently of one another) obtained the same result for algebraic number fields admitting exactly one pair of complex conjugate embeddings.

The problem for the ring of integers of algebraic number fields other than those covered by the results above remains open. Likewise, despite much interest, the problem for equations over the rationals remains open.

Footnotes

References

* Yuri V. Matiyasevich, "Hilbert's Tenth Problem", MIT Press, Cambridge, Massachusetts, 1993.
* Martin Davis, Yuri Matiyasevich, and Julia Robinson, "Hilbert's Tenth Problem: Diophantine Equations: Positive Aspects of a Negative Solution," "Proceedings of Symposia in Pure Mathematics", vol.28(1976), pp. 323-378; reprinted in "The Collected Works of Julia Robinson", Solomon Feferman, editor, pp.269-378, American Mathematical Society 1996.
* Martin Davis, "Hilbert's Tenth Problem is Unsolvable," "American Mathematical Monthly", vol.80(1973), pp. 233-269; reprinted as an appendix in Martin Davis, "Computability and Unsolvability", Dover reprint 1982.
* Jan Denef, Leonard Lipschitz, Thanases Pheidas, Jan van Geel, editors, "Hilbert's Tenth Problem: Workshop at Ghent University, Belgium, November 2-5, 1999." "Contemporary Mathematics" vol. 270(2000), American Mathematical Society.

External links

* [http://www.goldenmuseum.com/1612Hilbert_engl.html Hilbert's Tenth Problem: a History of Mathematical Discovery]
* [http://logic.pdmi.ras.ru/Hilbert10 Hilbert's Tenth Problem page!]
* [http://math.nju.edu.cn/~zwsun/htp.pdf Zhi Wei Sun: On Hilbert's Tenth Problem and Related Topics]