Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite stopping under a strict local uncertainty margin

Open
QAlgorithms.Papers.Independent.Intakenext100.P68.strictMarginFiniteStopping

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 U,VU,VU,V be physical local CMs satisfying γ0⪰U⊕V\gamma_0\succeq U\oplus Vγ0​⪰U⊕V. Assume ϵ>0\epsilon>0ϵ>0 and U⪰iJ+ϵIU\succeq iJ+\epsilon IU⪰iJ+ϵI. Writing ∥A∥tr=tr⁡A†A\|A\|_{\mathrm{tr}}=\operatorname{tr}\sqrt{A^\dagger A}∥A∥tr​=trA†A​, there exists an integer N≥1N\ge1N≥1 such that

N<∥A0∥tr−2nϵ+1,LN⪰iJ.N<\frac{\|A_0\|_{\mathrm{tr}}-2n}{\epsilon}+1,\qquad L_N\succeq iJ.N<ϵ∥A0​∥tr​−2n​+1,LN​⪰iJ.

The strict cutoff is a real number, with the displayed +1+1+1 retained. This is a finite stopping guarantee for the stated local margin, not for every separable boundary covariance.

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.3, Proposition 3: epsilon is positive as in the preceding paragraph.
The stopping index is N=k+1; the strict real bound and +1 in (8) are retained,
without rounding. Condition (6) is >=iJ, not the proof's >=0 typo. -/
theorem strictMarginFiniteStopping {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
    (g : CovarianceBlocks n m) (hg : IsPhysicalCovariance g) (U : Cov n) (V : Cov m)
    (hU : IsCM U) (hV : IsCM V) (hdom : DominatesLocalCovariances g U V)
    (epsilon : ℝ) (hepsilon : 0 < epsilon)
    (hmargin : (complexify U - Complex.I • complexify (interleavedJ n) -
      (epsilon : ℂ) • (1 : Matrix (QuadratureIndex n) (QuadratureIndex n) ℂ)).PosSemidef) :
    ∃ k : ℕ, ((k + 1 : ℕ) : ℝ) <
      (QAlgorithms.traceNorm (complexify g.A) - 2 * (n : ℝ)) / epsilon + 1 ∧
      Uncertainty (lowerWitness (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. 3, Proposition 3, Eq.(8)
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 of sizes 2n,2m2n,2m2n,2m. Write Jr=⨁j=1r(0−110)J_r=\bigoplus_{j=1}^r\begin{pmatrix}0&-1\\1&0\end{pmatrix}Jr​=⨁j=1r​(01​−10​), Hh=(AhChChTBh)H_h=\begin{pmatrix}A_h&C_h\\C_h^{\mathsf T}&B_h\end{pmatrix}Hh​=(Ah​ChT​​Ch​Bh​​), and embed real matrices entrywise into complex matrices. Assume HgH_gHg​ is symmetric and Hg−i(Jn⊕Jm)⪰0H_g-i(J_n\oplus J_m)\succeq0Hg​−i(Jn​⊕Jm​)⪰0. Let U,VU,VU,V be real symmetric matrices of sizes 2n,2m2n,2m2n,2m satisfying U−iJn⪰0U-iJ_n\succeq0U−iJn​⪰0, V−iJm⪰0V-iJ_m\succeq0V−iJm​⪰0, and Hg−diag⁡(U,V)⪰0H_g-\operatorname{diag}(U,V)\succeq0Hg​−diag(U,V)⪰0. Let ε>0\varepsilon>0ε>0 and additionally assume U−iJn−εI2n⪰0U-iJ_n-\varepsilon I_{2n}\succeq0U−iJn​−εI2n​⪰0. For a Hermitian matrix MMM, define M♯M^\sharpM♯ by spectral functional calculus with t↦t−1t\mapsto t^{-1}t↦t−1, taking 0−1=00^{-1}=00−1=0, and set M♯=0M^\sharp=0M♯=0 for non-Hermitian MMM. 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 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 zero in all blocks 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​), and Lk=Ahk−∥Chk∥opI2nL_k=A_{h_k}-\|C_{h_k}\|_{\mathrm{op}}I_{2n}Lk​=Ahk​​−∥Chk​​∥op​I2n​, using the real Euclidean operator norm. Define ∥M∥1=Re⁡tr⁡M∗M\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^*M}∥M∥1​=RetrM∗M​, with the square root given by continuous functional calculus. Then there exists a natural number kkk, possibly 000, such that

k+1<∥A∥1−2nε+1andLk−iJn⪰0.k+1<\frac{\|A\|_1-2n}{\varepsilon}+1 \qquad\text{and}\qquad L_k-iJ_n\succeq0.k+1<ε∥A∥1​−2n​+1andLk​−iJn​⪰0.

The bound on k+1k+1k+1 is strict.

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