Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A Compiled Counter Step Has an Unmarked Intermediate Native Return

Proved
Monodromy.NativeTuring.two_returns_marked

by Xiaoyang Liu · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilitycovering-spacesmonodromy-computation

For 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.

Preamble
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]

Formal statement
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
Source
Authoritative local working-tree snapshot SHA-256 e03ce2d08e07ee663140bec213fb21e995f44153a3c556c908fcf1c8d6fefe6c; repository https://github.com/ERHUTUZI123/monodromy. The remote Git base is incomplete and is not asserted to contain these declarations. src/Monodromy/FormalCompilation.lean (file SHA-256 c07335814044367fc4605d1e494fe82a30c684f754d58d55aaa7514b94c37122): Monodromy.NativeTuring.two_returns_marked at L463-L481 [UTF-8 22263:23311].
Read-back

What the Lean code literally says, in plain math · OpenAI Codex (independent agent)

For every positive natural number mmm, every natural two-counter source program PPP on mmm labels, every Boolean marking function h:{0,…,m−1}→{false,true}h:\{0,\ldots,m-1\}\to\{\mathrm{false},\mathrm{true}\}h:{0,…,m−1}→{false,true}, and all configurations s,ts,ts,t such that one successful source step sends sss to ttt, there exists a geometric memory uuu such that one step of the three-phase geometric compilation sends E(s)E(s)E(s) to uuu, uuu is not marked by the specified marking observation, and one more step sends uuu to E(t)E(t)E(t). With τ=2πi\tau=2\pi iτ=2πi, the encoding of (p,(x0,x1))(p,(x_0,x_1))(p,(x0​,x1​)) is the point with lower coordinates 1+τx0,1+τx11+\tau x_0,1+\tau x_11+τx0​,1+τx1​ and upper coordinate log⁡(1+τx0)+log⁡(1+τx1)+τ(3p)\log(1+\tau x_0)+\log(1+\tau x_1)+\tau(3p)log(1+τx0​)+log(1+τx1​)+τ(3p) in the coupled exponential fiber over (e,e,1)(e,e,1)(e,e,1). The compiler has phases 3p,3p+1,3p+23p,3p+1,3p+23p,3p+1,3p+2, 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 h(p)h(p)h(p) at phase-zero labels and false at phases one and two; it reads these flags through the normalized power-root kernels at exp⁡((z−log⁡w0−log⁡w1)/(3m))\exp((z-\log w_0-\log w_1)/(3m))exp((z−logw0​−logw1​)/(3m)) and declares marked exactly when that signal is 111. The two transitions in the conclusion still use the original compiled program's stopping rules. There is no requirement that hhh mark either endpoint, and no endpoint markedness conclusion; hhh may be everywhere false or everywhere true, the counters may be zero, and no later halting is assumed.

Human review
  • Endorsed by marwahaha · Nov 6, 2026

  • Endorsed by Xiaoyang Liu · Nov 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me