Exercise 1.8 — the derivative of Erlang's formula in the traffic intensity
ProvedKellyStochasticNetworks.erlang_derivErlang's formula
is a differentiable function of the traffic intensity , and for its derivative is
Since and , the right-hand side is positive: blocking increases with offered load. The identity is also the analytic form of the recursion by which is evaluated in practice, since it expresses the derivative at using only the values at and rather than the sums that define them.
Formalization Note The restriction is expressed by stating the result at
for an arbitrary natural number , so that never has to be interpreted by truncated
subtraction. Differentiability is asserted together with the value of the derivative, as a
single HasDerivAt statement at the point .
import Mathlib import Definitions.Def_KellyStochasticNetworks_Erlang
namespace KellyStochasticNetworks
theorem erlang_deriv (ν : ℝ) (C : ℕ) (hν : 0 < ν) :
HasDerivAt (fun v : ℝ => erlang v (C + 1))
(-(1 - erlang ν (C + 1)) * (erlang ν (C + 1) - erlang ν C)) ν := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.
Confirmed by the moderator at approval.