Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.4, p. 406 — the support graph of an extremal point of U(a, b) has no cycles; P has at most n + m − 1 nonzero entries

Proved
CompOT.Vertices.proposition_3_4

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

bipartite-graphextreme-pointforestoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1transportation-polytope

Proposition 3.4 (Extremal solutions). Let a∈Σna \in \Sigma_na∈Σn​, b∈Σmb \in \Sigma_mb∈Σm​ be histograms, and let PPP be an extremal point of the transportation polytope

U(a,b)={P∈R+n×m:P1m=a, P⊤1n=b}.U(a,b) = \{P \in \mathbb R_+^{n\times m} : P\mathbb 1_m = a,\ P^\top\mathbb 1_n = b\}.U(a,b)={P∈R+n×m​:P1m​=a, P⊤1n​=b}.

Let S(P)S(P)S(P) be the set of edges (i,j′)(i, j')(i,j′), i∈[ ⁣[n] ⁣]i \in [\![n]\!]i∈[[n]], j∈[ ⁣[m] ⁣]j \in [\![m]\!]j∈[[m]], with Pij>0P_{ij} > 0Pij​>0. Then the graph G(P)=(V∪V′,S(P))G(P) = (V \cup V', S(P))G(P)=(V∪V′,S(P)) on the n+mn + mn+m nodes V={1,…,n}V = \{1,\dots,n\}V={1,…,n}, V′={1′,…,m′}V' = \{1',\dots,m'\}V′={1′,…,m′} has no cycles. In particular,

#{(i,j):Pij≠0}≤n+m−1.\#\{(i,j) : P_{ij} \ne 0\} \le n + m - 1 .#{(i,j):Pij​=0}≤n+m−1.

The vertices of U(a,b)U(a,b)U(a,b) are therefore sparse: their supports are forests of the complete bipartite graph between sources and targets. Since a linear program over U(a,b)U(a,b)U(a,b) attains its minimum at a vertex, optimal transport plans can be sought among such sparse matrices; this is the structure exploited by the network simplex and the north-west corner rule.

Formalization Note Indices are Fin n, Fin m. Extremality is the book's midpoint definition relative to U(a,b)U(a,b)U(a,b). "No cycles" is SimpleGraph.IsAcyclic of the undirected bipartite support graph. The simplex hypotheses come from the book's standing notation (p. 360) and imply nonempty index sets. Thus natural-number subtraction in n+m−1n+m-1n+m−1 agrees with the book's integer expression.

Preamble
import Mathlib
import Definitions.Def_CompOT_Vertices_Defs
Formal statement
namespace CompOT.Vertices

/-- Proposition 3.4 (Extremal solutions), p. 406: for the book's histograms
`a ∈ Σₙ`, `b ∈ Σₘ` (Notation, p. 360), if `P` is an extremal point of `U(a, b)`,
then its support graph has no cycles and `P` has at most `n + m − 1` nonzero entries. -/
theorem proposition_3_4 {n m : ℕ} (a : Fin n → ℝ) (b : Fin m → ℝ)
    (P : Matrix (Fin n) (Fin m) ℝ)
    (ha : a ∈ stdSimplex ℝ (Fin n)) (hb : b ∈ stdSimplex ℝ (Fin m))
    (hP : IsExtremal (CompOT.Assignment.couplings a b) P) :
    (supportGraph P).IsAcyclic ∧ (nonzeroEntries P).card ≤ n + m - 1 := by sorry

end CompOT.Vertices
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), §3.4.1, Proposition 3.4, p. 406
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