Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Conditional attained thermal coherent-information maximum

Open
QAlgorithms.Papers.Independent.Support50.P06.singleLetter_thermalOptimizer

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

prove2quantum

Assume global minimum output entropy conjecture 2. Let 1/2<η≤11/2<\eta\le11/2<η≤1 and Nˉ≥0\bar N\ge0Nˉ≥0 be finite. For arbitrary normalized single-mode input states with mean photons at most Nˉ\bar NNˉ, define Ic(ρ)=S(Lη(ρ))−S(Eη(ρ))I_c(\rho)=S(\mathcal L_\eta(\rho))-S(\mathcal E_\eta(\rho))Ic​(ρ)=S(Lη​(ρ))−S(Eη​(ρ)) using the two marginals of the fixed vacuum dilation. Entropies are in nats. Then

Cp(η,Nˉ)=Q(1)(η,Nˉ)=max⁡Tr⁡(ρn^)≤NˉIc(ρ)=g(ηNˉ)−g((1−η)Nˉ).C_p(\eta,\bar N)=Q^{(1)}(\eta,\bar N)=\max_{\operatorname{Tr}(\rho\hat n)\le\bar N} I_c(\rho)=g(\eta\bar N)-g((1-\eta)\bar N).Cp​(η,Nˉ)=Q(1)(η,Nˉ)=Tr(ρn^)≤Nˉmax​Ic​(ρ)=g(ηNˉ)−g((1−η)Nˉ).

Both receiver entropies are finite for every feasible input. The normalized thermal input of mean exactly Nˉ\bar NNˉ attains this maximum, Bob's output is thermal of mean ηNˉ\eta\bar NηNˉ, and the input is the isotropic Gaussian coherent mixture of variance Nˉ\bar NNˉ (vacuum at zero). The optimization has no Gaussian restriction.

This identifies Q(1)Q^{(1)}Q(1) as a constrained coherent-information optimization; it does not define an operational quantum transmission capacity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P06
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P06

open MeasureTheory Filter

open scoped ENNReal BigOperators Topology

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsDensity rankOne)

open QAlgorithms.Papers.Independent.Next46.P32
  (NumberString FockKernel identicalThermalKernel vacuum productCoherentKernel
   jointMix bobMarginal charlieMarginal pureLoss broadcast mixedOutput
   spectralEntropyNats FockPOVM realFockTracePair modeEnergy complexNormal
   StrongConjecture2)

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

open QAlgorithms.Papers.Independent.Claimed50.P11 (thermalEntropyInverse)

attribute [local instance] Classical.propDecidable Classical.decEq

/-- PDF p.3, (12): attained, unrestricted coherent-information optimum under
mean photons <=Nbar, conditional on global MOE2. Printed Gaussian variance K
reuses Bob's entropy variable; changed to Alice variance Nbar as fixed by (10)
and the theorem's own prior. Bob's thermal mean is eta*Nbar, not K. Finite
receiver entropy is concluded for every feasible input; it is not assumed. -/
theorem singleLetter_thermalOptimizer (hmoe : StrongConjecture2)
    (eta Nbar : ℝ) (heta : 1 / 2 < eta) (heta_one : eta ≤ 1) (hNbar : 0 ≤ Nbar) :
    coherentInformationMaximum 1 eta Nbar =
      ((g (eta * Nbar) - g ((1 - eta) * Nbar) : ℝ) : EReal) ∧
    holevoMessagePrivacyCapacityNats 1 eta Nbar = ENNReal.ofReal (g (eta * Nbar) - g ((1 - eta) * Nbar)) ∧
    IsDensity (identicalThermalKernel 1 Nbar) ∧
    totalEnergy (identicalThermalKernel 1 Nbar) = ENNReal.ofReal Nbar ∧
    pureLoss 1 eta (identicalThermalKernel 1 Nbar) = identicalThermalKernel 1 (eta * Nbar) ∧
    coherentMixture Nbar = identicalThermalKernel 1 Nbar ∧
    vacuumLossCoherentInformationNats eta (identicalThermalKernel 1 Nbar) =
      g (eta * Nbar) - g ((1 - eta) * Nbar) ∧
    (∀ rho : State (NumberString 1), totalEnergy rho.coefficients ≤ ENNReal.ofReal Nbar →
      spectralEntropyNats (pureLoss 1 eta rho.coefficients) ≠ ⊤ ∧
      spectralEntropyNats ((charlieMarginal (broadcast 1 eta rho.coefficients))) ≠ ⊤ ∧
      vacuumLossCoherentInformationNats eta rho.coefficients ≤ g (eta * Nbar) - g ((1 - eta) * Nbar)) := by sorry

end QAlgorithms.Papers.Independent.Support50.P06

end
Source
Capacity of the Bosonic Wiretap Channel and the Entropy Photon-Number Inequality, arXiv:0801.0841v1, PDF p. 3, §III, (12): conditional attained coherent-information maximum
Read-back

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

Assume that, for every positive integer rrr, every 0≤t≤10\le t\le10≤t≤1, and every K≥0K\ge0K≥0, the kernels

Tr(K)ab=1a=b∏i=0r−1(K/(K+1))aiK+1,Vrab=1a=0, b=0T_r(K)_{ab}=\mathbf1_{a=b}\prod_{i=0}^{r-1}\frac{(K/(K+1))^{a_i}}{K+1}, \qquad V_r{}_{ab}=\mathbf1_{a=0,\ b=0}Tr​(K)ab​=1a=b​i=0∏r−1​K+1(K/(K+1))ai​​,Vr​ab​=1a=0, b=0​

satisfy S(Tr(K))=ofReal⁡(rg(K))S(T_r(K))=\operatorname{ofReal}(r g(K))S(Tr​(K))=ofReal(rg(K)) and S(Mt(Vr,Tr(K)))=ofReal⁡(rg((1−t)K))S(M_t(V_r,T_r(K)))=\operatorname{ofReal}(r g((1-t)K))S(Mt​(Vr​,Tr​(K)))=ofReal(rg((1−t)K)), and every density kernel XXX with S(X)=ofReal⁡(rg(K))S(X)=\operatorname{ofReal}(r g(K))S(X)=ofReal(rg(K)) satisfies ofReal⁡(rg((1−t)K))≤S(Mt(Vr,X))\operatorname{ofReal}(r g((1-t)K))\le S(M_t(V_r,X))ofReal(rg((1−t)K))≤S(Mt​(Vr​,X)). Here 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 and ofReal⁡(x)=max⁡(x,0)\operatorname{ofReal}(x)=\max(x,0)ofReal(x)=max(x,0) in the extended nonnegative reals. For any 12<η≤1\tfrac12<\eta\le121​<η≤1 and Nˉ≥0\bar N\ge0Nˉ≥0, put F=g(ηNˉ)−g((1−η)Nˉ)F=g(\eta\bar N)-g((1-\eta)\bar N)F=g(ηNˉ)−g((1−η)Nˉ). The theorem asserts

sup⁡X a one-mode density kernelE(X)≤ofReal⁡(Nˉ)Jη(X)=Fin the extended real numbers,C1=ofReal⁡(F),T1(Nˉ) is a density kernel,E(T1(Nˉ))=ofReal⁡(Nˉ),PηT1(Nˉ)=T1(ηNˉ),C‾Nˉ=T1(Nˉ),Jη(T1(Nˉ))=F.\begin{gathered} \sup_{\substack{X\text{ a one-mode density kernel}\\\mathcal E(X)\le\operatorname{ofReal}(\bar N)}}J_\eta(X)=F \quad\text{in the extended real numbers},\qquad \mathcal C_1=\operatorname{ofReal}(F),\\ T_1(\bar N)\text{ is a density kernel},\qquad \mathcal E(T_1(\bar N))=\operatorname{ofReal}(\bar N),\qquad P_\eta T_1(\bar N)=T_1(\eta\bar N),\\ \overline C_{\bar N}=T_1(\bar N),\qquad J_\eta(T_1(\bar N))=F. \end{gathered}X a one-mode density kernelE(X)≤ofReal(Nˉ)​sup​Jη​(X)=Fin the extended real numbers,C1​=ofReal(F),T1​(Nˉ) is a density kernel,E(T1​(Nˉ))=ofReal(Nˉ),Pη​T1​(Nˉ)=T1​(ηNˉ),CNˉ​=T1​(Nˉ),Jη​(T1​(Nˉ))=F.​

It further asserts that every one-mode density kernel XXX with E(X)≤ofReal⁡(Nˉ)\mathcal E(X)\le\operatorname{ofReal}(\bar N)E(X)≤ofReal(Nˉ) has S(PηX)≠+∞S(P_\eta X)\ne+\inftyS(Pη​X)=+∞, S(EηX)≠+∞S(E_\eta X)\ne+\inftyS(Eη​X)=+∞, and Jη(X)≤FJ_\eta(X)\le FJη​(X)≤F. All the quantities here have the following meanings. A density kernel on Nr\mathbb N^rNr has an expansion Xab=∑juj(a)vj(b)‾X_{ab}=\sum_j u_j(a)\overline{v_j(b)}Xab​=∑j​uj​(a)vj​(b)​ with ∑j∥uj∥∥vj∥<∞\sum_j\|u_j\|\|v_j\|<\infty∑j​∥uj​∥∥vj​∥<∞ and uj,vj∈ℓ2(Nr;C)u_j,v_j\in\ell^2(\mathbb N^r;\mathbb C)uj​,vj​∈ℓ2(Nr;C), has real nonnegative quadratic forms on every finite set of indices, and has summable real diagonal entries with sum 111. The entropy S(X)S(X)S(X) is the infimum of ∑jofReal⁡(−pjlog⁡pj)\sum_j\operatorname{ofReal}(-p_j\log p_j)∑j​ofReal(−pj​logpj​) over expansions Xab=∑jpjuj(a)uj(b)‾X_{ab}=\sum_jp_j u_j(a)\overline{u_j(b)}Xab​=∑j​pj​uj​(a)uj​(b)​, with nonnegative summable weights of sum 111, unit vectors at positive-weight indices, and orthogonality between distinct positive-weight vectors; zero-weight vectors are unrestricted, and no such expansion gives entropy +∞+\infty+∞. The maps are

bt(m,l;p,q)=1m+l=p+qm! l!p! q!∑0≤u≤pu≤m, m−u≤q(pu)(qm−u)(t)u(1−t)p−u+(m−u)(−t)q−(m−u),Bt((a,e),(p,q))=∏ibt(ai,ei;pi,qi),Bt(X,Y)uv=∑a∑bBt(u,a)Xa1b1Ya2b2Bt(v,b)‾,Mt(X,Y)ab=∑eBt(X,Y)(a,e),(b,e),PtX=Mt(X,Vr),(EtX)ab=∑eBt(X,Vr)(e,a),(e,b),E(X)=∑i∑aofReal⁡(aiRe⁡Xaa),Jη(X)=S(PηX)real−S(EηX)real,\begin{aligned} b_t(m,l;p,q) &=\mathbf1_{m+l=p+q}\sqrt{\frac{m!\,l!}{p!\,q!}} \sum_{\substack{0\le u\le p\\u\le m,\ m-u\le q}} \binom pu\binom q{m-u} (\sqrt t)^u(\sqrt{1-t})^{p-u+(m-u)} (-\sqrt t)^{q-(m-u)},\\ B_t((a,e),(p,q))&=\prod_i b_t(a_i,e_i;p_i,q_i),\\ \mathcal B_t(X,Y)_{uv} &=\sum_a\sum_b B_t(u,a)X_{a_1b_1}Y_{a_2b_2}\overline{B_t(v,b)},\\ M_t(X,Y)_{ab}&=\sum_e\mathcal B_t(X,Y)_{(a,e),(b,e)},\qquad P_tX=M_t(X,V_r),\\ (E_tX)_{ab}&=\sum_e\mathcal B_t(X,V_r)_{(e,a),(e,b)},\qquad \mathcal E(X)=\sum_i\sum_a\operatorname{ofReal}(a_i\operatorname{Re}X_{aa}),\\ J_\eta(X)&=S(P_\eta X)^{\mathrm{real}}-S(E_\eta X)^{\mathrm{real}}, \end{aligned}bt​(m,l;p,q)Bt​((a,e),(p,q))Bt​(X,Y)uv​Mt​(X,Y)ab​(Et​X)ab​Jη​(X)​=1m+l=p+q​p!q!m!l!​​0≤u≤pu≤m, m−u≤q​∑​(up​)(m−uq​)(t​)u(1−t​)p−u+(m−u)(−t​)q−(m−u),=i∏​bt​(ai​,ei​;pi​,qi​),=a∑​b∑​Bt​(u,a)Xa1​b1​​Ya2​b2​​Bt​(v,b)​,=e∑​Bt​(X,Y)(a,e),(b,e)​,Pt​X=Mt​(X,Vr​),=e∑​Bt​(X,Vr​)(e,a),(e,b)​,E(X)=i∑​a∑​ofReal(ai​ReXaa​),=S(Pη​X)real−S(Eη​X)real,​

where a,ba,ba,b in the joint-kernel sum range over pairs of number strings, and real conversion sends +∞+\infty+∞ to 000. Also, C‾N=∫Cα dμN(α)\overline C_N=\int C_\alpha\,d\mu_N(\alpha)CN​=∫Cα​dμN​(α) entry by entry, with Cαab=cα(a)cα(b)‾C_\alpha{}_{ab}=c_\alpha(a)\overline{c_\alpha(b)}Cα​ab​=cα​(a)cα​(b)​, cα(j)=e−∣α∣2/2αj/j!c_\alpha(j)=e^{-|\alpha|^2/2}\alpha^j/\sqrt{j!}cα​(j)=e−∣α∣2/2αj/j!​, and μN\mu_NμN​ the point mass at zero for N=0N=0N=0, otherwise the measure with density e−∣α∣2/N/(πN)e^{-|\alpha|^2/N}/(\pi N)e−∣α∣2/N/(πN). To define C1\mathcal C_1C1​, a length-rrr private code has M>0M>0M>0 messages, nonnegative summable randomization weights wkw_kwk​ of sum 111, density kernels XmkX_{mk}Xmk​, and effects DmD_mDm​ with real nonnegative finite quadratic forms and ∑m(Dm)ab=1a=b\sum_m(D_m)_{ab}=\mathbf1_{a=b}∑m​(Dm​)ab​=1a=b​. Its budget is M−1∑m∑kofReal⁡(wk)E(Xmk)M^{-1}\sum_m\sum_k\operatorname{ofReal}(w_k)\mathcal E(X_{mk})M−1∑m​∑k​ofReal(wk​)E(Xmk​); its leakage is S(M−1∑mZm)\dotminusM−1∑mS(Zm)S(M^{-1}\sum_mZ_m)\mathbin{\dotminus}M^{-1}\sum_mS(Z_m)S(M−1∑m​Zm​)\dotminusM−1∑m​S(Zm​), where Zm=∑kwkEηXmkZ_m=\sum_kw_kE_\eta X_{mk}Zm​=∑k​wk​Eη​Xmk​ and \dotminus\dotminus\dotminus is extended nonnegative subtraction. A rate R≥0R\ge0R≥0 is achievable if, for every 0<ϵ<10<\epsilon<10<ϵ<1 and δ>0\delta>0δ>0, all sufficiently large positive integers rrr admit such a code with budget at most ofReal⁡(rNˉ)\operatorname{ofReal}(r\bar N)ofReal(rNˉ), leakage at most ofReal⁡(ϵ)\operatorname{ofReal}(\epsilon)ofReal(ϵ), log⁡M/r≥R−δ\log M/r\ge R-\deltalogM/r≥R−δ, and Re⁡∑a∑b(PηXmk)ab(Dm)ba>1−ϵ\operatorname{Re}\sum_a\sum_b(P_\eta X_{mk})_{ab}(D_m)_{ba}>1-\epsilonRe∑a​∑b​(Pη​Xmk​)ab​(Dm​)ba​>1−ϵ for every m,km,km,k, including zero-weight kkk. The capacity C1\mathcal C_1C1​ is the supremum of ofReal⁡(R)\operatorname{ofReal}(R)ofReal(R) over these rates. The cases η=1\eta=1η=1 and Nˉ=0\bar N=0Nˉ=0 are included.

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