Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Classical fixed-error strong converse

Open
QAlgorithms.Papers.Independent.Support50.P38.theorem3

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,λ) be the minimum message alphabet cardinality of an ordinary visible stochastic encoder and decoder, with independent private randomness and PnP^nPn-average block total variation at most λ\lambdaλ. For every fixed 0<λ<10<\lambda<10<λ<1,

lim inf⁡n→∞log⁡2M(n,λ)n≥I.\liminf_{n\to\infty}\frac{\log_2 M(n,\lambda)}n\ge I.n→∞liminf​nlog2​M(n,λ)​≥I.

This is a strong converse lower bound; it does not assert achievability or existence of a limit.

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 3, PDF p.3: fixed-error strong converse without common randomness.
The liminf is retained; no equality or existence of a limit is asserted. -/
theorem theorem3 {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) :
    sourceInformationBits p w ≤ Filter.liminf (sizeRate p w error) atTop := 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. 3, Theorem 3
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 ∑ap(a)=1\sum_ap(a)=1∑a​p(a)=1, let w:A→B→Rw:A\to B\to\mathbb Rw:A→B→R have nonnegative rows each summing to 111, and let 0<ε<10<\varepsilon<10<ε<1. Write H(q)=−∑bq(b)log⁡2q(b)H(q)=-\sum_bq(b)\log_2q(b)H(q)=−∑b​q(b)log2​q(b), 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))I(p,w)=H(q)−∑a​p(a)H(w(a)). For each positive block length ℓ\ellℓ, let Mℓ(ε)M_\ell(\varepsilon)Mℓ​(ε) be the least positive message count MMM admitting stochastic encoders e(m∣x)e(m\mid x)e(m∣x) and stochastic decoders d(y∣m)d(y\mid m)d(y∣m), with x∈Aℓ,y∈Bℓx\in A^\ell,y\in B^\ellx∈Aℓ,y∈Bℓ, such that

∑x∈Aℓ(∏ip(xi))12∑y∈Bℓ∣∏iw(xi)(yi)−∑m=0M−1e(m∣x)d(y∣m)∣≤ε.\sum_{x\in A^\ell}\left(\prod_i p(x_i)\right) \frac12\sum_{y\in B^\ell} \left|\prod_iw(x_i)(y_i)-\sum_{m=0}^{M-1}e(m\mid x)d(y\mid m)\right| \le\varepsilon.x∈Aℓ∑​(i∏​p(xi​))21​y∈Bℓ∑​​i∏​w(xi​)(yi​)−m=0∑M−1​e(m∣x)d(y∣m)​≤ε.

The assertion is

I(p,w)≤lim inf⁡n→∞log⁡2Mn+1(ε)n+1.I(p,w)\le \liminf_{n\to\infty}\frac{\log_2 M_{n+1}(\varepsilon)}{n+1}.I(p,w)≤n→∞liminf​n+1log2​Mn+1​(ε)​.

The minimum is formally the natural-number infimum, which returns 000 if its defining set is empty, and the total real logarithm satisfies log⁡20=0\log_2 0=0log2​0=0; under the stated hypotheses an exact code can be obtained by transmitting the input word, so the defining sets are nonempty. Zero entries of ppp and www are permitted.

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