Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 7.6 (proof) — the Lyapunov function is strictly concave

Proved
KellyStochasticNetworks.primal_utility_strictConcave

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

control-theoryconvex-optimizationstochastic-networks

Let

U(x)=∑rwrlog⁡xr−∑j∫0∑s:j∈sxspj(y) dyU(x)=\sum_r w_r\log x_r-\sum_j\int_0^{\sum_{s:j\in s}x_s}p_j(y)\,dyU(x)=r∑​wr​logxr​−j∑​∫0∑s:j∈s​xs​​pj​(y)dy

with wr>0w_r>0wr​>0 and each pjp_jpj​ non-negative, continuous and increasing. Then UUU is strictly concave on the open positive orthant.

Both terms contribute. The first is a positive combination of logarithms, strictly concave in each coordinate. The second is the negative of a sum of functions y↦∫0ypjy\mapsto\int_0^{y}p_jy↦∫0y​pj​, each convex because pjp_jpj​ is increasing, composed with the linear map x↦Axx\mapsto Axx↦Ax; a convex function of a linear map is convex, so its negative is concave. Strict concavity of the first term survives the addition.

This is the first sentence of the proof of Theorem 7.6, and it does two jobs: it makes the maximizer unique, and, with the growth of −∫0ypj-\int_0^{y}p_j−∫0y​pj​, it makes the sublevel sets of UUU compact, which is what the convergence argument needs to confine the trajectory.

Formalization Note "Increasing" is taken weakly, which is all the convexity of the integral needs and is the weaker hypothesis. Strict concavity is asserted on the open positive orthant, a convex set, which is where log⁡xr\log x_rlogxr​ is meaningful.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Wardrop
import Definitions.Def_KellyStochasticNetworks_Congestion
Formal statement
namespace KellyStochasticNetworks

theorem primal_utility_strictConcave {J R : ℕ} (A : Fin J → Fin R → ℝ) (w : Fin R → ℝ)
    (p : Fin J → ℝ → ℝ) (hA : ∀ j r, 0 ≤ A j r) (hw : ∀ r, 0 < w r)
    (hp : ∀ j, Continuous (p j)) (hpmono : ∀ j, Monotone (p j)) (hpnn : ∀ j y, 0 ≤ p j y) :
    StrictConcaveOn ℝ {x : Fin R → ℝ | ∀ r, 0 < x r} (primalUtility A w p) := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 164 (PDF p. 172), in the proof of Theorem 7.6: 'The assumptions on w_r > 0, r in R, and p_j(.), j in J, ensure that U(.) is strictly concave with a maximum that is interior to the positive orthant; the maximizing value of x is thus unique.' 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