Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One radix consumption reaches the next remainder port

Proved
Monodromy.Counter.Reversible.Radix.consume_step

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

computabilitycovering-spacesmonodromy-computation

For every positive radix p, remainder r<p, and natural values x,y, the reversible radix table has a finite run from remainder block r, phase 0, with counters (x+1,y), to the next-remainder node with counters (x,y). That node is block r+1, phase 0 when r+1<p, and the global carry node otherwise; the statement stops before any quotient carry.

Statement dependencies: Monodromy.Counter.Reversible.Radix.Node, Monodromy.Counter.Reversible.Radix.block, Monodromy.Counter.Reversible.Radix.edges, Monodromy.Counter.Reversible.Radix.next, Monodromy.Counter.Reversible.Radix.nodeEquiv, Monodromy.Counter.Reversible.Radix.point, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Radix.table, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.step.

Original proof dependencies: Monodromy.Counter.Reversible.Action, Monodromy.Counter.Reversible.Action.apply, Monodromy.Counter.Reversible.Action.enabled, Monodromy.Counter.Reversible.Edge, Monodromy.Counter.Reversible.Edge.enabled, Monodromy.Counter.Reversible.Edge.execute, Monodromy.Counter.Reversible.Radix.Arc, Monodromy.Counter.Reversible.Radix.Node, Monodromy.Counter.Reversible.Radix.arcEquiv, Monodromy.Counter.Reversible.Radix.block, Monodromy.Counter.Reversible.Radix.destination, Monodromy.Counter.Reversible.Radix.edges, Monodromy.Counter.Reversible.Radix.move, Monodromy.Counter.Reversible.Radix.next, Monodromy.Counter.Reversible.Radix.nodeEquiv, Monodromy.Counter.Reversible.Radix.operation, Monodromy.Counter.Reversible.Radix.origin, Monodromy.Counter.Reversible.Radix.point, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Radix.table, Monodromy.Counter.Reversible.Radix.table_arc, Monodromy.Counter.Reversible.Radix.update_left, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.step.

Statement elaboration dependencies: Monodromy.Counter.Reversible.Radix.Node, Monodromy.Counter.Reversible.Radix.block, Monodromy.Counter.Reversible.Radix.edges, Monodromy.Counter.Reversible.Radix.next, Monodromy.Counter.Reversible.Radix.nodeEquiv, Monodromy.Counter.Reversible.Radix.point, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Radix.table, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.step.

Proof elaboration dependencies: Monodromy.Counter.Reversible.Action, Monodromy.Counter.Reversible.Action.apply, Monodromy.Counter.Reversible.Action.enabled, Monodromy.Counter.Reversible.Edge, Monodromy.Counter.Reversible.Edge.enabled, Monodromy.Counter.Reversible.Edge.execute, Monodromy.Counter.Reversible.Radix.Arc, Monodromy.Counter.Reversible.Radix.Node, Monodromy.Counter.Reversible.Radix.arcEquiv, Monodromy.Counter.Reversible.Radix.block, Monodromy.Counter.Reversible.Radix.destination, Monodromy.Counter.Reversible.Radix.edges, Monodromy.Counter.Reversible.Radix.move, Monodromy.Counter.Reversible.Radix.next, Monodromy.Counter.Reversible.Radix.nodeEquiv, Monodromy.Counter.Reversible.Radix.operation, Monodromy.Counter.Reversible.Radix.origin, Monodromy.Counter.Reversible.Radix.point, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Radix.table, Monodromy.Counter.Reversible.Radix.table_arc, Monodromy.Counter.Reversible.Radix.update_left, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.step.

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.Counter
open Monodromy.Counter.Reversible
open Monodromy.Counter.Reversible.Radix
variable (p : ℕ) [NeZero p]

Formal statement
theorem Monodromy.Counter.Reversible.Radix.consume_step (remainder : Fin p) (input accumulator : ℕ) :
    StateTransition.Reaches (step (table p))
      (point p (block p remainder 0) (input + 1 : ℕ) accumulator)
      (point p (nodeEquiv p (next p remainder)) input accumulator) := 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.Counter.Reversible.Radix.consume_step at L4758-L4773 [UTF-8 235898:236904].
Read-back

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

For every positive p∈Np\in\mathbb Np∈N, every r∈{0,…,p−1}r\in\{0,\ldots,p-1\}r∈{0,…,p−1} and natural x,ax,ax,a, there is a finite, possibly zero-length, chain of defined RpR_pRp​ steps from (Br,0,x+1,a)(B_{r,0},x+1,a)(Br,0​,x+1,a) to (Nr,x,a)(N_r,x,a)(Nr​,x,a), with natural values coerced to integers, where Nr=Br+1,0N_r=B_{r+1,0}Nr​=Br+1,0​ if r+1<pr+1<pr+1<p and Nr=G1N_r=G_1Nr​=G1​ otherwise. This is reachability rather than a claim that exactly one table step suffices; there is no bound on the chain length in the statement. Zero values of x,ax,ax,a and p=1p=1p=1 are allowed. The two-integer-counter graph RpR_pRp​ has global vertices G0,G1,G2G_0,G_1,G_2G0​,G1​,G2​ and vertices Br,jB_{r,j}Br,j​ for 0≤r<p0\le r<p0≤r<p, 0≤j<80\le j<80≤j<8, with input G0G_0G0​ and finishes Br,7B_{r,7}Br,7​. Its global edges are G0→y=0B0,0G_0\xrightarrow{y=0}B_{0,0}G0​y=0​B0,0​, G1→y↦y+1G2G_1\xrightarrow{y\mapsto y+1}G_2G1​y↦y+1​G2​, G2→y≠0B0,0G_2\xrightarrow{y\ne0}B_{0,0}G2​y=0​B0,0​; for each rrr its other edges are Br,0→x=0Br,2B_{r,0}\xrightarrow{x=0}B_{r,2}Br,0​x=0​Br,2​, Br,0→x≠0Br,1B_{r,0}\xrightarrow{x\ne0}B_{r,1}Br,0​x=0​Br,1​, Br,1→x↦x−1NrB_{r,1}\xrightarrow{x\mapsto x-1}N_rBr,1​x↦x−1​Nr​, Br,2→x=0Br,3B_{r,2}\xrightarrow{x=0}B_{r,3}Br,2​x=0​Br,3​, Br,3→y=0Br,7B_{r,3}\xrightarrow{y=0}B_{r,7}Br,3​y=0​Br,7​, Br,3→y≠0Br,4B_{r,3}\xrightarrow{y\ne0}B_{r,4}Br,3​y=0​Br,4​, Br,4→y↦y−1Br,5B_{r,4}\xrightarrow{y\mapsto y-1}B_{r,5}Br,4​y↦y−1​Br,5​, Br,5→x↦x+1Br,6B_{r,5}\xrightarrow{x\mapsto x+1}B_{r,6}Br,5​x↦x+1​Br,6​ and Br,6→x≠0Br,3B_{r,6}\xrightarrow{x\ne0}B_{r,3}Br,6​x=0​Br,3​, where Nr=Br+1,0N_r=B_{r+1,0}Nr​=Br+1,0​ if r+1<pr+1<pr+1<p and Nr=G1N_r=G_1Nr​=G1​ otherwise. Tests leave the counters unchanged, shifts are unconditionally enabled, and a step takes the least enumerated enabled edge or is undefined if none is enabled.

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