Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§6: non-Gaussian extension of GREE and strict nonzero value

Open
QAlgorithms.Papers.Independent.Intakenext100.P46.nonGaussian_gree_positive

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ρ\rhoρ be any non-Gaussian density operator on finitely many complete bosonic modes on a fixed bipartition with at least one mode per party. There is no finite-energy or finite-moment assumption on ρ\rhoρ. Define its extended Gaussian relative entropy of entanglement using all separable Gaussian density operators on the same cut. Then

EGR(ρ):=inf⁡σ separable GaussianD(ρ∥σ)>0.E_{GR}(\rho):=\inf_{\sigma\ \mathrm{separable\ Gaussian}}D(\rho\Vert\sigma)>0.EGR​(ρ):=σ separable Gaussianinf​D(ρ∥σ)>0.

Here DDD is the independently defined extended Umegaki divergence in nats, and separability means trace-norm closed convex-hull separability. The strict inequality concerns the infimum itself, which may be infinite. This records the deficiency noted for the extension to non-Gaussian inputs.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P46
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P46

open scoped BigOperators ENNReal ComplexOrder Matrix

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.RealRegisters (Hilbert)

open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsSeparable)

open QAlgorithms.Papers.Independent.Dependency50.P13
  (finiteRelativeEntropy compression entropyWeight)

open QAlgorithms.Papers.Independent.Claimed50.P47
  (Occupation bipartiteCharacteristic bipartiteWeyl gaussianStateCharacteristic)

-- These accepted definitions have the same completed Hilbert-space meaning.

open QAlgorithms.Papers.Independent.Next46.P13 (coordinateBasis)

open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)

open QAlgorithms.Papers.Independent.Claimed50.P41 (IsDiagonal)

/-- Chen, PDF p.12: extended GREE of a non-Gaussian density is strictly
nonzero. No finite-energy or finite-moment hypothesis is added to rho. -/
theorem nonGaussian_gree_positive {A B : Type} [Fintype A] [Fintype B]
    [Nonempty A] [Nonempty B] (rho : State (Occupation A × Occupation B))
    (hnongaussian : ¬ IsGaussianDensity rho) : 0 < gree rho := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P46

end
Source
Gaussian relative entropy of entanglement, arXiv:quant-ph/0402109v3, PDF p. 12, §6: non-Gaussian extension of GREE and strict nonzero value
Read-back

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

For any finite nonempty types A,BA,BA,B, put L=(A→N)×(B→N)L=(A\to\mathbb N)\times(B\to\mathbb N)L=(A→N)×(B→N), and let ρ\rhoρ be a state on LLL. A state here is a complex matrix RRR with a nuclear expansion Rij=∑rur(i)vr(j)‾R_{ij}=\sum_r u_r(i)\overline{v_r(j)}Rij​=∑r​ur​(i)vr​(j)​, where ur,vr∈ℓ2(L)u_r,v_r\in\ell^2(L)ur​,vr​∈ℓ2(L) and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, whose finite quadratic forms are real and nonnegative and whose real diagonal is summable with sum one. With J=(0I−I0)J=\begin{pmatrix}0&I\\-I&0\end{pmatrix}J=(0−I​I0​) on the grouped quadrature labels of A⊔BA\sqcup BA⊔B, Gaussianity means that there exist a real vector ddd and a real symmetric matrix α\alphaα, with α−i2J\alpha-\tfrac i2Jα−2i​J positive semidefinite, such that all inner and outer sums in χR(ξ)=∑u∑vRuv(Wξ)vu\chi_R(\xi)=\sum_u\sum_vR_{uv}(W_\xi)_{vu}χR​(ξ)=∑u​∑v​Ruv​(Wξ​)vu​ are summable and

χR(ξ)=exp⁡ ⁣(−12ξTJTαJξ+iξTJd)for every real ξ.\chi_R(\xi)= \exp\!\left(-\frac12\xi^TJ^T\alpha J\xi+i\xi^TJd\right) \quad\text{for every real }\xi.χR​(ξ)=exp(−21​ξTJTαJξ+iξTJd)for every real ξ.

Here WξW_\xiWξ​ is the product over the modes in AAA and BBB of the matrices

D(z)rs=e−∣z∣2/2r!s!∑j=0min⁡(r,s)zr−j(−z‾)s−jj!(r−j)!(s−j)!,z=−ξq+iξp2.D(z)_{rs}=e^{-|z|^2/2}\sqrt{r!s!} \sum_{j=0}^{\min(r,s)} \frac{z^{r-j}(-\overline z)^{s-j}}{j!(r-j)!(s-j)!}, \qquad z=-\frac{\xi_q+i\xi_p}{\sqrt2}.D(z)rs​=e−∣z∣2/2r!s!​j=0∑min(r,s)​j!(r−j)!(s−j)!zr−j(−z)s−j​,z=−2​ξq​+iξp​​.

Separable matrices are the limits of finite convex combinations of products of states on the two occupation-label sets, using the error size

N(K)=inf⁡Kij=∑rur(i)vr(j)‾∑r∥ur∥∥vr∥<∞∑r∥ur∥∥vr∥,N(K)=\inf_{\substack{K_{ij}=\sum_r u_r(i)\overline{v_r(j)}\\ \sum_r\|u_r\|\|v_r\|<\infty}} \sum_r\|u_r\|\|v_r\|,N(K)=Kij​=∑r​ur​(i)vr​(j)​∑r​∥ur​∥∥vr​∥<∞​inf​r∑​∥ur​∥∥vr​∥,

where an empty infimum is +∞+\infty+∞; explicitly, every positive error tolerance must admit such an approximation with smaller NNN. For states R,SR,SR,S, define D(R∥S)D(R\|S)D(R∥S) by taking their bounded-operator realizations on ℓ2(L)\ell^2(L)ℓ2(L), with zero used if no realization exists, and taking the supremum over all finite orthonormal families, including the empty family, of

{[Re⁡tr⁡(h(Rv)−Rvlog⁡Sv−Rv+Sv)]+,ker⁡Sv⊆ker⁡Rv,+∞,otherwise.\begin{cases} \left[\operatorname{Re}\operatorname{tr} \bigl(h(R_v)-R_v\log S_v-R_v+S_v\bigr)\right]_+, &\ker S_v\subseteq\ker R_v,\\ +\infty,&\text{otherwise}. \end{cases}{[Retr(h(Rv​)−Rv​logSv​−Rv​+Sv​)]+​,+∞,​kerSv​⊆kerRv​,otherwise.​

In this expression Rv,SvR_v,S_vRv​,Sv​ are the corresponding compression matrices, h(x)=xlog⁡xh(x)=x\log xh(x)=xlogx, the matrix functions use continuous functional calculus with log⁡0=0\log0=0log0=0, and [x]+=max⁡(x,0)[x]_+=\max(x,0)[x]+​=max(x,0). If ρ\rhoρ is not Gaussian in the stated sense, then

0<inf⁡S a separableGaussian state on LD(ρ∥S).0<\inf_{\substack{S\text{ a separable}\\\text{Gaussian state on }L}}D(\rho\|S).0<S a separableGaussian state on L​inf​D(ρ∥S).

The inequality is in [0,+∞][0,+\infty][0,+∞], so it permits the infimum to equal +∞+\infty+∞.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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