Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8.4 — monotone and bounded convergence for the operator T_μ

Proved
BertsekasShreve.BorelFinite.lemma8_4_Tmu_limits

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

dynamic-programmingmonotone-convergencep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Consider the finite horizon Borel model of Definition 8.1. Let {Jk}\{J_k\}{Jk​} be a sequence of extended real-valued, universally measurable functions on SSS, let J:S→R∗J:S\to R^*J:S→R∗, and let μ∈U(C∣S)\mu\in U(C\mid S)μ∈U(C∣S).

  1. If Tμ(J1)(x)<∞T_\mu(J_1)(x)<\inftyTμ​(J1​)(x)<∞ for every x∈Sx\in Sx∈S and Jk↓JJ_k\downarrow JJk​↓J, then Tμ(Jk)↓Tμ(J)T_\mu(J_k)\downarrow T_\mu(J)Tμ​(Jk​)↓Tμ​(J).
  2. If Tμ(J1−)(x)<∞T_\mu(J_1^-)(x)<\inftyTμ​(J1−​)(x)<∞ for every x∈Sx\in Sx∈S, g≥0g\ge0g≥0, and Jk↑JJ_k\uparrow JJk​↑J, then Tμ(Jk)↑Tμ(J)T_\mu(J_k)\uparrow T_\mu(J)Tμ​(Jk​)↑Tμ​(J).
  3. If {Jk}\{J_k\}{Jk​} is uniformly bounded, ggg is bounded, and Jk→JJ_k\to JJk​→J, then Tμ(Jk)→Tμ(J)T_\mu(J_k)\to T_\mu(J)Tμ​(Jk​)→Tμ​(J).

Here J1−=max⁡(−J1,0)J_1^-=\max(-J_1,0)J1−​=max(−J1​,0), the arrows denote monotone pointwise convergence, and all limits are pointwise in xxx:

Tμ(Jk)(x)⟶Tμ(J)(x)∀x∈S.T_\mu(J_k)(x)\longrightarrow T_\mu(J)(x)\qquad\forall x\in S.Tμ​(Jk​)(x)⟶Tμ​(J)(x)∀x∈S.

These continuity properties let infima over policies be exchanged with the operator TμT_\muTμ​ in the dynamic programming recursion.

Formalization Note The sequence is indexed from 000, so the book's J1J_1J1​ is Js 0. The conditions g≥0g\ge0g≥0 and "ggg bounded" are imposed on Γ\GammaΓ, where ggg is defined. "{Jk}\{J_k\}{Jk​} uniformly bounded" means ∣Jk(x)∣≤b|J_k(x)|\le b∣Jk​(x)∣≤b for one real bbb, all kkk and xxx.

Preamble
import Mathlib
import Definitions.Def_BertsekasShreve_BorelFinite_Model
import Definitions.Def_BertsekasShreve_BorelFinite_Policy
import Definitions.Def_BertsekasShreve_BorelFinite_Operators
Formal statement
namespace BertsekasShreve.BorelFinite

open Filter Topology in
/-- **Lemma 8.4** (p. 197). Let `{J_k}` be universally measurable functions `S → R*` and
`μ ∈ U(C|S)` (the book's `J₁` is `Js 0` here).
(a) If `T_μ(J₁)(x) < ∞` for every `x` and `J_k ↓ J`, then `T_μ(J_k) ↓ T_μ(J)`.
(b) If `T_μ(J₁⁻)(x) < ∞` for every `x`, `g ≥ 0`, and `J_k ↑ J`, then `T_μ(J_k) ↑ T_μ(J)`.
(c) If `{J_k}` is uniformly bounded, `g` is bounded, and `J_k → J`, then `T_μ(J_k) → T_μ(J)`. -/
theorem lemma8_4_Tmu_limits {S C W : Type*}
    [TopologicalSpace S] [MeasurableSpace S] [BorelSpace S] [BertsekasShreve.AnalyticSelection.IsBorelSpace S] [Nonempty S]
    [TopologicalSpace C] [MeasurableSpace C] [BorelSpace C] [BertsekasShreve.AnalyticSelection.IsBorelSpace C] [Nonempty C]
    [TopologicalSpace W] [MeasurableSpace W] [BorelSpace W] [BertsekasShreve.AnalyticSelection.IsBorelSpace W] [Nonempty W]
    (M : Model S C W)
    (μ : UCS M) (Js : ℕ → S → EReal) (Jl : S → EReal) (hJs : ∀ k, UMeasurable (Js k)) :
    ((∀ x, Tmu M μ (Js 0) x < ⊤) → (∀ x, Antitone fun k => Js k x) →
        (∀ x, Tendsto (fun k => Js k x) atTop (𝓝 (Jl x))) →
        (∀ x, Antitone fun k => Tmu M μ (Js k) x) ∧
          ∀ x, Tendsto (fun k => Tmu M μ (Js k) x) atTop (𝓝 (Tmu M μ Jl x))) ∧
    ((∀ x, Tmu M μ (fun y => ((negPart (Js 0) y : ENNReal) : EReal)) x < ⊤) →
        (∀ z ∈ M.Γ, 0 ≤ M.g z) → (∀ x, Monotone fun k => Js k x) →
        (∀ x, Tendsto (fun k => Js k x) atTop (𝓝 (Jl x))) →
        (∀ x, Monotone fun k => Tmu M μ (Js k) x) ∧
          ∀ x, Tendsto (fun k => Tmu M μ (Js k) x) atTop (𝓝 (Tmu M μ Jl x))) ∧
    ((∃ b : ℝ, ∀ k x, Js k x ≤ b ∧ -(b : EReal) ≤ Js k x) →
        (∃ b : ℝ, ∀ z ∈ M.Γ, M.g z ≤ b ∧ -(b : EReal) ≤ M.g z) →
        (∀ x, Tendsto (fun k => Js k x) atTop (𝓝 (Jl x))) →
        ∀ x, Tendsto (fun k => Tmu M μ (Js k) x) atTop (𝓝 (Tmu M μ Jl x))) := by sorry

end BertsekasShreve.BorelFinite
Source
Bertsekas & Shreve, Stochastic Optimal Control: The Discrete-Time Case, Athena Scientific 1996, p. 197, Lemma 8.4
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