Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

p. 346 — a route j with zero-flow marginal time bⱼ ≥ ε is not used

Proved
WardropTraffic.MinTime.unused_of_marginal_ge

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1system-optimumtraffic-assignment

In the setting of the minimum-average-time problem (bi,pi>0b_i, p_i > 0bi​,pi​>0, 0<Q<∑ipi0 < Q < \sum_i p_i0<Q<∑i​pi​), let qqq minimize the average journey time TTT over the feasible splits of QQQ, and let ε\varepsilonε be a common marginal time of the routes in use, i.e. bi/(1−qi/pi)2=εb_i/(1 - q_i/p_i)^2 = \varepsilonbi​/(1−qi​/pi​)2=ε whenever qi>0q_i > 0qi​>0. Then for every route jjj,

[d(qjtj)dqj]q=0=bj ≥ ε⟹qj=0.\left[\frac{d(q_j t_j)}{dq_j}\right]_{q=0} = b_j \ \ge\ \varepsilon \quad\Longrightarrow\quad q_j = 0 .[dqj​d(qj​tj​)​]q=0​=bj​ ≥ ε⟹qj​=0.

This is the paper's rule that a route whose marginal time at zero flow is at least the common marginal time ε\varepsilonε attracts no flow at the optimum.

Formalization Note The zero-flow marginal time is written as bjb_jbj​, its value by (30). The standing conditions are those of the model.

Preamble
import Mathlib
import Definitions.Def_WardropTraffic_MinTime_Setting
Formal statement
namespace WardropTraffic.MinTime

/-- p. 346: if `ε` is the common marginal time of the routes in use at a minimum, a route
whose zero-flow marginal time `b_j` is at least `ε` is not used. -/
theorem unused_of_marginal_ge {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 = ε) :
    ∀ j, ε ≤ b j → q j = 0 := by sorry

end WardropTraffic.MinTime
Source
Wardrop, Some theoretical aspects of road traffic research, Proc. Instn Civ. Engrs Part II 1 (1952), p. 346, the sentence following (28)
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me