Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Corollary 1, Step 1 (p. 28) — (A1)–(A4) and λ* > 0 give (P-Compactness)

Proved
ModelRiskOT.PrimalOpt.corollary_1_step_1

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

optimal-transportp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1tightness

Let EEE be a real normed space that is locally compact in its norm topology, with its Borel σ\sigmaσ-algebra, and let μ\muμ be a probability measure on EEE. Let ccc and fff satisfy (A1)–(A4) and let λ∗>0\lambda^*>0λ∗>0. Then (c,f)(c,f)(c,f) has Property (P-Compactness) at λ∗\lambda^*λ∗: for every ε>0\varepsilon>0ε>0 there are a compact KεK_\varepsilonKε​ with μ(Kε)>1−ε\mu(K_\varepsilon)>1-\varepsilonμ(Kε​)>1−ε and γ>0\gamma>0γ>0 such that the closure of

Γε={(x,y)∈Kε×E: f(y)−λ∗c(x,y)≥φλ∗(x)−γ}\Gamma_\varepsilon=\bigl\{(x,y)\in K_\varepsilon\times E:\ f(y)-\lambda^*c(x,y)\ge\varphi_{\lambda^*}(x)-\gamma\bigr\}Γε​={(x,y)∈Kε​×E: f(y)−λ∗c(x,y)≥φλ∗​(x)−γ}

is compact.

This is the first of the two verifications in the proof of Corollary 1.

Formalization Note The step only uses φλ∗≥f\varphi_{\lambda^*}\ge fφλ∗​≥f, which holds by definition, so no dual optimality is assumed. The paper's text concludes "verifying Assumption (A3)", meaning Property 1 (P-Compactness), and writes f(y)−f(x)≤ε′c(x,y)f(y)-f(x)\le\varepsilon'c(x,y)f(y)−f(x)≤ε′c(x,y) where (A4) gives ε′(1+c(x,y))\varepsilon'(1+c(x,y))ε′(1+c(x,y)); the statement is the step's conclusion. A locally compact real normed space is finite-dimensional, hence complete and separable; the instance PolishSpace E is therefore redundant and is included because the definitions of §2 are posed on a Polish space.

Preamble
import Mathlib
import Definitions.Def_ModelRiskOT_PrimalOpt_PCompactness
import Definitions.Def_ModelRiskOT_PrimalOpt_GrowthAssumptions
Formal statement
namespace ModelRiskOT.PrimalOpt

open MeasureTheory

/-- **Proof of Corollary 1, Step 1** (p. 28): on a real normed space `E` that is locally compact,
(A1)–(A4) and `λ* > 0` imply (P-Compactness) for `λ*`. -/
theorem corollary_1_step_1 {E : Type*} [NormedAddCommGroup E] [NormedSpace ℝ E]
    [LocallyCompactSpace E] [PolishSpace E] [MeasurableSpace E] [BorelSpace E]
    (c : E → E → ℝ) (f : E → ℝ) (μ : Measure E) [IsProbabilityMeasure μ]
    (hA1 : ModelRiskOT.Duality.AssumptionA1 c) (hA2 : AssumptionA2 f μ) (hA3 : AssumptionA3 c)
    (hA4 : AssumptionA4 c f) (lam : ℝ) (hlam : 0 < lam) :
    PCompactness c f μ lam := by sorry

end ModelRiskOT.PrimalOpt
Source
Blanchet & Murthy, Quantifying Distributional Model Risk via Optimal Transport, arXiv:1604.01446v2, p. 28, proof of Corollary 1, Step 1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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