Deviation of the extreme singular values of a Gaussian matrix: with probability
ProvedGaussianMatrix.extreme_singular_values_deviationLet , , be a matrix whose entries are independent standard normal random variables. Then for every , with probability at least ,
where and is the spectral norm.
This is Vershynin's Corollary 5.35, the non-asymptotic Gaussian analogue of the Bai–Yin law with explicit sub-Gaussian deviations. It follows from Gordon's expectation bounds and Gaussian concentration, since and are -Lipschitz functions of the matrix in the Frobenius norm. It is the standard tool for showing that a Gaussian sketch is a near-isometry, and for lower-bounding of the head block in randomized low-rank approximation.
Formalization Note. The probability is a measure in and the lower bound is computed with truncated subtraction, so the statement is vacuous when , i.e. , exactly as in the source. The inequality is not part of the event (it is immediate).
import Definitions.Def_GaussianMatrix_basic open MeasureTheory ProbabilityTheory open scoped Matrix
namespace GaussianMatrix
theorem extreme_singular_values_deviation {N n : ℕ} (hn : 1 ≤ n) (t : ℝ) (ht : 0 ≤ t) :
1 - ENNReal.ofReal (2 * Real.exp (-t ^ 2 / 2))
≤ (gaussianMatrix N n) {A | Real.sqrt N - Real.sqrt n - t ≤ sMin (Matrix.of A) ∧
specNorm (Matrix.of A) ≤ Real.sqrt N + Real.sqrt n + t} := by sorry
end GaussianMatrixRead-back
What the Lean code literally says, in plain math · claude-fable-5-1
Let be natural numbers with (no relation between and is assumed; and are allowed) and let be a real number with . Let be the law of an array with i.i.d. entries. For an real matrix write (real infimum over the unit sphere, equal to ; nonempty index set since , values , so ) and for the operator norm (largest singular value). The statement asserts the inequality in the extended nonnegative reals
where is truncated subtraction in : whenever , i.e. , the left-hand side is and the claim holds trivially. The right-hand side is the outer measure of the displayed set (no measurability is assumed). When the quantity is , so the first condition in the event holds for every and only the operator-norm condition is binding. When both and the operator norm are identically .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.