Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.1 — an active vertex admits an update

Proved
CostScaling.Refine.push_or_relabel_applicable

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 a circulation network be feasible, so some circulation exists. Let fff be a pseudoflow that is ε\varepsilonε-optimal with respect to prices ppp, and let vvv have positive excess. Then either a push applies to an arc (v,w)(v,w)(v,w) for some www, or a relabel applies at vvv:

ef(v)>0⟹(∃w, PushApplicable⁡(v,w)) ∨ RelabelApplicable⁡(v).e_f(v)>0\quad\Longrightarrow\quad \bigl(\exists w,\ \operatorname{PushApplicable}(v,w)\bigr)\ \lor\ \operatorname{RelabelApplicable}(v).ef​(v)>0⟹(∃w, PushApplicable(v,w)) ∨ RelabelApplicable(v).

This is the progress fact used to connect the loop guard with flow conservation. Feasibility also ensures that the relabel action has an outgoing residual arc and an attained minimum, so an applicable operation is a genuine next step.

Formalization Note The formal conclusion explicitly produces a successor state for a relabel; Figure 5 says an empty relabel minimum signals infeasibility.

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

/-- Lemma 5.1, p. 19. Feasibility also rules out an empty relabel minimum. -/
theorem push_or_relabel_applicable {V : Type*} [Fintype V] [DecidableEq V]
    (N : Network V) (ε : ℝ) (s : State V)
    (hfeasible : ∃ g, CycleCanceling.MinMean.IsCirculation N g)
    (hopt : IsEpsOptimal N ε s.f s.p) (v : V) (hv : IsActive N s.f v) :
    (∃ w, PushApplicable N s v w) ∨ (∃ t, IsRelabelStep N ε s v t) := by sorry

end CostScaling.Refine
Source
Goldberg & Tarjan, MIT/LCS/TM-333 (July 1987), Lemma 5.1, p. 19; 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