Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Independent thermal products remain thermal under beam splitting

Open
QAlgorithms.Papers.Independent.Support50.P06.thermalProduct_mixing

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

prove2quantum

Let n≥1n\ge1n≥1, 0≤η≤10\le\eta\le10≤η≤1, and finite A,B≥0A,B\ge0A,B≥0. Feed the independent products ρT(A)⊗n\rho_T(A)^{\otimes n}ρT​(A)⊗n and ρT(B)⊗n\rho_T(B)^{\otimes n}ρT​(B)⊗n to the two ports of the source beam splitter, with retained field c=η a+1−η bc=\sqrt\eta\,a+\sqrt{1-\eta}\,bc=η​a+1−η​b. Then the actual reduced output density and its entropy are

ρc=ρT(ηA+(1−η)B)⊗n,S(ρc)=ng(ηA+(1−η)B).\rho_c=\rho_T(\eta A+(1-\eta)B)^{\otimes n},\qquad S(\rho_c)=n g(\eta A+(1-\eta)B).ρc​=ρT​(ηA+(1−η)B)⊗n,S(ρc​)=ng(ηA+(1−η)B).

This supplies the thermal comparison output used in the EPnI argument. Both transmissivity endpoints and A=B=0A=B=0A=B=0 are included.

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, §V and note [13]: mixing independent identical thermal
products yields the actual identical thermal output, not merely its covariance.
The output mean per mode is eta*A+(1-eta)*B. Both endpoints and A=B=0 remain. -/
theorem thermalProduct_mixing (n : ℕ) (hn : 0 < n) (eta A B : ℝ)
    (heta : 0 ≤ eta) (heta_one : eta ≤ 1) (hA : 0 ≤ A) (hB : 0 ≤ B) :
    mixedOutput n eta (identicalThermalKernel n A) (identicalThermalKernel n B) =
      identicalThermalKernel n (eta * A + (1 - eta) * B) ∧
    spectralEntropyNats
      (mixedOutput n eta (identicalThermalKernel n A) (identicalThermalKernel n B)) =
      ENNReal.ofReal ((n : ℝ) * g (eta * A + (1 - eta) * B)) := 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 proof and bibliography note [13]: mixing independent thermal products
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 real A,B≥0A,B\ge0A,B≥0, the theorem asserts

Mη(Tn(A),Tn(B))=Tn(ηA+(1−η)B),S(Mη(Tn(A),Tn(B)))=ofReal⁡ ⁣(n g(ηA+(1−η)B)).M_\eta(T_n(A),T_n(B))=T_n(\eta A+(1-\eta)B), \qquad S(M_\eta(T_n(A),T_n(B))) =\operatorname{ofReal}\!\left(n\,g(\eta A+(1-\eta)B)\right).Mη​(Tn​(A),Tn​(B))=Tn​(ηA+(1−η)B),S(Mη​(Tn​(A),Tn​(B)))=ofReal(ng(ηA+(1−η)B)).

Here number strings are elements of Nn\mathbb N^nNn,

Tn(K)ab=1a=b∏i=0n−1(K/(K+1))aiK+1,g(x)=(x+1)log⁡(x+1)−xlog⁡x,T_n(K)_{ab}=\mathbf1_{a=b}\prod_{i=0}^{n-1}\frac{(K/(K+1))^{a_i}}{K+1}, \qquad g(x)=(x+1)\log(x+1)-x\log x,Tn​(K)ab​=1a=b​i=0∏n−1​K+1(K/(K+1))ai​​,g(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. The mixing kernel is defined literally 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),Bη(X,Y)uv=∑a∈Nn×Nn∑b∈Nn×NnBη(u,a)Xa1b1Ya2b2Bη(v,b)‾,Mη(X,Y)ab=∑e∈NnBη(X,Y)(a,e),(b,e).\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),\\ \mathcal B_\eta(X,Y)_{uv} &=\sum_{a\in\mathbb N^n\times\mathbb N^n} \sum_{b\in\mathbb N^n\times\mathbb N^n} B_\eta(u,a)X_{a_1b_1}Y_{a_2b_2}\overline{B_\eta(v,b)},\\ M_\eta(X,Y)_{ab}&=\sum_{e\in\mathbb N^n}\mathcal B_\eta(X,Y)_{(a,e),(b,e)}. \end{aligned}bη​(m,l;p,q)Bη​((a,e),(p,q))Bη​(X,Y)uv​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​),=a∈Nn×Nn∑​b∈Nn×Nn∑​Bη​(u,a)Xa1​b1​​Ya2​b2​​Bη​(v,b)​,=e∈Nn∑​Bη​(X,Y)(a,e),(b,e)​.​

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 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 pj≥0p_j\ge0pj​≥0 is a summable sequence of sum 111, uj∈ℓ2(Nn;C)u_j\in\ell^2(\mathbb N^n;\mathbb C)uj​∈ℓ2(Nn;C), positive-weight vectors have norm 111, and distinct positive-weight vectors are orthogonal; zero-weight vectors are unrestricted, and an empty collection of resolutions gives S(X)=+∞S(X)=+\inftyS(X)=+∞. The logarithm is total with log⁡0=0\log0=0log0=0. The conclusions include η=0,1\eta=0,1η=0,1 and A=0A=0A=0 or B=0B=0B=0, using the convention 00=10^0=100=1; n=0n=0n=0 is excluded.

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