Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ordinary compression rate bounded by exact encoder entropy

Open
QAlgorithms.Papers.Independent.Support50.P38.theorem14

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∣. Let M(n,λ)M(n,\lambda)M(n,λ) denote the minimum ordinary visible code alphabet cardinality at PnP^nPn-average block total variation at most λ\lambdaλ. Let S(k)S(k)S(k) be the optimized entropy of the encoder's message under exact reconstruction, and Γ=inf⁡k≥1S(k)/k\Gamma=\inf_{k\ge1}S(k)/kΓ=infk≥1​S(k)/k. For every fixed 0<λ<10<\lambda<10<λ<1,

lim sup⁡n→∞log⁡2M(n,λ)n≤Γ.\limsup_{n\to\infty}\frac{\log_2 M(n,\lambda)}n\le\Gamma.n→∞limsup​nlog2​M(n,λ)​≤Γ.

This is an upper bound through exact encoder entropy, rather than through exact code cardinality.

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 14, PDF p.7: the ordinary fixed-error limsup rate is at most the optimized
exact encoder-entropy rate Gamma. Blocking the argument with arbitrary superletters is
implicit in the source; Gamma is not the minimum exact log-cardinality rate. -/
theorem theorem14 {A B : Type} [Fintype A] [Fintype B] [Nonempty A] [Nonempty B]
    (p : A → ℝ) (w : A → B → ℝ) (hp : IsLaw p) (hw : IsStochastic w)
    (error : ℝ) (he : 0 < error) (he1 : error < 1) :
    Filter.limsup (sizeRate p w error) atTop ≤ exactEntropyRate p w := 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 14
Read-back

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

Let A,BA,BA,B be finite nonempty types, let p:A→Rp:A\to\mathbb Rp:A→R be nonnegative with sum 111, let w:A→B→Rw:A\to B\to\mathbb Rw:A→B→R have nonnegative rows each summing to 111, and fix 0<ε<10<\varepsilon<10<ε<1. At length ℓ\ellℓ, consider codes with a positive message count MMM, encoder distributions e(x,m)e(x,m)e(x,m), decoder distributions d(m,y)d(m,y)d(m,y), and output 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), for x∈Aℓ,y∈Bℓx\in A^\ell,y\in B^\ellx∈Aℓ,y∈Bℓ. Let Mmin⁡(ℓ,ε)M_{\min}(\ell,\varepsilon)Mmin​(ℓ,ε) be the infimum in N\mathbb NN of the sizes of codes satisfying

∑x∈Aℓ(∏ip(xi))12∑y∈Bℓ∣∏iw(xi,yi)−vc(y∣x)∣≤ε.\sum_{x\in A^\ell}\left(\prod_ip(x_i)\right) \frac12\sum_{y\in B^\ell} \left|\prod_iw(x_i,y_i)-v_c(y\mid x)\right|\le\varepsilon.x∈Aℓ∑​(i∏​p(xi​))21​y∈Bℓ∑​​i∏​w(xi​,yi​)−vc​(y∣x)​≤ε.

Let EℓE_\ellEℓ​ be the real infimum of H(rc)H(r_c)H(rc​), where H(r)=−∑mr(m)log⁡2r(m)H(r)=-\sum_mr(m)\log_2r(m)H(r)=−∑m​r(m)log2​r(m) and rc(m)=∑x(∏ip(xi))e(x,m)r_c(m)=\sum_x(\prod_ip(x_i))e(x,m)rc​(m)=∑x​(∏i​p(xi​))e(x,m), over codes exact on every x,yx,yx,y, meaning vc(y∣x)=∏iw(xi,yi)v_c(y\mid x)=\prod_iw(x_i,y_i)vc​(y∣x)=∏i​w(xi​,yi​); put E∗=inf⁡ℓ>0Eℓ/ℓE_*=\inf_{\ell>0}E_\ell/\ellE∗​=infℓ>0​Eℓ​/ℓ. Then the limit superior along natural numbers satisfies

lim sup⁡n→∞log⁡2Mmin⁡(n+1,ε)n+1≤E∗.\limsup_{n\to\infty} \frac{\log_2M_{\min}(n+1,\varepsilon)}{n+1}\le E_*.n→∞limsup​n+1log2​Mmin​(n+1,ε)​≤E∗​.

All lengths in this rate sequence are positive; zero source and channel probabilities and singleton alphabets are included, and exactness in the definition of EℓE_\ellEℓ​ also covers zero-probability input words.

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