Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pointwise EPnI implies linear entropy concavity

Proved
QAlgorithms.Papers.Independent.Support50.P06.epni_implies_entropyConcavity

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

prove2quantum

Let n≥1n\ge1n≥1 and 0≤η≤10\le\eta\le10≤η≤1. Mix independent normalized nnn-mode port densities ρa,ρb\rho_a,\rho_bρa​,ρb​ of finite entropies with retained output ρc\rho_cρc​, using the source's full-space beam splitter. Assume the pointwise EPnI N(ρc)≥ηN(ρa)+(1−η)N(ρb)\mathcal N(\rho_c)\ge\eta\mathcal N(\rho_a)+(1-\eta)\mathcal N(\rho_b)N(ρc​)≥ηN(ρa​)+(1−η)N(ρb​), where N(ρ)=g−1(S(ρ)/n)\mathcal N(\rho)=g^{-1}(S(\rho)/n)N(ρ)=g−1(S(ρ)/n) and infinite output entropy is assigned infinite entropy photon number. Then

S(ρc)≥ηS(ρa)+(1−η)S(ρb).S(\rho_c)\ge\eta S(\rho_a)+(1-\eta)S(\rho_b).S(ρc​)≥ηS(ρa​)+(1−η)S(ρb​).

The output entropy may be infinite. This is the implication proved in note [14]; no converse is asserted.

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 pp.4–5, (24), note [14], (30)–(32): pointwise EPnI implies the
linear entropy bound. No converse or unconditional EPnI is asserted. -/
theorem epni_implies_entropyConcavity (n : ℕ) (hn : 0 < n) (eta : ℝ)
    (heta : 0 ≤ eta) (heta_one : eta ≤ 1) (rhoA rhoB : State (NumberString n))
    (hA : spectralEntropyNats rhoA.coefficients ≠ ⊤)
    (hB : spectralEntropyNats rhoB.coefficients ≠ ⊤)
    (hepni : EpniAt eta rhoA.coefficients rhoB.coefficients) :
    ENNReal.ofReal eta * spectralEntropyNats rhoA.coefficients +
        ENNReal.ofReal (1 - eta) * spectralEntropyNats rhoB.coefficients ≤
      spectralEntropyNats (mixedOutput n eta rhoA.coefficients rhoB.coefficients) := 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. 4, §V, (22) implies (24), proof in note [14]
Read-back

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

For every positive integer nnn, every real 0≤η≤10\le\eta\le10≤η≤1, and every pair of density kernels XA,XBX_A,X_BXA​,XB​ on Nn\mathbb N^nNn with finite entropies SA=S(XA)S_A=S(X_A)SA​=S(XA​) and SB=S(XB)S_B=S(X_B)SB​=S(XB​), assume

ofReal⁡(η) Qn(SA)+ofReal⁡(1−η) Qn(SB)≤Qn(S(Mη(XA,XB))).\operatorname{ofReal}(\eta)\,Q_n(S_A)+ \operatorname{ofReal}(1-\eta)\,Q_n(S_B) \le Q_n(S(M_\eta(X_A,X_B))).ofReal(η)Qn​(SA​)+ofReal(1−η)Qn​(SB​)≤Qn​(S(Mη​(XA​,XB​))).

Then

ofReal⁡(η) SA+ofReal⁡(1−η) SB≤S(Mη(XA,XB)).\operatorname{ofReal}(\eta)\,S_A+ \operatorname{ofReal}(1-\eta)\,S_B \le S(M_\eta(X_A,X_B)).ofReal(η)SA​+ofReal(1−η)SB​≤S(Mη​(XA​,XB​)).

These are inequalities in the extended nonnegative reals, with ofReal⁡(x)=max⁡(x,0)\operatorname{ofReal}(x)=\max(x,0)ofReal(x)=max(x,0), and the output entropy may equal +∞+\infty+∞. Here

Qn(s)={+∞,s=+∞,ofReal⁡(F(sreal/n)),s≠+∞,F(t)={0,t≤0,inf⁡{K∈R:K≥0, t≤(K+1)log⁡(K+1)−Klog⁡K},t>0,Q_n(s)= \begin{cases} +\infty,&s=+\infty,\\ \operatorname{ofReal}(F(s^{\mathrm{real}}/n)),&s\ne+\infty, \end{cases} \qquad F(t)= \begin{cases} 0,&t\le0,\\ \inf\{K\in\mathbb R:K\ge0,\ t\le (K+1)\log(K+1)-K\log K\},&t>0, \end{cases}Qn​(s)={+∞,ofReal(F(sreal/n)),​s=+∞,s=+∞,​F(t)={0,inf{K∈R:K≥0, t≤(K+1)log(K+1)−KlogK},​t≤0,t>0,​

where real conversion sends +∞+\infty+∞ to 000, and the logarithm is total with log⁡0=0\log0=0log0=0. A density kernel XXX has a countable expansion Xab=∑juj(a)vj(b)‾X_{ab}=\sum_j u_j(a)\overline{v_j(b)}Xab​=∑j​uj​(a)vj​(b)​, with uj,vj∈ℓ2(Nn;C)u_j,v_j\in\ell^2(\mathbb N^n;\mathbb C)uj​,vj​∈ℓ2(Nn;C) and ∑j∥uj∥∥vj∥<∞\sum_j\|u_j\|\|v_j\|<\infty∑j​∥uj​∥∥vj​∥<∞, has real nonnegative finite quadratic forms, and has summable real diagonal entries of sum 111. Its entropy S(X)S(X)S(X) is defined as the infimum of ∑jofReal⁡(−pjlog⁡pj)\sum_j\operatorname{ofReal}(-p_j\log p_j)∑j​ofReal(−pj​logpj​) over all countable representations Xab=∑jpjuj(a)uj(b)‾X_{ab}=\sum_jp_j u_j(a)\overline{u_j(b)}Xab​=∑j​pj​uj​(a)uj​(b)​, where the nonnegative weights are summable with sum 111, positive-weight vectors have norm 111, and distinct positive-weight vectors are orthogonal. Zero-weight vectors are unrestricted, and no such representation gives entropy +∞+\infty+∞. The output kernel is defined by

bη(m,l;p,q)=1m+l=p+qm! l!p! q!∑0≤u≤pu≤m, m−u≤q(pu)(qm−u)(η)u(1−η)p−u+(m−u)(−η)q−(m−u),Bη((a,e),(p,q))=∏i=0n−1bη(ai,ei;pi,qi),Mη(X,Y)ab=∑e∈Nn∑p∈Nn×Nn∑q∈Nn×NnBη((a,e),p)Xp1q1Yp2q2Bη((b,e),q)‾.\begin{aligned} b_\eta(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\eta)^u(\sqrt{1-\eta})^{p-u+(m-u)} (-\sqrt\eta)^{q-(m-u)},\\ B_\eta((a,e),(p,q))&=\prod_{i=0}^{n-1}b_\eta(a_i,e_i;p_i,q_i),\\ M_\eta(X,Y)_{ab} &=\sum_{e\in\mathbb N^n} \sum_{p\in\mathbb N^n\times\mathbb N^n} \sum_{q\in\mathbb N^n\times\mathbb N^n} B_\eta((a,e),p)X_{p_1q_1}Y_{p_2q_2} \overline{B_\eta((b,e),q)}. \end{aligned}bη​(m,l;p,q)Bη​((a,e),(p,q))Mη​(X,Y)ab​​=1m+l=p+q​p!q!m!l!​​0≤u≤pu≤m, m−u≤q​∑​(up​)(m−uq​)(η​)u(1−η​)p−u+(m−u)(−η​)q−(m−u),=i=0∏n−1​bη​(ai​,ei​;pi​,qi​),=e∈Nn∑​p∈Nn×Nn∑​q∈Nn×Nn∑​Bη​((a,e),p)Xp1​q1​​Yp2​q2​​Bη​((b,e),q)​.​

The hypotheses allow either input entropy to be zero and include η=0,1\eta=0,1η=0,1; they exclude n=0n=0n=0 and infinite input entropy.

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