Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.1, converse: Qα\mathbf Q^\alphaQα is nondecreasing and convex, and Qα(0)≠∅\mathcal Q^\alpha(0)\neq\emptysetQα(0)=∅

Proved
SoftRobust.Duality.familyOfPenalty_props

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

convex-risk-measuresp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1penalty-function

Let α:P→[0,∞]\alpha:\mathcal P\to[0,\infty]α:P→[0,∞] be a penalty on the probability measures of (Ω,F)(\Omega,\mathcal F)(Ω,F) that is convex in the sense of mixtures and normalized (α(Q)=0\alpha(\mathbb Q) = 0α(Q)=0 for some Q\mathbb QQ). Define

Qα(ε)={Q∈P:α(Q)≤ε},ε≥0.\mathcal Q^\alpha(\varepsilon) = \{\mathbb Q\in\mathcal P : \alpha(\mathbb Q)\le\varepsilon\}, \qquad \varepsilon\ge0 .Qα(ε)={Q∈P:α(Q)≤ε},ε≥0.

Then the family Qα={Qα(ε):ε≥0}\mathbf Q^\alpha = \{\mathcal Q^\alpha(\varepsilon) : \varepsilon\ge0\}Qα={Qα(ε):ε≥0} is nondecreasing and convex (if Qi∈Qα(εi)\mathbb Q_i\in\mathcal Q^\alpha(\varepsilon_i)Qi​∈Qα(εi​), then λQ1+(1−λ)Q2∈Qα(λε1+(1−λ)ε2)\lambda\mathbb Q_1+(1-\lambda)\mathbb Q_2\in\mathcal Q^\alpha(\lambda\varepsilon_1+(1-\lambda)\varepsilon_2)λQ1​+(1−λ)Q2​∈Qα(λε1​+(1−λ)ε2​) for λ∈[0,1]\lambda\in[0,1]λ∈[0,1]), and Qα(0)\mathcal Q^\alpha(0)Qα(0) is nonempty.

This is the first step of the converse half of Theorem 2.1: every normalized convex penalty produces a family to which the forward half applies.

Preamble
import Mathlib
import Definitions.Def_SoftRobust_Duality_Mixture
import Definitions.Def_SoftRobust_Duality_ConvexRiskMeasure
import Definitions.Def_SoftRobust_Duality_Model

open MeasureTheory
open scoped NNReal ENNReal
Formal statement
namespace SoftRobust.Duality

/-- §2.3, proof of Theorem 2.1, p. 1224 (converse, first step): for a convex, normalized penalty
`α`, the family `𝐐^α = {𝒬^α(ε) : ε ≥ 0}`, `𝒬^α(ε) = {ℚ : α(ℚ) ≤ ε}`, is nondecreasing and convex, and
`𝒬^α(0)` is nonempty. -/
theorem familyOfPenalty_props {Ω : Type*} [MeasurableSpace Ω]
    (α : ProbabilityMeasure Ω → ℝ≥0∞) (hconv : IsConvexPenalty α)
    (hnorm : IsNormalizedPenalty α) :
    IsAdmissibleFamily (familyOfPenalty α) := by sorry

end SoftRobust.Duality
Source
Ben-Tal, Bertsimas, Brown, A Soft Robust Model for Optimization Under Ambiguity, Oper. Res. 58(4) (2010), p. 1224, §2.3, proof of Theorem 2.1, converse
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

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