no. 15 · Monday 16 November 2026
$\mathbb Z$ is diophantine over $\mathbb Q$ with 26 unknowns
Abstract
Recently, OpenAI proved that Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers has a negative solution. Motivated by this work, G. Conant et al. showed that $\mathbb Z$ is diophantine over $\mathbb Q$, i.e., there is an integer-coefficient polynomial $F(x,y_1,\ldots,y_n)$ such that for any $x\in\mathbb Q$ we have $$ x\in\mathbb Z\quad\iff \exists\,y_1,\ldots,y_{n}\in\mathbb Q\ [F(x,y_1,\ldots,y_{n})=0].$$ They constructed such a polynomial $F$ with $°F=4$ and $n=221$.In this paper, we prove the existence of such a polynomial $F$ with $n=26$. We also show that $16$ existential unknowns suffice under the $abc$-conjecture.
- comments
- 39 pages. Reduce 28 variables to 26 variables, and add Theorem 1.2
- fields
- Number Theory, Logic