Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.2, p. 403 — (f, f^C) ∈ R(C), and f^C is the largest g with (f, g) ∈ R(C)

Proved
CompOT.Duality.sec_3_2_ctransform_admissible

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

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

Let n≥1n \ge 1n≥1, C∈Rn×mC \in \mathbb R^{n\times m}C∈Rn×m and f∈Rnf \in \mathbb R^nf∈Rn, and let fC∈Rmf^C \in \mathbb R^mfC∈Rm be its CCC-transform, (fC)j=min⁡iCi,j−fi(f^C)_j = \min_{i} C_{i,j} - f_i(fC)j​=mini​Ci,j​−fi​. Then

  1. (f,fC)∈R(C)(f, f^C) \in \mathbf R(C)(f,fC)∈R(C), i.e. fi+(fC)j≤Ci,jf_i + (f^C)_j \le C_{i,j}fi​+(fC)j​≤Ci,j​ for all i,ji, ji,j;
  2. fCf^CfC is the largest such vector: if g∈Rmg \in \mathbb R^mg∈Rm satisfies (f,g)∈R(C)(f,g) \in \mathbf R(C)(f,g)∈R(C), then g≤fCg \le f^Cg≤fC elementwise.

In words: once fff is frozen, fCf^CfC is the best admissible choice of the second dual variable. This is the fact behind the semi-dual formulation (3.5).

Formalization Note The hypothesis n≥1n \ge 1n≥1 makes the minimum over ⟦n⟧\llbracket n\rrbracket[[n]] well defined; the book's index sets are nonempty throughout.

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

/-- §3.2, p. 403: `(f, f^C) ∈ R(C)`, and `f^C` is the largest vector `g` with `(f, g) ∈ R(C)`.
The index set `⟦n⟧` is nonempty (`n ≥ 1`), so that `f^C` is a genuine minimum. -/
theorem sec_3_2_ctransform_admissible {n m : ℕ} (hn : 0 < n) (C : Matrix (Fin n) (Fin m) ℝ)
    (f : Fin n → ℝ) :
    dualFeasible C f (cTransform C f) ∧
      ∀ g : Fin m → ℝ, dualFeasible C f g → g ≤ cTransform C f := by sorry

end CompOT.Duality
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), §3.2, p. 403, sentence following the definition of f^C
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