Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 4.4 — reducing ε by 2n strictly enlarges the fixed-arc set

Proved
CostScaling.StrongPoly.lemma_4_4_fixedArcs_strict

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. For ε>0ε>0ε>0 and 0≤ε′≤ε/(2n)0\le ε'\le ε/(2n)0≤ε′≤ε/(2n), suppose there is an ε-tight circulation. Then the set of fixed arcs grows strictly:

Fε⊊Fε′.F_ε\subsetneq F_{ε'}.Fε​⊊Fε′​.

Every such reduction of the tight error parameter therefore fixes at least one arc that was not fixed before. This is the finite progress measure used in Theorem 4.5.

Formalization Note The printed lemma omits ε>0ε>0ε>0, but without it the claim is false: ε=ε′=0ε=ε'=0ε=ε′=0 would assert F0⊊F0F_0\subsetneq F_0F0​⊊F0​. Its proof and Figure 3 use the lemma only at positive ε. The bound m≥n−1≥1m\ge n-1\ge1m≥n−1≥1 is the paper's standing network assumption. The set FεF_εFε​ uses the reused ε-optimality convention, equivalent under p↦−pp\mapsto-pp↦−p.

Preamble
import Mathlib
import Definitions.Def_CostScaling_StrongPoly_IsEpsTight
import Definitions.Def_CostScaling_StrongPoly_fixedArcs
Formal statement
namespace CostScaling.StrongPoly

open CycleCanceling.MinMean

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

/-- Lemma 4.4, p. 17: when the error parameter drops by a factor of `2n`, the
set of fixed arcs grows strictly. Positive `ε` is required by the proof and by
the statement's truth at the boundary. -/
theorem lemma_4_4_fixedArcs_strict (N : CircNetwork V)
    (hvertices : 2 ≤ Fintype.card V)
    (harcs : Fintype.card V - 1 ≤ N.E.card)
    (ε ε' : ℝ) (hε : 0 < ε) (hε' : 0 ≤ ε')
    (hscale : ε' ≤ ε / (2 * (Fintype.card V : ℝ)))
    (htight : ∃ f : V → V → ℝ, IsEpsTight N f ε) :
    fixedArcs N ε ⊂ fixedArcs N ε' := by sorry

end CostScaling.StrongPoly
Source
Goldberg & Tarjan, MIT/LCS/TM-333 (July 1987), Lemma 4.4, p. 17; Section 2.1, p. 5; Section 2.2, p. 7
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