Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3, p. 410 — level drift along an arc of E⁺

Proved
UnitCapMCF.Excess.lemma3_dlevel_drift

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

cost-scalingexcessminimum-cost-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let f′f'f′ be 2ε2\varepsilon2ε-optimal at entry prices p′p'p′, and let fff be ε\varepsilonε-optimal at current prices ppp, where ε>0\varepsilon>0ε>0. Write E+={(v,w)∈E:f′(v,w)>f(v,w)}E^+=\{(v,w)\in E:f'(v,w)>f(v,w)\}E+={(v,w)∈E:f′(v,w)>f(v,w)} and d(x)=(p(x)−p′(x))/εd(x)=(p(x)-p'(x))/\varepsilond(x)=(p(x)−p′(x))/ε. For every (v,w)∈E+(v,w)\in E^+(v,w)∈E+,

d(v)≤d(w)+3.d(v)\le d(w)+3.d(v)≤d(w)+3.

The level drift bound is the path constraint used to turn the level bands in Lemma 5 into excess–deficit cuts.

Formalization Note Both optimality predicates include the pseudoflow constraints. No circulation, unit-capacity or integrality assumption is needed for this lemma.

Preamble
import Mathlib
import Definitions.Def_UnitCapMCF_Excess_Setting
Formal statement
namespace UnitCapMCF.Excess

/-- Goldberg et al., STACS 2015, Lemma 3, p. 410. -/
theorem lemma3_dlevel_drift {V : Type*} [Fintype V] [DecidableEq V]
    (N : CostScaling.Refine.Network V) (ε : ℝ) (hε : 0 < ε)
    (f' f : V → V → ℝ) (p' p : V → ℝ)
    (hf' : CostScaling.Refine.IsEpsOptimal N (2 * ε) f' p')
    (hf : CostScaling.Refine.IsEpsOptimal N ε f p)
    (v w : V) (hvw : (v, w) ∈ Eplus N f' f) :
    dlevel ε p' p v ≤ dlevel ε p' p w + 3 := by sorry

end UnitCapMCF.Excess
Source
Goldberg, Kaplan, Hed & Tarjan, Minimum Cost Flows in Graphs with Unit Capacities, STACS 2015 (LIPIcs 30), p. 410, Lemma 3; https://doi.org/10.4230/LIPIcs.STACS.2015.406
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 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