Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 4, pp. 798–799 — a component of radius 1/2n² with ≥ 2n/3 nodes, or a cut of ratio cost ≤ 36W log n

Proved
LeightonRao.Uniform.corollary_4

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

graph-cutlow-diameter-decompositionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparsest-cut

Let GGG be a network on n≥2n\ge2n≥2 nodes and ddd a distance function with total weight WWW. Then at least one of the following holds:

  1. there is a set TTT of at least 2n/32n/32n/3 nodes with radius at most 1/(2n2)1/(2n^2)1/(2n2);
  2. there is a nonempty proper subset U⊂VU\subset VU⊂V whose ratio cost satisfies
C(U,Uˉ)∣U∣ ∣Uˉ∣≤36 Wlog⁡n.\frac{C(U,\bar U)}{|U|\,|\bar U|}\le 36\,W\log n .∣U∣∣Uˉ∣C(U,Uˉ)​≤36Wlogn.

Corollary 4 applies Lemma 3 with Δ=1/(2n2)\Delta=1/(2n^2)Δ=1/(2n2); it is the case split on which Lemma 6 is built.

Formalization Note The page states case (2) as "ratio cost O(Wlog⁡n)O(W\log n)O(Wlogn)"; the constant 363636 is the one computed in the proof on p. 799 (8Wn2log⁡n/((2n/3)(n/3))=36Wlog⁡n8Wn^2\log n/((2n/3)(n/3))=36W\log n8Wn2logn/((2n/3)(n/3))=36Wlogn). "Find a component" is stated as the existence of a vertex set TTT with the stated size and radius; Lemma 6 uses only these two properties. n≥2n\ge2n≥2 is assumed because a one-node graph has no proper cut. Algorithmic content ("we can find") is not formalized.

Preamble
import Definitions.Def_LeightonRao_Uniform_Dual

set_option autoImplicit false
open scoped BigOperators
Formal statement
namespace LeightonRao.Uniform

/-- Corollary 4, pp. 798–799, with the proof's explicit factor `36`. -/
theorem corollary_4 {V : Type} [Fintype V] [DecidableEq V]
    (N : Network V) (hn : 2 ≤ Fintype.card V)
    (d : V → V → ℝ) (hd : IsDistanceFunction d) :
    (∃ T : Finset V,
      2 * (Fintype.card V : ℝ) ≤ 3 * (T.card : ℝ) ∧
      HasRadiusLE N d T (1 / (2 * (Fintype.card V : ℝ) ^ 2))) ∨
    (∃ U : Finset V, U.Nonempty ∧ Uᶜ.Nonempty ∧
      ratioCost N U ≤ 36 * totalWeight N d * Real.logb 2 (Fintype.card V : ℝ)) := by sorry

end LeightonRao.Uniform
Source
Leighton and Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM 46 (1999), pp. 798–799, Corollary 4 (constant 36 from its proof, p. 799)
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