p. 345 — under equal times t, only routes with bᵢ < t are in use
ProvedWardropTraffic.EqualTimes.used_imp_ltp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1traffic-assignmentwardrop-equilibrium
Consider routes with positive constants and journey times . Let be a feasible split of the flow (, ) satisfying the equal-times criterion (1) with common time : whenever , and whenever . Then for every route ,
In the paper's labelling with , only the first routes can be in use.
Formalization Note "The first routes" is expressed as the set of routes with ; the ordering of the is not assumed. The criterion's comparison on unused routes is the weak (see the definitions file).
Preamble
import Mathlib import Definitions.Def_WardropTraffic_EqualTimes_Setting
Formal statement
namespace WardropTraffic.EqualTimes
theorem used_imp_lt {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 → 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, (1) Equal Times: "Then clearly only the first j routes can be in use"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.