Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Separability is invariant at every positive iteration

Open
QAlgorithms.Papers.Independent.Intakenext100.P68.separabilityInvariance

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

prove2quantum

Let n,m≥1n,m\ge1n,m≥1 be finite local mode counts, with interleaved quadratures (X1,P1,…)(X_1,P_1,\ldots)(X1​,P1​,…), [Xj,Pj]=i[X_j,P_j]=i[Xj​,Pj​]=i, and doubled covariance γab=2Re⁡⟨(Ra−da)(Rb−db)⟩\gamma_{ab}=2\operatorname{Re}\langle(R_a-d_a)(R_b-d_b)\rangleγab​=2Re⟨(Ra​−da​)(Rb​−db​)⟩. Thus vacuum covariance is III. Put Jr=⨁j=1r(0−110)J_r=\bigoplus_{j=1}^r\begin{pmatrix}0&-1\\1&0\end{pmatrix}Jr​=⨁j=1r​(01​−10​). A covariance matrix (CM) is real symmetric and satisfies γ−iJ⪰0\gamma-iJ\succeq0γ−iJ⪰0. All inequalities below are Loewner inequalities.

Let γ0=(A0C0C0TB0)\gamma_0=\begin{pmatrix}A_0&C_0\\C_0^T&B_0\end{pmatrix}γ0​=(A0​C0T​​C0​B0​​) be a physical n∣mn|mn∣m CM. Construct the sequence as follows: a nonphysical matrix is followed by zero; otherwise put Xj=Cj(Bj−iJ)+CjTX_j=C_j(B_j-iJ)^+C_j^TXj​=Cj​(Bj​−iJ)+CjT​, Aj+1=Bj+1=Aj−Re⁡XjA_{j+1}=B_{j+1}=A_j-\operatorname{Re}X_jAj+1​=Bj+1​=Aj​−ReXj​, and Cj+1=−Im⁡XjC_{j+1}=-\operatorname{Im}X_jCj+1​=−ImXj​. All inverses are spectral Moore–Penrose inverses. Every positive-index matrix has split n∣nn|nn∣n. Set Lj=Aj−∥Cj∥opIL_j=A_j-\|C_j\|_{\mathrm{op}}ILj​=Aj​−∥Cj​∥op​I for j≥1j\ge1j≥1, where the norm is Euclidean induced. Separability always means the trace-norm closed convex hull of full oscillator product densities, independently of covariance witness inequalities.

Say that a bipartite covariance is separable when it is the covariance of some actual normalized separable Gaussian density, with arbitrary first moments. For every individual N≥1N\ge1N≥1,

γ0 is separable⟺γN is separable.\gamma_0\text{ is separable}\quad\Longleftrightarrow\quad\gamma_N\text{ is separable}.γ0​ is separable⟺γN​ is separable.

The right-hand side includes validity as a physical covariance. This relates the constructed iterates to full state separability rather than defining separability by matrix witnesses.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P68
Formal statement
noncomputable section

open MeasureTheory Filter

open scoped BigOperators Topology ComplexOrder

namespace QAlgorithms.Papers.Independent.Intakenext100.P68

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Dependency50.P33
  (State PureState IsSeparable IsBarycenter productCoeff)

open QAlgorithms.Papers.Independent.Dependency50.P10 (complexify)

open QAlgorithms.Papers.Independent.Frontier30.P08 (QuadratureIndex)

open QAlgorithms.Papers.Independent.Claimed50.P19 (Cov)

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

/-- PDF p.2 immediately above Thm.1: separability of actual Gaussian densities
is invariant at every individual positive iteration, including physicality. -/
theorem separabilityInvariance {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
    (g : CovarianceBlocks n m) (hg : IsPhysicalCovariance g) :
    ∀ k : ℕ, SeparableCM g ↔ SeparableCM (tail g k) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P68

end
Source
Separability Criterion for all bipartite Gaussian States, arXiv:quant-ph/0104050v1, PDF p. 2, Unnumbered result immediately before Theorem 1
Read-back

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

Let n,m>0n,m>0n,m>0 be natural numbers and let g=(A,B,C)g=(A,B,C)g=(A,B,C) be a real block triple of sizes 2n,2m2n,2m2n,2m. For each rrr, let Jr=⨁j=1r(0−110)J_r=\bigoplus_{j=1}^r\begin{pmatrix}0&-1\\1&0\end{pmatrix}Jr​=⨁j=1r​(01​−10​), and for a triple hhh with r,sr,sr,s modes let Hh=(AhChChTBh)H_h=\begin{pmatrix}A_h&C_h\\C_h^{\mathsf T}&B_h\end{pmatrix}Hh​=(Ah​ChT​​Ch​Bh​​). Assume HgH_gHg​ is symmetric and Hg−i(Jn⊕Jm)⪰0H_g-i(J_n\oplus J_m)\succeq0Hg​−i(Jn​⊕Jm​)⪰0, using entrywise complexification. Define M♯M^\sharpM♯ to be the Hermitian spectral functional calculus t↦t−1t\mapsto t^{-1}t↦t−1, with 0−1=00^{-1}=00−1=0, or zero if MMM is not Hermitian. Define Xh=Ch(Bh−iJs)♯ChTX_h=C_h(B_h-iJ_s)^\sharp C_h^{\mathsf T}Xh​=Ch​(Bh​−iJs​)♯ChT​, and define T(h)=(Ah−Re⁡Xh,Ah−Re⁡Xh,−Im⁡Xh)T(h)=(A_h-\operatorname{Re}X_h,A_h-\operatorname{Re}X_h,-\operatorname{Im}X_h)T(h)=(Ah​−ReXh​,Ah​−ReXh​,−ImXh​) when HhH_hHh​ is symmetric and Hh−i(Jr⊕Js)⪰0H_h-i(J_r\oplus J_s)\succeq0Hh​−i(Jr​⊕Js​)⪰0, and T(h)=(0,0,0)T(h)=(0,0,0)T(h)=(0,0,0) otherwise. Set h0=T(g)h_0=T(g)h0​=T(g), hk+1=T(hk)h_{k+1}=T(h_k)hk+1​=T(hk​). The separability condition on any such hhh means the following explicit existence statement. There are a coefficient matrix ρ\rhoρ indexed by Nr×Ns\mathbb N^r\times\mathbb N^sNr×Ns and a real vector ddd indexed by the two interleaved coordinates of every mode, such that ρ\rhoρ is a density matrix, HhH_hHh​ is symmetric, Hh−i(Jr⊕Js)⪰0H_h-i(J_r\oplus J_s)\succeq0Hh​−i(Jr​⊕Js​)⪰0, and ρ\rhoρ has the Gaussian characteristic function specified below and is approximable by finite convex combinations of product density matrices in the gauge specified below. A density matrix on an index set LLL means a matrix RRR admitting an expansion Rij=∑a=0∞ua(i)va(j)‾R_{ij}=\sum_{a=0}^\infty u_a(i)\overline{v_a(j)}Rij​=∑a=0∞​ua​(i)va​(j)​ with ua,va∈ℓ2(L;C)u_a,v_a\in\ell^2(L;\mathbb C)ua​,va​∈ℓ2(L;C) and ∑a∥ua∥∥va∥<∞\sum_a\|u_a\|\|v_a\|<\infty∑a​∥ua​∥∥va​∥<∞, such that every finite quadratic form ∑i,j∈Fzi‾Rijzj\sum_{i,j\in F}\overline{z_i}R_{ij}z_j∑i,j∈F​zi​​Rij​zj​ is real and nonnegative, and the real diagonal is summable with sum 111. For any matrix ZZZ, let τ(Z)\tau(Z)τ(Z) be the infimum, over all such expansions of ZZZ, of ∑a∥ua∥∥va∥\sum_a\|u_a\|\|v_a\|∑a​∥ua​∥∥va​∥, valued in [0,∞][0,\infty][0,∞], with value +∞+\infty+∞ when there is no expansion. The approximation requirement is that for every ε>0\varepsilon>0ε>0 there is a finite convex combination YYY of matrices R⊗SR\otimes SR⊗S, with R,SR,SR,S density matrices on Nr,Ns\mathbb N^r,\mathbb N^sNr,Ns, such that τ(ρ−Y)<ε\tau(\rho-Y)<\varepsilonτ(ρ−Y)<ε. To specify the characteristic function, define

Dz(a,b)=e−∣z∣2/2a! b!∑j=0min⁡(a,b)za−j(−z‾)b−jj!(a−j)!(b−j)!.D_z(a,b)=e^{-|z|^2/2}\sqrt{a!\,b!} \sum_{j=0}^{\min(a,b)} \frac{z^{a-j}(-\overline z)^{b-j}}{j!(a-j)!(b-j)!}.Dz​(a,b)=e−∣z∣2/2a!b!​j=0∑min(a,b)​j!(a−j)!(b−j)!za−j(−z)b−j​.

For an interleaved real vector ttt, let Wt(v,u)W_t(v,u)Wt​(v,u) be the product, over all first and second subsystem modes, of D−(tj,0+itj,1)/2(vj,uj)D_{-(t_{j,0}+it_{j,1})/\sqrt2}(v_j,u_j)D−(tj,0​+itj,1​)/2​​(vj​,uj​). For every ttt, each inner sum and the outer sum in χρ(t)=∑u∑vρuvWt(v,u)\chi_\rho(t)=\sum_u\sum_v\rho_{uv}W_t(v,u)χρ​(t)=∑u​∑v​ρuv​Wt​(v,u) must be summable, and, writing J=Jr⊕JsJ=J_r\oplus J_sJ=Jr​⊕Js​, they must satisfy χρ(t)=exp⁡(−tTJTHhJt/4−itTJd)\chi_\rho(t)=\exp(-t^{\mathsf T}J^{\mathsf T}H_hJt/4-it^{\mathsf T}Jd)χρ​(t)=exp(−tTJTHh​Jt/4−itTJd). With this meaning of the separability condition, the declaration says that for every natural number kkk, including 000, the condition holds for ggg if and only if it holds for hkh_khk​, whose subsystem sizes are n,nn,nn,n.

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