Small-ball bound for the distance of a Gaussian column to the span of the others:
ProvedGaussianMatrix.dist_col_span_small_ballLet and let be an random matrix with independent standard normal entries, with columns . Fix a column index and let , with
Then for every real with ,
Conditionally on the other columns, is a standard Gaussian vector independent of , a subspace of dimension at most ; the squared distance of to it dominates a variable with degrees of freedom, whose lower tail obeys the stated bound. Integrating over the other columns gives the claim.
Combined with the deterministic reduction and a union bound over , this yields the small-ball estimate .
Formalization Note. The law of is gaussianMatrix N n (a product over rows of product measures); the event is written with the explicit infimum, and the probability of a possibly non-measurable set is the outer measure (the set is in fact measurable). The dimension of may drop below ; the bound holds regardless since the degrees of freedom only increase.
import Definitions.Def_GaussianMatrix_basic open MeasureTheory ProbabilityTheory open scoped Matrix
namespace GaussianMatrix
theorem dist_col_span_small_ball {N n : ℕ} (hnN : n ≤ N) (j : Fin n) (u : ℝ) (hu : 0 ≤ u)
(hud : u ≤ (N : ℝ) - n + 1) :
(gaussianMatrix N n) {A | (⨅ x : {x : Fin n → ℝ // x j = 1},
Real.sqrt ((Matrix.of A *ᵥ x.1) ⬝ᵥ (Matrix.of A *ᵥ x.1))) ^ 2 ≤ u}
≤ ENNReal.ofReal ((Real.exp 1 * u / ((N : ℝ) - n + 1)) ^ (((N : ℝ) - n + 1) / 2)) := by sorry
end GaussianMatrix