Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 5.8 — price increase at most 3nε

Proved
CostScaling.Refine.price_increase_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

Let n=∣V∣n=|V|n=∣V∣, let ε>0\varepsilon>0ε>0, and enter refine with a circulation f0f_0f0​ that is 2ε2\varepsilon2ε-optimal with respect to p0p_0p0​. During any run of the generic subroutine, every vertex price is bounded above by its entry value plus 3nε3n\varepsilon3nε:

pk(v)≤p0(v)+3nε(0≤k≤K, v∈V).p_k(v)\le p_0(v)+3n\varepsilon\qquad(0\le k\le K,\ v\in V).pk​(v)≤p0​(v)+3nε(0≤k≤K, v∈V).

This price bound limits how often relabel can occur and thus supports the operation counts.

Formalization Note The source's ε\varepsilonε is the parameter after halving. The entry circulation and its 2ε2\varepsilon2ε-optimality are explicit hypotheses.

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

/-- Lemma 5.8, p. 22: the bound uses the error parameter after halving. -/
theorem price_increase_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) :
    ∀ k ≤ K, ∀ v, (σ k).p v ≤ p₀ v + 3 * (Fintype.card V : ℝ) * ε := by sorry

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