Erlang's formula and the utilization are strictly increasing in the offered load
ProvedKellyStochasticNetworks.erlang_strictMonoLet be Erlang's formula, the blocking probability of a link with circuits offered traffic of intensity . For , both
are strictly increasing on . The second is the utilization, the mean number of circuits in use, by Exercise 1.7.
Both statements are used in the proof of Theorem 3.20. The function defined there by the implicit relation is the utilization expressed in terms of ; that is well defined and strictly increasing in is exactly these two monotonicities, and it is what makes strictly convex and hence the revised dual problem (3.8) uniquely solvable.
Formalization Note The restriction is expressed by stating the result at for an arbitrary natural number . It cannot be dropped: identically, so at both functions are constant. Strict monotonicity is asserted on the open half-line .
import Mathlib import Definitions.Def_KellyStochasticNetworks_Balance import Definitions.Def_KellyStochasticNetworks_Erlang import Definitions.Def_KellyStochasticNetworks_Migration import Definitions.Def_KellyStochasticNetworks_LossNetwork
namespace KellyStochasticNetworks
theorem erlang_strictMono (C : ℕ) :
StrictMonoOn (fun ν : ℝ => erlang ν (C + 1)) (Set.Ioi 0)
∧ StrictMonoOn (fun ν : ℝ => ν * (1 - erlang ν (C + 1))) (Set.Ioi 0) := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.