Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

One common photon-sharing parameter for block ensembles

Open
QAlgorithms.Papers.Independent.Gap48.P44.pureLoss_common_parameter

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Write gn(x)=(x+1)ln⁡(x+1)−xln⁡xg_n(x)=(x+1)\ln(x+1)-x\ln xgn​(x)=(x+1)ln(x+1)−xlnx and gb(x)=gn(x)/ln⁡2g_b(x)=g_n(x)/\ln2gb​(x)=gn​(x)/ln2 for x≥0x\ge0x≥0, with 0ln⁡0=00\ln0=00ln0=0. Assume Strong Conjecture 2: for every positive number of modes, among normalized states of a given entropy, mixing with independent vacuum minimizes output entropy at the product thermal state of that entropy. Fix n≥1n\ge1n≥1, η∈[1/2,1]\eta\in[1/2,1]η∈[1/2,1], NS≥0N_S\ge0NS​≥0, and any normalized finite ensemble {px,ρx}\{p_x,\rho_x\}{px​,ρx​} of arbitrary, possibly entangled, nnn-mode Fock states. Its unconditional mean total photon number is at most nNSnN_SnNS​. Write ρ=∑xpxρx\rho=\sum_xp_x\rho_xρ=∑x​px​ρx​, HbH_bHb​ for spectral entropy in bits, Nη⊗n\mathcal N_\eta^{\otimes n}Nη⊗n​ for the memoryless vacuum beam-splitter channel, and (Nηc)⊗n(\mathcal N_\eta^c)^{\otimes n}(Nηc​)⊗n for its fixed other-output complement. There exists one λ∈[0,1]\lambda\in[0,1]λ∈[0,1] such that

∑xpxHb(ρx)≤ngb(λNS),Hb(Nη⊗n(ρ))≤ngb(ηNS),∑xpxHb(Nη⊗n(ρx))≤ngb(ηλNS),∑xpxHb((Nηc)⊗n(ρx))≥ngb((1−η)λNS).\begin{aligned}\sum_xp_xH_b(\rho_x)&\le ng_b(\lambda N_S),\\H_b(\mathcal N_\eta^{\otimes n}(\rho))&\le ng_b(\eta N_S),\\\sum_xp_xH_b(\mathcal N_\eta^{\otimes n}(\rho_x))&\le ng_b(\eta\lambda N_S),\\\sum_xp_xH_b((\mathcal N_\eta^c)^{\otimes n}(\rho_x))&\ge ng_b((1-\eta)\lambda N_S).\end{aligned}x∑​px​Hb​(ρx​)Hb​(Nη⊗n​(ρ))x∑​px​Hb​(Nη⊗n​(ρx​))x∑​px​Hb​((Nηc​)⊗n(ρx​))​≤ngb​(λNS​),≤ngb​(ηNS​),≤ngb​(ηλNS​),≥ngb​((1−η)λNS​).​

All weighted entropy sums are formed as extended nonnegative quantities before any conversion to real, so zero-mass labels may have infinite individual entropy. This is the announced four-bound result, rather than the different exponential bounds requested by a consuming paper.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P44
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Gap48.P44

open Filter

open scoped ENNReal Topology

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

open QAlgorithms.Papers.Independent.Information100.P54 (thermalEntropy)

/-- PDF pp.11-12, announced (60)-(63): ONE common lambda for arbitrary
normalized, possibly entangled block states, under Strong Conjecture 2.
No individual entropy finiteness is imposed on zero-probability labels.
The finite unconditional budget is averaged across all n positive uses. Every RHS
has its announced factor n; inconsistent intermediate proof lines are not reused. -/
theorem pureLoss_common_parameter (hconjecture : Fock.StrongConjecture2)
    (n : ℕ) (hn : 0 < n) (eta budget : ℝ)
    (heta0 : (1 / 2 : ℝ) ≤ eta) (heta1 : eta ≤ 1) (hbudget : 0 ≤ budget)
    {X : Type*} [Fintype X] (e : BlockEnsemble X n)
    (henergy : e.energy ≤ ENNReal.ofReal ((n : ℝ) * budget)) :
    ∃ share ∈ Set.Icc (0 : ℝ) 1,
      e.entropyAverage id ≤ ENNReal.ofReal ((n : ℝ) * thermalEntropy (share * budget)) ∧
      blockEntropy (Fock.pureLoss n eta e.average) ≤
        ENNReal.ofReal ((n : ℝ) * thermalEntropy (eta * budget)) ∧
      e.entropyAverage (Fock.pureLoss n eta) ≤
        ENNReal.ofReal ((n : ℝ) * thermalEntropy (eta * share * budget)) ∧
      ENNReal.ofReal ((n : ℝ) * thermalEntropy ((1 - eta) * share * budget)) ≤
        e.entropyAverage (lossComplement n eta) := by sorry

end QAlgorithms.Papers.Independent.Gap48.P44

end
Source
Quantum trade-off coding for bosonic communication, arXiv:1105.0119v4, PDF p. 11, §III G, (60)–(63): one common λ for arbitrary block ensembles
Read-back

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

Write [x]+=max⁡(x,0)[x]_+=\max(x,0)[x]+​=max(x,0), regarded as a nonnegative extended real when necessary, and put 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 and H(x)=G(x)/ln⁡2H(x)=G(x)/\ln2H(x)=G(x)/ln2, with ln⁡0=0\ln0=0ln0=0. The following notation specifies the kernels and entropy appearing in the assertion. For each number of modes mmm, let Im=NmI_m=\mathbb N^mIm​=Nm, including indices with zero coordinates. A density kernel ρ:Im×Im→C\rho:I_m\times I_m\to\mathbb Cρ:Im​×Im​→C means that there exist uj,vj∈ℓ2(Im;C)u_j,v_j\in\ell^2(I_m;\mathbb C)uj​,vj​∈ℓ2(Im​;C) with ∑j∥uj∥∥vj∥<∞\sum_j\|u_j\|\|v_j\|<\infty∑j​∥uj​∥∥vj​∥<∞ and ρab=∑j′uj(a)vj(b)‾\rho_{ab}=\sum'_j u_j(a)\overline{v_j(b)}ρab​=∑j′​uj​(a)vj​(b)​, every finite quadratic form ∑a,b∈Fza‾ρabzb\sum_{a,b\in F}\overline{z_a}\rho_{ab}z_b∑a,b∈F​za​​ρab​zb​ is real and nonnegative, and ∑a′Re⁡ρaa=1\sum'_a\operatorname{Re}\rho_{aa}=1∑a′​Reρaa​=1 with summable real diagonal. Define S(ρ)S(\rho)S(ρ) to be the infimum, in [0,∞][0,\infty][0,∞], of

∑j′[−wjln⁡wj]+\sum'_j[-w_j\ln w_j]_+j∑′​[−wj​lnwj​]+​

over all sequences wj≥0w_j\ge0wj​≥0 and vj∈ℓ2(Im;C)v_j\in\ell^2(I_m;\mathbb C)vj​∈ℓ2(Im​;C) such that ∑jwj=1\sum_jw_j=1∑j​wj​=1 with summable weights, ∥vj∥=1\|v_j\|=1∥vj​∥=1 whenever wj>0w_j>0wj​>0, distinct positive-weight vectors are orthogonal, and ρab=∑j′wjvj(a)vj(b)‾\rho_{ab}=\sum'_jw_jv_j(a)\overline{v_j(b)}ρab​=∑j′​wj​vj​(a)vj​(b)​. Zero-weight vectors need not be normalized or orthogonal, and an empty set of such resolutions gives S(ρ)=+∞S(\rho)=+\inftyS(ρ)=+∞. Put h(ρ)=S(ρ)/ln⁡2h(\rho)=S(\rho)/\ln2h(ρ)=S(ρ)/ln2. Let Vm(a,b)V_m(a,b)Vm​(a,b) be 111 if a=b=0a=b=0a=b=0 and 000 otherwise, and let

Tm,K(a,b)={∏i=1m(K/(K+1))aiK+1,a=b,0,a≠b.T_{m,K}(a,b)= \begin{cases} \displaystyle\prod_{i=1}^m\frac{(K/(K+1))^{a_i}}{K+1},&a=b,\\ 0,&a\ne b. \end{cases}Tm,K​(a,b)=⎩⎨⎧​i=1∏m​K+1(K/(K+1))ai​​,0,​a=b,a=b.​

For real τ\tauτ, define

cτ(r,l;p,q)={r! l!p! q!∑0≤u≤pu≤r, r−u≤q(pu)(qr−u)(τ)u(1−τ)p−u+(r−u)(−τ)q−(r−u),r+l=p+q,0,r+l≠p+q,c_\tau(r,l;p,q)= \begin{cases} \displaystyle \sqrt{\frac{r!\,l!}{p!\,q!}} \sum_{\substack{0\le u\le p\\u\le r,\ r-u\le q}} \binom pu\binom q{r-u} (\sqrt\tau)^u (\sqrt{1-\tau})^{p-u+(r-u)} (-\sqrt\tau)^{q-(r-u)},&r+l=p+q,\\ 0,&r+l\ne p+q, \end{cases}cτ​(r,l;p,q)=⎩⎨⎧​p!q!r!l!​​0≤u≤pu≤r, r−u≤q​∑​(up​)(r−uq​)(τ​)u(1−τ​)p−u+(r−u)(−τ​)q−(r−u),0,​r+l=p+q,r+l=p+q,​

where natural-number subtraction truncates at zero and powers with exponent zero equal 111. For pairs a=(a(1),a(2))a=(a^{(1)},a^{(2)})a=(a(1),a(2)) and b=(b(1),b(2))b=(b^{(1)},b^{(2)})b=(b(1),b(2)) in Im2I_m^2Im2​, set

Bτ(a,b)=∏i=1mcτ(ai(1),ai(2);bi(1),bi(2)),Jτ(X,Y)u,v=∑a′∑b′Bτ(u,a)Xa(1),b(1)Ya(2),b(2)Bτ(v,b)‾,Mτ(X,Y)a,b=∑e′Jτ(X,Y)(a,e),(b,e),Pτ(X)=Mτ(X,Vm),Lτ(X)a,b=(−1)∑iai(∑e′Jτ(X,Vm)(e,a),(e,b))(−1)∑ibi.\begin{aligned} B_\tau(a,b)&=\prod_{i=1}^m c_\tau(a_i^{(1)},a_i^{(2)};b_i^{(1)},b_i^{(2)}),\\ J_\tau(X,Y)_{u,v} &=\sum'_a\sum'_b B_\tau(u,a)X_{a^{(1)},b^{(1)}}Y_{a^{(2)},b^{(2)}} \overline{B_\tau(v,b)},\\ M_\tau(X,Y)_{a,b}&=\sum'_eJ_\tau(X,Y)_{(a,e),(b,e)},\\ P_\tau(X)&=M_\tau(X,V_m),\\ L_\tau(X)_{a,b} &=(-1)^{\sum_i a_i} \left(\sum'_eJ_\tau(X,V_m)_{(e,a),(e,b)}\right) (-1)^{\sum_i b_i}. \end{aligned}Bτ​(a,b)Jτ​(X,Y)u,v​Mτ​(X,Y)a,b​Pτ​(X)Lτ​(X)a,b​​=i=1∏m​cτ​(ai(1)​,ai(2)​;bi(1)​,bi(2)​),=a∑′​b∑′​Bτ​(u,a)Xa(1),b(1)​Ya(2),b(2)​Bτ​(v,b)​,=e∑′​Jτ​(X,Y)(a,e),(b,e)​,=Mτ​(X,Vm​),=(−1)∑i​ai​(e∑′​Jτ​(X,Vm​)(e,a),(e,b)​)(−1)∑i​bi​.​

The complex infinite sums here are the total sums in the declaration, which take value zero when the corresponding family is not summable. Assume the following universal hypothesis: for every integer m>0m>0m>0, every τ∈[0,1]\tau\in[0,1]τ∈[0,1], and every K≥0K\ge0K≥0,

S(Tm,K)=[mG(K)]+,S(Mτ(Vm,Tm,K))=[mG((1−τ)K)]+,S(T_{m,K})=[mG(K)]_+,\qquad S(M_\tau(V_m,T_{m,K}))=[mG((1-\tau)K)]_+,S(Tm,K​)=[mG(K)]+​,S(Mτ​(Vm​,Tm,K​))=[mG((1−τ)K)]+​,

and every density kernel ρ\rhoρ with S(ρ)=[mG(K)]+S(\rho)=[mG(K)]_+S(ρ)=[mG(K)]+​ satisfies [mG((1−τ)K)]+≤S(Mτ(Vm,ρ))[mG((1-\tau)K)]_+\le S(M_\tau(V_m,\rho))[mG((1−τ)K)]+​≤S(Mτ​(Vm​,ρ)). Now let n>0n>0n>0 be a natural number, let 12≤η≤1\tfrac12\le\eta\le121​≤η≤1 and B≥0B\ge0B≥0 be real, and let XXX be any finite type equipped with a probability mass function (px)x∈X(p_x)_{x\in X}(px​)x∈X​ and a density kernel ρx\rho_xρx​ on InI_nIn​ for every xxx, including labels of probability zero. Write

ρˉab=∑x∈Xpxρx,ab,E=∑x∈Xpx∑i=1n∑a′[aiRe⁡ρx,aa]+,A(C)=∑x∈Xpxh(C(ρx)).\bar\rho_{ab}=\sum_{x\in X}p_x\rho_{x,ab}, \qquad \mathcal E=\sum_{x\in X}p_x\sum_{i=1}^n\sum'_a [a_i\operatorname{Re}\rho_{x,aa}]_+, \qquad A(C)=\sum_{x\in X}p_xh(C(\rho_x)).ρˉ​ab​=x∈X∑​px​ρx,ab​,E=x∈X∑​px​i=1∑n​a∑′​[ai​Reρx,aa​]+​,A(C)=x∈X∑​px​h(C(ρx​)).

If E≤[nB]+\mathcal E\le[nB]_+E≤[nB]+​, there exists one common s∈[0,1]s\in[0,1]s∈[0,1] such that

A(id)≤[nH(sB)]+,h(Pη(ρˉ))≤[nH(ηB)]+,A(Pη)≤[nH(ηsB)]+,[nH((1−η)sB)]+≤A(Lη).\begin{aligned} A(\mathrm{id})&\le[nH(sB)]_+,\\ h(P_\eta(\bar\rho))&\le[nH(\eta B)]_+,\\ A(P_\eta)&\le[nH(\eta sB)]_+,\\ [nH((1-\eta)sB)]_+&\le A(L_\eta). \end{aligned}A(id)h(Pη​(ρˉ​))A(Pη​)[nH((1−η)sB)]+​​≤[nH(sB)]+​,≤[nH(ηB)]+​,≤[nH(ηsB)]+​,≤A(Lη​).​

All four inequalities are in [0,∞][0,\infty][0,∞] and use extended-real arithmetic; the hypotheses include η=1\eta=1η=1 and B=0B=0B=0, and the witness may be s=0s=0s=0 or s=1s=1s=1. The probability mass function requires the finite label type to be nonempty.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 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