Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Commuting nonlocal quadratures obey a separable variance bound

Open
QAlgorithms.Papers.Independent.Intakenext100.P92.commutingExample

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

prove2quantum

For two canonical oscillators with [qj,pk]=iδjk[q_j,p_k]=i\delta_{jk}[qj​,pk​]=iδjk​, put X=q1+p1+q2+p2X=q_1+p_1+q_2+p_2X=q1​+p1​+q2​+p2​ and Y=q1−p1−q2+p2Y=q_1-p_1-q_2+p_2Y=q1​−p1​−q2​+p2​. For every normalized separable density ρ\rhoρ with finite first and second moments,

[X,Y]ψ=0for every finite-particle vector ψ,Var⁡ρ(X)+Var⁡ρ(Y)≥4.[X,Y]\psi=0\quad\text{for every finite-particle vector }\psi,\qquad \operatorname{Var}_\rho(X)+\operatorname{Var}_\rho(Y)\ge4.[X,Y]ψ=0for every finite-particle vector ψ,Varρ​(X)+Varρ​(Y)≥4.

The variances are the quadratic forms of the actual half-anticommutator covariance of ρ\rhoρ, not standard deviations. This example shows that separability constrains even commuting nonlocal observables.

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 p.3 example following (11): the commutator is zero on the common
finite-particle core, but separable states have variance sum at least four.
The source's x_j denotes its previously introduced q_j. -/
theorem commutingExample (rho : TwoKernel) (d : (modePhase 2) → ℝ) (V : Covariance 2)
    (hmom : TwoModeMoments rho d V) (hsep : IsSeparable rho) :
    (∀ psi : (ℕ × ℕ) →₀ ℂ,
      linearAction exampleX (linearAction exampleY psi) -
        linearAction exampleY (linearAction exampleX psi) = 0) ∧
    4 ≤ quadratureVariance V exampleX + quadratureVariance V exampleY := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P92

end
Source
Peres-Horodecki separability criterion for continuous variable systems, arXiv:quant-ph/9909044v1, PDF p. 3, PDF p.3: commuting nonlocal observables have separable variance sum at least four
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 coordinates ordered as (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 it has a representation 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) and ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, every finite quadratic form is real and nonnegative, and the real diagonal is summable with sum 111. Assume that ρ\rhoρ is such a density, VVV is symmetric, and ∑m′max⁡{(m0+m1)Re⁡ρmm,0}<∞\sum'_m\max\{(m_0+m_1)\operatorname{Re}\rho_{mm},0\}<\infty∑m′​max{(m0​+m1​)Reρmm​,0}<∞. 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,χρ(x)=∑m′∑n′ρmnDz0(x)(n0,m0)Dz1(x)(n1,m1).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},\quad \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).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∑′​ρmn​Dz0​(x)​(n0​,m0​)Dz1​(x)​(n1​,m1​).

Each primed sum is assigned zero if its summand is not summable. Assume, for every xxx, that fx(t)=χρ(tx)f_x(t)=\chi_\rho(tx)fx​(t)=χρ​(tx) has derivative i dTxi\,d^\mathsf TxidTx at 000, and that its total derivative function, assigned zero where no derivative exists, has derivative −xTVx−(dTx)2-x^\mathsf TVx-(d^\mathsf Tx)^2−xTVx−(dTx)2 at 000. Also assume that ρ\rhoρ is separable: for every ε>0\varepsilon>0ε>0, there is a finite convex mixture Y=∑rwr(Ar⊗Br)Y=\sum_r w_r(A^r\otimes B^r)Y=∑r​wr​(Ar⊗Br) of density kernels on N\mathbb NN, with tensor entries AijrBklrA^r_{ij}B^r_{kl}Aijr​Bklr​, for which τ(ρ−Y)<ε\tau(\rho-Y)<\varepsilonτ(ρ−Y)<ε; here τ(X)\tau(X)τ(X) is the infimum of ∑r∥ur∥∥vr∥\sum_r\|u_r\|\|v_r\|∑r​∥ur​∥∥vr​∥ over the stated nuclear representations, or +∞+\infty+∞ if none exists. For a sequence ψ:N2→C\psi:\mathbb N^2\to\mathbb Cψ:N2→C, define

(akψ)(m)=mk+1 ψ(m+ek),(ak†ψ)(m)={0,mk=0,mk ψ(m−ek),mk>0,(a_k\psi)(m)=\sqrt{m_k+1}\,\psi(m+e_k),\qquad (a_k^\dagger\psi)(m)= \begin{cases}0,&m_k=0,\\ \sqrt{m_k}\,\psi(m-e_k),&m_k>0,\end{cases}(ak​ψ)(m)=mk​+1​ψ(m+ek​),(ak†​ψ)(m)={0,mk​​ψ(m−ek​),​mk​=0,mk​>0,​ qk=ak+ak†2,pk=ak−ak†i2,Lx=∑k=01(xk,0qk+xk,1pk).q_k=\frac{a_k+a_k^\dagger}{\sqrt2},\qquad p_k=\frac{a_k-a_k^\dagger}{i\sqrt2},\qquad L_x=\sum_{k=0}^1(x_{k,0}q_k+x_{k,1}p_k).qk​=2​ak​+ak†​​,pk​=i2​ak​−ak†​​,Lx​=k=0∑1​(xk,0​qk​+xk,1​pk​).

For x=(1,1,1,1)x=(1,1,1,1)x=(1,1,1,1) and y=(1,−1,−1,1)y=(1,-1,-1,1)y=(1,−1,−1,1), every finitely supported complex sequence ψ\psiψ satisfies

Lx(Lyψ)−Ly(Lxψ)=0,and4≤xTVx+yTVy.L_x(L_y\psi)-L_y(L_x\psi)=0, \qquad\text{and}\qquad 4\le x^\mathsf TVx+y^\mathsf TVy.Lx​(Ly​ψ)−Ly​(Lx​ψ)=0,and4≤xTVx+yTVy.
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