Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4, p. 13 — for 0 ≤ ξ ≤ v′₋(a), v(t) − ξt has a maximizer in [a, b], so v^*(ξ) is finite

Proved
NonlinSSD.DualFunctional.exists_maximizer_mem_Icc

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

convex-conjugatep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-dominance

Let a≤ba\le ba≤b, v∈U1([a,b])v\in\mathcal U_1([a,b])v∈U1​([a,b]) and let ξ\xiξ be a real number with

0≤ξ≤v−′(a).0\le\xi\le v'_-(a).0≤ξ≤v−′​(a).

Then the function t↦v(t)−ξtt\mapsto v(t)-\xi tt↦v(t)−ξt attains its maximum over R\mathbb RR at some point t0∈[a,b]t_0\in[a,b]t0​∈[a,b]:

v(t)−ξt≤v(t0)−ξt0for all t∈R,v(t)-\xi t\le v(t_0)-\xi t_0\quad\text{for all } t\in\mathbb R,v(t)−ξt≤v(t0​)−ξt0​for all t∈R,

and consequently the concave conjugate is finite, v∗(ξ)=ξt0−v(t0)v^*(\xi)=\xi t_0-v(t_0)v∗(ξ)=ξt0​−v(t0​).

This is the pointwise fact behind the finite case of Theorem 4: on the domain 0≤ζ≤v−′(a)0\le\zeta\le v'_-(a)0≤ζ≤v−′​(a), the inner maximization defining −v∗(ζ(ω))-v^*(\zeta(\omega))−v∗(ζ(ω)) can be restricted to the compact interval [a,b][a,b][a,b].

Formalization Note The paper states this for the random variable ζ\zetaζ almost surely; here it is stated for a deterministic ξ\xiξ, which is the content of "the function v(t)−ζtv(t)-\zeta tv(t)−ζt has a maximizer in [a,b][a,b][a,b]" at each ω\omegaω. v∗v^*v∗ is EReal-valued, and the conclusion gives its value as a real number.

Preamble
import Mathlib
import Definitions.Def_NonlinSSD_DualFunctional_Basic

open MeasureTheory
Formal statement
namespace NonlinSSD.DualFunctional

theorem exists_maximizer_mem_Icc (a b : ℝ) (hab : a ≤ b) (v : ℝ → ℝ) (hv : v ∈ NonlinSSD.Optimality.U1 a b)
    (ξ : ℝ) (hξ0 : 0 ≤ ξ) (hξc : ξ ≤ leftDeriv v a) :
    ∃ t₀ ∈ Set.Icc a b, (∀ t : ℝ, v t - ξ * t ≤ v t₀ - ξ * t₀) ∧
      concaveConj v ξ = ((ξ * t₀ - v t₀ : ℝ) : EReal) := by sorry

end NonlinSSD.DualFunctional
Source
Dentcheva, Ruszczyński, Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints, author manuscript (rev. April 2003; Math. Program. 2004, DOI 10.1007/s10107-003-0453-z), p. 13, proof of Theorem 4
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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