Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(23), p. 345 — on every used route qᵢ = pᵢ(1 − bᵢ/t)

Proved
WardropTraffic.EqualTimes.flow_eq_of_used

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

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

Consider DDD routes with positive constants bi,pib_i, p_ibi​,pi​ and journey times ti(x)=bi/(1−x/pi)t_i(x) = b_i/(1 - x/p_i)ti​(x)=bi​/(1−x/pi​). Let qqq be a feasible split of QQQ satisfying the equal-times criterion (1) with common time ttt. Then on every route in use,

qi>0  ⟹  qi=pi(1−bit),q_i > 0 \implies q_i = p_i\Bigl(1 - \frac{b_i}{t}\Bigr),qi​>0⟹qi​=pi​(1−tbi​​),

which is equation (23), obtained by solving t=bi/(1−qi/pi)t = b_i/(1 - q_i/p_i)t=bi​/(1−qi​/pi​) for qiq_iqi​.

Formalization Note The routes i=1,…,ji = 1, \dots, ji=1,…,j of (23) are the routes in use; by the companion milestones these are exactly the routes with bi<tb_i < tbi​<t, where t>bi>0t > b_i > 0t>bi​>0, so the division by ttt is genuine.

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

theorem flow_eq_of_used {D : ℕ} (b p : Fin D → ℝ) (hb : ∀ i, 0 < b i) (hp : ∀ i, 0 < p i)
    (Q t : ℝ) (q : Fin D → ℝ) (h : IsEqualTimes b p Q q t) :
    ∀ i, 0 < q i → q i = p i * (1 - b i / t) := by sorry

end WardropTraffic.EqualTimes
Source
Wardrop, Some theoretical aspects of road traffic research, Proc. Instn Civ. Engrs Part II 1 (1952), p. 345, (23)
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