Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 2.21, p. 385 — weak duality: ⟨C, P⟩ ≥ Σ P_{ij}(f_i + g_j) = ⟨f, a⟩ + ⟨g, b⟩

Proved
CompOT.Duality.remark_2_21_weak_duality

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

kantorovich-dualityoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1weak-duality

Let a∈Σna \in \Sigma_na∈Σn​ and b∈Σmb \in \Sigma_mb∈Σm​ be histograms (nonnegative vectors summing to 111), let C∈Rn×mC \in \mathbb R^{n\times m}C∈Rn×m, let P∈U(a,b)P \in \mathbf U(a,b)P∈U(a,b) be a transport plan and let (f,g)∈R(C)(f,g) \in \mathbf R(C)(f,g)∈R(C), i.e. fi+gj≤Ci,jf_i + g_j \le C_{i,j}fi​+gj​≤Ci,j​ for all i,ji,ji,j. Then

∑i,jPi,jCi,j  ≥  ∑i,jPi,j(fi+gj)  =  (∑ifi∑jPi,j)+(∑jgj∑iPi,j)  =  ⟨f,a⟩+⟨g,b⟩.\sum_{i,j} P_{i,j}C_{i,j} \;\ge\; \sum_{i,j} P_{i,j}(f_i+g_j) \;=\; \Big(\sum_i f_i \sum_j P_{i,j}\Big) + \Big(\sum_j g_j \sum_i P_{i,j}\Big) \;=\; \langle f,a\rangle + \langle g,b\rangle.i,j∑​Pi,j​Ci,j​≥i,j∑​Pi,j​(fi​+gj​)=(i∑​fi​j∑​Pi,j​)+(j∑​gj​i∑​Pi,j​)=⟨f,a⟩+⟨g,b⟩.

This is the easy half of Kantorovich duality: every admissible pair of prices (f,g)(f,g)(f,g) gives a lower bound on the cost of every transport plan, hence on LC(a,b)L_C(a,b)LC​(a,b).

Formalization Note The three relations of the display are stated as a conjunction, with the sums written explicitly. The histogram hypotheses a∈Σna \in \Sigma_na∈Σn​, b∈Σmb \in \Sigma_mb∈Σm​ are the book's standing convention for (a,b)(a,b)(a,b) (notation section, and (2.11)).

Preamble
import Mathlib
import Definitions.Def_CompOT_Duality_Defs
Formal statement
namespace CompOT.Duality

/-- Remark 2.21, display on p. 385: for a transport plan `P ∈ U(a, b)` and prices
`(f, g) ∈ R(C)`, `∑ P_{ij} C_{ij} ≥ ∑ P_{ij} (f_i + g_j) = (∑_i f_i ∑_j P_{ij}) + (∑_j g_j ∑_i P_{ij})
= ⟨f, a⟩ + ⟨g, b⟩`. -/
theorem remark_2_21_weak_duality {n m : ℕ} (a : Fin n → ℝ) (b : Fin m → ℝ)
    (ha : a ∈ stdSimplex ℝ (Fin n)) (hb : b ∈ stdSimplex ℝ (Fin m))
    (C P : Matrix (Fin n) (Fin m) ℝ) (hP : P ∈ CompOT.Assignment.couplings a b)
    (f : Fin n → ℝ) (g : Fin m → ℝ) (hfg : dualFeasible C f g) :
    ∑ i, ∑ j, P i j * (f i + g j) ≤ ∑ i, ∑ j, P i j * C i j ∧
      ∑ i, ∑ j, P i j * (f i + g j) = (∑ i, f i * ∑ j, P i j) + (∑ j, g j * ∑ i, P i j) ∧
      (∑ i, f i * ∑ j, P i j) + (∑ j, g j * ∑ i, P i j) = dualObj a b f g := by sorry

end CompOT.Duality
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), Remark 2.21, display on p. 385 (preceding text on p. 384)
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