Exercise 8.3 — the derivative is for every
ProvedKellyStochasticNetworks.alpha_fair_derivThe weighted -fair objective is defined by two formulas, one for and one for :
Exercise 8.3 observes that this is a single family, because the derivative has the same form in both cases. For , positive weights, positive flow counts and a positive rate vector,
This is why is the natural continuation of the family rather than a separate case stapled on: the singularity in at is removable once a constant is absorbed, and the derivative never notices it. It is also the formula the stability argument uses, through the tangent-plane inequality, where the same expression appears for every at once.
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. The claim covers the defined-by-cases objective, so proving it means handling both branches and checking they agree.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Wardrop import Definitions.Def_KellyStochasticNetworks_Congestion import Definitions.Def_KellyStochasticNetworks_FlowLevel
namespace KellyStochasticNetworks
theorem alpha_fair_deriv {R : ℕ} (w n : Fin R → ℝ) (α : ℝ) (hα : 0 < α)
(hw : ∀ r, 0 < w r) (hn : ∀ r, 0 < n r) (X : Fin R → ℝ) (hX : ∀ r, 0 < X r) (r : Fin R) :
HasDerivAt (fun t : ℝ => alphaFairObjective w n α (Function.update X r t))
(w r * n r ^ α * X r ^ (-α)) (X r) := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.