Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One counter transition becomes two native steps

Proved
Monodromy.CounterContinuation.two_returns

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

computabilitycovering-spacesmonodromy-computation

For every positive m and every two-counter program with m addresses, a successful source step from configuration s to t has a native intermediate state u such that the compiled program takes one successful optional step from encode(s) to u and one from u to encode(t). The same u witnesses both step equalities.

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.advance_dec_first, Monodromy.CounterContinuation.advance_dec_positive, Monodromy.CounterContinuation.advance_dec_zero, Monodromy.CounterContinuation.advance_inc_first, Monodromy.CounterContinuation.advance_inc_second, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.instructionStop, Monodromy.CounterContinuation.label, Monodromy.CounterContinuation.label_eq, Monodromy.CounterContinuation.step_phase_one, Monodromy.CounterContinuation.step_phase_two, Monodromy.CounterContinuation.step_running_at, Monodromy.CounterContinuation.stopping, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.Program.step, Monodromy.CoupledContinuation.prepare.

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.advance_dec_first, Monodromy.CounterContinuation.advance_dec_positive, Monodromy.CounterContinuation.advance_dec_zero, Monodromy.CounterContinuation.advance_inc_first, Monodromy.CounterContinuation.advance_inc_second, Monodromy.CounterContinuation.compile, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.instructionStop, Monodromy.CounterContinuation.label, Monodromy.CounterContinuation.label_eq, Monodromy.CounterContinuation.step_phase_one, Monodromy.CounterContinuation.step_phase_two, Monodromy.CounterContinuation.step_running_at, Monodromy.CounterContinuation.stopping, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.Program.advance, Monodromy.CoupledContinuation.Program.step, Monodromy.CoupledContinuation.prepare.

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

Formal statement
theorem Monodromy.CounterContinuation.two_returns (program : Counter.Program 2 m)
    (state result : Counter.Configuration 2 m) (source_step : Counter.step program state = some result) :
    ∃ middle : Memory,
      (compile program).step (encode state) = some middle ∧
      (compile program).step middle = some (encode result) := 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/Counter.lean (file SHA-256 40536289575067aae1ed4154805e219805a1c786ccfdfcbe632ea7478a40636a): Monodromy.CounterContinuation.two_returns at L366-L439 [UTF-8 15383:19973].
Read-back

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

For every positive natural number mmm, any mmm-label natural two-counter program PPP, and configurations s,ts,ts,t for which one counter step of PPP from sss returns ttt, there exists a geometric memory point uuu such that one step of the compiled 3m3m3m-entry geometric program sends E(s)E(s)E(s) to uuu and one further step sends uuu to E(t)E(t)E(t). For τ=2πi\tau=2\pi iτ=2πi, E(p,(x0,x1))E(p,(x_0,x_1))E(p,(x0​,x1​)) is ((1+τx0,1+τx1),log⁡(1+τx0)+log⁡(1+τx1)+τ(3p))((1+\tau x_0,1+\tau x_1),\log(1+\tau x_0)+\log(1+\tau x_1)+\tau(3p))((1+τx0​,1+τx1​),log(1+τx0​)+log(1+τx1​)+τ(3p)) in the fiber over (e,e,1)(e,e,1)(e,e,1) of the coupled exponential projection (w0,w1,z)↦(ew0,ew1,ez/(w0w1))(w_0,w_1,z)\mapsto(e^{w_0},e^{w_1},e^z/(w_0w_1))(w0​,w1​,z)↦(ew0​,ew1​,ez/(w0​w1​)). The compiler uses control phases 3p,3p+1,3p+23p,3p+1,3p+23p,3p+1,3p+2: its first word advances control, using the appropriate zero-conditional loop for a decrement, and its next selected word updates the register and/or jumps to the appropriate target phase zero; stopping is marked at halting source labels in phase zero. A compiled step performs the word selected by the finite control-root kernels unless its stopping signal is 111, when it has no successor. The witness is required to make both successors exist, with no distinctness conditions on the three states, no uniqueness claim for the witness, no explicit boundary predicate in the conclusion, and no later termination assumption.

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