Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (2)′ — with nonnegative circuits, minimum chain costs are the greatest +∞-or-real solution of Bellman's equations, nondecreasing in the arc costs

Proved
SendSplit.DPEquations.bellman_greatest_solution

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

dynamic-programmingp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1shortest-paths

Let GGG be a finite directed graph without loops, with real arc costs akja_{kj}akj​ on its arcs and a destination node ttt from which no arc leaves. Suppose that every simple circuit of GGG has nonnegative cost. For each node kkk let

Cˉk  =  inf⁡{cost of P:P a chain (walk) in G from k to t},\bar C_k \;=\; \inf \{ \text{cost of } P : P \text{ a chain (walk) in } G \text{ from } k \text{ to } t \},Cˉk​=inf{cost of P:P a chain (walk) in G from k to t},

with Cˉk=+∞\bar C_k = +\inftyCˉk​=+∞ if there is no such chain. Then:

  1. Cˉ\bar CCˉ is a +∞+\infty+∞ or real-valued solution of Bellman's equations Cˉt=0\bar C_t = 0Cˉt​=0, Cˉk=min⁡(k,j)[akj+Cˉj]\bar C_k = \min_{(k,j)} [a_{kj} + \bar C_j]Cˉk​=min(k,j)​[akj​+Cˉj​] for k≠tk \neq tk=t;
  2. Cˉk\bar C_kCˉk​ is the minimum cost among all chains from kkk to ttt: either Cˉk=+∞\bar C_k = +\inftyCˉk​=+∞ or some chain from kkk to ttt has cost exactly Cˉk\bar C_kCˉk​;
  3. Cˉ\bar CCˉ is the greatest such solution: Ck≤CˉkC_k \le \bar C_kCk​≤Cˉk​ for every +∞+\infty+∞ or real-valued solution CCC and every kkk;
  4. Cˉ\bar CCˉ is nondecreasing in the arc costs: if G′G'G′ has the same destination, its arcs are among those of GGG, and akj≤akj′a_{kj} \le a'_{kj}akj​≤akj′​ on every arc of G′G'G′, then Cˉk≤Cˉk′\bar C_k \le \bar C'_kCˉk​≤Cˉk′​ for all kkk.

In the proof of Theorem 2 this is applied to GI′G'_IGI′​, where (2) becomes (2)′; item 4 is what transfers BiI′≤BiIB'_{iI} \le B_{iI}BiI′​≤BiI​ to CiI′≤CiIC'_{iI} \le C_{iI}CiI′​≤CiI​.

Formalization Note Arc costs in R∪{+∞}\mathbb{R} \cup \{+\infty\}R∪{+∞} are encoded by real lengths on an arc set: a cost of +∞+\infty+∞ is a missing arc. Hence "a≤a′a \le a'a≤a′" for extended costs becomes: every arc of G′G'G′ is an arc of GGG, with no larger cost. Chains are walks (nodes may repeat), as in the platform definition BertsekasShortestDistance; the paper's "as is well known" is made explicit as items 1–4.

Preamble
import Mathlib
import Definitions.Def_BertsekasSPGraph
import Definitions.Def_SendSplit_DPEquations_Bellman
Formal statement
namespace SendSplit.DPEquations

theorem bellman_greatest_solution {V : Type} [Fintype V] [DecidableEq V]
    (G : BertsekasSPGraph V)
    (hloop : ∀ i, (i, i) ∉ G.arcs) (hout : ∀ j, (G.t, j) ∉ G.arcs)
    (hcirc : ∀ l, IsSimpleCircuit G l → 0 ≤ circuitLength G l) :
    IsBellmanSolution G (fun k => BertsekasShortestDistance G k G.t) ∧
      (∀ k, BertsekasShortestDistance G k G.t = ⊤ ∨
        ∃ l, BertsekasIsWalkFrom G k G.t l ∧
          ((BertsekasWalkLength G l : ℝ) : EReal) = BertsekasShortestDistance G k G.t) ∧
      (∀ C : V → EReal, IsBellmanSolution G C → ∀ k, C k ≤ BertsekasShortestDistance G k G.t) ∧
      (∀ G' : BertsekasSPGraph V, G'.t = G.t → G'.arcs ⊆ G.arcs →
        (∀ p ∈ G'.arcs, G.length p.1 p.2 ≤ G'.length p.1 p.2) →
        ∀ k, BertsekasShortestDistance G k G.t ≤ BertsekasShortestDistance G' k G'.t) := 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. 642, Eq. (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