Recording into integer registers is injective
ProvedMonodromy.Counter.Reversible.Recording.embed_injectiveFor arbitrary natural register and control counts n,m, embedding a recorded state (source configuration, natural history) into the reversible table with n+2 integer registers is injective. The embedding retains the source program counter at its recording dispatch, casts all n natural source counters to integers, places the history in the next register and sets the final workspace register to zero.
Statement dependencies: Monodromy.Counter.Recorded.State, Monodromy.Counter.Reversible.Recording.embed, Monodromy.Counter.Reversible.Recording.size, Monodromy.Counter.Reversible.State.
Original proof dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Recorded.State, Monodromy.Counter.Reversible.Radix.entry, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Recording.base, Monodromy.Counter.Reversible.Recording.copy, Monodromy.Counter.Reversible.Recording.copy_eq_iff, Monodromy.Counter.Reversible.Recording.dispatch, Monodromy.Counter.Reversible.Recording.embed, Monodromy.Counter.Reversible.Recording.frame_history, Monodromy.Counter.Reversible.Recording.frame_old, Monodromy.Counter.Reversible.Recording.framed, Monodromy.Counter.Reversible.Recording.historyRegister, Monodromy.Counter.Reversible.Recording.size, Monodromy.Counter.Reversible.State.
Statement elaboration dependencies: Monodromy.Counter.Recorded.State, Monodromy.Counter.Reversible.Recording.embed, Monodromy.Counter.Reversible.Recording.size, Monodromy.Counter.Reversible.State.
Proof elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Recorded.State, Monodromy.Counter.Reversible.Radix.entry, Monodromy.Counter.Reversible.Radix.size, Monodromy.Counter.Reversible.Recording.base, Monodromy.Counter.Reversible.Recording.copy, Monodromy.Counter.Reversible.Recording.copy_eq_iff, Monodromy.Counter.Reversible.Recording.dispatch, Monodromy.Counter.Reversible.Recording.embed, Monodromy.Counter.Reversible.Recording.frame_history, Monodromy.Counter.Reversible.Recording.frame_old, Monodromy.Counter.Reversible.Recording.framed, Monodromy.Counter.Reversible.Recording.historyRegister, Monodromy.Counter.Reversible.Recording.size, Monodromy.Counter.Reversible.State.
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.Recording
variable {n m : ℕ}
theorem Monodromy.Counter.Reversible.Recording.embed_injective : Function.Injective (@embed n m) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every pair of natural numbers , the map from a pair consisting of an -natural-register configuration on controls and a natural history to the integer-register state is injective. The image has control , the first register entries equal to the natural counters of coerced to integers, the next entry coerced to an integer, and the last entry . Here is the finite control representing in the left summand of , enumerated using the product/sum finite equivalences, where and consists of three globals and pairs with , ; in particular its cardinality is . Thus equality of these image states implies equality of both full source configurations and histories. No program is an argument of this embedding. Empty register families are permitted, and for there are no source configurations, so injectivity holds on an empty domain.
Confirmed by the mission captain (proposal self-audit).