Theorem 7.6 (proof) — the partial derivative of the Lyapunov function
ProvedKellyStochasticNetworks.primal_utility_derivFor the Lyapunov function
with each continuous, and for any in the positive orthant, the partial derivative in the -th coordinate is
Two things follow, and both are used in the proof of Theorem 7.6. Setting these derivatives to zero identifies the maximizer of , since is strictly concave. And the resulting stationarity condition is, after multiplying by , exactly the condition that the right-hand side of the primal algorithm (7.5) vanishes — so the maximizer of is an equilibrium point of the dynamics.
The derivative of the second term is where the fundamental theorem of calculus enters: the load on resource depends on with coefficient , so differentiating returns , and summing over gives the sum over the resources of route .
Formalization Note The partial derivative is stated as an ordinary derivative in the -th coordinate, with the others held fixed, so no partial-derivative API is presupposed. Continuity of is what makes differentiable with derivative .
import Mathlib import Definitions.Def_KellyStochasticNetworks_Wardrop import Definitions.Def_KellyStochasticNetworks_Congestion
namespace KellyStochasticNetworks
theorem primal_utility_deriv {J R : ℕ} (A : Fin J → Fin R → ℝ) (w : Fin R → ℝ)
(p : Fin J → ℝ → ℝ) (hA : ∀ j r, A j r = 0 ∨ A j r = 1)
(hp : ∀ j, Continuous (p j)) (x : Fin R → ℝ) (hx : ∀ r, 0 < x r) (r : Fin R) :
HasDerivAt (fun t : ℝ => primalUtility A w p (Function.update x r t))
(w r / x r - ∑ j, A j r * p j (linkFlow A x j)) (x r) := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.