The continuation configuration encoding is injective
ProvedMonodromy.CounterContinuation.encode_injectiveFor every natural control size m, encoding a two-natural-counter configuration as the three-root state prepared from its two counter values and control label 3·pc is injective. Equality of encoded states therefore implies equality of the finite program counter and both counters; no positivity assumption on m is required.
Statement dependencies: Monodromy.Counter.Configuration, Monodromy.CounterContinuation.encode, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point.
Original proof dependencies: Monodromy.Counter.Configuration, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.label, Monodromy.CounterContinuation.label_eq, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.prepare_injective.
Statement elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.CounterContinuation.encode, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point.
Proof elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.CounterContinuation.encode, Monodromy.CounterContinuation.label, Monodromy.CounterContinuation.label_eq, Monodromy.CoupledContinuation.Memory, Monodromy.CoupledContinuation.Point, Monodromy.CoupledContinuation.prepare_injective.
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.CounterContinuation
open CoupledContinuation
variable {m : ℕ}
theorem Monodromy.CounterContinuation.encode_injective : Function.Injective (@encode m) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every natural number , the encoding of all configurations of a two-counter program with possible labels into geometric memory is injective. Explicitly, if a configuration has control and natural counters , its encoding, with , has lower coordinates and upper coordinate ; this point lies in the fiber of over . Equality of encoded points implies equality of the original control labels and both natural counters. No program, transition, halting, or nonzero-size assumption is quantified here; is permitted and gives an empty domain, while counters equal to zero are included.
Confirmed by the mission captain (proposal self-audit).