Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, p. 403 — for (f, g) ∈ R(C): ⟨f, a⟩ + ⟨g, b⟩ ≤ ⟨f, a⟩ + ⟨f^C, b⟩

Proved
CompOT.Duality.sec_3_2_semidual_inequality

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

c-transformkantorovich-dualityoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1semi-dual

Let a∈Σna \in \Sigma_na∈Σn​, b∈Σmb \in \Sigma_mb∈Σm​ be histograms, C∈Rn×mC \in \mathbb R^{n\times m}C∈Rn×m, and (f,g)∈R(C)(f,g) \in \mathbf R(C)(f,g)∈R(C). With fCf^CfC the CCC-transform of fff,

⟨f,a⟩+⟨g,b⟩  ≤  ⟨f,a⟩+⟨fC,b⟩.\langle f,a\rangle + \langle g,b\rangle \;\le\; \langle f,a\rangle + \langle f^C,b\rangle.⟨f,a⟩+⟨g,b⟩≤⟨f,a⟩+⟨fC,b⟩.

Replacing ggg by fCf^CfC never decreases the dual objective, so the dual problem (2.20) can be reduced to a maximization over fff alone.

Formalization Note a∈Σna \in \Sigma_na∈Σn​ forces n≥1n \ge 1n≥1, so fCf^CfC is a genuine minimum. Only b≥0b \ge 0b≥0 is needed for the inequality; the full histogram hypotheses are the book's standing convention.

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

/-- §3.2, p. 403: for histograms `a ∈ Σ_n`, `b ∈ Σ_m` and any dual feasible `(f, g) ∈ R(C)`,
`⟨f, a⟩ + ⟨g, b⟩ ≤ ⟨f, a⟩ + ⟨f^C, b⟩`. -/
theorem sec_3_2_semidual_inequality {n m : ℕ} (a : Fin n → ℝ) (b : Fin m → ℝ)
    (ha : a ∈ stdSimplex ℝ (Fin n)) (hb : b ∈ stdSimplex ℝ (Fin m))
    (C : Matrix (Fin n) (Fin m) ℝ) (f : Fin n → ℝ) (g : Fin m → ℝ)
    (hfg : dualFeasible C f g) :
    dualObj a b f g ≤ dualObj a b f (cTransform C f) := by sorry

end CompOT.Duality
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), §3.2, p. 403, display preceding (3.5)
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