Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(9.18), pp. 530–531 — column-potential block maximizer

Proved
CompOT.Barycenter.g_block_maximizer

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

optimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1sinkhornwasserstein-barycenter

Fix a nonempty barycenter support, a cost matrix CCC, a positive regularization parameter ε\varepsilonε, a strictly positive target histogram bbb, and a row potential fff. Put Kij=e−Cij/εK_{ij}=e^{-C_{ij}/\varepsilon}Kij​=e−Cij​/ε and ui=efi/εu_i=e^{f_i/\varepsilon}ui​=efi​/ε. In the dual objective, the column potential ggg maximizes its block when

gj=εlog⁡bj∑iKijui,egj/ε=bj∑iKijui.g_j=\varepsilon\log\frac{b_j}{\sum_iK_{ij}u_i},\qquad e^{g_j/\varepsilon}=\frac{b_j}{\sum_iK_{ij}u_i}.gj​=εlog∑i​Kij​ui​bj​​,egj​/ε=∑i​Kij​ui​bj​​.

This ggg gives at least as large a block objective as any other column potential.

The identity is the dual interpretation of the column-scaling update in (9.18).

Formalization Note The page says “minimizing (9.21)” although (9.21) is displayed as a maximum. The theorem uses maximization. Positive bjb_jbj​ permits the logarithm, and the nonempty row index makes its denominator positive.

Preamble
import Mathlib
import Definitions.Def_CompOT_Barycenter_Defs
Formal statement
namespace CompOT.Barycenter

/-- The column-potential block optimum is the scaling update (9.18),
as stated after Proposition 9.1 on pp. 530–531. -/
theorem g_block_maximizer {n m : ℕ} (hn : 0 < n) (hm : 0 < m)
    (ε : ℝ) (hε : 0 < ε) (C : Matrix (Fin n) (Fin m) ℝ)
    (b : Fin m → ℝ) (hbSimplex : b ∈ stdSimplex ℝ (Fin m))
    (hb : ∀ j, 0 < b j) (f : Fin n → ℝ) :
    (∀ g : Fin m → ℝ,
      gBlockObjective ε C b f g ≤
        gBlockObjective ε C b f (gBlockUpdate ε C b f)) ∧
    (∀ j, Real.exp (gBlockUpdate ε C b f j / ε) =
      b j / (∑ i, gibbs ε C i j * Real.exp (f i / ε))) := by sorry

end CompOT.Barycenter
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), (9.18), p. 529; paragraph after proof of Proposition 9.1, pp. 530–531
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