Conditional reduction — Theorem 1.1 from and CR
OpenZInQ.main_conditionalThe conditional main theorem: the six-contact estimate (Theorem 4.1) together with the positive-rank certified-rank hypothesis CR implies the bounded Diophantine definition (Theorem 1.1). This is the elementary core of the construction — the register-machine compiler, the multiplication and assembly gadgets, and the size bounds — with the two deep arithmetic inputs left as hypotheses. It is the composition of two reductions already kernel-checked in the repository: sixContactMin_of_sixContactEstimate (deriving the minimal instance from ) and exists_bounded_integer_polynomial_defining_integers_of_sixContactMin_certifiedRankTYZClRk. Porting this reduction is the bridge between the arithmetic milestones and the goal.
import Mathlib import Definitions.Def_ZInQHeight import Definitions.Def_ZInQLiterature import Definitions.Def_ZInQTarget
theorem ZInQ.main_conditional : ZInQ.SixContactEstimate → ZInQ.RouteK.Rank.CertifiedRankTYZClRk → ZInQ.FrozenTarget := by sorry
Read-back
What the Lean code literally says, in plain math · glm
The theorem asserts an implication: given a proof of (the six-contact height estimate) and a proof of (odd genus sum gives a point of infinite order on ), one can conclude (the existence of the bounded integer polynomial in variables defining in ). The two hypotheses are exactly the propositions defined in the height and literature bundles; no further assumption is made.