Gaussian quadratic mean, second moment, and variance
OpenQAlgorithms.Papers.Independent.Intakethird100.P17.gaussian_quadratic_momentsLet and . On the full -mode oscillator space, let be a normalized, centered, finite-energy Gaussian density with centered half-anticommutator covariance . Write , with and . For every real symmetric matrix , set . The polynomial products and density-weighted traces converge, and
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.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P17
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
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , put , where , let be its standard basis, and put . Suppose assigns to each real vector a unitary bounded operator whose matrix entries are
Let , let be a bounded complex linear operator on , and let be real matrices with . Assume that for some sequences satisfying , that and for every , that is summable and equals , and that is summable. Write , , with all other entries zero. Also assume that is symmetric and positive definite, that is positive semidefinite, and that for every real , the trace series of is summable and
For , define
and, for kernels , set , , and
Then every series defining , for every , and every series defining , is summable; the jointly indexed pairing series defining and are also summable; and
There is no assumption ; at , the quadrature index set is empty and these expectations and variance are zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.