Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.3, p. 802 with §2.2, p. 796 — PMFP LP duality: the minimum total weight of a distance function meeting the weighted distance constraint equals the max-flow

Proved
LeightonRao.Product.lp_duality

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

distance-functionlp-dualitymulticommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a connected capacitated network on VVV, and let π≥0\pi\ge0π≥0 be a PMFP node weighting with ∑uπ(u)=p\sum_u\pi(u)=p∑u​π(u)=p and at least p≥2p\ge2p≥2 nodes of positive weight. Let fff be the max-flow of the product multicommodity flow problem. Then

  1. every distance function ddd satisfying the weighted distance constraint ∑{u,v}∈P2π(u)π(v)d(u,v)≥1\sum_{\{u,v\}\in\mathcal P^2}\pi(u)\pi(v)d(u,v)\ge1∑{u,v}∈P2​π(u)π(v)d(u,v)≥1 has total weight W=∑eC(e)d(e)≥fW=\sum_{e}C(e)d(e)\ge fW=∑e​C(e)d(e)≥f, and
  2. some distance function satisfying this constraint has total weight exactly
W=f.W=f.W=f.

This is the linear-programming duality between the concurrent flow problem and its distance dual, which the paper cites (Chvátal, Iri, Shahrokhi–Matula) and uses with the PMFP distance constraint of p. 802. It is the step "W=fW=fW=f" by which the cut bounds of Lemma 11 turn into the flow bound of Theorem 7.

Formalization Note The paper does not prove this; it invokes LP duality (§2.2, p. 796). The hypotheses p≥2p\ge2p≥2 and connectivity make the max-flow finite and positive. The normalization ∑π=p\sum\pi=p∑π=p is the standing assumption of §2.3.

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

theorem lp_duality {V : Type} [Fintype V] [DecidableEq V] (N : Network V) (hconn : IsConnectedNet N)
    (π : V → ℝ) (hπ : IsPMFPWeight π) (hp : 2 ≤ (support π).card) :
    (∀ d : V → V → ℝ, IsDistanceFunction d → SatisfiesPMFPConstraint N π d →
        maxFlow N (productDemand π) ≤ totalWeight N d) ∧
    (∃ d : V → V → ℝ, IsDistanceFunction d ∧ SatisfiesPMFPConstraint N π d ∧
        totalWeight N d = maxFlow N (productDemand π)) := 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), p. 802, §2.3, the weighted distance constraint, with p. 796, §2.2, Eq. (4) and the LP duality sentence
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