Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Deviation of the extreme singular values of a Gaussian matrix: N−n−t≤smin⁡(A)≤smax⁡(A)≤N+n+t\sqrt N-\sqrt n-t\le s_{\min}(A)\le s_{\max}(A)\le\sqrt N+\sqrt n+tN​−n​−t≤smin​(A)≤smax​(A)≤N​+n​+t with probability ≥1−2e−t2/2\ge1-2e^{-t^2/2}≥1−2e−t2/2

Proved
GaussianMatrix.extreme_singular_values_deviation

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

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

Let A∈RN×nA\in\mathbb R^{N\times n}A∈RN×n, n≥1n\ge1n≥1, be a matrix whose entries are independent standard normal random variables. Then for every t≥0t\ge0t≥0, with probability at least 1−2exp⁡(−t2/2)1-2\exp(-t^2/2)1−2exp(−t2/2),

N−n−t ≤ smin⁡(A)andsmax⁡(A) ≤ N+n+t,\sqrt N-\sqrt n-t\ \le\ s_{\min}(A)\qquad\text{and}\qquad s_{\max}(A)\ \le\ \sqrt N+\sqrt n+t ,N​−n​−t ≤ smin​(A)andsmax​(A) ≤ N​+n​+t,

where smin⁡(A)=inf⁡∥x∥2=1∥Ax∥2s_{\min}(A)=\inf_{\|x\|_2=1}\|Ax\|_2smin​(A)=inf∥x∥2​=1​∥Ax∥2​ and smax⁡(A)=∥A∥s_{\max}(A)=\|A\|smax​(A)=∥A∥ 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 smin⁡s_{\min}smin​ and smax⁡s_{\max}smax​ are 111-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 σmin⁡\sigma_{\min}σmin​ of the head block Ω1\Omega_1Ω1​ in randomized low-rank approximation.

Formalization Note. The probability is a measure in [0,∞][0,\infty][0,∞] and the lower bound 1−2e−t2/21-2e^{-t^2/2}1−2e−t2/2 is computed with truncated subtraction, so the statement is vacuous when 2e−t2/2≥12e^{-t^2/2}\ge12e−t2/2≥1, i.e. t≤2log⁡2t\le\sqrt{2\log2}t≤2log2​, exactly as in the source. The inequality smin⁡(A)≤smax⁡(A)s_{\min}(A)\le s_{\max}(A)smin​(A)≤smax​(A) is not part of the event (it is immediate).

Preamble
import Definitions.Def_GaussianMatrix_basic

open MeasureTheory ProbabilityTheory
open scoped Matrix
Formal statement
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 GaussianMatrix
Source
R. Vershynin, *Introduction to the non-asymptotic analysis of random matrices*, Chapter 5 of Compressed Sensing: Theory and Applications (Y. Eldar, G. Kutyniok, eds.), Cambridge University Press, 2012, https://arxiv.org/abs/1011.3027 (v7), §5.3.1 p. 21, Corollary 5.35 (Gaussian matrices, deviation): for every t≥0t\ge0t≥0, with probability at least 1−2exp⁡(−t2/2)1-2\exp(-t^2/2)1−2exp(−t2/2), N−n−t≤smin⁡(A)≤smax⁡(A)≤N+n+t\sqrt N-\sqrt n-t\le s_{\min}(A)\le s_{\max}(A)\le\sqrt N+\sqrt n+tN​−n​−t≤smin​(A)≤smax​(A)≤N​+n​+t.
Read-back

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

Let N,nN, nN,n be natural numbers with 1≤n1 \le n1≤n (no relation between NNN and nnn is assumed; N=0N = 0N=0 and N<nN < nN<n are allowed) and let ttt be a real number with t≥0t \ge 0t≥0. Let μN,n\mu_{N,n}μN,n​ be the law of an N×nN \times nN×n array with i.i.d. N(0,1)\mathcal N(0,1)N(0,1) entries. For an N×nN \times nN×n real matrix AAA write σmin⁡(A):=inf⁡{∥Ax∥2:x∈Rn, x⋅x=1}\sigma_{\min}(A) := \inf\{\|Ax\|_2 : x \in \mathbb R^n,\ x\cdot x = 1\}σmin​(A):=inf{∥Ax∥2​:x∈Rn, x⋅x=1} (real infimum over the unit sphere, equal to inf⁡∥x∥2=1(Ax)⋅(Ax)\inf_{\|x\|_2=1}\sqrt{(Ax)\cdot(Ax)}inf∥x∥2​=1​(Ax)⋅(Ax)​; nonempty index set since n≥1n \ge 1n≥1, values ≥0\ge 0≥0, so σmin⁡(A)≥0\sigma_{\min}(A) \ge 0σmin​(A)≥0) and ∥A∥op\|A\|_{\mathrm{op}}∥A∥op​ for the ℓ2→ℓ2\ell_2\to\ell_2ℓ2​→ℓ2​ operator norm (largest singular value). The statement asserts the inequality in the extended nonnegative reals

1  −˙  ofReal⁡ ⁣(2e−t2/2)  ≤  μN,n({A:N−n−t≤σmin⁡(A)  and  ∥A∥op≤N+n+t}),1 \;\dot{-}\; \operatorname{ofReal}\!\big(2 e^{-t^2/2}\big) \;\le\; \mu_{N,n}\Big(\big\{A : \sqrt N - \sqrt n - t \le \sigma_{\min}(A)\ \text{ and }\ \|A\|_{\mathrm{op}} \le \sqrt N + \sqrt n + t\big\}\Big),1−˙​ofReal(2e−t2/2)≤μN,n​({A:N​−n​−t≤σmin​(A)  and  ∥A∥op​≤N​+n​+t}),

where −˙\dot{-}−˙​ is truncated subtraction in [0,∞][0,\infty][0,∞]: whenever 2e−t2/2≥12e^{-t^2/2} \ge 12e−t2/2≥1, i.e. 0≤t≤2ln⁡20 \le t \le \sqrt{2\ln 2}0≤t≤2ln2​, the left-hand side is 000 and the claim holds trivially. The right-hand side is the outer measure of the displayed set (no measurability is assumed). When N≤nN \le nN≤n the quantity N−n−t\sqrt N - \sqrt n - tN​−n​−t is ≤0≤σmin⁡(A)\le 0 \le \sigma_{\min}(A)≤0≤σmin​(A), so the first condition in the event holds for every AAA and only the operator-norm condition is binding. When N=0N = 0N=0 both σmin⁡\sigma_{\min}σmin​ and the operator norm are identically 000.

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