Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3.7, properties (b)–(c), pp. 419–420 — each iteration keeps |S|, lowers one price by ≥ ε and raises none

Proved
CompOT.Auction.properties_b_c

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

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

Let C∈Rn×n\mathbf C\in\mathbb R^{n\times n}C∈Rn×n, ε>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 for every iteration t<Tt<Tt<T:

  1. (b) the size of SSS does not decrease: ∣St∣≤∣St+1∣|S^{t}|\le|S^{t+1}|∣St∣≤∣St+1∣;
  2. (c) some entry of the dual vector decreases by at least ε\varepsilonε: there is an object jjj with gjt+1≤gjt−ε\mathbf g^{t+1}_j\le\mathbf g^{t}_j-\varepsilongjt+1​≤gjt​−ε;
  3. no entry of the dual vector increases: gt+1≤gt\mathbf g^{t+1}\le\mathbf g^{t}gt+1≤gt entrywise.

These are the bookkeeping properties the book reads off the update (3.9); the monotonicity of g\mathbf gg is the fact "gn≤g\mathbf g^{\mathrm n}\le\mathbf ggn≤g" used in the proof of Proposition 3.7.

Formalization Note The book says the size of SSS "can only increase"; it stays the same when the bidder displaces a previously assigned point, so (b) is stated as non-decrease. The book's (c) speaks of "an index iii such that gi\mathbf g_igi​ decreases"; g\mathbf gg is indexed by objects, so the index is written jjj. Item 3 is from the proof of Proposition 3.7, p. 421.

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

/-- Properties (b) and (c), p. 419, "valid after each iteration" (p. 420): along the auction
algorithm, the size of `S` never decreases, some entry of `g` decreases by at least `ε`, and no
entry of `g` increases (`g^n ≤ g`, proof of Proposition 3.7, p. 421). -/
theorem properties_b_c {n : ℕ} (C : Matrix (Fin n) (Fin n) ℝ) {ε : ℝ} (hε : 0 < ε)
    (s : ℕ → AuctionState n) (T : ℕ) (hs : IsAuctionPrefix C ε s T) :
    ∀ t < T, (s t).S.card ≤ (s (t + 1)).S.card ∧
      (∃ j, (s (t + 1)).g j ≤ (s t).g j - ε) ∧
      ∀ j, (s (t + 1)).g j ≤ (s t).g j := by sorry

end CompOT.Auction
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), §3.7, properties (b), (c), p. 419, and Algorithmic properties, p. 420; proof of Proposition 3.7, p. 421
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