Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.2 — a large reduced cost fixes an arc across error parameters

Proved
CostScaling.StrongPoly.theorem_4_2_arc_fixed

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

cost-scalingminimum-cost-circulationp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1strongly-polynomial

Let G=(V,E)G=(V,E)G=(V,E) be a circulation network with n=∣V∣≥2n=|V|\ge2n=∣V∣≥2 and m=∣E∣≥n−1m=|E|\ge n-1m=∣E∣≥n−1. Let ε>0ε>0ε>0 and ε′≥0ε'\ge0ε′≥0. Suppose a circulation fff is ε-optimal with respect to a price function ppp, and an arc (v,w)∈E(v,w)\in E(v,w)∈E satisfies

∣cp(v,w)∣≥n(ε+ε′).|c_p(v,w)|\ge n(ε+ε').∣cp​(v,w)∣≥n(ε+ε′).

Then for every ε′-optimal circulation f′f'f′,

f(v,w)=f′(v,w).f(v,w)=f'(v,w).f(v,w)=f′(v,w).

This gives the arc-fixing criterion that underlies Corollary 4.3 and the progress statement of Lemma 4.4.

Formalization Note The bounds n≥2n\ge2n≥2 and m≥n−1m\ge n-1m≥n−1 are the standing network assumption on p. 5; ε′≥0ε'\ge0ε′≥0 is required by the paper's definition of an error parameter. Lean's reused reduced cost has +p(v)−p(w)+p(v)-p(w)+p(v)−p(w) instead of the paper's −p(v)+p(w)-p(v)+p(w)−p(v)+p(w); substituting −p-p−p leaves both optimality and the absolute-value test unchanged.

Preamble
import Mathlib
import Definitions.Def_CycleCanceling_MinMean_EpsOptimal
Formal statement
namespace CostScaling.StrongPoly

open CycleCanceling.MinMean

variable {V : Type*} [Fintype V] [DecidableEq V]

/-- Theorem 4.2, p. 16: an arc with a sufficiently large absolute reduced cost
has the same flow in a given `ε`-optimal circulation and every `ε'`-optimal
circulation. The paper's standing `m ≥ n - 1 ≥ 1` is explicit. -/
theorem theorem_4_2_arc_fixed (N : CircNetwork V)
    (hvertices : 2 ≤ Fintype.card V)
    (harcs : Fintype.card V - 1 ≤ N.E.card)
    (ε ε' : ℝ) (hε : 0 < ε) (hε' : 0 ≤ ε')
    (f : V → V → ℝ) (hf : IsCirculation N f)
    (p : V → ℝ) (hfp : IsEpsOptimalWrt N f ε p)
    (v w : V) (hvw : (v, w) ∈ N.E)
    (hcost : (Fintype.card V : ℝ) * (ε + ε') ≤ |reducedCost N p v w|) :
    ∀ f' : V → V → ℝ, IsEpsOptimal N f' ε' → f v w = f' v w := by sorry

end CostScaling.StrongPoly
Source
Goldberg & Tarjan, MIT/LCS/TM-333 (July 1987), Theorem 4.2, p. 16; standing network assumption p. 5
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