Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 12, p. 804 — for every directed uniform multicommodity flow problem, Ω(𝒮/log n) ≤ f ≤ 𝒮

Proved
LeightonRao.Directed.theorem_12

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

approximationdirected-graphmax-flow-min-cutmulticommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparsest-cut

There is an absolute constant c>0c>0c>0 such that for every directed network GGG on n≥2n\ge2n≥2 nodes, the max-flow fff and the min-cut S\mathcal SS of its directed uniform multicommodity flow problem (demand 111 from uuu to vvv for every ordered pair u≠vu\ne vu=v) satisfy

c Slog⁡n≤f≤S,c\,\frac{\mathcal S}{\log n}\le f\le\mathcal S,clognS​≤f≤S,

log⁡\loglog to base 222. Here S=min⁡∅≠U⊊VC(U,Uˉ)/(∣U∣∣Uˉ∣)\mathcal S=\min_{\emptyset\ne U\subsetneq V}C(U,\bar U)/(|U||\bar U|)S=min∅=U⊊V​C(U,Uˉ)/(∣U∣∣Uˉ∣), where C(U,Uˉ)C(U,\bar U)C(U,Uˉ) counts only the edges directed from UUU to Uˉ\bar UUˉ.

This is the directed max-flow min-cut theorem of Leighton and Rao: the directed min-cut approximates the directed uniform concurrent flow within an O(log⁡n)O(\log n)O(logn) factor, which underlies their approximation algorithms for directed cut problems such as minimum feedback arc set.

Formalization Note The Ω\OmegaΩ is an absolute constant, quantified before the network. The paper's standing connectivity assumption is not imposed: without strong connectivity some proper cut has capacity 000, so S=0=f\mathcal S=0=fS=0=f and the statement holds trivially, hence dropping it only strengthens the theorem. n≥2n\ge2n≥2 is required since no cut exists otherwise.

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

/-- Leighton–Rao, Theorem 12, p. 804. There is an absolute constant `c > 0` such that for every
directed UMFP with `n ≥ 2` nodes, `c · 𝒮 / log₂ n ≤ f ≤ 𝒮`, where `f` is the max-flow and `𝒮` the
directed min-cut. -/
theorem theorem_12 :
    ∃ c : ℝ, 0 < c ∧ ∀ {V : Type} [Fintype V] [DecidableEq V] (N : DiNetwork V),
      2 ≤ Fintype.card V →
      c * diMinCut N / Real.logb 2 (Fintype.card V) ≤ diMaxFlow N diDemand ∧
      diMaxFlow N diDemand ≤ diMinCut N := 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. 804, Theorem 12 (proof p. 807)
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