A remainder-indexed permutation preserves the input counters
ProvedMonodromy.Counter.Reversible.RadixObservation.reaches_resultFor every positive p, arbitrary natural m, family of permutations πᵣ of Fin m indexed by r<p, row i∈Fin m and natural value x, the reversible observation table has a finite run from its input port i with counters (x,0) to its output port π₍ₓ mod p₎(i) with the same counters (x,0). The observation changes only the selected finite output row.
Statement dependencies: Monodromy.Counter.DivMod.residue, Monodromy.Counter.Reversible.RadixObservation.edges, Monodromy.Counter.Reversible.RadixObservation.inputPort, Monodromy.Counter.Reversible.RadixObservation.outputPort, Monodromy.Counter.Reversible.RadixObservation.point, Monodromy.Counter.Reversible.RadixObservation.size, Monodromy.Counter.Reversible.RadixObservation.table, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.step.
Original proof dependencies: Monodromy.Counter.DivMod.residue, Monodromy.Counter.Reversible.Glue.mapState, Monodromy.Counter.Reversible.Glue.reaches_map_live, Monodromy.Counter.Reversible.Radix.deterministic, Monodromy.Counter.Reversible.Radix.edges, Monodromy.Counter.Reversible.Radix.entry, Monodromy.Counter.Reversible.Radix.finish, Monodromy.Counter.Reversible.Radix.point, Monodromy.Counter.Reversible.Radix.reaches_result, Monodromy.Counter.Reversible.Radix.reverse_pack, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Radix.table, Monodromy.Counter.Reversible.Radix.targetCompatible, Monodromy.Counter.Reversible.RadixObservation.RawArc, Monodromy.Counter.Reversible.RadixObservation.arcEquiv, Monodromy.Counter.Reversible.RadixObservation.back, Monodromy.Counter.Reversible.RadixObservation.deterministic, Monodromy.Counter.Reversible.RadixObservation.edges, Monodromy.Counter.Reversible.RadixObservation.front, Monodromy.Counter.Reversible.RadixObservation.front_finish, Monodromy.Counter.Reversible.RadixObservation.inputPort, Monodromy.Counter.Reversible.RadixObservation.outputPort, Monodromy.Counter.Reversible.RadixObservation.point, Monodromy.Counter.Reversible.RadixObservation.size, Monodromy.Counter.Reversible.RadixObservation.table, Monodromy.Counter.Reversible.RadixObservation.table_back, Monodromy.Counter.Reversible.RadixObservation.table_front, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.reverseTable, Monodromy.Counter.Reversible.reverseTable_deterministic, Monodromy.Counter.Reversible.step.
Statement elaboration dependencies: Monodromy.Counter.DivMod.residue, Monodromy.Counter.Reversible.RadixObservation.edges, Monodromy.Counter.Reversible.RadixObservation.inputPort, Monodromy.Counter.Reversible.RadixObservation.outputPort, Monodromy.Counter.Reversible.RadixObservation.point, Monodromy.Counter.Reversible.RadixObservation.size, Monodromy.Counter.Reversible.RadixObservation.table, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.step.
Proof elaboration dependencies: Monodromy.Counter.DivMod.residue, Monodromy.Counter.Reversible.Glue.mapState, Monodromy.Counter.Reversible.Glue.reaches_map_live, Monodromy.Counter.Reversible.Radix.deterministic, Monodromy.Counter.Reversible.Radix.edges, Monodromy.Counter.Reversible.Radix.entry, Monodromy.Counter.Reversible.Radix.finish, Monodromy.Counter.Reversible.Radix.point, Monodromy.Counter.Reversible.Radix.reaches_result, Monodromy.Counter.Reversible.Radix.reverse_pack, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Radix.table, Monodromy.Counter.Reversible.Radix.targetCompatible, Monodromy.Counter.Reversible.RadixObservation.RawArc, Monodromy.Counter.Reversible.RadixObservation.arcEquiv, Monodromy.Counter.Reversible.RadixObservation.back, Monodromy.Counter.Reversible.RadixObservation.deterministic, Monodromy.Counter.Reversible.RadixObservation.edges, Monodromy.Counter.Reversible.RadixObservation.front, Monodromy.Counter.Reversible.RadixObservation.front_finish, Monodromy.Counter.Reversible.RadixObservation.inputPort, Monodromy.Counter.Reversible.RadixObservation.outputPort, Monodromy.Counter.Reversible.RadixObservation.point, Monodromy.Counter.Reversible.RadixObservation.size, Monodromy.Counter.Reversible.RadixObservation.table, Monodromy.Counter.Reversible.RadixObservation.table_back, Monodromy.Counter.Reversible.RadixObservation.table_front, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.reverseTable, Monodromy.Counter.Reversible.reverseTable_deterministic, 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.RadixObservation variable (p m : ℕ) [NeZero p]
theorem Monodromy.Counter.Reversible.RadixObservation.reaches_result (permutation : Fin p → Equiv.Perm (Fin m)) (row : Fin m) (value : ℕ) :
StateTransition.Reaches (step (table p m permutation))
(point p m permutation (inputPort p m permutation row) value 0)
(point p m permutation (outputPort p m permutation (permutation (Counter.DivMod.residue p value) row)) value 0) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every positive natural , every natural , every family of permutations of indexed by , every row and natural , a finite, possibly zero-length, chain of defined steps in the specified two-integer-counter table leads from its input port for row with counters to its output port for row with counters . That table is constructed from a forward copy of and a reversed copy of for each row; for each , the finish of forward copy is linked to the finish of reversed copy . Each linked forward exit is replaced by its linked reversed entry, and every original edge's controls are mapped accordingly while its register action is retained; the retained vertices are finite-enumerated. The input port is the image of in a forward copy, and the output port is the image of in a reversed copy. Reversal swaps edge endpoints and negates shifts while preserving tests. The statement has no intermediate-port restriction or time bound, allows and , and has no instances of its row binder when . 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).