Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 13 — Gelbrich hull

Disproved
WassersteinDRO.Gelbrich.gelbrich_hull_containment

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

operations-researchprobabilityrobust-optimization

If the nominal distribution P^N\hat P_NP^N​ has mean vector μ^∈Rm\hat\mu \in \mathbb{R}^mμ^​∈Rm and covariance matrix Σ^∈S+m\hat\Sigma \in S^m_+Σ^∈S+m​, then Bε,p(P^N)⊆Gε(μ^,Σ^)B_{\varepsilon,p}(\hat P_N) \subseteq G_\varepsilon(\hat\mu,\hat\Sigma)Bε,p​(P^N​)⊆Gε​(μ^​,Σ^) for every p≥2p \ge 2p≥2: the Gelbrich hull is an outer approximation of every type-ppp Wasserstein ball with p≥2p \ge 2p≥2, using only first- and second-order moment information about the nominal distribution.

Preamble
import Mathlib
import Definitions.Def_WassersteinDRO_Gelbrich_ambiguitySet
import Definitions.Def_WassersteinDRO_Gelbrich_gelbrichHull

open MeasureTheory
Formal statement
namespace WassersteinDRO.Gelbrich

/-- Theorem 13 (Gelbrich hull), Kuhn et al. 2019, p. 18 — the goal theorem: if the nominal
distribution `P̂N` has mean vector `μ̂` and covariance matrix `Ŝ`, then the Wasserstein
ambiguity set is contained in the Gelbrich hull, `B_{ε,p}(P̂N) ⊆ G_ε(μ̂,Ŝ)`, for every `p ≥ 2`.
This is the outer approximation that Corollary 1 turns into a tractable upper bound on the
worst-case risk, and that Theorem 16 (not formalized in this chunk — see `STATUS.md`) sharpens
to an equality for quadratic losses and elliptical nominal distributions. -/
theorem gelbrich_hull_containment {m : ℕ} (ε p : ℝ) (hp : 2 ≤ p)
    (Ξ : Set (EuclideanSpace ℝ (Fin m))) (PN : Measure (EuclideanSpace ℝ (Fin m)))
    (μhat : EuclideanSpace ℝ (Fin m)) (SigmaHat : Matrix (Fin m) (Fin m) ℝ)
    (hμ : meanVector PN = μhat) (hS : covarianceMatrix PN = SigmaHat) :
    ambiguitySet ε p Ξ PN ⊆ gelbrichHull ε Ξ μhat SigmaHat := by sorry

end WassersteinDRO.Gelbrich
Source
Kuhn, Mohajerin Esfahani, Nguyen & Shafieezadeh-Abadeh, Wasserstein Distributionally Robust Optimization, INFORMS TutORials 2019, Theorem 13, p. 18
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