Successor Cumulant Energy Reindexing
ProvedFunctionalInequalities.KLS.BKL.cumulantEnergy_succ_eq_readableThis is the reindexing identity for the next cumulant energy, corresponding to BKL equation (90).
Let be any measure on , let , and let be a direction. Set using inverseSqrt. Then
The finite sums are obtained by splitting the final index of a map from Fin (r+1) to Fin n. This is a combinatorial identity useful for comparing successive cumulant energies; no probability, isotropy, compactness, or invertibility assumptions are imposed.
Original Lean declaration header
Within namespace FunctionalInequalities.KLS.BKL. Shown in its original module context. Proof omitted.
theorem cumulantEnergy_succ_eq (ν : Measure (EuclideanSpace ℝ (Fin n))) (r : ℕ) (u : EuclideanSpace ℝ (Fin n)) :
cumulantEnergy ν (r + 1) u =
∑ K : Fin r → Fin n, ∑ k : Fin n, cumulant ν (r + 1 + 1)
(Fin.cons u (Fin.snoc (fun s => inverseSqrt (Covariance.operator ν) (EuclideanSpace.basisFun (Fin n) ℝ (K s)))
(inverseSqrt (Covariance.operator ν) (EuclideanSpace.basisFun (Fin n) ℝ k)))) ^ 2
Module navigation
Module: KLS/BKL/Localization/NoiseBound.
Definition modules: KLS/BKL/CumulantEnergy/Basic, Probability/Covariance/Basic, Analysis/Operator/InverseSqrt, Analysis/BakryEmery/Cumulant/Basic.
Previous: cumulant_middle_sum · Next: sum_sq_conjugatedNoiseMatrix_mulVec_le.
Source excerpt, lines 99–103 · Frozen source 408915f.
import Definitions.Def_KLSModular_FunctionalInequalities_KLS_BKL_Localization_NoiseBound
open MeasureTheory
open FunctionalInequalities.Probability.Posterior FunctionalInequalities.Analysis
FunctionalInequalities.Analysis.BakryEmery
variable {n : ℕ}
theorem FunctionalInequalities.KLS.BKL.cumulantEnergy_succ_eq_readable (ν : Measure (EuclideanSpace ℝ (Fin n))) (r : ℕ) (u : EuclideanSpace ℝ (Fin n)) :
cumulantEnergy ν (r + 1) u =
∑ K : Fin r → Fin n, ∑ k : Fin n, cumulant ν (r + 1 + 1)
(Fin.cons u (Fin.snoc (fun s => inverseSqrt (Covariance.operator ν) (EuclideanSpace.basisFun (Fin n) ℝ (K s)))
(inverseSqrt (Covariance.operator ν) (EuclideanSpace.basisFun (Fin n) ℝ k)))) ^ 2 := by sorry