Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Tropp–Webber spectral second moment: (E∥SΓT∥2)1/2≤∥S∥∥T∥F+∥S∥F∥T∥(\mathbb E\|S\Gamma T\|^2)^{1/2}\le\|S\|\|T\|_F+\|S\|_F\|T\|(E∥SΓT∥2)1/2≤∥S∥∥T∥F​+∥S∥F​∥T∥

Proved
GaussianMatrix.spectral_second_moment

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

gaussian-matrixprobabilityrandom-matrix-theoryrandomized-numerical-linear-algebra

Fix matrices S∈Ra×pS\in\mathbb R^{a\times p}S∈Ra×p and T∈Rm×nT\in\mathbb R^{m\times n}T∈Rm×n and let Γ∈Rp×m\Gamma\in\mathbb R^{p\times m}Γ∈Rp×m be a standard Gaussian matrix. Then ∥SΓT∥2\|S\Gamma T\|^2∥SΓT∥2 is integrable and

(E ∥S Γ T∥2)1/2 ≤ ∥S∥ ∥T∥F+∥S∥F ∥T∥,\bigl(\mathbb E\,\|S\,\Gamma\,T\|^2\bigr)^{1/2}\ \le\ \|S\|\,\|T\|_F+\|S\|_F\,\|T\| ,(E∥SΓT∥2)1/2 ≤ ∥S∥∥T∥F​+∥S∥F​∥T∥,

where ∥⋅∥\|\cdot\|∥⋅∥ is the spectral norm and ∥⋅∥F\|\cdot\|_F∥⋅∥F​ the Frobenius norm.

This is the second-moment version of the Gordon–Chevet bound (Tropp–Webber Lemma B.1); it is the form needed when spectral-norm errors are analyzed in mean square, e.g. for the core-noise and range-residual terms of truncated sketching algorithms, where it is combined with the inverse moments E∥G†∥2\mathbb E\|G^{\dagger}\|^2E∥G†∥2 and E∥G†∥F2\mathbb E\|G^{\dagger}\|_F^2E∥G†∥F2​.

Formalization Note. The bound is stated in the equivalent squared form E∥SΓT∥2≤(∥S∥∥T∥F+∥S∥F∥T∥)2\mathbb E\|S\Gamma T\|^2\le(\|S\|\|T\|_F+\|S\|_F\|T\|)^2E∥SΓT∥2≤(∥S∥∥T∥F​+∥S∥F​∥T∥)2, together with integrability of the integrand.

Preamble
import Definitions.Def_GaussianMatrix_basic

open MeasureTheory ProbabilityTheory
open scoped Matrix
Formal statement
namespace GaussianMatrix
theorem spectral_second_moment {a p m n : ℕ} (S : Matrix (Fin a) (Fin p) ℝ)
    (T : Matrix (Fin m) (Fin n) ℝ) :
    Integrable (fun G : Fin p → Fin m → ℝ => specNorm (S * Matrix.of G * T) ^ 2) (gaussianMatrix p m) ∧
    ∫ G, specNorm (S * Matrix.of G * T) ^ 2 ∂(gaussianMatrix p m)
      ≤ (specNorm S * frobNorm T + frobNorm S * specNorm T) ^ 2 := by sorry
end GaussianMatrix
Source
J. A. Tropp, R. J. Webber, *Randomized algorithms for low-rank matrix approximation: design, analysis, and applications*, 2023, https://arxiv.org/abs/2306.12418 (v1), Appendix B p. 47, Lemma B.1 (Moment bounds), first upper bound: (E∥SGT∥2)1/2≤∥S∥∥T∥F+∥T∥∥S∥F(\mathbb E\|SGT\|^2)^{1/2}\le\|S\|\|T\|_F+\|T\|\|S\|_F(E∥SGT∥2)1/2≤∥S∥∥T∥F​+∥T∥∥S∥F​.
Read-back

What the Lean code literally says, in plain math · claude-fable-5-1

Let a,p,m,na, p, m, na,p,m,n be arbitrary natural numbers (any may be 000), let SSS be an arbitrary a×pa \times pa×p real matrix and TTT an arbitrary m×nm \times nm×n real matrix, with no hypotheses on SSS or TTT. Let μp,m\mu_{p,m}μp,m​ be the product measure on p×mp \times mp×m real arrays GGG with i.i.d. N(0,1)\mathcal N(0,1)N(0,1) entries (a probability measure; a Dirac mass on a one-point space when p=0p = 0p=0 or m=0m = 0m=0). For a real matrix MMM write ∥M∥op\|M\|_{\mathrm{op}}∥M∥op​ for its ℓ2→ℓ2\ell_2 \to \ell_2ℓ2​→ℓ2​ operator norm (largest singular value) and ∥M∥F:=∑i,jMij2\|M\|_F := \sqrt{\sum_{i,j} M_{ij}^2}∥M∥F​:=∑i,j​Mij2​​ for its Frobenius norm. The statement asserts the conjunction of

  1. the function G↦∥S G T∥op2G \mapsto \|S\,G\,T\|_{\mathrm{op}}^2G↦∥SGT∥op2​ (the square, as a real number, of the operator norm of the a×na \times na×n matrix SGTSGTSGT) is integrable with respect to μp,m\mu_{p,m}μp,m​; and

∫∥S G T∥op2  dμp,m(G)  ≤  (∥S∥op ∥T∥F+∥S∥F ∥T∥op)2.\int \|S\,G\,T\|_{\mathrm{op}}^2\; d\mu_{p,m}(G) \;\le\; \big(\|S\|_{\mathrm{op}}\,\|T\|_F + \|S\|_F\,\|T\|_{\mathrm{op}}\big)^2.∫∥SGT∥op2​dμp,m​(G)≤(∥S∥op​∥T∥F​+∥S∥F​∥T∥op​)2.

Here the squares are ordinary real squares (natural-number exponent 222). The integral is the Lebesgue integral (equal to 000 by convention for a non-integrable integrand, which item 1 excludes). If any of a,p,m,na, p, m, na,p,m,n is 000 the relevant matrices are empty, their norms are 000, and the inequality reads 0≤(nonnegative)20 \le (\text{nonnegative})^20≤(nonnegative)2. Nothing is asserted about the first moment or about any relation between this bound and the mean of ∥SGT∥op\|SGT\|_{\mathrm{op}}∥SGT∥op​.

Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by tc · 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me