Theorem 1.6: Sub-Gaussian tail bound (linear combinations preserve sub-Gaussianity) #
Theorem 1.6 (Sub-Gaussian random vectors): A linear combination of independent sub-Gaussian random variables is sub-Gaussian with variance proxy σ²‖a‖².
Instances For
Corollary 1.7: Sub-Gaussian tail bound, symmetric form #
Corollary 1.7 (Upper tail): For independent sub-Gaussian Xᵢ ~ subG(σ²) and any a,
P[∑ᵢ aᵢXᵢ > t] ≤ exp(-t²/(2σ²‖a‖₂²)).
Instances For
Corollary 1.7 (Lower tail): For independent sub-Gaussian Xᵢ ~ subG(σ²) and any a,
P[∑ᵢ aᵢXᵢ < -t] ≤ exp(-t²/(2σ²‖a‖₂²)).
Instances For
Corollary 1.7 (Combined): Both upper and lower tail bounds for linear combinations.
Instances For
Lemma 1.8: Hoeffding's lemma #
Lemma 1.8 (Hoeffding's Lemma — MGF bound): If X has mean zero and X ∈ [a, b] a.s.,
then E[exp(sX)] ≤ exp(s²(b-a)²/8).
Instances For
Lemma 1.8 (Hoeffding's Lemma — sub-Gaussian): If X has mean zero and X ∈ [a, b] a.s.,
then X is sub-Gaussian with variance proxy (b-a)²/4.
Instances For
Definition 1.11: Sub-exponential random variable #
Definition 1.11: A random variable is sub-exponential with parameter λ if its MGF
satisfies E[exp(sX)] ≤ exp(s²λ²/2) for all |s| ≤ 1/λ. See IsSubExponential.