Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 6.1, p. 472 — for c = d, every real-valued c-transform g^c is 1-Lipschitz

Proved
CompOT.W1.prop_6_1_lipschitz_of_cTransform

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

c-transformlipschitzoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let (X,d)(\mathcal X,d)(X,d) be a metric space with cost c(x,y)=d(x,y)c(x,y)=d(x,y)c(x,y)=d(x,y), let g:X→Rg:\mathcal X\to\mathbb Rg:X→R be any function and suppose that its ccc-transform gc(y)=inf⁡x d(x,y)−g(x)g^c(y)=\inf_{x}\,d(x,y)-g(x)gc(y)=infx​d(x,y)−g(x) is real valued and equal to f:X→Rf:\mathcal X\to\mathbb Rf:X→R. Then fff is 1-Lipschitz:

∣f(x)−f(y)∣≤d(x,y)for all x,y∈X,|f(x)-f(y)|\le d(x,y)\qquad\text{for all }x,y\in\mathcal X,∣f(x)−f(y)∣≤d(x,y)for all x,y∈X,

that is, Lip(f)≤1\mathrm{Lip}(f)\le 1Lip(f)≤1.

This is the "only if" half of Proposition 6.1: ccc-concave functions for a metric cost are 1-Lipschitz.

Formalization Note Lip(f)≤1\mathrm{Lip}(f)\le1Lip(f)≤1 is Mathlib's LipschitzWith 1 f, which is equivalent to the book's sup⁡x≠y∣f(x)−f(y)∣/d(x,y)≤1\sup_{x\ne y}|f(x)-f(y)|/d(x,y)\le1supx=y​∣f(x)−f(y)∣/d(x,y)≤1. The equality f=gcf=g^cf=gc is an equality in EReal, so it includes the finiteness of gcg^cgc. The function ggg is not required to be continuous (the book's g∈C(X)g\in\mathcal C(\mathcal X)g∈C(X)); the statement is therefore slightly more general.

Preamble
import Mathlib
import Definitions.Def_CompOT_W1_Defs
Formal statement
namespace CompOT.W1

/-- Proof of Proposition 6.1, p. 472 (first paragraph): if `f = g^c` for the cost `c = d`,
then `Lip(f) ≤ 1`. Here `g` is any real function on `X` and `f` is real valued. -/
theorem prop_6_1_lipschitz_of_cTransform {X : Type*} [MetricSpace X] (f g : X → ℝ)
    (hfg : ∀ y, (f y : EReal) = cTransform g y) :
    LipschitzWith 1 f := by sorry

end CompOT.W1
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), §6.1, proof of Proposition 6.1, first paragraph, p. 472
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