Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Gaussian states with nonnegative correlation determinant are separable

Open
QAlgorithms.Papers.Independent.Intakenext100.P92.gaussianNonnegativeCorrelationSeparable

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

prove2quantum

Let ρ\rhoρ be a normalized Gaussian density of two complete canonical oscillator modes, one per party, with arbitrary first moments and finite half-anticommutator covariance V=(ACCTB)V=\begin{pmatrix}A&C\\C^T&B\end{pmatrix}V=(ACT​CB​) in the order (q1,p1,q2,p2)(q_1,p_1,q_2,p_2)(q1​,p1​,q2​,p2​) and units ℏ=1\hbar=1ℏ=1. Then

det⁡C≥0⟹ρ is separable.\det C\ge0\quad\Longrightarrow\quad\rho\text{ is separable}.detC≥0⟹ρ is separable.

Separability means the trace-norm closed convex hull of product densities. Both det⁡C>0\det C>0detC>0 and the entire boundary det⁡C=0\det C=0detC=0, including pure product states, are covered. This lemma supplies the nonnegative-correlation case of the Gaussian criterion.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P92
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakenext100.P92

open MeasureTheory

open scoped BigOperators ENNReal ComplexOrder

open QAlgorithms.Papers.Independent.Dependency50.P33
  (IsDensity IsSeparable IsBarycenter)

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

open QAlgorithms.Papers.Independent.Advance50.P48
  (TwoKernel GaussianTwo IsDiscordCovariance characteristicTwo
   covarianceModeBlock totalPhotonEnergy)

open QAlgorithms.Papers.Independent.Frontier30.P04 (modePhase Covariance twoModeStandard)

open QAlgorithms.Papers.Independent.Claimed50.P30 (canonicalOmega)

open QAlgorithms.Papers.Independent.Gap48.P47 (localSymplecticMatrix)

open QAlgorithms.Papers.Independent.Renew46.P39 (AffineMultimodeGaussianUnitary)

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

attribute [local instance] Classical.propDecidable Classical.decEq

/-- Lemma, PDF p.5: includes both det C>0 and det C=0 and all displacements.
Printed proof arithmetic: the scaled off-diagonal coefficient 2ab c1 should be
2 sqrt(ab) c1 for the displayed scaling. The lemma statement is unchanged;
this proof discrepancy is recorded for independent moderation. -/
theorem gaussianNonnegativeCorrelationSeparable (rho : TwoKernel) (d : (modePhase 2) → ℝ)
    (V : Covariance 2) (hgauss : GaussianTwo rho d V)
    (hC : 0 ≤ simonInvariant V 2) : IsSeparable rho := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P92

end
Source
Peres-Horodecki separability criterion for continuous variable systems, arXiv:quant-ph/9909044v1, PDF p. 5, Lemma, PDF p.5: Gaussian states with det C >= 0 are separable
Read-back

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

Let ρ\rhoρ be a complex kernel on N2\mathbb N^2N2, d∈R4d\in\mathbb R^4d∈R4, and V∈M4(R)V\in M_4(\mathbb R)V∈M4​(R), with coordinate order (0,0),(0,1),(1,0),(1,1)(0,0),(0,1),(1,0),(1,1)(0,0),(0,1),(1,0),(1,1). A density kernel XXX on LLL means that Xij=∑r′ur(i)vr(j)‾X_{ij}=\sum'_r u_r(i)\overline{v_r(j)}Xij​=∑r′​ur​(i)vr​(j)​ for ur,vr∈ℓ2(L;C)u_r,v_r\in\ell^2(L;\mathbb C)ur​,vr​∈ℓ2(L;C) with ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, that every finite quadratic form is real and nonnegative, and that the real diagonal is summable with sum 111. Assume that ρ\rhoρ is a density, that VVV is symmetric, and that V+iΩ/2V+i\Omega/2V+iΩ/2 is positive semidefinite, where

J=(01−10),Ω=diag⁡(J,J).J=\begin{pmatrix}0&1\\-1&0\end{pmatrix},\qquad \Omega=\operatorname{diag}(J,J).J=(0−1​10​),Ω=diag(J,J).

Define

Dz(m,n)=e−∣z∣2/2m! n!∑r=0min⁡(m,n)zm−r(−z‾)n−rr!(m−r)!(n−r)!,zk(x)=−xk,1+ixk,02,D_z(m,n)=e^{-|z|^2/2}\sqrt{m!\,n!} \sum_{r=0}^{\min(m,n)} \frac{z^{m-r}(-\overline z)^{n-r}}{r!(m-r)!(n-r)!},\quad z_k(x)=\frac{-x_{k,1}+ix_{k,0}}{\sqrt2},Dz​(m,n)=e−∣z∣2/2m!n!​r=0∑min(m,n)​r!(m−r)!(n−r)!zm−r(−z)n−r​,zk​(x)=2​−xk,1​+ixk,0​​, χρ(x)=∑m′∑n′ρmnDz0(x)(n0,m0)Dz1(x)(n1,m1),\chi_\rho(x)=\sum'_m\sum'_n\rho_{mn} D_{z_0(x)}(n_0,m_0)D_{z_1(x)}(n_1,m_1),χρ​(x)=m∑′​n∑′​ρmn​Dz0​(x)​(n0​,m0​)Dz1​(x)​(n1​,m1​),

using total infinite sums, assigned zero for nonsummable summands, and assume that χρ(x)=exp⁡(−xTVx/2+i dTx)\chi_\rho(x)=\exp(-x^\mathsf TVx/2+i\,d^\mathsf Tx)χρ​(x)=exp(−xTVx/2+idTx) for every x∈R4x\in\mathbb R^4x∈R4. If the upper-right 2×22\times22×2 mode block C=V01C=V_{01}C=V01​ satisfies 0≤det⁡C0\le\det C0≤detC, including det⁡C=0\det C=0detC=0, then ρ\rhoρ is separable in the following precise sense: for every ε>0\varepsilon>0ε>0, there exist finitely many one-mode density kernels Ar,BrA^r,B^rAr,Br and weights wr≥0w_r\ge0wr​≥0 with ∑rwr=1\sum_r w_r=1∑r​wr​=1 such that

τ ⁣(ρ−∑rwr(Ar⊗Br))<ε,(Ar⊗Br)(i,k),(j,l)=AijrBklr,\tau\!\left(\rho-\sum_r w_r(A^r\otimes B^r)\right)<\varepsilon, \qquad (A^r\otimes B^r)_{(i,k),(j,l)}=A^r_{ij}B^r_{kl},τ(ρ−r∑​wr​(Ar⊗Br))<ε,(Ar⊗Br)(i,k),(j,l)​=Aijr​Bklr​,

where τ(X)\tau(X)τ(X) is the infimum of ∑r∥ur∥∥vr∥\sum_r\|u_r\|\|v_r\|∑r​∥ur​∥∥vr​∥ over nuclear representations of XXX as above, and is +∞+\infty+∞ if there is no such representation.

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