Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5.1.8), p. 61 — streamlined upper matrix Chernoff expectation bound

Proved
IntroMatrixConc.Submatrix.eq_5_1_8

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

matrix-chernoffmatrix-concentrationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let XkX_kXk​ be a finite independent family of measurable, Hermitian, positive semidefinite random d×dd\times dd×d matrices with d≥1d\ge1d≥1 and λmax⁡(Xk)≤L\lambda_{\max}(X_k)\le Lλmax​(Xk​)≤L almost surely, where L≥0L\ge0L≥0. Set Y=∑kXkY=\sum_kX_kY=∑k​Xk​ and μmax⁡=λmax⁡(EY)\mu_{\max}=\lambda_{\max}(\mathbb EY)μmax​=λmax​(EY). Then

Eλmax⁡(Y)≤1.72 μmax⁡+Llog⁡d.\mathbb E\lambda_{\max}(Y)\le1.72\,\mu_{\max}+L\log d.Eλmax​(Y)≤1.72μmax​+Llogd.

This is the numerical form of the upper expectation estimate in Theorem 5.1.1 and the concentration step used throughout §5.2.

Formalization Note Bounded summands make the displayed eigenvalue integrable; the statement records that fact explicitly. The family may be empty and L=0L=0L=0 is allowed.

Preamble
import Definitions.Def_IntroMatrixConc_Submatrix_Defs

open MeasureTheory ProbabilityTheory TroppMatrixConcentration
open scoped Matrix.Norms.L2Operator
Formal statement
namespace IntroMatrixConc.Submatrix

/-- Tropp (5.1.8), p. 61: the streamlined upper expectation bound. -/
theorem eq_5_1_8 {Ω : Type*} [MeasurableSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] {d N : ℕ} [NeZero d]
    (X : Fin N → Ω → Matrix (Fin d) (Fin d) ℂ) (L : ℝ) (hL : 0 ≤ L)
    (hMeas : ∀ k, Measurable (X k)) (hIndep : iIndepFun X μ)
    (hHerm : ∀ k, ∀ᵐ ω ∂μ, (X k ω).IsHermitian)
    (hBound : ∀ k, ∀ᵐ ω ∂μ, 0 ≤ lambdaMin (X k ω) ∧ lambdaMax (X k ω) ≤ L) :
    let Y := fun ω => ∑ k, X k ω
    Integrable (fun ω => lambdaMax (Y ω)) μ ∧
    (∫ ω, lambdaMax (Y ω) ∂μ) ≤
      (1.72 : ℝ) * lambdaMax (∫ ω, Y ω ∂μ) + L * Real.log d := by sorry

end IntroMatrixConc.Submatrix
Source
Tropp, arXiv:1501.01571v1, (5.1.8), p. 61; Theorem 5.1.1 hypotheses, p. 60
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