Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 1779 — with all α_r ≥ 0 and every commodity chain of length Σ α_r a_rs ≥ 1, the arc-chain basis is optimal

Proved
FordFulkerson58.ArcChain.basis_optimal_of_chainLength_ge_one

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

linear-programmingmulticommodity-flowoptimalityp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1simplex-method

Consider the arc-chain program (2)–(3) of a multi-commodity network. Let BBB be a basis (columns s1,…,sms_1,\dots,s_ms1​,…,sm​ of [A∣I][A\mid I][A∣I] with invertible submatrix), zzz its basic feasible solution, and α1,…,αm\alpha_1,\dots,\alpha_mα1​,…,αm​ its simplex multipliers (4). Interpret αr\alpha_rαr​ as the length of arc ArA_rAr​. Suppose that

  1. αr≥0\alpha_r \ge 0αr​≥0 for every arc rrr, and
  2. every commodity chain CsC_sCs​ has length at least one: ∑r=1mαrars≥1\sum_{r=1}^{m} \alpha_r a_{rs} \ge 1∑r=1m​αr​ars​≥1 for all sss.

Then the basis is optimal: for every feasible solution (x,xn+1,…,xn+m)(x, x_{n+1},\dots,x_{n+m})(x,xn+1​,…,xn+m​) of (3),

∑s=1nxs  ≤  ∑s=1nzs.\sum_{s=1}^{n} x_s \;\le\; \sum_{s=1}^{n} z_s .s=1∑n​xs​≤s=1∑n​zs​.

This is the optimality half of the pricing test of §3: once no chain is shorter than its objective coefficient 111, no column can enter and the simplex computation stops.

Formalization Note Optimality is stated against every feasible (x,y)(x, y)(x,y), with no supremum. The LP fact behind it is the simplex optimality criterion / weak duality, available as the referenced items MatousekLP.Simplex.optimality_criterion and MatousekLP.Duality.weak_duality.

Preamble
import Mathlib
import Definitions.Def_FordFulkerson58_ArcChain_Network
import Definitions.Def_FordFulkerson58_ArcChain_LP
import Definitions.Def_FordFulkerson58_ArcChain_Labeling
Formal statement
namespace FordFulkerson58.ArcChain

/-- §3, p. 1779: if the simplex multipliers of a feasible basis are non-negative and every commodity
chain has length `∑_r α_r a_rs ≥ 1` (the arc lengths being the multipliers), the basis is optimal: no
feasible flow has a larger total than the basic solution. -/
theorem basis_optimal_of_chainLength_ge_one {V E ι : Type*} [Fintype V] [DecidableEq V] [Fintype E] [DecidableEq E]
    [Fintype ι] [DecidableEq ι] (N : Network V E ι)
    (β : E → Col N ⊕ E) (hβ : IsUnit (basisMatrix N β).det)
    (z : Col N ⊕ E → ℝ) (hz : IsBasicFeasibleSolution N β z)
    (α : E → ℝ) (h4 : IsSimplexMultiplier N β α)
    (hα : ∀ r, 0 ≤ α r) (hlen : ∀ s : Col N, (1 : ℝ) ≤ chainLength α s.1.2) :
    ∀ (x : Col N → ℝ) (y : E → ℝ), Feasible N x y → ∑ s, x s ≤ ∑ s, z (Sum.inl s) := by sorry

end FordFulkerson58.ArcChain
Source
Ford and Fulkerson, A suggested computation for maximal multi-commodity network flows, Management Sci. 50(12S) (2004), p. 1779, §3 ("If each of the chains thus selected has length at least one, the basis is optimal")
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