Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4, p. 135 — uniqueness of the equilibrium distribution (under bounded arrival rates)

Proved
JacksonJobshop.Equilibrium.equilibrium_unique

by mikedeng1 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

p2o-batch-p100bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueing-theorystationary-distribution

Let (N,L,M,R)(N, L, M, R)(N,L,M,R) be a jobshop-like queueing system satisfying Assumptions (2.1)–(2.4), and suppose its arrival rates are bounded: there is Λ\LambdaΛ with λ(K)≤Λ\lambda(K) \le \Lambdaλ(K)≤Λ for all KKK. Then the system has at most one equilibrium state probability distribution: if qqq and q′q'q′ are probability distributions over state vectors that are both constant solutions of the balance equations (3.1), then

q=q′.q = q'.q=q′.

Together with existence, this is what makes "the" equilibrium distribution of Theorem (4.5) well defined.

Formalization Note The paper asserts uniqueness without proof, citing a limit theorem for regular processes; we state uniqueness under bounded arrival rates, which holds for every example in the paper. Bounded arrival rates make the underlying Markov process non-explosive; without such a condition the model admits explosive systems with π>0\pi > 0π>0 (e.g. N=1N = 1N=1, λ(K)=4K\lambda(K) = 4^Kλ(K)=4K, μ(1,k)=2⋅4k−1\mu(1, k) = 2\cdot 4^{k-1}μ(1,k)=2⋅4k−1), for which the paper's cited argument does not apply. Equations (3.1) are taken with the arrival-outflow coefficient λ(S(kˉ))∑nr(0,n)\lambda(S(\bar k))\sum_n r(0, n)λ(S(kˉ))∑n​r(0,n) (see the system definition).

Preamble
import Mathlib
import Definitions.Def_JacksonJobshop_Equilibrium_System
Formal statement
namespace JacksonJobshop.Equilibrium

/-- Jackson (1963), p. 135, §4 opening paragraph: an equilibrium state probability distribution,
if it exists, is unique. Stated under bounded arrival rates `λ(K) ≤ Λ` (an added hypothesis:
the paper asserts uniqueness without proof, citing a limit theorem for regular processes). -/
theorem equilibrium_unique {N : ℕ} (sys : JobshopSystem N)
    (hbdd : ∃ Λ : ℝ, ∀ K, sys.lam K ≤ Λ) :
    ∀ q q' : (Fin N → ℕ) → ℝ, IsEquilibrium sys q → IsEquilibrium sys q' → q = q' := by sorry

end JacksonJobshop.Equilibrium
Source
Jackson, Jobshop-Like Queueing Systems, Management Science 10(1) (1963), p. 135, §4, opening paragraph ('If such a distribution exists, it is unique'), with footnote 5, p. 136
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Setting. Take any NNN and any jobshop system (λ,μ,r,e)(\lambda,\mu,r,e)(λ,μ,r,e) with NNN centers. Its assumptions are:

  • N>0N>0N>0;
  • λ(K)>0\lambda(K)>0λ(K)>0 for all KKK, or λ\lambdaλ is positive up to some K0K_0K0​ and zero after it;
  • μ(n,0)=0\mu(n,0)=0μ(n,0)=0 and μ(n,k)>0\mu(n,k)>0μ(n,k)>0 for k≥1k\ge1k≥1;
  • rrr is non-negative, and each row sums to 111 over targets 1..N,N+11..N,N+11..N,N+1;
  • e≥0e\ge0e≥0 is the unique solution of e(n)=r(0,n)+∑me(m)r(m,n)e(n)=r(0,n)+\sum_m e(m)r(m,n)e(n)=r(0,n)+∑m​e(m)r(m,n).

Hypothesis. There is a real Λ\LambdaΛ with λ(K)≤Λ\lambda(K)\le\Lambdaλ(K)≤Λ for all KKK.

Equilibrium. A real function qqq on NN\mathbb N^NNN is an equilibrium if all of the following hold:

  • q≥0q\ge0q≥0;
  • (q(k))k(q(k))_k(q(k))k​ is summable with sum exactly 111;
  • at every kkk, the following balance equation holds:
0=−(λ(S(k))∑nr(0,n)+∑nμ(n,kn)(1−r(n,n)))q(k)+∑kn>0λ(S(k)−1)r(0,n)q(k−δn)+∑nμ(n,kn+1)r(n,N+1)q(k+δn)+∑m≠n, km>0μ(n,kn+1)r(n,m)q(k−δm+δn).0=-\Big(\lambda(S(k))\sum_n r(0,n)+\sum_n\mu(n,k_n)(1-r(n,n))\Big)q(k)+\sum_{k_n>0}\lambda(S(k)-1)r(0,n)q(k-\delta_n)+\sum_n\mu(n,k_n+1)r(n,N+1)q(k+\delta_n)+\sum_{m\ne n,\,k_m>0}\mu(n,k_n+1)r(n,m)q(k-\delta_m+\delta_n).0=−(λ(S(k))n∑​r(0,n)+n∑​μ(n,kn​)(1−r(n,n)))q(k)+kn​>0∑​λ(S(k)−1)r(0,n)q(k−δn​)+n∑​μ(n,kn​+1)r(n,N+1)q(k+δn​)+m=n,km​>0∑​μ(n,kn​+1)r(n,m)q(k−δm​+δn​).

Claim. Any two equilibria q,q′q,q'q,q′ are equal at every state. The statement does not assert that an equilibrium exists.

Degenerate cases. If no equilibrium exists, the claim is vacuous. The boundedness hypothesis is automatically satisfied when λ\lambdaλ is zero beyond some K0K_0K0​, because λ\lambdaλ then takes only finitely many nonzero values. It is a real restriction only in the case where λ\lambdaλ is positive everywhere.

Human review
  • Endorsed by Shuze Chen · Sep 27, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Sep 27, 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