Proposition 4.1, pp. 425–426 — P_ε → max-entropy optimal plan and L^ε_C → L_C as ε → 0; P_ε → a ⊗ b as ε → ∞
ProvedCompOT.EntropicLimit.proposition_4_1Let , be histograms and a cost matrix. For each let be the solution of the entropic problem (4.2), and let be the optimal coupling of the Kantorovich problem with maximal entropy (4.3). Then
- as ;
- as ;
- as (4.4).
Small regularization recovers the most diffuse exact optimal transport plan, while large regularization yields the independent coupling.
Formalization Note is given as any family satisfying the optimality predicate of (4.2) for each (its values at are irrelevant), and as any matrix satisfying the predicate of (4.3); existence and uniqueness of both are separate items of this mission, so the hypotheses are satisfiable and determine the objects. Convergence of matrices is entrywise. uses (the book's convention for zero entries is not used). Indices are 0-based.
import Mathlib import Definitions.Def_CompOT_EntropicLimit_Defs
namespace CompOT.EntropicLimit
open Filter Topology
/-- Proposition 4.1, pp. 425–426. Let `a ∈ Σ_n`, `b ∈ Σ_m`, `P_ε` the solution of (4.2) for
each `ε > 0`, and `P₀` the maximal-entropy optimal coupling (4.3). Then `P_ε → P₀` as
`ε → 0⁺`, `L^ε_C(a,b) = ⟨C,P_ε⟩ - ε H(P_ε) → L_C(a,b) = ⟨C,P₀⟩` as `ε → 0⁺`, and
`P_ε → a ⊗ b` as `ε → +∞` (4.4). -/
theorem proposition_4_1 {n m : ℕ} (C : Matrix (Fin n) (Fin m) ℝ)
(a : Fin n → ℝ) (b : Fin m → ℝ)
(ha : a ∈ stdSimplex ℝ (Fin n)) (hb : b ∈ stdSimplex ℝ (Fin m))
(Pe : ℝ → Matrix (Fin n) (Fin m) ℝ)
(hPe : ∀ ε, 0 < ε → IsEntropicOptimal C a b ε (Pe ε))
(P₀ : Matrix (Fin n) (Fin m) ℝ) (hP₀ : IsMaxEntropyOptimal C a b P₀) :
Tendsto Pe (𝓝[>] 0) (𝓝 P₀) ∧
Tendsto (fun ε => entObjective C ε (Pe ε)) (𝓝[>] 0) (𝓝 (CompOT.Assignment.frob C P₀)) ∧
Tendsto Pe atTop (𝓝 (Matrix.of fun i j => a i * b j)) := by sorry
end CompOT.EntropicLimit
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.