Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 1, p. 639 — the flow in an arc joining distinct strong components is at most z=∑iri+z = \sum_i r_i^+z=∑i​ri+​

Proved
SendSplit.Existence.flow_le_sum_pos_demand

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

graph-theorynetwork-flowsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Let GGG be a graph, rrr a demand vector and xxx a flow for rrr. For every arc (i,j)(i,j)(i,j) of GGG joining distinct strong components,

xij  ≤  z=∑iri+,ri+=max⁡(ri,0).x_{ij} \;\le\; z = \sum_i r_i^+, \qquad r_i^+ = \max(r_i, 0).xij​≤z=i∑​ri+​,ri+​=max(ri​,0).

This bound is what makes the hypothesis c‾ijz≤cij(z)\underline{c}_{ij} z \le c_{ij}(z)c​ij​z≤cij​(z) of Theorem 1 enough to bound cij(xij)c_{ij}(x_{ij})cij​(xij​) below by c‾ijxij\underline{c}_{ij} x_{ij}c​ij​xij​ on such arcs.

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

theorem flow_le_sum_pos_demand {n : ℕ} (G : ArcGraph n) (r : Fin n → ℝ)
    (x : Fin n → Fin n → ℝ) (hx : IsFlow G r x) (p : Fin n × Fin n) (hp : p ∈ G.A)
    (hpC : ¬ SameComponent G p.1 p.2) :
    x p.1 p.2 ≤ ∑ i, max (r i) 0 := 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