Slepian's inequality: equal variances and dominated increments imply for centered Gaussian vectors
ProvedGaussianMatrix.slepian_tail_comparisonLet be a finite index set. Let be a random vector on a probability space and one on a probability space . Assume both are centered and jointly Gaussian: the laws of and are Gaussian measures on , and for every . Suppose that the variances agree and that the increments of are dominated by those of :
Then for every threshold ,
Equivalently, with equal variances the hypothesis says : the more strongly correlated vector has a stochastically smaller maximum.
This is Slepian's inequality, the comparison principle that Tropp and Webber use in the proof of Lemma B.1 of arXiv:2306.12418. There it is applied to and . The scalar Gaussian is added to equalize the variances. This gives the sharp second-moment Chevet bound . Unlike the Sudakov–Fernique inequality, which needs no variance condition, it compares whole distributions of the maxima and not just their expectations. So it controls every moment .
Formalization Note. Joint Gaussianity is expressed with Mathlib's HasGaussianLaw for the vector map into ι → ℝ. This also forces and to be probability measures. Means, variances and increments are written as Bochner integrals; Gaussian coordinates are square-integrable, so these are the true moments. The maximum is ⨆ t, X t ω, a genuine maximum for finite nonempty . For empty both maxima equal (the real convention ), and the two sides coincide, since both are probability measures evaluated on . The strict-inequality form stated here is equivalent to the form found in textbooks, by monotone limits in . The two vectors may live on different probability spaces; no coupling is assumed.
import Definitions.Def_GaussianMatrix_basic open MeasureTheory ProbabilityTheory open scoped Matrix
namespace GaussianMatrix
theorem slepian_tail_comparison {ι Ω Ω' : Type*} [Fintype ι] [MeasurableSpace Ω]
[MeasurableSpace Ω'] {P : Measure Ω} {Q : Measure Ω'} (X : ι → Ω → ℝ) (Y : ι → Ω' → ℝ)
(hX : HasGaussianLaw (fun ω t => X t ω) P) (hY : HasGaussianLaw (fun ω t => Y t ω) Q)
(hX0 : ∀ t, ∫ ω, X t ω ∂P = 0) (hY0 : ∀ t, ∫ ω, Y t ω ∂Q = 0)
(hvar : ∀ t, ∫ ω, X t ω ^ 2 ∂P = ∫ ω, Y t ω ^ 2 ∂Q)
(hinc : ∀ s t, ∫ ω, (X s ω - X t ω) ^ 2 ∂P ≤ ∫ ω, (Y s ω - Y t ω) ^ 2 ∂Q) (τ : ℝ) :
P {ω | τ < ⨆ t, X t ω} ≤ Q {ω | τ < ⨆ t, Y t ω} := by sorry
end GaussianMatrix