Theorem 3.20 — existence and uniqueness of the Erlang fixed point
ProvedKellyStochasticNetworks.erlang_fixed_point_uniqueConsider a loss network with links and routes: link carries circuits, a call on route requires circuits from link , and calls on route arrive at rate . The Erlang fixed point equations are
where is Erlang's formula. Then there is exactly one vector satisfying them.
The equations are the reduced-load approximation: pretend the links block independently, so that the traffic offered to link is the traffic on the routes through , thinned by the blocking probability of every other link each route uses, and then apply Erlang's formula link by link. The factor removes link 's own thinning from the product. This approximation is what practitioners compute, and the theorem is what makes "the Erlang fixed point" a well-formed phrase: repeated substitution, or a damped iteration, converges to a vector that does not depend on where it started.
Existence is a short argument: the right-hand side defines a continuous map of the compact convex cube into itself, so Brouwer's theorem applies. Uniqueness is the substance, and the book obtains it by rewriting (3.7) as the stationary conditions of a strictly convex minimization, the revised dual problem (3.8).
Formalization Note The incidence matrix has non-negative integer entries, which is the general case of section 3.3 rather than only the – case. The hypothesis is needed for the statement to mean anything: a link with no circuits has identically, and the factor would then be a division by zero. Under no solution has , so the quotient is taken at a non-zero denominator throughout.
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_fixed_point_unique {J R : ℕ} (A : Fin J → Fin R → ℕ) (ν : Fin R → ℝ)
(C : Fin J → ℕ) (hν : ∀ r, 0 < ν r) (hC : ∀ j, 1 ≤ C j) :
∃! E : Fin J → ℝ, (∀ j, E j ∈ Set.Icc (0 : ℝ) 1) ∧ ErlangFixedPoint A ν C E := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.
Confirmed by the moderator at approval.