Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Unnumbered maximum-entropy rederivation

Open
QAlgorithms.Papers.Independent.Support50.P14.gaussianMaximumEntropy

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

prove2quantum

Let ρ\rhoρ and ρG\rho_GρG​ be normalized density operators on finitely many nonzero full oscillator modes. Suppose ρ\rhoρ has finite complete first and second moments and ρG\rho_GρG​ is Gaussian with the same symmetric covariance Γ\GammaΓ. Their first moments may differ. Their von Neumann entropies, computed from the densities in nats, are finite, and

S(ρ)≤S(ρG)<∞.S(\rho)\le S(\rho_G)<\infty.S(ρ)≤S(ρG​)<∞.

This recovers the maximum-entropy principle at fixed covariance. Displacement invariance explains why matching the means is unnecessary.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P14
Formal statement
noncomputable section

open Filter

open scoped BigOperators ENNReal Topology

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Support50.P14

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State IsDensity IsTraceClass traceSize)

open QAlgorithms.Papers.Independent.Dependency50.P39 (displacementMatrix)

open QAlgorithms.Papers.Independent.Frontier30.P14
  (unitaryCoeff conjugateKernel boundedUnitaryConjugation)

open QAlgorithms.Papers.Independent.Frontier18.P07 (extendedEntropyNats)

open QAlgorithms.Papers.Independent.Claimed50.P47 (Occupation)

open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)

/-- Maximum entropy principle rederived on PDF p.2; statement on PDF p.1.
Means may differ. Both actual density entropies are finite under finite energy. -/
theorem gaussianMaximumEntropy {I : Type} [Fintype I] [Nonempty I]
    (rho rhoG : State (Occupation I)) (d dG : InterleavedQuadrature I → ℝ) (gamma : OscillatorCovariance I)
    (hmoments : CompleteMoments rho.coefficients d gamma)
    (hgaussian : GaussianAt rhoG.coefficients dG gamma) :
    extendedEntropyNats rho.coefficients < ⊤ ∧
    extendedEntropyNats rhoG.coefficients < ⊤ ∧
    extendedEntropyNats rho.coefficients ≤ extendedEntropyNats rhoG.coefficients := by sorry

end QAlgorithms.Papers.Independent.Support50.P14

end
Source
Extremality of Gaussian quantum states, arXiv:quant-ph/0509154v1, PDF p. 1, Unnumbered maximum-entropy rederivation
Read-back

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

Let III be any finite, nonempty type, put NI=NI\mathcal N_I=\mathbb N^INI​=NI and QI=I×{0,1}Q_I=I\times\{0,1\}QI​=I×{0,1}, and let ρ,ρG\rho,\rho_Gρ,ρG​ be states with complex coefficient kernels K,KGK,K_GK,KG​ on NI\mathcal N_INI​. Here a state kernel LLL admits an expansion Luv=∑r=0∞ar(u)br(v)‾L_{uv}=\sum_{r=0}^{\infty}a_r(u)\overline{b_r(v)}Luv​=∑r=0∞​ar​(u)br​(v)​, with ar,br∈ℓ2(NI;C)a_r,b_r\in\ell^2(\mathcal N_I;\mathbb C)ar​,br​∈ℓ2(NI​;C) and ∑r∥ar∥2∥br∥2<∞\sum_r\|a_r\|_2\|b_r\|_2<\infty∑r​∥ar​∥2​∥br​∥2​<∞; every finite principal submatrix of LLL is positive semidefinite; and its real diagonal is summable with ∑uRe⁡Luu=1\sum_u\operatorname{Re}L_{uu}=1∑u​ReLuu​=1. Let d,dG:QI→Rd,d_G:Q_I\to\mathbb Rd,dG​:QI​→R and let γ\gammaγ be any real matrix on QIQ_IQI​. To state the hypotheses explicitly, define

Dz(m,n)=e−∣z∣2/2m! n!∑j=0min⁡(m,n)zm−j(−z‾)n−jj!(m−j)!(n−j)!,Wξ(u,v)=∏i∈ID(−ξi,1+iξi,0)/2(ui,vi),D_z(m,n)=e^{-|z|^2/2}\sqrt{m!\,n!} \sum_{j=0}^{\min(m,n)} \frac{z^{m-j}(-\overline z)^{n-j}}{j!(m-j)!(n-j)!}, \qquad W_\xi(u,v)=\prod_{i\in I} D_{(-\xi_{i,1}+i\xi_{i,0})/\sqrt2}(u_i,v_i),Dz​(m,n)=e−∣z∣2/2m!n!​j=0∑min(m,n)​j!(m−j)!(n−j)!zm−j(−z)n−j​,Wξ​(u,v)=i∈I∏​D(−ξi,1​+iξi,0​)/2​​(ui​,vi​), χL(ξ)=∑u∑vLuvWξ(v,u),me(ξ)=∑a∈QIξaea,Vγ(ξ)=∑a,b∈QIξaγabξb,E(L)=∑u[∑iui]+[Re⁡Luu]+,\chi_L(\xi)=\sum_u\sum_v L_{uv}W_\xi(v,u),\qquad m_e(\xi)=\sum_{a\in Q_I}\xi_a e_a,\qquad V_\gamma(\xi)=\sum_{a,b\in Q_I}\xi_a\gamma_{ab}\xi_b, \qquad \mathcal E(L)=\sum_u\Bigl[\sum_i u_i\Bigr]_+ [\operatorname{Re}L_{uu}]_+,χL​(ξ)=u∑​v∑​Luv​Wξ​(v,u),me​(ξ)=a∈QI​∑​ξa​ea​,Vγ​(ξ)=a,b∈QI​∑​ξa​γab​ξb​,E(L)=u∑​[i∑​ui​]+​[ReLuu​]+​,

where [x]+=max⁡(x,0)[x]_+=\max(x,0)[x]+​=max(x,0), regarded as an extended nonnegative real where needed. Assume that E(K)<∞\mathcal E(K)<\inftyE(K)<∞, that γT=γ\gamma^\mathsf T=\gammaγT=γ, that for every ξ\xiξ each inner series defining χK(ξ)\chi_K(\xi)χK​(ξ) is summable and the series of its inner sums is summable, and that for every ξ\xiξ, the function t↦χK(tξ)t\mapsto\chi_K(t\xi)t↦χK​(tξ) has derivative i md(ξ)i\,m_d(\xi)imd​(ξ) at 000, while its derivative function has derivative −Vγ(ξ)/2−md(ξ)2-V_\gamma(\xi)/2-m_d(\xi)^2−Vγ​(ξ)/2−md​(ξ)2 at 000. Assume the same finite-energy, symmetry, summability, and derivative conditions for KGK_GKG​, using dGd_GdG​ in place of ddd, and additionally

χKG(ξ)=exp⁡ ⁣(−Vγ(ξ)4+i mdG(ξ))for every ξ:QI→R.\chi_{K_G}(\xi)= \exp\!\left(-\frac{V_\gamma(\xi)}4+i\,m_{d_G}(\xi)\right) \quad\text{for every }\xi:Q_I\to\mathbb R.χKG​​(ξ)=exp(−4Vγ​(ξ)​+imdG​​(ξ))for every ξ:QI​→R.

For a kernel LLL, define its extended entropy by

H(L)=sup⁡s⊆NIs finite[tslog⁡ts−Re⁡tr⁡(Ls log⁡(Ls))]+,ts=Re⁡tr⁡Ls,H(L)=\sup_{\substack{s\subseteq\mathcal N_I\\s\text{ finite}}} \left[ t_s\log t_s-\operatorname{Re}\operatorname{tr} \bigl(L_s\,\log(L_s)\bigr) \right]_+,\qquad t_s=\operatorname{Re}\operatorname{tr}L_s,H(L)=s⊆NI​s finite​sup​[ts​logts​−Retr(Ls​log(Ls​))]+​,ts​=RetrLs​,

where LsL_sLs​ is the principal compression to sss, and log⁡(Ls)\log(L_s)log(Ls​) is the real continuous functional calculus used in the statement, with scalar log⁡0=0\log0=0log0=0. The supremum includes the empty compression, whose contribution is 000, and may in general equal +∞+\infty+∞. The conclusion is

H(K)<+∞,H(KG)<+∞,H(K)≤H(KG).H(K)<+\infty,\qquad H(K_G)<+\infty,\qquad H(K)\le H(K_G).H(K)<+∞,H(KG​)<+∞,H(K)≤H(KG​).

There is no hypothesis that d=dGd=d_Gd=dG​.

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