Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 9, p. 802 — either a component T of radius 1/2p² with π(T) ≥ 2p/3, or a cut of weighted ratio cost ≤ 36W log p

Proved
LeightonRao.Product.corollary_9

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

multicommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1region-growingsparsest-cut

Let GGG be a capacitated network on VVV, let π≥0\pi\ge0π≥0 be a PMFP node weighting with p=∣P∣≥2p=|\mathcal P|\ge2p=∣P∣≥2 nodes of positive weight and ∑uπ(u)=p\sum_u\pi(u)=p∑u​π(u)=p, and let ddd be a distance function with total weight WWW. Then at least one of the following holds:

  1. there is a vertex set TTT of radius at most 1/(2p2)1/(2p^2)1/(2p2) with π(T)≥2p/3\pi(T)\ge 2p/3π(T)≥2p/3;
  2. 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 weighted ratio cost
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.

Either outcome feeds Lemma 11: the cut finishes the argument directly, and the heavy small-radius set TTT is the input of Lemma 10.

Formalization Note The page states the bound as O(Wlog⁡p)O(W\log p)O(Wlogp). The constant 363636 is the one obtained by the computation in the proof of Corollary 4 (p. 799), to which the proof of Corollary 9 refers: Δ=1/(2p2)\Delta=1/(2p^2)Δ=1/(2p2) in Lemma 8 gives cross capacity 8Wp2log⁡p8Wp^2\log p8Wp2logp, and two sides of weight at least p/3p/3p/3 each give π(U)π(Uˉ)≥2p2/9\pi(U)\pi(\bar U)\ge 2p^2/9π(U)π(Uˉ)≥2p2/9. "Find a component" is formalized as the existence of a vertex set with the stated radius and weight. The normalization ∑π=p\sum\pi=p∑π=p is the standing assumption of §2.3.

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

theorem corollary_9 {V : Type} [Fintype V] [DecidableEq V] (N : Network V) (π : V → ℝ)
    (hπ : IsPMFPWeight π) (hp : 2 ≤ (support π).card) (d : V → V → ℝ)
    (hd : IsDistanceFunction d) :
    (∃ T : Finset V, 2 * ((support π).card : ℝ) ≤ 3 * piSum π T ∧
        HasRadiusLE N d T (1 / (2 * ((support π).card : ℝ) ^ 2))) ∨
    (∃ 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. 802, Corollary 9 (constant from the proof of Corollary 4, 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