The Native Zero-Test Program Terminates Exactly on Integer Zero
ProvedMonodromy.CoupledContinuation.zeroTest_native_domFor 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.
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
theorem Monodromy.CoupledContinuation.zeroTest_native_dom (input : ℤ) :
(zeroTest.eval (prepare input 0 0)).Dom ↔ input = 0 := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every integer , including negative integers, the partial evaluation of the following two-entry geometric program from has a value if and only if . With , is the memory with lower coordinates and upper coordinate in the coupled exponential fiber over . Both table entries consist of the single forward zero-left driver: its left base loop is , 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 and true at index , read by normalized divided-difference interpolation at the two square roots of unity of the control root . Evaluation repeatedly performs a step when that signal is not and returns the current state when it is ; an endless sequence is undefined. The theorem asserts exactly this equivalence of the evaluator's domain with and does not specify the returned memory value.
Confirmed by the mission captain (proposal self-audit).