Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1.2, p. 44 — Jensen lower bound for a matrix Gaussian series

Proved
IntroMatrixConc.GaussianSeries.jensen_lower

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

matrix-concentrationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1random-matrices

Let Z=∑kγkBkZ=\sum_k\gamma_kB_kZ=∑k​γk​Bk​ be a finite series of fixed complex d1×d2d_1\times d_2d1​×d2​ matrices with independent standard real Gaussian coefficients. Write v(Z)=max⁡{∥EZZ∗∥,∥EZ∗Z∥}v(Z)=\max\{\|\mathbb E ZZ^*\|,\|\mathbb E Z^*Z\|\}v(Z)=max{∥EZZ∗∥,∥EZ∗Z∥}, with the Euclidean operator norm. Then

v(Z)≤E∥Z∥2.v(Z)\le \mathbb E\|Z\|^2.v(Z)≤E∥Z∥2.

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
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me