Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, 5° ⇒ 6° — nonnegative circuit slopes give minimum-cost chains to ν\nuν in the augmented graph

Proved
SendSplit.Existence.five_implies_six

by tianyipeng · Nov 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

concave-costnetwork-flowsshortest-paths

Let G=(N,A)G=(N,A)G=(N,A) be a graph with arc cost functions cijc_{ij}cij​, and write c˙ij(∞)=lim⁡t→∞c˙ij(t)∈[−∞,∞)\dot c_{ij}(\infty)=\lim_{t\to\infty}\dot c_{ij}(t)\in[-\infty,\infty)c˙ij​(∞)=limt→∞​c˙ij​(t)∈[−∞,∞) for the limiting right-derivative (slopeAtInfty). Suppose condition 5° of Theorem 1 holds:

∑(i,j)∈Cc˙ij(∞) ≥ 0for every simple circuit of G with arc set C.\sum_{(i,j)\in C}\dot c_{ij}(\infty)\ \ge\ 0\quad\text{for every simple circuit of } G \text{ with arc set } C.(i,j)∈C∑​c˙ij​(∞) ≥ 0for every simple circuit of G with arc set C.

Let SSS contain exactly one node of each sink strong component of GGG and no other node, and form the augmented graph G‾\underline GG​ by appending a node ν\nuν and arcs (i,ν)(i,\nu)(i,ν), i∈Si\in Si∈S. Give G‾\underline GG​ the arc costs c‾\underline cc​: c‾ij=c˙ij(∞)\underline c_{ij}=\dot c_{ij}(\infty)c​ij​=c˙ij​(∞) for arcs inside a strong component of GGG, an arbitrary real bijb_{ij}bij​ for arcs of GGG joining distinct strong components, and an arbitrary real biνb^\nu_ibiν​ for the appended arcs (i,ν)(i,\nu)(i,ν). Then from every node uuu of G‾\underline GG​ (including ν\nuν itself) there is a minimum-cost chain to ν\nuν: a chain (directed walk) of real cost whose cost is at most that of every chain from uuu to ν\nuν.

This is the implication 5° ⇒ 6° of Theorem 1: the circuit condition 5°, which does not involve demands, yields the shortest-chain test 6° and the potentials π‾\underline\piπ​ used for 7°.

Formalization Note. Chains are walks (lists of nodes of G‾\underline GG​, none standing for ν\nuν) and may repeat nodes; costs live in [−∞,∞][-\infty,\infty][−∞,∞] (EReal); "minimum-cost" means attained, with real cost.

Preamble
import Mathlib
import Definitions.Def_SendSplit_Existence_Network
import Definitions.Def_SendSplit_Existence_AugmentedGraph
Formal statement
namespace SendSplit.Existence

theorem five_implies_six {n : ℕ} (G : ArcGraph n) (c : Fin n → Fin n → ℝ → ℝ)
    (h5 : ∀ C, IsSimpleCircuit G C → 0 ≤ ∑ p ∈ C, slopeAtInfty (c p.1 p.2))
    (S : Finset (Fin n)) (hS : IsSinkSelection G S) (b : Fin n → Fin n → ℝ) (bν : Fin n → ℝ)
    (u : Option (Fin n)) :
    HasMinCostChain G S (augCost G c b bν) u := by sorry

end SendSplit.Existence
Source
Erickson, Monma, Veinott, Send-and-Split Method for Minimum-Concave-Cost Network Flows, Math. Oper. Res. 12 (1987), p. 639, Theorem 1 (the equivalence of conditions 5° and 6°)

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