Lemma 2 — and
ProvedJSQHalfinWhitt.Tightness.lemma_2markov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstationary-distribution
Consider the join-the-shortest-queue chain with servers and , and let have a stationary distribution of the chain, where is the number of servers with at least customers. Then
In particular , so in the Halfin–Whitt regime , which is the case of (2.2).
Formalization Note Lean indices are 0-based: q.1 0 is and q.1 i () is , so (3.3) for the paper's index reads . Expectations and probabilities are sums against ; all summands are bounded ().
Preamble
import Mathlib import Definitions.Def_JSQHalfinWhitt_Tightness_Stationary import Definitions.Def_JSQHalfinWhitt_Tightness_Model
Formal statement
namespace JSQHalfinWhitt.Tightness
/-- Lemma 2 (Braverman, p. 6): for `n ≥ 1`, `λ ∈ (0, 1)` and every stationary distribution `π`
of the JSQ chain, `E Q_1 = nλ` (3.2) and `E Q_i = nλ P(Q_1 = … = Q_{i−1} = n)` for `i > 1` (3.3).
Lean indices are 0-based: `q.1 0` is `Q_1`, and `q.1 i` for `i ≥ 1` is `Q_{i+1}`. -/
theorem lemma_2 (n : ℕ) (lam : ℝ) (hn : 1 ≤ n) (hlam0 : 0 < lam) (hlam1 : lam < 1)
(π : State n → ℝ) (hπ : IsStationaryDist (genQ n lam) π) :
expect π (fun q => (q.1 0 : ℝ)) = n * lam ∧
∀ i : ℕ, 1 ≤ i →
expect π (fun q => (q.1 i : ℝ)) = n * lam * prob π (fun q => ∀ j, j < i → q.1 j = n) := 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 2, (3.2)–(3.3)
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.