(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ᵢ
ProvedWardropTraffic.EqualTimes.equal_times_characterizationConsider a flow that chooses among alternative routes. Route has positive constants (empty-route journey time) and , and carries journey time at additional flow (equation (22)). Write .
For every and every flow vector , the following are equivalent:
- is a feasible split of (, ) satisfying the equal-times criterion (1) with common time : every used route has and every unused route has ;
- the flows and the total are given by (23) and (24):
The forward direction is Wardrop's derivation: exactly the routes faster than when empty are used, each carries the flow (23), and summing gives (24), the value of for which 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 corresponding to the given .
Formalization Note The paper's labelling and "the first routes" are replaced by the set , a generalisation that also covers ties. The criterion on unused routes is the weak , which the paper's case split uses; every split satisfying the printed strict criterion satisfies it. No sign condition on or is assumed: for both sides force and (the term 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.
import Mathlib import Definitions.Def_WardropTraffic_EqualTimes_Setting
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.