## What is the geometry of an undecidable diophantine equation?

As an arithmetic algebraic geometer of the highest moral fiber, I am trained to look at Diophantine equations in terms of the geometry of the corresponding scheme. For instance, if the Diophantine equation comes from a curve, I know that I should compute the genus, and do various things depending on if the genus is $0$, $1$, or $\geq 2$.

But I know very little about what the limits of this geometric approach are. I only know that there exist undecidable Diophantine equations, or families of Diophantine equations. I do not know what their geometry is like!

Do undecidable Diophantine equations, or families of equations, have interesting geometric properties? Can we compute basic geometric invariants like the Hodge diamond, Kodaira dimension, etc.? Are they pathological in every way, or do some of them have properties that might give a naive geometer hope about finding solutions? What would Noam Elkies try to do if he were asked to solve them and did not know they were undecidable, and why would he be stymied?

-
Title should be "The geometry of undecidable diophantine equations: WWNED?" – R Hahn Dec 4 at 18:32
Maybe we need a Noam Elkies tag as well? :-) – Todd Trimble Dec 4 at 19:27
If I go add ask-noam to 50 questions where it would be appropriate, do I get the taxonomist badge? – Will Sawin Dec 4 at 22:39
I never checked this myself, but Mazur told a number of us many years ago that he had looked at Matiyasevich's equations, and found that they all had plenty of rational solutions. Someone should ask him about this. Alternatively, you could look at the equations yourself. This doesn't answer your question, but it's a start. – Minhyong Kim Dec 5 at 0:17
And Minhyong, while you're here, I remember reading in one of your survey something that I liked, and that seems related to the question: the hope that the question of which algebraic curves over $\mathbb Q$ has a rational solution might be decidable -- even if for general variety, it is probably not (though we don't know it for sure yet). – Joël Dec 5 at 2:13

You have a typical recursively enumerable set S of integers, and a set X of lattice points cut out by a multivariate polynomial. We are talking about S being the projection (onto one axis) of X. Given that S can be "pretty bad", can one say anything except that X is "presumably worse"? None of the interest lies in any finite segment of S.

To put it another way, possibly more interesting to geometers, the analogy with constructible sets fails here. There is some hint in the history that Hilbert was misled by elimination theory into thinking that Godel's incompleteness theorem (or suchlike) couldn't be the case. (I'm not putting this very well, and it is disrespectful in a way to Hilbert.) Anyway algebraic geometers "know" that projection doesn't really innovate that much in the way of geometry, and logicians "know" the precise opposite in terms of logic. So at the very least the intuitions are in tension.

(Maybe the mistake of thinking that "geometry of undecidable diophantine systems" was a kind of impossible object, and therefore all r.e. sets would turn out to be recursive, is a mistake intelligent enough to attribute to Hilbert. As a kind of Fundamental Theorem of Proof Theory.)

-
 I'm not interested in the set $X$ of lattice points, but in the whole set of complex points. This should hopefully be a more manageable object, due to the first-order decidability of complex stuff. – Will Sawin Dec 5 at 6:42

Though I don't have a full answer to your question, the following remarks may help.

Let's distinguish between (1) explicit examples of systems of Diophantine equations that are known to be undecidable, and (2) a system of Diophantine equations that has the property of being undecidable, whether we know it or not.

Regarding number (1), Jones has written down some explicit examples. The main practical difficulty with computing any invariants of these examples is their size. The basic example in the paper has 28 variables and degree $5^{60}$, which can be rewritten as a system in 58 variables and degree 2. My guess is that any Groebner basis algorithm would crash on this example, not because of any particular pathology, but because of its size. However, maybe I'm wrong. The example is written out explicitly so you could try playing with it yourself.

Regarding number (2), although I'm not aware of any precise theorems to this effect, I think that the intuition of most logicians and computability theorists is that "most" systems of Diophantine equations are undecidable. (This is related to the intuition that "most" computably enumerable sets are not computable.) If this intuition is correct, then undecidable Diophantine equations aren't "special"; it's just the reverse—the decidable ones are the ones that are special. Then your question is not very different from the question, what is the geometry of a "random" set of Diophantine equations? So it becomes more of a question in computational commutative algebra than a question in computability theory.

-
 This reminds me of the tone of Weinberger's book "Computers, Rigidity, and Moduli": books.google.com/books?id=CtvmQiuOKSEC – Steve Huntsman Dec 4 at 20:46 Number of variables and degree is a clumsy way of describing geometry. I know that people in this field like to write systems $f_1=f_2=\cdots=f_N=0$ as a single system $f_1^2+f_2^2+\cdots + f_N^2$. If we undo all such obvious tricks to get back to a system of equations, then what is the dimension of the complex solution space? – David Speyer Dec 4 at 21:30 @David: Jones's system has 28 variables and 18 equations in its original formulation. Of course this doesn't necessarily mean that the dimension is 10. I don't know how to determine the dimension without first computing a Groebner basis. – Timothy Chow Dec 4 at 22:35 I don't think this accurately reflects my question. There are many ways in which an algebraic variety can be special: low dimension, low kodaira dimension, etc. I would like to know about algebraic varieties which are "general" in that there diophantine problems are undecidable, but "special" in that they have some other nice property. There are two ways at getting at the existence of these things: showing that varieties with a certain set of nice properties have decidable Dipohantine problems (I'm aware of some conjectures to this effect), and the reverse: finding varieties with certain – Will Sawin Dec 4 at 22:44 sets of nice properties that do not have decidable Diophantine problems. I am interested in the second approach. I am disheartened by the dimension difficulty. That might entirely kill this question, but hopefully there is something interesting that can still be said. – Will Sawin Dec 4 at 22:46
I don't know much about explicit decidability results. Here is an interesting discussion of a conjectural one: terrytao.wordpress.com/2007/05/04/… – Will Sawin Dec 5 at 6:35