Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Gaussian quadratic mean, second moment, and variance

Open
QAlgorithms.Papers.Independent.Intakethird100.P17.gaussian_quadratic_moments

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let n≥0n\ge0n≥0 and κ>0\kappa>0κ>0. On the full nnn-mode oscillator space, let ρ\rhoρ be a normalized, centered, finite-energy Gaussian density with centered half-anticommutator covariance σ\sigmaσ. Write q=(x1,p1,…,xn,pn)Tq=(x_1,p_1,\ldots,x_n,p_n)^Tq=(x1​,p1​,…,xn​,pn​)T, with [q,qT]=iΩ/κ[q,q^T]=i\Omega/\kappa[q,qT]=iΩ/κ and Ω=⨁j=1n(01−10)\Omega=\bigoplus_{j=1}^n\left(\begin{smallmatrix}0&1\\-1&0\end{smallmatrix}\right)Ω=⨁j=1n​(0−1​10​). For every real symmetric 2n×2n2n\times2n2n×2n matrix AAA, set Q=qTAqQ=q^TAqQ=qTAq. The polynomial products and density-weighted traces converge, and

EρQ=tr⁡(σA),EρQ2=tr⁡(σA)2+2tr⁡(AσAσ)−tr⁡(AΩAΩT)2κ2,Var⁡ρQ=2tr⁡(AσAσ)+tr⁡(AΩAΩ)2κ2.\begin{aligned} \mathbb E_\rho Q&=\operatorname{tr}(\sigma A),\\ \mathbb E_\rho Q^2&=\operatorname{tr}(\sigma A)^2+2\operatorname{tr}(A\sigma A\sigma)-\frac{\operatorname{tr}(A\Omega A\Omega^T)}{2\kappa^2},\\ \operatorname{Var}_\rho Q&=2\operatorname{tr}(A\sigma A\sigma)+\frac{\operatorname{tr}(A\Omega A\Omega)}{2\kappa^2}. \end{aligned}Eρ​QEρ​Q2Varρ​Q​=tr(σA),=tr(σA)2+2tr(AσAσ)−2κ2tr(AΩAΩT)​,=2tr(AσAσ)+2κ2tr(AΩAΩ)​.​

These identities include pure Gaussian states and provide the quadratic moments needed for the entropy-variance calculation.

Formalization Note The observables use their actual creation/annihilation coefficients on the full finite-particle core. Absolute convergence of the infinite pairings is a conclusion, rather than an assumed moment identity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P17
Formal statement
noncomputable section

open Filter

open scoped BigOperators ENNReal ComplexOrder Topology Matrix

attribute [local instance] Classical.propDecidable Classical.decEq

namespace QAlgorithms.Papers.Independent.Intakethird100.P17

open QAlgorithms.Papers.Independent.Claimed50.P30
  (ModeOperator Quadrature PhaseVector numberKet trace TraceSummable
   FockWeylSystem GaussianMoments canonicalOmega)

open QAlgorithms.Papers.Independent.Dependency50.P13 (IsTraceClass relativeEntropy)

open QAlgorithms.Papers.Independent.Next46.P17 (raisingCoefficient)

/-- arXiv:1808.00608v4, Appendix A, PDF p.7, (A8),(A11),(A12).
Real symmetric A and actual centered normalized Gaussian densities, including
pure states. All polynomial traces and core products converge. -/
theorem gaussian_quadratic_moments {n : ℕ}
    (W : FockWeylSystem n) (kappa : ℝ) (hkappa : 0 < kappa)
    (rho : ModeOperator n) (sigma A : Matrix (Quadrature n) (Quadrature n) ℝ)
    (hrho : GaussianInConvention W kappa rho 0 sigma) (hA : A.transpose = A) :
    let Q := quadraticKernel kappa A
    let Omega := canonicalOmega n
    (∀ a b : Quadrature n, PolynomialProductSummable (quadratureKernel kappa a) (quadratureKernel kappa b)) ∧
    PolynomialProductSummable Q Q ∧
    PolynomialPairingSummable rho Q ∧
    PolynomialPairingSummable rho (polynomialKernelProduct Q Q) ∧
    polynomialExpectation rho Q = (sigma * A).trace ∧
    polynomialExpectation rho (polynomialKernelProduct Q Q) =
      (sigma * A).trace ^ 2 + 2 * (A * sigma * A * sigma).trace -
        (A * Omega * A * Omega.transpose).trace / (2 * kappa ^ 2) ∧
    quadraticVariance rho kappa A = 2 * (A * sigma * A * sigma).trace +
      (A * Omega * A * Omega).trace / (2 * kappa ^ 2) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P17

end
Source
Tight bounds for private communication over bosonic Gaussian channels based on teleportation simulation with optimal finite resources, arXiv:1808.00608v4, PDF p. 7, Appendix A Eqs. (A8),(A11),(A12): Gaussian quadratic moments
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number nnn, put Hn=ℓ2(F;C)\mathcal H_n=\ell^2(F;\mathbb C)Hn​=ℓ2(F;C), where F={0,…,n−1}→NF=\{0,\ldots,n-1\}\to\mathbb NF={0,…,n−1}→N, let eje_jej​ be its standard basis, and put J={0,…,n−1}×{0,1}J=\{0,\ldots,n-1\}\times\{0,1\}J={0,…,n−1}×{0,1}. Suppose WWW assigns to each real vector ξ∈RJ\xi\in\mathbb R^Jξ∈RJ a unitary bounded operator whose matrix entries are

(W(ξ)ej)i=∏r=0n−1D−ξ(r,1)+iξ(r,0)(ir,jr),Dz(a,b)=e−∣z∣2/2a! b!∑ℓ=0min⁡(a,b)za−ℓ(−z‾)b−ℓℓ!(a−ℓ)!(b−ℓ)!.(W(\xi)e_j)_i=\prod_{r=0}^{n-1}\mathcal D_{-\xi_{(r,1)}+i\xi_{(r,0)}}(i_r,j_r), \quad \mathcal D_z(a,b)= e^{-|z|^2/2}\sqrt{a!\,b!} \sum_{\ell=0}^{\min(a,b)} \frac{z^{a-\ell}(-\overline z)^{b-\ell}} {\ell!(a-\ell)!(b-\ell)!}.(W(ξ)ej​)i​=r=0∏n−1​D−ξ(r,1)​+iξ(r,0)​​(ir​,jr​),Dz​(a,b)=e−∣z∣2/2a!b!​ℓ=0∑min(a,b)​ℓ!(a−ℓ)!(b−ℓ)!za−ℓ(−z)b−ℓ​.

Let κ>0\kappa>0κ>0, let ρ\rhoρ be a bounded complex linear operator on Hn\mathcal H_nHn​, and let σ,A\sigma,Aσ,A be real J×JJ\times JJ×J matrices with AT=AA^{\mathsf T}=AAT=A. Assume that ρx=∑r⟨vr,x⟩ur\rho x=\sum_r\langle v_r,x\rangle u_rρx=∑r​⟨vr​,x⟩ur​ for some sequences satisfying ∑r∥ur∥∥vr∥<∞\sum_r\|u_r\|\|v_r\|<\infty∑r​∥ur​∥∥vr​∥<∞, that ρ∗=ρ\rho^*=\rhoρ∗=ρ and Re⁡⟨x,ρx⟩≥0\operatorname{Re}\langle x,\rho x\rangle\ge0Re⟨x,ρx⟩≥0 for every xxx, that ∑j⟨ej,ρej⟩\sum_j\langle e_j,\rho e_j\rangle∑j​⟨ej​,ρej​⟩ is summable and equals 111, and that ∑j(∑rjr)Re⁡⟨ej,ρej⟩\sum_j(\sum_rj_r)\operatorname{Re}\langle e_j,\rho e_j\rangle∑j​(∑r​jr​)Re⟨ej​,ρej​⟩ is summable. Write Ω(r,0),(r,1)=1\Omega_{(r,0),(r,1)}=1Ω(r,0),(r,1)​=1, Ω(r,1),(r,0)=−1\Omega_{(r,1),(r,0)}=-1Ω(r,1),(r,0)​=−1, with all other entries zero. Also assume that 2κσ2\kappa\sigma2κσ is symmetric and positive definite, that 2κσ+iΩ2\kappa\sigma+i\Omega2κσ+iΩ is positive semidefinite, and that for every real ξ\xiξ, the trace series of ρW(ξ)\rho W(\xi)ρW(ξ) is summable and

∑j⟨ej,ρW(ξ)ej⟩=exp⁡ ⁣(−κ∑a,b∈Jξaσabξb).\sum_j\langle e_j,\rho W(\xi)e_j\rangle =\exp\!\left(-\kappa\sum_{a,b\in J}\xi_a\sigma_{ab}\xi_b\right).j∑​⟨ej​,ρW(ξ)ej​⟩=exp​−κa,b∈J∑​ξa​σab​ξb​​.

For a=(r,t)∈Ja=(r,t)\in Ja=(r,t)∈J, define

Rr(i,j)={jr+1,i=j[r↦jr+1],0,otherwise,q(r,0)(i,j)=Rr(i,j)+Rr(j,i)2κ,q(r,1)(i,j)=i(Rr(i,j)−Rr(j,i))2κ,R_r(i,j)= \begin{cases}\sqrt{j_r+1},&i=j[r\mapsto j_r+1],\\0,&\text{otherwise},\end{cases} \quad q_{(r,0)}(i,j)=\frac{R_r(i,j)+R_r(j,i)}{\sqrt{2\kappa}}, \quad q_{(r,1)}(i,j)= \frac{i\bigl(R_r(i,j)-R_r(j,i)\bigr)}{\sqrt{2\kappa}},Rr​(i,j)={jr​+1​,0,​i=j[r↦jr​+1],otherwise,​q(r,0)​(i,j)=2κ​Rr​(i,j)+Rr​(j,i)​,q(r,1)​(i,j)=2κ​i(Rr​(i,j)−Rr​(j,i))​,

and, for kernels K,LK,LK,L, set (K⋆L)ij=∑ℓ∈FKiℓLℓj(K\star L)_{ij}=\sum_{\ell\in F}K_{i\ell}L_{\ell j}(K⋆L)ij​=∑ℓ∈F​Kiℓ​Lℓj​, Qij=∑a,b∈JAab(qa⋆qb)ijQ_{ij}=\sum_{a,b\in J}A_{ab}(q_a\star q_b)_{ij}Qij​=∑a,b∈J​Aab​(qa​⋆qb​)ij​, and

Eρ(K)=Re⁡∑i,j∈F(ρej)iKji.E_\rho(K)=\operatorname{Re}\sum_{i,j\in F}(\rho e_j)_iK_{ji}.Eρ​(K)=Rei,j∈F∑​(ρej​)i​Kji​.

Then every series defining (qa⋆qb)ij(q_a\star q_b)_{ij}(qa​⋆qb​)ij​, for every a,b,i,ja,b,i,ja,b,i,j, and every series defining (Q⋆Q)ij(Q\star Q)_{ij}(Q⋆Q)ij​, is summable; the jointly indexed pairing series defining Eρ(Q)E_\rho(Q)Eρ​(Q) and Eρ(Q⋆Q)E_\rho(Q\star Q)Eρ​(Q⋆Q) are also summable; and

Eρ(Q)=tr⁡(σA),E_\rho(Q)=\operatorname{tr}(\sigma A),Eρ​(Q)=tr(σA), Eρ(Q⋆Q)=tr⁡(σA)2+2tr⁡(AσAσ)−tr⁡(AΩAΩT)2κ2,Eρ(Q⋆Q)−Eρ(Q)2=2tr⁡(AσAσ)+tr⁡(AΩAΩ)2κ2.E_\rho(Q\star Q) =\operatorname{tr}(\sigma A)^2 +2\operatorname{tr}(A\sigma A\sigma) -\frac{\operatorname{tr}(A\Omega A\Omega^{\mathsf T})}{2\kappa^2}, \qquad E_\rho(Q\star Q)-E_\rho(Q)^2 =2\operatorname{tr}(A\sigma A\sigma) +\frac{\operatorname{tr}(A\Omega A\Omega)}{2\kappa^2}.Eρ​(Q⋆Q)=tr(σA)2+2tr(AσAσ)−2κ2tr(AΩAΩT)​,Eρ​(Q⋆Q)−Eρ​(Q)2=2tr(AσAσ)+2κ2tr(AΩAΩ)​.

There is no assumption n>0n>0n>0; at n=0n=0n=0, the quadrature index set is empty and these expectations and variance are zero.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me