Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1.2, pp. 789–790 — PMFP weak duality: every concurrent flow value f satisfies f·π(U)π(Ū) ≤ C(U, Ū)

Proved
LeightonRao.Product.weak_duality

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

max-flow-min-cutmulticommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1weak-duality

Let GGG be a capacitated network on a finite vertex set VVV, let π:V→R\pi:V\to\mathbb Rπ:V→R be a node weighting, and consider the product multicommodity flow problem in which each ordered pair u≠vu\neq vu=v is a commodity with demand 12π(u)π(v)\tfrac12\pi(u)\pi(v)21​π(u)π(v). If a concurrent flow of value λ\lambdaλ exists, then for every cut ⟨U,Uˉ⟩\langle U,\bar U\rangle⟨U,Uˉ⟩ with π(U)>0\pi(U)>0π(U)>0 and π(Uˉ)>0\pi(\bar U)>0π(Uˉ)>0,

λ π(U) π(Uˉ)≤C(U,Uˉ).\lambda\,\pi(U)\,\pi(\bar U)\le C(U,\bar U).λπ(U)π(Uˉ)≤C(U,Uˉ).

The demand separated by UUU is D(U,Uˉ)=π(U)π(Uˉ)D(U,\bar U)=\pi(U)\pi(\bar U)D(U,Uˉ)=π(U)π(Uˉ), so this is the paper's observation that f≤C(U,Uˉ)/D(U,Uˉ)f\le C(U,\bar U)/D(U,\bar U)f≤C(U,Uˉ)/D(U,Uˉ), i.e. the max-flow is at most the min-cut. It gives the upper half f≤Sf\le\mathcal Sf≤S of Theorem 7.

Formalization Note The paper states the observation for an arbitrary multicommodity flow problem; here it is specialized to the product demands of §2.3.

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

theorem weak_duality {V : Type} [Fintype V] [DecidableEq V] (N : Network V) (π : V → ℝ)
    (f : V → V → V → V → ℝ) (lam : ℝ) (hf : IsConcurrentFlow N (productDemand π) f lam)
    (U : Finset V) (hU : 0 < piSum π U) (hUc : 0 < piSum π Uᶜ) :
    lam * (piSum π U * piSum π Uᶜ) ≤ cutCap N U := 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. 789–790, §1.2, paragraph after the min-cut definition (max-flow upper bounded by min-cut), applied to the PMFP of §2.3, p. 801
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