Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 4.5, second display — C(f/2)≥14C(f)C(f/2)\ge\frac14 C(f)C(f/2)≥41​C(f) for linear latencies

Proved
SelfishRouting.Linear.cost_half_flow

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

linear-latencyp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1selfish-routing

Let every edge have a linear latency ℓe(x)=aex+be\ell_e(x)=a_ex+b_eℓe​(x)=ae​x+be​ with ae,be≥0a_e,b_e\ge 0ae​,be​≥0 and let the route incidences be 0/10/10/1. For every flow fff with fP≥0f_P\ge 0fP​≥0 on every route,

C(f/2)=∑e(14aefe2+12befe) ≥ 14∑e(aefe2+befe)=14C(f).C(f/2)=\sum_e\Big(\tfrac14a_ef_e^2+\tfrac12b_ef_e\Big)\ \ge\ \tfrac14\sum_e\big(a_ef_e^2+b_ef_e\big)=\tfrac14C(f).C(f/2)=e∑​(41​ae​fe2​+21​be​fe​) ≥ 41​e∑​(ae​fe2​+be​fe​)=41​C(f).

In the proof of Theorem 4.5 this bounds the cost of the first stage, the optimal flow f/2f/2f/2 for the rates r/2r/2r/2, from below by a quarter of the equilibrium cost.

Formalization Note Stated as C(f)≤4 C(f/2)C(f)\le 4\,C(f/2)C(f)≤4C(f/2), with no division. The page applies it to a Nash flow; equilibrium is not needed, only nonnegative route flows (so that the edge flows are nonnegative).

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_SelfishRouting_Linear_Model
import Definitions.Def_SelfishRouting_Linear_LinearLatency
Formal statement
namespace SelfishRouting.Linear

/-- Proof of Theorem 4.5, second display (p. 17): with linear latencies with `a_e, b_e ≥ 0`,
`C(f/2) ≥ ¼ C(f)` for every flow `f` with nonnegative route flows. -/
theorem cost_half_flow {J R : ℕ} (A : Fin J → Fin R → ℝ) (hA : ∀ j r, A j r = 0 ∨ A j r = 1)
    (a b : Fin J → ℝ) (ha : ∀ j, 0 ≤ a j) (hb : ∀ j, 0 ≤ b j)
    (x : Fin R → ℝ) (hx : ∀ r, 0 ≤ x r) :
    SelfishRouting.Bicriteria.cost A (linLatency a b) x ≤ 4 * SelfishRouting.Bicriteria.cost A (linLatency a b) (fun r => x r / 2) := by sorry

end SelfishRouting.Linear
Source
Roughgarden & Tardos, How Bad is Selfish Routing?, J. ACM 49(2) (2002), author's manuscript of 5 Dec 2001, p. 17, proof of Theorem 4.5, second display
Human review
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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