Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The integral of an increasing delay function is convex

Proved
KellyStochasticNetworks.wardrop_objective_convex

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

analysisconvex-optimizationstochastic-networks

Let D:R→RD : \mathbb{R}\to\mathbb{R}D:R→R be continuous and increasing. Then

y  ⟼  ∫0yD(u) duy \;\longmapsto\; \int_0^{y} D(u)\,duy⟼∫0y​D(u)du

is a convex function on R\mathbb{R}R.

This is the analytic fact behind the proof of Theorem 4.3. The objective of the optimization problem whose solutions are the Wardrop equilibria is ∑j∫0yjDj(u) du\sum_j \int_0^{y_j}D_j(u)\,du∑j​∫0yj​​Dj​(u)du; since each link's delay function is increasing, each summand is convex in the link flow yjy_jyj​, and since y=Axy = Axy=Ax is linear in the route flows the whole objective is convex in xxx. Convexity on a compact feasible region is what delivers an optimum and lets the Lagrangian characterization be read off.

Note what is not assumed: DDD need not be convex, and the book explicitly declines to assume it. Monotonicity alone gives convexity of the integral, because the integral's derivative is DDD itself.

Formalization Note "Increasing" is taken in the weak sense, so a delay function that is flat on an interval is allowed; this is the weaker hypothesis and the one the argument needs. Convexity is asserted on the whole real line rather than on the non-negative half, which is where flows live; the stronger statement is true and avoids carrying a domain restriction through the composition with y=Axy = Axy=Ax.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
Formal statement
namespace KellyStochasticNetworks

theorem wardrop_objective_convex (D : ℝ → ℝ) (hD : Continuous D) (hmono : Monotone D) :
    ConvexOn ℝ Set.univ (fun y : ℝ => ∫ u in (0:ℝ)..y, D u) := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 97 (PDF p. 105), in the proof of Theorem 4.3: 'The feasible region is convex and compact, and the objective function is differentiable and convex (because D_j is an increasing, continuous function). Thus, an optimum exists and can be found by Lagrangian techniques.' The objective is sum_j int_0^{y_j} D_j(u) du. 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