Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 1159 — max⁡π∈PπBα+11−βπ⊤u=α+11−β(π0)⊤u+γ∗(u)1−β\max_{\pi\in\mathcal P_\pi^B}\alpha+\frac{1}{1-\beta}\pi^\top u=\alpha+\frac{1}{1-\beta}(\pi^0)^\top u+\frac{\gamma^*(u)}{1-\beta}maxπ∈PπB​​α+1−β1​π⊤u=α+1−β1​(π0)⊤u+1−βγ∗(u)​

Proved
WorstCaseCVaR.Box.max_decomposition

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

cvarlinear-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let 0<β<10 < \beta < 10<β<1, α∈R\alpha \in \mathbb Rα∈R, u∈RSu \in \mathbb R^Su∈RS, and let π0,η‾,η‾∈RS\pi^0, \underline\eta, \overline\eta \in \mathbb R^Sπ0,η​,η​∈RS define the box uncertainty set PπB\mathcal P_\pi^BPπB​ of (21). Suppose the linear program (22),

max⁡η∈RS{u⊤η:e⊤η=0, η‾≤η≤η‾},\max_{\eta \in \mathbb R^S}\{u^\top\eta : e^\top\eta = 0,\ \underline\eta \le \eta \le \overline\eta\},η∈RSmax​{u⊤η:e⊤η=0, η​≤η≤η​},

is feasible. Then (22) attains its optimal value γ∗(u)\gamma^*(u)γ∗(u), and the maximum of α+11−βπ⊤u\alpha + \frac{1}{1-\beta}\pi^\top uα+1−β1​π⊤u over π∈PπB\pi \in \mathcal P_\pi^Bπ∈PπB​ is attained and equals

max⁡π∈PπBα+11−βπ⊤u=α+11−β(π0)⊤u+γ∗(u)1−β.\max_{\pi \in \mathcal P_\pi^B} \alpha + \frac{1}{1-\beta}\pi^\top u = \alpha + \frac{1}{1-\beta}(\pi^0)^\top u + \frac{\gamma^*(u)}{1-\beta}.π∈PπB​max​α+1−β1​π⊤u=α+1−β1​(π0)⊤u+1−βγ∗(u)​.

This reduces the worst-case constraint (18) over the box to the optimal value of a single linear program, which is the first step toward the LP reformulation (24)–(30).

Formalization Note "Attained maximum with value vvv" is IsGreatest of the image set. Feasibility of (22) is assumed; it is equivalent to nonemptiness of PπB\mathcal P_\pi^BPπB​.

Preamble
import Mathlib
import Definitions.Def_WorstCaseCVaR_Box_DualPair

open Matrix
Formal statement
namespace WorstCaseCVaR.Box

/-- p. 1159, display before (22): if (22) is feasible, then (22) attains its optimal value
`γ*(u)`, and `max_{π ∈ 𝒫_π^B} α + (1 − β)⁻¹ πᵀu` exists and equals
`α + (1 − β)⁻¹ (π⁰)ᵀu + γ*(u)/(1 − β)`. -/
theorem max_decomposition {S : ℕ} (β α : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1)
    (π0 ηlo ηhi u : Fin S → ℝ) (hfeas : (lp22Feasible ηlo ηhi).Nonempty) :
    IsGreatest ((fun η => u ⬝ᵥ η) '' lp22Feasible ηlo ηhi) (gammaStar ηlo ηhi u) ∧
    IsGreatest ((fun π => α + (1 - β)⁻¹ * (π ⬝ᵥ u)) '' boxSet π0 ηlo ηhi)
      (α + (1 - β)⁻¹ * (π0 ⬝ᵥ u) + gammaStar ηlo ηhi u / (1 - β)) := by sorry

end WorstCaseCVaR.Box
Source
Zhu & Fukushima, Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management, Oper. Res. 57(5), 2009, p. 1159, display preceding Eq. (22)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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