Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.3 — a Wardrop equilibrium exists

Proved
KellyStochasticNetworks.wardrop_equilibrium_exists

by naimengye · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithmic-game-theoryoperations-researchoptimizationstochastic-networks

Model a road network as a set of JJJ directed links. Routes are subsets of links, recorded by a link-route incidence matrix AAA with entries 000 and 111; each route rrr serves a single source–destination pair s(r)s(r)s(r); and fσ≥0f_\sigma \ge 0fσ​≥0 is the flow to be carried between pair σ\sigmaσ. Each link has a delay function DjD_jDj​, continuous and increasing, and the delay along route rrr at route flows xxx is ∑jDj(yj)Ajr\sum_j D_j(y_j)A_{jr}∑j​Dj​(yj​)Ajr​ with y=Axy = Axy=Ax.

Suppose every source–destination pair is served by at least one route. Then a Wardrop equilibrium exists: there is a feasible vector of route flows xxx — non-negative, with the flows on the routes serving σ\sigmaσ summing to fσf_\sigmafσ​ — such that

xr>0  ⟹  ∑jDj(yj)Ajr=min⁡r′∈s(r)∑jDj(yj)Ajr′.x_r > 0 \implies \sum_j D_j(y_j)A_{jr} = \min_{r' \in s(r)}\sum_j D_j(y_j)A_{jr'} .xr​>0⟹j∑​Dj​(yj​)Ajr​=r′∈s(r)min​j∑​Dj​(yj​)Ajr′​.

Every route actually carrying traffic is, in delay, a shortest route for the traffic it carries, so no driver has an incentive to switch.

Existence is what makes the model describe anything at all. It is not accompanied by a uniqueness claim — the equilibrium route flows need not be unique, though the link loads are — nor by any efficiency claim: Braess's paradox says the equilibrium can be worse for everyone than a routing pattern that a planner could impose.

Formalization Note The two hypotheses beyond the model are exactly what make the feasible set non-empty: each flow requirement is non-negative, and each source–destination pair is served by some route. The equilibrium condition is written as an inequality against every route serving the same pair, which is the displayed minimum with the minimum written out. Delay functions are total and monotone in the weak sense, which excludes the vertical asymptote that Figure 4.5 permits.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
Formal statement
namespace KellyStochasticNetworks

theorem wardrop_equilibrium_exists {J R Sd : ℕ} (A : Fin J → Fin R → ℝ) (s : Fin R → Fin Sd)
    (D : Fin J → ℝ → ℝ) (f : Fin Sd → ℝ)
    (hA : ∀ j r, A j r = 0 ∨ A j r = 1)
    (hD : ∀ j, Continuous (D j)) (hmono : ∀ j, Monotone (D j))
    (hf : ∀ σ, 0 ≤ f σ) (hserved : ∀ σ, ∃ r, s r = σ) :
    ∃ x : Fin R → ℝ, IsWardropEquilibrium A s D f x := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, pp. 96-97 (PDF pp. 104-105), Definition 4.2 and Theorem 4.3: 'Definition 4.2 A Wardrop equilibrium is a vector of flows along routes x = (x_r, r in R) such that x_r > 0 => sum_{j in J} D_j(y_j) A_{jr} = min_{r' in s(r)} sum_{j in J} D_j(y_j) A_{jr'}, where y = Ax. From our definition, it is not clear that a Wardrop equilibrium exists and how many of them there are. We will now show the existence of a Wardrop equilibrium, by exhibiting an alternative characterization of it. Theorem 4.3 A Wardrop equilibrium exists.' sha256 ec271d555059aee58613e5e9a98b8346214b16185c527314f5d94c1ac8b17b6a
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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