Proof of Theorem 2.1, converse:
ProvedSoftRobust.Duality.penaltyOfFamily_familyOfPenaltyconvex-risk-measuresp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1penalty-function
Let be any penalty on the probability measures of , and let . Then the penalty of the family is itself: for every ,
Together with the forward half of Theorem 2.1 applied to , this gives the converse half.
Formalization Note With valued in the identity holds for every , including at measures with (both sides are , the left one as an empty infimum).
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, second step): `α^{Q^α} = α`, i.e.
`inf{ε ≥ 0 : ℚ ∈ 𝒬^α(ε)} = α(ℚ)` for every probability measure `ℚ`. -/
theorem penaltyOfFamily_familyOfPenalty {Ω : Type*} [MeasurableSpace Ω]
(α : ProbabilityMeasure Ω → ℝ≥0∞) :
penaltyOfFamily (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 (α^{Q^α} = α)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.