The probe restoration path reconstructs quotient and remainder
ProvedMonodromy.CounterPrimeProbe.restore_reachesFor every positive p, remainder r<p, and natural quotient q, the two-counter probe program has a finite run from the multiplication countdown address phase(p,r) with counters (q,0) to its failure address with counters (r+p·q,0). The theorem allows r=0 as well as nonzero remainders.
Statement dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.step, Monodromy.CounterMultiplication.phase, Monodromy.CounterPrimeProbe.configuration, Monodromy.CounterPrimeProbe.failure, Monodromy.CounterPrimeProbe.mulAddress, Monodromy.CounterPrimeProbe.program, Monodromy.CounterPrimeProbe.size.
Original proof dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Instruction, Monodromy.Counter.mapConfiguration, Monodromy.Counter.reaches_map_live, Monodromy.Counter.step, Monodromy.CounterMultiplication.configuration, Monodromy.CounterMultiplication.consume_reach, Monodromy.CounterMultiplication.finish, Monodromy.CounterMultiplication.increments_reach, Monodromy.CounterMultiplication.phase, Monodromy.CounterMultiplication.program, Monodromy.CounterMultiplication.step_begin_transfer, Monodromy.CounterMultiplication.step_finish, Monodromy.CounterMultiplication.transfer, Monodromy.CounterMultiplication.transfer_reach, Monodromy.CounterPrimeProbe.configuration, Monodromy.CounterPrimeProbe.failure, Monodromy.CounterPrimeProbe.mulAddress, Monodromy.CounterPrimeProbe.program, Monodromy.CounterPrimeProbe.program_mulAddress, Monodromy.CounterPrimeProbe.size.
Statement elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.step, Monodromy.CounterMultiplication.phase, Monodromy.CounterPrimeProbe.configuration, Monodromy.CounterPrimeProbe.failure, Monodromy.CounterPrimeProbe.mulAddress, Monodromy.CounterPrimeProbe.program, Monodromy.CounterPrimeProbe.size.
Proof elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Instruction, Monodromy.Counter.mapConfiguration, Monodromy.Counter.reaches_map_live, Monodromy.Counter.step, Monodromy.CounterMultiplication.configuration, Monodromy.CounterMultiplication.consume_reach, Monodromy.CounterMultiplication.finish, Monodromy.CounterMultiplication.increments_reach, Monodromy.CounterMultiplication.phase, Monodromy.CounterMultiplication.program, Monodromy.CounterMultiplication.step_begin_transfer, Monodromy.CounterMultiplication.step_finish, Monodromy.CounterMultiplication.transfer, Monodromy.CounterMultiplication.transfer_reach, Monodromy.CounterPrimeProbe.configuration, Monodromy.CounterPrimeProbe.failure, Monodromy.CounterPrimeProbe.mulAddress, Monodromy.CounterPrimeProbe.mul_configuration, Monodromy.CounterPrimeProbe.program, Monodromy.CounterPrimeProbe.program_mulAddress, Monodromy.CounterPrimeProbe.size.
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.CounterPrimeProbe variable (p : ℕ) [NeZero p]
theorem Monodromy.CounterPrimeProbe.restore_reaches (remainder : Fin p) (quotient : ℕ) :
StateTransition.Reaches (Counter.step (program p))
(configuration p (mulAddress p (CounterMultiplication.phase p remainder.val)) quotient 0)
(configuration p (Monodromy.CounterPrimeProbe.failure p) (remainder.val + p * quotient) 0) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
Let be a positive natural number, let and . In the following two-counter natural-number program, the configuration at multiplication-block label with counters reaches the multiplication block's halting label with counters by a finite number of successful steps, possibly zero under the general reachability convention. The entire program has a division block of labels followed by a multiplication block of labels. The latter block has entry decrementing counter toward countdown label or transfer label ; labels increment counter and descend; label decrements counter toward halt at zero or restore at nonzero; and increments counter and returns to . Local multiplication labels are embedded by adding , and the starting phase is . The division block's zero-remainder exit remains its own halt, whereas every nonzero-remainder exit is redirected to the corresponding multiplication countdown phase; all other target labels are relocated within their block. The asserted destination is the named failure control, namely the multiplication halt, and there is no assertion that the initial quotient or remainder arose from a preceding division, or that is prime; , , and are included.
Confirmed by the mission captain (proposal self-audit).