Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(31), p. 346 — Σ_{bᵢ<ε} pᵢ − Q = Σ_{bᵢ<ε} pᵢ√(bᵢ/ε)

Proved
WardropTraffic.MinTime.sum_eq_sqrt

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: bi/(1−qi/pi)2=εb_i/(1 - q_i/p_i)^2 = \varepsilonbi​/(1−qi​/pi​)2=ε whenever qi>0q_i > 0qi​>0. Write U(ε)={i:bi<ε}U(\varepsilon) = \{i : b_i < \varepsilon\}U(ε)={i:bi​<ε} for the set of routes in use. Then

∑i∈U(ε)pi−Q=∑i∈U(ε)pibiε.\sum_{i \in U(\varepsilon)} p_i - Q = \sum_{i \in U(\varepsilon)} p_i \sqrt{\frac{b_i}{\varepsilon}} .i∈U(ε)∑​pi​−Q=i∈U(ε)∑​pi​εbi​​​.

This is equation (31), obtained on the page by summing pi−qi=pibi/εp_i - q_i = p_i\sqrt{b_i/\varepsilon}pi​−qi​=pi​bi​/ε​ over the routes in use. It determines ε\varepsilonε from QQQ, and leads to the closed forms (32)–(33).

Formalization Note The paper's sum over "the first jjj routes" is the sum over U(ε)U(\varepsilon)U(ε); no ordering of the bib_ibi​ 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
  • 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