Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8, p. 802 — partition G so that components meeting 𝒫 have radius ≤ Δ and the cut capacity is at most 4W log p/Δ

Proved
LeightonRao.Product.lemma_8

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

low-diameter-decompositionmulticommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1region-growing

Let GGG be a capacitated network on VVV, let ddd be a distance function with total weight WWW, let π:V→R\pi:V\to\mathbb Rπ:V→R be a node weighting whose support P={u:π(u)≠0}\mathcal P=\{u:\pi(u)\ne0\}P={u:π(u)=0} has p≥2p\ge2p≥2 nodes, and let Δ>0\Delta>0Δ>0. Then VVV can be partitioned into components so that

  1. every component containing a node of P\mathcal PP has radius at most Δ\DeltaΔ (measured by walks inside the component), and
  2. the total capacity of the edges joining different components is at most
4Wlog⁡2pΔ.\frac{4W\log_2 p}{\Delta}.Δ4Wlog2​p​.

This is the region-growing decomposition of Lemma 3 with nnn replaced by the number ppp of weighted nodes; it is the source of the log⁡p\log plogp (hence log⁡k\log klogk) factor in Theorem 7.

Formalization Note The page says "any Δ≥0\Delta\ge0Δ≥0", but the bound divides by Δ\DeltaΔ; as in Lemma 3 we require Δ>0\Delta>0Δ>0. The page allows any ppp, but for p=1p=1p=1 the bound is 000 and the statement fails on a single edge (its weighted endpoint must have a component of small radius, so the edge is cut); we require p≥2p\ge2p≥2, which is the only case Theorem 7 uses. log⁡\loglog is log⁡2\log_2log2​ (footnote 3). The existence of the partition is formalized; its polynomial-time construction is not.

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

theorem lemma_8 {V : Type} [Fintype V] [DecidableEq V] (N : Network V) (d : V → V → ℝ)
    (hd : IsDistanceFunction d) (π : V → ℝ) (hp : 2 ≤ (support π).card) (Δ : ℝ) (hΔ : 0 < Δ) :
    ∃ P : Finpartition (Finset.univ : Finset V),
      (∀ S ∈ P.parts, (∃ x ∈ S, π x ≠ 0) → HasRadiusLE N d S Δ) ∧
      crossCap N P ≤ 4 * 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. 802, Lemma 8
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