Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 16, p. 807 — a distance function satisfying the directed distance constraint yields a directed cut of ratio cost O(W log n)

Proved
LeightonRao.Directed.lemma_16

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

approximationdirected-graphp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparsest-cut

Let GGG be a strongly connected directed network on n≥2n\ge2n≥2 nodes and d≥0d\ge0d≥0 a distance function with total weight WWW that satisfies the directed distance constraint ∑(u,v)∈V2d(u,v)≥1\sum_{(u,v)\in V^2}d(u,v)\ge1∑(u,v)∈V2​d(u,v)≥1. Then there is a nonempty proper U⊊VU\subsetneq VU⊊V with

C(U,Uˉ)∣U∣ ∣Uˉ∣≤11525 Wlog⁡n,\frac{C(U,\bar U)}{|U|\,|\bar U|}\le\frac{1152}{5}\,W\log n,∣U∣∣Uˉ∣C(U,Uˉ)​≤51152​Wlogn,

log⁡\loglog to base 222.

Applied to an optimal dual solution (W=fW=fW=f), it gives S=O(flog⁡n)\mathcal S=O(f\log n)S=O(flogn), the lower bound of Theorem 12.

Formalization Note The paper states "ratio cost O(Wlog⁡n)O(W\log n)O(Wlogn)". The constant 1152/51152/51152/5 is Corollary 14's bound 8Wlog⁡n/(Δ(n/6)(5n/6))8W\log n/(\Delta(n/6)(5n/6))8Wlogn/(Δ(n/6)(5n/6)) at Δ=1/(4n2)\Delta=1/(4n^2)Δ=1/(4n2); it dominates Lemma 15's 12W12W12W because log⁡n≥1\log n\ge1logn≥1 for n≥2n\ge2n≥2.

Preamble
import Mathlib
import Definitions.Def_LeightonRao_Directed_Setting
Formal statement
namespace LeightonRao.Directed

/-- Leighton–Rao, Lemma 16, p. 807. A nonnegative distance function of total weight `W` satisfying
the directed distance constraint yields a directed cut of ratio cost at most `(1152/5) W log₂ n`
(Corollary 14's bound; it dominates Lemma 15's `12 W` since `log₂ n ≥ 1`). -/
theorem lemma_16 {V : Type} [Fintype V] [DecidableEq V] (N : DiNetwork V)
    (hn : 2 ≤ Fintype.card V) (hconn : IsStronglyConnectedNet N)
    (d : V → V → ℝ) (hd : ∀ u v, 0 ≤ d u v) (hW : SatisfiesDiConstraint N d) :
    ∃ U : Finset V, U.Nonempty ∧ Uᶜ.Nonempty ∧
      diRatio N U ≤ (1152 / 5) * diTotalWeight N d * Real.logb 2 (Fintype.card V) := by sorry

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