Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The uncapacitated loss network: independent Poisson equilibrium

Proved
KellyStochasticNetworks.loss_network_uncapacitated

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

loss-networksmarkov-chainqueueing-theorystochastic-networks

Consider a loss network with fixed routing in which every link has infinite capacity, C1=⋯=CJ=∞C_1 = \dots = C_J = \inftyC1​=⋯=CJ​=∞. Arriving calls are then never blocked: a call on route rrr simply arrives at rate νr\nu_rνr​, stays for an exponentially distributed time of unit mean, and leaves. The state n=(nr)n = (n_r)n=(nr​) is a linear migration process with transition rates

q(n,T→rn)=νr,q(n,Tr→n)=nr,q(n, T^{\to r}n) = \nu_r, \qquad q(n, T^{r\to}n) = n_r,q(n,T→rn)=νr​,q(n,Tr→n)=nr​,

that is, the open migration process of Chapter 2 with λ≡0\lambda \equiv 0λ≡0, μ≡1\mu \equiv 1μ≡1 and φr(m)=m\varphi_r(m) = mφr​(m)=m.

Its equilibrium distribution is a product of independent Poisson distributions,

π(n)=∏re−νrνr nrnr!,\pi(n) = \prod_{r}e^{-\nu_r}\frac{\nu_r^{\,n_r}}{n_r!},π(n)=r∏​e−νr​nr​!νrnr​​​,

and the process is in fact reversible. Concretely, for νr>0\nu_r > 0νr​>0 this π\piπ satisfies the equilibrium equations for those rates, sums to 111 over Z+R\mathbb{Z}_+^{R}Z+R​, and satisfies the detailed balance equations.

Because the capacities are infinite the individual routes are independent, which is what makes the product form here elementary. Reversibility is the extra ingredient: it is what lets Lemma 3.4 be applied to the truncation of this process to the feasible set of a network with finite capacities, producing the exact equilibrium distribution (3.3).

Formalization Note The rates are written as the open migration rates published in mission II of this series, instantiated at λ≡0\lambda \equiv 0λ≡0, μ≡1\mu \equiv 1μ≡1, φr(m)=m\varphi_r(m) = mφr​(m)=m, so the claim is literally that this loss network is that migration process. The traffic equations (2.2) are then solved by αr=νr\alpha_r = \nu_rαr​=νr​, and gr=eνrg_r = e^{\nu_r}gr​=eνr​, so the first two conclusions are an instance of the product-form theorem of mission II; the third, detailed balance, is not and has to be checked directly.

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 loss_network_uncapacitated {R : ℕ} (ν : Fin R → ℝ) (hν : ∀ r, 0 < ν r) :
    FullBalance
        (fun n : Fin R → ℕ => ∏ r, Real.exp (-ν r) * (ν r ^ n r / (Nat.factorial (n r) : ℝ)))
        (openMigrationRates (fun _ _ => (0 : ℝ)) (fun _ => 1) ν (fun _ m => (m : ℝ)))
      ∧ HasSum
        (fun n : Fin R → ℕ => ∏ r, Real.exp (-ν r) * (ν r ^ n r / (Nat.factorial (n r) : ℝ))) 1
      ∧ DetailedBalance
        (fun n : Fin R → ℕ => ∏ r, Real.exp (-ν r) * (ν r ^ n r / (Nat.factorial (n r) : ℝ)))
        (openMigrationRates (fun _ _ => (0 : ℝ)) (fun _ => 1) ν (fun _ m => (m : ℝ))) := by sorry

end KellyStochasticNetworks
Source
Kelly & Yudovina, Stochastic Networks, CUP 2014, p. 53 (PDF p. 61): 'Consider a loss network with fixed routing for which C_1 = ... = C_J = infinity. ... This system is described by a linear migration process with transition rates q(n, T^{->r}n) = nu_r, q(n, T^{r->}n) = n_r, and equilibrium distribution prod_{r in R} e^{-nu_r} nu_r^{n_r}/n_r!, n in Z^R. (Since the capacities are infinite, the individual routes become independent.)' 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