Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 4.1, p. 426 — a ⊗ b is the unique solution of min_{P ∈ U(a,b)} −H(P)

Proved
CompOT.EntropicLimit.entropy_max_at_product

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

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

Let a∈Σna \in \Sigma_na∈Σn​ and b∈Σmb \in \Sigma_mb∈Σm​. The product coupling a⊗b=ab⊤=(aibj)i,ja \otimes b = ab^\top = (a_i b_j)_{i,j}a⊗b=ab⊤=(ai​bj​)i,j​ lies in U(a,b)U(a,b)U(a,b) and is the unique solution of

min⁡P∈U(a,b)−H(P):\min_{P \in U(a,b)} -\mathbf H(P):P∈U(a,b)min​−H(P):

every other Q∈U(a,b)Q \in U(a,b)Q∈U(a,b) satisfies H(Q)<H(a⊗b)\mathbf H(Q) < \mathbf H(a\otimes b)H(Q)<H(a⊗b).

This identifies the limit of PεP_\varepsilonPε​ as ε→+∞\varepsilon \to +\inftyε→+∞ in Proposition 4.1: the coupling of maximal entropy between two prescribed marginals is the law of two independent random variables.

Formalization Note H\mathbf HH uses 0log⁡0=00\log 0 = 00log0=0; indices are 0-based.

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

/-- Proof of Proposition 4.1, p. 426: for `a ∈ Σ_n`, `b ∈ Σ_m`, the solution of
`min_{P ∈ U(a,b)} -H(P)` is `a ⊗ b = (a_i b_j)_{i,j}`: it lies in `U(a,b)` and every other
coupling has strictly smaller entropy. -/
theorem entropy_max_at_product {n m : ℕ}
    (a : Fin n → ℝ) (b : Fin m → ℝ)
    (ha : a ∈ stdSimplex ℝ (Fin n)) (hb : b ∈ stdSimplex ℝ (Fin m)) :
    (Matrix.of fun i j => a i * b j) ∈ CompOT.Assignment.couplings a b ∧
      ∀ Q ∈ CompOT.Assignment.couplings a b, Q ≠ (Matrix.of fun i j => a i * b j) →
        entropy Q < entropy (Matrix.of fun i j => a i * b j) := by sorry

end CompOT.EntropicLimit
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), proof of Proposition 4.1, p. 426 (last display)
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