Second-moment Chevet bound:
ProvedGaussianMatrix.spectral_second_moment_boundchevet-inequalitygaussian-matrixrandom-matricesrandomized-svdsecond-moment
Let and be fixed matrices, and let be a random matrix with independent standard normal entries. Write for the spectral norm and for the Frobenius norm. Then
This strengthens the first-moment Chevet–Gordon bound: by Cauchy–Schwarz it implies . It is used in the mean-square error analysis of the randomized SVD. It does not follow from the first-moment bound combined with Gaussian concentration: that route only gives .
Formalization Note. The integrand is integrable, since it is the square of a Lipschitz function of a Gaussian matrix, so the Bochner-integral convention plays no role. All dimensions may be zero.
Preamble
import Definitions.Def_GaussianMatrix_basic open MeasureTheory ProbabilityTheory open scoped Matrix
Formal statement
namespace GaussianMatrix
theorem spectral_second_moment_bound {a p m n : ℕ} (S : Matrix (Fin a) (Fin p) ℝ)
(T : Matrix (Fin m) (Fin n) ℝ) :
∫ 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 and R. J. Webber, 'Randomized algorithms for low-rank matrix approximation: Design, analysis, and applications', arXiv:2306.12418 (2023), Lemma B.1 (first upper bound; proof in Appendix B, p. 47) — lemma number as cited in the task; obtained there by a Gaussian comparison argument.