Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(27)–(28), p. 346 — at a minimum of T, all routes in use have the same marginal time ε

Proved
WardropTraffic.MinTime.marginal_times_equal

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

marginal-costp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1system-optimumtraffic-assignment

Let b1,…,bD>0b_1, \dots, b_D > 0b1​,…,bD​>0 and p1,…,pD>0p_1, \dots, p_D > 0p1​,…,pD​>0 describe DDD alternative routes with journey times ti(x)=bi/(1−x/pi)t_i(x) = b_i/(1 - x/p_i)ti​(x)=bi​/(1−x/pi​), and let 0<Q<∑ipi0 < Q < \sum_i p_i0<Q<∑i​pi​. Suppose the feasible split qqq of QQQ minimizes the average journey time TTT (criterion (2)). Then there is a constant ε\varepsilonε, independent of the route, with

bi(1−qi/pi)2=εfor every route i with qi>0.\frac{b_i}{(1 - q_i/p_i)^2} = \varepsilon \qquad \text{for every route } i \text{ with } q_i > 0 .(1−qi​/pi​)2bi​​=εfor every route i with qi​>0.

By (29) the left side is the marginal time d(qiti)/dqid(q_i t_i)/dq_id(qi​ti​)/dqi​, so this is (27)–(28): moving an infinitesimal amount of flow between two routes in use must not change ZZZ. It is the system-optimum counterpart of the equal-times principle.

Formalization Note The marginal time is written in its closed form (29) rather than as a derivative. The conditions bi,pi>0b_i, p_i > 0bi​,pi​>0 and 0<Q<∑ipi0 < Q < \sum_i p_i0<Q<∑i​pi​ are the model's standing conditions: positive speeds, a nontrivial flow, and a nonempty feasible set.

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

/-- (27)–(28): at a minimum of the average journey time, the marginal journey times
`b_i / (1 - q_i/p_i)^2` of all routes in use equal one constant `ε`. -/
theorem marginal_times_equal {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) :
    ∃ ε : ℝ, ∀ i, 0 < q i → b i / (1 - q i / p i) ^ 2 = ε := by sorry

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