Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Expected squared Frobenius norm of a scaled Gaussian matrix: E∥SΓT∥F2=∥S∥F2∥T∥F2\mathbb E\|S\Gamma T\|_F^2=\|S\|_F^2\|T\|_F^2E∥SΓT∥F2​=∥S∥F2​∥T∥F2​

Proved
GaussianMatrix.frobenius_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

E ∥S Γ T∥F2=∥S∥F2 ∥T∥F2.\mathbb E\,\|S\,\Gamma\,T\|_F^2=\|S\|_F^2\,\|T\|_F^2 .E∥SΓT∥F2​=∥S∥F2​∥T∥F2​.

This second-moment identity is the first of the Gaussian moment bounds (Halko–Martinsson–Tropp Proposition 10.1, eq. (10.1); Tropp–Webber Lemma B.1). It is the identity that produces the factor ∥Σ2∥F2 E∥Ω1†∥F2\|\Sigma_2\|_F^2\,\mathbb E\|\Omega_1^{\dagger}\|_F^2∥Σ2​∥F2​E∥Ω1†​∥F2​ in the expected Frobenius error of the randomized SVD, and with S=IS=IS=I, T=IT=IT=I it says E∥Γ∥F2=pm\mathbb E\|\Gamma\|_F^2=pmE∥Γ∥F2​=pm.

Formalization Note. The expectation is a Lebesgue integral against γp,m\gamma_{p,m}γp,m​; the integrand is a polynomial in the entries of Γ\GammaΓ and hence integrable.

Preamble
import Definitions.Def_GaussianMatrix_basic

open MeasureTheory ProbabilityTheory
open scoped Matrix
Formal statement
namespace GaussianMatrix
theorem frobenius_second_moment {a p m n : ℕ} (S : Matrix (Fin a) (Fin p) ℝ)
    (T : Matrix (Fin m) (Fin n) ℝ) :
    ∫ G, frobSq (S * Matrix.of G * T) ∂(gaussianMatrix p m) = frobSq S * frobSq T := by sorry
end GaussianMatrix
Source
N. Halko, P.-G. Martinsson, J. A. Tropp, *Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions*, SIAM Review 53(2), 2011, https://arxiv.org/abs/0909.4061 (v2), §10.1 p. 55, Proposition 10.1, eq. (10.1), and Appendix A.1 p. 64, Proposition A.1; also 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, first equality.
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 natural numbers (implicit; any may be 000), and let 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 be arbitrary real matrices (no hypotheses on them). Let γp,m\gamma_{p,m}γp,m​ be the law of a p×mp \times mp×m array GGG with independent N(0,1)\mathcal{N}(0,1)N(0,1) entries. Writing ∥A∥F2=∑i,jAij2\|A\|_F^2 = \sum_{i,j} A_{ij}^2∥A∥F2​=∑i,j​Aij2​ for the squared Frobenius norm of a real matrix (the empty sum is 000), the statement asserts

∫∥S G T∥F2  dγp,m(G)  =  ∥S∥F2 ∥T∥F2,\int \|S\,G\,T\|_F^2 \; d\gamma_{p,m}(G) \;=\; \|S\|_F^2 \,\|T\|_F^2,∫∥SGT∥F2​dγp,m​(G)=∥S∥F2​∥T∥F2​,

where SGT∈Ra×nSGT \in \mathbb{R}^{a \times n}SGT∈Ra×n is the matrix product (with GGG viewed as a matrix). The left-hand side is Lean's Bochner integral of the real-valued function G↦∥SGT∥F2G \mapsto \|SGT\|_F^2G↦∥SGT∥F2​ against γp,m\gamma_{p,m}γp,m​; by Lean's convention this integral is defined to be 000 if the integrand is not integrable, and the statement does not separately assert integrability (the integrand is a polynomial of degree 222 in the Gaussian entries). Edge cases: if a=0a = 0a=0 or n=0n = 0n=0 then SGTSGTSGT is an empty matrix, the integrand is identically 000, and ∥S∥F2\|S\|_F^2∥S∥F2​ or ∥T∥F2\|T\|_F^2∥T∥F2​ is 000; if p=0p = 0p=0 or m=0m = 0m=0 the array space is a single point (the integral is the value at that point), SGT=0SGT = 0SGT=0, and ∥S∥F2=0\|S\|_F^2 = 0∥S∥F2​=0 or ∥T∥F2=0\|T\|_F^2 = 0∥T∥F2​=0 respectively.

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me