Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Erlang's formula and the utilization are strictly increasing in the offered load

Proved
KellyStochasticNetworks.erlang_strictMono

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

analysisloss-networksstochastic-networksteletraffic

Let E(ν,C)E(\nu, C)E(ν,C) be Erlang's formula, the blocking probability of a link with CCC circuits offered traffic of intensity ν\nuν. For C≥1C \ge 1C≥1, both

ν↦E(ν,C)andν↦ν(1−E(ν,C))\nu \mapsto E(\nu, C) \qquad\text{and}\qquad \nu \mapsto \nu\bigl(1 - E(\nu,C)\bigr)ν↦E(ν,C)andν↦ν(1−E(ν,C))

are strictly increasing on ν>0\nu > 0ν>0. 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 U(y,C)U(y, C)U(y,C) defined there by the implicit relation U(−log⁡(1−E(ν,C)),C)=ν(1−E(ν,C))U(-\log(1 - E(\nu,C)), C) = \nu(1 - E(\nu,C))U(−log(1−E(ν,C)),C)=ν(1−E(ν,C)) is the utilization expressed in terms of y=−log⁡(1−E)y = -\log(1-E)y=−log(1−E); that UUU is well defined and strictly increasing in yyy is exactly these two monotonicities, and it is what makes ∫0yU(z,C) dz\int_0^y U(z,C)\,dz∫0y​U(z,C)dz strictly convex and hence the revised dual problem (3.8) uniquely solvable.

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. It cannot be dropped: E(ν,0)=1E(\nu, 0) = 1E(ν,0)=1 identically, so at C=0C = 0C=0 both functions are constant. Strict monotonicity is asserted on the open half-line ν>0\nu > 0ν>0.

Preamble
import Mathlib
import Definitions.Def_KellyStochasticNetworks_Balance
import Definitions.Def_KellyStochasticNetworks_Erlang
import Definitions.Def_KellyStochasticNetworks_Migration
import Definitions.Def_KellyStochasticNetworks_LossNetwork
Formal statement
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 KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 68 (PDF p. 76), in the proof of Theorem 3.20: 'As both the utilization nu(1 - E(nu,C)) and the blocking probability E(nu,C) are strictly increasing functions of nu, the function U(y,C) is a strictly increasing function of y. Therefore, the function int_0^y U(z,C) dz is a strictly convex function of y.' The utilization is Exercise 1.7, p. 20. 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 mikedeng1 · Oct 7, 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