Chapter 8, Theorem 1 — finite-partition Jensen lower bound
ProvedStochasticProg.Bounds.thm1_jensen_partition_lower_boundChapter 8, Theorem 1 (Birge & Louveaux, p. 346): the finite-partition Jensen lower bound.
Fix a probability space , a complete normed real vector space , a closed
convex set , and a random vector with
almost surely and Bochner-integrable. Fix a type of first-stage decisions, a set
, a point , and a function such that
is convex and continuous on , with
integrable. Fix a finite measurable partition of into blocks (in the sense
of the companion Partition definition), with block weights and
block conditional means . Then
i.e. — the book's inequality (2.1), read left-to-right as printed (the book states ).
Formalization Note Two hypotheses are added beyond the book's bare statement, both needed
for the underlying Mathlib integral-Jensen lemma rather than narrowings of the content:
ContinuousOn (g x) Ξ (automatic for a convex function on the interior of a
finite-dimensional domain, but is not assumed finite-dimensional here) and integrability
of and of (needed for and each
to be well-defined). is exactly the conditional mean Partition.condMean,
never an arbitrary point of the block.
import Mathlib import Definitions.Def_StochasticProg_Bounds_Partition open MeasureTheory
namespace StochasticProg.Bounds
variable {Ω E α : Type*} [MeasurableSpace Ω] {μ : Measure Ω} [IsProbabilityMeasure μ]
[NormedAddCommGroup E] [NormedSpace ℝ E] [CompleteSpace E]
/-- Chapter 8, Theorem 1 (Birge & Louveaux, p. 346): the finite-partition Jensen lower bound.
For `g(x, ·)` convex on the (convex, closed) support `Ξ` of a random vector `ξ`, and a finite
measurable partition of the sample space into blocks `S_l` of probability `p_l = P[ξ ∈ S_l]`
with conditional means `ξ^l = E[ξ | S_l]`,
`E(g(x)) ≥ Σ_{l=1}^ν p_l g(x, ξ^l)`. -/
theorem thm1_jensen_partition_lower_bound
{Ξ : Set E} (hΞconv : Convex ℝ Ξ) (hΞclosed : IsClosed Ξ)
{ξ : Ω → 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 (ξ ω)) μ)
{ν : ℕ} (P : Partition μ ν) :
∑ l, P.weight l * g x (P.condMean ξ l) ≤ ∫ ω, g x (ξ ω) ∂μ := by sorry
end StochasticProg.Bounds
Read-back
What the Lean code literally says, in plain math · claude-fable-5-1
Fix the following data throughout.
- is a type carrying a -algebra, and is a measure on which is assumed to be a probability measure ().
- is a real Banach space: a normed abelian group with a real normed-space structure, assumed complete.
- is an arbitrary type with no structure at all.
- is a subset assumed to be convex (over ) and closed.
- is a function such that
- for -almost every , (no requirement that for every , and is not separately assumed measurable except through the next item), and
- is Bochner integrable with respect to (which includes being a.e.-strongly measurable and having finite integral of ).
- is a set and is a point with . Neither nor the membership is used anywhere else in the statement; the hypothesis imposes nothing on , , or the conclusion.
- is a function of two arguments; write . It is assumed that
- is convex on (the set is convex and, for and with , ); nothing is assumed about outside ;
- is continuous on (continuous when restricted to with the subspace topology);
- the real-valued function is integrable with respect to .
- is a natural number, possibly , and is an element of the type .
The type and its two projections used below are not defined in the code shown; they come from the imported file Definitions.Def_StochasticProg_Bounds_Partition, whose contents are not available here. All that can be read off from this declaration is their usage:
- is a family of real numbers indexed by some finite index type over which ranges (presumably ); the statement itself does not assert that or that — whatever constraints hold are those built into the definition of , which is not visible.
- is an element of , produced from and the block index by a construction internal to . Whether this is a genuine conditional expectation of on the -th block, what value it takes if a block has measure zero (a total function must return something, possibly a junk value such as ), and whether it lies in , are all determined by the unseen definition and not asserted by this theorem.
Under all of the above hypotheses, the theorem asserts the single real inequality
where the left side is a finite sum over the index set of , with and , and the right side is the Bochner (here: Lebesgue) integral of the real function against .
Edge cases silently included:
- If and the index set is therefore empty, the left side is the empty sum , and the claim reduces to .
- The inequality is non-strict (), and it is a single inequality, not an equality or a two-sided bound.
- Since the hypotheses on are only almost-everywhere membership in , the values on the -null exceptional set are unconstrained by convexity or continuity but do not affect the integral.
- If for some , then is a value of at a point where no convexity or continuity assumption applies; the statement still evaluates there.
- If is empty, the hypothesis " for a.e. " is unsatisfiable for a probability measure, so the theorem is vacuous in that case.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.