Theorem (4.5) — if , the equilibrium distribution is (uniqueness under bounded arrival rates)
ProvedJacksonJobshop.Equilibrium.equilibrium_distributionLet be a jobshop-like queueing system with service centers satisfying Assumptions (2.1)–(2.4): arrival rates as in (2.1), service rates with and for , routing probabilities forming a probability distribution in for each , and a unique, non-negative solution of the traffic equations . Let
and if the sum converges, otherwise.
Theorem (4.5). If , then
is an equilibrium state probability distribution of the system: a probability distribution over state vectors that is a constant solution of the balance equations (3.1). If moreover the arrival rates are bounded, it is the only one.
The theorem gives the long-run distribution of queue lengths in an open network with state-dependent arrival and service rates in closed product form; the classical Jackson network with Poisson arrivals is its constant-arrival-rate case.
Formalization Note (i) The paper prints as the arrival-outflow coefficient in (3.1); this is inconsistent with its own transition probabilities on p. 134 whenever , and we use , which is the equation those transition probabilities give. (ii) 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. Existence and the formula (4.6) carry no extra hypothesis. (iii) An equilibrium is defined from the balance equations for an arbitrary function on state vectors, never from (4.6).
import Mathlib import Definitions.Def_JacksonJobshop_Equilibrium_System
namespace JacksonJobshop.Equilibrium
/-- Jackson (1963), p. 136, Theorem (4.5): if `π > 0`, then (4.6) `p(k) = π w(k) W(S(k))` is an
equilibrium state probability distribution of System (N, L, M, R) (with (3.1)'s arrival outflow
read as `λ(S(k)) Σ_n r(0, n)`), and, when the arrival rates are bounded, it is the only one. -/
theorem equilibrium_distribution {N : ℕ} (sys : JobshopSystem N) (hπ : 0 < piConst sys) :
IsEquilibrium sys (productForm sys) ∧
((∃ Λ : ℝ, ∀ K, sys.lam K ≤ Λ) →
∀ q : (Fin N → ℕ) → ℝ, IsEquilibrium sys q → q = productForm sys) := by sorry
end JacksonJobshop.Equilibrium
Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
The statement is about a system sys of type , where is a natural number. The system is implicit: it is fixed by the type of sys. A state is a function , that is, one natural number for each of the indices. Write for the set of all states.
The statement uses four objects from the imported bundle Definitions.Def_JacksonJobshop_Equilibrium_System. That file's code was not supplied, so this read-back cannot expand them. Their meaning, and therefore the content of the theorem, depends entirely on those definitions:
- (
piConst sys) is a real number attached to the system. - (
sys.lam) is a real-valued field of the system, evaluated at arguments . The type of is fixed by that field's declaration and is not visible here. - (
productForm sys) is a function . Its type is forced because the statement compares it for equality with such a function. - (
IsEquilibrium sys q) is a property of a real-valued function on states. The code does not show whether it includes nonnegativity, summing to , or any balance equations.
The doc comment gives an informal reading: Jackson (1963), Theorem (4.5), with . It is a comment, not part of what the code asserts.
Hypothesis. The only hypothesis is
Conclusion. Under that hypothesis, both of the following hold.
- Existence. satisfies .
- Conditional uniqueness. Suppose there is a real number with for every . (This is an upper bound only; no lower bound or positivity is assumed.) Then every function satisfying is equal to as a function:
The uniqueness is over all real-valued , with no normalization or sign condition beyond whatever itself imposes. If is preserved under scaling, the claim therefore rules out every multiple with .
Without a bound on , the statement says nothing about uniqueness.
Degenerate cases.
- . There is exactly one state, the empty function. and are then single real numbers, and uniqueness says every satisfying equals that one value.
- Empty domain of . If the arguments range over an empty type, the boundedness condition holds automatically. The same happens whenever is bounded above for any other reason.
- Whether the hypothesis can hold. This depends on how is defined, which is not visible. If it is built from a division or an infinite sum, the default values apply. Division by zero returns , and so does a non-summable series. In such systems would fail and the theorem would say nothing about them. If can never hold, the theorem is vacuous.
- Default values in and . Any default values inside these definitions (for example, subtraction truncating at , division by zero, or sums of non-summable series) carry over into the claim unchanged. From the code shown, it cannot be determined whether they arise.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.