Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 639 — 12c(2x)+12c(2θy)≤c(x+θy)≤c(x)+c(θy)\tfrac12 c(2x) + \tfrac12 c(2\theta y) \le c(x+\theta y) \le c(x) + c(\theta y)21​c(2x)+21​c(2θy)≤c(x+θy)≤c(x)+c(θy)

Proved
SendSplit.Existence.concave_sandwich

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. For all preflows x,yx, yx,y and every θ≥0\theta \ge 0θ≥0,

12c(2x)+12c(2θy)  ≤  c(x+θy)  ≤  c(x)+c(θy).\tfrac12 c(2x) + \tfrac12 c(2\theta y) \;\le\; c(x + \theta y) \;\le\; c(x) + c(\theta y).21​c(2x)+21​c(2θy)≤c(x+θy)≤c(x)+c(θy).

The left inequality is concavity of ccc at the midpoint of 2x2x2x and 2θy2\theta y2θy; the right one is subadditivity, which follows from concavity and cij(0)=0c_{ij}(0) = 0cij​(0)=0. With it, c(x+θy)c(x + \theta y)c(x+θy) is bounded below in θ≥0\theta \ge 0θ≥0 if and only if c(θy)c(\theta y)c(θy) is.

Formalization Note The paper states the display for an extreme flow xxx and a simple circulation yyy; it holds for all preflows, and this general form is stated.

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

theorem concave_sandwich {n : ℕ} (G : ArcGraph n) (c : Fin n → Fin n → ℝ → ℝ)
    (hc : IsConcaveArcCost G c) (x y : Fin n → Fin n → ℝ) (hx : IsPreflow G x)
    (hy : IsPreflow G y) (θ : ℝ) (hθ : 0 ≤ θ) :
    (1 / 2 : ℝ) * flowCost G c (fun i j => 2 * x i j)
        + (1 / 2 : ℝ) * flowCost G c (fun i j => 2 * (θ * y i j))
        ≤ flowCost G c (fun i j => x i j + θ * y i j) ∧
      flowCost G c (fun i j => x i j + θ * y i j)
        ≤ flowCost G c x + flowCost G c (fun i j => θ * y i j) := 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