Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(32)–(33), p. 347 — the minimum average journey time and its flows in closed form ((33) with denominator Σpᵢ√bᵢ)

Proved
WardropTraffic.MinTime.min_average_time_closed_form

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

closed-formp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1system-optimumtraffic-assignment

A flow QQQ is split over DDD alternative routes, route iii having 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)), with constants bi>0b_i > 0bi​>0, pi>0p_i > 0pi​>0, and 0<Q<∑i=1Dpi0 < Q < \sum_{i=1}^D p_i0<Q<∑i=1D​pi​. A feasible split is q=(q1,…,qD)q = (q_1, \dots, q_D)q=(q1​,…,qD​) with 0≤qi<pi0 \le q_i < p_i0≤qi​<pi​ and ∑iqi=Q\sum_i q_i = Q∑i​qi​=Q, and its average journey time is T(q)=1Q∑iqiti(qi)T(q) = \frac1Q\sum_i q_i t_i(q_i)T(q)=Q1​∑i​qi​ti​(qi​) (equation (25)).

If qqq minimizes TTT over all feasible splits, then there is a threshold ε>0\varepsilon > 0ε>0 such that, with U={i:bi<ε}U = \{i : b_i < \varepsilon\}U={i:bi​<ε} the set of routes in use, ∑i∈Upi>Q\sum_{i \in U} p_i > Q∑i∈U​pi​>Q and:

  1. the flows are (33)
qh={ph{1−(∑i∈Upi−Q)bh∑i∈Upibi},bh<ε,0,bh≥ε;q_h = \begin{cases} p_h\left\{1 - \dfrac{\left(\sum_{i\in U} p_i - Q\right)\sqrt{b_h}}{\sum_{i\in U} p_i\sqrt{b_i}}\right\}, & b_h < \varepsilon,\\[2ex] 0, & b_h \ge \varepsilon; \end{cases}qh​=⎩⎨⎧​ph​{1−∑i∈U​pi​bi​​(∑i∈U​pi​−Q)bh​​​},0,​bh​<ε,bh​≥ε;​
  1. the minimum average journey time is (32)
T=1Q{(∑i∈Upibi)2∑i∈Upi−Q−∑i∈Upibi}.T = \frac{1}{Q}\left\{\frac{\left(\sum_{i \in U} p_i\sqrt{b_i}\right)^2}{\sum_{i\in U} p_i - Q} - \sum_{i\in U} p_i b_i\right\}.T=Q1​{∑i∈U​pi​−Q(∑i∈U​pi​bi​​)2​−i∈U∑​pi​bi​}.

With the routes labelled so that b1<⋯<bDb_1 < \dots < b_Db1​<⋯<bD​, UUU is "the first jjj routes" of the paper. This is the paper's solution of the system-optimal assignment problem on parallel routes, to be compared with the equal-times solution (23)–(24) of the same model.

Formalization Note The paper prints the denominator in (33) as ∑i=1jpibi\sum_{i=1}^{j} p_i b_i∑i=1j​pi​bi​. That is a slip: from (31), 1/ε=(∑pi−Q)/∑pibi1/\sqrt{\varepsilon} = (\sum p_i - Q)/\sum p_i\sqrt{b_i}1/ε​=(∑pi​−Q)/∑pi​bi​​, so qh=ph(1−bh/ε)q_h = p_h(1 - \sqrt{b_h/\varepsilon})qh​=ph​(1−bh​/ε​) gives the denominator ∑pibi\sum p_i\sqrt{b_i}∑pi​bi​​ stated here; the printed form is also not dimensionless, since bib_ibi​ is a time. With b=(4,9)b = (4, 9)b=(4,9), p=(10,10)p = (10, 10)p=(10,10), Q=35/3Q = 35/3Q=35/3 the minimizing flow is q1=20/3q_1 = 20/3q1​=20/3, which the corrected formula returns and the printed one does not. Equation (32) is correct as printed. The conditions bi,pi>0b_i, p_i > 0bi​,pi​>0, 0<Q<∑ipi0 < Q < \sum_i p_i0<Q<∑i​pi​ and qi<piq_i < p_iqi​<pi​ are the model's standing conditions (positive speeds, a nontrivial flow, a nonempty feasible set). No ordering of the bib_ibi​ is assumed. The threshold ε\varepsilonε is existential; a route with bh=εb_h = \varepsilonbh​=ε carries no flow by either branch.


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_MinTime_Setting
Formal statement
namespace WardropTraffic.MinTime

/-- (32)–(33), with the denominator of (33) corrected to `∑ p_i √b_i`: every split
minimizing the average journey time has a threshold `ε > 0` such that exactly the routes
with `b_h < ε` are used, with the flows (33) and the minimum average time (32). -/
theorem min_average_time_closed_form {D : ℕ} (b p : Fin D → ℝ) (Q : ℝ)
    (hb : ∀ i, 0 < b i) (hp : ∀ i, 0 < p i) (hQ : 0 < Q) (hQp : Q < ∑ i, p i)
    (q : Fin D → ℝ) (hmin : IsMinAvgTime b p Q q) :
    ∃ ε : ℝ, 0 < ε ∧ Q < ∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i ∧
      (∀ h, q h = if b h < ε then
          p h * (1 - (∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i - Q) * Real.sqrt (b h) /
            ∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i * Real.sqrt (b i))
        else 0) ∧
      avgTime b p Q q = (1 / Q) * ((∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i * Real.sqrt (b i)) ^ 2 /
          (∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i - Q) - ∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i * b i) := by sorry

end WardropTraffic.MinTime
Source
Wardrop, Some theoretical aspects of road traffic research, Proc. Instn Civ. Engrs Part II 1 (1952), p. 347, (32)–(33) (denominator of (33) corrected from Σpᵢbᵢ to Σpᵢ√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