Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Positive-P states and their local canonical transforms are separable

Open
QAlgorithms.Papers.Independent.Intakenext100.P92.positivePSeparability

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

prove2quantum

Let ρ\rhoρ be any normalized density on the completed two-oscillator space that admits a coherent-product representation by a Borel probability measure μ\muμ on C2\mathbb C^2C2:

ρ=∫∣z1⟩⟨z1∣⊗∣z2⟩⟨z2∣ dμ(z1,z2).\rho=\int |z_1\rangle\langle z_1|\otimes|z_2\rangle\langle z_2|\,d\mu(z_1,z_2).ρ=∫∣z1​⟩⟨z1​∣⊗∣z2​⟩⟨z2​∣dμ(z1​,z2​).

Then ρ\rhoρ is separable in the trace-norm closed convex hull of product densities. For every pair of zero-displacement local symplectic implementing unitaries U1,U2U_1,U_2U1​,U2​, the density (U1⊗U2)ρ(U1⊗U2)†(U_1\otimes U_2)\rho(U_1\otimes U_2)^\dagger(U1​⊗U2​)ρ(U1​⊗U2​)† is separable as well. This applies to arbitrary, possibly singular positive P measures without Gaussianity or finite-energy assumptions.

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

/-- PDF pp.4--5: positive-P states and all their local canonical transforms
are separable, with no Gaussian, energy, or finite-moment restriction. -/
theorem positivePSeparability (rho : TwoKernel) (hclass : IsClassicalTwo rho) :
    IsSeparable rho ∧
    ∀ U1 U2 : AffineMultimodeGaussianUnitary 1,
      U1.displacement = 0 → U2.displacement = 0 →
        IsSeparable (localStateAction U1 U2 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, PDF pp.4–5: classical states and their local canonical transforms 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. For any label set LLL, call XXX a density if Xij=∑r′ur(i)vr(j)‾X_{ij}=\sum'_r u_r(i)\overline{v_r(j)}Xij​=∑r′​ur​(i)vr​(j)​ with ur,vr∈ℓ2(L;C)u_r,v_r\in\ell^2(L;\mathbb C)ur​,vr​∈ℓ2(L;C), ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, all finite quadratic forms real and nonnegative, and a summable real diagonal of sum 111. Assume that ρ\rhoρ is a density and that there is a probability measure μ\muμ on C2\mathbb C^2C2 for which every entry of

Pz(m,n)=cz0(m0)cz0(n0)‾cz1(m1)cz1(n1)‾,cα(j)=e−∣α∣2/2αjj!,P_z(m,n)=c_{z_0}(m_0)\overline{c_{z_0}(n_0)} c_{z_1}(m_1)\overline{c_{z_1}(n_1)},\qquad c_\alpha(j)=e^{-|\alpha|^2/2}\frac{\alpha^j}{\sqrt{j!}},Pz​(m,n)=cz0​​(m0​)cz0​​(n0​)​cz1​​(m1​)cz1​​(n1​)​,cα​(j)=e−∣α∣2/2j!​αj​,

is integrable and ρmn=∫Pz(m,n) dμ(z)\rho_{mn}=\int P_z(m,n)\,d\mu(z)ρmn​=∫Pz​(m,n)dμ(z). Define τ(X)\tau(X)τ(X) as the infimum of ∑r∥ur∥∥vr∥\sum_r\|u_r\|\|v_r\|∑r​∥ur​∥∥vr​∥ over the above nuclear representations, or +∞+\infty+∞ if none exists, and call a two-mode kernel separable when, for each ε>0\varepsilon>0ε>0, some finite convex mixture Y=∑rwr(Ar⊗Br)Y=\sum_r w_r(A^r\otimes B^r)Y=∑r​wr​(Ar⊗Br) of one-mode densities satisfies τ(X−Y)<ε\tau(X-Y)<\varepsilonτ(X−Y)<ε, with tensor entries AijrBklrA^r_{ij}B^r_{kl}Aijr​Bklr​. Then ρ\rhoρ is separable, and the following further assertion holds for every pair of affine one-mode Gaussian unitary structures U1,U2U_1,U_2U1​,U2​ whose displacement vectors are zero. Explicitly, each such structure consists of a real matrix SjS_jSj​ with SjJSjT=JS_jJS_j^\mathsf T=JSj​JSjT​=J, J=(01−10)J=\begin{pmatrix}0&1\\-1&0\end{pmatrix}J=(0−1​10​), a displacement vector δj∈R2\delta_j\in\mathbb R^2δj​∈R2, and a surjective complex linear isometry Uj\mathcal U_jUj​ of ℓ2(N;C)\ell^2(\mathbb N;\mathbb C)ℓ2(N;C), satisfying

Cu(Uj−1)(Dz(v))=eiδjTvDz(SjTv)for every v∈R2,\mathcal C_{u(\mathcal U_j^{-1})}(D_{z(v)}) =e^{i\delta_j^\mathsf Tv}D_{z(S_j^\mathsf Tv)} \quad\text{for every }v\in\mathbb R^2,Cu(Uj−1​)​(Dz(v)​)=eiδjT​vDz(SjT​v)​for every v∈R2,

where u(U)mn=(Uen)(m)u(\mathcal U)_{mn}=(\mathcal U e_n)(m)u(U)mn​=(Uen​)(m), ene_nen​ is the sequence equal to 111 at nnn and zero elsewhere,

z(v)=−v1+iv02,Dz(m,n)=e−∣z∣2/2m! n!∑r=0min⁡(m,n)zm−r(−z‾)n−rr!(m−r)!(n−r)!,z(v)=\frac{-v_1+iv_0}{\sqrt2},\qquad 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)!},z(v)=2​−v1​+iv0​​,Dz​(m,n)=e−∣z∣2/2m!n!​r=0∑min(m,n)​r!(m−r)!(n−r)!zm−r(−z)n−r​,

and CK(X)mn=∑a′Kma(∑b′XabKnb‾)\mathcal C_K(X)_{mn}=\sum'_a K_{ma}\bigl(\sum'_b X_{ab}\overline{K_{nb}}\bigr)CK​(X)mn​=∑a′​Kma​(∑b′​Xab​Knb​​). Under δ1=δ2=0\delta_1=\delta_2=0δ1​=δ2​=0, the kernel CK(ρ)\mathcal C_K(\rho)CK​(ρ) is separable, where

Kmn=u(U1)m0n0 u(U2)m1n1.K_{mn}=u(\mathcal U_1)_{m_0n_0}\,u(\mathcal U_2)_{m_1n_1}.Kmn​=u(U1​)m0​n0​​u(U2​)m1​n1​​.

All primed sums here are total sums, assigned zero when their summands are not summable.

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