Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.7, p. 420 — the auction algorithm maintains ε-complementary slackness at each iteration

Proved
CompOT.Auction.proposition_3_7

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

assignment-problemauction-algorithmcomplementary-slacknessoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let C∈Rn×n\mathbf C\in\mathbb R^{n\times n}C∈Rn×n and ε>0\varepsilon>0ε>0, and let (St,ξt,gt)t=0T(S^t,\xi^t,\mathbf g^t)_{t=0}^{T}(St,ξt,gt)t=0T​ be the first TTT iterations of the auction algorithm started from S0=∅S^0=\emptysetS0=∅, g0=0n\mathbf g^0=0_ng0=0n​. Then every state satisfies ε-complementary slackness: for all t≤Tt\le Tt≤T,

∀i∈St,Ci,ξit−gξitt≤ε+min⁡j(Ci,j−gjt).\forall i\in S^t,\qquad \mathbf C_{i,\xi^t_i}-\mathbf g^t_{\xi^t_i}\le\varepsilon+\min_j\big(\mathbf C_{i,j}-\mathbf g^t_j\big).∀i∈St,Ci,ξit​​−gξit​t​≤ε+jmin​(Ci,j​−gjt​).

Together with termination, this invariant is what makes the final assignment nεn\varepsilonnε-suboptimal (Proposition 3.9).

Formalization Note [ ⁣[n] ⁣][\![n]\!][[n]] is Fin n; the iterations are any sequence of admissible updates (3.9), ties in the argmins being resolved arbitrarily.

Preamble
import Mathlib
import Definitions.Def_CompOT_Auction_Defs
Formal statement
namespace CompOT.Auction

/-- Proposition 3.7, p. 420: the auction algorithm maintains ε-complementary slackness at each
iteration. -/
theorem proposition_3_7 {n : ℕ} (C : Matrix (Fin n) (Fin n) ℝ) {ε : ℝ} (hε : 0 < ε)
    (s : ℕ → AuctionState n) (T : ℕ) (hs : IsAuctionPrefix C ε s T) :
    ∀ t ≤ T, EpsCS C ε (s t) := by sorry

end CompOT.Auction
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), Proposition 3.7, p. 420
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