Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Weak converse with independent shared randomness

Open
QAlgorithms.Papers.Independent.Support50.P38.commonRandomness_lowerBound

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 pair of alphabets there is a single function f~:(0,1)→R\widetilde f:(0,1)\to\mathbb Rf​:(0,1)→R, uniform over all normalized source laws PPP and stochastic channels WWW on those alphabets, with f~(λ)→0\widetilde f(\lambda)\to0f​(λ)→0 as λ↓0\lambda\downarrow0λ↓0, such that every positive blocklength, every 0<λ<10<\lambda<10<λ<1, and every visible code with an independent shared seed of arbitrary law and seed-averaged block error at most λ\lambdaλ satisfy

log⁡2∣C∣≥n(I−f~(λ)).\log_2|C|\ge n\bigl(I-\widetilde f(\lambda)\bigr).log2​∣C∣≥n(I−f​(λ)).

This preserves the weak information lower bound when common randomness is allowed, without assigning the correction function an unsupported formula.

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

/-- PDF pp.2–4: the weak converse still holds for arbitrary independent shared seed laws.
The vanishing correction f-tilde is uniform over source laws and channels on the fixed
alphabets, as in the entropy-continuity bound f to which the source refers. -/
theorem commonRandomness_lowerBound {A B : Type} [Fintype A] [Fintype B]
    [Nonempty A] [Nonempty B] :
    ∃ f : ℝ → ℝ, Tendsto f (nhdsWithin 0 (Set.Ioi 0)) (nhds 0) ∧
      ∀ (p : A → ℝ) (w : A → B → ℝ), IsLaw p → IsStochastic w →
        ∀ error : ℝ, 0 < error → error < 1 → ∀ n : ℕ, 0 < n →
          ∀ c : SharedCode A B n, sourceAverageBlockError p w c.output ≤ error →
            n * (sourceInformationBits p w - f error) ≤ Real.logb 2 (c.size : ℝ) := 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, Unnumbered extension of Theorem 2
Read-back

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

For any finite, nonempty sets AAA and BBB, there exists a function f:R→Rf:\mathbb R\to\mathbb Rf:R→R, with lim⁡ε→0+f(ε)=0\lim_{\varepsilon\to0^+}f(\varepsilon)=0limε→0+​f(ε)=0, having the following property. Let p:A→Rp:A\to\mathbb Rp:A→R satisfy p(a)≥0p(a)\ge0p(a)≥0 and ∑ap(a)=1\sum_a p(a)=1∑a​p(a)=1, and let w:A→B→Rw:A\to B\to\mathbb Rw:A→B→R satisfy w(a,b)≥0w(a,b)\ge0w(a,b)≥0 and ∑bw(a,b)=1\sum_b w(a,b)=1∑b​w(a,b)=1 for every aaa. For every 0<ε<10<\varepsilon<10<ε<1, every positive integer nnn, and every shared code consisting of positive integers M,SM,SM,S, seed weights rs≥0r_s\ge0rs​≥0 with ∑srs=1\sum_s r_s=1∑s​rs​=1, encoder probabilities es(x,m)≥0e_s(x,m)\ge0es​(x,m)≥0 with ∑m=1Mes(x,m)=1\sum_{m=1}^M e_s(x,m)=1∑m=1M​es​(x,m)=1 for every seed sss and word x∈Anx\in A^nx∈An, and decoder probabilities ds(m,y)≥0d_s(m,y)\ge0ds​(m,y)≥0 with ∑y∈Bnds(m,y)=1\sum_{y\in B^n}d_s(m,y)=1∑y∈Bn​ds​(m,y)=1 for every s,ms,ms,m, define its output by vx(y)=∑s=1Srs∑m=1Mes(x,m)ds(m,y)v_x(y)=\sum_{s=1}^S r_s\sum_{m=1}^M e_s(x,m)d_s(m,y)vx​(y)=∑s=1S​rs​∑m=1M​es​(x,m)ds​(m,y). If its source averaged block error satisfies ∑x∈An(∏i=1np(xi)) 12∑y∈Bn∣∏i=1nw(xi,yi)−vx(y)∣≤ε\sum_{x\in A^n}(\prod_{i=1}^n p(x_i))\,\frac12\sum_{y\in B^n}|\prod_{i=1}^n w(x_i,y_i)-v_x(y)|\le\varepsilon∑x∈An​(∏i=1n​p(xi​))21​∑y∈Bn​∣∏i=1n​w(xi​,yi​)−vx​(y)∣≤ε, then

n[H(q)−∑a∈Ap(a)H(w(a,⋅))−f(ε)]≤log⁡2M,n\left[H(q)-\sum_{a\in A}p(a)H(w(a,\cdot))-f(\varepsilon)\right]\le\log_2 M,n[H(q)−a∈A∑​p(a)H(w(a,⋅))−f(ε)]≤log2​M,

where q(b)=∑ap(a)w(a,b)q(b)=\sum_a p(a)w(a,b)q(b)=∑a​p(a)w(a,b) and H(u)=−∑zu(z)log⁡2u(z)H(u)=-\sum_z u(z)\log_2 u(z)H(u)=−∑z​u(z)log2​u(z), with zero probability terms interpreted as zero. The same function fff works for all these distributions, errors, lengths, and codes for the given A,BA,BA,B; no sign condition on fff, uniformity condition on the seed distribution, or bound on the number of seeds is assumed.

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