Sudakov–Fernique inequality: dominated increments imply for centered Gaussian vectors
ProvedGaussianMatrix.sudakov_ferniqueLet be a finite index set, and let on a probability space and on a probability space be centered, jointly Gaussian random vectors in . That is, the laws of and are Gaussian measures on , and for all . Suppose the increments of are dominated by those of :
Then
This is the Gaussian comparison principle behind the sharp bound for an Gaussian matrix. On a finite net of , one compares with . Unlike Slepian's lemma, no equality of variances is required.
Formalization Note. Joint Gaussianity is expressed with Mathlib's HasGaussianLaw for the vector-valued map into ι → ℝ; this hypothesis also forces and to be probability measures. The maximum is written ⨆ t, X t ω, which is a genuine maximum for finite nonempty . For empty both sides equal (the real convention ), so the statement remains true. Both maxima are integrable: they are dominated by , and Gaussian coordinates are integrable. The two vectors live on possibly different probability spaces; no independence or coupling is assumed.
import Definitions.Def_GaussianMatrix_basic open MeasureTheory ProbabilityTheory open scoped Matrix
namespace GaussianMatrix
theorem sudakov_fernique {ι Ω Ω' : 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)
(hinc : ∀ s t, ∫ ω, (X s ω - X t ω) ^ 2 ∂P ≤ ∫ ω, (Y s ω - Y t ω) ^ 2 ∂Q) :
∫ ω, (⨆ t, X t ω) ∂P ≤ ∫ ω, (⨆ t, Y t ω) ∂Q := by sorry
end GaussianMatrix