(32)–(33), p. 347 — the minimum average journey time and its flows in closed form ((33) with denominator Σpᵢ√bᵢ)
ProvedWardropTraffic.MinTime.min_average_time_closed_formA flow is split over alternative routes, route having journey time at additional flow (equation (22)), with constants , , and . A feasible split is with and , and its average journey time is (equation (25)).
If minimizes over all feasible splits, then there is a threshold such that, with the set of routes in use, and:
- the flows are (33)
- the minimum average journey time is (32)
With the routes labelled so that , is "the first routes" of the paper. This is the paper's solution of the system-optimal assignment problem on parallel routes, to be compared with the equal-times solution (23)–(24) of the same model.
Formalization Note The paper prints the denominator in (33) as . That is a slip: from (31), , so gives the denominator stated here; the printed form is also not dimensionless, since is a time. With , , the minimizing flow is , which the corrected formula returns and the printed one does not. Equation (32) is correct as printed. The conditions , and are the model's standing conditions (positive speeds, a nontrivial flow, a nonempty feasible set). No ordering of the is assumed. The threshold is existential; a route with carries no flow by either branch.
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_MinTime_Setting
namespace WardropTraffic.MinTime
/-- (32)–(33), with the denominator of (33) corrected to `∑ p_i √b_i`: every split
minimizing the average journey time has a threshold `ε > 0` such that exactly the routes
with `b_h < ε` are used, with the flows (33) and the minimum average time (32). -/
theorem min_average_time_closed_form {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) :
∃ ε : ℝ, 0 < ε ∧ Q < ∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i ∧
(∀ h, q h = if b h < ε then
p h * (1 - (∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i - Q) * Real.sqrt (b h) /
∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i * Real.sqrt (b i))
else 0) ∧
avgTime b p Q q = (1 / Q) * ((∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i * Real.sqrt (b i)) ^ 2 /
(∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i - Q) - ∑ i ∈ WardropTraffic.EqualTimes.usedSet b ε, p i * b i) := by sorry
end WardropTraffic.MinTime
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.