Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Reconciliation under a nearly uniform input yields an affine code

Open
QAlgorithms.Papers.Independent.Intakenext100.P30.nearly_uniform_reconciliation_code

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Retain the channel, surjective linear compressor f:U→Cf:U\to Cf:U→C, and normalized decompressor family of Lemma 2. Let PPP be an input law on UUU, and let UunifU_{\rm unif}Uunif​ denote the uniform law. Suppose ε1,ε2≥0\varepsilon_1,\varepsilon_2\ge0ε1​,ε2​≥0, 12∑u∣P(u)−∣U∣−1∣≤ε1\tfrac12\sum_u|P(u)-|U|^{-1}|\le\varepsilon_121​∑u​∣P(u)−∣U∣−1∣≤ε1​, and the same reconciliation protocol has error at most ε2\varepsilon_2ε2​ under PPP. There are an affine encoder m↦a+mm\mapsto a+mm↦a+m from M=ker⁡fM=\ker fM=kerf and a normalized decoder such that

∣M∣=∣U∣∣C∣,Pr⁡[M^≠M]≤ε1+ε2|M|=\frac{|U|}{|C|},\qquad \Pr[\widehat M\ne M]\le\varepsilon_1+\varepsilon_2∣M∣=∣C∣∣U∣​,Pr[M=M]≤ε1​+ε2​

for uniformly distributed messages. This permits the uniform-input construction to tolerate the distribution-shaping error.

All alphabets are finite and nonempty, and output Hilbert spaces are finite dimensional and nonzero. A classical–quantum channel assigns a positive semidefinite, trace-one matrix to each input. Encoders may use private randomness; decoders are normalized POVMs. Codes are fixed independently of the message, with no supplied shared key or entanglement. Logarithms and entropies are in bits.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P30
Formal statement
noncomputable section

open scoped BigOperators ComplexConjugate Matrix ComplexOrder

open Filter

namespace QAlgorithms.Papers.Independent.Intakenext100.P30

variable {X Y Z M U V A B C : Type*}

variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]

variable [Fintype Z] [DecidableEq Z] [Fintype M] [DecidableEq M]

variable [Fintype U] [DecidableEq U] [Fintype V] [DecidableEq V]

variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]

variable [Fintype C] [DecidableEq C]

attribute [local instance] Classical.propDecidable

/-- Remark 2, PDF p.4, with Lemma 2's onto-range and affine-fiber corrections.
The same channel and reconciliation protocol are evaluated under the two laws. -/
theorem nearly_uniform_reconciliation_code {K : Type*} [Field K]
    [AddCommGroup U] [Module K U] [AddCommGroup C] [Module K C] [Nonempty Y]
    (theta : U → Matrix Y Y ℂ) (hTheta : RRIsCq theta)
    (compress : U →ₗ[K] C) (honto : Function.Surjective compress)
    (decompress : C → U → Matrix Y Y ℂ) (hDec : ∀ c, IsPOVM (decompress c))
    (p : RRDistribution U) (epsilon1 epsilon2 : ℝ) (he1 : 0 ≤ epsilon1) (he2 : 0 ≤ epsilon2)
    (hnear : tvDist (rrUniform U) p.prob ≤ epsilon1)
    (herror : rrReconciliationError theta compress decompress p.prob ≤ epsilon2) :
    ∃ a : U, ∃ decoder : {u : U // compress u = 0} → Matrix Y Y ℂ,
      IsPOVM decoder ∧
      (Fintype.card {u : U // compress u = 0} : ℝ) =
        (Fintype.card U : ℝ) / (Fintype.card C : ℝ) ∧
      rrAffineCodeError theta compress a decoder ≤ epsilon1 + epsilon2 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P30

end
Source
Noisy channel coding via privacy amplification and information reconciliation, arXiv:1012.4814v2, PDF p. 4, Remark 2: nearly uniform inputs
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let KKK be any field, U,CU,CU,C finite additive commutative groups with KKK-module structures, and YYY a finite nonempty index type, with decidable equality where required. Suppose every θ(u)∈CY×Y\theta(u)\in\mathbb C^{Y\times Y}θ(u)∈CY×Y is positive semidefinite with trace one, f:U→Cf:U\to Cf:U→C is a surjective KKK-linear map, and Dc,u⪰0D_{c,u}\succeq0Dc,u​⪰0 with ∑u∈UDc,u=IY\sum_{u\in U}D_{c,u}=I_Y∑u∈U​Dc,u​=IY​ for every c∈Cc\in Cc∈C. Let p:U→Rp:U\to\mathbb Rp:U→R have nonnegative entries summing to one, and let ϵ1,ϵ2≥0\epsilon_1,\epsilon_2\ge0ϵ1​,ϵ2​≥0. If

12∑u∈U∣1∣U∣−p(u)∣≤ϵ1,∑u∈Up(u)[1−Re⁡tr⁡(Df(u),uθ(u))]≤ϵ2,\frac12\sum_{u\in U}\left|\frac1{|U|}-p(u)\right|\le\epsilon_1, \qquad \sum_{u\in U}p(u) \left[1-\operatorname{Re}\operatorname{tr}\bigl(D_{f(u),u}\theta(u)\bigr)\right]\le\epsilon_2,21​u∈U∑​​∣U∣1​−p(u)​≤ϵ1​,u∈U∑​p(u)[1−Retr(Df(u),u​θ(u))]≤ϵ2​,

then there exist a∈Ua\in Ua∈U and matrices MvM_vMv​, indexed by v∈ker⁡fv\in\ker fv∈kerf, such that Mv⪰0M_v\succeq0Mv​⪰0, ∑v∈ker⁡fMv=IY\sum_{v\in\ker f}M_v=I_Y∑v∈kerf​Mv​=IY​,

∣ker⁡f∣=∣U∣∣C∣as an equality of real numbers,1∣ker⁡f∣∑v∈ker⁡f[1−Re⁡tr⁡(Mvθ(a+v))]≤ϵ1+ϵ2.|\ker f|=\frac{|U|}{|C|} \quad\text{as an equality of real numbers}, \qquad \frac1{|\ker f|}\sum_{v\in\ker f} \left[1-\operatorname{Re}\operatorname{tr}\bigl(M_v\theta(a+v)\bigr)\right] \le\epsilon_1+\epsilon_2.∣kerf∣=∣C∣∣U∣​as an equality of real numbers,∣kerf∣1​v∈kerf∑​[1−Retr(Mv​θ(a+v))]≤ϵ1​+ϵ2​.

Singleton module cases and zero values of either error parameter are allowed.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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