Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ordinary compression under the letterwise criterion

Open
QAlgorithms.Papers.Independent.Support50.P38.theorem13

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let X,YX,YX,Y be finite nonempty alphabets, PPP a probability law on XXX, and W:X→P(Y)W:X\to\mathcal P(Y)W:X→P(Y) a stochastic channel. All logarithms and entropies are in bits. Write Pn,WnP^n,W^nPn,Wn for the memoryless product laws, I=H(PW)−H(W∣P)I=H(PW)-H(W|P)I=H(PW)−H(W∣P), and dTV(p,q)=12∑∣p−q∣d_{\rm TV}(p,q)=\frac12\sum|p-q|dTV​(p,q)=21​∑∣p−q∣. For each fixed 0<λ<10<\lambda<10<λ<1, there exist K>0,n0K>0,n_0K>0,n0​ such that every n≥n0n\ge n_0n≥n0​, n≥1n\ge1n≥1, admits an ordinary visible stochastic code, with independent private randomness and no shared seed, whose output law W^n(x)\widehat W_n(x)Wn​(x) satisfies

log⁡2∣C∣≤nI+Kn,∑xPn(x)1n∑k=1ndTV(Wxk,W^n(x)k)≤λ.\log_2|C|\le nI+K\sqrt n,\qquad \sum_x P^n(x)\frac1n\sum_{k=1}^n d_{\rm TV}\bigl(W_{x_k},\widehat W_n(x)_k\bigr)\le\lambda.log2​∣C∣≤nI+Kn​,x∑​Pn(x)n1​k=1∑n​dTV​(Wxk​​,Wn​(x)k​)≤λ.

The subscript kkk denotes the marginal on the kkkth output position. This is the source's letterwise criterion, with averaging outside the distance.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P38
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P38

open scoped BigOperators Matrix ComplexConjugate

open Filter

open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw)

open QAlgorithms.Papers.Independent.Frontier30.P12 (IsStochastic)

open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)

attribute [local instance] Classical.propDecidable

/-- Theorem 13, PDF p.7: no shared randomness and the precise letterwise criterion (5).
Communicating a choice from polynomially many seeds is included in the message alphabet. -/
theorem theorem13 {A B : Type} [Fintype A] [Fintype B] [DecidableEq B]
    [Nonempty A] [Nonempty B] (p : A → ℝ) (w : A → B → ℝ)
    (hp : IsLaw p) (hw : IsStochastic w) (error : ℝ) (he : 0 < error) (he1 : error < 1) :
    ∃ k : ℝ, 0 < k ∧ ∃ threshold : ℕ, ∀ n ≥ threshold, 0 < n →
      ∃ c : DistributionCompressionCode A B n,
        Real.logb 2 (c.size : ℝ) ≤ n * sourceInformationBits p w + k * Real.sqrt n ∧
        letterError p w c ≤ error := by sorry

end QAlgorithms.Papers.Independent.Support50.P38

end
Source
Compression of sources of probability distributions and density operators, arXiv:quant-ph/0208131v1, PDF p. 7, Theorem 13
Read-back

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

Let A,BA,BA,B be finite nonempty types, with decidable equality on BBB, let p:A→Rp:A\to\mathbb Rp:A→R be nonnegative with total mass 111, let w:A→B→Rw:A\to B\to\mathbb Rw:A→B→R have nonnegative rows of total mass 111, and fix 0<ε<10<\varepsilon<10<ε<1. Write H(q)=−∑zq(z)log⁡2q(z)H(q)=-\sum_zq(z)\log_2q(z)H(q)=−∑z​q(z)log2​q(z), q(b)=∑ap(a)w(a,b)q(b)=\sum_ap(a)w(a,b)q(b)=∑a​p(a)w(a,b), and I(p,w)=H(q)−∑ap(a)H(w(a,⋅))I(p,w)=H(q)-\sum_ap(a)H(w(a,\cdot))I(p,w)=H(q)−∑a​p(a)H(w(a,⋅)). There exist k>0k>0k>0 and a natural-number threshold NNN such that for every n≥Nn\ge Nn≥N with n>0n>0n>0, there is a compression code with a positive message count MMM, encoder distributions e(x,m)e(x,m)e(x,m), and decoder distributions d(m,y)d(m,y)d(m,y), for x∈An,y∈Bnx\in A^n,y\in B^nx∈An,y∈Bn, whose output is vc(y∣x)=∑me(x,m)d(m,y)v_c(y\mid x)=\sum_me(x,m)d(m,y)vc​(y∣x)=∑m​e(x,m)d(m,y), satisfying

log⁡2M≤nI(p,w)+kn\log_2M\le nI(p,w)+k\sqrt nlog2​M≤nI(p,w)+kn​

and

∑x∈An(∏jp(xj))1n∑i=0n−112∑b∈B∣w(xi,b)−∑y∈Bnyi=bvc(y∣x)∣≤ε.\sum_{x\in A^n}\left(\prod_jp(x_j)\right)\frac1n \sum_{i=0}^{n-1}\frac12\sum_{b\in B} \left|w(x_i,b)-\sum_{\substack{y\in B^n\\y_i=b}}v_c(y\mid x)\right| \le\varepsilon.x∈An∑​(j∏​p(xj​))n1​i=0∑n−1​21​b∈B∑​​w(xi​,b)−y∈Bnyi​=b​∑​vc​(y∣x)​≤ε.

Thus the stated error is the source average of the mean, over positions, of the total variation distances between the target single-position row and the corresponding output marginal. The decoder may be stochastic, and no shared seed is part of this code. Singleton alphabets and zero probabilities are allowed.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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