Two native optional steps reproduce a source step, including halt
ProvedMonodromy.CounterContinuation.step_bind_step_encodeFor every positive m, two-counter program P with m addresses, and natural-counter configuration s, taking a compiled optional step from encode(s) and binding its result to a second compiled step equals applying encode to the optional source result P.step(s). An absent first result propagates as absent, so the equality includes source halting as well as successful transitions.
Statement dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Program, Monodromy.Counter.step, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.step.
Original proof dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Program, Monodromy.Counter.step, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.simulates, Monodromy.CounterContinuation.two_returns, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.step.
Statement elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Program, Monodromy.Counter.step, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.step.
Proof elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Program, Monodromy.Counter.step, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.simulates, Monodromy.CounterContinuation.two_returns, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.step.
module
public import Definitions.Def_Monodromy_Counter
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.Computability.StateTransition
public import Mathlib.Computability.TuringMachine.PostTuringMachine
public import Mathlib.Data.Fin.Basic
public import Mathlib.Data.Fintype.Card
public import Mathlib.Data.Fintype.EquivFin
public import Mathlib.Data.Nat.Digits.Lemmas
public import Mathlib.Data.Nat.Factorization.Basic
public import Mathlib.Logic.Equiv.Fin.Basic
public import Mathlib.Logic.Equiv.Fin.Rotate
public import Mathlib.Logic.Function.Basic
public import Mathlib.Logic.Function.Conjugate
public import Mathlib.RingTheory.RootsOfUnity.Complex
public import Mathlib.Tactic.FieldSimp
public import Mathlib.Tactic.FinCases
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.CounterContinuation
variable {m : ℕ} [NeZero m]
theorem Monodromy.CounterContinuation.step_bind_step_encode (program : Counter.Program 2 m) (state : Counter.Configuration 2 m) :
((compile program).step (encode state)).bind (compile program).step =
(Counter.step program state).map encode := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every positive natural number , every -label two-counter natural-number program , and every configuration , applying the partial one-step operation of its compiled geometric word program twice, stopping the composition if the first application has no successor, equals applying the original counter step once and then encoding its successor if one exists. The encoding of is the memory point , where and in the fiber over of . The compiled table has three phases per source label: phase zero advances control by one and, for a decrement, adds another control unit exactly at zero; phase one changes the selected register by for an increment or for a nonzero decrement and jumps to the target phase zero; phase two jumps to the zero target. Halting is marked only at source phase zero, and a compiled step returns no successor when that finite-root stopping observation is , otherwise executing the root-selected word. Consequently the asserted equality is an equality of optional results, including absence of a result for source halt; it is a statement about exactly two composed one-step attempts, not about the domain of an unbounded evaluator, and permits all zero counters and arbitrary target labels.
Confirmed by the mission captain (proposal self-audit).