Chapter 8, Theorem 2 — Edmundson-Madansky upper bound
ProvedStochasticProg.Bounds.thm2_edmundson_madansky_upper_boundChapter 8, Theorem 2 (Birge & Louveaux, pp. 347-348): the Edmundson-Madansky upper bound.
Fix a probability space , a complete normed real vector space , a compact set
, and a random vector with almost surely
and Bochner-integrable. Fix , , , and
with convex and continuous on and
integrable. Let Ext be a type standing for the extreme
points of , 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
(formally (convexHull ℝ Ξ).extremePoints ℝ). Let φ : E → Measure Ext assign to every
a probability measure φ e on Ext with barycenter ,
such that is measurable for every
(the disintegration hypothesis). Let μExt be a probability measure
on Ext satisfying the book's defining equation (2.6),
and suppose is -integrable. Then
i.e. , the book's (2.5).
Formalization Note μExt (the book's , 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
are both load-bearing hypotheses the book's proof genuinely uses, not boilerplate.
import Mathlib open MeasureTheory
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
Read-back
What the Lean code literally says, in plain math · claude-fable-5-1
Let be a type equipped with a -algebra and a probability measure (total mass ); let be a complete normed real vector space (a Banach space); and let 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.
- is a compact set. (No non-emptiness or convexity is assumed; is permitted by this hypothesis alone.)
- is a type carrying a -algebra, and it is assumed that every subset is measurable for that -algebra.
- is a function (no measurability or injectivity is assumed) whose image is exactly the set of extreme points of the convex hull of :
(If has no extreme points, this forces to be empty, which is then incompatible with the existence of the probability measures below; in that case the hypotheses are unsatisfiable.)
- is a function such that for -almost every , and is Bochner integrable with respect to (in particular, is -a.e. strongly measurable and ).
- is a set and is a point of it. Beyond the membership , neither nor is used anywhere else in the statement.
- is a function such that, for the fixed , the map is convex on (i.e. is a convex set and satisfies the convexity inequality for points of — the convexity-on-a-set predicate here includes the requirement that itself be convex), continuous on (continuity in the relative topology of ), and such that is -integrable. Nothing is assumed about outside , nor about for .
- assigns to every point (not only to ) a measure on that is a probability measure.
- Barycenter condition: for every ,
where the left side is the Bochner integral of against . (Note: if is not -a.e. strongly measurable or not integrable, this Bochner integral is by convention the zero vector, so the condition then reads .)
- Measurability of the disintegration: for every subset , the function (with values in ) is measurable on .
- is a probability measure on satisfying, for every subset ,
the right side being the Lebesgue integral of a -valued function.
- The function on is -integrable.
Conclusion. Under all of the above,
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 for non-integrability).
Edge cases made explicit. The inequality is stated only for the single fixed ; no quantification over occurs. The integrals are with respect to the given and only; nothing asserts that is determined by and beyond the stated identity on all subsets, and nothing asserts existence of such a or — they are inputs. If is empty, then a.e. is impossible for a probability measure , so the hypotheses are unsatisfiable and the statement holds vacuously. If has no extreme points (which cannot happen for nonempty compact in a Banach space but is not excluded syntactically), is empty and the probability-measure assumptions on and cannot hold, again making the statement vacuous.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.