Division consumption accumulates quotient and control remainder
ProvedMonodromy.Counter.DivMod.consume_reachesFor every positive divisor p, natural counter values x,y, and remainder r with 0≤r<p, the finite division program runs from its consume(r) address with counters (x,y) to transfer((x+r) mod p) with counters (0,y+⌊(x+r)/p⌋). The remainder is retained in finite control, and the conclusion is finite reachability rather than termination at that transfer address.
Statement dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.DivMod.configuration, Monodromy.Counter.DivMod.consume, Monodromy.Counter.DivMod.program, Monodromy.Counter.DivMod.residue, Monodromy.Counter.DivMod.size, Monodromy.Counter.DivMod.transfer, Monodromy.Counter.step.
Original proof dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.DivMod.bump, Monodromy.Counter.DivMod.configuration, Monodromy.Counter.DivMod.consume, Monodromy.Counter.DivMod.next, Monodromy.Counter.DivMod.prepend, Monodromy.Counter.DivMod.program, Monodromy.Counter.DivMod.reaches_step, Monodromy.Counter.DivMod.residue, Monodromy.Counter.DivMod.residue_small, Monodromy.Counter.DivMod.size, Monodromy.Counter.DivMod.step_bump, Monodromy.Counter.DivMod.step_consume_succ, Monodromy.Counter.DivMod.step_consume_zero, Monodromy.Counter.DivMod.transfer, Monodromy.Counter.step.
Statement elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.DivMod.configuration, Monodromy.Counter.DivMod.consume, Monodromy.Counter.DivMod.program, Monodromy.Counter.DivMod.residue, Monodromy.Counter.DivMod.size, Monodromy.Counter.DivMod.transfer, Monodromy.Counter.step.
Proof elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.DivMod.bump, Monodromy.Counter.DivMod.configuration, Monodromy.Counter.DivMod.consume, Monodromy.Counter.DivMod.next, Monodromy.Counter.DivMod.prepend, Monodromy.Counter.DivMod.program, Monodromy.Counter.DivMod.reaches_step, Monodromy.Counter.DivMod.residue, Monodromy.Counter.DivMod.residue_small, Monodromy.Counter.DivMod.size, Monodromy.Counter.DivMod.step_bump, Monodromy.Counter.DivMod.step_consume_succ, Monodromy.Counter.DivMod.step_consume_zero, Monodromy.Counter.DivMod.transfer, Monodromy.Counter.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.DivMod variable (p : ℕ) [NeZero p]
theorem Monodromy.Counter.DivMod.consume_reaches (first second : ℕ) (remainder : Fin p) :
StateTransition.Reaches (Counter.step (program p))
(configuration p (consume p remainder) first second)
(configuration p (transfer p (residue p (first + remainder.val))) 0
(second + (first + remainder.val) / p)) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every positive natural , natural numbers and remainder , there is a finite, possibly zero-length, sequence of defined steps of the following two-natural-counter program from control with counters to control with counters . Its control positions are consumption , transfer , restore , finish for each remainder, and bump . At consumption , register is tested/decremented: zero jumps to transfer ; nonzero decrements and jumps to consumption if , otherwise bump. At transfer , register is tested/decremented: zero jumps to finish , nonzero decrements and jumps to restore ; restore increments register and returns to transfer ; finish halts; bump increments register and returns to consumption . No initial positivity of or is assumed, is allowed, and quotient and remainder are natural-number division and modulus by the nonzero .
Confirmed by the mission captain (proposal self-audit).