Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 21 — Concentration inequalities II

Proved
WassersteinDRO.Guarantees.concentration_inequalities_ii

by mikedeng1 · Sep 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

operations-researchprobabilityrobust-optimization

Suppose the unknown true distribution PPP has mean vector μ\muμ and covariance matrix Σ\SigmaΣ, and there are α>2\alpha>2α>2, A>0A>0A>0 with EP[exp⁡(∥ξ∥2α)]≤AE_P[\exp(\|\xi\|_2^\alpha)] \le AEP​[exp(∥ξ∥2α​)]≤A. Then there is c>1c>1c>1, depending on PPP only through μ,Σ,α,A,m\mu,\Sigma,\alpha,A,mμ,Σ,α,A,m, such that for any η∈(0,1]\eta\in(0,1]η∈(0,1] the sample mean μ^\hat\muμ^​ and sample covariance Σ^\hat\SigmaΣ^ satisfy PN[(μ,Σ)∈Uε(μ^,Σ^)]≥1−ηP^N[(\mu,\Sigma)\in U_\varepsilon(\hat\mu,\hat\Sigma)] \ge 1-\etaPN[(μ,Σ)∈Uε​(μ^​,Σ^)]≥1−η whenever ε≥εN(η)=log⁡(c/η)/N\varepsilon \ge \varepsilon_N(\eta) = \log(c/\eta)/\sqrt{N}ε≥εN​(η)=log(c/η)/N​.

Preamble
import Mathlib
import Definitions.Def_WassersteinDRO_Guarantees_meanVector
import Definitions.Def_WassersteinDRO_Guarantees_covarianceMatrix
import Definitions.Def_WassersteinDRO_Guarantees_meanCovarianceUncertaintySet
import Definitions.Def_WassersteinDRO_Guarantees_empiricalDistribution
import Definitions.Def_WassersteinDRO_Guarantees_sampleMeasure

open MeasureTheory
Formal statement
namespace WassersteinDRO.Guarantees

/-- Theorem 21 (Concentration inequalities II), Kuhn et al. 2019, p. 23: suppose the unknown
true distribution `P` has mean vector `µ` and covariance matrix `Σ`, and there are `α > 2`,
`A > 0` with `E_P[exp(‖ξ‖₂^α)] ≤ A`. Then there is `c > 1`, depending on `P` only through
`µ,Σ,α,A,m`, such that for any `η ∈ (0,1]` the sample mean `µ̂` and sample covariance `Σ̂`
satisfy `P^N[(µ,Σ) ∈ U_ε(µ̂,Σ̂)] ≥ 1-η` whenever `ε ≥ ε_N(η) = log(c/η)/√N`. "Depends on `P`
only through `µ,Σ,α,A,m`" is encoded by quantifying `c` before `P` is fixed: a single `c`
works for every `P` sharing the same `(µ,Σ,α,A,m)` (`FAITHFULNESS_TRAPS.md` trap 8). -/
theorem concentration_inequalities_ii {m : ℕ}
    (μ : EuclideanSpace ℝ (Fin m)) (Sigma : Matrix (Fin m) (Fin m) ℝ) (α A : ℝ)
    (hα : 2 < α) (hA : 0 < A) :
    ∃ c : ℝ, c > 1 ∧
      ∀ (P : Measure (EuclideanSpace ℝ (Fin m))) (N : ℕ),
        IsProbabilityMeasure P → 0 < N →
        meanVector P = μ → covarianceMatrix P = Sigma →
        Integrable (fun x => Real.exp (‖x‖ ^ α)) P →
        (∫ x, Real.exp (‖x‖ ^ α) ∂P) ≤ A →
        ∀ η ε : ℝ, 0 < η → η ≤ 1 → ε ≥ Real.log (c / η) / Real.sqrt N →
          sampleMeasure P N
              {ξhat : Fin N → EuclideanSpace ℝ (Fin m) |
                (μ, Sigma) ∈ meanCovarianceUncertaintySet ε
                  (meanVector (empiricalDistribution ξhat))
                  (covarianceMatrix (empiricalDistribution ξhat))} ≥
            ENNReal.ofReal (1 - η) := by sorry

end WassersteinDRO.Guarantees
Source
Kuhn, Mohajerin Esfahani, Nguyen & Shafieezadeh-Abadeh, Wasserstein Distributionally Robust Optimization, INFORMS TutORials 2019, Theorem 21, p. 23, eq. (28)
Human review
  • Endorsed by Shuze Chen · Sep 28, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 28, 2026

    Confirmed by the mission captain (proposal self-audit).

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me