Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 7.20 — the argmin map x↦{y:f(x,y)≤f∗(x)}x\mapsto\{y: f(x,y)\le f^*(x)\}x↦{y:f(x,y)≤f∗(x)} is Borel-measurable into 2Y2^Y2Y

Proved
BertsekasShreve.SemicontSelection.lemma7_20_argmin_map_measurable

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

hausdorff-metricmeasurable-selectionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1semicontinuity

Let XXX be a metrizable space, YYY a nonempty compact metric space, and f:X×Y→R∗f:X\times Y\to R^*f:X×Y→R∗ lower semicontinuous. Let f∗(x)=min⁡y∈Yf(x,y)f^*(x)=\min_{y\in Y}f(x,y)f∗(x)=miny∈Y​f(x,y) and

F∗(x)={y∈Y∣f(x,y)≤f∗(x)}(x∈X).F^*(x)=\{y\in Y\mid f(x,y)\le f^*(x)\}\qquad(x\in X).F∗(x)={y∈Y∣f(x,y)≤f∗(x)}(x∈X).

Then each F∗(x)F^*(x)F∗(x) is a closed subset of YYY, and the map F∗:X→2YF^*:X\to 2^YF∗:X→2Y is Borel-measurable, where 2Y2^Y2Y is the space of closed subsets of YYY with the topology of the Hausdorff metric.

The set F∗(x)F^*(x)F∗(x) is the set of minimizers of f(x,⋅)f(x,\cdot)f(x,⋅). Its measurable dependence on xxx is what allows a minimizer to be chosen measurably, by composing F∗F^*F∗ with the selector of Lemma 7.18; this is the core of Proposition 7.33.

Formalization Note 2Y2^Y2Y is Mathlib's Closeds Y with the Hausdorff extended metric and its Borel σ-algebra. Mathlib puts the empty set at distance ∞\infty∞ from every nonempty set, where the book's Definition C.1 uses diam⁡Y\operatorname{diam}YdiamY; in both topologies ∅\emptyset∅ is an isolated point (as in the exponential topology of Appendix C), and on nonempty sets the two metrics coincide, so the Borel σ-algebras agree. The minimum f∗(x)f^*(x)f∗(x) is written as the infimum inf⁡yf(x,y)\inf_{y}f(x,y)infy​f(x,y), which it equals (Proposition 7.32(a)) for nonempty compact YYY. Nonemptiness is explicit because the source writes a minimum. The theorem asserts the existence of a map into Closeds Y whose value at xxx is the set F∗(x)F^*(x)F∗(x) — that is, closedness of each F∗(x)F^*(x)F∗(x) — together with its measurability.

Preamble
import Mathlib
Formal statement
namespace BertsekasShreve.SemicontSelection

open TopologicalSpace

/-- Lemma 7.20 (Bertsekas & Shreve, p. 152). Let `X` be metrizable, `Y` a nonempty compact metric space,
`f : X × Y → R*` lower semicontinuous, `f*(x) = min_{y ∈ Y} f(x, y)`, and
`F*(x) = {y ∈ Y | f(x, y) ≤ f*(x)}` (Eq. (64) of Chapter 7). Then `F* : X → 2^Y` is
Borel-measurable, where `2^Y` is the space of closed subsets of `Y` with the Hausdorff-metric
topology and its Borel σ-algebra. The statement asserts that each `F*(x)` is a closed set (so `F*`
is a map into `2^Y`) and that this map is Borel-measurable. -/
theorem lemma7_20_argmin_map_measurable {X Y : Type*}
    [TopologicalSpace X] [MetrizableSpace X] [MetricSpace Y] [CompactSpace Y] [Nonempty Y]
    (f : X × Y → EReal) (hf : LowerSemicontinuous f) :
    ∃ F : X → Closeds Y, (∀ x, (F x : Set Y) = {y | f (x, y) ≤ ⨅ y', f (x, y')}) ∧
      @Measurable _ _ (borel X) (borel (Closeds Y)) F := by sorry

end BertsekasShreve.SemicontSelection
Source
Bertsekas & Shreve, Stochastic Optimal Control: The Discrete-Time Case, Athena Scientific 1996, p. 152, Lemma 7.20 (Eq. (64) of Chapter 7); Appendix C, p. 303
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