Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 1780, the labeling process — with lengths ≥ 0, every run of improving-arc replacements from the initial labels is finite

Proved
FordFulkerson58.ArcChain.labeling_terminates

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

labeling-algorithmp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1shortest-chaintermination

Let NNN be a network whose arc lengths lel_ele​ are all non-negative, and let SSS be a set of nodes. Start the labeling process with πi=0\pi_i = 0πi​=0 on SSS and πi=∞\pi_i = \inftyπi​=∞ elsewhere, and repeatedly replace πj\pi_jπj​ by πi+le\pi_i + l_eπi​+le​ whenever an arc eee traversable from PiP_iPi​ to PjP_jPj​ satisfies πi+le<πj\pi_i + l_e < \pi_jπi​+le​<πj​. Then the process cannot go on forever: there is no infinite sequence of labelings

π(0)=initial labels,π(0)→π(1)→π(2)→⋯\pi^{(0)} = \text{initial labels},\quad \pi^{(0)} \to \pi^{(1)} \to \pi^{(2)} \to \cdotsπ(0)=initial labels,π(0)→π(1)→π(2)→⋯

in which each π(t+1)\pi^{(t+1)}π(t+1) arises from π(t)\pi^{(t)}π(t) by one such replacement.

This is the page's "Eventually no such arcs can be found": whatever order the arcs are scanned in, the process stops with a terminal labeling.

Formalization Note Lengths may be 000; no strict positivity is assumed. The statement covers every run, not one chosen run.

Preamble
import Mathlib
import Definitions.Def_FordFulkerson58_ArcChain_Network
import Definitions.Def_FordFulkerson58_ArcChain_Labeling
Formal statement
namespace FordFulkerson58.ArcChain

/-- §3, p. 1780, the labeling process: with non-negative arc lengths, every run of the labeling
process from the initial labels is finite — there is no infinite sequence of improving replacements. -/
theorem labeling_terminates {V E ι : Type*} [Fintype V] [DecidableEq V] [Fintype E] [DecidableEq E]
    [Fintype ι] [DecidableEq ι] (N : Network V E ι)
    (S : Finset V) (l : E → ℝ) (hl : ∀ e, 0 ≤ l e) :
    ¬ ∃ f : ℕ → V → WithTop ℝ, f 0 = initLabel S ∧ ∀ i, RelaxStep N l (f i) (f (i + 1)) := by sorry

end FordFulkerson58.ArcChain
Source
Ford and Fulkerson, A suggested computation for maximal multi-commodity network flows, Management Sci. 50(12S) (2004), p. 1780, §3, the labeling process ("Eventually no such arcs can be found")
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