Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 639 — c(θy)≥0c(\theta y) \ge 0c(θy)≥0 for all θ≥0\theta \ge 0θ≥0 iff ∑(i,j)∈Cc˙ij(∞)≥0\sum_{(i,j)\in C}\dot c_{ij}(\infty) \ge 0∑(i,j)∈C​c˙ij​(∞)≥0

Proved
SendSplit.Existence.simpleCirculation_cost_nonneg_iff

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

concave-costnetwork-flowsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a graph with arc costs cijc_{ij}cij​ concave on [0,∞)[0,\infty)[0,∞) and cij(0)=0c_{ij}(0) = 0cij​(0)=0, and let yyy be a simple circulation whose induced subgraph is the simple circuit with arc set CCC. Then

c(θy)≥0  for all θ≥0⟺∑(i,j)∈Cc˙ij(∞)≥0,c(\theta y) \ge 0 \ \text{ for all } \theta \ge 0 \quad\Longleftrightarrow\quad \sum_{(i,j)\in C} \dot c_{ij}(\infty) \ge 0,c(θy)≥0  for all θ≥0⟺(i,j)∈C∑​c˙ij​(∞)≥0,

where the right-hand sum is taken in [−∞,∞)[-\infty, \infty)[−∞,∞).

This is the circuit-by-circuit form of the equivalence of 4° and 5° in Theorem 1.

Formalization Note c˙ij(∞)\dot c_{ij}(\infty)c˙ij​(∞) is slopeAtInfty (c i j) (see the AugmentedGraph definition), an EReal; the sum is an EReal sum of values that are never +∞+\infty+∞.

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

theorem simpleCirculation_cost_nonneg_iff {n : ℕ} (G : ArcGraph n) (c : Fin n → Fin n → ℝ → ℝ)
    (hc : IsConcaveArcCost G c) (y : Fin n → Fin n → ℝ) (hy : IsSimpleCirculation G y) :
    (∀ θ : ℝ, 0 ≤ θ → 0 ≤ flowCost G c (fun i j => θ * y i j)) ↔
      0 ≤ ∑ p ∈ support G y, 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, proof of 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