Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1.2, pp. 789–790 — the max-flow is upper bounded by the min-cut: f·|U||Ū| ≤ C(U, Ū) for a UMFP

Proved
LeightonRao.Uniform.weak_duality

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

multicommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparsest-cutweak-duality

Let a network on nnn nodes carry the uniform multicommodity flow problem (demand one for every unordered pair of nodes). If a concurrent flow of value λ\lambdaλ exists, then for every nonempty proper subset U⊂VU\subset VU⊂V,

λ ∣U∣ ∣Uˉ∣≤C(U,Uˉ).\lambda\,|U|\,|\bar U|\le C(U,\bar U).λ∣U∣∣Uˉ∣≤C(U,Uˉ).

The ∣U∣ ∣Uˉ∣|U|\,|\bar U|∣U∣∣Uˉ∣ commodities separated by the cut each send λ\lambdaλ units across it, and all of that flow uses the capacity of the cut.

Dividing by ∣U∣∣Uˉ∣=D(U,Uˉ)|U||\bar U|=D(U,\bar U)∣U∣∣Uˉ∣=D(U,Uˉ) gives f≤C(U,Uˉ)/D(U,Uˉ)f\le C(U,\bar U)/D(U,\bar U)f≤C(U,Uˉ)/D(U,Uˉ) for every cut, i.e. the max-flow is at most the min-cut — the upper half of Theorem 2.

Formalization Note Each unordered pair is two ordered commodities with demand 12\tfrac1221​ (footnote 2, p. 791).

Preamble
import Definitions.Def_LeightonRao_Uniform_Flow

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

/-- The cut inequality of §1.2 specialized to the ordered-pair encoding of a UMFP. -/
theorem weak_duality {V : Type} [Fintype V] [DecidableEq V]
    (N : Network V) (f : V → V → V → V → ℝ) (lam : ℝ)
    (hf : IsConcurrentFlow N uniformDemand f lam)
    (U : Finset V) (hU : U.Nonempty) (hUc : Uᶜ.Nonempty) :
    lam * ((U.card : ℝ) * (Uᶜ.card : ℝ)) ≤ cutCap N U := 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. 789–790, §1.2 (cut argument for f ≤ C(U, Ū)/D(U, Ū)), with D(U, Ū) = |U||Ū| from §1.5, p. 792
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