Multiplication consumption accumulates the scaled input
ProvedMonodromy.CounterMultiplication.consume_reachFor all natural factor f and counter values x,y, including f=0, the fixed two-counter multiplication program has a finite run from control address 0 with counters (x,y) to address 0 with counters (0,y+f·x). Reachability is reflexive-transitive and imposes no positive-length or halting condition.
Statement dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.step, Monodromy.CounterMultiplication.configuration, Monodromy.CounterMultiplication.program.
Original proof dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.step, Monodromy.CounterMultiplication.configuration, Monodromy.CounterMultiplication.increments_reach, Monodromy.CounterMultiplication.phase, Monodromy.CounterMultiplication.program, Monodromy.CounterMultiplication.step_consume.
Statement elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.step, Monodromy.CounterMultiplication.configuration, Monodromy.CounterMultiplication.program.
Proof elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.step, Monodromy.CounterMultiplication.configuration, Monodromy.CounterMultiplication.increments_reach, Monodromy.CounterMultiplication.phase, Monodromy.CounterMultiplication.program, Monodromy.CounterMultiplication.step_consume.
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.CounterMultiplication
theorem Monodromy.CounterMultiplication.consume_reach (factor first second : ℕ) :
StateTransition.Reaches (Counter.step (program factor))
(configuration factor 0 first second)
(configuration factor 0 0 (second + factor * first)) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For all natural numbers , including and either counter equal to zero, the following natural two-counter program on labels can reach from by finitely many of its ordinary successful counter steps, where a zero-length run is allowed. Its instructions are: at label , decrement register , branching at zero to and otherwise to label ; at a label , increment register and jump to ; at , decrement register , branching at zero to and otherwise to ; at , increment register and return to ; and at , halt. The auxiliary phase constructor sends a natural to its residue modulo , so the label in the first instruction is when . The assertion stops at the entry label with the displayed counters, rather than requiring execution to the halting label; in particular, when the starting and ending configurations coincide and the reflexive reachability clause already applies.
Confirmed by the mission captain (proposal self-audit).