Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4, pp. 8–9 — sup⁡y∈S{1A(y)−λc(x,y)}=(1−λc(x,A))+\sup_{y \in S}\{1_A(y) - \lambda c(x,y)\} = (1 - \lambda c(x,A))^+supy∈S​{1A​(y)−λc(x,y)}=(1−λc(x,A))+

Proved
ModelRiskOT.WorstProb.sup_indicator

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

optimal-transportp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1worst-case-probability

Let SSS be a Polish space, let c:S×S→R+c : S \times S \to \mathbb R_+c:S×S→R+​ satisfy (A1), let A⊆SA \subseteq SA⊆S be nonempty and closed, λ≥0\lambda \ge 0λ≥0 and x∈Sx \in Sx∈S. With c(x,A)=inf⁡{c(x,y):y∈A}c(x,A) = \inf\{c(x,y) : y \in A\}c(x,A)=inf{c(x,y):y∈A},

sup⁡y∈S{1A(y)−λc(x,y)}=(1−λc(x,A))+.\sup_{y \in S}\{1_A(y) - \lambda c(x,y)\} = \big(1 - \lambda c(x,A)\big)^+ .y∈Ssup​{1A​(y)−λc(x,y)}=(1−λc(x,A))+.

This identifies the function φλ(x)=sup⁡y{f(y)−λc(x,y)}\varphi_\lambda(x) = \sup_y\{f(y) - \lambda c(x,y)\}φλ​(x)=supy​{f(y)−λc(x,y)} of the dual problem when f=1Af = 1_Af=1A​; with it, the dual of the worst-case probability problem becomes the univariate problem (13).

Formalization Note The supremum is a real supremum (iSup in R\mathbb RR); the family is bounded above by 111 and nonempty, so it is the true supremum. Only c≥0c \ge 0c≥0 and c(x,x)=0c(x,x) = 0c(x,x)=0 from (A1) are used.

Preamble
import Mathlib
import Definitions.Def_ModelRiskOT_WorstProb_WorstCaseProb

open MeasureTheory
open scoped ENNReal
Formal statement
namespace ModelRiskOT.WorstProb

/-- §2.4, pp. 8–9: for `λ ≥ 0` and a nonempty closed set `A` in a Polish space,
`sup_{y ∈ S} {1_A(y) − λ c(x, y)} = (1 − λ c(x, A))⁺`, where `c(x, A) = inf_{y ∈ A} c(x, y)`. -/
theorem sup_indicator {S : Type*} [TopologicalSpace S] [PolishSpace S] [MeasurableSpace S]
    [BorelSpace S] (c : S → S → ℝ) (hc : ModelRiskOT.Duality.AssumptionA1 c)
    (A : Set S) (hA : IsClosed A) (hAne : A.Nonempty) (lam : ℝ) (hlam : 0 ≤ lam) (x : S) :
    ⨆ y : S, (A.indicator (fun _ => (1 : ℝ)) y - lam * c x y) =
      max (1 - lam * costToSet c A x) 0 := by sorry

end ModelRiskOT.WorstProb
Source
Blanchet & Murthy, Quantifying Distributional Model Risk via Optimal Transport, arXiv:1604.01446v2, pp. 8–9, §2.4, display after (12)
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