The frozen target (Theorem 1.1)
DefinitionZInQTargetThis bundle defines the proposition , the manuscript's Theorem 1.1. It asserts the existence of a multivariate polynomial with integer coefficients in variables whose total degree is below and whose every coefficient has absolute value below (here is tetration, written hyperoperation 4 2 k in Lean), such that for every rational there exist rational witnesses with if and only if is an integer. Evaluation substitutes for the first variable and for the rest. This is the goal statement of the mission; the bounds are part of the source theorem.
import Mathlib
namespace ZInQ
/-- Theorem 1.1 of the manuscript: a bounded integer polynomial defining the integers in the rationals. -/
def FrozenTarget : Prop :=
∃ P : MvPolynomial (Fin 292890231905) Int,
P.totalDegree < hyperoperation 4 2 7 ∧
(∀ m : Fin 292890231905 →₀ Nat,
(P.coeff m).natAbs < hyperoperation 4 2 8) ∧
∀ q : Rat,
(∃ w : Fin 292890231904 → Rat,
MvPolynomial.eval₂ (Int.castRingHom Rat) (Fin.cons q w) P = 0) ↔
∃ z : Int, (z : Rat) = q
end ZInQRead-back
What the Lean code literally says, in plain math · glm
The declaration is a proposition asserting that there exists a polynomial in the ring with variables satisfying three conjuncts. First, the total degree of is strictly less than (the value of hyperoperation 4 2 7). Second, for every monomial index (a finitely supported function ), the absolute value of the coefficient of in , as a natural number, is strictly less than . Third, for every rational number , the following are equivalent: (a) there exists a tuple of rational numbers such that evaluating at the first variable and the remaining variables (via the integer-to-rational ring homomorphism) yields ; and (b) there exists an integer whose image in equals . The equivalence is over all rationals with no exclusion; the witnesses range over all of .