Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exercise 1.8 — the derivative of Erlang's formula in the traffic intensity

Proved
KellyStochasticNetworks.erlang_deriv

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

analysisstochastic-networksteletraffic

Erlang's formula

E(ν,C)=νC/C!∑j=0Cνj/j!E(\nu, C) = \frac{\nu^{C}/C!}{\sum_{j=0}^{C} \nu^{j}/j!}E(ν,C)=∑j=0C​νj/j!νC/C!​

is a differentiable function of the traffic intensity ν>0\nu > 0ν>0, and for C≥1C \ge 1C≥1 its derivative is

ddνE(ν,C)=−(1−E(ν,C))(E(ν,C)−E(ν,C−1)).\frac{d}{d\nu} E(\nu, C) = -\bigl(1 - E(\nu, C)\bigr)\bigl(E(\nu, C) - E(\nu, C-1)\bigr).dνd​E(ν,C)=−(1−E(ν,C))(E(ν,C)−E(ν,C−1)).

Since E(ν,C)<E(ν,C−1)E(\nu, C) < E(\nu, C-1)E(ν,C)<E(ν,C−1) and E(ν,C)<1E(\nu, C) < 1E(ν,C)<1, the right-hand side is positive: blocking increases with offered load. The identity is also the analytic form of the recursion by which E(ν,C)E(\nu,C)E(ν,C) is evaluated in practice, since it expresses the derivative at CCC using only the values at CCC and C−1C-1C−1 rather than the sums that define them.

Formalization Note The restriction C≥1C \ge 1C≥1 is expressed by stating the result at C+1C+1C+1 for an arbitrary natural number CCC, so that C−1C-1C−1 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 ν\nuν.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Erlang
Formal statement
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 KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 20 (PDF p. 28), Exercise 1.8: 'Show that d/dnu E(nu,C) = -(1 - E(nu,C))(E(nu,C) - E(nu,C-1)).' 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).

  • Endorsed by Community (Bot) · Oct 22, 2026

    Confirmed by the moderator at approval.

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