Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Pure-product probability ensemble for every separable Gaussian density

Open
QAlgorithms.Papers.Independent.Intakenext100.P68.pureProductDecomposition

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 ρ\rhoρ be an actual normalized separable Gaussian density of covariance γ0\gamma_0γ0​ and arbitrary first moments. On the product of the two local pure-density spaces, each carrying its trace-norm Borel structure, there is a probability measure μ\muμ such that

ρ=∫πA⊗πB dμ(πA,πB).\rho=\int \pi_A\otimes\pi_B\,d\mu(\pi_A,\pi_B).ρ=∫πA​⊗πB​dμ(πA​,πB​).

The equality is expressed by all operator coefficients, with each scalar integrand integrable. Pure densities are rank-one projectors onto norm-one vectors. The ensemble may be continuous and is not required to have Gaussian factors. This is the full density decomposition promised by the abstract, with its final construction credited to [7].

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.1 abstract, via pp.1--2 attribution to [7]: Borel probability ensemble
of pure product states on full oscillator spaces. The law may be continuous;
no finite/countable ensemble or Gaussian factors are asserted. Integrability
is included in the accepted barycenter predicate. -/
theorem pureProductDecomposition {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
    (g : CovarianceBlocks n m) (rho : State (Occupation (Fin n) × Occupation (Fin m)))
    (d : QuadratureIndex n ⊕ QuadratureIndex m → ℝ) (hG : HasGaussianCovariance rho g d)
    (hsep : IsSeparable rho.coefficients) :
    ∃ mu : Measure (PureState (Occupation (Fin n)) × PureState (Occupation (Fin m))),
      IsProbabilityMeasure mu ∧
      IsBarycenter mu
        (fun p => productCoeff p.1.val.coefficients p.2.val.coefficients)
        rho.coefficients := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P68

end
Source
Separability Criterion for all bipartite Gaussian States, arXiv:quant-ph/0104050v1, PDF p. 1, Abstract; construction attributed to [7] on pp.1–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, let g=(A,B,C)g=(A,B,C)g=(A,B,C) be a real block triple of sizes 2n,2m2n,2m2n,2m, let ρ\rhoρ be a density state on L=Nn×NmL=\mathbb N^n\times\mathbb N^mL=Nn×Nm, and let ddd be a real vector indexed by the two interleaved coordinates of each subsystem’s modes. Here a density state on any index set KKK is a coefficient matrix RRR admitting a nuclear expansion Rij=∑a=0∞ua(i)va(j)‾R_{ij}=\sum_{a=0}^\infty u_a(i)\overline{v_a(j)}Rij​=∑a=0∞​ua​(i)va​(j)​, where 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​∥<∞, for which every finite quadratic form is real and nonnegative, the real diagonal is summable, and its sum is 111. Define τ(Z)\tau(Z)τ(Z) as the infimum in [0,∞][0,\infty][0,∞] of these sums over all nuclear expansions of ZZZ, with empty infimum +∞+\infty+∞. Assume ρ\rhoρ has Gaussian covariance ggg and displacement ddd in this explicit sense: with Jr=⨁j=1r(0−110)J_r=\bigoplus_{j=1}^r\begin{pmatrix}0&-1\\1&0\end{pmatrix}Jr​=⨁j=1r​(01​−10​), J=Jn⊕JmJ=J_n\oplus J_mJ=Jn​⊕Jm​, and Hg=(ACCTB)H_g=\begin{pmatrix}A&C\\C^{\mathsf T}&B\end{pmatrix}Hg​=(ACT​CB​), the matrix HgH_gHg​ is symmetric and Hg−iJ⪰0H_g-iJ\succeq0Hg​−iJ⪰0; moreover, defining

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 Wt(v,u)W_t(v,u)Wt​(v,u) as 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 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 their value is exp⁡(−tTJTHgJt/4−itTJd)\exp(-t^{\mathsf T}J^{\mathsf T}H_gJt/4-it^{\mathsf T}Jd)exp(−tTJTHg​Jt/4−itTJd). Also assume that for every ε>0\varepsilon>0ε>0, some finite convex combination YYY of product density matrices on Nn×Nm\mathbb N^n\times\mathbb N^mNn×Nm satisfies τ(ρ−Y)<ε\tau(\rho-Y)<\varepsilonτ(ρ−Y)<ε. Then there exists a probability measure μ\muμ on pairs (R,S)(R,S)(R,S) of pure density states on Nn,Nm\mathbb N^n,\mathbb N^mNn,Nm, respectively, where “pure” means R=uu∗R=uu^*R=uu∗ for some unit vector u∈ℓ2u\in\ell^2u∈ℓ2, and likewise for SSS, such that every product coefficient is integrable and

ρ(a,b),(a′,b′)=∫Raa′Sbb′ dμ(R,S)(a,a′∈Nn, b,b′∈Nm).\rho_{(a,b),(a',b')} =\int R_{aa'}S_{bb'}\,d\mu(R,S) \qquad(a,a'\in\mathbb N^n,\ b,b'\in\mathbb N^m).ρ(a,b),(a′,b′)​=∫Raa′​Sbb′​dμ(R,S)(a,a′∈Nn, b,b′∈Nm).

The measure uses the Borel structure inherited from the state topology generated by the sets {S:τ(S−R)<ε}\{S:\tau(S-R)<\varepsilon\}{S:τ(S−R)<ε}, for density states RRR and ε>0\varepsilon>0ε>0, and then the subtype and product measurable structures. The measure is not required to have finite or countable support, and its pure component states are not required to satisfy any Gaussian condition.

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