Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The continuation configuration encoding is injective

Proved
Monodromy.CounterContinuation.encode_injective

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

computabilitycovering-spacesmonodromy-computation

For 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.

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.CounterContinuation
open CoupledContinuation
variable {m : ℕ}

Formal statement
theorem Monodromy.CounterContinuation.encode_injective : Function.Injective (@encode m) := 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.CounterContinuation.encode_injective at L329-L355 [UTF-8 13712:15024].
Read-back

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

For every natural number mmm, the encoding of all configurations of a two-counter program with mmm possible labels into geometric memory is injective. Explicitly, if a configuration has control p∈{0,…,m−1}p\in\{0,\ldots,m-1\}p∈{0,…,m−1} and natural counters x0,x1x_0,x_1x0​,x1​, its encoding, with τ=2πi\tau=2\pi iτ=2πi, has lower coordinates 1+τx0,1+τx11+\tau x_0,1+\tau x_11+τx0​,1+τx1​ and upper coordinate log⁡(1+τx0)+log⁡(1+τx1)+τ(3p)\log(1+\tau x_0)+\log(1+\tau x_1)+\tau(3p)log(1+τx0​)+log(1+τx1​)+τ(3p); this point lies in the fiber of (w0,w1,z)↦(ew0,ew1,ez/(w0w1))(w_0,w_1,z)\mapsto(e^{w_0},e^{w_1},e^z/(w_0w_1))(w0​,w1​,z)↦(ew0​,ew1​,ez/(w0​w1​)) over (e,e,1)(e,e,1)(e,e,1). 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; m=0m=0m=0 is permitted and gives an empty domain, while counters equal to zero are included.

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