Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.2 (p. 10) — every u∈U1u\in\mathcal U_1u∈U1​ comes from a unique nonnegative measure on [a,b][a,b][a,b]

Proved
SSDConstraint.Optimality.U1_eq_uOfMeasure_unique

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

measuresp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-dominanceutility-functions

Let a,b∈Ra,b\in\mathbb Ra,b∈R and u∈U1u\in\mathcal U_1u∈U1​. Then there is exactly one finite nonnegative Borel measure μ\muμ on R\mathbb RR vanishing outside [a,b][a,b][a,b] such that

u(t)={−∫tbμ([τ,b]) dτ,t<b,0,t≥b,t∈R.u(t)=\begin{cases}-\displaystyle\int_t^b\mu([\tau,b])\,d\tau, & t<b,\\[2pt] 0, & t\ge b,\end{cases}\qquad t\in\mathbb R.u(t)=⎩⎨⎧​−∫tb​μ([τ,b])dτ,0,​t<b,t≥b,​t∈R.

Together with the fact that the function of every such measure lies in U1\mathcal U_1U1​, this is the bijection between nonnegative measures in rca([a,b])\mathbf{rca}([a,b])rca([a,b]) and U1\mathcal U_1U1​, which makes (4.9) valid for every u∈U1u\in\mathcal U_1u∈U1​.

Formalization Note The page identifies μ\muμ through μ([t,b])=u−′(t)\mu([t,b])=u'_-(t)μ([t,b])=u−′​(t) (the left derivative); the statement records existence and uniqueness of the representing measure. U1\mathcal U_1U1​ uses c≥0c\ge0c≥0 (the page prints c>0c>0c>0, 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
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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