Injective register relocation preserves the complete optional step
ProvedMonodromy.Counter.Reversible.RegisterRelocation.step_embedFor arbitrary natural n,m,q,e, embed n integer registers injectively into m registers, filling all unselected registers from any fixed integer background. For a deterministic n-register table with q vertices and e edges, renaming every action by this register injection commutes with its whole optional step on every embedded state: the relocated result is the embedded source result when defined, and is absent exactly when the source result is absent. Here determinism requires complementary same-register tests for distinct edges with a common source.
Statement dependencies: Monodromy.Counter.Reversible.Deterministic, Monodromy.Counter.Reversible.RegisterRelocation.embed, Monodromy.Counter.Reversible.RegisterRelocation.mapTable, Monodromy.Counter.Reversible.State, 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.RegisterRelocation.deterministic, Monodromy.Counter.Reversible.RegisterRelocation.edge_enabled_embed, Monodromy.Counter.Reversible.RegisterRelocation.edge_execute_embed, Monodromy.Counter.Reversible.RegisterRelocation.embed, Monodromy.Counter.Reversible.RegisterRelocation.mapTable, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.StepRel, Monodromy.Counter.Reversible.Table, Monodromy.Counter.Reversible.step, Monodromy.Counter.Reversible.step_iff, Monodromy.Counter.Reversible.step_none_iff.
Statement elaboration dependencies: Monodromy.Counter.Reversible.Deterministic, Monodromy.Counter.Reversible.RegisterRelocation.embed, Monodromy.Counter.Reversible.RegisterRelocation.mapTable, Monodromy.Counter.Reversible.State, 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.RegisterRelocation.deterministic, Monodromy.Counter.Reversible.RegisterRelocation.edge_enabled_embed, Monodromy.Counter.Reversible.RegisterRelocation.edge_execute_embed, Monodromy.Counter.Reversible.RegisterRelocation.embed, Monodromy.Counter.Reversible.RegisterRelocation.mapTable, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.StepRel, Monodromy.Counter.Reversible.Table, Monodromy.Counter.Reversible.step, Monodromy.Counter.Reversible.step_iff, Monodromy.Counter.Reversible.step_none_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.RegisterRelocation
variable {n m q e : ℕ}
theorem Monodromy.Counter.Reversible.RegisterRelocation.step_embed (register : Fin n → Fin m) (faithful : Function.Injective register)
(background : Fin m → ℤ) (source : Table n q e) (valid : Deterministic source)
(state : State n q) :
step (mapTable register source) (embed register background state) =
(step source state).map (embed register background) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For all natural numbers , every injective register map , every integer background vector on the registers, every -edge table on controls and integer registers, and every source state , assume that distinct source-table edges with the same source control must be complementary zero/nonzero tests on the same register. Define by and for registers outside the image of . Map the table by replacing every action's register by and keeping the edge's source, target, shift amount or test flag unchanged. Then the mapped table's step at is the option obtained by applying to the successor of under when that successor exists, and is undefined exactly when that source step is undefined. In both tables shifts are always enabled and add their integer amount to the selected register; a test with flag true is enabled exactly at zero and with flag false exactly at nonzero, leaves all registers unchanged, and a step chooses the least enabled edge or has no successor. The background has no sign restriction, no compatibility condition on common targets is assumed, and empty register/edge domains and an empty state domain when are included.
Confirmed by the mission captain (proposal self-audit).