Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Closed-form worst-case value-at-risk over marginalized semivariance ambiguity sets

Proved
DRCVRP.Marginal.semivariance_worstCaseVaR_eq

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

distributionally-robust-optimizationp2o-batch-p200bp2o-gran-per-chapterp2o-plan-paperp2o-v1value-at-risk

Let P\mathcal PP be a marginalized semivariance ambiguity set of the form (10),

P={P∈P0(Rn): P[q~∈Q]=1, EP[q~]=μ, EP[[q~i−μi]+2]≤σi+, EP[[μi−q~i]+2]≤σi−  ∀i∈VC},\mathcal P=\Big\{\mathbb P\in\mathcal P_0(\mathbb R^n):\ \mathbb P[\tilde{\boldsymbol q}\in\mathcal Q]=1,\ \mathbb E_{\mathbb P}[\tilde{\boldsymbol q}]=\boldsymbol\mu,\ \mathbb E_{\mathbb P}\big[[\tilde q_i-\mu_i]_+^2\big]\le\sigma_i^+,\ \mathbb E_{\mathbb P}\big[[\mu_i-\tilde q_i]_+^2\big]\le\sigma_i^-\ \ \forall i\in V_C\Big\},P={P∈P0​(Rn): P[q~​∈Q]=1, EP​[q~​]=μ, EP​[[q~​i​−μi​]+2​]≤σi+​, EP​[[μi​−q~​i​]+2​]≤σi−​  ∀i∈VC​},

where [x]+=max⁡{x,0}[x]_+=\max\{x,0\}[x]+​=max{x,0}, Q=[q‾,q‾]\mathcal Q=[\underline{\boldsymbol q},\overline{\boldsymbol q}]Q=[q​,q​] with q‾≥0\underline{\boldsymbol q}\ge\mathbf 0q​≥0, μ∈int⁡Q\boldsymbol\mu\in\operatorname{int}\mathcal Qμ∈intQ, and σ+,σ−>0\boldsymbol\sigma^+,\boldsymbol\sigma^->\mathbf 0σ+,σ−>0. Let ϵ∈(0,1)\epsilon\in(0,1)ϵ∈(0,1). Then for every customer iii,

sup⁡P∈PP-VaR1−ϵ[q~i]=μi+min⁡{q‾i−μi, 1−ϵϵ(μi−q‾i), σi+ϵ, (1−ϵ)σi−ϵ}.\sup_{\mathbb P\in\mathcal P}\mathbb P\text{-VaR}_{1-\epsilon}[\tilde q_i]=\mu_i+\min\Big\{\overline q_i-\mu_i,\ \frac{1-\epsilon}{\epsilon}(\mu_i-\underline q_i),\ \sqrt{\frac{\sigma_i^+}{\epsilon}},\ \frac{\sqrt{(1-\epsilon)\sigma_i^-}}{\epsilon}\Big\}.P∈Psup​P-VaR1−ϵ​[q~​i​]=μi​+min{q​i​−μi​, ϵ1−ϵ​(μi​−q​i​), ϵσi+​​​, ϵ(1−ϵ)σi−​​​}.

The last two terms come from the upper and the lower semivariance bound respectively. With Theorem 3 this gives the worst-case value-at-risk of every customer set over (10).

Formalization Note Customers are Fin n (0-based); the left side is worstCaseVaR (semivarianceSet qlo qhi μ σplus σminus) ε {i}. The four-term minimum is nested binary min. In the fourth term the root is taken of the product (1−ϵ)σi−(1-\epsilon)\sigma_i^-(1−ϵ)σi−​ and the division by ϵ\epsilonϵ is outside it, as printed.

Preamble
import Mathlib
import Definitions.Def_MultistageStochastic_RiskFunctional
import Definitions.Def_DRCVRP_Marginal_WorstCaseVaR
import Definitions.Def_DRCVRP_Marginal_AmbiguitySets

open MeasureTheory
Formal statement
namespace DRCVRP.Marginal

/-- Proposition 4 (Ghosal and Wiesemann 2020, §4.3, p. 725, Eq. (11)): the worst-case
value-at-risk of one customer's demand over the marginalized semivariance ambiguity set (10). -/
theorem semivariance_worstCaseVaR_eq {n : ℕ}
    (qlo qhi μ : Fin n → ℝ) (ε : ℝ) (hε₀ : 0 < ε) (hε₁ : ε < 1)
    (hqlo : ∀ i, 0 ≤ qlo i) (hμ : ∀ i, qlo i < μ i ∧ μ i < qhi i)
    (σplus σminus : Fin n → ℝ) (hσplus : ∀ i, 0 < σplus i) (hσminus : ∀ i, 0 < σminus i)
    (i : Fin n) :
    worstCaseVaR (semivarianceSet qlo qhi μ σplus σminus) ε {i} =
      μ i + min (min (min (qhi i - μ i) ((1 - ε) / ε * (μ i - qlo i)))
        (Real.sqrt (σplus i / ε))) (Real.sqrt ((1 - ε) * σminus i) / ε) := by sorry

end DRCVRP.Marginal
Source
Ghosal and Wiesemann, The Distributionally Robust Chance-Constrained Vehicle Routing Problem, Oper. Res. 68(3) (2020) 716–732, §4.3, p. 725, Proposition 4, Eq. (11) (ambiguity set Eq. (10))
Human review
  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me