Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2, p. 638 — extension of Hirsch–Hoffman: c attains its minimum on the flows iff it is bounded below on each extreme ray; then at an extreme flow

Proved
SendSplit.Existence.hirsch_hoffman_extension

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

concave-costconcave-minimizationnetwork-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 rrr be a demand vector for which the set of flows is nonempty. Then the flow cost ccc attains its minimum on the set of flows for rrr if and only if, for every extreme flow xxx for rrr and every simple circulation yyy, the function

θ↦c(x+θy),θ≥0,\theta \mapsto c(x + \theta y), \qquad \theta \ge 0,θ↦c(x+θy),θ≥0,

is bounded below. Moreover, if a minimum-cost flow for rrr exists, then some extreme flow is a minimum-cost flow for rrr.

The extreme flows are the extreme points and the simple circulations the extreme directions of recession of the polyhedron of flows, so this is the extension of the Hirsch–Hoffman theorem on concave minimization over polyhedra that the paper invokes. It is the step that turns 4° into 1° and 3°.

Formalization Note "Bounded below on each half-line" is the explicit statement ∃M ∀θ≥0, M≤c(x+θy)\exists M\ \forall \theta \ge 0,\ M \le c(x + \theta y)∃M ∀θ≥0, M≤c(x+θy); "assumes its minimum" is the existence of a minimum-cost flow.

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

theorem hirsch_hoffman_extension {n : ℕ} (G : ArcGraph n) (c : Fin n → Fin n → ℝ → ℝ)
    (hc : IsConcaveArcCost G c) (r : Fin n → ℝ) (hflow : ∃ x, IsFlow G r x) :
    ((∃ x, IsMinCostFlow G c r x) ↔
      ∀ x, IsExtremeFlow G r x → ∀ y, IsSimpleCirculation G y →
        ∃ M : ℝ, ∀ θ : ℝ, 0 ≤ θ → M ≤ flowCost G c (fun i j => x i j + θ * y i j)) ∧
    ((∃ x, IsMinCostFlow G c r x) → ∃ x, IsMinCostFlow G c r x ∧ IsExtremeFlow G r x) := 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. 638, Section 2 (citing Hirsch–Hoffman 1961 and Rockafellar 1970, pp. 61, 343)
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