Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 15, p. 806 — a set T with |T| ≥ 2n/3 far (in total) from the rest yields a directed cut of ratio cost O(W)

Proved
LeightonRao.Directed.lemma_15

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

directed-graphp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1region-growingsparsest-cut

Let GGG be a strongly connected directed network on n≥2n\ge2n≥2 nodes, d≥0d\ge0d≥0 a distance function with total weight WWW, and T⊆VT\subseteq VT⊆V with ∣T∣≥2n/3|T|\ge 2n/3∣T∣≥2n/3. If either

∑u∈V−Td(T,u)≥14nor∑u∈V−Td(u,T)≥14n,\sum_{u\in V-T}d(T,u)\ge\frac1{4n}\qquad\text{or}\qquad\sum_{u\in V-T}d(u,T)\ge\frac1{4n},u∈V−T∑​d(T,u)≥4n1​oru∈V−T∑​d(u,T)≥4n1​,

then there is a nonempty proper U⊊VU\subsetneq VU⊊V with

C(U,Uˉ)∣U∣ ∣Uˉ∣≤12 W.\frac{C(U,\bar U)}{|U|\,|\bar U|}\le 12\,W.∣U∣∣Uˉ∣C(U,Uˉ)​≤12W.

Here d(T,u)d(T,u)d(T,u) is the shortest directed distance from TTT to uuu and d(u,T)d(u,T)d(u,T) the shortest directed distance from uuu to TTT.

Formalization Note The paper states "ratio cost O(W)O(W)O(W)" and says the proof is virtually identical to Lemma 5's, whose computation (p. 800) gives R≤6WR\le 6WR≤6W from the threshold 1/(2n)1/(2n)1/(2n); with 1/(4n)1/(4n)1/(4n) the same computation gives 12W12W12W, which is the constant stated. Strong connectivity is assumed so that the distances are the paper's (otherwise unreachable pairs would carry Lean's junk value 000).

Preamble
import Mathlib
import Definitions.Def_LeightonRao_Directed_Setting
Formal statement
namespace LeightonRao.Directed

/-- Leighton–Rao, Lemma 15, p. 806. If `T ⊆ V` has `|T| ≥ 2n/3` and either
`∑_{u ∈ V − T} d(T, u) ≥ 1/(4n)` or `∑_{u ∈ V − T} d(u, T) ≥ 1/(4n)`, then some directed cut has
ratio cost at most `12 W` (the constant of Lemma 5's computation, p. 800, with `1/(4n)` in place of
`1/(2n)`). -/
theorem lemma_15 {V : Type} [Fintype V] [DecidableEq V] (N : DiNetwork V)
    (hn : 2 ≤ Fintype.card V) (hconn : IsStronglyConnectedNet N)
    (d : V → V → ℝ) (hd : ∀ u v, 0 ≤ d u v) (T : Finset V)
    (hT : 2 * (Fintype.card V : ℝ) ≤ 3 * (T.card : ℝ))
    (hsum : 1 / (4 * (Fintype.card V : ℝ)) ≤ ∑ u ∈ Tᶜ, diDistFrom N d T u ∨
      1 / (4 * (Fintype.card V : ℝ)) ≤ ∑ u ∈ Tᶜ, diDistTo N d u T) :
    ∃ U : Finset V, U.Nonempty ∧ Uᶜ.Nonempty ∧ diRatio N U ≤ 12 * diTotalWeight N d := by sorry

end LeightonRao.Directed
Source
Leighton and Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM 46 (1999), p. 806, Lemma 15 (proof p. 807, referring to Lemma 5, pp. 799–800)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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