Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (8.3) — the drift of the Lyapunov function in terms of the loads

Proved
KellyStochasticNetworks.alpha_fair_drift_identity

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

operations-researchstochastic-networksstochastic-systems

The Lyapunov function of Theorem 8.2 is

L(n)=∑rwrμr ρr−α nrα+1α+1,L(n) = \sum_r \frac{w_r}{\mu_r}\,\rho_r^{-\alpha}\,\frac{n_r^{\alpha+1}}{\alpha+1},L(n)=r∑​μr​wr​​ρr−α​α+1nrα+1​​,

whose partial derivative in nrn_rnr​ is (wr/μr)ρr−αnrα(w_r/\mu_r)\rho_r^{-\alpha}n_r^{\alpha}(wr​/μr​)ρr−α​nrα​. Since the flow count on route rrr has drift νr−μrnrxr(n)\nu_r - \mu_r n_r x_r(n)νr​−μr​nr​xr​(n) — arrivals at rate νr\nu_rνr​, departures at rate μrnrxr(n)\mu_r n_r x_r(n)μr​nr​xr​(n) — the chain rule gives the drift of LLL as

∑rwrμr ρr−α nrα(νr−μrnrxr(n)).\sum_r \frac{w_r}{\mu_r}\,\rho_r^{-\alpha}\,n_r^{\alpha}\bigl(\nu_r - \mu_r n_r x_r(n)\bigr).r∑​μr​wr​​ρr−α​nrα​(νr​−μr​nr​xr​(n)).

The identity to record is that this equals

∑rwr ρr−α nrα(ρr−nrxr(n)),\sum_r w_r\,\rho_r^{-\alpha}\,n_r^{\alpha}\bigl(\rho_r - n_r x_r(n)\bigr),r∑​wr​ρr−α​nrα​(ρr​−nr​xr​(n)),

where ρr=νr/μr\rho_r = \nu_r/\mu_rρr​=νr​/μr​ is the load on route rrr. Dividing through by μr\mu_rμr​ turns arrival rates into loads and departure rates into the aggregate rate Xr=nrxrX_r = n_r x_rXr​=nr​xr​, which is what puts the drift in the form the tangent-plane inequality can bound: the loads ρ\rhoρ and the aggregate rates XXX are then two points of the same feasible region.

Formalization Note The identity is deterministic arithmetic, one summand at a time; the approximation of the true drift by this expression, which the book flags as inexact for small nrn_rnr​, is not part of it. The load is introduced by its defining identity ρr=νr/μr\rho_r = \nu_r/\mu_rρr​=νr​/μr​ rather than substituted throughout, so the two sides read as the book writes them.

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

theorem alpha_fair_drift_identity {R : ℕ} (w n ν μ x : Fin R → ℝ) (α : ℝ)
    (hμ : ∀ r, 0 < μ r) (ρ : Fin R → ℝ) (hρ : ∀ r, ρ r = ν r / μ r) :
    (∑ r, (w r / μ r) * ρ r ^ (-α) * n r ^ α * (ν r - μ r * (n r * x r)))
      = ∑ r, w r * ρ r ^ (-α) * n r ^ α * (ρ r - n r * x r) := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 190 (PDF p. 198), equation (8.3): '(1/delta t) E[L(n(t+delta t)) - L(n(t)) | n(t)] approx sum_{r in R} (partial L / partial n_r) . (1/delta t) E[n_r(t+delta t) - n_r(t) | n(t)] = sum_r (w_r/mu_r) rho_r^{-alpha} n_r^alpha ( nu_r - mu_r n_r x_r(n(t)) ) = sum_r w_r rho_r^{-alpha} n_r^alpha ( rho_r - n_r x_r(n(t)) ). (8.3)' The Lyapunov function L(n) = sum_r (w_r/mu_r) rho_r^{-alpha} n_r^{alpha+1}/(alpha+1) is on the same page. 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