Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

EPnI implies the centered-pure-input vacuum minimizer

Open
QAlgorithms.Papers.Independent.Support50.P06.epni_implies_moe1

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

prove2quantum

Assume EPnI for every positive number of modes, every transmissivity in [0,1][0,1][0,1], and every pair of independent normalized input port densities with finite input entropies. Let n≥1n\ge1n≥1, 0≤η≤10\le\eta\le10≤η≤1 and finite K≥0K\ge0K≥0. Let the aaa input be any normalized pure nnn-mode state whose annihilation-field expectation in each mode exists and is zero, and let the independent bbb input be ρT(K)⊗n\rho_T(K)^{\otimes n}ρT​(K)⊗n. Then

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

The vacuum aaa input attains this minimum: its actual output is ρT((1−η)K)⊗n\rho_T((1-\eta)K)^{\otimes n}ρT​((1−η)K)⊗n and has exactly the displayed entropy. No finite-photon-energy or Gaussian assumption is imposed on the optimized pure input. The formal centered predicate uses convergent sums, rather than interpreting a divergent sum as zero.

Thus global EPnI implies minimum output entropy conjecture 1 with its attained value.

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 1 and (25): a conditional implication with the
vacuum attained value n*g((1-eta)*K). Pure means norm one; centered means
convergent annihilation expectations, with no finite-energy restriction. -/
theorem epni_implies_moe1 (hepni : EntropyPhotonNumberInequality) :
    MinimumOutputEntropyConjecture1 := 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 1 as a consequence of EPnI
Read-back

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

Assume the entropy photon number inequality specified below. The notation and its meaning are as follows. For each positive integer nnn, let Nn={0,…,n−1}→N\mathcal N_n=\{0,\ldots,n-1\}\to\mathbb NNn​={0,…,n−1}→N, and regard a kernel XXX as a complex matrix indexed by Nn\mathcal N_nNn​. A density kernel is a kernel admitting sequences lr,rr∈ℓ2(Nn;C)l_r,r_r\in\ell^2(\mathcal N_n;\mathbb C)lr​,rr​∈ℓ2(Nn​;C) such that ∑r∥lr∥∥rr∥\sum_r\|l_r\|\|r_r\|∑r​∥lr​∥∥rr​∥ is summable and Xab=∑rlr(a)rr(b)‾X_{ab}=\sum_r l_r(a)\overline{r_r(b)}Xab​=∑r​lr​(a)rr​(b)​, whose every finite quadratic form ∑a,b∈Fza‾Xabzb\sum_{a,b\in F}\overline{z_a}X_{ab}z_b∑a,b∈F​za​​Xab​zb​ is real and nonnegative, and whose real diagonal entries are summable with sum 111. Define S(X)∈[0,∞]S(X)\in[0,\infty]S(X)∈[0,∞] to be the infimum of ∑j=0∞[−λjlog⁡λj]+\sum_{j=0}^\infty[-\lambda_j\log\lambda_j]_+∑j=0∞​[−λj​logλj​]+​ over all representations

Xab=∑j=0∞λjvj(a)vj(b)‾,X_{ab}=\sum_{j=0}^{\infty}\lambda_jv_j(a)\overline{v_j(b)},Xab​=j=0∑∞​λj​vj​(a)vj​(b)​,

where the nonnegative real sequence (λj)(\lambda_j)(λj​) is summable with sum 111, vj∈ℓ2(Nn;C)v_j\in\ell^2(\mathcal N_n;\mathbb C)vj​∈ℓ2(Nn​;C), every vjv_jvj​ with λj>0\lambda_j>0λj​>0 has norm 111, and distinct vectors with positive weights are orthogonal; vectors with zero weights have no such restrictions. Here [r]+[r]_+[r]+​ denotes the nonnegative part of a real number, embedded in [0,∞][0,\infty][0,∞], and an infimum over no such representations is ∞\infty∞. Put 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, with the total real logarithm convention log⁡0=0\log0=0log0=0. Define h(s)=0h(s)=0h(s)=0 for s≤0s\le0s≤0, and otherwise

h(s)=inf⁡{K∈R:K≥0, s≤g(K)},En(s)={∞,s=∞,[h(s/n)]+,s<∞.h(s)=\inf\{K\in\mathbb R:K\ge0,\ s\le g(K)\}, \qquad E_n(s)= \begin{cases} \infty,&s=\infty,\\ [h(s/n)]_+,&s<\infty. \end{cases}h(s)=inf{K∈R:K≥0, s≤g(K)},En​(s)={∞,[h(s/n)]+​,​s=∞,s<∞.​

The real infimum defining hhh uses value 000 if its set is empty. To define the mixing operation, for nonnegative integers m,l,p,qm,l,p,qm,l,p,q, let bη(m,l;p,q)=0b_\eta(m,l;p,q)=0bη​(m,l;p,q)=0 unless m+l=p+qm+l=p+qm+l=p+q, and otherwise let

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).

All subtraction in natural-number exponents and indices is truncated at zero. For pairs of number strings, set 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=0n−1​bη​(u1​(i),u2​(i);a1​(i),a2​(i)), and define

Jn,η(X,Y)uv=∑a∈Nn2∑b∈Nn2Bn,η(u,a) Xa1b1Ya2b2 Bn,η(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)​.

These unrestricted complex series use the total sum convention, with value 000 for a nonsummable series. Let Vn(a,b)V_n(a,b)Vn​(a,b) equal 111 when a=b=0a=b=\mathbf0a=b=0, and 000 otherwise, and let

Tn,K(a,b)={∏i=0n−1(K/(K+1))a(i)K+1,a=b,0,a≠b.T_{n,K}(a,b)= \begin{cases} \displaystyle\prod_{i=0}^{n-1}\frac{(K/(K+1))^{a(i)}}{K+1},&a=b,\\ 0,&a\ne b. \end{cases}Tn,K​(a,b)=⎩⎨⎧​i=0∏n−1​K+1(K/(K+1))a(i)​,0,​a=b,a=b.​

The assumed inequality says that for every positive integer nnn, every 0≤η≤10\le\eta\le10≤η≤1, and every pair of density kernels X,YX,YX,Y with S(X),S(Y)<∞S(X),S(Y)<\inftyS(X),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\!\left(S(M_{n,\eta}(X,Y))\right),[η]+​En​(S(X))+[1−η]+​En​(S(Y))≤En​(S(Mn,η​(X,Y))),

with operations in [0,∞][0,\infty][0,∞]. Under this assumption, for every positive integer nnn, every η∈[0,1]\eta\in[0,1]η∈[0,1], and every real K≥0K\ge0K≥0, all three of the following hold:

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

and, for every unit vector u∈ℓ2(Nn;C)u\in\ell^2(\mathcal N_n;\mathbb C)u∈ℓ2(Nn​;C) satisfying, for each coordinate iii, the convergent unordered-sum condition

∑a∈Nna(i)+1 u(a)‾ u ⁣(a[i←a(i)+1])=0,\sum_{a\in\mathcal N_n} \sqrt{a(i)+1}\,\overline{u(a)}\, u\!\left(a[i\leftarrow a(i)+1]\right)=0,a∈Nn​∑​a(i)+1​u(a)​u(a[i←a(i)+1])=0,

one has

[n g((1−η)K)]+≤S ⁣(Mn,η((u(a)u(b)‾)ab,Tn,K)).[n\,g((1-\eta)K)]_+ \le S\!\left(M_{n,\eta}\bigl((u(a)\overline{u(b)})_{ab},T_{n,K}\bigr)\right).[ng((1−η)K)]+​≤S(Mn,η​((u(a)u(b)​)ab​,Tn,K​)).

The coordinate sums required of uuu must actually converge to zero; a total sum assigned zero through nonsummability does not meet that requirement. The quantifiers exclude n=0n=0n=0 and include K=0K=0K=0 and both endpoints η=0,1\eta=0,1η=0,1.

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