Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two resource lower bounds for passive-feedback simulation

Open
QAlgorithms.Papers.Independent.Support50.P38.theorem11

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∣. Fix 0<λ<10<\lambda<10<λ<1. There are K>0,n0K>0,n_0K>0,n0​, depending only on the fixed source and error, such that for every n≥n0n\ge n_0n≥n0​, n≥1n\ge1n≥1, and every code of block error at most λ\lambdaλ whose independent seed has an arbitrary law on NNN values and whose output word is determined by seed and message, both bounds hold for that same code:

log⁡2∣C∣≥nI−Kn,log⁡2(N∣C∣)≥nH(PW)−Kn.\log_2|C|\ge nI-K\sqrt n,\qquad \log_2(N|C|)\ge nH(PW)-K\sqrt n.log2​∣C∣≥nI−Kn​,log2​(N∣C∣)≥nH(PW)−Kn​.

The second bound constrains combined resources, and becomes a lower bound on randomness alone only after fixing the communication rate.

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 11, PDF pp.5–6: both lower bounds hold for the SAME feedback code, even
for nonuniform independent seed laws. The positive exponential signs are those in the
printed theorem; the opposite sign in the final proof line on p.6 is a source typo. -/
theorem theorem11 {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 : SharedCode A B n, c.PassiveFeedback → sourceAverageBlockError p w c.output ≤ error →
        n * sourceInformationBits p w - k * Real.sqrt n ≤ Real.logb 2 (c.size : ℝ) ∧
        n * shannon (sourceOutputMarginal p w) - k * Real.sqrt n ≤
          Real.logb 2 ((c.seeds : ℝ) * 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. 5, Theorem 11
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 a nonnegative distribution of total mass 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. Define 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, the following holds for every shared code with positive message and seed counts M,SM,SM,S, any seed distribution r(s)≥0r(s)\ge0r(s)≥0 of total mass 111, encoder distributions es(x,m)e_s(x,m)es​(x,m), and decoder distributions ds(m,y)d_s(m,y)ds​(m,y): if there are words os,m∈Bno_{s,m}\in B^nos,m​∈Bn with ds(m,y)=1{y=os,m}d_s(m,y)=\mathbf1_{\{y=o_{s,m}\}}ds​(m,y)=1{y=os,m​}​, and its output vc(y∣x)=∑sr(s)∑mes(x,m)ds(m,y)v_c(y\mid x)=\sum_sr(s)\sum_me_s(x,m)d_s(m,y)vc​(y∣x)=∑s​r(s)∑m​es​(x,m)ds​(m,y) satisfies

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

then both

nI(p,w)−kn≤log⁡2M,nH(q)−kn≤log⁡2(SM).nI(p,w)-k\sqrt n\le\log_2M,\qquad nH(q)-k\sqrt n\le\log_2(SM).nI(p,w)−kn​≤log2​M,nH(q)−kn​≤log2​(SM).

The seed law need not be uniform and may assign zero mass to some seeds; the second inequality uses the number of seeds, not their entropy. The constants may depend on the fixed ε,p,w\varepsilon,p,wε,p,w, and singleton alphabets and vanishing probabilities 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