Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 346 — the routes in use are exactly those with bᵢ < ε, and on them 1 − qᵢ/pᵢ = √(bᵢ/ε)

Proved
WardropTraffic.MinTime.used_iff_and_sqrt

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

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1system-optimumtraffic-assignment

In the setting of the minimum-average-time problem (bi,pi>0b_i, p_i > 0bi​,pi​>0, 0<Q<∑ipi0 < Q < \sum_i p_i0<Q<∑i​pi​), let qqq minimize the average journey time TTT over the feasible splits of QQQ, and let ε\varepsilonε be a common marginal time of the routes in use: bi/(1−qi/pi)2=εb_i/(1 - q_i/p_i)^2 = \varepsilonbi​/(1−qi​/pi​)2=ε whenever qi>0q_i > 0qi​>0. Then ε>0\varepsilon > 0ε>0 and for every route iii:

  1. route iii is used if and only if bi<εb_i < \varepsilonbi​<ε;
  2. if route iii is used, then
1−qipi=biε,equivalentlypi−qi=pibiε.1 - \frac{q_i}{p_i} = \sqrt{\frac{b_i}{\varepsilon}}, \qquad\text{equivalently}\qquad p_i - q_i = p_i \sqrt{\frac{b_i}{\varepsilon}} .1−pi​qi​​=εbi​​​,equivalentlypi​−qi​=pi​εbi​​​.

With the routes labelled so that b1<b2<⋯<bDb_1 < b_2 < \dots < b_Db1​<b2​<⋯<bD​, part 1 is the paper's "if bj<ε<bj+1b_j < \varepsilon < b_{j+1}bj​<ε<bj+1​ only the first jjj routes will be in use", and part 2 solves (28) for the flows.

Formalization Note The ordering of the bib_ibi​ is not assumed: "the first jjj routes" is the set {i:bi<ε}\{i : b_i < \varepsilon\}{i:bi​<ε}. The standing conditions are those of the model.

Preamble
import Mathlib
import Definitions.Def_WardropTraffic_MinTime_Setting
Formal statement
namespace WardropTraffic.MinTime

/-- p. 346: at a minimum with common marginal time `ε`, `ε > 0`, the routes in use are
exactly those with `b_i < ε`, and on each of them `1 - q_i/p_i = √(b_i/ε)`. -/
theorem used_iff_and_sqrt {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) (ε : ℝ)
    (hε : ∀ i, 0 < q i → b i / (1 - q i / p i) ^ 2 = ε) :
    0 < ε ∧ ∀ i, (0 < q i ↔ b i < ε) ∧
      (0 < q i → 1 - q i / p i = Real.sqrt (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. 346, after (30): 'Thus if b_j < ε < b_{j+1} only the first j routes will be in use. Hence 1 − q_i/p_i = √(b_i/ε) and so p_i − q_i = p_i√(b_i/ε)'
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