Theorem 4 — the system is transient iff Σⱼ pᵢⱼ yⱼ = yᵢ (i ≠ 0) has a bounded nonconstant solution
ProvedFosterQueues.GIM1.theorem4_transient_iffLet () be the transition matrix of an irreducible, aperiodic Markov chain. The system is transient if and only if there is a real sequence which is bounded ( for some constant and all ), nonconstant ( for some ), and solves
The equations are imposed for every state except ; nothing is required at .
Transience is here the complement of recurrence, without distinguishing recurrent-null from recurrent-nonnull systems. Foster uses both directions for the GI/M/1 chain: when no bounded nonconstant solution of (7) exists, so the chain is recurrent; when one exists, so the chain is transient.
Formalization Note "Transient" means every state has return probability . Irreducibility and aperiodicity are the paper's standing assumptions (§1, p. 355). The equations (7) are stated with HasSum; for bounded the series always converge.
import Mathlib import Definitions.Def_QueueingFundamentals_Foundations_MarkovChain import Definitions.Def_FosterQueues_GIM1_Model open scoped ENNReal open QueueingFundamentals.Foundations
namespace FosterQueues.GIM1
theorem theorem4_transient_iff (P : TransitionMatrix) (hirr : P.Irreducible)
(hap : P.Aperiodic) :
FosterQueues.MG1.IsTransient P ↔
∃ y : ℕ → ℝ, (∃ C : ℝ, ∀ i, |y i| ≤ C) ∧ (∃ i j, y i ≠ y j) ∧
∀ i, i ≠ 0 → HasSum (fun j => P.p i j * y j) (y i) := by sorry
end FosterQueues.GIM1
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.