Prime compression is injective on complete natural configurations
ProvedMonodromy.Counter.Reversible.PrimeCompression.encode_injectiveFor arbitrary natural n,q,e, choose n distinct primes and an n-integer-counter source table whose distinct edges sharing a source or target carry complementary tests of the same register. Its two-counter compression encoding is injective on all natural-counter configurations: it retains the finite control address at the corresponding compressed boundary, stores the prime product in the first integer counter and zero in the second. No unit-shift hypothesis is required for this injectivity assertion.
Statement dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Reversible.Deterministic, Monodromy.Counter.Reversible.PrimeCompression.encode, Monodromy.Counter.Reversible.PrimeCompression.size, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.Table, Monodromy.Counter.Reversible.TargetCompatible, Monodromy.PrimeCode.Basis.
Original proof dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Reversible.Deterministic, Monodromy.Counter.Reversible.PortNetwork.control_unlinked_injective, Monodromy.Counter.Reversible.PrimeCompression.boundary, Monodromy.Counter.Reversible.PrimeCompression.boundary_injective, Monodromy.Counter.Reversible.PrimeCompression.boundary_link_none, Monodromy.Counter.Reversible.PrimeCompression.encode, Monodromy.Counter.Reversible.PrimeCompression.rawEdges, Monodromy.Counter.Reversible.PrimeCompression.rawSize, Monodromy.Counter.Reversible.PrimeCompression.rawTable, Monodromy.Counter.Reversible.PrimeCompression.size, Monodromy.Counter.Reversible.PrimeCompression.wiring, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.Table, Monodromy.Counter.Reversible.TargetCompatible, Monodromy.PrimeCode.Basis, Monodromy.PrimeCode.Basis.encode, Monodromy.PrimeCode.Basis.encode_injective.
Statement elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Reversible.Deterministic, Monodromy.Counter.Reversible.PrimeCompression.encode, Monodromy.Counter.Reversible.PrimeCompression.size, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.Table, Monodromy.Counter.Reversible.TargetCompatible, Monodromy.PrimeCode.Basis.
Proof elaboration dependencies: Monodromy.Counter.Configuration, Monodromy.Counter.Reversible.Deterministic, Monodromy.Counter.Reversible.PortNetwork.control_unlinked_injective, Monodromy.Counter.Reversible.PrimeCompression.boundary, Monodromy.Counter.Reversible.PrimeCompression.boundary_injective, Monodromy.Counter.Reversible.PrimeCompression.boundary_link_none, Monodromy.Counter.Reversible.PrimeCompression.encode, Monodromy.Counter.Reversible.PrimeCompression.rawEdges, Monodromy.Counter.Reversible.PrimeCompression.rawSize, Monodromy.Counter.Reversible.PrimeCompression.rawTable, Monodromy.Counter.Reversible.PrimeCompression.size, Monodromy.Counter.Reversible.PrimeCompression.wiring, Monodromy.Counter.Reversible.State, Monodromy.Counter.Reversible.Table, Monodromy.Counter.Reversible.TargetCompatible, Monodromy.PrimeCode.Basis, Monodromy.PrimeCode.Basis.encode, Monodromy.PrimeCode.Basis.encode_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.Counter
open Monodromy.Counter.Reversible
open Monodromy.Counter.Reversible.PrimeCompression
variable {n q e : ℕ}
theorem Monodromy.Counter.Reversible.PrimeCompression.encode_injective (basis : PrimeCode.Basis n) (source : Table n q e)
(deterministic : Deterministic source) (compatible : TargetCompatible source) :
Function.Injective (encode basis source deterministic compatible) := by sorry
Read-back
What the Lean code literally says, in plain math · OpenAI Codex (independent agent)
For every , every injective family of primes , and every table of integer-register shift/test edges on controls and registers, assume that any distinct edges with the same source are complementary zero/nonzero tests on one common register, and likewise for distinct edges with the same target. The map from natural-counter configurations to the two-integer-counter configuration is injective: equality of encoded states implies equality of source controls and of every natural register. To define , a row with outgoing edges is represented by the input of its source radix module, using the register of the least outgoing edge and reversing that module exactly for a shift by ; a row without outgoing edges is represented by a separate vertex. These controls are mapped to the retained vertices after gluing shift outputs to target controls, test remainder outputs to reversed restoration modules at their target, and restoration outputs to target controls; a radix module uses prime and input , or finish when reversed. Gluing deletes each linked exit in favor of its designated entry and finite-enumerates the remaining vertices. The product is when , and in that case the natural register vector is the unique empty function; if the domain is empty. No positivity of and no unit-shift restriction are additional hypotheses.
Confirmed by the mission captain (proposal self-audit).