Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Theorem 2.4.13 (GOAL) — the Structure Assumption from pointwise compactness alone

Proved
MDPFinance.Semicontinuous.san_compact_action

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

dynamic-programmingmarkov-decision-processmeasure-theorytopology

Suppose the Markov Decision Model has an upper bounding function bbb, and for every n=0,…,N−1n = 0,\dots,N-1n=0,…,N−1: (i) Dn(x)D_n(x)Dn​(x) is compact for every x∈Ex \in Ex∈E; (ii) a↦∫v(x′) Qn(dx′∣x,a)a \mapsto \int v(x')\, Q_n(dx' \mid x,a)a↦∫v(x′)Qn​(dx′∣x,a) is upper semicontinuous on Dn(x)D_n(x)Dn​(x), for every v∈IBb+v \in \mathrm{IB}_b^+v∈IBb+​ and every x∈Ex \in Ex∈E; (iii) a↦rn(x,a)a \mapsto r_n(x,a)a↦rn​(x,a) is upper semicontinuous on Dn(x)D_n(x)Dn​(x), for every x∈Ex \in Ex∈E. Then IMn:=IBb+\mathrm{IM}_n := \mathrm{IB}_b^+IMn​:=IBb+​ and Δn:=Fn\Delta_n := F_nΔn​:=Fn​ satisfy the Structure Assumption (SAN).

This is the weakest — and in that precise sense the deepest — of the section's three "compactness implies (SAN)" theorems. Theorem 2.4.6 and Theorem 2.4.10 both require the set-valued map x↦Dn(x)x \mapsto D_n(x)x↦Dn​(x) itself to vary semicontinuously or continuously with xxx; here only pointwise compactness of each fiber Dn(x)D_n(x)Dn​(x) is assumed, with upper semicontinuity required only in the action variable aaa, at each fixed xxx separately. Correspondingly the conclusion is the largest possible regularity class, IMn=IBb+\mathrm{IM}_n = \mathrm{IB}_b^+IMn​=IBb+​ itself (no semicontinuity survives), obtained via Proposition 2.4.11's measurable-selection argument rather than the sequential compactness argument of Proposition 2.4.3. Combined with chunk 02a-model-bellman-equation's Theorem 2.3.8, this is a genuine, checkable sufficient condition for the Bellman equation and existence of an optimal policy to hold on a general Borel state and action space — the generalization has no finite-state-and-action-space analogue on the platform, since compactness and semicontinuity are automatic (and hence contentless) whenever AAA is finite. A trivializing formalization that specialized AAA to a finite type, or Dn(x)D_n(x)Dn​(x) to a single fixed compact set independent of xxx, would collapse the theorem to a case where hypotheses (i)-(iii) hold vacuously; neither specialization is made here.

Formalization Note. Hypotheses (ii)-(iii) are stated fiberwise (as functions of aaa alone, on Dn(x)D_n(x)Dn​(x) at each fixed xxx), matching the book's own "a↦…a \mapsto \dotsa↦…" phrasing and Proposition 2.4.11's hypothesis exactly — not jointly in (x,a)(x,a)(x,a) on the graph DnD_nDn​, which would be Theorem 2.4.6's strictly stronger hypothesis.

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_StructureAssumption
import Definitions.Def_MDPFinance_Semicontinuous_BoundingFunction

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

/-- Theorem 2.4.13 (Bäuerle–Rieder, p. 34, PDF 49), the GOAL of this mission: suppose a Markov
Decision Model with upper bounding function `b` is given and for all `n = 0, …, N-1` it holds:
(i) `D_n(x)` is compact for all `x ∈ E`, (ii) `a ↦ ∫ v(x') Q_n(dx'|x,a)` is upper
semicontinuous for all `v ∈ IB_b^+` and for all `x ∈ E`, (iii) `a ↦ r_n(x,a)` is upper
semicontinuous for all `x ∈ E`. Then the sets `IM_n := IB_b^+` and `Δ_n := F_n` satisfy the
Structure Assumption (SAN). This is the weakest of the section's three "compactness implies
(SAN)" theorems: unlike Theorem 2.4.6 (chunk milestone `san_upper_semicontinuous`) and Theorem
2.4.10 (`san_continuous`), no continuity or semicontinuity of the set-valued map `x ↦ D_n(x)`
itself is assumed, only compactness of each fiber `D_n(x)` — and correspondingly `IM_n` is the
*whole* of `IB_b^+`, not a semicontinuous or continuous subset of it. Following the book's own
remark that this theorem "follows directly from Proposition 2.4.11" (`measurable_maximizer_
existence`), hypotheses (ii)/(iii) are stated exactly as `a ↦ ⋯` functions of the action alone,
at each fixed `x`, on the fiber `D_n(x)` — not jointly in `(x,a)` on the graph `D_n`, which
would be Theorem 2.4.6's strictly stronger hypothesis. `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 san_compact_action {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)
    (hD_compact : ∀ n < N, ∀ x, IsCompact (M.Dx n x))
    (hQ_usc : ∀ n < N, ∀ v ∈ IBbPlus b, ∀ x,
        UpperSemicontinuousOn (fun a => erealIntegral (M.Q n (x, a)) v) (M.Dx n x))
    (hr_usc : ∀ n < N, ∀ x, UpperSemicontinuousOn (fun a => M.r n (x, a)) (M.Dx n x)) :
    StructureAssumption M (fun _ => IBbPlus b) (fun n => {f | IsDecisionRule M n 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. 34, Theorem 2.4.13
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).

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me