Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5, p. 799 — |T| ≥ 2n/3 and Σ_{u∉T} d(T, u) ≥ 1/2n give a cut of ratio cost ≤ 6W

Proved
LeightonRao.Uniform.lemma_5

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

graph-cutgraph-distancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparsest-cut

Let GGG be a connected network on n≥2n\ge2n≥2 nodes and ddd a distance function with total weight WWW. Suppose T⊆VT\subseteq VT⊆V satisfies ∣T∣≥2n/3|T|\ge 2n/3∣T∣≥2n/3 and

∑u∈V∖Td(T,u)≥12n,\sum_{u\in V\setminus T}d(T,u)\ge\frac1{2n},u∈V∖T∑​d(T,u)≥2n1​,

where d(T,u)=min⁡t∈Td(t,u)d(T,u)=\min_{t\in T}d(t,u)d(T,u)=mint∈T​d(t,u) is the shortest-path distance from TTT. Then there is a nonempty proper subset U⊂VU\subset VU⊂V with

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

This handles the case of Corollary 4 in which a large component of small radius exists.

Formalization Note The page states the conclusion as "ratio cost O(W)O(W)O(W)"; the constant 666 is the one computed in the proof on p. 800 (R≤6WR\le6WR≤6W). Connectivity is the paper's standing assumption (p. 789) and makes the graph distances well defined; n≥2n\ge2n≥2 makes TTT nonempty and a proper cut exist.

Preamble
import Definitions.Def_LeightonRao_Uniform_Dual

set_option autoImplicit false
open scoped BigOperators
Formal statement
namespace LeightonRao.Uniform

/-- Lemma 5, p. 799, with the proof's explicit factor `6`. -/
theorem lemma_5 {V : Type} [Fintype V] [DecidableEq V]
    (N : Network V) (hn : 2 ≤ Fintype.card V) (hconn : IsConnectedNet N)
    (d : V → V → ℝ) (hd : IsDistanceFunction d)
    (T : Finset V) (hT : 2 * (Fintype.card V : ℝ) ≤ 3 * (T.card : ℝ))
    (hsum : 1 / (2 * (Fintype.card V : ℝ)) ≤ ∑ u ∈ Tᶜ, distFrom N d T u) :
    ∃ U : Finset V, U.Nonempty ∧ Uᶜ.Nonempty ∧
      ratioCost N U ≤ 6 * totalWeight N d := by sorry

end LeightonRao.Uniform
Source
Leighton and Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM 46 (1999), p. 799, Lemma 5 (constant 6 from its proof, p. 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