Consecutive source boundaries are separated by two native steps
ProvedMonodromy.CounterContinuation.two_returns_with_boundaryFor every positive m and two-counter program P, each successful source step s→t admits a native state u such that encode(s) is a source boundary, the compiled optional steps are encode(s)→u→encode(t), u is not a source boundary, and encode(t) is a source boundary. A source boundary means that the cubic control-root observation equals 1.
Statement dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Program, Monodromy.Counter.step, Monodromy.CounterContinuation.SourceBoundary, 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.SourceBoundary, Monodromy.CounterContinuation.advance_live_not_boundary, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.instructionStop, Monodromy.CounterContinuation.sourceBoundary_encode, Monodromy.CounterContinuation.step_running_at, Monodromy.CounterContinuation.stopping, Monodromy.CounterContinuation.two_returns, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.Program.step.
Statement elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Program, Monodromy.Counter.step, Monodromy.CounterContinuation.SourceBoundary, 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.SourceBoundary, Monodromy.CounterContinuation.advance_live_not_boundary, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.instructionStop, Monodromy.CounterContinuation.sourceBoundary_encode, Monodromy.CounterContinuation.step_running_at, Monodromy.CounterContinuation.stopping, Monodromy.CounterContinuation.two_returns, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.advance, 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 : ℕ} [NeZero m]
theorem Monodromy.CounterContinuation.two_returns_with_boundary (program : Counter.Program 2 m)
(state result : Counter.Configuration 2 m) (source_step : Counter.step program state = some result) :
∃ middle : Memory,
SourceBoundary (encode state) ∧
(compile program).step (encode state) = some middle ∧
¬ SourceBoundary middle ∧
(compile program).step middle = some (encode result) ∧
SourceBoundary (encode result) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every positive natural number , every natural two-counter program on labels, and any configurations with one successful source step , there exists a memory point such that is a source boundary, the compiled geometric step sends to , is not a source boundary, the next compiled step sends to , and is a source boundary. Write and in the fiber over of ; the encoding of is . For any memory , the boundary predicate is exactly and does not inspect the source program or require natural lower labels. The compiler has three word phases per source label, performs the zero/nonzero selection in phase zero and the register update or zero-branch jump in the next phase, and its one-step operation stops exactly when its root-interpolated table marks a halting phase-zero label. The conjunction requires exactly two successful compiled steps and excludes a boundary at their intermediate point; it does not assert later halting or uniqueness of that point and includes zero source counters.
Confirmed by the mission captain (proposal self-audit).