Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 3.4, p. 407 — P ± tE stays in U(a, b) for a small step t > 0

Proved
CompOT.Vertices.prop_3_4_perturbation_feasible

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

extreme-pointoptimal-transportp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-bookp2o-v1transportation-polytope

Let a∈Σna \in \Sigma_na∈Σn​, b∈Σmb \in \Sigma_mb∈Σm​ be the book's histograms and P∈U(a,b)P \in U(a,b)P∈U(a,b). Let E∈Rn×mE \in \mathbb R^{n\times m}E∈Rn×m have zero row sums and zero column sums, E1m=0nE\mathbb 1_m = 0_nE1m​=0n​ and E⊤1n=0mE^\top \mathbb 1_n = 0_mE⊤1n​=0m​, and be supported on the support of PPP: Eij≠0E_{ij} \ne 0Eij​=0 implies Pij>0P_{ij} > 0Pij​>0. Then there is t>0t > 0t>0 such that

Q=P+tE∈U(a,b)andR=P−tE∈U(a,b).Q = P + tE \in U(a,b) \qquad\text{and}\qquad R = P - tE \in U(a,b).Q=P+tE∈U(a,b)andR=P−tE∈U(a,b).

Since P=(Q+R)/2P = (Q+R)/2P=(Q+R)/2, a nonzero such EEE shows that PPP is not an extremal point of U(a,b)U(a,b)U(a,b). This is the feasibility half of the proof of Proposition 3.4.

Formalization Note The simplex hypotheses are the book's standing notation (p. 360). The step ttt plays the role of the book's "elementary amount of flow" ε<min⁡(i,j′)∈S(P)Pij\varepsilon < \min_{(i,j') \in S(P)} P_{ij}ε<min(i,j′)∈S(P)​Pij​.

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

/-- Proof of Proposition 3.4, p. 407: for histograms `a ∈ Σₙ`, `b ∈ Σₘ`, a perturbation matrix `E` with zero row sums
(`E 𝟙_m = 0_n`), zero column sums (`Eᵀ 𝟙_n = 0_m`) and supported on the support of `P`
can be added to and subtracted from a coupling `P ∈ U(a, b)` with a small enough positive
step `t` (the book's "elementary amount of flow" `ε`), and both `Q = P + tE` and
`R = P − tE` stay in `U(a, b)`. -/
theorem prop_3_4_perturbation_feasible {n m : ℕ} (a : Fin n → ℝ) (b : Fin m → ℝ)
    (P E : Matrix (Fin n) (Fin m) ℝ)
    (ha : a ∈ stdSimplex ℝ (Fin n)) (hb : b ∈ stdSimplex ℝ (Fin m))
    (hP : P ∈ CompOT.Assignment.couplings a b)
    (hrow : ∀ i, ∑ j, E i j = 0) (hcol : ∀ j, ∑ i, E i j = 0)
    (hsupp : ∀ i j, E i j ≠ 0 → 0 < P i j) :
    ∃ t : ℝ, 0 < t ∧ P + t • E ∈ CompOT.Assignment.couplings a b ∧ P - t • E ∈ CompOT.Assignment.couplings a b := by sorry

end CompOT.Vertices
Source
Peyré & Cuturi, Computational Optimal Transport (FnT ML 2019), §3.4.1, proof of Proposition 3.4, p. 407 (Q = P + E and R = P − E are feasible)
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