Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Generic refine terminates within an explicit update bound at an ε-optimal circulation

Proved
CostScaling.Refine.generic_refine_correct_and_bounded

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

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

Let NNN be a finite symmetric circulation network with nnn vertices and mmm ordered arcs. Enter generic refine with ε>0\varepsilon>0ε>0, a circulation f0f_0f0​, and prices p0p_0p0​ for which f0f_0f0​ is 2ε2\varepsilon2ε-optimal. Start from Figure 4's initialized pseudoflow and take any KKK applicable push or relabel steps, in any order. Then:

K≤3n(n−1)+3nm+3n2(m+n).K\le 3n(n-1)+3nm+3n^2(m+n).K≤3n(n−1)+3nm+3n2(m+n).

If the last state still has an active vertex, a further push or relabel step exists. If no operation applies there, its pseudoflow is a circulation and is ε\varepsilonε-optimal with respect to its final prices. Consequently, every choice of applicable operations stops within the displayed bound at an ε\varepsilonε-optimal circulation.

The result gathers the progress and correctness statements of Section 5 and the explicit bounds of Lemmas 5.9–5.11. It is an update count, not a RAM-model running time.

Formalization Note The formal parameter ε\varepsilonε is the error after Figure 4 halves the input 2ε2\varepsilon2ε; mmm counts ordered arcs. Termination uses Figure 4's loop guard, and a relabel successor requires an attained minimum over a nonempty residual set.

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

/-- Theorem 5.4 and Lemmas 5.1, 5.9–5.11, with the paper's constants. -/
theorem generic_refine_correct_and_bounded {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) :
    K ≤ 3 * Fintype.card V * (Fintype.card V - 1) +
        3 * Fintype.card V * N.E.card +
        3 * Fintype.card V ^ 2 * (N.E.card + Fintype.card V) ∧
    (∀ v, IsActive N (σ K).f v → ∃ t, IsStep N ε (σ K) t) ∧
    (Terminated N (σ K) →
      CycleCanceling.MinMean.IsCirculation N (σ K).f ∧
      IsEpsOptimal N ε (σ K).f (σ K).p) := by sorry

end CostScaling.Refine
Source
Goldberg & Tarjan, MIT/LCS/TM-333 (July 1987), Theorem 5.4 and Lemmas 5.1, 5.9–5.11, p. 24; 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