Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5.2.3), p. 65 — first bound after column selection

Proved
IntroMatrixConc.Submatrix.eq_5_2_3

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

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

Let B∈Cd×nB\in\mathbb C^{d\times n}B∈Cd×n, with d,n≥1d,n\ge1d,n≥1. Independently select each row with probability p/dp/dp/d and each column with probability r/nr/nr/n, where 0≤p≤d0\le p\le d0≤p≤d and 0≤r≤n0\le r\le n0≤r≤n. Write PPP and RRR for the resulting diagonal projectors and Z=PBRZ=PBRZ=PBR. Then

E∥Z∥2≤1.72rn Eλmax⁡((PB)(PB)∗)+(log⁡d) Emax⁡k∥(PB):k∥2.\mathbb E\|Z\|^2\le1.72\frac rn\,\mathbb E\lambda_{\max}((PB)(PB)^*)+(\log d)\,\mathbb E\max_k\|(PB)_{:k}\|^2.E∥Z∥2≤1.72nr​Eλmax​((PB)(PB)∗)+(logd)Ekmax​∥(PB):k​∥2.

This is the first of three estimates combined into the row-and-column bound (5.2.2).

Formalization Note The row and column indicators form one jointly independent family. Measurability and integrability of the displayed functions are explicit. Matrices are complex, following the book's general convention.

Preamble
import Definitions.Def_IntroMatrixConc_Submatrix_Defs

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

/-- Tropp (5.2.3), p. 65: the first conditional Chernoff bound after column selection. -/
theorem eq_5_2_3 {Ω : Type*} [MeasurableSpace Ω]
    (μ : Measure Ω) [IsProbabilityMeasure μ] {d n : ℕ} [NeZero d] [NeZero n]
    (B : Matrix (Fin d) (Fin n) ℂ) (δ : Fin d → Ω → ℝ)
    (ξ : Fin n → Ω → ℝ) (p r : ℝ)
    (hp0 : 0 ≤ p) (hpd : p ≤ (d : ℝ))
    (hr0 : 0 ≤ r) (hrn : r ≤ (n : ℝ))
    (hδMeas : ∀ j, Measurable (δ j)) (hξMeas : ∀ k, Measurable (ξ k))
    (hIndep : iIndepFun (Sum.elim δ ξ) μ)
    (hδ : ∀ j, IsBernoulli μ (δ j) (p / (d : ℝ)))
    (hξ : ∀ k, IsBernoulli μ (ξ k) (r / (n : ℝ))) :
    Integrable (fun ω => spectralNorm (selectedSubmatrix B δ ξ ω) ^ 2) μ ∧
    Integrable (fun ω => lambdaMax (selectedRows B δ ω *
      (selectedRows B δ ω).conjTranspose)) μ ∧
    Integrable (fun ω => maxSelectedColumnSq B δ ω) μ ∧
    (∫ ω, spectralNorm (selectedSubmatrix B δ ξ ω) ^ 2 ∂μ) ≤
      (1.72 : ℝ) * (r / (n : ℝ)) *
        (∫ ω, lambdaMax (selectedRows B δ ω *
          (selectedRows B δ ω).conjTranspose) ∂μ) +
      Real.log d * (∫ ω, maxSelectedColumnSq B δ ω ∂μ) := by sorry

end IntroMatrixConc.Submatrix
Source
Tropp, arXiv:1501.01571v1, (5.2.3), p. 65
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