Eleven native advances realize a reversible counter step
OpenMonodromy.ReversibleCompilation.cycle_stepcomputabilitycovering-spacesmonodromy-computation
For positive and arbitrary , let be a deterministic, target-compatible reversible table with two integer counters, control vertices, and edges. If and are counter states and the selected reversible step of sends to , then eleven iterations of the advance map of the staged compiled program send the embedded state to the embedded successor:
This identifies one counter transition with one complete eleven-phase clock cycle of the compiled native program. It is the endpoint computation needed to turn a staged positive run into a run between embedded counter states.
Formalization Note The register values are arbitrary integers. Determinism and target compatibility are explicit hypotheses, and no global completeness hypothesis is required.
Preamble
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.ReversibleCompilation
open Counter.Reversible CoupledContinuation
variable {q e : ℕ} [NeZero q]
Formal statement
theorem Monodromy.ReversibleCompilation.cycle_step (table : Table 2 q e) (deterministic : Deterministic table)
(compatible : TargetCompatible table) {first last : State 2 q}
(transition : Counter.Reversible.step table first = some last) :
((program table deterministic compatible).advance)^[11] (iota (e := e) first) =
iota (e := e) last := by sorry
Source
Authoritative local working-tree snapshot SHA-256 e03ce2d08e07ee663140bec213fb21e995f44153a3c556c908fcf1c8d6fefe6c; repository https://github.com/ERHUTUZI123/monodromy. src/Monodromy/Counter.lean (file SHA-256 40536289575067aae1ed4154805e219805a1c786ccfdfcbe632ea7478a40636a): Monodromy.ReversibleCompilation.cycle_step at L3460-L3468.