Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1 — existence of minimum-cost flows and reduction to nonnegative arc costs

Proved
SendSplit.Existence.theorem1_existence_reduction

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

concave-costconcave-minimizationnetwork-flowsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let G=(N,A)G = (N, A)G=(N,A) be a graph whose arc costs cijc_{ij}cij​ are concave on [0,∞)[0,\infty)[0,∞) with cij(0)=0c_{ij}(0) = 0cij​(0)=0. The following are equivalent.

  1. (1°) There is a minimum-cost flow for some demand vector.
  2. (2°) The null circulation is a minimum-cost circulation.
  3. (3°) For every demand vector rrr: if there is a flow for rrr, there is a minimum-cost flow for rrr that is extreme.
  4. (4°) Each simple circulation yyy has nonnegative flow cost, c(y)≥0c(y) \ge 0c(y)≥0.
  5. (5°) ∑(i,j)∈Cc˙ij(∞)≥0\sum_{(i,j)\in C} \dot c_{ij}(\infty) \ge 0∑(i,j)∈C​c˙ij​(∞)≥0 for every simple circuit of GGG with arc set CCC.
  6. (6°) 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{c}c​ of the augmented graph G‾\underline{G}G​ (c˙ij(∞)\dot c_{ij}(\infty)c˙ij​(∞) inside strong components, arbitrary real numbers on the other arcs, including the appended arcs (i,ν)(i,\nu)(i,ν)), there is a minimum-cost chain to ν\nuν from each node of G‾\underline{G}G​.

Moreover, let rrr be a demand vector for which a flow exists, z=∑iri+z = \sum_i r_i^+z=∑i​ri+​, and let SSS, c‾\underline{c}c​ be as in 6° with

c‾ij z≤cij(z)for every arc (i,j) joining distinct strong components of G.\underline{c}_{ij}\, z \le c_{ij}(z) \quad \text{for every arc } (i,j) \text{ joining distinct strong components of } G.c​ij​z≤cij​(z)for every arc (i,j) joining distinct strong components of G.

Then 1°–6° are also equivalent to

  1. (7°) there is π∈Rn\pi \in \mathbb{R}^nπ∈Rn with cijπ(xij)=cij(xij)−(πi−πj)xij≥0c^\pi_{ij}(x_{ij}) = c_{ij}(x_{ij}) - (\pi_i - \pi_j)x_{ij} \ge 0cijπ​(xij​)=cij​(xij​)−(πi​−πj​)xij​≥0 for every arc (i,j)(i,j)(i,j) of GGG and every flow xxx for rrr;

and when they hold, the minimum chain costs π‾i\underline{\pi}_iπ​i​ in G‾\underline{G}G​ are real and π=π‾\pi = \underline{\pi}π=π​ satisfies 7°.

The theorem characterizes when a minimum-concave-cost uncapacitated flow problem has an optimum by a condition (4° or 5°) that does not involve the demands, gives a shortest-chain test for it (6°), and produces node potentials that turn the problem into an equivalent one with nonnegative arc costs (7°), which the send-and-split method then solves.

Formalization Note The equivalence of 1°–6° is List.TFAE. "Minimum-cost" always means attained: a feasible object whose cost is ≤\le≤ that of every feasible object. A minimum-cost chain must have real cost (see the AugmentedGraph definition). Chains are walks, not simple paths. The paper states the 7° part only with "rrr is a demand vector"; this formalization adds the hypothesis that a flow for rrr exists, which the paper assumes in the surrounding text ("if there is a flow"): without it 7° holds vacuously while 4° may fail (two nodes, arcs (0,1),(1,0)(0,1),(1,0)(0,1),(1,0), cij(y)=−yc_{ij}(y) = -ycij​(y)=−y, r=(1,1)r = (1,1)r=(1,1)). The inequality π‾i−π‾j≤⋯\underline{\pi}_i - \underline{\pi}_j \le \cdotsπ​i​−π​j​≤⋯ uses the real values of π‾\underline{\pi}π​ (EReal.toReal), which are exact because π‾\underline{\pi}π​ is shown real.

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

theorem theorem1_existence_reduction {n : ℕ} (G : ArcGraph n) (c : Fin n → Fin n → ℝ → ℝ)
    (hc : IsConcaveArcCost G c) :
    List.TFAE
        [ ∃ (r : Fin n → ℝ) (x : Fin n → Fin n → ℝ), IsMinCostFlow G c r x,
          IsMinCostFlow G c (fun _ => 0) (fun _ _ => 0),
          ∀ r : Fin n → ℝ, (∃ x, IsFlow G r x) →
            ∃ x, IsMinCostFlow G c r x ∧ IsExtremeFlow G r x,
          ∀ y, IsSimpleCirculation G y → 0 ≤ flowCost G c y,
          ∀ C, IsSimpleCircuit G C → 0 ≤ ∑ p ∈ C, slopeAtInfty (c p.1 p.2),
          ∀ S, IsSinkSelection G S → ∀ (b : Fin n → Fin n → ℝ) (bν : Fin n → ℝ),
            ∀ u, HasMinCostChain G S (augCost G c b bν) u ] ∧
      ∀ (r : Fin n → ℝ) (S : Finset (Fin n)) (b : Fin n → Fin n → ℝ) (bν : Fin n → ℝ),
        IsSinkSelection G S → (∃ x, IsFlow G r x) →
        (∀ p ∈ G.A, ¬ SameComponent G p.1 p.2 →
          b p.1 p.2 * (∑ i, max (r i) 0) ≤ c p.1 p.2 (∑ i, max (r i) 0)) →
        (((∃ (r' : Fin n → ℝ) (x : Fin n → Fin n → ℝ), IsMinCostFlow G c r' x) ↔
            ∃ π : Fin n → ℝ, ∀ p ∈ G.A, ∀ x, IsFlow G r x →
              0 ≤ reducedArcCost c π p.1 p.2 (x p.1 p.2)) ∧
          ((∃ (r' : Fin n → ℝ) (x : Fin n → Fin n → ℝ), IsMinCostFlow G c r' x) →
            (∀ i, minChainCost G S (augCost G c b bν) i ≠ ⊥ ∧
              minChainCost G S (augCost G c b bν) i ≠ ⊤) ∧
            ∀ p ∈ G.A, ∀ x, IsFlow G r x →
              0 ≤ reducedArcCost c (fun i => (minChainCost G S (augCost G c b bν) i).toReal)
                p.1 p.2 (x 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
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