Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2, p. 910 (upper-bound part) — sup over 𝔽₂ of E_ℙ((r⁰ + r′ζ̃)⁺) ≤ π²(r⁰, r)

Proved
TractableDRO.MeanCov.theorem_2_upper

by mikedeng1 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

distributionally-robust-optimizationmoment-boundsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let F∈RN×nF \in \mathbb R^{N\times n}F∈RN×n, Σ∈RN×N\Sigma \in \mathbb R^{N \times N}Σ∈RN×N, V^⊆Rn\hat{\mathcal V} \subseteq \mathbb R^{n}V^⊆Rn, r0∈Rr^0 \in \mathbb Rr0∈R and r∈Rnr \in \mathbb R^{n}r∈Rn. Let F2\mathbb F_2F2​ be the family of probability distributions P\mathbb PP of a random vector ζ~∈Rn\tilde\zeta \in \mathbb R^{n}ζ~​∈Rn with finite second moments, mean ζ^=EP(ζ~)∈V^\hat\zeta = E_{\mathbb P}(\tilde\zeta) \in \hat{\mathcal V}ζ^​=EP​(ζ~​)∈V^ and EP(F(ζ~−ζ^)(ζ~−ζ^)′F′)=ΣE_{\mathbb P}(F(\tilde\zeta - \hat\zeta)(\tilde\zeta - \hat\zeta)'F') = \SigmaEP​(F(ζ~​−ζ^​)(ζ~​−ζ^​)′F′)=Σ. Then

sup⁡P∈F2EP((r0+r′ζ~)+)≤π2(r0,r)=inf⁡y: F′y=r sup⁡ζ^∈V^{12(r0+r′ζ^)+12(r0+r′ζ^)2+y′Σy}.\sup_{\mathbb P \in \mathbb F_2} E_{\mathbb P}\big((r^0 + r'\tilde\zeta)^+\big) \le \pi^2(r^0, r) = \inf_{y:\, F'y = r} \ \sup_{\hat\zeta \in \hat{\mathcal V}} \Big\{ \tfrac12 (r^0 + r'\hat\zeta) + \tfrac12 \sqrt{(r^0 + r'\hat\zeta)^2 + y'\Sigma y} \Big\}.P∈F2​sup​EP​((r0+r′ζ~​)+)≤π2(r0,r)=y:F′y=rinf​ ζ^​∈V^sup​{21​(r0+r′ζ^​)+21​(r0+r′ζ^​)2+y′Σy​}.

Both sides are extended reals: the left side is −∞-\infty−∞ when F2\mathbb F_2F2​ is empty and the right side is +∞+\infty+∞ when F′y=rF'y = rF′y=r has no solution.

This is the bound half of Theorem 2 of Goh and Sim: the deterministic problem π2\pi^2π2 is a valid, tractable upper bound on the worst-case expected positive part over all distributions with the prescribed mean set and covariance.

Formalization Note No hypothesis on FFF, Σ\SigmaΣ or V^\hat{\mathcal V}V^ is needed for this half: membership in F2\mathbb F_2F2​ already forces Σ=F CovP(ζ~) F′\Sigma = F\,\mathrm{Cov}_{\mathbb P}(\tilde\zeta)\,F'Σ=FCovP​(ζ~​)F′, which is positive semidefinite. Objects are those of TractableDRO.MeanCov.Model.

Preamble
import Mathlib
import Definitions.Def_TractableDRO_MeanCov_Model

open Matrix
Formal statement
namespace TractableDRO.MeanCov

theorem theorem_2_upper {n N : ℕ} (F : Matrix (Fin N) (Fin n) ℝ)
    (Sig : Matrix (Fin N) (Fin N) ℝ) (Vhat : Set (Fin n → ℝ)) (r0 : ℝ) (r : Fin n → ℝ) :
    TractableDRO.MeanSupport.worstCase (family2 F Sig Vhat) r0 r ≤ pi2 F Sig Vhat r0 r := by sorry

end TractableDRO.MeanCov
Source
Goh & Sim, Distributionally Robust Optimization and Its Tractable Approximations, Oper. Res. 58(4), 2010, p. 910, Theorem 2 and (22)
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 7, 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