Lemma 3.4 — truncating a reversible process
ProvedKellyStochasticNetworks.truncated_reversibleLet be the transition rates of a Markov process on a state space , and let be in detailed balance with , so that the process is reversible with equilibrium distribution . Truncate the process to a subset : keep the rates between states of unchanged and suppress every transition that would leave .
Then the truncated process is again reversible, with equilibrium distribution
Precisely, if the sum converges and is non-zero, then is in detailed balance with the truncated rates and its terms sum to .
This is the lever of the whole chapter. A loss network is the truncation of a system of independent, uncapacitated queues to the feasible set , and because the uncapacitated system is reversible the lemma hands over its equilibrium distribution at once: independent Poisson random variables conditioned on a set of linear inequalities.
Formalization Note The truncated process lives on the subtype of states belonging to , so the suppression of transitions leaving is automatic: such a transition has no target. Convergence of and its value are asserted together.
import Mathlib import Definitions.Def_KellyStochasticNetworks_Balance import Definitions.Def_KellyStochasticNetworks_Erlang import Definitions.Def_KellyStochasticNetworks_Migration import Definitions.Def_KellyStochasticNetworks_LossNetwork
namespace KellyStochasticNetworks
theorem truncated_reversible {S : Type*} (π : S → ℝ) (q : S → S → ℝ) (A : Set S)
(h : DetailedBalance π q) (Z : ℝ) (hZ0 : Z ≠ 0)
(hZ : HasSum (fun j : A => π (j : S)) Z) :
DetailedBalance (fun j : A => π (j : S) / Z) (truncatedRates q A)
∧ HasSum (fun j : A => π (j : S) / Z) 1 := by sorry
end KellyStochasticNetworksConfirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.