Equation (8.3) — the drift of the Lyapunov function in terms of the loads
ProvedKellyStochasticNetworks.alpha_fair_drift_identityThe Lyapunov function of Theorem 8.2 is
whose partial derivative in is . Since the flow count on route has drift — arrivals at rate , departures at rate — the chain rule gives the drift of as
The identity to record is that this equals
where is the load on route . Dividing through by turns arrival rates into loads and departure rates into the aggregate rate , which is what puts the drift in the form the tangent-plane inequality can bound: the loads and the aggregate rates 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 , is not part of it. The load is introduced by its defining identity rather than substituted throughout, so the two sides read as the book writes them.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Wardrop import Definitions.Def_KellyStochasticNetworks_Congestion import Definitions.Def_KellyStochasticNetworks_FlowLevel
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 KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.