The selected reversible step equals enabled-edge semantics
ProvedMonodromy.Counter.Reversible.step_iffFor any natural n,q,e and n-integer-counter table with q control vertices and e edges, assume distinct edges sharing a source have complementary zero/nonzero tests of the same register. For any states s,t, the selected optional step at s equals some t if and only if an edge has source s.pc, is enabled at s, and produces t by moving to its target and applying its shift or unchanged test action.
Statement dependencies: Monodromy.Counter.Reversible.Deterministic, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.StepRel, Monodromy.Counter.Reversible.Table, Monodromy.Counter.Reversible.step.
Original proof dependencies: Monodromy.Counter.Reversible.Deterministic, Monodromy.Counter.Reversible.Edge.enabled, Monodromy.Counter.Reversible.Edge.execute, Monodromy.Counter.Reversible.Edge.instDecidableEnabled, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.StepRel, Monodromy.Counter.Reversible.StepRel.deterministic, Monodromy.Counter.Reversible.Table, Monodromy.Counter.Reversible.step.
Statement elaboration dependencies: Monodromy.Counter.Reversible.Deterministic, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.StepRel, Monodromy.Counter.Reversible.Table, Monodromy.Counter.Reversible.step.
Proof elaboration dependencies: Monodromy.Counter.Reversible.Deterministic, Monodromy.Counter.Reversible.Edge.enabled, Monodromy.Counter.Reversible.Edge.execute, Monodromy.Counter.Reversible.Edge.instDecidableEnabled, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.StepRel, Monodromy.Counter.Reversible.StepRel.deterministic, Monodromy.Counter.Reversible.Table, 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
variable {n q e : ℕ}
theorem Monodromy.Counter.Reversible.step_iff (table : Table n q e) (deterministic : Deterministic table)
{first last : State n q} : Monodromy.Counter.Reversible.step table first = some last ↔ StepRel table first last := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every , let a state be with and , and let be an -indexed list of edges , where an action either adds an arbitrary integer to one register or tests whether one register is zero or nonzero. Assume that any two different edge indices with the same source carry tests of the same register with opposite Boolean flags; in particular, a shift cannot share its source with another edge. For any states , the finite-search executor returns from if and only if some indexed edge has source equal to the control of , has an enabled action, and produces by replacing the control by its target and performing that action. A shift is always enabled; a test with flag true is enabled exactly at zero, and a test with flag false exactly at nonzero, and tests leave registers unchanged. The executor selects the least enabled index and returns no successor when there is none. No completeness, target compatibility, positivity of the sizes, or nonnegativity of the integer registers is assumed; gives no successful transitions, gives no states, and permits no register action.
Confirmed by the mission captain (proposal self-audit).