Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Fourth Frobenius moment of a pseudo-inverted Gaussian matrix: E∥G†∥F4=r2(k−r)−2r(r−1)(k−r)(k−r−1)(k−r−3)\mathbb E\|G^{\dagger}\|_F^4=\frac{r^2(k-r)-2r(r-1)}{(k-r)(k-r-1)(k-r-3)}E∥G†∥F4​=(k−r)(k−r−1)(k−r−3)r2(k−r)−2r(r−1)​

Proved
GaussianMatrix.pinv_frobenius_fourth_moment

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

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

Let G∈Rr×kG\in\mathbb R^{r\times k}G∈Rr×k be a standard Gaussian matrix with r≤k−4r\le k-4r≤k−4 and G†=GT(GGT)−1G^{\dagger}=G^{\mathsf T}(GG^{\mathsf T})^{-1}G†=GT(GGT)−1. Then ∥G†∥F4\|G^{\dagger}\|_F^4∥G†∥F4​ is integrable and

E ∥G†∥F4=E[tr⁡(GGT)−1]2=r2(k−r)−2r(r−1)(k−r)(k−r−1)(k−r−3).\mathbb E\,\|G^{\dagger}\|_F^4=\mathbb E\bigl[\operatorname{tr}(GG^{\mathsf T})^{-1}\bigr]^2=\frac{r^2(k-r)-2r(r-1)}{(k-r)(k-r-1)(k-r-3)} .E∥G†∥F4​=E[tr(GGT)−1]2=(k−r)(k−r−1)(k−r−3)r2(k−r)−2r(r−1)​.

Since (GGT)−1(GG^{\mathsf T})^{-1}(GGT)−1 is positive semidefinite, tr⁡(GGT)−1=∥(GGT)−1∥∗\operatorname{tr}(GG^{\mathsf T})^{-1}=\|(GG^{\mathsf T})^{-1}\|_*tr(GGT)−1=∥(GGT)−1∥∗​ is its nuclear (Schatten-1) norm, so this is the second moment of the nuclear norm of an inverse-Wishart matrix, Tropp–Webber Lemma B.2. Combined with the mean r/(k−r−1)r/(k-r-1)r/(k−r−1) it gives the variance of ∥G†∥F2\|G^{\dagger}\|_F^2∥G†∥F2​, which is what deviation bounds for the Frobenius error of the randomized SVD require.

Formalization Note. The left side is written as ∥G†∥F4=(∥G†∥F2)2\|G^{\dagger}\|_F^4=(\|G^{\dagger}\|_F^2)^2∥G†∥F4​=(∥G†∥F2​)2 with G†G^{\dagger}G† = pinvR; on the null set where GGTGG^{\mathsf T}GGT is singular pinvR is 000, which does not affect the integral.

Preamble
import Definitions.Def_GaussianMatrix_basic

open MeasureTheory ProbabilityTheory
open scoped Matrix
Formal statement
namespace GaussianMatrix
theorem pinv_frobenius_fourth_moment {r k : ℕ} (hrk : r + 4 ≤ k) :
    Integrable (fun G : Fin r → Fin k → ℝ => frobSq (pinvR (Matrix.of G)) ^ 2) (gaussianMatrix r k) ∧
    ∫ G, frobSq (pinvR (Matrix.of G)) ^ 2 ∂(gaussianMatrix r k)
      = ((r : ℝ) ^ 2 * ((k : ℝ) - r) - 2 * r * ((r : ℝ) - 1))
          / (((k : ℝ) - r) * ((k : ℝ) - r - 1) * ((k : ℝ) - r - 3)) := 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. 51, Lemma B.2 (Inverse moment bounds), second formula: E∥(GG∗)−1∥∗2=r2(k−r)−2r(r−1)(k−r)(k−r−1)(k−r−3)\mathbb E\|(GG^*)^{-1}\|_*^2=\frac{r^2(k-r)-2r(r-1)}{(k-r)(k-r-1)(k-r-3)}E∥(GG∗)−1∥∗2​=(k−r)(k−r−1)(k−r−3)r2(k−r)−2r(r−1)​ for r≤k−4r\le k-4r≤k−4, using ∥(GG∗)−1∥∗=tr⁡(GG∗)−1=∥G†∥F2\|(GG^*)^{-1}\|_*=\operatorname{tr}(GG^*)^{-1}=\|G^\dagger\|_F^2∥(GG∗)−1∥∗​=tr(GG∗)−1=∥G†∥F2​ (cf. 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), Appendix A.2 p. 65, proof of Proposition A.5).
Read-back

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

Throughout, μr,k\mu_{r,k}μr,k​ denotes the measure called gaussianMatrix r k: the product measure on the function space {0,…,r−1}×{0,…,k−1}→R\{0,\dots,r-1\}\times\{0,\dots,k-1\}\to\mathbb{R}{0,…,r−1}×{0,…,k−1}→R in which every one of the rkrkrk coordinates is an independent standard normal N(0,1)\mathcal N(0,1)N(0,1); it is a probability measure, and a sample GGG is viewed as the real r×kr\times kr×k matrix with entries GijG_{ij}Gij​. Matrix inversion (⋅)−1(\cdot)^{-1}(⋅)−1 is Mathlib's total inverse on square real matrices: it is the usual inverse when the determinant is nonzero and is the zero matrix otherwise. For an r×kr\times kr×k matrix GGG, write G†:=G⊤(GG⊤)−1G^{\dagger} := G^{\top}(GG^{\top})^{-1}G†:=G⊤(GG⊤)−1, a k×rk\times rk×r real matrix (the bundle's pinvR; it is the zero matrix when GG⊤GG^{\top}GG⊤ is singular), and ∥A∥F2:=∑i∑jAij2\|A\|_F^2 := \sum_i\sum_j A_{ij}^2∥A∥F2​:=∑i​∑j​Aij2​ (the bundle's frobSq).

Statement. Let r,kr,kr,k be natural numbers with r+4≤kr+4\le kr+4≤k. The theorem asserts the conjunction of:

  1. Integrability. The function G↦(∥G†∥F2)2=∥G⊤(GG⊤)−1∥F4G\mapsto \big(\|G^{\dagger}\|_F^{2}\big)^{2} = \|G^{\top}(GG^{\top})^{-1}\|_F^{4}G↦(∥G†∥F2​)2=∥G⊤(GG⊤)−1∥F4​ is integrable with respect to μr,k\mu_{r,k}μr,k​ (the outer square is the natural-number power 222).

  2. Value.

∫∥G⊤(GG⊤)−1∥F4  dμr,k(G)  =  r2 (k−r)  −  2 r (r−1)(k−r) (k−r−1) (k−r−3),\int \big\|G^{\top}(GG^{\top})^{-1}\big\|_F^{4}\;d\mu_{r,k}(G) \;=\; \frac{r^{2}\,(k-r)\;-\;2\,r\,(r-1)}{(k-r)\,(k-r-1)\,(k-r-3)},∫​G⊤(GG⊤)−1​F4​dμr,k​(G)=(k−r)(k−r−1)(k−r−3)r2(k−r)−2r(r−1)​,

with r,kr,kr,k cast to R\mathbb{R}R. Under k≥r+4k\ge r+4k≥r+4 the three factors k−rk-rk−r, k−r−1k-r-1k−r−1, k−r−3k-r-3k−r−3 are at least 444, 333, 111 respectively, so the denominator is positive and the division is ordinary.

Edge cases. The integral is the real Bochner integral (returning 000 for non-integrable integrands, but part 1 asserts integrability). When r=0r = 0r=0 the integrand is identically 000 (empty sum) and the right-hand side is 0−0(k)(k−1)(k−3)=0\frac{0 - 0}{(k)(k-1)(k-3)} = 0(k)(k−1)(k−3)0−0​=0; the hypothesis is then 4≤k4\le k4≤k. When r=1r = 1r=1 the numerator is k−1k-1k−1.

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