Expected spectral norm of a Gaussian matrix:
ProvedGaussianMatrix.gordon_upperexpectationgaussian-matrixgordons-theoremrandom-matricesspectral-norm
Let be an random matrix with independent standard normal entries, and let be its spectral norm (largest singular value). Then
This is the upper half of Gordon's theorem for Gaussian matrices. It is the input for the deviation bound , and for the upper half of the conjunction gordon. It follows from the Sudakov–Fernique inequality by comparing with on finite nets of the unit spheres.
Formalization Note. The law of is gaussianMatrix N n, and specNorm is Mathlib's operator norm. No hypothesis on is needed: for or the norm is identically . The integrand is integrable (it is -Lipschitz for the Frobenius norm), so the Bochner-integral convention for non-integrable functions plays no role.
Preamble
import Definitions.Def_GaussianMatrix_basic open MeasureTheory ProbabilityTheory open scoped Matrix
Formal statement
namespace GaussianMatrix
theorem gordon_upper {N n : ℕ} :
∫ A, specNorm (Matrix.of A) ∂(gaussianMatrix N n) ≤ Real.sqrt N + Real.sqrt n := by sorry
end GaussianMatrix
Source
R. Vershynin, 'Introduction to the non-asymptotic analysis of random matrices' (2012, in Compressed Sensing: Theory and Applications), Theorem 5.32 (upper bound), proof via Slepian/Sudakov–Fernique; K. R. Davidson and S. J. Szarek, 'Local operator theory, random matrices and Banach spaces', Handbook of the Geometry of Banach Spaces I (2001), Theorem II.13; R. Vershynin, High-Dimensional Probability (2018), Theorem 7.3.1. Theorem numbers from memory.