Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Prime compression is injective on complete natural configurations

Proved
Monodromy.Counter.Reversible.PrimeCompression.encode_injective

by Xiaoyang Liu · Nov 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

computabilitycovering-spacesmonodromy-computation

For 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 ∏i<npixi\prod_{i<n}p_i^{x_i}∏i<n​pixi​​ 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.

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.Counter
open Monodromy.Counter.Reversible
open Monodromy.Counter.Reversible.PrimeCompression
variable {n q e : ℕ}

Formal statement
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
Source
Authoritative local working-tree snapshot SHA-256 e03ce2d08e07ee663140bec213fb21e995f44153a3c556c908fcf1c8d6fefe6c; repository https://github.com/ERHUTUZI123/monodromy. The remote Git base is incomplete and is not asserted to contain these declarations. src/Monodromy/Counter.lean (file SHA-256 40536289575067aae1ed4154805e219805a1c786ccfdfcbe632ea7478a40636a): Monodromy.Counter.Reversible.PrimeCompression.encode_injective at L7581-L7598 [UTF-8 387916:389057].
Read-back

What the Lean code literally says, in plain math · OpenAI Codex (independent agent)

For every n,q,e∈Nn,q,e\in\mathbb Nn,q,e∈N, every injective family of primes (pi)i<n(p_i)_{i<n}(pi​)i<n​, and every table PPP of eee integer-register shift/test edges on qqq controls and nnn 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 s=(j,v)s=(j,v)s=(j,v) to the two-integer-counter configuration E(s)=(cP(j),(∏i<npivi,0))E(s)=(c_P(j),(\prod_{i<n}p_i^{v_i},0))E(s)=(cP​(j),(∏i<n​pivi​​,0)) is injective: equality of encoded states implies equality of source controls and of every natural register. To define cPc_PcP​, 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 +1+1+1; 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 pip_ipi​ and input G0G_0G0​, or finish B0,7B_{0,7}B0,7​ when reversed. Gluing deletes each linked exit in favor of its designated entry and finite-enumerates the remaining vertices. The product is 111 when n=0n=0n=0, and in that case the natural register vector is the unique empty function; if q=0q=0q=0 the domain is empty. No positivity of n,q,en,q,en,q,e and no unit-shift restriction are additional hypotheses.

Human review
  • Endorsed by marwahaha · Nov 6, 2026

  • Endorsed by Xiaoyang Liu · Nov 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me