Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

EPnI implies the fixed-entropy thermal minimizer

Open
QAlgorithms.Papers.Independent.Support50.P06.epni_implies_moe2

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

prove2quantum

Assume global EPnI on the finite-input-entropy domain. Let n≥1n\ge1n≥1, 0≤η≤10\le\eta\le10≤η≤1, and finite K≥0K\ge0K≥0. The aaa input is vacuum and the independent bbb input is any normalized nnn-mode density satisfying the entropy shell S(ρb)=ng(K)S(\rho_b)=ng(K)S(ρb​)=ng(K). Then

S(ρc)≥ng((1−η)K).S(\rho_c)\ge n g((1-\eta)K).S(ρc​)≥ng((1−η)K).

The identical thermal product ρT(K)⊗n\rho_T(K)^{\otimes n}ρT​(K)⊗n has input entropy ng(K)ng(K)ng(K) and attains equality at the output. The result is global over all these parameters and all states on the shell; it imposes no Gaussian or finite-energy restriction.

This is precisely the accepted StrongConjecture2 predicate, used here as a conditional conclusion, not an established unconditional premise.

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, Conjecture 2, (26): EPnI implies the global accepted MOE2
predicate, including thermal attainment. The shell is S(rho)=n*g(K); neither
Gaussianity nor a mean-photon constraint is imposed on rho. -/
theorem epni_implies_moe2 (hepni : EntropyPhotonNumberInequality) :
    StrongConjecture2 := 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, Minimum Output Entropy Conjecture 2 as a consequence of EPnI
Read-back

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

Assume the following entropy photon number inequality. For a positive integer nnn, write Nn={0,…,n−1}→N\mathcal N_n=\{0,\ldots,n-1\}\to\mathbb NNn​={0,…,n−1}→N. A density kernel X:Nn×Nn→CX:\mathcal N_n\times\mathcal N_n\to\mathbb CX:Nn​×Nn​→C is required to have a representation Xab=∑rlr(a)rr(b)‾X_{ab}=\sum_r l_r(a)\overline{r_r(b)}Xab​=∑r​lr​(a)rr​(b)​ by sequences lr,rr∈ℓ2(Nn;C)l_r,r_r\in\ell^2(\mathcal N_n;\mathbb C)lr​,rr​∈ℓ2(Nn​;C) with ∑r∥lr∥∥rr∥\sum_r\|l_r\|\|r_r\|∑r​∥lr​∥∥rr​∥ summable, to have real nonnegative quadratic forms on every finite subset of Nn\mathcal N_nNn​, and to have summable real diagonal entries with sum 111. Define S(X)∈[0,∞]S(X)\in[0,\infty]S(X)∈[0,∞] as the infimum of

∑j=0∞[−λjlog⁡λj]+\sum_{j=0}^{\infty}[-\lambda_j\log\lambda_j]_+j=0∑∞​[−λj​logλj​]+​

over all nonnegative summable sequences (λj)(\lambda_j)(λj​) with sum 111 and vectors vj∈ℓ2(Nn;C)v_j\in\ell^2(\mathcal N_n;\mathbb C)vj​∈ℓ2(Nn​;C) for which Xab=∑jλjvj(a)vj(b)‾X_{ab}=\sum_j\lambda_jv_j(a)\overline{v_j(b)}Xab​=∑j​λj​vj​(a)vj​(b)​, each positive-weight vector has norm 111, and distinct positive-weight vectors are orthogonal. Zero-weight vectors are unrestricted, and the infimum is ∞\infty∞ if there is no such representation. Here [r]+[r]_+[r]+​ is the nonnegative part of rrr, viewed in [0,∞][0,\infty][0,∞]. Set

g(x)=(x+1)log⁡(x+1)−xlog⁡x,h(s)={0,s≤0,inf⁡{K≥0:s≤g(K)},s>0,En(s)={∞,s=∞,[h(s/n)]+,s<∞.g(x)=(x+1)\log(x+1)-x\log x,\qquad h(s)= \begin{cases} 0,&s\le0,\\ \inf\{K\ge0:s\le g(K)\},&s>0, \end{cases} \qquad E_n(s)= \begin{cases} \infty,&s=\infty,\\ [h(s/n)]_+,&s<\infty. \end{cases}g(x)=(x+1)log(x+1)−xlogx,h(s)={0,inf{K≥0:s≤g(K)},​s≤0,s>0,​En​(s)={∞,[h(s/n)]+​,​s=∞,s<∞.​

The real logarithm has log⁡0=0\log0=0log0=0, and the real infimum defining hhh is 000 if its set is empty. The mixing operation is defined coefficientwise as follows. Let bη(m,l;p,q)=0b_\eta(m,l;p,q)=0bη​(m,l;p,q)=0 when m+l≠p+qm+l\ne p+qm+l=p+q, and otherwise put

bη(m,l;p,q)=m! l!p! q!∑0≤u≤pu≤m, m−u≤q(pu)(qm−u)(η)u(1−η) p−u+(m−u)(−η) q−(m−u).b_\eta(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η​(m,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).

Natural-number subtraction is truncated at zero. With

Bn,η(u,a)=∏i=0n−1bη(u1(i),u2(i);a1(i),a2(i)),B_{n,\eta}(u,a)=\prod_{i=0}^{n-1} b_\eta(u_1(i),u_2(i);a_1(i),a_2(i)),Bn,η​(u,a)=i=0∏n−1​bη​(u1​(i),u2​(i);a1​(i),a2​(i)),

define

Jn,η(X,Y)uv=∑a∈Nn2∑b∈Nn2Bn,η(u,a)Xa1b1Ya2b2Bn,η(v,b)‾,Mn,η(X,Y)ab=∑e∈NnJn,η(X,Y)(a,e),(b,e).J_{n,\eta}(X,Y)_{uv} =\sum_{a\in\mathcal N_n^2}\sum_{b\in\mathcal N_n^2} B_{n,\eta}(u,a)X_{a_1b_1}Y_{a_2b_2} \overline{B_{n,\eta}(v,b)}, \qquad M_{n,\eta}(X,Y)_{ab} =\sum_{e\in\mathcal N_n}J_{n,\eta}(X,Y)_{(a,e),(b,e)}.Jn,η​(X,Y)uv​=a∈Nn2​∑​b∈Nn2​∑​Bn,η​(u,a)Xa1​b1​​Ya2​b2​​Bn,η​(v,b)​,Mn,η​(X,Y)ab​=e∈Nn​∑​Jn,η​(X,Y)(a,e),(b,e)​.

Unrestricted complex series use the total sum convention, assigning zero to a nonsummable series. Let Vn(a,b)=1V_n(a,b)=1Vn​(a,b)=1 if a=b=0a=b=\mathbf0a=b=0, and 000 otherwise, and let Tn,KT_{n,K}Tn,K​ be the diagonal kernel

Tn,K(a,a)=∏i=0n−1(K/(K+1))a(i)K+1.T_{n,K}(a,a)=\prod_{i=0}^{n-1}\frac{(K/(K+1))^{a(i)}}{K+1}.Tn,K​(a,a)=i=0∏n−1​K+1(K/(K+1))a(i)​.

The hypothesis is that for every positive integer nnn, every η∈[0,1]\eta\in[0,1]η∈[0,1], and all density kernels X,YX,YX,Y with finite S(X)S(X)S(X) and S(Y)S(Y)S(Y),

[η]+En(S(X))+[1−η]+En(S(Y))≤En(S(Mn,η(X,Y))).[\eta]_+E_n(S(X))+[1-\eta]_+E_n(S(Y)) \le E_n(S(M_{n,\eta}(X,Y))).[η]+​En​(S(X))+[1−η]+​En​(S(Y))≤En​(S(Mn,η​(X,Y))).

It implies that for every positive integer nnn, every η∈[0,1]\eta\in[0,1]η∈[0,1], and every K≥0K\ge0K≥0,

S(Tn,K)=[n g(K)]+,S(Mn,η(Vn,Tn,K))=[n g((1−η)K)]+,S(T_{n,K})=[n\,g(K)]_+, \qquad S(M_{n,\eta}(V_n,T_{n,K}))=[n\,g((1-\eta)K)]_+,S(Tn,K​)=[ng(K)]+​,S(Mn,η​(Vn​,Tn,K​))=[ng((1−η)K)]+​,

and, for every density kernel ρ\rhoρ satisfying S(ρ)=[n g(K)]+S(\rho)=[n\,g(K)]_+S(ρ)=[ng(K)]+​,

[n g((1−η)K)]+≤S(Mn,η(Vn,ρ)).[n\,g((1-\eta)K)]_+ \le S(M_{n,\eta}(V_n,\rho)).[ng((1−η)K)]+​≤S(Mn,η​(Vn​,ρ)).

This includes K=0K=0K=0 and η=0,1\eta=0,1η=0,1, excludes n=0n=0n=0, and places no purity, Gaussian, or centering condition on ρ\rhoρ.

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