Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 20, p. 808 — a large component with two small radii

Proved
LeightonRao.ShortPaths.corollary_20

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 with n≥2n\ge2n≥2 vertices, total capacity CCC, and uniform sparsest cut value S\mathcal SS. Let ddd be a nonnegative symmetric distance function whose total weight WWW satisfies 0<W≤S/(36log⁡2n)0<W\le\mathcal S/(36\log_2 n)0<W≤S/(36log2​n). Then some component TTT contains at least two thirds of the vertices, and one center reaches each vertex of TTT by a path within TTT with

∣T∣≥2n3,edge radius≤C2Wn2,distance radius≤12n2.|T|\ge\frac{2n}{3},\qquad \text{edge radius}\le\frac{C}{2Wn^2},\qquad \text{distance radius}\le\frac{1}{2n^2}.∣T∣≥32n​,edge radius≤2Wn2C​,distance radius≤2n21​.

This is the large low-radius region needed to connect short paths between arbitrary pairs.

Formalization Note The printed fraction W≤S/36log⁡nW\le\mathcal S/36\log nW≤S/36logn is read as W≤S/(36log⁡n)W\le\mathcal S/(36\log n)W≤S/(36logn), as used in its proof. The additional W>0W>0W>0 is necessary because the printed edge radius divides by WWW.

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

/-- Corollary 20, p. 808. -/
theorem corollary_20 {V : Type} [Fintype V] [DecidableEq V]
    (N : Network V) (hn : 2 ≤ Fintype.card V) (hconn : IsConnectedNet N)
    (d : V → V → ℝ) (hd : IsDistanceFunction d)
    (hW : 0 < totalWeight N d)
    (hWS : totalWeight N d ≤ minCut N /
      (36 * Real.logb 2 (Fintype.card V : ℝ))) :
    ∃ T : Finset V,
      2 * (Fintype.card V : ℝ) ≤ 3 * (T.card : ℝ) ∧
      HasRadii N d T
        (totalCap N / (2 * totalWeight N d * (Fintype.card V : ℝ) ^ 2))
        (1 / (2 * (Fintype.card V : ℝ) ^ 2)) := 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, Corollary 20 and footnote 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