Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 7.42.1 — every analytic set is universally measurable

Proved
BertsekasShreve.AnalyticSelection.analytic_universallyMeasurable

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

analytic-setsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1universally-measurable

Let XXX be a Borel space. Every analytic set A⊆XA\subseteq XA⊆X is universally measurable: for every probability measure ppp on (X,BX)(X,\mathscr B_X)(X,BX​), AAA belongs to the ppp-completion BX(p)\mathscr B_X(p)BX​(p) of the Borel σ-algebra, that is,

A∈UX=⋂p∈P(X)BX(p).A\in\mathscr U_X=\bigcap_{p\in P(X)}\mathscr B_X(p).A∈UX​=p∈P(X)⋂​BX​(p).

Consequently AX⊆UX\mathscr A_X\subseteq\mathscr U_XAX​⊆UX​, which is what allows analytically measurable policies and lower semianalytic costs to be integrated against arbitrary probability measures.

Preamble
import Mathlib
import Definitions.Def_BertsekasShreve_AnalyticSelection_BorelSpace
import Definitions.Def_BertsekasShreve_AnalyticSelection_Measurability

open MeasureTheory
Formal statement
namespace BertsekasShreve.AnalyticSelection

/-- **Corollary 7.42.1** (p. 169). In a Borel space every analytic set is universally
measurable. -/
theorem analytic_universallyMeasurable {X : Type*}
    [TopologicalSpace X] [MeasurableSpace X] [BorelSpace X] [IsBorelSpace X]
    (A : Set X) (hA : AnalyticSet A) : IsUniversallyMeasurable A := by sorry

end BertsekasShreve.AnalyticSelection
Source
Bertsekas & Shreve, Stochastic Optimal Control: The Discrete-Time Case, Athena Scientific 1996, p. 169, Corollary 7.42.1
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