Reversing a radix edge preserves the port invariant
ProvedMonodromy.Counter.Reversible.Radix.valid_reverse_stepFor every positive radix p and any two integer-counter states s,t, if s satisfies the radix table’s Valid invariant and the reversed table takes a successful step s→t, then t also satisfies Valid. This invariant requires both registers to be nonnegative and the zero, positive or nonzero conditions specified by the current global or remainder-phase control port.
Statement dependencies: Monodromy.Counter.Reversible.Radix.Valid, Monodromy.Counter.Reversible.Radix.edges, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Radix.table, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.reverseTable, 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.Valid, Monodromy.Counter.Reversible.Radix.admissible, Monodromy.Counter.Reversible.Radix.arcEquiv, Monodromy.Counter.Reversible.Radix.destination, Monodromy.Counter.Reversible.Radix.edges, Monodromy.Counter.Reversible.Radix.next, Monodromy.Counter.Reversible.Radix.nodeEquiv, Monodromy.Counter.Reversible.Radix.operation, Monodromy.Counter.Reversible.Radix.origin, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Radix.table, Monodromy.Counter.Reversible.Radix.table_arc, Monodromy.Counter.Reversible.Radix.targetCompatible, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.StepRel, Monodromy.Counter.Reversible.reverseAction, Monodromy.Counter.Reversible.reverseTable, Monodromy.Counter.Reversible.reverseTable_deterministic, Monodromy.Counter.Reversible.step, Monodromy.Counter.Reversible.step_iff.
Statement elaboration dependencies: Monodromy.Counter.Reversible.Radix.Valid, Monodromy.Counter.Reversible.Radix.edges, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Radix.table, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.reverseTable, 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.Valid, Monodromy.Counter.Reversible.Radix.admissible, Monodromy.Counter.Reversible.Radix.arcEquiv, Monodromy.Counter.Reversible.Radix.destination, Monodromy.Counter.Reversible.Radix.edges, Monodromy.Counter.Reversible.Radix.next, Monodromy.Counter.Reversible.Radix.nodeEquiv, Monodromy.Counter.Reversible.Radix.operation, Monodromy.Counter.Reversible.Radix.origin, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Radix.table, Monodromy.Counter.Reversible.Radix.table_arc, Monodromy.Counter.Reversible.Radix.targetCompatible, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.StepRel, Monodromy.Counter.Reversible.reverseAction, Monodromy.Counter.Reversible.reverseEdge, Monodromy.Counter.Reversible.reverseTable, Monodromy.Counter.Reversible.reverseTable_deterministic, Monodromy.Counter.Reversible.step, Monodromy.Counter.Reversible.step_iff.
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.valid_reverse_step {first last : State 2 (size p)}
(valid : Valid p first) (transition : step (reverseTable (table p)) first = some last) :
Valid p last := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every positive natural and all integer-register states of the -control table, if is valid and one step of the reversed table of sends to , then is valid. Reversal exchanges every edge's source and target, negates shift amounts and leaves test flags unchanged; it still selects the least enabled edge. Validity at state means , , and the following control-dependent condition: at , ; at , no further condition; at , ; at the conditions for are respectively , , , , , , , . The implication concerns any defined reversed step and makes no claim of existence of a successor. 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).