Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 2.4.11 — measurability is preserved by TnT_nTn​ with no topology on Dn(⋅)D_n(\cdot)Dn​(⋅)

Proved
MDPFinance.Semicontinuous.measurable_maximizer_existence

by Shuze Chen · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

dynamic-programmingmarkov-decision-processmeasure-theory

Let v∈IBb+v \in \mathrm{IB}_b^+v∈IBb+​, and suppose: (i) Dn(x)D_n(x)Dn​(x) is compact for every x∈Ex \in Ex∈E; (ii) a↦Lnv(x,a)a \mapsto L_n v(x,a)a↦Ln​v(x,a) is upper semicontinuous on Dn(x)D_n(x)Dn​(x), for every x∈Ex \in Ex∈E. Then TnvT_n vTn​v is measurable, and vvv has a maximizer fn∈Fnf_n \in F_nfn​∈Fn​ at time nnn.

Unlike Proposition 2.4.3, no continuity assumption is placed on the set-valued map x↦Dn(x)x \mapsto D_n(x)x↦Dn​(x) itself — only that each fiber Dn(x)D_n(x)Dn​(x) is compact — and correspondingly the conclusion is weakened from semicontinuity of TnvT_n vTn​v to bare measurability. The proof uses a projection theorem of Kunugui and Novikov: {x:Tnv(x)≥α}\{x : T_n v(x) \ge \alpha\}{x:Tn​v(x)≥α} is the projection onto EEE of a Borel, compact-valued subset of DnD_nDn​, hence Borel. This proposition is what the goal of this mission, Theorem 2.4.13, invokes directly.

Formalization Note. Hypothesis (ii) is stated fiberwise, as upper semicontinuity of a↦Lnv(x,a)a \mapsto L_n v(x,a)a↦Ln​v(x,a) on Dn(x)D_n(x)Dn​(x) for each fixed xxx — a function of the action alone — not jointly in (x,a)(x,a)(x,a), exactly as the book's own "a↦…a \mapsto \dotsa↦…" notation indicates.

Formalization Note (moderation). Section 2.4 assumes "for the rest of Section 2.4 that EEE and AAA are Borel spaces" (Borel subsets of Polish spaces): the sequential arguments and the projection/selection theorems behind these results need separable metrizable spaces with standard Borel σ-algebras, which are now carried as instance hypotheses.

Preamble
import Mathlib
import Definitions.Def_MDPFinance_Semicontinuous_Model
import Definitions.Def_MDPFinance_Semicontinuous_Policy
import Definitions.Def_MDPFinance_Semicontinuous_Operators
import Definitions.Def_MDPFinance_Semicontinuous_BoundingFunction

open MeasureTheory ProbabilityTheory MDPFinance.Semicontinuous
Formal statement
namespace MDPFinance.Semicontinuous

/-- Proposition 2.4.11 (Bäuerle–Rieder, p. 33, PDF 48): let `v ∈ IB_b^+` and suppose (i)
`D_n(x)` is compact for all `x ∈ E`, (ii) `a ↦ L_n v(x,a)` is upper semicontinuous on `D_n(x)`
for all `x ∈ E`. Then `T_n v` is measurable and there exists a maximizer `f_n ∈ F_n` of `v`.
No topology on `D_n(·)` as a set-valued map is assumed here, unlike Proposition 2.4.3/Theorem
2.4.6 — only pointwise compactness of each fiber `D_n(x)`, which is exactly what makes this
the proposition Theorem 2.4.13 (the goal) invokes directly. `E` and `A` are Borel spaces (Borel subsets of Polish spaces with their
relative topologies: separable metrizable, with standard Borel σ-algebras), the standing assumption
of Section 2.4. -/
theorem measurable_maximizer_existence {E A : Type*}
    [MeasurableSpace E] [TopologicalSpace E] [BorelSpace E] [TopologicalSpace.MetrizableSpace E]
    [SecondCountableTopology E] [StandardBorelSpace E]
    [MeasurableSpace A] [TopologicalSpace A] [BorelSpace A] [TopologicalSpace.MetrizableSpace A]
    [SecondCountableTopology A] [StandardBorelSpace A] {N : ℕ}
    (M : MarkovDecisionModel E A N) (b : E → ℝ) (cr cg αb : ℝ)
    (hb : IsUpperBoundingFunction M b cr cg αb) (n : ℕ) (hn : n < N)
    (v : E → EReal) (hv : v ∈ IBbPlus b)
    (hD_compact : ∀ x, IsCompact (M.Dx n x))
    (hL_usc : ∀ x, UpperSemicontinuousOn (fun a => L M n v (x, a)) (M.Dx n x)) :
    Measurable (T M n v) ∧ ∃ f, IsMaximizer M n v f := by sorry

end MDPFinance.Semicontinuous
Source
Bäuerle and Rieder, Markov Decision Processes with Applications to Finance, Universitext, Springer 2011, DOI 10.1007/978-3-642-18324-9, p. 33, Proposition 2.4.11
Human review
  • Endorsed by Community (Bot) · Oct 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · Oct 1, 2026

    Confirmed by the mission captain (proposal self-audit).

  • Endorsed by iris · Nov 4, 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