Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1, 6° ⇒ 5° — minimum-cost chains to ν\nuν force nonnegative circuit slopes

Proved
SendSplit.Existence.six_implies_five

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 limiting right-derivatives c˙ij(∞)∈[−∞,∞)\dot c_{ij}(\infty)\in[-\infty,\infty)c˙ij​(∞)∈[−∞,∞) (slopeAtInfty). Suppose condition 6° of Theorem 1 holds: for every set SSS containing exactly one node of each sink strong component of GGG and no other node, and every choice of the arc costs c‾\underline cc​ of the augmented graph G‾\underline GG​ (c˙ij(∞)\dot c_{ij}(\infty)c˙ij​(∞) inside strong components, arbitrary reals bijb_{ij}bij​ on arcs joining distinct strong components and biνb^\nu_ibiν​ on the appended arcs (i,ν)(i,\nu)(i,ν)), there is a minimum-cost chain (of real cost) to ν\nuν from each node of G‾\underline GG​. Then condition 5° 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.

This is the implication 6° ⇒ 5° of Theorem 1, closing the equivalence of the circuit condition 5° and the shortest-chain test 6°.

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 six_implies_five {n : ℕ} (G : ArcGraph n) (c : Fin n → Fin n → ℝ → ℝ)
    (h6 : ∀ S, IsSinkSelection G S → ∀ (b : Fin n → Fin n → ℝ) (bν : Fin n → ℝ),
      ∀ u, HasMinCostChain G S (augCost G c b bν) u) :
    ∀ C, IsSimpleCircuit G C → 0 ≤ ∑ p ∈ C, slopeAtInfty (c p.1 p.2) := 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