Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A small positive identity perturbation avoids the finite acceptance test

Open
QAlgorithms.Papers.Independent.Intakenext100.P68.perturbedInseparableAvoidsAcceptance

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.

If the physical input γ\gammaγ is inseparable, there exists ϵ>0\epsilon>0ϵ>0 such that, when the iteration is initialized at γ0=γ+ϵI\gamma_0=\gamma+\epsilon Iγ0​=γ+ϵI, every integer N≥1N\ge1N≥1 satisfies

N≤∥A0∥tr−2nϵ⟹LN⪰̸iJ.N\le\frac{\|A_0\|_{\mathrm{tr}}-2n}{\epsilon} \quad\Longrightarrow\quad L_N\not\succeq iJ.N≤ϵ∥A0​∥tr​−2n​⟹LN​⪰iJ.

Here A0A_0A0​ is the first local block of the perturbed input. The cutoff has no +1+1+1. This is an existential one-way statement about the perturbed initialization.

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, Corollary 2: existential noise, one-way finite absence test on
the perturbed initialization. The real cutoff has NO +1. -/
theorem perturbedInseparableAvoidsAcceptance {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
    (g : CovarianceBlocks n m) (hg : IsPhysicalCovariance g) (hsep : ¬ SeparableCM g) :
    ∃ epsilon : ℝ, 0 < epsilon ∧
      let g0 : CovarianceBlocks n m :=
        { A := g.A + epsilon • (1 : Cov n)
          B := g.B + epsilon • (1 : Cov m)
          C := g.C }
      ∀ k : ℕ, ((k + 1 : ℕ) : ℝ) ≤
        (QAlgorithms.traceNorm (complexify g0.A) - 2 * (n : ℝ)) / epsilon →
        ¬ Uncertainty (lowerWitness (tail g0 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, Corollary 2
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. 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​​), and assume HgH_gHg​ is symmetric and Hg−i(Jn⊕Jm)⪰0H_g-i(J_n\oplus J_m)\succeq0Hg​−i(Jn​⊕Jm​)⪰0, with entrywise complexification. Assume there is no density state ρ\rhoρ on Nn×Nm\mathbb N^n\times\mathbb N^mNn×Nm and real interleaved displacement vector ddd having both the following Gaussian and separability properties. A density state on an index set KKK means a matrix admitting a nuclear expansion Rij=∑aua(i)va(j)‾R_{ij}=\sum_a u_a(i)\overline{v_a(j)}Rij​=∑a​ua​(i)va​(j)​ with ua,va∈ℓ2(K;C)u_a,v_a\in\ell^2(K;\mathbb C)ua​,va​∈ℓ2(K;C) and ∑a∥ua∥∥va∥<∞\sum_a\|u_a\|\|v_a\|<\infty∑a​∥ua​∥∥va​∥<∞, having real nonnegative finite quadratic forms and a summable real diagonal of sum 111. Let τ(Z)\tau(Z)τ(Z) be the infimum in [0,∞][0,\infty][0,∞] of the sums ∑a∥ua∥∥va∥\sum_a\|u_a\|\|v_a\|∑a​∥ua​∥∥va​∥ over nuclear expansions of ZZZ, with value +∞+\infty+∞ for no expansion. The separability property is that every η>0\eta>0η>0 admits a finite convex combination YYY of product density matrices with τ(ρ−Y)<η\tau(\rho-Y)<\etaτ(ρ−Y)<η. For the Gaussian property 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​,

let Wt(v,u)W_t(v,u)Wt​(v,u) be the product over both subsystems’ 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​), and require, for every real interleaved vector ttt, summability of every inner sum and of the outer sum in ∑u∑vρuvWt(v,u)\sum_u\sum_v\rho_{uv}W_t(v,u)∑u​∑v​ρuv​Wt​(v,u), with value exp⁡(−tTJTHgJt/4−itTJd)\exp(-t^{\mathsf T}J^{\mathsf T}H_gJt/4-it^{\mathsf T}Jd)exp(−tTJTHg​Jt/4−itTJd), where J=Jn⊕JmJ=J_n\oplus J_mJ=Jn​⊕Jm​. Then there exists ε>0\varepsilon>0ε>0 with the following property. Put g0=(A+εI2n,B+εI2m,C)g_0=(A+\varepsilon I_{2n},B+\varepsilon I_{2m},C)g0​=(A+εI2n​,B+εI2m​,C). For any block triple hhh with r,sr,sr,s modes, define M♯M^\sharpM♯ by Hermitian spectral functional calculus with t−1t^{-1}t−1, taking 0−1=00^{-1}=00−1=0, and by zero for non-Hermitian MMM; 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)=(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​) if 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(g0)h_0=T(g_0)h0​=T(g0​), 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. Writing ∥M∥1=Re⁡tr⁡M∗M\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^*M}∥M∥1​=RetrM∗M​, every natural number kkk satisfying

k+1≤∥A+εI2n∥1−2nεk+1\le\frac{\|A+\varepsilon I_{2n}\|_1-2n}{\varepsilon}k+1≤ε∥A+εI2n​∥1​−2n​

satisfies Lk−iJn⪰̸0L_k-iJ_n\not\succeq0Lk​−iJn​⪰0. Only indices satisfying this non-strict bound are constrained; if there are no such indices, the universal implication is vacuous.

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