Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Symmetric local witness from backward transport

Open
QAlgorithms.Papers.Independent.Intakenext100.P68.symmetricBackwardWitness

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.

Let N≥1N\ge1N≥1 and let UUU be a CM such that γN+1⪰U⊕U\gamma_{N+1}\succeq U\oplus UγN+1​⪰U⊕U. Construct V=BN−CNT(AN−U)+CNV=B_N-C_N^T(A_N-U)^+C_NV=BN​−CNT​(AN​−U)+CN​ and U~=(U+V)/2\widetilde U=(U+V)/2U=(U+V)/2. Then

U~ is a CM,γN⪰U~⊕U~.\widetilde U\text{ is a CM},\qquad\gamma_N\succeq\widetilde U\oplus\widetilde U.U is a CM,γN​⪰U⊕U.

This provides the symmetric witness needed in the positive-index backward recursion.

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, Corollary 1: N=k+1 >= 1. The second witness is the corrected
constructed Eq.(5) object, not an independently quantified matrix. -/
theorem symmetricBackwardWitness {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
    (g : CovarianceBlocks n m) (hg : IsPhysicalCovariance g) (k : ℕ) (U : Cov n)
    (hU : IsCM U) (hdom : DominatesLocalCovariances (tail g (k + 1)) U U) :
    IsCM (averageWitness (tail g k) U) ∧
      DominatesLocalCovariances (tail g k) (averageWitness (tail g k) U)
        (averageWitness (tail g k) 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, Corollary 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 g=(A,B,C)g=(A,B,C)g=(A,B,C) a real block triple with block sizes 2n,2m2n,2m2n,2m, indexed within each subsystem by a mode and a coordinate in {0,1}\{0,1\}{0,1}. 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​) and Hh=(AhChChTBh)H_h=\begin{pmatrix}A_h&C_h\\C_h^{\mathsf T}&B_h\end{pmatrix}Hh​=(Ah​ChT​​Ch​Bh​​) for any block triple hhh. Assume HgH_gHg​ is symmetric and Hg−i(Jn⊕Jm)⪰0H_g-i(J_n\oplus J_m)\succeq0Hg​−i(Jn​⊕Jm​)⪰0. Here and below real matrices in complex expressions are embedded entrywise into C\mathbb CC. Write M♯M^\sharpM♯ for the spectral functional calculus t↦t−1t\mapsto t^{-1}t↦t−1, with 0−1=00^{-1}=00−1=0, when MMM is Hermitian, and for zero otherwise. For hhh with r,sr,sr,s modes, put Xh=Ch(Bh−iJs)♯ChTX_h=C_h(B_h-iJ_s)^\sharp C_h^{\mathsf T}Xh​=Ch​(Bh​−iJs​)♯ChT​, and let T(h)T(h)T(h) have both diagonal blocks Ah−Re⁡XhA_h-\operatorname{Re}X_hAh​−ReXh​ and cross block −Im⁡Xh-\operatorname{Im}X_h−ImXh​ if HhH_hHh​ is symmetric and Hh−i(Jr⊕Js)⪰0H_h-i(J_r\oplus J_s)\succeq0Hh​−i(Jr​⊕Js​)⪰0; otherwise let all three blocks of T(h)T(h)T(h) be zero. Define h0=T(g)h_0=T(g)h0​=T(g), hj+1=T(hj)h_{j+1}=T(h_j)hj+1​=T(hj​). For every natural number kkk, including 000, and every real symmetric 2n×2n2n\times2n2n×2n matrix UUU such that U−iJn⪰0U-iJ_n\succeq0U−iJn​⪰0 and Hhk+1−diag⁡(U,U)⪰0H_{h_{k+1}}-\operatorname{diag}(U,U)\succeq0Hhk+1​​−diag(U,U)⪰0, set

W=12(U+Bhk−ChkT(Ahk−U)♯Chk).W=\frac12\left(U+B_{h_k}-C_{h_k}^{\mathsf T}(A_{h_k}-U)^\sharp C_{h_k}\right).W=21​(U+Bhk​​−Chk​T​(Ahk​​−U)♯Chk​​).

Then WWW is symmetric, W−iJn⪰0W-iJ_n\succeq0W−iJn​⪰0, and Hhk−diag⁡(W,W)⪰0H_{h_k}-\operatorname{diag}(W,W)\succeq0Hhk​​−diag(W,W)⪰0.

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