Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 4.5 — entropic dual maximizers are Kantorovich feasible

Proved
CompOT.EntropicDual.proposition_4_5

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

dualityentropyoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let a∈Σna\in\Sigma_na∈Σn​ and b∈Σmb\in\Sigma_mb∈Σm​ be probability histograms, let C∈Rn×mC\in\mathbb R^{n\times m}C∈Rn×m, and let ε>0\varepsilon>0ε>0. Every pair (f,g)(f,g)(f,g) maximizing the entropic dual objective QQQ satisfies fi+gj≤Cijf_i+g_j\le C_{ij}fi​+gj​≤Cij​ for every i,ji,ji,j. Consequently,

⟨f,a⟩+⟨g,b⟩≤LC(a,b),\langle f,a\rangle+\langle g,b\rangle\le L_C(a,b),⟨f,a⟩+⟨g,b⟩≤LC​(a,b),

where LCL_CLC​ is the unregularized Kantorovich cost. Thus the entropic dual potentials supply a feasible lower bound for ordinary optimal transport.

Formalization Note A maximizer is a pair whose objective dominates all pairs; the real infimum defining LCL_CLC​ is only used with nonempty, bounded coupling sets. If a histogram has a zero entry, there is no finite maximizer, so the conditional statement has no instance there.

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

/-- Proposition 4.5, pp. 452–453: every entropic dual maximizer is a feasible
Kantorovich potential and its linear objective is below the unregularized cost. -/
theorem proposition_4_5 {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))
    (f : Fin n → ℝ) (g : Fin m → ℝ)
    (hmax : ∀ f' g', dualObjEnt C a b ε f' g' ≤ dualObjEnt C a b ε f g) :
    KantorovichFeasible C f g ∧
      (∑ i, f i * a i) + (∑ j, g j * b j) ≤ unregCost C a b := by sorry

end CompOT.EntropicDual
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), Proposition 4.5, pp. 452–453. 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