Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 174 — s ↦ f₂ᵢ(s, x₁(s), x₂(s)) is measurable, summable for i = 0 and essentially bounded for i ≥ 1

Proved
StochConvexProg.Duality.summable_of_bounded

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

carathodory-functionintegrabilityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1stochastic-programming

Let the data satisfy the standing assumptions of the model, with σ\sigmaσ a probability measure. Let x1:S→Rn1x_1:S\to\mathbb R^{n_1}x1​:S→Rn1​ and x2:S→Rn2x_2:S\to\mathbb R^{n_2}x2​:S→Rn2​ be bounded measurable functions. Then the functions

s↦f2i(s,x1(s),x2(s)),i=0,1,…,m2,s\mapsto f_{2i}(s,x_1(s),x_2(s)),\qquad i=0,1,\dots,m_2,s↦f2i​(s,x1​(s),x2​(s)),i=0,1,…,m2​,

are measurable; the one with i=0i=0i=0 is summable (integrable), and those with i=1,…,m2i=1,\dots,m_2i=1,…,m2​ are essentially bounded.

In particular the expected cost f10(x1)+∫Sf20(s,x1,x2(s)) σ(ds)f_{10}(x_1)+\int_S f_{20}(s,x_1,x_2(s))\,\sigma(ds)f10​(x1​)+∫S​f20​(s,x1​,x2​(s))σ(ds) is a well-defined real number whenever x2x_2x2​ is bounded and measurable, which is what makes the perturbation functional FFF meaningful on X×UX\times UX×U.

Formalization Note Boundedness of x1,x2x_1,x_2x1​,x2​ is with respect to the sup norm of Fin n → ℝ; boundedness does not depend on the norm. Essential boundedness is an almost-everywhere bound.

Preamble
import Mathlib
import Definitions.Def_StochConvexProg_Duality_Problem

open MeasureTheory
Formal statement
namespace StochConvexProg.Duality

/-- Rockafellar–Wets (1976), p. 174: for bounded measurable `x₁ : S → Rⁿ¹`, `x₂ : S → Rⁿ²` the
functions `s ↦ f₂ᵢ(s, x₁(s), x₂(s))` are measurable, summable for `i = 0` and essentially bounded
for `i = 1, …, m₂`. -/
theorem summable_of_bounded {S : Type*} [MeasurableSpace S] {σ : Measure S}
    [IsProbabilityMeasure σ] {n₁ n₂ m₁ m₂ : ℕ} (pr : Problem S σ n₁ n₂ m₁ m₂)
    (x₁ : S → Fin n₁ → ℝ) (x₂ : S → Fin n₂ → ℝ)
    (hx₁ : Measurable x₁) (hx₂ : Measurable x₂)
    (hb₁ : ∃ B : ℝ, ∀ s, ‖x₁ s‖ ≤ B) (hb₂ : ∃ B : ℝ, ∀ s, ‖x₂ s‖ ≤ B) :
    Measurable (fun s => pr.f₂₀ s (x₁ s) (x₂ s)) ∧
      Integrable (fun s => pr.f₂₀ s (x₁ s) (x₂ s)) σ ∧
      ∀ i, Measurable (fun s => pr.f₂ i s (x₁ s) (x₂ s)) ∧
        ∃ B : ℝ, ∀ᵐ s ∂σ, |pr.f₂ i s (x₁ s) (x₂ s)| ≤ B := by sorry

end StochConvexProg.Duality
Source
Rockafellar and Wets, Stochastic convex programming: basic duality, Pacific J. Math. 62(1) (1976), p. 174, the sentence after the standing assumptions
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