Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Remark 4.21, (4.35)–(4.36) — exact log-domain block updates

Proved
CompOT.EntropicDual.remark_4_21_updates

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

entropyoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1sinkhorn

Let a∈Σna\in\Sigma_na∈Σn​ and b∈Σmb\in\Sigma_mb∈Σm​ have strictly positive entries and let ε>0\varepsilon>0ε>0. For any fixed ggg, the unique maximizer of f↦Q(f,g)f\mapsto Q(f,g)f↦Q(f,g) is

fi=εlog⁡ai−εlog⁡(∑jKijegj/ε).f_i=\varepsilon\log a_i-\varepsilon\log\left(\sum_jK_{ij}e^{g_j/\varepsilon}\right).fi​=εlogai​−εlog(j∑​Kij​egj​/ε).

Symmetrically, for fixed fff, the unique maximizer of g↦Q(f,g)g\mapsto Q(f,g)g↦Q(f,g) is

gj=εlog⁡bj−εlog⁡(∑iKijefi/ε).g_j=\varepsilon\log b_j-\varepsilon\log\left(\sum_iK_{ij}e^{f_i/\varepsilon}\right).gj​=εlogbj​−εlog(i∑​Kij​efi​/ε).

Alternating these exact block maximizers is the log-domain form of Sinkhorn's scaling updates.

Formalization Note The statement compares the dual objective with every vector in each block and characterizes equality, which gives uniqueness. Positivity makes both logarithms meaningful.

Preamble
import Mathlib
import Definitions.Def_CompOT_EntropicDual_Defs
Formal statement
namespace CompOT.EntropicDual

/-- Remark 4.21, (4.35)–(4.36), p. 449: each log-domain update is the
unique maximizer of the dual objective with the other potential fixed. -/
theorem remark_4_21_updates {n m : ℕ} (C : Matrix (Fin n) (Fin m) ℝ)
    (a : Fin n → ℝ) (b : Fin m → ℝ) (ε : ℝ)
    (hn : 0 < n) (hm : 0 < m) (hε : 0 < ε)
    (ha : a ∈ stdSimplex ℝ (Fin n)) (hb : b ∈ stdSimplex ℝ (Fin m))
    (ha_pos : ∀ i, 0 < a i) (hb_pos : ∀ j, 0 < b j) :
    (∀ g f, dualObjEnt C a b ε f g ≤ dualObjEnt C a b ε (updateF C a ε g) g ∧
      (dualObjEnt C a b ε f g = dualObjEnt C a b ε (updateF C a ε g) g →
        f = updateF C a ε g)) ∧
    (∀ f g, dualObjEnt C a b ε f g ≤ dualObjEnt C a b ε f (updateG C b ε f) ∧
      (dualObjEnt C a b ε f g = dualObjEnt C a b ε f (updateG C b ε f) →
        g = updateG C b ε f)) := by sorry

end CompOT.EntropicDual
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), Remark 4.21, (4.35)–(4.36), p. 449. https://doi.org/10.1561/2200000073
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