Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 7.49 (Jankov–von Neumann) — analytic sets admit analytically measurable selectors

Proved
BertsekasShreve.AnalyticSelection.jankov_von_neumann

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

analytic-setsmeasurable-selectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let XXX and YYY be Borel spaces and A⊆X×YA\subseteq X\times YA⊆X×Y an analytic set. There exists an analytically measurable function

φ:projX(A)→YwithGr(φ)⊆A,\varphi:\mathrm{proj}_X(A)\to Y\qquad\text{with}\qquad \mathrm{Gr}(\varphi)\subseteq A,φ:projX​(A)→YwithGr(φ)⊆A,

that is, (x,φ(x))∈A(x,\varphi(x))\in A(x,φ(x))∈A for every x∈projX(A)x\in\mathrm{proj}_X(A)x∈projX​(A).

This is the uniformization theorem on which the ε-optimal selection results of the book rest: a selector exists that is measurable with respect to the σ-algebra generated by the analytic sets, which is in general strictly smaller than the universal σ-algebra.

Preamble
import Mathlib
import Definitions.Def_BertsekasShreve_AnalyticSelection_BorelSpace
import Definitions.Def_BertsekasShreve_AnalyticSelection_Measurability

open MeasureTheory
Formal statement
namespace BertsekasShreve.AnalyticSelection

/-- **Proposition 7.49** (Jankov–von Neumann theorem, p. 182). Let `X`, `Y` be Borel spaces and
`A ⊆ X × Y` analytic. There is an analytically measurable `φ : proj_X(A) → Y` whose graph lies
in `A`. -/
theorem jankov_von_neumann {X Y : Type*}
    [TopologicalSpace X] [MeasurableSpace X] [BorelSpace X] [IsBorelSpace X]
    [TopologicalSpace Y] [MeasurableSpace Y] [BorelSpace Y] [IsBorelSpace Y]
    (A : Set (X × Y)) (hA : AnalyticSet A) :
    ∃ φ : (Prod.fst '' A) → Y,
      IsAnalyticallyMeasurableFun (Prod.fst '' A) φ ∧ ∀ x : Prod.fst '' A, ((x : X), φ x) ∈ A := by sorry

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