Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix IV, p. 359 — (ξ + η − 1)²[∂T/∂y] = −μ{2η(1 − η) + (ξ − η)²} − (λ − μ)ξ² < 0 when λ ≥ μ

Proved
WardropTraffic.Signal.dTdy_corner_neg

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

calculusp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1signal-timingtraffic-signals

Let μ>0\mu > 0μ>0, λ≥μ\lambda \ge \muλ≥μ, 0<η<10 < \eta < 10<η<1 and ξ+η>1\xi + \eta > 1ξ+η>1. Then the numerator of [∂T/∂y]ξ,η[\partial T/\partial y]_{\xi,\eta}[∂T/∂y]ξ,η​ satisfies

μη2−λξ2−2μη(1−ξ)=μ(η2−2η+2ξη)−λξ2=−μ{2η(1−η)+(ξ−η)2}−(λ−μ)ξ2,\mu\eta^2 - \lambda\xi^2 - 2\mu\eta(1-\xi) = \mu(\eta^2 - 2\eta + 2\xi\eta) - \lambda\xi^2 = -\mu\{2\eta(1-\eta) + (\xi-\eta)^2\} - (\lambda-\mu)\xi^2,μη2−λξ2−2μη(1−ξ)=μ(η2−2η+2ξη)−λξ2=−μ{2η(1−η)+(ξ−η)2}−(λ−μ)ξ2,

and consequently

[∂T∂y]ξ,η=μη2−λξ2−2μη(1−ξ)(ξ+η−1)2<0.\left[\frac{\partial T}{\partial y}\right]_{\xi,\eta} = \frac{\mu\eta^2 - \lambda\xi^2 - 2\mu\eta(1-\xi)}{(\xi+\eta-1)^2} < 0.[∂y∂T​]ξ,η​=(ξ+η−1)2μη2−λξ2−2μη(1−ξ)​<0.

The phases can always be labelled so that λ≥μ\lambda \ge \muλ≥μ; with that labelling, shortening the phase-2 effective red from the minimum cycle never helps, and only the sign of ∂T/∂x\partial T/\partial x∂T/∂x remains to be examined.

Formalization Note The page prints (ξ+η)2(\xi+\eta)^2(ξ+η)2 inside the braces; expanding μ(η2−2η+2ξη)−μξ2=−μ(2η−η2−2ξη+ξ2)\mu(\eta^2 - 2\eta + 2\xi\eta) - \mu\xi^2 = -\mu(2\eta - \eta^2 - 2\xi\eta + \xi^2)μ(η2−2η+2ξη)−μξ2=−μ(2η−η2−2ξη+ξ2) shows the correct term is (ξ−η)2(\xi-\eta)^2(ξ−η)2, which is what is stated. The strict inequality uses μ>0\mu > 0μ>0 and 0<η<10 < \eta < 10<η<1 (so that 2η(1−η)>02\eta(1-\eta) > 02η(1−η)>0) together with λ≥μ\lambda \ge \muλ≥μ.

Preamble
import Mathlib
import Definitions.Def_WardropTraffic_Signal_Setting
Formal statement
namespace WardropTraffic.Signal

theorem dTdy_corner_neg (lam mu xi eta : ℝ) (hmu : 0 < mu) (hlm : mu ≤ lam)
    (heta0 : 0 < eta) (heta1 : eta < 1) (hsum : 1 < xi + eta) :
    mu * eta ^ 2 - lam * xi ^ 2 - 2 * mu * eta * (1 - xi) =
        mu * (eta ^ 2 - 2 * eta + 2 * xi * eta) - lam * xi ^ 2 ∧
      mu * (eta ^ 2 - 2 * eta + 2 * xi * eta) - lam * xi ^ 2 =
        -mu * (2 * eta * (1 - eta) + (xi - eta) ^ 2) - (lam - mu) * xi ^ 2 ∧
      (mu * eta ^ 2 - lam * xi ^ 2 - 2 * mu * eta * (1 - xi)) / (xi + eta - 1) ^ 2 < 0 := by sorry

end WardropTraffic.Signal
Source
Wardrop, Some theoretical aspects of road traffic research, Proc. Instn Civ. Engrs Part II 1 (1952), p. 359, Appendix IV, first display and the paragraph "Suppose that λ ≥ μ"
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