Theorem 1.1 — is Diophantine in (bounded polynomial)
OpenZInQ.frozenTargetThe goal of the mission (Theorem 1.1 of the manuscript). There exists a polynomial with variables such that
and for every rational ,
Here denotes tetration. This exhibiting polynomial gives a Diophantine definition of the integers inside the rationals, which would imply the undecidability of Hilbert's tenth problem over . The repository's kernel already proves this statement conditionally on the arithmetic inputs and CR; the mission formalizes those inputs to obtain the unconditional theorem.
import Mathlib import Definitions.Def_ZInQTarget
theorem ZInQ.frozenTarget : ZInQ.FrozenTarget := by sorry
Read-back
What the Lean code literally says, in plain math · glm
The theorem asserts the proposition : there exists a polynomial with integer coefficients in variables such that (i) its total degree is strictly less than ; (ii) for every monomial index , the absolute value of its coefficient is strictly less than ; and (iii) for every rational , there exist rational witnesses making if and only if is the image of some integer. The equivalence ranges over all rationals without exclusion.