Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 1 — Gelbrich risk bound

Disproved
WassersteinDRO.Gelbrich.gelbrich_risk_bound

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 μ^\hat\muμ^​ and covariance matrix Σ^\hat\SigmaΣ^ and p≥2p \ge 2p≥2, then for every loss function ℓ\ellℓ the worst-case risk over the Wasserstein ambiguity set is bounded above by the Gelbrich risk: Rε,p(P^N,ℓ)≤Rε(μ^,Σ^,ℓ)R_{\varepsilon,p}(\hat P_N,\ell) \le R_\varepsilon(\hat\mu,\hat\Sigma,\ell)Rε,p​(P^N​,ℓ)≤Rε​(μ^​,Σ^,ℓ).

Preamble
import Mathlib
import Definitions.Def_WassersteinDRO_Gelbrich_worstCaseRisk
import Definitions.Def_WassersteinDRO_Gelbrich_gelbrichRisk

open MeasureTheory
Formal statement
namespace WassersteinDRO.Gelbrich

/-- Corollary 1 (Gelbrich risk), Kuhn et al. 2019, p. 18, eq. (18): if `P̂N` has mean vector
`μ̂` and covariance matrix `Ŝ` and `p ≥ 2`, then the worst-case risk of any fixed loss
function `ℓ` is bounded above by the Gelbrich risk, `R_{ε,p}(P̂N,ℓ) ≤ R_ε(μ̂,Ŝ,ℓ)`. (The
paper's companion statement for the worst-case *optimal* risk over a loss class `L`,
`R_{ε,p}(P̂N,L) ≤ R_ε(μ̂,Ŝ,L)`, follows immediately by taking the infimum over `ℓ ∈ L` on both
sides of this bound and is not separately formalized — see `STATUS.md`.) -/
theorem gelbrich_risk_bound {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)
    (ℓ : EuclideanSpace ℝ (Fin m) → ℝ) :
    worstCaseRisk ε p Ξ PN ℓ ≤ gelbrichRisk ε Ξ μhat SigmaHat ℓ := by sorry

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