Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 (Dynamic-Programming Equations) — C is the greatest +∞-or-real solution of (1) and (2), and the only one if simple circulations cost positively

Proved
SendSplit.DPEquations.theorem2_dp_equations

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

concave-costdynamic-programmingnetwork-flowsp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1

Theorem 2 (Dynamic-Programming Equations). Let (G,r)(G, r)(G,r) be a network whose arc costs cijc_{ij}cij​ are concave on [0,∞)[0,\infty)[0,∞) with cij(0)=0c_{ij}(0) = 0cij​(0)=0, and let C=(CjI)C = (C_{jI})C=(CjI​), j∈Nj \in Nj∈N, ∅⊂I⊆D\emptyset \subset I \subseteq D∅⊂I⊆D, be the array of subproblem minimum costs. If there is a minimum-cost flow for rrr, then CCC is the greatest +∞+\infty+∞ or real-valued solution of (1) and (2) (with BBB defined by (3)):

  1. CCC is a +∞+\infty+∞ or real-valued solution of (1) and (2);
  2. every +∞+\infty+∞ or real-valued solution C′C'C′ of (1) and (2) satisfies
CjI′  ≤  CjIfor all j∈N, ∅⊂I⊆D.C'_{jI} \;\le\; C_{jI} \qquad \text{for all } j \in N,\ \emptyset \subset I \subseteq D .CjI′​≤CjI​for all j∈N, ∅⊂I⊆D.

If moreover each simple circulation has positive cost, then CCC is the only such solution: every +∞+\infty+∞ or real-valued solution C′C'C′ of (1) and (2) equals CCC on all j∈Nj \in Nj∈N and ∅⊂I⊆D\emptyset \subset I \subseteq D∅⊂I⊆D.

In particular the minimum cost of the original problem, CiD=CjDjC_{iD} = C_{jD_j}CiD​=CjDj​​, is determined by the equations. Without the positivity hypothesis uniqueness can fail: if every cij≡0c_{ij} \equiv 0cij​≡0, rI≠0r_I \neq 0rI​=0 for all nonempty proper subsets III of DDD, and GGG is strongly connected, then C=0C = 0C=0 while CiI′=−(∣I∣∧d)C'_{iI} = -(|I| \wedge d)CiI′​=−(∣I∣∧d) also solves (1) and (2) (p. 641).

Formalization Note "+∞ or real-valued" is the condition CjI′≠−∞C'_{jI} \neq -\inftyCjI′​=−∞ on every admissible III; for CCC it is part of the first conclusion. "Greatest" is stated as two claims, that CCC is a solution and that it dominates every solution. "Each simple circulation has positive cost" quantifies over every simple circuit and every flow value θ>0\theta > 0θ>0 on it. Arrays are compared only on ∅⊂I⊆D\emptyset \subset I \subseteq D∅⊂I⊆D.

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

theorem theorem2_dp_equations {n : ℕ} (A : Finset (Fin n × Fin n))
    (c : Fin n → Fin n → ℝ → ℝ) (r : Fin n → ℝ)
    (hA : IsGraph A) (hc : IsConcaveArcCost A c)
    (hmin : ∃ x, IsMinCostFlow A c r x) :
    IsSolution A c r (minCost A c r) ∧
      (∀ C' : Fin n → Finset (Fin n) → EReal, IsSolution A c r C' →
        ∀ j I, IsAdmissible r I → C' j I ≤ minCost A c r j I) ∧
      ((∀ y, IsSimpleCirculation A y → 0 < flowCost A c y) →
        ∀ C' : Fin n → Finset (Fin n) → EReal, IsSolution A c r C' →
          ∀ j I, IsAdmissible r I → C' j I = minCost A c r j I) := 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, Theorem 2
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