Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(2.7), p. 7 — Q(t) = I(t) + W₀(t) + M₂(t) + A_G(t) + Σ (G(t − w̃ᵢ) − G(t)) + Σ (G(t − τᵢ − wᵢ) − G(t − τᵢ))

Proved
ReedGGN.SystemEq.equation_2_7

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

halfin-whittmany-server-queuep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueing

Let FFF and F0F_0F0​ be the service-time and residual service-time distributions, with tails G=1−FG=1-FG=1−F and Fˉ0=1−F0\bar F_0=1-F_0Fˉ0​=1−F0​, and fix a sample path of the G/GI/NG/GI/NG/GI/N queue. With QQQ the number in system (2.2) and W0W_0W0​, M2M_2M2​, AGA_GAG​, III as in (2.4)–(2.6) and p. 7, for every t≥0t\ge0t≥0,

Q(t)=I(t)+W0(t)+M2(t)+AG(t)+∑i=1(Q0−N)+(G(t−w~i)−G(t))+∑i=1A(t)(G(t−τi−wi)−G(t−τi)).Q(t)=I(t)+W_0(t)+M_2(t)+A_G(t)+\sum_{i=1}^{(Q_0-N)^+}\big(G(t-\tilde w_i)-G(t)\big)+\sum_{i=1}^{A(t)}\big(G(t-\tau_i-w_i)-G(t-\tau_i)\big).Q(t)=I(t)+W0​(t)+M2​(t)+AG​(t)+i=1∑(Q0​−N)+​(G(t−w~i​)−G(t))+i=1∑A(t)​(G(t−τi​−wi​)−G(t−τi​)).

The paper obtains it from (2.2) by centring each indicator at its (conditional) mean, which gives (2.3), and then adding and subtracting AG(t)A_G(t)AG​(t) and (Q0−N)+G(t)(Q_0-N)^+G(t)(Q0​−N)+G(t). It separates the number in system into a mean term for the initial customers, two fluctuation terms, the infinite-server mean AGA_GAG​, and two corrections due to waiting; Proposition 2.1 rewrites the corrections.

Formalization Note The identity is pathwise and uses no property of the waiting times; FFF and F0F_0F0​ are probability measures μ,μ0\mu,\mu_0μ,μ0​ on R\mathbb RR.

Preamble
import Mathlib
import Definitions.Def_ReedGGN_SystemEq_QueueLength
Formal statement
namespace ReedGGN.SystemEq

open MeasureTheory

/-- Equation (2.7) (p. 7): the number in system (2.2) decomposes as
`Q(t) = I(t) + W₀(t) + M₂(t) + A_G(t) + Σ_{i=1}^{(Q₀−N)⁺} (G(t − w̃_i) − G(t))
          + Σ_{i=1}^{A(t)} (G(t − τ_i − w_i) − G(t − τ_i))`. -/
theorem equation_2_7 (μ μ₀ : Measure ℝ) [IsProbabilityMeasure μ] [IsProbabilityMeasure μ₀]
    (P : SamplePath) (t : ℝ) (ht : 0 ≤ t) :
    (Q P t : ℝ) =
      I μ μ₀ P t + W0 μ₀ P t + M2 μ P t + AG μ P t +
        (∑ i ∈ Finset.Icc 1 (P.Q₀ - P.N), (G μ (t - P.wt i) - G μ t)) +
        ∑ i ∈ Finset.Icc 1 (P.A t), (G μ (t - P.τ i - P.w i) - G μ (t - P.τ i)) := by sorry

end ReedGGN.SystemEq
Source
Reed, The G/GI/N Queue in the Halfin–Whitt Regime, arXiv:0912.2837v1, p. 7, Eq. (2.7) (via (2.3))
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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