Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 19, p. 808 — partition with edge and distance radii

Proved
LeightonRao.ShortPaths.lemma_19

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

graph-partitionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1short-path-flowsparsest-cut

Let GGG be a connected capacitated graph on n≥2n\ge2n≥2 vertices, with total capacity CCC. Let ddd be a nonnegative symmetric edge-length function with positive total weight W=∑eC(e)d(e)W=\sum_e C(e)d(e)W=∑e​C(e)d(e), and let Δ>0\Delta>0Δ>0. There is a partition of VVV into components such that each component has one center and paths within that component witnessing both radii, and

edge radius≤ΔCW,distance radius≤Δ,capacity between components≤4Wlog⁡2nΔ.\text{edge radius}\le\frac{\Delta C}{W},\qquad \text{distance radius}\le\Delta,\qquad \text{capacity between components}\le\frac{4W\log_2 n}{\Delta}.edge radius≤WΔC​,distance radius≤Δ,capacity between components≤Δ4Wlog2​n​.

The partition supplies the simultaneous path-length and distance control used in the short-path result.

Formalization Note The paper's standing connectivity convention is explicit. The added condition W>0W>0W>0 makes its division by WWW meaningful; at W=0W=0W=0, Lean's real division would incorrectly give radius zero. A single internal walk witnesses both radii.

Preamble
import Mathlib
import Definitions.Def_LeightonRao_ShortPaths_Setting
Formal statement
namespace LeightonRao.ShortPaths

/-- Lemma 19, p. 808. The positivity of W makes the paper's radius ΔC/W meaningful. -/
theorem lemma_19 {V : Type} [Fintype V] [DecidableEq V]
    (N : Network V) (hn : 2 ≤ Fintype.card V) (hconn : IsConnectedNet N)
    (d : V → V → ℝ) (hd : IsDistanceFunction d)
    (Δ : ℝ) (hΔ : 0 < Δ) (hW : 0 < totalWeight N d) :
    ∃ P : Finpartition (Finset.univ : Finset V),
      (∀ S ∈ P.parts, HasRadii N d S (Δ * totalCap N / totalWeight N d) Δ) ∧
      crossCap N P ≤ 4 * totalWeight N d *
        Real.logb 2 (Fintype.card V : ℝ) / Δ := by sorry

end LeightonRao.ShortPaths
Source
Leighton and Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM 46 (1999), p. 808, Lemma 19
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