Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2.2, p. 378 — the glued matrix S = P diag(1/b̃) Q lies in U(a, c)

Proved
CompOT.Metric.prop_2_2_gluing

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

gluingoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1transportation-polytope

Let 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) and Q∈U(b,c)Q\in U(b,c)Q∈U(b,c). Let b~j=bj\tilde b_j=b_jb~j​=bj​ if bj>0b_j>0bj​>0 and b~j=1\tilde b_j=1b~j​=1 otherwise. Then

S=P diag(1/b~) Q∈U(a,c).S=P\,\mathrm{diag}(1/\tilde b)\,Q\in U(a,c).S=Pdiag(1/b~)Q∈U(a,c).

This is the discrete gluing lemma: SSS is nonnegative, its row sums are aaa and its column sums are ccc. It is the coupling used to compare Wp(a,c)\mathrm W_p(a,c)Wp​(a,c) with Wp(a,b)+Wp(b,c)\mathrm W_p(a,b)+\mathrm W_p(b,c)Wp​(a,b)+Wp​(b,c).

Formalization Note The page takes PPP and QQQ optimal; the membership claim does not use optimality, so it is stated for every P∈U(a,b)P\in U(a,b)P∈U(a,b) and Q∈U(b,c)Q\in U(b,c)Q∈U(b,c), which contains the page's case.

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

open Matrix

/-- Proof of Proposition 2.2, p. 378: for `a, b, c ∈ Σ_n`, `P ∈ U(a, b)` and
`Q ∈ U(b, c)`, the glued matrix `S = P diag(1/b̃) Q` is nonnegative and lies in `U(a, c)`.
(The page takes `P`, `Q` optimal; optimality is not used for this claim.) -/
theorem prop_2_2_gluing {n : ℕ} (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) :
    glue b P Q ∈ CompOT.Assignment.couplings a c := by sorry

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