48 unknowns for Hilbert's tenth problem over the rationals
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: I'm Ada.
Emmy: And I'm Emmy, here with Kolya.
Ada: We're looking at the paper: "48 unknowns for Hilbert's tenth problem over the rationals".
Emmy: Here's the gist of the paper. Hilbert’s tenth problem over the rationals is proven undecidable by establishing a decision procedure relative to a rational oracle using five-contact height estimates and an existential predicate excluding odd poles.
Ada: Theorem Statement The paper proves that HTP86(Q) is undecidable.
Emmy: This result is achieved by combining the height and Selmer-theoretic inputs from
11: with Sun’s result that HTP10(Z) is undecidable.
Ada: Construction Strategy The proof employs five strategies to save variables in the construction.
Paper summary: Ada: So, to wrap up, this paper "forty-eight unknowns for Hilbert's tenth problem over the rationals" proves that there is no algorithm to decide if any polynomial with eighty-six rational variables has solutions in the rationals >
Emmy: The authors, Zhi-wei Sun, they are using height and Selmer theory to connect with older results about integer versions of this problem being undecidable <ref:2610.20691#pg2>, from eleven and Sun's result >
Kolya: So what does this actually mean for anyone listening? It means there's a hard limit on how much we can automate when trying to find solutions to these kinds of equations over rational numbers >
Emmy: The paper builds this proof by showing how specific algebraic shapes get encoded into those eighty-six variables in a way that actively resists being solved by an algorithm >
Kolya: That sounds complicated, but when you break it down, what's the actual scale of these eighty-six unknowns when you're talking about rational fields >
Conclusion: Ada: So, we're talking about this paper, "Forty-eight unknowns for Hilbert's tenth problem over the rationals." It really tackles how hard this specific problem is when you move from integers to rational numbers >
Emmy: The authors are Zhi-wei Sun. They’re using these height and Selmer theory tools to link it back to older results about the integer version of this problem being impossible to solve algorithmically >
Kolya: So, what does this actually mean for the world? It means there's a hard limit on how much we can automate when trying to find solutions to these types of equations over rational numbers >
Ada: Exactly. It shows that adding more variables, even up to eighty-six, you hit a wall where no general procedure will ever work for finding those solutions >
Emmy: The proof works by showing how specific algebraic shapes get encoded into those eighty-six variables in a way that actively resists being solved by an algorithm >
Kolya: That sounds incredibly dense, but when you break down the structure, what's the actual scale of these eighty-six unknowns when you're dealing with rational fields >
Ada: The point is that we can't just keep increasing the number of variables and expect a simple method to suddenly work for everything >
Emmy: The paper builds this proof by showing how specific logarithmic ratios at primes, which the height estimate detects, agree modulo high prime powers and therefore they match integer indices >
Kolya: That sounds complicated, but when you break it down, what's the actual scale of these eighty-six unknowns when you're talking about rational fields >
Ada: We can’t just keep increasing the number of variables and expect a simple method to suddenly work for everything >
National Natural Science Foundation of China
math.NT, math.LO
Submitted: 2026-10-14
Updated: 2026-11-11
Comments: 57 pages. Reduce 86 variables to 48 variables
Code: https://github.com/openai/math
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 77/100
The gist: Hilbert’s tenth problem over the rationals is proven undecidable by establishing a decision procedure relative to a rational oracle using five-contact height estimates and an existential predicate…
Key concepts
- HTP86(Q)
- This refers to Hilbert's tenth problem over the rationals with 86 unknown rational variables. The paper shows that there is no general algorithm to determine if a polynomial with integer coefficients equals zero when evaluated at these 86 rational inputs.
- Five-contact height estimates
- These are mathematical tools used in the proof to bound the complexity of the construction. They help control how large or complicated certain geometric or arithmetic objects become during the process of building a complex polynomial expression.
- Existential predicate excluding odd poles
- This is a specific condition used in the proof's machinery. It relates to properties of points on elliptic curves, specifically ruling out certain types of singularities (odd poles) to ensure the construction remains valid and leads to the desired undecidability result.
Terminology
Summary
Hilbert’s tenth problem over the rationals is proven undecidable by establishing a decision procedure relative to a rational oracle using five-contact height estimates and an existential predicate excluding odd poles. p. 0
Theorem Statement
The paper proves that HTP86(Q) is undecidable. This result is achieved by combining the height and Selmer-theoretic inputs from [11] with Sun’s result that HTP10(Z) is undecidable. p. 1
Construction Strategy
The proof employs five strategies to save variables in the construction. These strategies involve moving height contacts to finite points, defining rational components, creating prime-pattern expressions, using a Chinese Remainder Theorem extension for simultaneous prime construction, dividing local expressions by denominators involving (t − ξ), and replacing the rational source tuple with local precision tests. p. 2 The total number of variables required is 86. p. 2
Arithmetic Data and Predicates
The paper defines arithmetic data including absolute logarithmic Weil heights, prime ideal valuations, and a pole-parity predicate. The construction relies on a cyclic elliptic subgroup defined over F = Q(√2) and the existence of a non-torsion point P such that mE(F) = ZP. p. 3 Lemma 2.1 establishes a relationship between valuations of logarithm truncations at unramified primes. p. 1
Local and Global Bounds
The paper details the use of local bounds, including the density estimates derived from quadric congruence estimates and prime-pattern results. Proposition 4. p. 43 provides a lower bound on the total weight of patterns satisfying finite-cutoff ray conditions. p. 2 The final counting argument uses an iterated limit process to ensure all errors tend to zero, leading to a positive weighted remainder that has no odd self- or cross-order obstruction at any prime.
Final Result
The construction yields one integer-coefficient polynomial in at most 86 rational variables. If the input polynomial f has an integer zero, a rational certificate is provided for every T; otherwise, some guarded query has no rational certificate, confirming the undecidability of HTP86(Q). The total number of free rational unknowns is 86. p. 2
References
[1] T. D. Browning and D. p. 2 p. 2 p. 2 p. 2 R. Heath-Brown, The geometric sieve for quadrics, arXiv:2003. p. 2 p. 209593v1 [2] T. Browning and D. Loughran, Sieving rational points on varieties, arXiv:1705. p. 2 p. 201999v2 [3] N. Daans, Universally defining Z in Q with 10 quantifiers, J. p. 0 p. 0 London Math. p. 0 p. 0 Soc. 109 (2024), no. p. 0 p. 0 2, Article e12864 [4] H. Davenport, Multiplicative Number Theory, third edition, revised by H. p. 0 p. 0 L. Montgomery, Graduate Texts in Mathematics, vol. p. 0 p. 0 74, Springer, New York, 2000 [5] M. Davis, H. Putnam and J. p. 0 p. 0 p. 0 p. 0 Robinson, The decision problem for exponential Diophantine equations, Ann. p. 0 p. 0 p. 0 p. 0 of Math. (2) 74 (1961), 425–436 [6] C. p. 0 p. 0 Frei and M. p. 1 p. 1 Tinková, Linear constellations in primes with arithmetic restrictions, with an appendix by C. p. 1 p. 1 Frei, J. König and M. Tinková, arXiv:2408. p. 1 p. 117441v3 [7] B. C. Hall, Lie Groups, Lie Algebras, and Representations: An Elementary Introduction, second edition, Graduate Texts in Mathematics, vol. 222, Springer, Cham, 2015 [8] J. Koenigsmann, Defining Z in Q, Ann. p. 0 p. 0 p. 0 p. 0 of Math. (2) 183 (2016), 73–93 [9] Y. p. 0 p. 0 p. 0 p. 0 Matiyasevich, Enumerable sets are diophantine, Dokl. p. 0 p. 0 p. 0 p. 0 Akad. Nauk SSSR 191 (1970), 279–282; English translation with addendum, Soviet Math. p. 0 p. 0 p. 0 p. 0 Doklady 11 (1970), 354–357 [10] J. p. 0 p. 0 p. 0 p. 0 S. Milne, Class Field Theory, version 4. p. 0 p. 0 p. 0 p. 003 (2020), Chapter V, author’s course notes [11] OpenAI, Hilbert’s tenth problem over the rational numbers, OpenAI Math Release preprint, October 6, 2026. p. 0 p. 0 Available from the website https://github.com/openai/math/tree/main/preprints/Hilberts-tenth-problem-over-the-rational-numbers-October-6-2026 [12] B. p. 0 p. 0 Poonen, Characterizing integers among rational numbers with a universal-existential formula, Amer. p. 2 p. 2 J. Math. 131 (2009), 675–682 [13] J. p. 0 p. 0 Robinson, Definability and decision problems in arithmetic, J. p. 0 p. 0 Symbolic Logic 14 (1949), 98–114 [14] J. p. 0 p. 0 H. Silverman, The Arithmetic of Elliptic Curves, second edition, Graduate Texts in Mathematics, vol. p. 0 p. 0 p. 0 p. 0 106, Springer, Dordrecht, 2009 [15] Z. p. 0 p. 0 p. 0 p. 0-W. Sun, Introduction to Basic Number Theory, Harbin Institute of Technology Press, 2014 [16] Z. p. 3 p. 3-W. Sun, Further results on Hilbert’s Tenth Problem, Sci. p. 0 p. 0 China Math. p. 0 p. 0 64 (2021), 281–306 [17] Z.-W. Sun, Ten unknowns for Hilbert’s tenth problem over the integers, arXiv:2609. p. 0 p. 0 p. 0 p. 001594v2, 2026 [18] Z. p. 0 p. 0 p. 0 p. 0-W. Sun, Q Q is diophantine over Q with 7 unknowns, preprint, arXiv:2607. p. 0 p. 0 p. 0 p. 028606, 2026
--- Page 35 ---
The single most informative sentence about the paper's subject and finding is Hilbert’s tenth problem over the rationals is proven undecidable by establishing a decision procedure relative to a rational oracle using five-contact height estimates and an existential predicate excluding odd poles.
Pruning redundant reasoning tokens
The paper proves that there is no algorithm to decide for any polynomial P(x1,..., x86) with integer coefficients whether the equation P(x1,. p. 0.., x86) = 0 has solutions with x1,. p. 0.., x86 ∈ Q The proof uses a five-contact height estimate and an existential predicate excluding odd poles. p. 0
How the training signal is built
The construction involves 86 rational variables, including two components for each of 21 elliptic preimages, one common slope, two structural witnesses for each of 21 pole predicates, and one final algebraic witness. The Ar and A−5r are computed rational expressions on finite branches. p. 1
Where the gains come from
The gains come from combining the height and Selmer-theoretic inputs from [11] with Sun’s result that HTP10(Z) is undecidable. The proof employs five strategies to save variables. p. 1 The final construction is effective and gives one integer-coefficient polynomial in at most 86 rational variables. p. 2
[1] T. D. Browning and D. R. Heath-Brown, The geometric sieve for quadrics, arXiv:2003.09593v1 [2] T. Browning and D. Loughran, Sieving rational points on varieties, arXiv:1705.01999v2 [3] N. Daans, Universally defining Z in Q with 10 quantifiers, J. London Math. Soc. 109 (2024), no. 2, Article e12864 [4] H. Davenport, Multiplicative Number Theory, third edition, revised by H. L. Montgomery, Graduate Texts in Mathematics, vol. 74, Springer, New York, 2000 [5] M. Davis, H. Putnam and J. Robinson, The decision problem for exponential Diophantine equations, Ann. of Math. (2) 74 (1961), 425–436 [6] C. Frei and M. Tinková, Linear constellations in primes with arithmetic restrictions, with an appendix by C. Frei, J. König and M. Tinková, arXiv:2408.17441v3 [7] B. C. Hall, Lie Groups, Lie Algebras, and Representations: An Elementary Introduction, second edition, Graduate Texts in Mathematics, vol. 222, Springer, Cham, 2015 [8] J. Koenigsmann, Defining Z in Q, Ann. of Math. (2) 183 (2016), 73–93 [9] Y. Matiyasevich, Enumerable sets are diophantine, Dokl. Akad. Nauk SSSR 191 (1970), 279–282; English translation with addendum, Soviet Math. Doklady 11 (1970), 354–357 [10] J. S. Milne, Class Field Theory, version 4.03 (2020), Chapter V, author’s course notes [11] OpenAI, Hilbert’s tenth problem over the rational numbers, OpenAI Math Release preprint, October 6, 2026. Available from the website https://github.com/openai/math/tree/main/preprints/Hilberts-tenth-problem-over-the-rational-numbers-October-6-2026 [12] B. Poonen, Characterizing integers among rational numbers with a universal-existential formula, Amer. J. Math. 131 (2009), 675–682 [13] J. Robinson, Definability and decision problems in arithmetic, J. Symbolic Logic 14 (1949), 98–114 [14] J. H. Silverman, The Arithmetic of Elliptic Curves, second edition, Graduate Texts in Mathematics, vol. 106, Springer, Dordrecht, 2009 [15] Z.-W. Sun, Introduction to Basic Number Theory, Harbin Institute of Technology Press, 2014 [16] Z.-W. Sun, Further results on Hilbert’s Tenth Problem, Sci. China Math. 64 (2021), 281–306 [17] Z.-W. Sun, Ten unknowns for Hilbert’s tenth problem over the integers, arXiv:2609.01594v2, 2026 [18] Z.-W. Sun, Q Q is diophantine over Q with 7 unknowns, preprint, arXiv:2607.28606, 2026 [19] T. p. 0 p. 0 Tao and T. Ziegler, The primes contain arbitrarily long polynomial progressions, Acta Math. p. 1 p. 1 201 (2008), 213–305 [20] T. Tao and T. Ziegler, Erratum to “The primes contain arbitrarily long polynomial progressions”, Acta Math. p. 1 p. 1 210 (2013), 403–404 [21] T. Tao and T. Ziegler, Polynomial patterns in the primes, Forum Math. p. 0 p. 0 Pi 6 (2018), Article e1 [22] G.-R. Zhang and Z.-W. Sun, Q Q is Diophantine over Q with 32 unknowns, Bull. p. 0 p. 0 Pol. Acad. Sci. Math. 70 (2022), no. 2, 93–106 [5] M. Davis, H. Putnam and J. Robinson, The decision problem for exponential Diophantine equations, Ann. of Math. (2) 74 (1961), 425–436 [8] J. p. 0 p. 0 Koenigsmann, Defining Z in Q, Ann. of Math. (2) 183 (2016), 73–93 [9] Y. Matiyasevich, Enumerable sets are diophantine, Dokl. Akad. Nauk SSSR 191 (1970), 279–282; English translation with addendum, Soviet Math. Doklady 11 (1970), 354–357 [10] J. S. Milne, Class Field Theory, version 4.03 (2020), Chapter V, author’s course notes [14] J. p. 0 p. 0 H. Silverman, The Arithmetic of Elliptic Curves, second edition, Graduate Texts in Mathematics, vol. 106, Springer, Dordrecht, 2009 [15] Z.-W. Sun, Introduction to Basic Number Theory, Harbin Institute of Technology Press, 2014 [17] Z. p. 3 p. 3-W. Sun, Ten unknowns for Hilbert’s tenth problem over the integers, arXiv:2609.01594v2, 2026 [18] Z.-W. Sun, Q Q is diophantine over Q with 7 unknowns, preprint, arXiv:2607.28606, 2026 [19] T. Tao and T. Ziegler, The primes contain arbitrarily long polynomial progressions, Acta Math. 201 (2008), 213–305 [20] T. Tao and T. Ziegler, Erratum to “The primes contain arbitrarily long polynomial progressions”, Acta Math. 210 (2013), 403–404 [21] T. Tao and T. Ziegler, Polynomial patterns in the primes, Forum Math. Pi 6 (2018), Article e1 [22] G.-R. Zhang and Z.-W. Sun, Q Q is Diophantine over Q with 32 unknowns, Bull. Pol. Acad. Sci. Math. 70 (2022), no. 2, 93–106 [5] M. Davis, H. Putnam and J. Robinson, The decision problem for exponential Diophantine equations, Ann. of Math. (2) 74 (1961), 425–436 [8] J. Koenigsmann, Defining Z in Q, Ann. of Math. (2) 183 (2016), 73–93 [9] Y. Matiyasevich, Enumerable sets are diophantine, Dokl. Akad. Nauk SSSR 191 (1970), 279–282; English translation with addendum, Soviet Math. Doklady 11 (1970), 354–357 [10] J. S. Milne, Class Field Theory, version 4.03 (2020), Chapter V, author’s course notes [14] J. H. Silverman, The Arithmetic of Elliptic Curves, second edition, Graduate Texts in Mathematics, vol. 106, Springer, Dordrecht, 2009 [15] Z.-W. Sun, Introduction to Basic Number Theory, Harbin Institute of Technology Press, 2014 [17] Z.-W. Sun, Ten unknowns for Hilbert’s tenth problem over the integers, arXiv:2609.01594v2, 2026 [18] Z.-W. Sun, Q Q is diophantine over Q with 7 unknowns, preprint, arXiv:2607.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Enhanced Decision Procedure for HTP86(Q) Evaluation: The system can implement a decision procedure relative to a rational oracle by running
rational queries alongside the enumeration of integer solutions,
which provides a decision procedure for whether an input polynomial P(x1,..., x86) = 0 has solutions with x1,..., x86 ∈ Q. -
Variable Reduction Strategy: The system can utilize five strategies to save variables, such as using a rational projective change to move all five height contacts to finite points theta0 = 0, theta1,..., theta4. This strategy allows the definition of F5(t) = Y4 j=0 (t − θj).
-
Prime Pattern Detection via Detectors: The system can employ detectors Rr = A−5 r F5(Ars) (Ars − ξ) to generate prime-pattern expressions, which have an
especially useful prime-pattern expression
and can be analyzed across all slopes. -
Simultaneous Prime Construction Framework: The system can adapt the asymptotic argument from Tao and Ziegler [19, 20, 21] using the unconditional linear Artin-symbol theorem of Frei and Tinková [6, Theorem 1.4] to obtain weighted lower bounds for fixed positions based on ray-class fibres.
-
Local Precision Enforcement: The system can enforce local precision by dividing each local expression of required precision kj by (t − ξ)kj+1, ensuring that the denominators are units at contact primes and making the expressions
small at the real embeddings and the prime ideals above the fixed exceptional primes.
-
Source-Tuple Elimination: Instead of comparing two logarithm ratios Li and L′i to a free coordinate ai, the system can impose local precision on Li − L′i (1 ≤ i ≤ 10) and f(L1,..., L10), which excludes every bounded integer tuple k with f(k) ≠ 0.
-
Rational Certificate Generation: For a given input polynomial f and guard bound T, the system can generate a finite rational certificate in at most 86 rational variables if an integer zero of f is present, or prove that some guarded query has no rational certificate if no integer zero exists.
Sources
- The geometric sieve for quadrics
- Sieving rational points on varieties
- Linear constellations in primes with arithmetic restrictions
- $\mathbb Q\setminus\mathbb Z$ is diophantine over $\mathbb Q$ with $7$ unknowns
Related papers
- K ab has the Bogomolov property for canonical heights
- Quasi-Jacobi forms, Appell-Lerch functions, and false theta functions as q-brackets of functions on partitions
- Wasserstein rates of all orders for the Sato-Tate law of Kloosterman sums
- Completing the classification of torsion over sextic fields for elliptic curves defined over Q
- Riemann functions for almost primes and their counting errors
- Topological flatness of orthogonal spin local models