Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 11, p. 803 — a distance function meeting the weighted distance constraint yields a cut of weighted ratio cost ≤ 36W log p

Proved
LeightonRao.Product.lemma_11

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

approximationmulticommodity-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 satisfying the weighted distance constraint

∑{u,v}∈P2π(u)π(v) d(u,v)≥1.\sum_{\{u,v\}\in\mathcal P^2}\pi(u)\pi(v)\,d(u,v)\ge1.{u,v}∈P2∑​π(u)π(v)d(u,v)≥1.

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

C(U,Uˉ)π(U)π(Uˉ)≤36 Wlog⁡2p.\frac{C(U,\bar U)}{\pi(U)\pi(\bar U)}\le 36\,W\log_2 p .π(U)π(Uˉ)C(U,Uˉ)​≤36Wlog2​p.

Combined with LP duality (W=fW=fW=f for an optimal distance function) this gives S≤36flog⁡p\mathcal S\le 36 f\log pS≤36flogp, the lower half of Theorem 7.

Formalization Note The page states O(Wlog⁡p)O(W\log p)O(Wlogp). The constant 363636 bounds both branches of the proof: Corollary 9's 36Wlog⁡p36W\log p36Wlogp and Lemma 10's 6W6W6W, since log⁡2p≥1\log_2 p\ge1log2​p≥1 for p≥2p\ge2p≥2. The normalization ∑π=p\sum\pi=p∑π=p is the standing assumption of §2.3; connectivity makes graph distances meaningful.

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

theorem lemma_11 {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) (hdc : SatisfiesPMFPConstraint N π d) :
    ∃ U : Finset V, 0 < piSum π U ∧ 0 < piSum π Uᶜ ∧
      weightedRatio N π U ≤ 36 * totalWeight N d * Real.logb 2 ((support π).card : ℝ) := 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. 803, Lemma 11
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