Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.1, p. 12 — measurable selection theorem for closed-valued measurable multifunctions into ℝᵐ

Proved
DupacovaWets.Consistency.exists_measurable_selection

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

measurable-multifunctionmeasurable-selectionp2o-batch-pfp1bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let (T,T)(T,\mathcal T)(T,T) be a measurable space and Γ:T⇉Rm\Gamma:T\rightrightarrows\mathbb R^mΓ:T⇉Rm a multifunction such that every Γ(t)\Gamma(t)Γ(t) is closed and Γ\GammaΓ is measurable. Then

dom⁡Γ={t∈T:Γ(t)≠∅}=Γ−1(Rm)∈T,\operatorname{dom}\Gamma=\{t\in T:\Gamma(t)\neq\emptyset\}=\Gamma^{-1}(\mathbb R^m)\in\mathcal T,domΓ={t∈T:Γ(t)=∅}=Γ−1(Rm)∈T,

and Γ\GammaΓ admits a measurable selector: a measurable xxx with x(t)∈Γ(t)x(t)\in\Gamma(t)x(t)∈Γ(t) for every t∈dom⁡Γt\in\operatorname{dom}\Gammat∈domΓ.

This is the measurable selection theorem (Kuratowski–Ryll-Nardzewski) quoted by Dupačová and Wets; in their consistency theorem it produces Fν\mathcal F^\nuFν-measurable estimators from the measurable solution multifunctions.

Formalization Note The paper states it for Γ:Ξ⇉Rn\Gamma:\Xi\rightrightarrows\mathbb R^nΓ:Ξ⇉Rn on the data space (Ξ,A)(\Xi,\mathcal A)(Ξ,A); it is stated here over an arbitrary measurable space, because the proof of Theorem 3.9 applies it on (Z0,trace of Fν)(Z_0,\text{trace of }\mathcal F^\nu)(Z0​,trace of Fν). The selector is a total measurable function x:T→Rmx:T\to\mathbb R^mx:T→Rm that selects on dom⁡Γ\operatorname{dom}\GammadomΓ; since dom⁡Γ\operatorname{dom}\GammadomΓ is measurable this is equivalent to the paper's x:dom⁡Γ→Rnx:\operatorname{dom}\Gamma\to\mathbb R^nx:domΓ→Rn (extend by a constant). Rm\mathbb R^mRm is EuclideanSpace ℝ (Fin m).

Preamble
import Mathlib
import Definitions.Def_DupacovaWets_Consistency_Multifunction
open MeasureTheory
Formal statement
namespace DupacovaWets.Consistency

/-- Dupačová–Wets (WP-86-41), p. 12, Proposition 3.1 (measurable selections), over an arbitrary
measurable space `T`: if `Γ : T ⇉ ℝᵐ` is closed-valued and measurable, then
`dom Γ = {t | Γ(t) ≠ ∅}` is measurable and `Γ` has a measurable selector on `dom Γ`
(here a measurable `x : T → ℝᵐ` with `x(t) ∈ Γ(t)` whenever `Γ(t) ≠ ∅`). -/
theorem exists_measurable_selection {T : Type*} [MeasurableSpace T] {m : ℕ}
    (Γ : T → Set (EuclideanSpace ℝ (Fin m))) (hclosed : ∀ t, IsClosed (Γ t))
    (hmeas : IsMeasurableMultifunction Γ) :
    MeasurableSet {t | (Γ t).Nonempty} ∧
      ∃ x : T → EuclideanSpace ℝ (Fin m), Measurable x ∧ ∀ t, (Γ t).Nonempty → x t ∈ Γ t := by sorry

end DupacovaWets.Consistency
Source
Dupačová & Wets, IIASA Working Paper WP-86-41 (Aug. 1986), p. 12, Proposition 3.1
Human review
  • Endorsed by Shuze Chen · Oct 4, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 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