Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§3, p. 1780 — when the labeling process stops, π_i is the length of a shortest chain from S to P_i; the smallest π_i on T is the S-to-T distance

Proved
FordFulkerson58.ArcChain.terminal_label_eq_shortest

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

correctnesslabeling-algorithmp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1shortest-chain

Let NNN be a network with non-negative arc lengths lel_ele​, let SSS and TTT be sets of nodes, and let π\piπ be a labeling obtained from the initial labels (000 on SSS, ∞\infty∞ elsewhere) by finitely many steps of the labeling process, such that no further step is possible. Then

  1. for every node vvv, πv\pi_vπv​ is the length of a shortest chain from SSS to vvv (∞\infty∞ if there is none);
  2. the smallest label on TTT is the length of a shortest chain from SSS to TTT:
min⁡v∈Tπv=min⁡{ length(C):C a chain from S to a node of T }.\min_{v \in T} \pi_v = \min\{\, \text{length}(C) : C \text{ a chain from } S \text{ to a node of } T \,\}.v∈Tmin​πv​=min{length(C):C a chain from S to a node of T}.

This is the correctness of the shortest chain algorithm: the final labels are the shortest-chain distances from the source set.

Formalization Note The labeling must be both reachable from the initial labels and terminal; a terminal labeling alone (for instance all labels 000) need not consist of distances. Both minima are ∞\infty∞ (⊤) on empty sets.

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

/-- §3, p. 1780: when the labeling process (with non-negative lengths) stops, every label is the length
of a shortest chain from `S` to its node, and the smallest label on `T` is the length of a shortest
chain from `S` to `T`. -/
theorem terminal_label_eq_shortest {V E ι : Type*} [Fintype V] [DecidableEq V] [Fintype E] [DecidableEq E]
    [Fintype ι] [DecidableEq ι] (N : Network V E ι)
    (S T : Finset V) (l : E → ℝ) (hl : ∀ e, 0 ≤ l e) (lab : V → WithTop ℝ)
    (hrun : Relation.ReflTransGen (RelaxStep N l) (initLabel S) lab) (hterm : IsTerminal N l lab) :
    (∀ v, lab v = shortestChainLength N l S v) ∧ T.inf lab = shortestChainLengthTo N l S T := 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 ("then the number π_i represents the length of a shortest chain from S to P_i … In particular")
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