Let 1≤n≤N be integers. Let h be a standard Gaussian vector in RN and g a standard Gaussian vector in Rn, each with independent N(0,1) coordinates, and let ∥⋅∥2 be the Euclidean norm. Then
N−n≤E∥h∥2−E∥g∥2.
Equivalently, m↦E∥gm∥2−m is nondecreasing on m≥1, where gm is standard Gaussian in Rm.
This is the elementary input that turns Gordon's bound Eσmin(G)≥E∥hN∥2−E∥gn∥2 into the familiar Eσmin(G)≥N−n. Note that E∥hN∥2≤N, so the inequality is not a consequence of Jensen's inequality. It is sharp to second order: with am=E∥gm∥2, the gap (am+1−am)−(m+1−m) is of order m−3/2/8. One proof uses am=2Γ(2m+1)/Γ(2m), hence amam+1=m, together with log-convexity of Γ and a monotone-ratio argument that yields am2≤m−21+20m3.
Formalization Note. The law of h is Measure.pi fun _ : Fin N => gaussianReal 0 1, and ∥x∥2 is written ∑ixi2. The hypothesis n≥1 is necessary: for n=0 the claim would read N≤E∥hN∥2, which is false for every N≥1 (e.g. E∥h1∥=2/π<1). The hypothesis n≤N is also needed, since the inequality reverses for N<n. Both integrands are integrable.
Preamble
import Definitions.Def_GaussianMatrix_basic
open MeasureTheory ProbabilityTheory
open scoped Matrix
Formal statement
namespace GaussianMatrix
theorem expectation_norm_gaussian_diff {N n : ℕ} (hn : 1 ≤ n) (hnN : n ≤ N) :
Real.sqrt N - Real.sqrt n ≤
∫ x, Real.sqrt (∑ i, x i ^ 2) ∂(Measure.pi fun _ : Fin N => gaussianReal 0 1)
- ∫ x, Real.sqrt (∑ i, x i ^ 2) ∂(Measure.pi fun _ : Fin n => gaussianReal 0 1) := by sorry
end GaussianMatrix
Source
R. Vershynin, High-Dimensional Probability (Cambridge Univ. Press, 2018), hint to Exercise 7.3.4 (p. 170): 'f(n) := E||g||_2 - sqrt(n) is increasing in dimension n (take this fact for granted; it can be proved by a tedious calculation)'. Used in K. R. Davidson and S. J. Szarek, 'Local operator theory, random matrices and Banach spaces', Handbook of the Geometry of Banach Spaces I (2001), proof of Theorem II.13 (theorem number from memory).