(31), p. 346 — Σ_{bᵢ<ε} pᵢ − Q = Σ_{bᵢ<ε} pᵢ√(bᵢ/ε)
ProvedWardropTraffic.MinTime.sum_eq_sqrtp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1system-optimumtraffic-assignment
In the setting of the minimum-average-time problem (, ), let minimize the average journey time over the feasible splits of , and let be a common marginal time of the routes in use: whenever . Write for the set of routes in use. Then
This is equation (31), obtained on the page by summing over the routes in use. It determines from , and leads to the closed forms (32)–(33).
Formalization Note The paper's sum over "the first routes" is the sum over ; no ordering of the is assumed. The standing conditions are those of the model.
Preamble
import Mathlib import Definitions.Def_WardropTraffic_MinTime_Setting
Formal statement
namespace WardropTraffic.MinTime
/-- (31): summing `p_i - q_i = p_i √(b_i/ε)` over the routes in use,
`∑_{b_i < ε} p_i - Q = ∑_{b_i < ε} p_i √(b_i/ε)`. -/
theorem sum_eq_sqrt {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) (ε : ℝ)
(hε : ∀ i, 0 < q i → b i / (1 - q i / p i) ^ 2 = ε) :
∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i - Q = ∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i * Real.sqrt (b i / ε) := by sorry
end WardropTraffic.MinTime
Source
Wardrop, Some theoretical aspects of road traffic research, Proc. Instn Civ. Engrs Part II 1 (1952), p. 346, (31)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.