Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(23)–(24), p. 345 — under equal times t, exactly the routes with bᵢ < t are used, qᵢ = pᵢ(1 − bᵢ/t), Q = Σpᵢ − t⁻¹Σpᵢbᵢ

Proved
WardropTraffic.EqualTimes.equal_times_characterization

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

closed-formp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1traffic-assignmentwardrop-equilibrium

Consider a flow QQQ that chooses among DDD alternative routes. Route iii has positive constants bib_ibi​ (empty-route journey time) and pip_ipi​, and carries 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)). Write U(t)={i:bi<t}U(t) = \{ i : b_i < t \}U(t)={i:bi​<t}.

For every Q,t∈RQ, t \in \mathbb RQ,t∈R and every flow vector q=(q1,…,qD)q = (q_1, \dots, q_D)q=(q1​,…,qD​), the following are equivalent:

  1. qqq is a feasible split of QQQ (0≤qi<pi0 \le q_i < p_i0≤qi​<pi​, ∑iqi=Q\sum_i q_i = Q∑i​qi​=Q) satisfying the equal-times criterion (1) with common time ttt: every used route has ti(qi)=tt_i(q_i) = tti​(qi​)=t and every unused route has t≤bit \le b_it≤bi​;
  2. the flows and the total are given by (23) and (24):
qi={pi(1−bi/t)if bi<t,0otherwise,Q=∑i∈U(t)pi−1t∑i∈U(t)pibi.q_i = \begin{cases} p_i\bigl(1 - b_i/t\bigr) & \text{if } b_i < t,\\ 0 & \text{otherwise,}\end{cases} \qquad Q = \sum_{i \in U(t)} p_i - \frac{1}{t} \sum_{i \in U(t)} p_i b_i .qi​={pi​(1−bi​/t)0​if bi​<t,otherwise,​Q=i∈U(t)∑​pi​−t1​i∈U(t)∑​pi​bi​.

The forward direction is Wardrop's derivation: exactly the routes faster than ttt when empty are used, each carries the flow (23), and summing gives (24), the value of QQQ for which ttt is the appropriate journey time. The backward direction says that (23)–(24) are indeed an equal-times split, which is what makes it possible to solve the problem by picking the ttt corresponding to the given QQQ.

Formalization Note The paper's labelling b1<⋯<bDb_1 < \dots < b_Db1​<⋯<bD​ and "the first jjj routes" are replaced by the set U(t)U(t)U(t), a generalisation that also covers ties. The criterion on unused routes is the weak t≤bit \le b_it≤bi​, which the paper's case split bj<t≯bj+1b_j < t \not> b_{j+1}bj​<t>bj+1​ uses; every split satisfying the printed strict criterion satisfies it. No sign condition on ttt or QQQ is assumed: for t≤min⁡ibit \le \min_i b_it≤mini​bi​ both sides force q=0q = 0q=0 and Q=0Q = 0Q=0 (the term 1/t1/t1/t then multiplies an empty sum).


Retired 2026-10-27: a Lean-vs-paper fidelity audit found this statement weaker than, or narrower than, the cited result. A corrected statement will be resubmitted.

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

theorem equal_times_characterization {D : ℕ} (b p : Fin D → ℝ) (hb : ∀ i, 0 < b i)
    (hp : ∀ i, 0 < p i) (Q t : ℝ) (q : Fin D → ℝ) :
    IsEqualTimes b p Q q t ↔
      ((∀ i, q i = if b i < t then p i * (1 - b i / t) else 0) ∧
        Q = ∑ i ∈ usedSet b t, p i - (1 / t) * ∑ i ∈ usedSet b t, p i * b i) := 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, (23)–(24)
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