Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7, pp. 801–802 — for every product multicommodity flow problem with k commodities, Ω(𝒮/log k) ≤ f ≤ 𝒮

Proved
LeightonRao.Product.theorem_7

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

approximationmax-flow-min-cutmulticommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1product-multicommodity-flowsparsest-cut

There is an absolute constant c>0c>0c>0 with the following property. Let GGG be a connected capacitated network on a finite vertex set VVV, and let π≥0\pi\ge0π≥0 be a node weighting with p≥2p\ge2p≥2 nodes of positive weight, normalized so that ∑u∈Vπ(u)=p\sum_{u\in V}\pi(u)=p∑u∈V​π(u)=p. Consider the product multicommodity flow problem in which every pair {u,v}\{u,v\}{u,v} of nodes has demand π(u)π(v)\pi(u)\pi(v)π(u)π(v); it has k=(p2)k=\binom p2k=(2p​) commodities with nonzero demand. Let fff be its (concurrent) max-flow and

S=min⁡U: π(U)>0, π(Uˉ)>0C(U,Uˉ)π(U)π(Uˉ)\mathcal S=\min_{U:\ \pi(U)>0,\ \pi(\bar U)>0}\frac{C(U,\bar U)}{\pi(U)\pi(\bar U)}S=U: π(U)>0, π(Uˉ)>0min​π(U)π(Uˉ)C(U,Uˉ)​

its min-cut. Then

c Slog⁡2max⁡(k,2)≤f≤S.\frac{c\,\mathcal S}{\log_2\max(k,2)}\le f\le\mathcal S .log2​max(k,2)cS​≤f≤S.

The upper bound is weak duality; the lower bound says the gap between the multicommodity max-flow and min-cut for product demands is at most logarithmic in the number of commodities. The uniform problem (π≡1\pi\equiv1π≡1) is the special case p=np=np=n. The paper's proof gives c=1/36c=1/36c=1/36.

Formalization Note The page's Ω(⋅)\Omega(\cdot)Ω(⋅) is one constant ccc for all instances, so ∃c\exists c∃c precedes every quantifier. For p=2p=2p=2 there is k=1k=1k=1 commodity and log⁡k=0\log k=0logk=0; the bound is stated with log⁡2max⁡(k,2)\log_2\max(k,2)log2​max(k,2), which changes nothing for k≥2k\ge2k≥2. Demands are encoded on ordered pairs, 12π(u)π(v)\tfrac12\pi(u)\pi(v)21​π(u)π(v) each way (footnote 7). The min-cut ranges over cuts with π(U)π(Uˉ)>0\pi(U)\pi(\bar U)>0π(U)π(Uˉ)>0. The normalization ∑π=p\sum\pi=p∑π=p is the paper's "without loss of generality" of §2.3, kept as a hypothesis; connectivity is the standing assumption of p. 789.

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

theorem theorem_7 : ∃ c : ℝ, 0 < c ∧
    ∀ {V : Type} [Fintype V] [DecidableEq V] (N : Network V) (π : V → ℝ),
      IsConnectedNet N → IsPMFPWeight π → 2 ≤ (support π).card →
      c * pmfpMinCut N π / Real.logb 2 ((max (numCommodities π) 2 : ℕ) : ℝ) ≤
          maxFlow N (productDemand π) ∧
        maxFlow N (productDemand π) ≤ pmfpMinCut N π := 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), pp. 801–802, Theorem 7
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