Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2.2, pp. 378–379 — ⟨S, D^p⟩^{1/p} ≤ ⟨P, D^p⟩^{1/p} + ⟨Q, D^p⟩^{1/p} for the glued S

Proved
CompOT.Metric.prop_2_2_minkowski

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

minkowski-inequalityoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1wasserstein

Let D∈R+n×nD\in\mathbb R^{n\times n}_+D∈R+n×n​ be a distance on [ ⁣[n] ⁣][\![n]\!][[n]], p≥1p\ge1p≥1, a,b,c∈Σna,b,c\in\Sigma_na,b,c∈Σn​, P∈U(a,b)P\in U(a,b)P∈U(a,b), Q∈U(b,c)Q\in U(b,c)Q∈U(b,c), and let S=P diag(1/b~) QS=P\,\mathrm{diag}(1/\tilde b)\,QS=Pdiag(1/b~)Q be the glued coupling. Then

⟨S,Dp⟩1/p≤⟨P,Dp⟩1/p+⟨Q,Dp⟩1/p.\langle S,D^p\rangle^{1/p}\le\langle P,D^p\rangle^{1/p}+\langle Q,D^p\rangle^{1/p}.⟨S,Dp⟩1/p≤⟨P,Dp⟩1/p+⟨Q,Dp⟩1/p.

This is the chain of inequalities of pp. 378–379 (the triangle inequality of DDD followed by Minkowski's inequality), together with its final identities ∑ijkDijpPijQjk/b~j=⟨P,Dp⟩\sum_{ijk}D^p_{ij}P_{ij}Q_{jk}/\tilde b_j=\langle P,D^p\rangle∑ijk​Dijp​Pij​Qjk​/b~j​=⟨P,Dp⟩ and ∑ijkDjkpPijQjk/b~j=⟨Q,Dp⟩\sum_{ijk}D^p_{jk}P_{ij}Q_{jk}/\tilde b_j=\langle Q,D^p\rangle∑ijk​Djkp​Pij​Qjk​/b~j​=⟨Q,Dp⟩. With the gluing lemma and the suboptimality of SSS it yields the triangle inequality for Wp\mathrm W_pWp​ once PPP and QQQ are optimal.

Formalization Note The page applies the chain to optimal PPP and QQQ; the inequality does not use optimality and is stated for all couplings. The page's two final equalities are folded into the right-hand side.

Preamble
import Mathlib
import Definitions.Def_CompOT_Metric_Defs
Formal statement
namespace CompOT.Metric

open Matrix

/-- Proof of Proposition 2.2, pp. 378–379 (the chain after "The triangle inequality
follows then from", with its two final equalities): for `P ∈ U(a, b)`, `Q ∈ U(b, c)` and
`S = P diag(1/b̃) Q`, `⟨S, D^p⟩^{1/p} ≤ ⟨P, D^p⟩^{1/p} + ⟨Q, D^p⟩^{1/p}`. -/
theorem prop_2_2_minkowski {n : ℕ} (D : Matrix (Fin n) (Fin n) ℝ) (p : ℝ) (hp : 1 ≤ p)
    (hD_nonneg : ∀ i j, 0 ≤ D i j)
    (hD_symm : ∀ i j, D i j = D j i)
    (hD_zero : ∀ i j, D i j = 0 ↔ i = j)
    (hD_tri : ∀ i j k, D i k ≤ D i j + D j k)
    (a b c : Fin n → ℝ) (ha : a ∈ stdSimplex ℝ (Fin n)) (hb : b ∈ stdSimplex ℝ (Fin n))
    (hc : c ∈ stdSimplex ℝ (Fin n))
    (P Q : Matrix (Fin n) (Fin n) ℝ) (hP : P ∈ CompOT.Assignment.couplings a b) (hQ : Q ∈ CompOT.Assignment.couplings b c) :
    CompOT.Assignment.frob (powCost D p) (glue b P Q) ^ (1 / p) ≤
      CompOT.Assignment.frob (powCost D p) P ^ (1 / p) + CompOT.Assignment.frob (powCost D p) Q ^ (1 / p) := by sorry

end CompOT.Metric
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), proof of Proposition 2.2, pp. 378–379
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