Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1 — minimizers of c1g1+c2g2c_1g_1+c_2g_2c1​g1​+c2​g2​ lie in [min⁡{t‾1,t‾2},max⁡{t‾1,t‾2}][\min\{\underline t_1,\underline t_2\},\max\{\overline t_1,\overline t_2\}][min{t​1​,t​2​},max{t1​,t2​}]

Proved
WorstCaseCVaR.Mixture.two_convex_argmin

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

convex-analysisp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let g1,g2:R→Rg_1,g_2:\mathbb R\to\mathbb Rg1​,g2​:R→R be convex, and suppose the set of minimizers of gjg_jgj​ is the nonempty closed bounded interval [t‾j,t‾j][\underline t_j,\overline t_j][t​j​,tj​], j=1,2j=1,2j=1,2. Let c1,c2≥0c_1,c_2\ge0c1​,c2​≥0 with c1+c2>0c_1+c_2>0c1​+c2​>0. Then c1g1+c2g2c_1g_1+c_2g_2c1​g1​+c2​g2​ is convex and every minimizer of it lies in

[min⁡{t‾1,t‾2}, max⁡{t‾1,t‾2}].\big[\min\{\underline t_1,\underline t_2\},\ \max\{\overline t_1,\overline t_2\}\big].[min{t​1​,t​2​}, max{t1​,t2​}].

This elementary fact about convex functions on the line localizes the minimizers of positive combinations of the component functions FβiF^i_\betaFβi​.

Formalization Note The paper calls the weights β1,β2\beta_1,\beta_2β1​,β2​; they are renamed c1,c2c_1,c_2c1​,c2​ to avoid a clash with the confidence level β\betaβ.

Preamble
import Mathlib
import Definitions.Def_WorstCaseCVaR_Mixture_Setting

open MeasureTheory
Formal statement
namespace WorstCaseCVaR.Mixture

theorem two_convex_argmin (g₁ g₂ : ℝ → ℝ)
    (hg₁ : ConvexOn ℝ Set.univ g₁) (hg₂ : ConvexOn ℝ Set.univ g₂)
    (a₁ b₁ a₂ b₂ : ℝ) (hab₁ : a₁ ≤ b₁) (hab₂ : a₂ ≤ b₂)
    (hmin₁ : {t : ℝ | IsMinOn g₁ Set.univ t} = Set.Icc a₁ b₁)
    (hmin₂ : {t : ℝ | IsMinOn g₂ Set.univ t} = Set.Icc a₂ b₂)
    (c₁ c₂ : ℝ) (hc₁ : 0 ≤ c₁) (hc₂ : 0 ≤ c₂) (hc : 0 < c₁ + c₂) :
    ConvexOn ℝ Set.univ (fun t => c₁ * g₁ t + c₂ * g₂ t) ∧
      {t : ℝ | IsMinOn (fun t => c₁ * g₁ t + c₂ * g₂ t) Set.univ t} ⊆
        Set.Icc (min a₁ a₂) (max b₁ b₂) := by sorry

end WorstCaseCVaR.Mixture
Source
Zhu & Fukushima, Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management, Oper. Res. 57(5), 2009, p. 1166, proof of Theorem 1
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