Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.7), p. 428 — P_ε is the KL projection of the Gibbs kernel K = e^{−C/ε} onto U(a, b)

Proved
CompOT.EntropicLimit.eq_4_7

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

bregman-projectionentropic-regularizationkullback-leibleroptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let aaa, bbb be marginals, CCC a cost matrix, ε>0\varepsilon > 0ε>0, and let Ki,j=e−Ci,j/εK_{i,j} = e^{-C_{i,j}/\varepsilon}Ki,j​=e−Ci,j​/ε be the Gibbs kernel. A matrix PPP solves the entropic problem (4.2) if and only if it solves the Kullback–Leibler projection problem

P=Proj⁡U(a,b)KL(K)=argmin⁡P∈U(a,b)KL(P ∣ K).P = \operatorname{Proj}^{\mathrm{KL}}_{U(a,b)}(K) = \operatorname*{argmin}_{P \in U(a,b)} \mathrm{KL}(P\,|\,K).P=ProjU(a,b)KL​(K)=P∈U(a,b)argmin​KL(P∣K).

In particular the unique solution PεP_\varepsilonPε​ of (4.2) is the KL projection of KKK onto U(a,b)U(a,b)U(a,b).

This reformulation is the starting point of Sinkhorn's algorithm.

Formalization Note Stated as an equivalence of the two optimality predicates for every matrix PPP; KL\mathrm{KL}KL uses 0log⁡0=00\log 0 = 00log0=0.

Preamble
import Mathlib
import Definitions.Def_CompOT_EntropicLimit_Defs
Formal statement
namespace CompOT.EntropicLimit

/-- (4.7), p. 428: for `ε > 0`, a matrix solves (4.2) if and only if it minimizes
`KL(·|K)` over `U(a,b)`, where `K` is the Gibbs kernel `K_{i,j} = exp(-C_{i,j}/ε)`. -/
theorem eq_4_7 {n m : ℕ} (C : Matrix (Fin n) (Fin m) ℝ)
    (a : Fin n → ℝ) (b : Fin m → ℝ) (ε : ℝ) (hε : 0 < ε)
    (P : Matrix (Fin n) (Fin m) ℝ) :
    IsEntropicOptimal C a b ε P ↔
      (P ∈ CompOT.Assignment.couplings a b ∧
        ∀ Q ∈ CompOT.Assignment.couplings a b, klMat P (gibbs C ε) ≤ klMat Q (gibbs C ε)) := by sorry

end CompOT.EntropicLimit
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), (4.6)–(4.7), p. 428
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