Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Appendix IV, p. 358 — if ∂T/∂x < 0 and ∂T/∂y < 0 at (ξ, η), the minimum cycle minimizes T

Proved
WardropTraffic.Signal.corner_min_of_neg_partials

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

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

Let λ>0\lambda > 0λ>0, μ>0\mu > 0μ>0 and ξ+η>1\xi + \eta > 1ξ+η>1, let T(x,y)=(λx2+μy2)/(x+y−1)T(x,y) = (\lambda x^2 + \mu y^2)/(x+y-1)T(x,y)=(λx2+μy2)/(x+y−1), and let the feasible region be F={(x,y):x≤ξ, y≤η, x+y>1}F = \{(x,y) : x \le \xi,\ y \le \eta,\ x + y > 1\}F={(x,y):x≤ξ, y≤η, x+y>1}. Suppose that both partial derivatives of TTT at (ξ,η)(\xi,\eta)(ξ,η) are negative, that is,

λξ2−μη2−2λξ(1−η)<0andμη2−λξ2−2μη(1−ξ)<0.\lambda\xi^2 - \mu\eta^2 - 2\lambda\xi(1-\eta) < 0 \quad\text{and}\quad \mu\eta^2 - \lambda\xi^2 - 2\mu\eta(1-\xi) < 0.λξ2−μη2−2λξ(1−η)<0andμη2−λξ2−2μη(1−ξ)<0.

Then (ξ,η)(\xi, \eta)(ξ,η) minimizes TTT over FFF:

T(ξ,η)≤T(x,y)for all (x,y)∈F.T(\xi,\eta) \le T(x,y) \qquad \text{for all } (x,y) \in F.T(ξ,η)≤T(x,y)for all (x,y)∈F.

From (ξ,η)(\xi,\eta)(ξ,η) the only admissible changes of xxx and yyy are reductions; this result says that when both reductions increase the delay, the minimum cycle is the optimum cycle.

Formalization Note The two derivatives are written through their numerators, which carry their sign since the denominator (ξ+η−1)2(\xi+\eta-1)^2(ξ+η−1)2 is positive. The conclusion is global minimality over the whole feasible region, which is what the page asserts ("TTT is minimum when x=ξx = \xix=ξ, y=ηy = \etay=η").

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

theorem corner_min_of_neg_partials (lam mu xi eta : ℝ) (hlam : 0 < lam) (hmu : 0 < mu)
    (hsum : 1 < xi + eta)
    (hx : lam * xi ^ 2 - mu * eta ^ 2 - 2 * lam * xi * (1 - eta) < 0)
    (hy : mu * eta ^ 2 - lam * xi ^ 2 - 2 * mu * eta * (1 - xi) < 0) :
    ∀ z ∈ feasibleXY xi eta, delayT lam mu xi eta ≤ delayT lam mu z.1 z.2 := by sorry

end WardropTraffic.Signal
Source
Wardrop, Some theoretical aspects of road traffic research, Proc. Instn Civ. Engrs Part II 1 (1952), p. 358, Appendix IV, last paragraph
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