Theorem 2, (2.2) — for
ProvedJSQHalfinWhitt.Tightness.theorem_2_part_2_2For consider the join-the-shortest-queue chain with servers in the Halfin–Whitt regime , and let and be the fluid-scaled coordinates of a stationary state . For each there is a constant such that for all with and every stationary distribution of the chain,
This is the tightness of the diffusion-scaled pair in steady state: the number of idle servers and the number of servers with two or more customers are both of order on average.
Formalization Note The printed display of Theorem 2 omits the expectation and reads ; read as an almost-sure bound it is false, since with positive stationary probability. The intended statement, proved in the paper, is the bound on : (1.3) on p. 2 states , p. 7 computes , and p. 10 bounds . That version is stated. The model needs , i.e. ; for there is no model, so "for all " is read as "for all with ". The constant is chosen after and before and .
import Mathlib import Definitions.Def_JSQHalfinWhitt_Tightness_Stationary import Definitions.Def_JSQHalfinWhitt_Tightness_Model
namespace JSQHalfinWhitt.Tightness
/-- Theorem 2, (2.2) (Braverman, p. 5), with the expectation that the printed display omits:
for each `β > 0` there is `C(β)` such that for every `n ≥ 1` with `β < √n` and every stationary
distribution `π` of the JSQ chain with `λ = 1 − β/√n`, `E|√n X_1| ≤ C(β)` and `E|√n X_2| ≤ C(β)`,
where `X_1 = (Q_1 − n)/n`, `X_2 = Q_2/n` (Lean `q.1 0`, `q.1 1`). -/
theorem theorem_2_part_2_2 (β : ℝ) (hβ : 0 < β) :
∃ C : ℝ, ∀ n : ℕ, 1 ≤ n → β < Real.sqrt n →
∀ π : State n → ℝ, IsStationaryDist (genQ n (lamHW β n)) π →
expect π (fun q => |Real.sqrt n * (((q.1 0 : ℝ) - n) / n)|) ≤ C ∧
expect π (fun q => |Real.sqrt n * ((q.1 1 : ℝ) / n)|) ≤ C := by sorry
end JSQHalfinWhitt.Tightness
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.