Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exercise 1.7 — the mean number of circuits in use is ν(1−E(ν,C))\nu(1 - E(\nu,C))ν(1−E(ν,C))

Proved
KellyStochasticNetworks.erlang_mean_busy_circuits

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

markov-chainqueueing-theorystochastic-networksteletraffic

Consider the Erlang loss link with CCC circuits, arrival rate λ>0\lambda > 0λ>0 and holding-time parameter μ>0\mu > 0μ>0, and write ν=λ/μ\nu = \lambda/\muν=λ/μ for the traffic intensity. Let π=(π(j))j=0C\pi = (\pi(j))_{j=0}^{C}π=(π(j))j=0C​ be the equilibrium distribution, that is, a solution of the detailed balance equations for the link's transition rates with ∑j=0Cπ(j)=1\sum_{j=0}^{C} \pi(j) = 1∑j=0C​π(j)=1. Then the mean number of circuits in use is

∑j=0Cj π(j)=ν(1−E(ν,C)),\sum_{j=0}^{C} j\,\pi(j) = \nu\bigl(1 - E(\nu, C)\bigr),j=0∑C​jπ(j)=ν(1−E(ν,C)),

where E(ν,C)E(\nu,C)E(ν,C) is Erlang's formula.

The identity says that the carried traffic equals the offered traffic ν\nuν times the probability 1−E(ν,C)1 - E(\nu,C)1−E(ν,C) that an arriving call is not blocked, which is the conservation statement an operator uses to turn a measured circuit occupancy into an estimate of the offered load.

Formalization Note The sum is over the finite state space Fin (C + 1); the summand uses the underlying natural number of the index, cast to a real number.

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

theorem erlang_mean_busy_circuits (lam mu : ℝ) (C : ℕ) (hlam : 0 < lam) (hmu : 0 < mu)
    (π : Fin (C + 1) → ℝ) (h : DetailedBalance π (erlangRates lam mu C))
    (hsum : ∑ j, π j = 1) :
    ∑ j : Fin (C + 1), ((j : ℕ) : ℝ) * π j
      = (lam / mu) * (1 - erlang (lam / mu) C) := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 20 (PDF p. 28), Exercise 1.7: 'Show that the mean number of circuits in use in the model leading to Erlang's formula, i.e. the mean of the equilibrium distribution pi, is nu(1 - E(nu,C)).' 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