Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2 — a feasible point of (16)–(20) plus an optimal solution of (23) is feasible to (24)–(30)

Proved
WorstCaseCVaR.Box.feasible_16_to_24

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

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

Let f:Rn×Rm→Rf : \mathbb R^n \times \mathbb R^m \to \mathbb Rf:Rn×Rm→R, scenarios y[1],…,y[S]∈Rmy_{[1]}, \dots, y_{[S]} \in \mathbb R^my[1]​,…,y[S]​∈Rm, a set X⊆Rn\mathcal X \subseteq \mathbb R^nX⊆Rn, 0<β<10 < \beta < 10<β<1, and box data π0,η‾,η‾∈RS\pi^0, \underline\eta, \overline\eta \in \mathbb R^Sπ0,η​,η​∈RS be given. If (x,u,α,θ)(x, u, \alpha, \theta)(x,u,α,θ) is feasible to (16)–(20) with Pπ=PπB\mathcal P_\pi = \mathcal P_\pi^BPπ​=PπB​ and (z,ξ,ω)(z, \xi, \omega)(z,ξ,ω) is an optimal solution of the linear program (23) with this uuu, then (x,u,z,ξ,ω,α,θ)(x, u, z, \xi, \omega, \alpha, \theta)(x,u,z,ξ,ω,α,θ) is feasible to (24)–(30); in particular

α+11−β(π0)⊤u+11−β(η‾⊤ξ+η‾⊤ω)≤θ.\alpha + \frac{1}{1-\beta}(\pi^0)^\top u + \frac{1}{1-\beta}(\overline\eta^\top\xi + \underline\eta^\top\omega) \le \theta.α+1−β1​(π0)⊤u+1−β1​(η​⊤ξ+η​⊤ω)≤θ.

This is the feasibility half of the converse direction of Proposition 2.

Preamble
import Mathlib
import Definitions.Def_WorstCaseCVaR_Box_Problems

open Matrix
Formal statement
namespace WorstCaseCVaR.Box

/-- Proof of Proposition 2, pp. 1167–1168: if `(x, u, α, θ)` is feasible to (16)–(20) with
`𝒫_π = 𝒫_π^B` and `(z, ξ, ω)` is an optimal solution to (23) with this `u`, then
`(x, u, z, ξ, ω, α, θ)` is feasible to (24)–(30). -/
theorem feasible_16_to_24 {n m S : ℕ} (f : (Fin n → ℝ) → (Fin m → ℝ) → ℝ)
    (ys : Fin S → Fin m → ℝ) (𝒳 : Set (Fin n → ℝ)) (β : ℝ) (hβ0 : 0 < β) (hβ1 : β < 1)
    (π0 ηlo ηhi : Fin S → ℝ) :
    ∀ p ∈ feas16 f ys 𝒳 β π0 ηlo ηhi, ∀ d, IsOptimal23 ηlo ηhi p.u d →
      p.withDual d ∈ feas24 f ys 𝒳 β π0 ηlo ηhi := 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, pp. 1167–1168, proof of Proposition 2
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