48 unknowns for Hilbert's tenth problem over the rationals
summary
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…
In short
The paper proves Hilbert’s tenth problem over the rationals is undecidable by creating a decision procedure relative to a rational oracle. This was achieved using five-contact height estimates and an existential predicate that excludes odd poles. The construction yields one integer-coefficient polynomial in at most 86 rational variables, showing the problem is algorithmically unsolvable.
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 used across episodes
This episode discusses
- 48 unknowns for Hilbert's tenth problem over the rationals · Paper Radio
- The geometric sieve for quadrics
- Sieving rational points on varieties
- Linear constellations in primes with arithmetic restrictions
- Q Z is diophantine over Q with 7 unknowns
The paper
48 unknowns for Hilbert's tenth problem over the rationals · Read on arXiv
National Natural Science Foundation of China
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 >
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors