Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma A.2: conditional classical additive-noise bounds and gap

Open
QAlgorithms.Papers.Independent.Intakenext100.P62.conditionalClassicalNoiseCapacity

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All capacities below are unassisted operational capacities: finite message codes may use arbitrary mixed signal states entangled across channel uses and arbitrary collective output POVMs. The uniform-message average decoding error vanishes at all sufficiently large blocklengths. The constraint is ensemble-average total input photon number at most nNnNnN for nnn uses. Write g(x)=(x+1)ln⁡(x+1)−xln⁡xg(x)=(x+1)\ln(x+1)-x\ln xg(x)=(x+1)ln(x+1)−xlnx, with 0ln⁡0=00\ln0=00ln0=0, and use nats unless bits are specified.

Assume the universal general quantum EPI for all positive mode counts, arbitrary independent states and all transmissivities, with nats entropy. For all finite photon increments u≥0 u\ge0u≥0 and budgets N≥0N\ge0N≥0, let Eu\mathcal E_ uEu​ be circular Gaussian displacement noise adding mean photon number u uu, and the identity when u=0 u=0u=0. Set L=g(N+u)−g(u)L=g(N+ u)-g( u)L=g(N+u)−g(u) and U=g(N+u)−ln⁡(1+eu)U=g(N+ u)-\ln(1+e u)U=g(N+u)−ln(1+eu). Then

L≤C(Eu,N)≤U,U−L≤0.11,U−Lln⁡2≤0.16.L\le C(\mathcal E_ u,N)\le U,\qquad U-L\le0.11,\qquad\frac{U-L}{\ln2}\le0.16.L≤C(Eu​,N)≤U,U−L≤0.11,ln2U−L​≤0.16.

The two decimal bounds are in nats and bits respectively. Here eue ueu means the product e⋅ue\cdot ue⋅u. This is the full conditional capacity sandwich and uniform gap of Lemma A.2.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P62
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P62

open scoped ENNReal BigOperators

open QAlgorithms.Papers.Independent.Dependency50.P33 (State productCoeff)

open QAlgorithms.Papers.Independent.Frontier18.P07 (extendedEntropyNats)

open QAlgorithms.Papers.Independent.Claimed50.P19 (FockIndex)

open QAlgorithms.Papers.Independent.Claimed50.P39 (g displacementNoiseChannel)

open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)

open QAlgorithms.Papers.Independent.Gap48.P26 (weightedPhotonExpectation)

open QAlgorithms.Papers.Independent.Bridge50.P28
  (classicalPhotonCapacityBits thermalNoiseChannelKernel coherentSignalRateBits)

open QAlgorithms.Papers.Independent.Next46.P17
  (beamSplitter bosonicEntropyPower diffusionChannel TotalFisherRegular totalFisher)

/-- PDF p.9, Lemma A.2, (A15)–(A16): conditional classical Gaussian-noise
capacity sandwich and both uniform numerical gap bounds. The logarithm contains
1+e*nu, not 1+exp(nu). Noise nu is the finite photon increment; nu=0 is included.
The numerical differences are upper-minus-lower, in nats and bits respectively. -/
theorem conditionalClassicalNoiseCapacity (hEPI : GeneralQuantumEPI)
    (nu N : ℝ) (hnu : 0 ≤ nu) (hN : 0 ≤ N) :
    ENNReal.ofReal (g (N + nu) - g nu) ≤
      photonCapacityNats (classicalNoiseKernel nu) N ∧
    photonCapacityNats (classicalNoiseKernel nu) N ≤
      ENNReal.ofReal (g (N + nu) - Real.log (1 + Real.exp 1 * nu)) ∧
    (g (N + nu) - Real.log (1 + Real.exp 1 * nu)) -
      (g (N + nu) - g nu) ≤ (11 / 100 : ℝ) ∧
    ((g (N + nu) - Real.log (1 + Real.exp 1 * nu)) -
      (g (N + nu) - g nu)) / Real.log 2 ≤ (16 / 100 : ℝ) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P62

end
Source
Limits on classical communication from quantum entropy power inequalities, arXiv:1205.3407v2, PDF p. 9, Lemma A.2: conditional classical additive-noise bounds and gap
Read-back

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

Assume that, for every positive integer rrr, every θ∈[0,1]\theta\in[0,1]θ∈[0,1], and every pair of states X,YX,YX,Y on Lr=NrL_r=\mathbb N^rLr​=Nr,

[θ]+Pr(S(X))+[1−θ]+Pr(S(Y))≤Pr(S(Bθ(X,Y))).[\theta]_+P_r(S(X))+[1-\theta]_+P_r(S(Y)) \le P_r(S(\mathcal B_\theta(X,Y))).[θ]+​Pr​(S(X))+[1−θ]+​Pr​(S(Y))≤Pr​(S(Bθ​(X,Y))).

For every ν,N≥0\nu,N\ge0ν,N≥0, the declaration then asserts all four inequalities

[g(N+ν)−g(ν)]+≤Cnat(Aν,N)≤[g(N+ν)−log⁡(1+eν)]+,[g(N+\nu)-g(\nu)]_+ \le C_{\mathrm{nat}}(\mathcal A_\nu,N) \le[g(N+\nu)-\log(1+e\nu)]_+,[g(N+ν)−g(ν)]+​≤Cnat​(Aν​,N)≤[g(N+ν)−log(1+eν)]+​, (g(N+ν)−log⁡(1+eν))−(g(N+ν)−g(ν))≤11100,(g(N+ν)−log⁡(1+eν))−(g(N+ν)−g(ν))log⁡2≤16100,\bigl(g(N+\nu)-\log(1+e\nu)\bigr) -\bigl(g(N+\nu)-g(\nu)\bigr) \le\frac{11}{100}, \qquad \frac{ \bigl(g(N+\nu)-\log(1+e\nu)\bigr) -\bigl(g(N+\nu)-g(\nu)\bigr)} {\log2} \le\frac{16}{100},(g(N+ν)−log(1+eν))−(g(N+ν)−g(ν))≤10011​,log2(g(N+ν)−log(1+eν))−(g(N+ν)−g(ν))​≤10016​,

where e=exp⁡(1)e=\exp(1)e=exp(1), g(x)=(x+1)log⁡(x+1)−xlog⁡xg(x)=(x+1)\log(x+1)-x\log xg(x)=(x+1)log(x+1)−xlogx, logarithms are natural, and [x]+=max⁡(x,0)[x]_+=\max(x,0)[x]+​=max(x,0) embedded in the extended nonnegative reals. In the premise, Pr(s)=∞P_r(s)=\inftyPr​(s)=∞ for s=∞s=\inftys=∞ and Pr(s)=exp⁡(s/r)P_r(s)=\exp(s/r)Pr​(s)=exp(s/r) otherwise, while

S(Z)=sup⁡s⊆Lrs finite[Re⁡tr⁡(Zs)log⁡ ⁣(Re⁡tr⁡(Zs))−Re⁡tr⁡ ⁣(Zs log⁡cfcZs)]+,S(Z)= \sup_{\substack{s\subseteq L_r\\s\text{ finite}}} \left[ \operatorname{Re}\operatorname{tr}(Z_s) \log\!\bigl(\operatorname{Re}\operatorname{tr}(Z_s)\bigr) -\operatorname{Re}\operatorname{tr}\!\bigl(Z_s\,\log_{\mathrm{cfc}}Z_s\bigr) \right]_+,S(Z)=s⊆Lr​s finite​sup​[Retr(Zs​)log(Retr(Zs​))−Retr(Zs​logcfc​Zs​)]+​,

using principal restrictions ZsZ_sZs​ and continuous functional calculus for the real logarithm, including the empty restriction. A state on an index set LLL is a complex kernel ZZZ for which there are uj,vj∈ℓ2(L;C)u_j,v_j\in\ell^2(L;\mathbb C)uj​,vj​∈ℓ2(L;C) with ∑j∥uj∥∥vj∥<∞\sum_j\|u_j\|\|v_j\|<\infty∑j​∥uj​∥∥vj​∥<∞ and Zab=∑juj(a)vj(b)‾Z_{ab}=\sum_j u_j(a)\overline{v_j(b)}Zab​=∑j​uj​(a)vj​(b)​, all finite quadratic forms ∑a,b∈sza‾Zabzb\sum_{a,b\in s}\overline{z_a}Z_{ab}z_b∑a,b∈s​za​​Zab​zb​ are real and nonnegative, and the real diagonal is summable with sum 111. The operation in the premise is

Bθ(X,Y)ab=∑e∈Lr∑u∈Lr×Lr∑v∈Lr×Lrbθ(a,e;u) Xu1v1Yu2v2bθ(b,e;v)‾,\mathcal B_\theta(X,Y)_{ab} = \sum_{e\in L_r}\sum_{u\in L_r\times L_r}\sum_{v\in L_r\times L_r} b_\theta(a,e;u)\,X_{u_1v_1}Y_{u_2v_2} \overline{b_\theta(b,e;v)},Bθ​(X,Y)ab​=e∈Lr​∑​u∈Lr​×Lr​∑​v∈Lr​×Lr​∑​bθ​(a,e;u)Xu1​v1​​Yu2​v2​​bθ​(b,e;v)​,

where bθ(a,e;u)=∏j=1rbθ(aj,ej;u1,j,u2,j)b_\theta(a,e;u)=\prod_{j=1}^r b_\theta(a_j,e_j;u_{1,j},u_{2,j})bθ​(a,e;u)=∏j=1r​bθ​(aj​,ej​;u1,j​,u2,j​) and

bθ(a,e;p,q)={a!e!p!q!∑k=0p∑ℓ=0q1k+ℓ=a(pk)(qℓ)(θ)k(1−θ)p−k(1−θ)ℓ(−θ)q−ℓ,a+e=p+q,0,a+e≠p+q.b_\theta(a,e;p,q)= \begin{cases} \displaystyle \sqrt{\frac{a!e!}{p!q!}} \sum_{k=0}^{p}\sum_{\ell=0}^{q} \mathbf1_{k+\ell=a} \binom pk\binom q\ell (\sqrt\theta)^k(\sqrt{1-\theta})^{p-k} (\sqrt{1-\theta})^\ell(-\sqrt\theta)^{q-\ell}, &a+e=p+q,\\ 0,&a+e\ne p+q. \end{cases}bθ​(a,e;p,q)=⎩⎨⎧​p!q!a!e!​​k=0∑p​ℓ=0∑q​1k+ℓ=a​(kp​)(ℓq​)(θ​)k(1−θ​)p−k(1−θ​)ℓ(−θ​)q−ℓ,0,​a+e=p+q,a+e=p+q.​

To define Aν\mathcal A_\nuAν​, let Z^\widehat ZZ be a chosen bounded complex-linear operator on ℓ2(N;C)\ell^2(\mathbb N;\mathbb C)ℓ2(N;C) with matrix ZZZ, if one exists, and zero otherwise, and let mat⁡(A)ab=(Aeb)a\operatorname{mat}(A)_{ab}=(Ae_b)_amat(A)ab​=(Aeb​)a​ for standard basis vectors ebe_beb​. Define the displacement operator D(z)=d(z)^D(z)=\widehat{d(z)}D(z)=d(z)​, where

d(z)ab=e−∣z∣2/2a!b!∑h=0min⁡(a,b)za−h(−z‾)b−hh!(a−h)!(b−h)!.d(z)_{ab} = e^{-|z|^2/2}\sqrt{a!b!} \sum_{h=0}^{\min(a,b)} \frac{z^{a-h}(-\overline z)^{b-h}} {h!(a-h)!(b-h)!}.d(z)ab​=e−∣z∣2/2a!b!​h=0∑min(a,b)​h!(a−h)!(b−h)!za−h(−z)b−h​.

Then A0(Z)=mat⁡(Z^)\mathcal A_0(Z)=\operatorname{mat}(\widehat Z)A0​(Z)=mat(Z); for ν>0\nu>0ν>0,

Aν(Z)=mat⁡(J^),Jab=∫Ce−∣z∣2/νπν(D(z)Z^D(z)∗eb)a dz,\mathcal A_\nu(Z)=\operatorname{mat}(\widehat{J}), \qquad J_{ab}= \int_{\mathbb C} \frac{e^{-|z|^2/\nu}}{\pi\nu} \bigl(D(z)\widehat ZD(z)^*e_b\bigr)_a\,dz,Aν​(Z)=mat(J),Jab​=∫C​πνe−∣z∣2/ν​(D(z)ZD(z)∗eb​)a​dz,

with planar Lebesgue measure. The capacity Cnat(T,N)C_{\mathrm{nat}}(T,N)Cnat​(T,N) is (log⁡2)(\log2)(log2) times the extended nonnegative supremum of all rates R≥0R\ge0R≥0 such that, for every ϵ,δ>0\epsilon,\delta>0ϵ,δ>0, there is a positive integer n0n_0n0​ for which every n≥n0n\ge n_0n≥n0​ admits a positive integer MMM, states ρm\rho_mρm​ on Nn\mathbb N^nNn, and bounded operators FmF_mFm​ on ℓ2(Nn;C)\ell^2(\mathbb N^n;\mathbb C)ℓ2(Nn;C) with real nonnegative quadratic forms and ∑mFm=I\sum_mF_m=I∑m​Fm​=I, satisfying

∑a∈Nn[(∑j=1naj)Re⁡ρˉaa]+≤[nN]+,ρˉ=1M∑m=1Mρm,\sum_{a\in\mathbb N^n} \left[\left(\sum_{j=1}^n a_j\right) \operatorname{Re}\bar\rho_{aa}\right]_+ \le[nN]_+,\qquad \bar\rho=\frac1M\sum_{m=1}^M\rho_m,a∈Nn∑​[(j=1∑n​aj​)Reρˉ​aa​]+​≤[nN]+​,ρˉ​=M1​m=1∑M​ρm​, 1−ϵ≤1M∑m=1MRe⁡(∑a∑b(T[n]ρm)ab(Fmea)b),R−δ≤log⁡Mnlog⁡2.1-\epsilon\le \frac1M\sum_{m=1}^M \operatorname{Re}\left( \sum_a\sum_b (T^{[n]}\rho_m)_{ab}(F_me_a)_b \right), \qquad R-\delta\le\frac{\log M}{n\log2}.1−ϵ≤M1​m=1∑M​Re(a∑​b∑​(T[n]ρm​)ab​(Fm​ea​)b​),R−δ≤nlog2logM​.

The coordinatewise power T[n]T^{[n]}T[n] leaves the scalar kernel on N0\mathbb N^0N0 unchanged at power zero and is recursively specified by

(T[n+1]Z)(a0,a′),(b0,b′)=(T[n]Za0,b0)a′b′,Zsta0,b0=[T((Z(i,s),(j,t))ij)]a0b0.(T^{[n+1]}Z)_{(a_0,a'),(b_0,b')} = \bigl(T^{[n]}Z^{a_0,b_0}\bigr)_{a'b'}, \qquad Z^{a_0,b_0}_{st} = \left[T\bigl((Z_{(i,s),(j,t)})_{ij}\bigr)\right]_{a_0b_0}.(T[n+1]Z)(a0​,a′),(b0​,b′)​=(T[n]Za0​,b0​)a′b′​,Zsta0​,b0​​=[T((Z(i,s),(j,t)​)ij​)]a0​b0​​.

Consequently, both the input-energy constraint and decoding success in this definition are averages over the MMM messages. The entropy-power hypothesis ranges over all positive numbers of modes and all states, without energy or finite-entropy hypotheses, includes θ=0,1\theta=0,1θ=0,1, and uses extended arithmetic with 0⋅∞=00\cdot\infty=00⋅∞=0. The conclusion includes ν=0\nu=0ν=0 and N=0N=0N=0; its two numerical gap bounds are inequalities between real expressions without truncation, whereas the capacity bounds use positive parts. All infinite sums and integrals are those of the total definitions, the bounded-operator constructions retain their zero fallback, and log⁡0=0\log0=0log0=0.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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