Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 804 — directed weak duality: a concurrent flow of value λ satisfies λ|U||Ū| ≤ C(U, Ū)

Proved
LeightonRao.Directed.weak_duality

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

directed-graphmulticommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1weak-duality

Let GGG be a directed network on VVV and let fff be a concurrent flow of value λ\lambdaλ for the directed uniform multicommodity flow problem (demand 111 from uuu to vvv for every ordered pair u≠vu\ne vu=v). Then for every nonempty proper subset U⊊VU\subsetneq VU⊊V,

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

where C(U,Uˉ)C(U,\bar U)C(U,Uˉ) is the total capacity of the edges directed from UUU to Uˉ\bar UUˉ.

Taking the supremum over flows and the minimum over cuts gives the upper bound f≤Sf\le\mathcal Sf≤S of Theorem 12, which the paper says "follows immediately from the definitions".

Formalization Note Each of the ∣U∣ ∣Uˉ∣|U|\,|\bar U|∣U∣∣Uˉ∣ commodities (u,v)(u,v)(u,v) with u∈Uu\in Uu∈U, v∉Uv\notin Uv∈/U must cross the cut in the forward direction. No connectivity assumption is needed.

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

/-- Leighton–Rao, p. 804: "The fact that f ≤ 𝒮 follows immediately from the definitions." For every
directed concurrent flow of value `lam` for the directed UMFP and every nonempty proper `U`,
`lam · |U| |Ū| ≤ C(U, Ū)`. -/
theorem weak_duality {V : Type} [Fintype V] [DecidableEq V] (N : DiNetwork V)
    (f : V → V → V → V → ℝ) (lam : ℝ) (hf : IsDiConcurrentFlow N diDemand f lam)
    (U : Finset V) (hU : U.Nonempty) (hUc : Uᶜ.Nonempty) :
    lam * ((U.card : ℝ) * (Uᶜ.card : ℝ)) ≤ diCutCap N U := 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, §2.4, sentence after Theorem 12 (f ≤ 𝒮)
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