Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 2 — E∣nXi∣≤C(β)\mathbb E|\sqrt nX_i| \le C(\beta)E∣n​Xi​∣≤C(β) for i=1,2i = 1, 2i=1,2 and E∣nXi∣≤C(β)\mathbb E|nX_i| \le C(\beta)E∣nXi​∣≤C(β) for i≥3i \ge 3i≥3

Proved
JSQHalfinWhitt.Tightness.theorem_2

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

halfin-whittjoin-the-shortest-queuep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstationary-distributiontightness

Consider the join-the-shortest-queue system with nnn identical exponential servers, Poisson arrivals of rate nλn\lambdanλ and the Halfin–Whitt scaling λ=1−β/n\lambda = 1 - \beta/\sqrt nλ=1−β/n​, β>0\beta > 0β>0. Let Q=(Q1,Q2,… )Q = (Q_1, Q_2, \dots)Q=(Q1​,Q2​,…) have a stationary distribution of the chain, QiQ_iQi​ being the number of servers with at least iii customers, and set X1=(Q1−n)/nX_1 = (Q_1 - n)/nX1​=(Q1​−n)/n and Xi=Qi/nX_i = Q_i/nXi​=Qi​/n for i≥2i \ge 2i≥2.

For each β>0\beta > 0β>0 there exists a constant C(β)C(\beta)C(β) such that for all n≥1n \ge 1n≥1 (with β<n\beta < \sqrt nβ<n​) and every stationary distribution of the chain,

E∣nXi∣≤C(β),i=1,2,(2.2)\mathbb E\big|\sqrt n X_i\big| \le C(\beta),\quad i = 1, 2, \tag{2.2}E​n​Xi​​≤C(β),i=1,2,(2.2) E∣nXi∣≤C(β),i≥3.(2.3)\mathbb E\big|n X_i\big| \le C(\beta),\quad i \ge 3. \tag{2.3}E​nXi​​≤C(β),i≥3.(2.3)

The theorem says that, uniformly in the number of servers, the stationary number of idle servers and of servers with at least two customers are O(n)O(\sqrt n)O(n​) on average, and the stationary number of servers with at least i≥3i \ge 3i≥3 customers is O(1)O(1)O(1) on average. It gives tightness of the diffusion-scaled stationary distributions {nX}n\{\sqrt n X\}_n{n​X}n​, one of the two ingredients for the convergence of stationary distributions to the diffusion limit (Proposition 1).

Formalization Note The printed display of Theorem 2 omits the expectation (∣nXi∣≤C(β)|\sqrt n X_i| \le C(\beta)∣n​Xi​∣≤C(β) and ∣nXi∣≤C(β)|nX_i| \le C(\beta)∣nXi​∣≤C(β)); read as almost-sure bounds these are false, since X2=1X_2 = 1X2​=1 with positive stationary probability. The intended statement, proved in the paper, bounds expectations: (1.3) on p. 2 states EQ2≤C(β)n\mathbb E Q_2 \le C(\beta)\sqrt nEQ2​≤C(β)n​ and EQi≤C(β)\mathbb E Q_i \le C(\beta)EQi​≤C(β), p. 7 computes nE∣X1∣=β\sqrt n\mathbb E|X_1| = \betan​E∣X1​∣=β, p. 10 bounds EnX2\mathbb E\sqrt n X_2En​X2​, and App. A.4 (p. 22) opens with "Our goal is to prove (2.3), or that EnXi=EQi≤C(β)\mathbb E nX_i = \mathbb E Q_i \le C(\beta)EnXi​=EQi​≤C(β)". That version is stated. The model needs λ>0\lambda > 0λ>0, i.e. β<n\beta < \sqrt nβ<n​; for n≤β2n \le \beta^2n≤β2 there is no model. The constant CCC is chosen after β\betaβ and before nnn, π\piπ and iii. The stationary distribution is a probability π\piπ on SSS with global balance πGQ=0\pi G_Q = 0πGQ​=0, which for this bounded-rate chain characterizes stationarity; expectations are sums against π\piπ of bounded functions (0≤Qi≤n0 \le Q_i \le n0≤Qi​≤n), so they always converge. Lean indices are 0-based: q.1 0 is Q1Q_1Q1​, q.1 1 is Q2Q_2Q2​, and q.1 i with i≥2i \ge 2i≥2 is Qi+1Q_{i+1}Qi+1​, so (2.3) is the Lean range i≥2i \ge 2i≥2.

Preamble
import Mathlib
import Definitions.Def_JSQHalfinWhitt_Tightness_Stationary
import Definitions.Def_JSQHalfinWhitt_Tightness_Model
Formal statement
namespace JSQHalfinWhitt.Tightness

/-- Theorem 2 (Braverman, p. 5), with the expectation that the printed display omits: for each
`β > 0` there is a constant `C(β)` such that for every `n ≥ 1` with `β < √n` (so that
`λ = 1 − β/√n > 0`) and every stationary distribution `π` of the `n`-server JSQ chain with
`λ = 1 − β/√n`, `E|√n X_i| ≤ C(β)` for `i = 1, 2` (2.2) and `E|n X_i| ≤ C(β)` for `i ≥ 3` (2.3),
where `X_1 = (Q_1 − n)/n` and `X_i = Q_i/n` for `i ≥ 2`. Lean indices are 0-based: `q.1 0` is
`Q_1`, `q.1 1` is `Q_2`, and `q.1 i` with `i ≥ 2` is `Q_{i+1}`. -/
theorem theorem_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) ∧
        ∀ i : ℕ, 2 ≤ i → expect π (fun q => |(n : ℝ) * ((q.1 i : ℝ) / n)|) ≤ C := 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. 5, Theorem 2, (2.2)–(2.3) (expectation form: p. 2 (1.3), p. 7, p. 10, p. 22 App. A.4)
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me