A Compiled Counter Step Has an Unmarked Intermediate Native Return
ProvedMonodromy.NativeTuring.two_returns_markedFor every positive number m of counter addresses, two-counter program C with m addresses, Boolean mark table b:Fin m→Bool and configurations x,y with C.step(x)=some y, there exists a native state u such that the compiled program steps from encode(x) to u, u fails the finite phase-zero boundary observation selected by b, and the next compiled step returns encode(y). The mark table is arbitrary.
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, Monodromy.NativeTuring.MarkedBoundary.
Original proof dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Instruction, Monodromy.Counter.Program, Monodromy.Counter.step, Monodromy.CounterContinuation.advance_live_phase, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.label, Monodromy.CounterContinuation.two_returns, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.Program.step, Monodromy.CoupledContinuation.prepare, Monodromy.NativeTuring.MarkedBoundary, Monodromy.NativeTuring.advance_of_native_step, Monodromy.NativeTuring.markedBoundary_label_iff.
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, Monodromy.NativeTuring.MarkedBoundary.
Proof elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Instruction, Monodromy.Counter.Program, Monodromy.Counter.step, Monodromy.CounterContinuation.advance_live_phase, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.label, Monodromy.CounterContinuation.two_returns, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.Program.step, Monodromy.CoupledContinuation.prepare, Monodromy.NativeTuring.MarkedBoundary, Monodromy.NativeTuring.advance_of_native_step, Monodromy.NativeTuring.markedBoundary_label_iff.
module
public import Definitions.Def_Monodromy_FormalCompilation
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.Computability.TuringMachine.ToPartrec
public import Mathlib.Data.Fin.Basic
public import Mathlib.Data.Fintype.Card
public import Mathlib.Data.Fintype.EquivFin
public import Mathlib.Data.Fintype.Sets
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.NativeTuring
open Turing CoupledContinuation
variable {m : ℕ} [NeZero m]
theorem Monodromy.NativeTuring.two_returns_marked (source : Counter.Program 2 m) (mark : Fin m → Bool)
(first last : Counter.Configuration 2 m) (transition : Counter.step source first = some last) :
∃ middle : Memory,
(CounterContinuation.compile source).step (CounterContinuation.encode first) = some middle ∧
¬ MarkedBoundary source mark middle ∧
(CounterContinuation.compile source).step middle = some (CounterContinuation.encode last) := 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 source program on labels, every Boolean marking function , and all configurations such that one successful source step sends to , there exists a geometric memory such that one step of the three-phase geometric compilation sends to , is not marked by the specified marking observation, and one more step sends to . With , the encoding of is the point with lower coordinates and upper coordinate in the coupled exponential fiber over . The compiler has phases , with the first word selecting the live phase and the next word performing the register update and/or target jump. The marking observation retains this compiled word table and replaces its stopping flags by at phase-zero labels and false at phases one and two; it reads these flags through the normalized power-root kernels at and declares marked exactly when that signal is . The two transitions in the conclusion still use the original compiled program's stopping rules. There is no requirement that mark either endpoint, and no endpoint markedness conclusion; may be everywhere false or everywhere true, the counters may be zero, and no later halting is assumed.
Confirmed by the mission captain (proposal self-audit).