Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (4.22) — the marginal distribution at the last node via Buzen's functions

Proved
QueueingFundamentals.Networks.last_node_marginal

by mikedeng1 · Oct 3, 2026 · Mathlib 0df444a (Lean v4.33.1)

buzen-algorithmclosed-networkmarginal-distributionp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueing

Consider a closed network of kkk nodes with ci≥1c_i \ge 1ci​≥1 servers at node iii and ρi>0\rho_i > 0ρi​>0, whose NNN-customer joint distribution is the product form (4.17),

pn1,…,nk=1G(N)∏i=1kfi(ni),fi(n)=ρi nai(n),p_{n_1,\dots,n_k} = \frac{1}{G(N)}\prod_{i=1}^{k} f_i(n_i), \qquad f_i(n) = \frac{\rho_i^{\,n}}{a_i(n)},pn1​,…,nk​​=G(N)1​i=1∏k​fi​(ni​),fi​(n)=ai​(n)ρin​​,

with G(N)G(N)G(N) and gmg_mgm​ as in (4.19)–(4.20). Then the marginal distribution pk(n)=Pr⁡{Nk=n}p_k(n) = \Pr\{N_k = n\}pk​(n)=Pr{Nk​=n} of the number of customers at the last node kkk is

pk(n)=fk(n) gk−1(N−n)G(N)(n=0,1,…,N).p_k(n) = \frac{f_k(n)\, g_{k-1}(N - n)}{G(N)} \qquad (n = 0, 1, \dots, N).pk​(n)=G(N)fk​(n)gk−1​(N−n)​(n=0,1,…,N).

Together with Buzen's recursion this yields a node's marginal distribution without summing over the joint distribution; any node can be made the last one by relabelling.

Formalization Note The network has k+1k+1k+1 nodes in Lean (Fin (k + 1)), the last one being Fin.last k, so the book's gk−1g_{k-1}gk−1​ is gBuzen … k.

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_Networks_ClosedJackson
Formal statement
namespace QueueingFundamentals.Networks

/-- Eq. (4.22), p.199: in a closed network of `k + 1` nodes (the last node is node `k + 1` of the book,
index `Fin.last k`) with `c_i ≥ 1` servers at node `i` and `ρ_i > 0`, under the product form (4.17)
the marginal distribution of the last node is `p_{k+1}(n) = f_{k+1}(n) g_k(N − n) / G(N)` for
`n = 0, 1, …, N`. -/
theorem last_node_marginal {k : ℕ} (rho : Fin (k + 1) → ℝ) (c : Fin (k + 1) → ℕ)
    (hrho : ∀ i, 0 < rho i) (hc : ∀ i, 1 ≤ c i) (N n : ℕ) (hn : n ≤ N) :
    marginal N (productForm (buzenFactor rho c) N) (Fin.last k) n =
      buzenFactor rho c (Fin.last k) n * gBuzen (buzenFactor rho c) k (Nat.le_succ k) (N - n) /
        normConst (buzenFactor rho c) N := by sorry

end QueueingFundamentals.Networks
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.199, Eq. (4.22)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 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