Lemma 1 — basic adjoint relation
ProvedJSQHalfinWhitt.Tightness.lemma_1markov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstationary-distribution
Consider the join-the-shortest-queue chain with servers and arrival rate , , on the state space , with generator . Let have a stationary distribution of the chain. For every function with , the expectation of exists and
This relation between the generator and the stationary distribution is the tool behind every stationary bound in the paper: choosing test functions turns (3.1) into identities and inequalities for stationary moments.
Formalization Note is a probability on satisfying global balance (see the definition file). is the summability of ; the conclusion asserts the summability of and that its sum is . The model's standing assumptions and are hypotheses.
Preamble
import Mathlib import Definitions.Def_JSQHalfinWhitt_Tightness_Stationary import Definitions.Def_JSQHalfinWhitt_Tightness_Model
Formal statement
namespace JSQHalfinWhitt.Tightness
/-- Lemma 1 (Braverman, p. 6): the basic adjoint relation. If `π` is a stationary distribution of
the JSQ chain with `n ≥ 1` servers and `λ ∈ (0, 1)`, and `f : S → ℝ` has `E|f(Q)| < ∞`, then
`E G_Q f(Q)` exists and equals `0`. -/
theorem lemma_1 (n : ℕ) (lam : ℝ) (hn : 1 ≤ n) (hlam0 : 0 < lam) (hlam1 : lam < 1)
(π : State n → ℝ) (hπ : IsStationaryDist (genQ n lam) π)
(f : State n → ℝ) (hf : Summable (fun q => π q * |f q|)) :
Summable (fun q => π q * genQ n lam f q) ∧ expect π (genQ n lam f) = 0 := by sorry
end JSQHalfinWhitt.Tightness
Source
Braverman, Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin-Whitt Regime, arXiv:1801.05121v2 (published in Math. Oper. Res. 45(3), 2020), p. 6, Lemma 1, (3.1)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.