Hilbert’s tenth problem over the rational numbers
There is no algorithm which, given a polynomial , with part of the input, decides whether has a zero in .
The reduction from integer solvability to rational solvability is logically sound given Proposition 2.12, and the undecidability of integer solvability is a standard theorem. Note that the supporting results Proposition 2.8 and Theorem 2.4 rely on external preprints [48] and [49] cited in the bibliography.
“Theorem 1.1. There is no algorithm which, given a polynomial f ∈ Z[X1, . . . , Xn], with n part of the input, decides whether f has a zero in Qn.” · Show in paper