§4.1.2, p. 44 — Jensen lower bound for a matrix Gaussian series
ProvedIntroMatrixConc.GaussianSeries.jensen_lowermatrix-concentrationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1random-matrices
Let be a finite series of fixed complex matrices with independent standard real Gaussian coefficients. Write , with the Euclidean operator norm. Then
This is the lower half of the second-moment comparison (4.1.7). The dimensions are positive, and the coefficient family may be empty.
Preamble
import Mathlib import Definitions.Def_TroppMatrixConcentration_ch4_scalar_laws open MeasureTheory ProbabilityTheory TroppMatrixConcentration open scoped Matrix.Norms.L2Operator noncomputable section
Formal statement
namespace IntroMatrixConc.GaussianSeries
/-- Tropp §4.1.2, p. 44: the Jensen lower bound in (4.1.7). -/
theorem jensen_lower {Ω : Type*} [MeasurableSpace Ω]
(μ : Measure Ω) [IsProbabilityMeasure μ]
{d₁ d₂ N : ℕ} [NeZero d₁] [NeZero d₂]
(B : Fin N → Matrix (Fin d₁) (Fin d₂) ℂ)
(g : Fin N → Ω → ℝ)
(hMeas : ∀ k, Measurable (g k))
(hIndep : iIndepFun g μ)
(hLaw : ∀ k, standardGaussianLaw μ (g k)) :
let Z := fun ω => ∑ k, g k ω • B k
rectSecondMoment μ Z ≤ ∫ ω, spectralNorm (Z ω) ^ 2 ∂μ := by sorry
end IntroMatrixConc.GaussianSeries
Source
Tropp, An Introduction to Matrix Concentration Inequalities, arXiv:1501.01571v1, §4.1.2, p. 44, Jensen display below (4.1.7)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.