Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 2.1, third to fifth equalities: inf⁡Q{EQ[Y]+(λ+1)αQ(Q)}=−(λ+1)ρQ(Y/(λ+1))\inf_{\mathbb Q}\{\mathbb E_{\mathbb Q}[Y]+(\lambda+1)\alpha^Q(\mathbb Q)\} = -(\lambda+1)\rho^Q(Y/(\lambda+1))infQ​{EQ​[Y]+(λ+1)αQ(Q)}=−(λ+1)ρQ(Y/(λ+1))

Proved
SoftRobust.Duality.scaling_identity

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

convex-risk-measuresp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1robust-optimization

Let Q\mathbf QQ be an admissible family of probability measures on (Ω,F)(\Omega,\mathcal F)(Ω,F) (nondecreasing, convex, Q(0)≠∅\mathcal Q(0)\ne\emptysetQ(0)=∅), with penalty αQ\alpha^QαQ and generated risk measure ρQ(Y)=sup⁡Q{−EQ[Y]−αQ(Q)}\rho^Q(Y) = \sup_{\mathbb Q}\{-\mathbb E_{\mathbb Q}[Y]-\alpha^Q(\mathbb Q)\}ρQ(Y)=supQ​{−EQ​[Y]−αQ(Q)}. For every bounded measurable Y:Ω→RY:\Omega\to\mathbb RY:Ω→R and every λ≥0\lambda \ge 0λ≥0,

inf⁡Q∈P{EQ[Y]+(λ+1) αQ(Q)}=−(λ+1)sup⁡Q∈P{−EQ[Yλ+1]−αQ(Q)}=−(λ+1) ρQ(Yλ+1).\inf_{\mathbb Q\in\mathcal P}\big\{\mathbb E_{\mathbb Q}[Y] + (\lambda+1)\,\alpha^Q(\mathbb Q)\big\} = -(\lambda+1)\sup_{\mathbb Q\in\mathcal P}\Big\{-\mathbb E_{\mathbb Q}\Big[\frac{Y}{\lambda+1}\Big] - \alpha^Q(\mathbb Q)\Big\} = -(\lambda+1)\,\rho^Q\Big(\frac{Y}{\lambda+1}\Big).Q∈Pinf​{EQ​[Y]+(λ+1)αQ(Q)}=−(λ+1)Q∈Psup​{−EQ​[λ+1Y​]−αQ(Q)}=−(λ+1)ρQ(λ+1Y​).

Applied to Y=f(x)Y = f(x)Y=f(x), it rewrites the dual function of the previous step through ρQ\rho^QρQ, so that the maximum over λ\lambdaλ becomes −min⁡λ≥0{λδ+(λ+1)ρQ(f(x)/(λ+1))}-\min_{\lambda\ge0}\{\lambda\delta + (\lambda+1)\rho^Q(f(x)/(\lambda+1))\}−minλ≥0​{λδ+(λ+1)ρQ(f(x)/(λ+1))}, the left side of (6).

Formalization Note The infimum on the left is taken in EReal (measures with αQ=∞\alpha^Q = \inftyαQ=∞ contribute +∞+\infty+∞); the statement asserts that it equals the real number on the right, so in particular it is finite.

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, third to fifth equalities ("simple algebra and the
definition of ρ^Q"): for every bounded measurable `Y` and `λ ≥ 0`,
`inf_{ℚ ∈ 𝒫} {E_ℚ[Y] + (λ + 1) α^Q(ℚ)} = −(λ + 1) ρ^Q(Y / (λ + 1))`, the infimum taken in `EReal`. -/
theorem scaling_identity {Ω : Type*} [MeasurableSpace Ω]
    (𝒬 : ℝ≥0 → Set (ProbabilityMeasure Ω)) (h𝒬 : IsAdmissibleFamily 𝒬)
    (Y : Ω → ℝ) (hY : IsBddPayoff Y) (l : ℝ) (hl : 0 ≤ l) :
    (⨅ Q : ProbabilityMeasure Ω,
        ((∫ ω, Y ω ∂(Q : Measure Ω) : ℝ) : EReal) +
          ((l + 1 : ℝ) : EReal) * (penaltyOfFamily 𝒬 Q : EReal)) =
      ((-((l + 1) * rhoQ 𝒬 (fun ω => Y ω / (l + 1))) : ℝ) : EReal) := 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, third to fifth equalities ("simple algebra and the definition of ρ^Q")
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