Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 23 — if γ is continuous on compact X × Ξ, then c(x,ℙ) is continuous on X × 𝒫

Proved
DROOptimal.Continuous.lemma_1

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

data-driven-optimizationdistributionally-robust-optimizationlarge-deviationsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relative-entropy

Throughout, X⊆RnX\subseteq\mathbb R^nX⊆Rn and Ξ⊆Rd\Xi\subseteq\mathbb R^dΞ⊆Rd are compact, γ:X×Ξ→R\gamma:X\times\Xi\to\mathbb Rγ:X×Ξ→R is jointly continuous (the standing assumptions of §2, p. 5, and §5, p. 23), and P\mathcal PP is the set of Borel probability distributions on Ξ\XiΞ with the topology of weak convergence.

Lemma 1 (Continuity of model-based predictors). The model-based predictor

c(x,P)=∫Ξγ(x,ξ) dP(ξ)c(x,\mathbb P)=\int_\Xi\gamma(x,\xi)\,\mathrm d\mathbb P(\xi)c(x,P)=∫Ξ​γ(x,ξ)dP(ξ)

is continuous on X×PX\times\mathcal PX×P, where XXX carries the Euclidean topology and P\mathcal PP the weak topology.

Thus ccc belongs to the class C\mathcal CC of data-driven predictors, and model-based prescriptors x⋆(P)∈arg⁡min⁡x∈Xc(x,P)x^\star(\mathbb P)\in\arg\min_{x\in X}c(x,\mathbb P)x⋆(P)∈argminx∈X​c(x,P) exist. The lemma is used in the continuity proof for c^r\hat c_rc^r​ (Proposition 6).

Preamble
import Mathlib
import Definitions.Def_DROOptimal_Continuous_Setting
Formal statement
namespace DROOptimal.Continuous

/-- Lemma 1 (p. 23): if `γ` is continuous on the compact set `X × Ξ`, then `c(x, ℙ)` is continuous
on `X × 𝒫` (weak topology on 𝒫). -/
theorem lemma_1 {d n : ℕ} {Ξ : Set (EuclideanSpace ℝ (Fin d))} {X : Set (EuclideanSpace ℝ (Fin n))}
    (hX : IsCompact X) (hΞ : IsCompact Ξ) (γ : ↥X → ↥Ξ → ℝ)
    (hγ : Continuous (fun p : ↥X × ↥Ξ => γ p.1 p.2)) :
    IsPredictor (cost γ) := by sorry

end DROOptimal.Continuous
Source
Van Parys, Mohajerin Esfahani & Kuhn, From Data to Decisions: Distributionally Robust Optimization is Optimal, arXiv:1704.04118v3, p. 23, Lemma 1; proof p. 29
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

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