Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Slepian's inequality: equal variances and dominated increments imply P(max⁡tXt>τ)≤P(max⁡tYt>τ)\mathbb P(\max_t X_t>\tau)\le\mathbb P(\max_t Y_t>\tau)P(maxt​Xt​>τ)≤P(maxt​Yt​>τ) for centered Gaussian vectors

Proved
GaussianMatrix.slepian_tail_comparison

by tc · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

comparison-inequalitygaussian-processesslepians-lemmasupremum-of-gaussian-processtail-bound

Let ι\iotaι be a finite index set. Let X=(Xt)t∈ιX=(X_t)_{t\in\iota}X=(Xt​)t∈ι​ be a random vector on a probability space (Ω,P)(\Omega,P)(Ω,P) and Y=(Yt)t∈ιY=(Y_t)_{t\in\iota}Y=(Yt​)t∈ι​ one on a probability space (Ω′,Q)(\Omega',Q)(Ω′,Q). Assume both are centered and jointly Gaussian: the laws of ω↦(Xt(ω))t\omega\mapsto(X_t(\omega))_{t}ω↦(Xt​(ω))t​ and ω′↦(Yt(ω′))t\omega'\mapsto(Y_t(\omega'))_{t}ω′↦(Yt​(ω′))t​ are Gaussian measures on Rι\mathbb R^\iotaRι, and EXt=EYt=0\mathbb E X_t=\mathbb E Y_t=0EXt​=EYt​=0 for every ttt. Suppose that the variances agree and that the increments of XXX are dominated by those of YYY:

E Xt2=E Yt2,E (Xs−Xt)2≤E (Ys−Yt)2for all s,t∈ι.\mathbb E\,X_t^2=\mathbb E\,Y_t^2,\qquad \mathbb E\,(X_s-X_t)^2\le\mathbb E\,(Y_s-Y_t)^2\qquad\text{for all } s,t\in\iota .EXt2​=EYt2​,E(Xs​−Xt​)2≤E(Ys​−Yt​)2for all s,t∈ι.

Then for every threshold τ∈R\tau\in\mathbb Rτ∈R,

P(max⁡t∈ιXt>τ)  ≤  Q(max⁡t∈ιYt>τ).P\Big(\max_{t\in\iota}X_t>\tau\Big)\;\le\;Q\Big(\max_{t\in\iota}Y_t>\tau\Big).P(t∈ιmax​Xt​>τ)≤Q(t∈ιmax​Yt​>τ).

Equivalently, with equal variances the hypothesis says EXsXt≥EYsYt\mathbb E X_sX_t\ge\mathbb E Y_sY_tEXs​Xt​≥EYs​Yt​: the more strongly correlated vector XXX 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 Xu,v=⟨S∗u,GTv⟩+∥S∗u∥∥Tv∥γX_{u,v}=\langle S^{*}u,GTv\rangle+\|S^{*}u\|\|Tv\|\gammaXu,v​=⟨S∗u,GTv⟩+∥S∗u∥∥Tv∥γ and Yu,v=∥S∗u∥⟨h,Tv⟩+∥Tv∥⟨g,S∗u⟩Y_{u,v}=\|S^{*}u\|\langle h,Tv\rangle+\|Tv\|\langle g,S^{*}u\rangleYu,v​=∥S∗u∥⟨h,Tv⟩+∥Tv∥⟨g,S∗u⟩. The scalar Gaussian γ\gammaγ is added to equalize the variances. This gives the sharp second-moment Chevet bound E∥SGT∥2≤(∥S∥∥T∥F+∥S∥F∥T∥)2\mathbb E\|SGT\|^2\le(\|S\|\|T\|_F+\|S\|_F\|T\|)^2E∥SGT∥2≤(∥S∥∥T∥F​+∥S∥F​∥T∥)2. 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 E(max⁡X)+q\mathbb E(\max X)_+^qE(maxX)+q​.

Formalization Note. Joint Gaussianity is expressed with Mathlib's HasGaussianLaw for the vector map ω↦(t↦Xt(ω))\omega\mapsto(t\mapsto X_t(\omega))ω↦(t↦Xt​(ω)) into ι → ℝ. This also forces PPP and QQQ 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 ι\iotaι. For empty ι\iotaι both maxima equal 000 (the real convention sup⁡∅=0\sup\emptyset=0sup∅=0), and the two sides coincide, since both are probability measures evaluated on {0>τ}\{0>\tau\}{0>τ}. The strict-inequality form stated here is equivalent to the form P(max⁡X≥τ)≤Q(max⁡Y≥τ)P(\max X\ge\tau)\le Q(\max Y\ge\tau)P(maxX≥τ)≤Q(maxY≥τ) found in textbooks, by monotone limits in τ\tauτ. The two vectors may live on different probability spaces; no coupling is assumed.

Preamble
import Definitions.Def_GaussianMatrix_basic

open MeasureTheory ProbabilityTheory
open scoped Matrix
Formal statement
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
Source
R. Vershynin, High-Dimensional Probability (Cambridge Univ. Press, 2018), Section 7.2, Theorem 7.2.1 (Slepian's inequality), stated there for mean-zero Gaussian processes with E X_t^2 = E Y_t^2 and E(X_t-X_s)^2 <= E(Y_t-Y_s)^2, conclusion P(sup X >= tau) <= P(sup Y >= tau); theorem number from memory, cited by Tropp-Webber (arXiv:2306.12418, proof of Lemma B.1) as [105, Sec. 7.2]. Original: D. Slepian, 'The one-sided barrier problem for Gaussian noise', Bell System Tech. J. 41 (1962), 463-501.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me