Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(15), p. 8 — the robust chance constraint holds iff the worst-case VaR is ≤ 0

Proved
DRJointCC.Individual.eq_15

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

chance-constraintdistributionally-robust-optimizationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1value-at-risk

Let P\mathcal PP be the set of probability distributions on Rk\mathbb R^kRk with mean μ\muμ and covariance Σ≻0\Sigma\succ0Σ≻0, let ϵ∈(0,1)\epsilon\in(0,1)ϵ∈(0,1), and let L:Rk→RL:\mathbb R^k\to\mathbb RL:Rk→R be a measurable loss function. Then

inf⁡P∈PP(L(ξ~)≤0)≥1−ϵ  ⟺  WC-VaRϵ(L(ξ~))≤0,\inf_{\mathbb P\in\mathcal P}\mathbb P\big(L(\tilde\xi)\le0\big)\ge1-\epsilon\iff\mathrm{WC\text{-}VaR}_\epsilon\big(L(\tilde\xi)\big)\le0,P∈Pinf​P(L(ξ~​)≤0)≥1−ϵ⟺WC-VaRϵ​(L(ξ~​))≤0,

where WC-VaRϵ(L(ξ~))=inf⁡{γ∈R:inf⁡P∈PP(L(ξ~)≤γ)≥1−ϵ}\mathrm{WC\text{-}VaR}_\epsilon(L(\tilde\xi))=\inf\{\gamma\in\mathbb R:\inf_{\mathbb P\in\mathcal P}\mathbb P(L(\tilde\xi)\le\gamma)\ge1-\epsilon\}WC-VaRϵ​(L(ξ~​))=inf{γ∈R:infP∈P​P(L(ξ~​)≤γ)≥1−ϵ} is the worst-case Value-at-Risk (14).

This is the first step of the proof of Theorem 2.2: it reduces the distributionally robust chance constraint to a sign condition on the worst-case VaR.

Formalization Note The paper states (15) inside the proof of Theorem 2.2, for a continuous concave or quadratic loss; its argument uses only measurability of LLL, so the statement is made for every measurable LLL, which is stronger. The worst-case VaR is extended-real valued. The standing assumptions Σ≻0\Sigma\succ0Σ≻0 and ϵ∈(0,1)\epsilon\in(0,1)ϵ∈(0,1) of §2 are hypotheses.

Preamble
import Mathlib
import Definitions.Def_DRJointCC_Individual_Individual

open MeasureTheory
open scoped ENNReal
Formal statement
namespace DRJointCC.Individual

/-- (15), p. 8: under the standing assumptions, the distributionally robust individual chance
constraint holds iff the worst-case VaR (14) is nonpositive, for every measurable loss `L`. -/
theorem eq_15 {k : ℕ} (μ : Fin k → ℝ) (Sig : Matrix (Fin k) (Fin k) ℝ) (hSig : Sig.PosDef)
    (ε : ℝ) (hε : 0 < ε) (hε1 : ε < 1)
    (L : (Fin k → ℝ) → ℝ) (hL : Measurable L) :
    ENNReal.ofReal (1 - ε) ≤ ⨅ P ∈ ambiguitySet μ Sig, P {ξ | L ξ ≤ 0} ↔
      wcVaR ε μ Sig L ≤ 0 := by sorry

end DRJointCC.Individual
Source
Zymler, Kuhn, Rustem, Distributionally Robust Joint Chance Constraints with Second-Order Moment Information, Math. Program. 137 (2013), accepted manuscript of 13 Aug 2011, p. 8, (15) (proof of Theorem 2.2)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

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