Gaussian cross entropy in general quadrature conventions
OpenQAlgorithms.Papers.Independent.Intakethird100.P17.gaussian_cross_entropyLet , , and let , , be normalized finite-energy Gaussian densities on the full -mode oscillator space, with arbitrary finite means and centered half-anticommutator covariances . The quadratures satisfy , where is the direct sum of the canonical two-dimensional antisymmetric form. Assume each symplectic eigenvalue of each covariance is strictly greater than . Put and . Then the cross entropy is finite and
A simultaneous displacement of both states gives the centered calculation in (A18). The identity does not require commuting covariance matrices or commuting density operators.
Formalization Note Cross entropy is independently computed from bounded support-log cutoffs of the actual density operator. The theorem asserts convergence to the displayed expression; the matrix inverse-coth series also has an explicit convergence conclusion.
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, (A18)--(A19).
Arbitrary finite means; strict Gibbs domain for both covariances. The common
displacement leaves delta=u2-u1; no commuting-covariance premise is imposed. -/
theorem gaussian_cross_entropy {n : ℕ}
(W : FockWeylSystem n) (kappa : ℝ) (hkappa : 0 < kappa)
(rho1 rho2 : ModeOperator n) (u1 u2 : PhaseVector n)
(sigma1 sigma2 : Matrix (Quadrature n) (Quadrature n) ℝ)
(h1 : GaussianInConvention W kappa rho1 u1 sigma1)
(h2 : GaussianInConvention W kappa rho2 u2 sigma2)
(hs1 : StrictGibbsCovariance kappa sigma1)
(hs2 : StrictGibbsCovariance kappa sigma2) :
Summable (gibbsSeriesTerm kappa sigma1) ∧
Summable (gibbsSeriesTerm kappa sigma2) ∧
(∀ k, TraceSummable (rho1.comp (oscillatorLogCutoff rho2 k))) ∧
Tendsto (crossEntropyCutoff rho1 rho2) atTop
(nhds (gaussianSigma kappa sigma1 sigma2 (u2 - u1))) ∧
oscillatorCrossEntropy rho1 rho2 = gaussianSigma kappa sigma1 sigma2 (u2 - u1) := 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 , , , and let be the standard basis. Suppose , for real , is a unitary bounded operator with
Let , let be bounded complex linear operators on , let , and let be real matrices. For each , assume that for some sequences with , that and for all , that its number-basis trace series is summable and equals , and that is summable. Let , , with all other entries zero. Assume for each that is symmetric and positive definite, that is positive semidefinite, and that for every real the trace series of is summable and
Assume additionally, for both , that is symmetric and positive definite and that the complex matrix is positive definite. Define
entrywise, and put
Then both matrix series and are summable. For every natural number , the number-basis trace series of is summable, where is applied by the real continuous functional calculus. Moreover,
and the value selected by the total filter-limit definition of this cutoff sequence equals . No assumption is present, so the zero-mode case is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.