Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1 — basic adjoint relation E GQf(Q)=0\mathbb E\,G_Qf(Q) = 0EGQ​f(Q)=0

Proved
JSQHalfinWhitt.Tightness.lemma_1

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

markov-chainsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstationary-distribution

Consider the join-the-shortest-queue chain with n≥1n \ge 1n≥1 servers and arrival rate nλn\lambdanλ, λ∈(0,1)\lambda \in (0,1)λ∈(0,1), on the state space SSS, with generator GQG_QGQ​. Let QQQ have a stationary distribution π\piπ of the chain. For every function f:S→Rf : S \to \mathbb Rf:S→R with E∣f(Q)∣<∞\mathbb E|f(Q)| < \inftyE∣f(Q)∣<∞, the expectation of GQf(Q)G_Q f(Q)GQ​f(Q) exists and

E GQf(Q)=0.(3.1)\mathbb E\,G_Q f(Q) = 0. \tag{3.1}EGQ​f(Q)=0.(3.1)

This relation between the generator and the stationary distribution is the tool behind every stationary bound in the paper: choosing test functions fff turns (3.1) into identities and inequalities for stationary moments.

Formalization Note π\piπ is a probability on SSS satisfying global balance πGQ=0\pi G_Q = 0πGQ​=0 (see the definition file). E∣f(Q)∣<∞\mathbb E|f(Q)| < \inftyE∣f(Q)∣<∞ is the summability of q↦π(q)∣f(q)∣q \mapsto \pi(q)|f(q)|q↦π(q)∣f(q)∣; the conclusion asserts the summability of q↦π(q)GQf(q)q \mapsto \pi(q) G_Q f(q)q↦π(q)GQ​f(q) and that its sum is 000. The model's standing assumptions n≥1n \ge 1n≥1 and 0<λ<10 < \lambda < 10<λ<1 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
  • 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