Theorem 3.1 — the open network of §3.1 has equilibrium distribution
ProvedKellyReversibility.Networks.open_network_equilibriumConsider an open network of queues with customer types as in Section 3.1: type- customers arrive in a Poisson stream of rate and follow the route (no two successive stages at the same queue); queue supplies service effort when it holds customers, a proportion of it to position , and an arriving customer takes position with probability . Let be the transition rates (3.2), (3.4), (3.6) of the state , and let , , , be as on p. 61. Assume none of is zero, i.e. every series
converges. Then
is the equilibrium distribution of the network: for every state , , and for every state
This is the product-form theorem for networks in which the route of a customer is determined by his type, so that a customer's future route may depend on his past route; it parallels Theorem 2.4 for open migration processes.
Formalization Note The equilibrium property is stated as positivity, normalization over all network states (HasSum) and the equilibrium equations (published KellyStochasticNetworks.FullBalance). That a Markov process with these rates exists, is irreducible and non-explosive, and has as its unique stationary law is not formalized. Types and queues are finite (Fin I, Fin J).
import Mathlib import Definitions.Def_KellyStochasticNetworks_Balance import Definitions.Def_KellyReversibility_Networks_OpenNetwork import Definitions.Def_KellyReversibility_Networks_ProductForm
namespace KellyReversibility.Networks
/-- **Theorem 3.1** (Kelly 1979, p. 61). For an open network of queues with general customer
routes satisfying the constraints of §3.1, if every series `b_j⁻¹ = ∑_n a_j^n / ∏_{l ≤ n} φ_j(l)`
converges, then `π(C) = ∏_j π_j(c_j)` is the equilibrium distribution: it is positive, sums to `1`
over all network states, and satisfies the equilibrium equations for the rates (3.2), (3.4), (3.6). -/
theorem open_network_equilibrium {I J : ℕ} (N : Network I J) (hN : N.IsValid)
(hb : ∀ j : Fin J, Summable (fun n : ℕ => N.a j ^ n / N.phiProd j n)) :
(∀ C : N.State, 0 < N.netPi C) ∧ HasSum N.netPi 1 ∧
KellyStochasticNetworks.FullBalance N.netPi N.rate := by sorry
end KellyReversibility.Networks
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.