Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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

Proved
JSQHalfinWhitt.Tightness.theorem_2_part_2_2

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

halfin-whittp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstationary-distributiontightness

For β>0\beta > 0β>0 consider the join-the-shortest-queue chain with nnn servers in the Halfin–Whitt regime λ=1−β/n\lambda = 1 - \beta/\sqrt nλ=1−β/n​, and let X1=(Q1−n)/nX_1 = (Q_1 - n)/nX1​=(Q1​−n)/n and X2=Q2/nX_2 = Q_2/nX2​=Q2​/n be the fluid-scaled coordinates of a stationary state QQQ. For each β>0\beta > 0β>0 there is 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),\qquad i = 1, 2. \tag{2.2}E​n​Xi​​≤C(β),i=1,2.(2.2)

This is the tightness of the diffusion-scaled pair (nX1,nX2)(\sqrt n X_1, \sqrt n X_2)(n​X1​,n​X2​) in steady state: the number of idle servers and the number of servers with two or more customers are both of order n\sqrt nn​ on average.

Formalization Note The printed display of Theorem 2 omits the expectation and reads ∣nXi∣≤C(β)|\sqrt n X_i| \le C(\beta)∣n​Xi​∣≤C(β); read as an almost-sure bound it is false, since X2=1X_2 = 1X2​=1 with positive stationary probability. The intended statement, proved in the paper, is the bound on E∣nXi∣\mathbb E|\sqrt n X_i|E∣n​Xi​∣: (1.3) on p. 2 states EQ2≤C(β)n\mathbb E Q_2 \le C(\beta)\sqrt nEQ2​≤C(β)n​, p. 7 computes nE∣X1∣=β\sqrt n\mathbb E|X_1| = \betan​E∣X1​∣=β, and p. 10 bounds EnX2\mathbb E\sqrt n X_2En​X2​. 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, so "for all n≥1n \ge 1n≥1" is read as "for all n≥1n \ge 1n≥1 with β<n\beta < \sqrt nβ<n​". The constant CCC is chosen after β\betaβ and before nnn and π\piπ.

Preamble
import Mathlib
import Definitions.Def_JSQHalfinWhitt_Tightness_Stationary
import Definitions.Def_JSQHalfinWhitt_Tightness_Model
Formal statement
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
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) (expectation form: p. 2 (1.3), p. 7, p. 10)
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