Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The equilibrium distribution of the Erlang loss link

Proved
KellyStochasticNetworks.erlang_link_equilibrium

by naimengye · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

markov-chainqueueing-theorystochastic-networksteletraffic

Consider the Erlang loss link with CCC parallel circuits, calls arriving at rate λ>0\lambda > 0λ>0 and holding times exponential of parameter μ>0\mu > 0μ>0, whose transition rates on the state space {0,1,…,C}\{0,1,\dots,C\}{0,1,…,C} are

q(j,j+1)=λ(j<C),q(j,j−1)=jμ(j≥1).q(j,j+1) = \lambda \quad (j < C), \qquad q(j,j-1) = j\mu \quad (j \ge 1).q(j,j+1)=λ(j<C),q(j,j−1)=jμ(j≥1).

If a collection of numbers π=(π(j))j=0C\pi = (\pi(j))_{j=0}^{C}π=(π(j))j=0C​ satisfies the detailed balance equations for these rates, then for every state jjj

π(j)=(λ/μ)jj! π(0).\pi(j) = \frac{(\lambda/\mu)^{j}}{j!}\,\pi(0).π(j)=j!(λ/μ)j​π(0).

This is the solution of the detailed balance recursion on p. 18 of the book. It determines the equilibrium distribution up to the single unknown π(0)\pi(0)π(0), which the normalization ∑jπ(j)=1\sum_{j} \pi(j) = 1∑j​π(j)=1 then fixes. No normalization is assumed here, so the statement applies to any solution of the detailed balance equations, normalized or not.

Formalization Note The state space is Fin (C + 1) and the exponent jjj is the underlying natural number of that index, so the factorial is the ordinary factorial of a natural number.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Balance
import Definitions.Def_KellyStochasticNetworks_Erlang
Formal statement
namespace KellyStochasticNetworks

theorem erlang_link_equilibrium (lam mu : ℝ) (C : ℕ) (hlam : 0 < lam) (hmu : 0 < mu)
    (π : Fin (C + 1) → ℝ) (h : DetailedBalance π (erlangRates lam mu C)) (j : Fin (C + 1)) :
    π j = (lam / mu) ^ (j : ℕ) / (Nat.factorial (j : ℕ) : ℝ) * π 0 := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 18 (PDF p. 26): 'We try to solve the detailed balance equations: pi(j-1) q(j-1,j) = pi(j) q(j,j-1) => pi(j) = (lambda / (mu j)) pi(j-1) = ... = (lambda/mu)^j (1/j!) pi(0).' sha256 ec271d555059aee58613e5e9a98b8346214b16185c527314f5d94c1ac8b17b6a
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me