Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (2)′ — with positive circuits, Bellman's equations have a unique +∞-or-real solution

Proved
SendSplit.DPEquations.bellman_unique_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 positive cost. Then every +∞+\infty+∞ or real-valued solution CCC of Bellman's equations

Ct=0,Ck=min⁡(k,j)[akj+Cj](k≠t)C_t = 0, \qquad C_k = \min_{(k,j)} \bigl[ a_{kj} + C_j \bigr] \quad (k \neq t)Ct​=0,Ck​=(k,j)min​[akj​+Cj​](k=t)

equals the vector of minimum chain costs: Ck=Cˉk=inf⁡{cost of P:P a chain from k to t}C_k = \bar C_k = \inf \{ \text{cost of } P : P \text{ a chain from } k \text{ to } t \}Ck​=Cˉk​=inf{cost of P:P a chain from k to t} for every node kkk (with +∞+\infty+∞ when no chain exists).

In the proof of Theorem 2 this gives uniqueness of the solution of (2)′ for each fixed III, and hence, by induction on ∣I∣|I|∣I∣, uniqueness in Theorem 2.

Formalization Note Same encoding as the preceding milestone: missing arcs are cost +∞+\infty+∞, chains are walks.

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

theorem bellman_unique_solution {V : Type} [Fintype V] [DecidableEq V]
    (G : BertsekasSPGraph V)
    (hloop : ∀ i, (i, i) ∉ G.arcs) (hout : ∀ j, (G.t, j) ∉ G.arcs)
    (hpos : ∀ l, IsSimpleCircuit G l → 0 < circuitLength G l) :
    ∀ C : V → EReal, IsBellmanSolution G C → ∀ k, C k = 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, Section 3, proof of 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