Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Thermal entropy and entropy-matched product states

Proved
QAlgorithms.Papers.Independent.Support50.P06.thermalEntropy_matching

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

prove2quantum

Let n≥1n\ge1n≥1 and use natural-log von Neumann entropy on completed Fock spaces. A single-mode thermal state with finite mean N≥0N\ge0N≥0 satisfies

S(ρT(N))=g(N).S(\rho_T(N))=g(N).S(ρT​(N))=g(N).

For two normalized nnn-mode port densities ρa,ρb\rho_a,\rho_bρa​,ρb​ with finite entropies, set Ka=g−1(S(ρa)/n)K_a=g^{-1}(S(\rho_a)/n)Ka​=g−1(S(ρa​)/n) and Kb=g−1(S(ρb)/n)K_b=g^{-1}(S(\rho_b)/n)Kb​=g−1(S(ρb​)/n). Their corresponding identical thermal products satisfy

S(ρT(Ka)⊗n)=S(ρa),S(ρT(Kb)⊗n)=S(ρb).S(\rho_T(K_a)^{\otimes n})=S(\rho_a),\qquad S(\rho_T(K_b)^{\otimes n})=S(\rho_b).S(ρT​(Ka​)⊗n)=S(ρa​),S(ρT​(Kb​)⊗n)=S(ρb​).

This is entropy matching. No finite-energy assumption is imposed on the original densities, and their physical photon means are not identified with Ka,KbK_a,K_bKa​,Kb​.

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.4, (19)–(20): thermal entropy and the entropy-matched n-mode thermal
products for BOTH independent ports. Matching entropy never identifies an
arbitrary state's physical mean photons with its entropy photon number. -/
theorem thermalEntropy_matching (n : ℕ) (hn : 0 < n) :
    (∀ N : ℝ, 0 ≤ N → spectralEntropyNats (identicalThermalKernel 1 N) =
      ENNReal.ofReal (g N)) ∧
    (∀ rhoA rhoB : State (NumberString n),
      spectralEntropyNats rhoA.coefficients ≠ ⊤ →
      spectralEntropyNats rhoB.coefficients ≠ ⊤ →
      spectralEntropyNats (identicalThermalKernel n
        (entropyParameter n (spectralEntropyNats rhoA.coefficients))) =
          spectralEntropyNats rhoA.coefficients ∧
      spectralEntropyNats (identicalThermalKernel n
        (entropyParameter n (spectralEntropyNats rhoB.coefficients))) =
          spectralEntropyNats 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, §IV.B after (19)–(20): thermal entropy and entropy-matched products
Read-back

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

For every positive integer nnn, the assertion has two parts:

S(T1(N))=ofReal⁡(g(N))for every N≥0,S(T_1(N))=\operatorname{ofReal}(g(N))\quad\text{for every }N\ge0,S(T1​(N))=ofReal(g(N))for every N≥0,

and, for every pair of density kernels XA,XBX_A,X_BXA​,XB​ on Nn\mathbb N^nNn with S(XA)≠+∞S(X_A)\ne+\inftyS(XA​)=+∞ and S(XB)≠+∞S(X_B)\ne+\inftyS(XB​)=+∞,

S ⁣(Tn ⁣(F ⁣(S(XA)realn)))=S(XA),S ⁣(Tn ⁣(F ⁣(S(XB)realn)))=S(XB).S\!\left(T_n\!\left(F\!\left(\frac{S(X_A)^{\mathrm{real}}}{n}\right)\right)\right)=S(X_A), \qquad S\!\left(T_n\!\left(F\!\left(\frac{S(X_B)^{\mathrm{real}}}{n}\right)\right)\right)=S(X_B).S(Tn​(F(nS(XA​)real​)))=S(XA​),S(Tn​(F(nS(XB​)real​)))=S(XB​).

Here ofReal⁡(x)=max⁡(x,0)\operatorname{ofReal}(x)=\max(x,0)ofReal(x)=max(x,0) as an extended nonnegative real,

Tr(K)ab=1a=b∏i=0r−1(K/(K+1))aiK+1,g(x)=(x+1)log⁡(x+1)−xlog⁡x,F(s)={0,s≤0,inf⁡{K∈R:K≥0, s≤g(K)},s>0.T_r(K)_{ab}=\mathbf1_{a=b}\prod_{i=0}^{r-1}\frac{(K/(K+1))^{a_i}}{K+1}, \quad g(x)=(x+1)\log(x+1)-x\log x, \quad F(s)= \begin{cases} 0,&s\le0,\\ \inf\{K\in\mathbb R:K\ge0,\ s\le g(K)\},&s>0. \end{cases}Tr​(K)ab​=1a=b​i=0∏r−1​K+1(K/(K+1))ai​​,g(x)=(x+1)log(x+1)−xlogx,F(s)={0,inf{K∈R:K≥0, s≤g(K)},​s≤0,s>0.​

The real conversion S(X)realS(X)^{\mathrm{real}}S(X)real sends +∞+\infty+∞ to 000, although the two input hypotheses exclude that case. A density kernel on Nn\mathbb N^nNn admits a representation 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 quadratic forms on every finite set, and has summable real diagonal entries of sum 111. For any kernel XXX, 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 countable 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 have no norm or orthogonality requirements, and absence of such an expansion gives entropy +∞+\infty+∞. The logarithm has its total real meaning, including log⁡0=0\log0=0log0=0. The first part concerns one mode regardless of the given positive nnn, and includes N=0N=0N=0; the second part allows zero 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