Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Forward transport of physical local covariance witnesses

Open
QAlgorithms.Papers.Independent.Intakenext100.P68.forwardTransport

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.

For each N≥0N\ge0N≥0, let UUU and VVV be local CMs of the corresponding block sizes: UUU has nnn modes and VVV has mmm modes at N=0N=0N=0, or nnn modes at N≥1N\ge1N≥1. Then

γN⪰U⊕V⟹γN+1⪰U⊕U.\gamma_N\succeq U\oplus V\quad\Longrightarrow\quad\gamma_{N+1}\succeq U\oplus U.γN​⪰U⊕V⟹γN+1​⪰U⊕U.

This transports local witnesses forward, without requiring strict positivity or invertibility.

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, Proposition 1, for N=0 and N=k+1 respectively.
Both local witnesses are CMs; singular matrices are included. -/
theorem forwardTransport {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
    (g : CovarianceBlocks n m) (hg : IsPhysicalCovariance g) :
    (∀ (U : Cov n) (V : Cov m), IsCM U → IsCM V → DominatesLocalCovariances g U V →
      DominatesLocalCovariances (covarianceStep g) U U) ∧
    (∀ (k : ℕ) (U V : Cov n), IsCM U → IsCM V →
      DominatesLocalCovariances (tail g k) U V → DominatesLocalCovariances (tail g (k + 1)) U U) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P68

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

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

For all positive natural numbers n,mn,mn,m, put Qr=Fin⁡r×{0,1}Q_r=\operatorname{Fin}r\times\{0,1\}Qr​=Finr×{0,1}, and let g=(A,B,C)g=(A,B,C)g=(A,B,C) consist of real blocks with sizes Qn,QmQ_n,Q_mQn​,Qm​. Define JrJ_rJr​ to have entries J(a,0),(a,1)=−1J_{(a,0),(a,1)}=-1J(a,0),(a,1)​=−1, J(a,1),(a,0)=1J_{(a,1),(a,0)}=1J(a,1),(a,0)​=1, and zero otherwise. Assume

Gg=(ACCTB)is symmetric andGg−i(Jn⊕Jm)⪰0.G_g=\begin{pmatrix}A&C\\C^{\mathsf T}&B\end{pmatrix} \quad\text{is symmetric and}\quad G_g-i(J_n\oplus J_m)\succeq0.Gg​=(ACT​CB​)is symmetric andGg​−i(Jn​⊕Jm​)⪰0.

For any real square matrix UUU on QrQ_rQr​, write Cr(U)\mathcal C_r(U)Cr​(U) for the conjunction UT=UU^{\mathsf T}=UUT=U and U−iJr⪰0U-iJ_r\succeq0U−iJr​⪰0. For a block triple h=(Ah,Bh,Ch)h=(A_h,B_h,C_h)h=(Ah​,Bh​,Ch​) of sizes Qa,QbQ_a,Q_bQa​,Qb​, write

D(h,U,V):(Ah−UChChTBh−V)⪰0,\mathcal D(h,U,V): \quad \begin{pmatrix}A_h-U&C_h\\C_h^{\mathsf T}&B_h-V\end{pmatrix}\succeq0,D(h,U,V):(Ah​−UChT​​Ch​Bh​−V​)⪰0,

where this last positivity condition is for a real matrix. Define H(M)=0H(M)=0H(M)=0 when MMM is not Hermitian, and otherwise apply the reciprocal function to its eigenvalues, assigning zero to a zero eigenvalue. Define F(h)F(h)F(h) to be the zero triple if GhG_hGh​ is not symmetric or Gh−i(Ja⊕Jb)G_h-i(J_a\oplus J_b)Gh​−i(Ja​⊕Jb​) is not positive semidefinite; otherwise, putting Zh=ChH(Bh−iJb)ChTZ_h=C_hH(B_h-iJ_b)C_h^{\mathsf T}Zh​=Ch​H(Bh​−iJb​)ChT​, define F(h)=(Ah−Re⁡Zh, Ah−Re⁡Zh, −Im⁡Zh)F(h)=(A_h-\operatorname{Re}Z_h,\ A_h-\operatorname{Re}Z_h,\ -\operatorname{Im}Z_h)F(h)=(Ah​−ReZh​, Ah​−ReZh​, −ImZh​). Let T0=F(g)T_0=F(g)T0​=F(g) and Tk+1=F(Tk)T_{k+1}=F(T_k)Tk+1​=F(Tk​). The theorem asserts the conjunction

∀U∈RQn×Qn ∀V∈RQm×Qm,Cn(U)∧Cm(V)∧D(g,U,V) ⟹ D(F(g),U,U),∀k∈N ∀U,V∈RQn×Qn,Cn(U)∧Cn(V)∧D(Tk,U,V) ⟹ D(Tk+1,U,U).\begin{aligned} &\forall U\in\mathbb R^{Q_n\times Q_n}\ \forall V\in\mathbb R^{Q_m\times Q_m}, &&\mathcal C_n(U)\land\mathcal C_m(V)\land\mathcal D(g,U,V) \ \Longrightarrow\ \mathcal D(F(g),U,U),\\ &\forall k\in\mathbb N\ \forall U,V\in\mathbb R^{Q_n\times Q_n}, &&\mathcal C_n(U)\land\mathcal C_n(V)\land\mathcal D(T_k,U,V) \ \Longrightarrow\ \mathcal D(T_{k+1},U,U). \end{aligned}​∀U∈RQn​×Qn​ ∀V∈RQm​×Qm​,∀k∈N ∀U,V∈RQn​×Qn​,​​Cn​(U)∧Cm​(V)∧D(g,U,V) ⟹ D(F(g),U,U),Cn​(U)∧Cn​(V)∧D(Tk​,U,V) ⟹ D(Tk+1​,U,U).​

The second assertion includes k=0k=0k=0, so it already applies between the first and second updated triples.

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