Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.31 — integrating a semicontinuous function against a continuous kernel preserves semicontinuity

Proved
BertsekasShreve.SemicontSelection.prop7_31_semicontinuous_integral

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1probabilitysemicontinuitystochastic-kernels

Let XXX and YYY be separable metrizable spaces, let q(dy∣x)q(dy\mid x)q(dy∣x) be a continuous stochastic kernel on YYY given XXX (a continuous map from XXX into the space P(Y)P(Y)P(Y) of Borel probability measures with the weak topology), and let f:X×Y→R∗f:X\times Y\to R^*f:X×Y→R∗ be Borel-measurable. Define

λ(x)=∫f(x,y) q(dy∣x)(x∈X),\lambda(x)=\int f(x,y)\,q(dy\mid x)\qquad(x\in X),λ(x)=∫f(x,y)q(dy∣x)(x∈X),

the integral of the extended-real-valued function y↦f(x,y)y\mapsto f(x,y)y↦f(x,y) in the sense ∫f+−∫f−\int f^+-\int f^-∫f+−∫f− with ∞−∞=∞\infty-\infty=\infty∞−∞=∞.

  1. If fff is lower semicontinuous and bounded below by a real number, then λ\lambdaλ is lower semicontinuous and bounded below by a real number.
  2. If fff is upper semicontinuous and bounded above by a real number, then λ\lambdaλ is upper semicontinuous and bounded above by a real number.

This is the semicontinuity of the expectation step of the dynamic programming algorithm: under a continuous transition kernel, the expected cost-to-go inherits semicontinuity from the cost-to-go.

Formalization Note The integral is the published definition DupacovaWets.Consistency.expect, which is exactly Eq. (43) of Chapter 7 with the convention (42): it equals +∞+\infty+∞ when ∫f+=∞\int f^+=\infty∫f+=∞ and ∫f+−∫f−\int f^+-\int f^-∫f+−∫f− (computed in EReal, hence −∞-\infty−∞ when only ∫f−\int f^-∫f− is infinite) otherwise; both parts are lower Lebesgue integrals of [0,∞][0,\infty][0,∞]-valued functions. Borel measurability of fff is with respect to the Borel σ-algebra of the product topology on X×YX\times YX×Y. Boundedness is by a real constant, since every EReal-valued function is bounded by ±∞\pm\infty±∞.

Preamble
import Mathlib
import Definitions.Def_DupacovaWets_Consistency_expect
Formal statement
namespace BertsekasShreve.SemicontSelection

open MeasureTheory TopologicalSpace

/-- Proposition 7.31 (Bertsekas & Shreve, p. 148). Let `X`, `Y` be separable metrizable spaces,
`q(dy|x)` a continuous stochastic kernel on `Y` given `X`, and `f : X × Y → R*` Borel-measurable.
Let `λ(x) = ∫ f(x, y) q(dy|x)` (the extended integral (43) of Chapter 7, `∫ f⁺ − ∫ f⁻` with `∞ − ∞ = ∞`, which is `DupacovaWets.Consistency.expect`).
(a) If `f` is lower semicontinuous and bounded below, so is `λ`.
(b) If `f` is upper semicontinuous and bounded above, so is `λ`. -/
theorem prop7_31_semicontinuous_integral {X Y : Type*}
    [TopologicalSpace X] [MetrizableSpace X] [SeparableSpace X]
    [TopologicalSpace Y] [MetrizableSpace Y] [SeparableSpace Y]
    [MeasurableSpace Y] [BorelSpace Y]
    (q : X → ProbabilityMeasure Y) (hq : Continuous q) (f : X × Y → EReal)
    (hf : @Measurable (X × Y) EReal (borel (X × Y)) _ f) :
    ((LowerSemicontinuous f ∧ ∃ b : ℝ, ∀ z, (b : EReal) ≤ f z) →
      LowerSemicontinuous (fun x => DupacovaWets.Consistency.expect (q x : Measure Y) (fun y => f (x, y))) ∧
      ∃ b : ℝ, ∀ x, (b : EReal) ≤ DupacovaWets.Consistency.expect (q x : Measure Y) (fun y => f (x, y))) ∧
    ((UpperSemicontinuous f ∧ ∃ b : ℝ, ∀ z, f z ≤ (b : EReal)) →
      UpperSemicontinuous (fun x => DupacovaWets.Consistency.expect (q x : Measure Y) (fun y => f (x, y))) ∧
      ∃ b : ℝ, ∀ x, DupacovaWets.Consistency.expect (q x : Measure Y) (fun y => f (x, y)) ≤ (b : EReal)) := by sorry

end BertsekasShreve.SemicontSelection
Source
Bertsekas & Shreve, Stochastic Optimal Control: The Discrete-Time Case, Athena Scientific 1996, p. 148, Proposition 7.31; integral as in Eq. (43) of Chapter 7, p. 139
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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