Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 5, p. 34 — K(ν, ν′) ≤ ∫ K(ν, δ_y) dν′(y)

Proved
OTSensitivity.MaxFun.dirac_average_bound

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

convexitydirac-measureoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let Y\mathsf YY be a Polish space and k:Y×Y→[0,+∞]k:\mathsf Y\times\mathsf Y\to[0,+\infty]k:Y×Y→[0,+∞] continuous with k(y,y′)=0  ⟺  y=y′k(y,y')=0\iff y=y'k(y,y′)=0⟺y=y′. For all probability measures ν,ν′\nu,\nu'ν,ν′ on Y\mathsf YY,

K(ν,ν′)≤∫YK(ν,δy) dν′(y).K(\nu,\nu')\le\int_{\mathsf Y}K(\nu,\delta_y)\,d\nu'(y).K(ν,ν′)≤∫Y​K(ν,δy​)dν′(y).

The paper uses this with ν\nuν the law of the output and ν′=νxF\nu'=\nu^{\mathcal F}_xν′=νxF​ a conditional law, "for every xxx". It says that K(ν,⋅)K(\nu,\cdot)K(ν,⋅) lies below the average of its values at Dirac masses; combined with (62) it shows that ξK(Y,X∣F)=MK[Y]\xi^K(Y,X\mid\mathcal F)=\mathbb M^K[Y]ξK(Y,X∣F)=MK[Y] forces equality for almost every xxx, which is (63).

Formalization Note The statement is given for every probability measure ν′\nu'ν′, which contains the page's instance ν′=νxF\nu'=\nu^{\mathcal F}_xν′=νxF​ for each xxx. KKK is the published RWPI.SqrtLasso.transportCost; values lie in [0,+∞][0,+\infty][0,+∞].

Preamble
import Mathlib
import Definitions.Def_RWPI_SqrtLasso_transportCost
import Definitions.Def_OTSensitivity_MaxFun_Setting

open MeasureTheory ProbabilityTheory
open scoped ENNReal
Formal statement
namespace OTSensitivity.MaxFun

/-- Proof of Theorem 5, p. 34, display before (63): `K(ν, ·)` lies below the average of its values
at Dirac masses, `K(ν, ν') ≤ ∫ K(ν, δ_y) dν'(y)`, for every probability measure `ν'` (the page
applies it to `ν' = ν^𝓕_x`). -/
theorem dirac_average_bound {𝒴 : Type*} [TopologicalSpace 𝒴] [PolishSpace 𝒴] [MeasurableSpace 𝒴]
    [BorelSpace 𝒴] (k : 𝒴 → 𝒴 → ℝ≥0∞) (hk : IsCost k)
    (ν ν' : Measure 𝒴) [IsProbabilityMeasure ν] [IsProbabilityMeasure ν'] :
    RWPI.SqrtLasso.transportCost k ν ν' ≤
      ∫⁻ y, RWPI.SqrtLasso.transportCost k ν (Measure.dirac y) ∂ν' := by sorry

end OTSensitivity.MaxFun
Source
Borgonovo, Figalli, Plischke & Savaré, Global Sensitivity Analysis via Optimal Transport, authors' manuscript of 7 March 2024 (Management Science, doi:10.1287/mnsc.2023.01796), Appendix A, proof of Theorem 5, display before (63), p. 34
Human review
  • Endorsed by Shuze Chen · Oct 14, 2026

    Confirmed by the moderator at approval.

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