Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The Native Zero-Test Program Terminates Exactly on Integer Zero

Proved
Monodromy.CoupledContinuation.zeroTest_native_dom

by Xiaoyang Liu · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilitycovering-spacesmonodromy-computation

For every integer n, the specified native zeroTest program has a defined partial evaluation from prepare(n,0,0) if and only if n=0. This is a termination-domain statement for actual geometric execution, with no output-value claim.

Statement dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.eval, Monodromy.CoupledContinuation.prepare, Monodromy.CoupledContinuation.zeroTest.

Original proof dependencies: Monodromy.CoupledContinuation.Gate, Monodromy.CoupledContinuation.Gate.evalInt, Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Labels.prepare, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.eval, Monodromy.CoupledContinuation.Program.evalInt, Monodromy.CoupledContinuation.Program.eval_prepareInt, Monodromy.CoupledContinuation.Program.haltInt, Monodromy.CoupledContinuation.Program.indexInt, Monodromy.CoupledContinuation.Program.nextInt, Monodromy.CoupledContinuation.Word, Monodromy.CoupledContinuation.Word.atom, Monodromy.CoupledContinuation.Word.evalInt, Monodromy.CoupledContinuation.prepare, Monodromy.CoupledContinuation.zeroTest, Monodromy.Observation.stopped, Monodromy.Observation.stopped_dom_iff.

Statement elaboration dependencies: Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.eval, Monodromy.CoupledContinuation.prepare, Monodromy.CoupledContinuation.zeroTest.

Proof elaboration dependencies: Monodromy.CoupledContinuation.Gate, Monodromy.CoupledContinuation.Gate.evalInt, Monodromy.CoupledContinuation.Labels, Monodromy.CoupledContinuation.Labels.prepare, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program, Monodromy.CoupledContinuation.Program.eval, Monodromy.CoupledContinuation.Program.evalInt, Monodromy.CoupledContinuation.Program.eval_prepareInt, Monodromy.CoupledContinuation.Program.haltInt, Monodromy.CoupledContinuation.Program.indexInt, Monodromy.CoupledContinuation.Program.nextInt, Monodromy.CoupledContinuation.Word, Monodromy.CoupledContinuation.Word.atom, Monodromy.CoupledContinuation.Word.evalInt, Monodromy.CoupledContinuation.prepare, Monodromy.CoupledContinuation.zeroTest, Monodromy.Observation.stopped, Monodromy.Observation.stopped_dom_iff.

Preamble
module
public import Definitions.Def_Monodromy_ForwardBoundary
public import Lean.Elab.Tactic.Omega
public import Mathlib.Analysis.Analytic.Constructions
public import Mathlib.Analysis.Analytic.IsolatedZeros
public import Mathlib.Analysis.Analytic.Linear
public import Mathlib.Analysis.Calculus.DSlope
public import Mathlib.Analysis.Calculus.Deriv.Add
public import Mathlib.Analysis.Calculus.Deriv.Comp
public import Mathlib.Analysis.Calculus.Deriv.Mul
public import Mathlib.Analysis.Calculus.Deriv.Pow
public import Mathlib.Analysis.Complex.Basic
public import Mathlib.Analysis.Complex.CoveringMap
public import Mathlib.Analysis.Real.Pi.Bounds
public import Mathlib.Analysis.SpecialFunctions.Complex.Analytic
public import Mathlib.Analysis.SpecialFunctions.Complex.Circle
public import Mathlib.Analysis.SpecialFunctions.Trigonometric.Deriv
public import Mathlib.Analysis.SpecialFunctions.Trigonometric.Sinc
public import Mathlib.Computability.Halting
public import Mathlib.Computability.PartrecCode
public import Mathlib.Computability.Primrec.Basic
public import Mathlib.Computability.Primrec.List
public import Mathlib.Computability.StateTransition
public import Mathlib.Computability.TuringMachine.PostTuringMachine
public import Mathlib.Data.Fin.Basic
public import Mathlib.Data.Fintype.Card
public import Mathlib.Data.Int.ModEq
public import Mathlib.Data.Nat.Digits.Lemmas
public import Mathlib.Data.Set.Finite.Basic
public import Mathlib.Logic.Equiv.Fin.Rotate
public import Mathlib.Logic.Function.Conjugate
public import Mathlib.RingTheory.RootsOfUnity.Complex
public import Mathlib.Tactic.FieldSimp
public import Mathlib.Tactic.FunProp
public import Mathlib.Tactic.Linarith
public import Mathlib.Tactic.Ring
public import Mathlib.Topology.Homotopy.Lifting

@[expose] public section

open Monodromy
open Monodromy.CoupledContinuation

Formal statement
theorem Monodromy.CoupledContinuation.zeroTest_native_dom (input : ℤ) :
    (zeroTest.eval (prepare input 0 0)).Dom ↔ input = 0 := by sorry
Source
Authoritative local working-tree snapshot SHA-256 e03ce2d08e07ee663140bec213fb21e995f44153a3c556c908fcf1c8d6fefe6c; repository https://github.com/ERHUTUZI123/monodromy. The remote Git base is incomplete and is not asserted to contain these declarations. src/Monodromy/ForwardBoundary.lean (file SHA-256 79994010f524b607d5f4d56631e4490998ab2e44fa455569a55df12bc89c47b2): Monodromy.CoupledContinuation.zeroTest_native_dom at L199-L223 [UTF-8 9849:11091].
Read-back

What the Lean code literally says, in plain math · OpenAI Codex (independent agent)

For every integer xxx, including negative integers, the partial evaluation of the following two-entry geometric program from P(x,0,0)\mathcal P(x,0,0)P(x,0,0) has a value if and only if x=0x=0x=0. With τ=2πi\tau=2\pi iτ=2πi, P(l,r,c)\mathcal P(l,r,c)P(l,r,c) is the memory with lower coordinates 1+τl,1+τr1+\tau l,1+\tau r1+τl,1+τr and upper coordinate log⁡(1+τl)+log⁡(1+τr)+τc\log(1+\tau l)+\log(1+\tau r)+\tau clog(1+τl)+log(1+τr)+τc in the coupled exponential fiber over (e,e,1)(e,e,1)(e,e,1). Both table entries consist of the single forward zero-left driver: its left base loop is t↦exp⁡(e2πit)t\mapsto\exp(e^{2\pi i t})t↦exp(e2πit), its other base components are constant, and execution uses the actual two lower exponential lifts followed by the upper exponential lift of their product. The stop flag is false at index 000 and true at index 111, read by normalized divided-difference interpolation at the two square roots of unity of the control root exp⁡((z−log⁡w0−log⁡w1)/2)\exp((z-\log w_0-\log w_1)/2)exp((z−logw0​−logw1​)/2). Evaluation repeatedly performs a step when that signal is not 111 and returns the current state when it is 111; an endless sequence is undefined. The theorem asserts exactly this equivalence of the evaluator's domain with x=0x=0x=0 and does not specify the returned memory value.

Human review
  • Endorsed by marwahaha · Nov 6, 2026

  • Endorsed by Xiaoyang Liu · Nov 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me