Spectral Noise Energy Bound
ProvedFunctionalInequalities.KLS.LogConcave.sum_integral_spectral_noise_energy_le_modularThis is a finite-dimensional matrix-energy estimate with the trace bound supplied as a hypothesis.
Let and be probability measures on measurable spaces and . Let have measurable entries, be symmetric almost everywhere, have integrable entries, and have mean . Assume that for every symmetric matrix , is integrable and
Let be symmetric and invertible, and let . Define , , and . Then each coordinate energy is integrable and
No log-concavity or Stein-kernel conclusion is part of the statement; the trace estimate is an input.
Superseded upload. This snapshot was replaced by FunctionalInequalities.KLS.LogConcave.sum_integral_spectral_noise_energy_le_readable: open the readable replacement. The replacement preserves the frozen source and mathematical statement, with a compact declaration context. This historical node remains available for existing imports.
import Definitions.Def_KLSModular_FunctionalInequalities_Probability_Stein_QuadraticAction noncomputable section open MeasureTheory open FunctionalInequalities.Probability.Stein open scoped RealInnerProductSpace MatrixOrder section namespace FunctionalInequalities end FunctionalInequalities open FunctionalInequalities section namespace FunctionalInequalities.KLS end FunctionalInequalities.KLS open FunctionalInequalities FunctionalInequalities.KLS section namespace FunctionalInequalities.KLS.LogConcave end FunctionalInequalities.KLS.LogConcave open FunctionalInequalities FunctionalInequalities.KLS FunctionalInequalities.KLS.LogConcave set_option maxHeartbeats 1000000
theorem FunctionalInequalities.KLS.LogConcave.sum_integral_spectral_noise_energy_le_modular {n : ℕ} {Ω Δ : Type*}
[MeasurableSpace Ω] [MeasurableSpace Δ] (ρ : Measure Ω) [IsProbabilityMeasure ρ]
(γ : Measure Δ) [IsProbabilityMeasure γ]
(H : Ω → Matrix (Fin n) (Fin n) ℝ)
(hHmeas : ∀ i j, Measurable (fun y => H y i j))
(hHsym : ∀ᵐ y ∂ρ, (H y).IsSymm)
(hHint : ∀ i j, Integrable (fun y => H y i j) ρ)
(hmean : ∀ i j, (∫ y, H y i j ∂ρ) = (1 : Matrix (Fin n) (Fin n) ℝ) i j)
(hT25 : ∀ B : Matrix (Fin n) (Fin n) ℝ, B.IsSymm →
Integrable (fun y => Matrix.trace (B*H y*B*H y)) ρ ∧
(∫ y, Matrix.trace (B*H y*B*H y) ∂ρ) ≤ 2*Matrix.trace (B*B))
(M : Matrix (Fin n) (Fin n) ℝ) (hM : M.IsSymm) (hunit : IsUnit M) (t : ℝ) :
let B : Matrix (Fin n) (Fin n) ℝ := CFC.sqrt (M*M)
let S : Matrix (Fin n) (Fin n) ℝ := CFC.sqrt B
let Q : Matrix (Fin n) (Fin n) ℝ := cfc (fun x : ℝ => (SignType.sign x : ℝ)) M
(∀ i : Fin n, Integrable (fun y => ‖action (S*H y*S + t • 1)
(action Q (EuclideanSpace.single i 1))‖^2) ρ) ∧
(∑ i : Fin n, ∫ p : Ω × Δ, ‖action (S*H p.1*S + t • 1)
(action Q (EuclideanSpace.single i 1))‖^2 ∂ρ.prod γ) ≤
2*Matrix.trace (M*M) + 2*t*Matrix.trace B + (n : ℝ)*t^2 := by sorry