Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.3, p. 405 — complementary feasible P and (f, g) are primal and dual optimal

Proved
CompOT.Duality.proposition_3_3

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

complementary-slacknesskantorovich-dualityoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let a∈Σna \in \Sigma_na∈Σn​, b∈Σmb \in \Sigma_mb∈Σm​ be histograms and C∈Rn×mC \in \mathbb R^{n\times m}C∈Rn×m. Suppose P∈U(a,b)P \in \mathbf U(a,b)P∈U(a,b) is primal feasible, (f,g)∈R(C)(f,g) \in \mathbf R(C)(f,g)∈R(C) is dual feasible, and PPP and (f,g)(f,g)(f,g) are complementary w.r.t. CCC (Definition 3.1: Ci,j=fi+gjC_{i,j} = f_i + g_jCi,j​=fi​+gj​ whenever Pi,j>0P_{i,j} > 0Pi,j​>0). Then

  1. PPP is optimal for the primal problem: ⟨C,P⟩≤⟨C,Q⟩\langle C,P\rangle \le \langle C,Q\rangle⟨C,P⟩≤⟨C,Q⟩ for all Q∈U(a,b)Q \in \mathbf U(a,b)Q∈U(a,b);
  2. (f,g)(f,g)(f,g) is optimal for the dual problem: ⟨f′,a⟩+⟨g′,b⟩≤⟨f,a⟩+⟨g,b⟩\langle f',a\rangle + \langle g',b\rangle \le \langle f,a\rangle + \langle g,b\rangle⟨f′,a⟩+⟨g′,b⟩≤⟨f,a⟩+⟨g,b⟩ for all (f′,g′)∈R(C)(f',g') \in \mathbf R(C)(f′,g′)∈R(C).

This is the sufficiency half of complementary slackness: complementarity certifies optimality of both solutions at once.

Formalization Note The page cites the primal and dual as "(2.24)" and "(2.11)"; these are the measure-theoretic problem and the discrete primal. The intended problems are the discrete primal (2.11) and dual (2.20), which is what is stated here.

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

/-- Proposition 3.3, p. 405: if `P ∈ U(a, b)` and `(f, g) ∈ R(C)` are complementary
(Definition 3.1), then `P` is optimal for the primal (2.11) and `(f, g)` is optimal for the
dual (2.20). -/
theorem proposition_3_3 {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)
    (hcomp : Complementary C P f g) :
    CompOT.Assignment.IsOptimalCoupling C a b P ∧ IsDualOptimal C a b f g := by sorry

end CompOT.Duality
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), Proposition 3.3 and Definition 3.1, p. 405
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