Proof of Theorem 4.2 (p. 10) — every comes from a unique nonnegative measure on
ProvedSSDConstraint.Optimality.U1_eq_uOfMeasure_uniquemeasuresp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-dominanceutility-functions
Let and . Then there is exactly one finite nonnegative Borel measure on vanishing outside such that
Together with the fact that the function of every such measure lies in , this is the bijection between nonnegative measures in and , which makes (4.9) valid for every .
Formalization Note The page identifies through (the left derivative); the statement records existence and uniqueness of the representing measure. uses (the page prints , see the definition item).
Preamble
import Mathlib import Definitions.Def_SSDConstraint_Optimality_Multiplier open MeasureTheory
Formal statement
namespace SSDConstraint.Optimality
/-- Proof of Theorem 4.2, p. 10: every `u ∈ 𝒰₁` is the utility function of exactly one nonnegative
measure `μ ∈ rca([a, b])` (a finite Borel measure on `ℝ` vanishing off `[a, b]`). -/
theorem U1_eq_uOfMeasure_unique (a b : ℝ) :
∀ u ∈ U1 a b, ∃! μ : Measure ℝ, IsFiniteMeasure μ ∧ μ (Set.Icc a b)ᶜ = 0 ∧
u = uOfMeasure μ b := by sorry
end SSDConstraint.Optimality
Source
Dentcheva and Ruszczyński, Optimization with stochastic dominance constraints, preprint dated December 27, 2002 (SPEPS; published SIAM J. Optim. 14(2), 2003), p. 10, proof of Theorem 4.2, 'Let us now prove the converse ... the correspondence ... is a bijection'
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.