Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Chapter 8, Theorem 2 — Edmundson-Madansky upper bound

Proved
StochasticProg.Bounds.thm2_edmundson_madansky_upper_bound

by mikedeng1 · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationextreme-pointsprobabilitystochastic-programming

Chapter 8, Theorem 2 (Birge & Louveaux, pp. 347-348): the Edmundson-Madansky upper bound.

Fix a probability space (Ω,μ)(\Omega,\mu)(Ω,μ), a complete normed real vector space EEE, a compact set Ξ⊆E\Xi\subseteq EΞ⊆E, and a random vector ξ:Ω→E\xi:\Omega\to Eξ:Ω→E with ξ(ω)∈Ξ\xi(\omega)\in\Xiξ(ω)∈Ξ almost surely and ξ\xiξ Bochner-integrable. Fix α\alphaα, D⊆αD\subseteq\alphaD⊆α, x∈Dx\in Dx∈D, and g:α→E→Rg:\alpha\to E\to\mathbb Rg:α→E→R with g(x,⋅)g(x,\cdot)g(x,⋅) convex and continuous on Ξ\XiΞ and ω↦g(x,ξ(ω))\omega\mapsto g(x,\xi(\omega))ω↦g(x,ξ(ω)) integrable. Let Ext be a type standing for the extreme points ext Ξ\mathrm{ext}\,\XiextΞ of co Ξ\mathrm{co}\,\XicoΞ, carrying the discrete measurable-space structure (every subset measurable, matching the book's "Borel field ... the collection of all subsets"), and toE : Ext → E an embedding whose range is exactly ext Ξ\mathrm{ext}\,\XiextΞ (formally (convexHull ℝ Ξ).extremePoints ℝ). Let φ : E → Measure Ext assign to every e∈Ξe\in\Xie∈Ξ a probability measure φ e on Ext with barycenter eee,

∫ExttoE(y) φ(e)(dy)=e(e∈Ξ),\int_{\mathrm{Ext}} \mathrm{toE}(y)\,\varphi(e)(dy) = e \qquad (e\in\Xi),∫Ext​toE(y)φ(e)(dy)=e(e∈Ξ),

such that ω↦φ(ξ(ω))(A)\omega\mapsto\varphi(\xi(\omega))(A)ω↦φ(ξ(ω))(A) is measurable for every A⊆ExtA\subseteq\mathrm{Ext}A⊆Ext (the disintegration hypothesis). Let μExt be a probability measure on Ext satisfying the book's defining equation (2.6),

μExt(A)=∫Ωφ(ξ(ω))(A) dμ(ω)(A⊆Ext),\mu\mathrm{Ext}(A) = \int_\Omega \varphi(\xi(\omega))(A)\,d\mu(\omega) \qquad (A\subseteq\mathrm{Ext}),μExt(A)=∫Ω​φ(ξ(ω))(A)dμ(ω)(A⊆Ext),

and suppose y↦g(x,toE(y))y\mapsto g(x,\mathrm{toE}(y))y↦g(x,toE(y)) is μExt\mu\mathrm{Ext}μExt-integrable. Then

∫Ωg(x,ξ(ω)) dμ(ω)  ≤  ∫Extg(x,toE(y)) dμExt(y),\int_\Omega g(x,\xi(\omega))\,d\mu(\omega) \;\le\; \int_{\mathrm{Ext}} g(x,\mathrm{toE}(y))\,d\mu\mathrm{Ext}(y) ,∫Ω​g(x,ξ(ω))dμ(ω)≤∫Ext​g(x,toE(y))dμExt(y),

i.e. E(g(x))≤∫extΞg(x,e) λ(de)\mathbb E(g(x)) \le \int_{\mathrm{ext}\Xi} g(x,e)\,\lambda(de)E(g(x))≤∫extΞ​g(x,e)λ(de), the book's (2.5).

Formalization Note μExt (the book's λ\lambdaλ, renamed since λ is a reserved Lean keyword) is taken as a hypothesis satisfying its defining equation rather than constructed from φ, since the book's own proof does not construct it either — constructing a measure from a set function via eq. (2.6) is a separate, book-external piece of measure theory. The barycenter condition on φ and the measurability of ω↦φ(ξ(ω))(A)\omega\mapsto\varphi(\xi(\omega))(A)ω↦φ(ξ(ω))(A) are both load-bearing hypotheses the book's proof genuinely uses, not boilerplate.

Preamble
import Mathlib

open MeasureTheory
Formal statement
namespace StochasticProg.Bounds

variable {Ω E α : Type*} [MeasurableSpace Ω] {μ : Measure Ω} [IsProbabilityMeasure μ]
  [NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E]

/-- Chapter 8, Theorem 2 (Birge & Louveaux, pp. 347-348): the Edmundson-Madansky upper bound.
`Ext` stands for the extreme points `extΞ` of `co Ξ`, carrying the Borel field of *all* its
subsets (`hExtσ`) that the book specifies; `toE` embeds `Ext` into `E` with range exactly
`extΞ`. For every `e ∈ Ξ`, `φ e` is a probability measure on `Ext` with barycenter `e`
(eq. 2.4) and `ω ↦ φ (ξ ω) A` measurable for every `A` (the disintegration hypothesis); `μExt`
is the probability measure on `Ext` defined from `φ` and `ξ` by eq. (2.6). Then
`E(g(x)) ≤ ∫_{extΞ} g(x, e) μExt(de)` (eq. 2.5). -/
theorem thm2_edmundson_madansky_upper_bound
    {Ξ : Set E} (hΞcompact : IsCompact Ξ)
    {Ext : Type*} [MeasurableSpace Ext] (hExtσ : ∀ A : Set Ext, MeasurableSet A)
    (toE : Ext → E) (hExt : Set.range toE = (convexHull ℝ Ξ).extremePoints ℝ)
    {ξ : Ω → E} (hξrange : ∀ᵐ ω ∂μ, ξ ω ∈ Ξ) (hξint : Integrable ξ μ)
    {D : Set α} {x : α} (hx : x ∈ D) {g : α → E → ℝ}
    (hgconv : ConvexOn ℝ Ξ (g x)) (hgcont : ContinuousOn (g x) Ξ)
    (hgint : Integrable (fun ω => g x (ξ ω)) μ)
    (φ : E → Measure Ext) [∀ e, IsProbabilityMeasure (φ e)]
    (hbary : ∀ e ∈ Ξ, ∫ y : Ext, toE y ∂(φ e) = e)
    (hφmeas : ∀ A : Set Ext, Measurable fun ω => (φ (ξ ω)) A)
    (μExt : Measure Ext) [IsProbabilityMeasure μExt]
    (hμExtdef : ∀ A : Set Ext, μExt A = ∫⁻ ω, (φ (ξ ω)) A ∂μ)
    (hgeint : Integrable (fun y : Ext => g x (toE y)) μExt) :
    ∫ ω, g x (ξ ω) ∂μ ≤ ∫ y : Ext, g x (toE y) ∂μExt := by sorry

end StochasticProg.Bounds
Source
Birge & Louveaux, Introduction to Stochastic Programming, 2nd ed., Springer 2011, p. 347-348, Chapter 8, Theorem 2 (eq. 2.4-2.6)
Read-back

What the Lean code literally says, in plain math · claude-fable-5-1

Let Ω\OmegaΩ be a type equipped with a σ\sigmaσ-algebra and a probability measure μ\muμ (total mass 111); let EEE be a complete normed real vector space (a Banach space); and let α\alphaα be an arbitrary type with no structure. The declaration is a universally quantified statement over the following data and hypotheses, all of which are assumptions.

Data and hypotheses.

  • Ξ⊆E\Xi \subseteq EΞ⊆E is a compact set. (No non-emptiness or convexity is assumed; Ξ=∅\Xi = \varnothingΞ=∅ is permitted by this hypothesis alone.)
  • Ext\mathrm{Ext}Ext is a type carrying a σ\sigmaσ-algebra, and it is assumed that every subset A⊆ExtA \subseteq \mathrm{Ext}A⊆Ext is measurable for that σ\sigmaσ-algebra.
  • ι:Ext→E\iota : \mathrm{Ext} \to Eι:Ext→E is a function (no measurability or injectivity is assumed) whose image is exactly the set of extreme points of the convex hull co⁡Ξ\operatorname{co}\XicoΞ of Ξ\XiΞ:
ι(Ext)=ext⁡(co⁡Ξ).\iota(\mathrm{Ext}) = \operatorname{ext}\big(\operatorname{co}\Xi\big).ι(Ext)=ext(coΞ).

(If co⁡Ξ\operatorname{co}\XicoΞ has no extreme points, this forces Ext\mathrm{Ext}Ext to be empty, which is then incompatible with the existence of the probability measures below; in that case the hypotheses are unsatisfiable.)

  • ξ:Ω→E\xi : \Omega \to Eξ:Ω→E is a function such that ξ(ω)∈Ξ\xi(\omega) \in \Xiξ(ω)∈Ξ for μ\muμ-almost every ω\omegaω, and ξ\xiξ is Bochner integrable with respect to μ\muμ (in particular, ξ\xiξ is μ\muμ-a.e. strongly measurable and ∫∥ξ∥ dμ<∞\int \|\xi\| \, d\mu < \infty∫∥ξ∥dμ<∞).
  • D⊆αD \subseteq \alphaD⊆α is a set and x∈Dx \in Dx∈D is a point of it. Beyond the membership x∈Dx \in Dx∈D, neither DDD nor xxx is used anywhere else in the statement.
  • g:α→E→Rg : \alpha \to E \to \mathbb{R}g:α→E→R is a function such that, for the fixed xxx, the map e↦g(x,e)e \mapsto g(x, e)e↦g(x,e) is convex on Ξ\XiΞ (i.e. Ξ\XiΞ is a convex set and g(x,⋅)g(x,\cdot)g(x,⋅) satisfies the convexity inequality for points of Ξ\XiΞ — the convexity-on-a-set predicate here includes the requirement that Ξ\XiΞ itself be convex), continuous on Ξ\XiΞ (continuity in the relative topology of Ξ\XiΞ), and such that ω↦g(x,ξ(ω))\omega \mapsto g(x, \xi(\omega))ω↦g(x,ξ(ω)) is μ\muμ-integrable. Nothing is assumed about g(x,⋅)g(x,\cdot)g(x,⋅) outside Ξ\XiΞ, nor about g(x′,⋅)g(x', \cdot)g(x′,⋅) for x′≠xx' \ne xx′=x.
  • φ:E→Measure(Ext)\varphi : E \to \mathrm{Measure}(\mathrm{Ext})φ:E→Measure(Ext) assigns to every point e∈Ee \in Ee∈E (not only to e∈Ξe \in \Xie∈Ξ) a measure on Ext\mathrm{Ext}Ext that is a probability measure.
  • Barycenter condition: for every e∈Ξe \in \Xie∈Ξ,
∫Extι(y) φe(dy)=e,\int_{\mathrm{Ext}} \iota(y)\, \varphi_e(dy) = e,∫Ext​ι(y)φe​(dy)=e,

where the left side is the Bochner integral of ι\iotaι against φe\varphi_eφe​. (Note: if ι\iotaι is not φe\varphi_eφe​-a.e. strongly measurable or not integrable, this Bochner integral is by convention the zero vector, so the condition then reads e=0e = 0e=0.)

  • Measurability of the disintegration: for every subset A⊆ExtA \subseteq \mathrm{Ext}A⊆Ext, the function ω↦φξ(ω)(A)\omega \mapsto \varphi_{\xi(\omega)}(A)ω↦φξ(ω)​(A) (with values in [0,∞][0,\infty][0,∞]) is measurable on Ω\OmegaΩ.
  • μExt\mu_{\mathrm{Ext}}μExt​ is a probability measure on Ext\mathrm{Ext}Ext satisfying, for every subset A⊆ExtA \subseteq \mathrm{Ext}A⊆Ext,
μExt(A)=∫Ωφξ(ω)(A) μ(dω),\mu_{\mathrm{Ext}}(A) = \int_\Omega \varphi_{\xi(\omega)}(A)\, \mu(d\omega),μExt​(A)=∫Ω​φξ(ω)​(A)μ(dω),

the right side being the Lebesgue integral of a [0,∞][0,\infty][0,∞]-valued function.

  • The function y↦g(x,ι(y))y \mapsto g(x, \iota(y))y↦g(x,ι(y)) on Ext\mathrm{Ext}Ext is μExt\mu_{\mathrm{Ext}}μExt​-integrable.

Conclusion. Under all of the above,

∫Ωg(x,ξ(ω)) μ(dω)  ≤  ∫Extg(x,ι(y)) μExt(dy),\int_\Omega g\big(x, \xi(\omega)\big)\, \mu(d\omega) \;\le\; \int_{\mathrm{Ext}} g\big(x, \iota(y)\big)\, \mu_{\mathrm{Ext}}(dy),∫Ω​g(x,ξ(ω))μ(dω)≤∫Ext​g(x,ι(y))μExt​(dy),

a non-strict inequality between two real numbers, each a Bochner integral of a real-valued function (both integrands are assumed integrable, so neither integral takes the junk value 000 for non-integrability).

Edge cases made explicit. The inequality is stated only for the single fixed xxx; no quantification over DDD occurs. The integrals are with respect to the given μ\muμ and μExt\mu_{\mathrm{Ext}}μExt​ only; nothing asserts that μExt\mu_{\mathrm{Ext}}μExt​ is determined by φ\varphiφ and ξ\xiξ beyond the stated identity on all subsets, and nothing asserts existence of such a φ\varphiφ or μExt\mu_{\mathrm{Ext}}μExt​ — they are inputs. If Ξ\XiΞ is empty, then ξ(ω)∈Ξ\xi(\omega)\in\Xiξ(ω)∈Ξ a.e. is impossible for a probability measure μ\muμ, so the hypotheses are unsatisfiable and the statement holds vacuously. If co⁡Ξ\operatorname{co}\XicoΞ has no extreme points (which cannot happen for nonempty compact Ξ\XiΞ in a Banach space but is not excluded syntactically), Ext\mathrm{Ext}Ext is empty and the probability-measure assumptions on φe\varphi_eφe​ and μExt\mu_{\mathrm{Ext}}μExt​ cannot hold, again making the statement vacuous.

Human review
  • Endorsed by Shuze Chen · Sep 24, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 24, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me