ℤ is Diophantine in ℚ
This title uses two symbols. means the whole numbers, such as , , and . means the fractions, such as and . Every whole number is also a fraction, because is the same as .
A polynomial is a formula that only adds and multiplies numbers and variables. For example, is a polynomial. A polynomial equation sets such a formula equal to zero.
You can use an equation as a test. You have a number , and the equation has and some extra variables in it. The number passes if some fractions for the extra variables make the equation true. If no fractions work, fails.
Here is an example, with the equation . The number passes, because gives . The number fails, because times any is , and is never . So this equation tests if a number is not zero.
Here is a second example, with the equation . The number passes, because works. The number fails, because no fraction squared gives . So this equation tests if a number is the square of a fraction.
A set of fractions is Diophantine in if one equation like this can test for it. The name comes from Diophantus, a Greek mathematician who studied equations. So the nonzero numbers are Diophantine in , and so are the squares.
The title says that the whole numbers are also Diophantine in . One equation exists that every whole number passes and every other fraction fails. So and pass, and and fail.
This is surprising. You can see that is not a whole number by looking at its bottom number. An equation cannot do that. It can only add and multiply.
There was also a strong reason to doubt it. The solutions of an equation form a curve or a surface, and the figure shows one. Fraction solutions usually crowd together along such a shape, so the points directly below them on the line crowd together too. But the whole numbers sit apart, with a gap of 1 between neighbors. A conjecture of Barry Mazur would have ruled out such an equation.
A new paper reports that the equation exists, and it publishes all of it. The equation has 12,504 variables: and 12,503 extra variables. Its highest power is 4, it has 135,721 terms, and its largest number has 24 digits.
The equation is a sum of 11,939 squares, set equal to zero. The square of a fraction is never negative, so the sum is zero only if every square is zero. So one equation holds 11,939 separate conditions, and the highest power in each condition is 2.
Here is what it gives. A question about whole numbers becomes a question about fractions. To ask for a whole number , ask for a fraction that also passes the test. This connects to Hilbert's tenth problem, which asks if a computer can decide such questions.