p. 345 — under equal times t, every route with bᵢ < t is in use
ProvedWardropTraffic.EqualTimes.lt_imp_usedp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1traffic-assignmentwardrop-equilibrium
Consider routes with positive constants and journey times . Let be a feasible split of satisfying the equal-times criterion (1) with common time (used routes have time ; unused routes have ). Then for every route ,
In the paper's labelling, all of the first routes must be in use: otherwise would exceed on an unused route.
Formalization Note As in the companion milestone, "the first routes" is the set and no ordering of the is assumed.
Preamble
import Mathlib import Definitions.Def_WardropTraffic_EqualTimes_Setting
Formal statement
namespace WardropTraffic.EqualTimes
theorem lt_imp_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, b i < t → 0 < q i := 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: "On the other hand, all of the first j routes must be in use"
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.