Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Convergence of every separable input to an equal-block fixed point

Open
QAlgorithms.Papers.Independent.Intakenext100.P68.separableFixedPoint

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 γ0\gamma_0γ0​ is separable as an actual Gaussian covariance, then there is an nnn-mode CM UUU such that

lim⁡N→∞, N≥1γN=U⊕U,f(U⊕U)=U⊕U,\lim_{N\to\infty,\ N\ge1}\gamma_N=U\oplus U, \qquad f(U\oplus U)=U\oplus U,N→∞, N≥1lim​γN​=U⊕U,f(U⊕U)=U⊕U,

where fff is the source's one-step covariance map. Convergence is in the usual finite-matrix topology. There is no strict margin, convergence rate or finite stopping hypothesis. Only the positive-index tail is placed in a single fixed-size space.

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, bottom-left paragraph continued top-right: all separable inputs
converge to diag(Ainf,Ainf), a physical fixed point. No strict margin, rate or
finite stopping is assumed. Convergence uses only the fixed-size positive tail. -/
theorem separableFixedPoint {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
    (g : CovarianceBlocks n m) (hg : IsPhysicalCovariance g) (hsep : SeparableCM g) :
    ∃ U : Cov n, IsCM U ∧
      Tendsto (fun k : ℕ => covarianceBlockMatrix (tail g k)) atTop
        (nhds (realCovarianceSum U U)) ∧
      covarianceStep ({ A := U, B := U, C := 0 } : CovarianceBlocks n n) =
        ({ A := U, B := U, C := 0 } : CovarianceBlocks n n) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P68

end
Source
Separability Criterion for all bipartite Gaussian States, arXiv:quant-ph/0104050v1, PDF p. 3, Paragraph following Proposition 3, spanning both columns
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 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. Assume there exist a density state ρ\rhoρ on Nn×Nm\mathbb N^n\times\mathbb N^mNn×Nm and a real interleaved vector ddd with the following properties. Here density means that the coefficients admit 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∈ℓ2u_a,v_a\in\ell^2ua​,va​∈ℓ2 and ∑a∥ua∥∥va∥<∞\sum_a\|u_a\|\|v_a\|<\infty∑a​∥ua​∥∥va​∥<∞, every finite quadratic form is real and nonnegative, and the real diagonal is summable with sum 111. Let τ(Z)\tau(Z)τ(Z) be the infimum in [0,∞][0,\infty][0,∞] of these nuclear expansion sums, with empty infimum +∞+\infty+∞. For every η>0\eta>0η>0, assume some finite convex combination YYY of product density matrices satisfies τ(ρ−Y)<η\tau(\rho-Y)<\etaτ(ρ−Y)<η. 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​,

and 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​). For every real interleaved vector ttt, assume that each inner sum and 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) are summable and have 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​. Define M♯M^\sharpM♯ as Hermitian spectral functional calculus with t↦t−1t\mapsto t^{-1}t↦t−1, taking 0−1=00^{-1}=00−1=0, or zero 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​; 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​) if 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​). Then there exists a real symmetric 2n×2n2n\times2n2n×2n matrix UUU with U−iJn⪰0U-iJ_n\succeq0U−iJn​⪰0 such that

Hhk⟶(U00U)as k→∞,T(U,U,0)=(U,U,0).H_{h_k}\longrightarrow \begin{pmatrix}U&0\\0&U\end{pmatrix} \quad\text{as }k\to\infty, \qquad T(U,U,0)=(U,U,0).Hhk​​⟶(U0​0U​)as k→∞,T(U,U,0)=(U,U,0).

The convergence is in the usual finite-dimensional topology on real matrices.

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