Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 10, p. 802 — if π(T) ≥ 2p/3 and Σ_{u∈𝒫−T} π(u)d(T,u) ≥ 1/2p, there is a cut of weighted ratio cost ≤ 6W

Proved
LeightonRao.Product.lemma_10

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

distance-functionmulticommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparsest-cut

Let GGG be a connected capacitated network on VVV, let π≥0\pi\ge0π≥0 be a PMFP node weighting with p=∣P∣≥2p=|\mathcal P|\ge2p=∣P∣≥2 and ∑uπ(u)=p\sum_u\pi(u)=p∑u​π(u)=p, and let ddd be a distance function with total weight WWW. Suppose T⊆VT\subseteq VT⊆V satisfies π(T)≥2p/3\pi(T)\ge 2p/3π(T)≥2p/3 and

∑u∈P−Tπ(u) d(T,u)≥12p.\sum_{u\in\mathcal P-T}\pi(u)\,d(T,u)\ge\frac1{2p}.u∈P−T∑​π(u)d(T,u)≥2p1​.

Then there is a cut ⟨U,Uˉ⟩\langle U,\bar U\rangle⟨U,Uˉ⟩ with π(U)>0\pi(U)>0π(U)>0, π(Uˉ)>0\pi(\bar U)>0π(Uˉ)>0 and weighted ratio cost

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

This is the "heavy core" case of Lemma 11: when a heavy set TTT is far, on average, from the remaining weight, a level cut around TTT is cheap.

Formalization Note The page writes "ratio cost O(W)O(W)O(W)"; its proof (which defines RiR_iRi​ as the weighted ratio cost) and its use in Lemma 11 make clear that the weighted ratio cost is meant, and that is what is stated. The constant 666 is the one obtained by the computation in the proof of Lemma 5 (p. 800), to which the proof of Lemma 10 refers. The sum over P−T\mathcal P-TP−T is written over V∖TV\setminus TV∖T; the extra terms vanish because π=0\pi=0π=0 off P\mathcal PP. Connectivity makes the graph distances d(T,u)d(T,u)d(T,u) meaningful.

Preamble
import Mathlib
import Definitions.Def_LeightonRao_Product_Setting
Formal statement
namespace LeightonRao.Product

theorem lemma_10 {V : Type} [Fintype V] [DecidableEq V] (N : Network V) (hconn : IsConnectedNet N)
    (π : V → ℝ) (hπ : IsPMFPWeight π) (hp : 2 ≤ (support π).card) (d : V → V → ℝ)
    (hd : IsDistanceFunction d) (T : Finset V)
    (hT : 2 * ((support π).card : ℝ) ≤ 3 * piSum π T)
    (hsum : 1 / (2 * ((support π).card : ℝ)) ≤ ∑ u ∈ Tᶜ, π u * distFrom N d T u) :
    ∃ U : Finset V, 0 < piSum π U ∧ 0 < piSum π Uᶜ ∧
      weightedRatio N π U ≤ 6 * totalWeight N d := by sorry

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