Continuation compilation respects counter execution
ProvedMonodromy.CounterContinuation.simulatesFor every positive m and every two-counter program with m addresses, its source transition system is respected by the native transition system of its three-phase continuation compilation under the relation encode(s)=u. Thus related halted source states have halted native states, and each successful source transition is matched by a positive native run ending at the encoding of its successor.
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.Instruction, Monodromy.Counter.Program, Monodromy.Counter.step, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.step_halt, 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.Instruction, Monodromy.Counter.Program, Monodromy.Counter.step, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.step_halt, 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
open CoupledContinuation
variable {m : ℕ}
variable [NeZero m]
theorem Monodromy.CounterContinuation.simulates (program : Counter.Program 2 m) :
StateTransition.Respects (Counter.step program) (compile program).step
(fun first second => encode first = second) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every positive natural number and every program on two natural-number counters with labels, the following refinement property holds between ordinary counter execution and execution of the compiled -entry geometric word table. Whenever a source configuration and a memory point satisfy , then, if has a successor from , there is a memory point reachable from by a nonempty finite sequence of compiled steps; if has no successor from , the compiled step at itself has no successor. Here a counter step increments and jumps, branches at zero without changing counters or else decrements and jumps, or returns no successor at halt; is the point with lower coordinates and upper coordinate in the fiber over of the coupled exponential projection. The compiled table has phases at each label: phase zero writes one control unit, with an additional zero-conditional unit for a decrement; phase one performs an increment or nonzero decrement and jumps to the target's phase zero, and phase two provides the zero-branch jump. Its step returns no successor exactly when the root-interpolated stopping table has value , marking halting source labels at phase zero, and otherwise executes the root-selected geometric word. This statement quantifies only memories related by the displayed encoding and asserts no fixed number of target steps; zero counter values and self-loops are included.
Confirmed by the mission captain (proposal self-audit).