Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.9 — at most 3n(n − 1) relabelings

Proved
CostScaling.Refine.relabel_count_le

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

cost-scalingminimum-cost-circulationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1push-relabel

For any run of generic refine entered with a 2ε2\varepsilon2ε-optimal circulation and ε>0\varepsilon>0ε>0, let RRR be the number of relabel operations among its KKK updates. If n=∣V∣n=|V|n=∣V∣, then

R≤3n(n−1).R\le 3n(n-1).R≤3n(n−1).

This is the first component of the explicit bound on the number of update operations.

Formalization Note RRR counts actual relabel steps in a run from Figure 4's initialization. The parameter ε\varepsilonε is the value after halving. The natural subtraction n−1n-1n−1 is zero at n=0n=0n=0, where no relabel step is possible.

Preamble
import Mathlib
import Definitions.Def_CostScaling_Refine_Run
Formal statement
namespace CostScaling.Refine

/-- Lemma 5.9, p. 23. -/
theorem relabel_count_le {V : Type*} [Fintype V] [DecidableEq V]
    (N : Network V) (ε : ℝ) (hε : 0 < ε)
    (f₀ : V → V → ℝ) (p₀ : V → ℝ)
    (hcirc : CycleCanceling.MinMean.IsCirculation N f₀)
    (hentry : IsEpsOptimal N (2 * ε) f₀ p₀)
    (σ : ℕ → State V) (K : ℕ)
    (hrun : IsRun N ε f₀ p₀ σ K) :
    relabelCount N ε σ K ≤ 3 * Fintype.card V * (Fintype.card V - 1) := by sorry

end CostScaling.Refine
Source
Goldberg & Tarjan, MIT/LCS/TM-333 (July 1987), Lemma 5.9, p. 23; https://publications.csail.mit.edu/lcs/pubs/pdf/MIT-LCS-TM-333.pdf
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