Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (4) — C_iI ≤ c(x) + c(y) whenever x + y is a flow for the subproblem i → I

Proved
SendSplit.DPEquations.eq4_subadditive

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

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

In the network model with arc costs concave on [0,∞)[0,\infty)[0,∞) and vanishing at 000, let i∈Ni \in Ni∈N and ∅⊂I⊆D\emptyset \subset I \subseteq D∅⊂I⊆D. If xxx and yyy are preflows such that x+yx + yx+y is a flow for the subproblem i→Ii \to Ii→I, then

CiI  ≤  c(x)+c(y).(4)C_{iI} \;\le\; c(x) + c(y). \qquad (4)CiI​≤c(x)+c(y).(4)

It combines CiI≤c(x+y)C_{iI} \le c(x+y)CiI​≤c(x+y) with the subadditivity of the flow cost, and is the common step behind (5) and (6).

Formalization Note The paper states (4) under the standing supposition "CiIC_{iI}CiI​ is finite"; the inequality is true without it, so that supposition is not a hypothesis here.

Preamble
import Mathlib
import Definitions.Def_SendSplit_DPEquations_Network
import Definitions.Def_SendSplit_DPEquations_Subproblem
Formal statement
namespace SendSplit.DPEquations

theorem eq4_subadditive {n : ℕ} (A : Finset (Fin n × Fin n))
    (c : Fin n → Fin n → ℝ → ℝ) (r : Fin n → ℝ)
    (hA : IsGraph A) (hc : IsConcaveArcCost A c)
    (i : Fin n) (I : Finset (Fin n)) (hI : IsAdmissible r I)
    (x y : Fin n → Fin n → ℝ) (hx : IsPreflow A x) (hy : IsPreflow A y)
    (hxy : IsFlow A (subDemand r i I) (x + y)) :
    minCost A c r i I ≤ ((flowCost A c x + flowCost A c y : ℝ) : EReal) := by sorry

end SendSplit.DPEquations
Source
Erickson, Monma, Veinott, Send-and-Split Method for Minimum-Concave-Cost Network Flows, Math. Oper. Res. 12 (1987), p. 641, Eq. (4)
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