One radix consumption reaches the next remainder port
ProvedMonodromy.Counter.Reversible.Radix.consume_stepFor 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.
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]
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
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every positive , every and natural , there is a finite, possibly zero-length, chain of defined steps from to , with natural values coerced to integers, where if and 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 and are allowed. The two-integer-counter graph has global vertices and vertices for , , with input and finishes . Its global edges are , , ; for each its other edges are , , , , , , , and , where if and 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.
Confirmed by the mission captain (proposal self-audit).