Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 345 — the journey time (22) is at least bᵢ, with equality exactly at zero additional flow

Proved
WardropTraffic.EqualTimes.routeTime_ge

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1traffic-assignmentwardrop-equilibrium

Let route iii have positive constants bib_ibi​ and pip_ipi​ and journey time ti(x)=bi/(1−x/pi)t_i(x) = b_i/(1 - x/p_i)ti​(x)=bi​/(1−x/pi​) at additional flow xxx (equation (22)). For every flow xxx with 0≤x<pi0 \le x < p_i0≤x<pi​,

ti(x)≥bi,andti(x)=bi  ⟺  x=0.t_i(x) \ge b_i, \qquad\text{and}\qquad t_i(x) = b_i \iff x = 0 .ti​(x)≥bi​,andti​(x)=bi​⟺x=0.

So bib_ibi​ is the journey time of a single vehicle on an otherwise unused route, and no flow can make the route faster than that.

This is the fact behind the paper's remark that "the journey time on any route iii cannot be less than bib_ibi​", which decides which routes can be in use under the equal-times criterion.

Formalization Note The positivity of bib_ibi​, pip_ipi​ and the range 0≤x<pi0 \le x < p_i0≤x<pi​ are the model's standing conditions (positive speed); the paper presupposes them.

Preamble
import Mathlib
import Definitions.Def_WardropTraffic_EqualTimes_Setting
Formal statement
namespace WardropTraffic.EqualTimes

theorem routeTime_ge {D : ℕ} (b p : Fin D → ℝ) (hb : ∀ i, 0 < b i) (hp : ∀ i, 0 < p i)
    (i : Fin D) (x : ℝ) (hx0 : 0 ≤ x) (hxp : x < p i) :
    b i ≤ routeTime b p i x ∧ (routeTime b p i x = b i ↔ x = 0) := by sorry

end WardropTraffic.EqualTimes
Source
Wardrop, Some theoretical aspects of road traffic research, Proc. Instn Civ. Engrs Part II 1 (1952), p. 345, (1) Equal Times: "Any one of these quantities bᵢ is the journey time on route i when the additional flow qᵢ = 0" and "equation (22) shows that the journey time on any route i cannot be less than bᵢ"
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