Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2.1, first two equalities (p. 8) — G(t − τᵢ − wᵢ) − G(t − τᵢ) is the F-mass of the delay window

Proved
ReedGGN.SystemEq.prop_2_1_arrival_delay

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

many-server-queuep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstieltjes-integral

Let FFF be a service-time distribution on [0,∞)[0,\infty)[0,∞), with tail G=1−FG=1-FG=1−F, and fix a sample path of the G/GI/NG/GI/NG/GI/N queue with arrival times τi\tau_iτi​, nonnegative waiting times wiw_iwi​ and arrival counting process AAA. Then for every t≥0t\ge 0t≥0,

∑i=1A(t)(G(t−τi−wi)−G(t−τi))=∑i=1A(t)∫0∞1{t−(τi+wi)<s≤t−τi} dF(s).\sum_{i=1}^{A(t)}\big(G(t-\tau_i-w_i)-G(t-\tau_i)\big)=\sum_{i=1}^{A(t)}\int_0^\infty 1\{t-(\tau_i+w_i)<s\le t-\tau_i\}\,dF(s).i=1∑A(t)​(G(t−τi​−wi​)−G(t−τi​))=i=1∑A(t)​∫0∞​1{t−(τi​+wi​)<s≤t−τi​}dF(s).

Each difference of tails is the probability that a service time falls in the window (t−τi−wi, t−τi](t-\tau_i-w_i,\,t-\tau_i](t−τi​−wi​,t−τi​] of length wiw_iwi​; this is the first step of the proof of Proposition 2.1, which then turns the window into the event "customer iii is waiting at time t−st-st−s".

Formalization Note The paper's intermediate form ∫(t−(τi+wi))+t−τidF(s)\int_{(t-(\tau_i+w_i))^+}^{t-\tau_i}dF(s)∫(t−(τi​+wi​))+t−τi​​dF(s) is ambiguous when FFF has an atom at 000; the statement uses the paper's next form, with the half-open window, which fixes the convention. ∫0∞\int_0^\infty∫0∞​ is the integral over [0,∞)[0,\infty)[0,∞), the point 000 included. FFF is a probability measure μ\muμ on R\mathbb RR with μ((−∞,0))=0\mu((-\infty,0))=0μ((−∞,0))=0 and G(x)=μ((x,∞))G(x)=\mu((x,\infty))G(x)=μ((x,∞)) for every real xxx.

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

open MeasureTheory

/-- Proof of Proposition 2.1, first two equalities (p. 8): for each arrival `i ≤ A(t)`, the
difference `G(t − τ_i − w_i) − G(t − τ_i)` is the `F`-mass of the delay window
`{s ≥ 0 : t − (τ_i + w_i) < s ≤ t − τ_i}`, so
`Σ_{i=1}^{A(t)} (G(t − τ_i − w_i) − G(t − τ_i))
  = Σ_{i=1}^{A(t)} ∫_0^∞ 1{t − (τ_i + w_i) < s ≤ t − τ_i} dF(s)`. -/
theorem prop_2_1_arrival_delay (μ : Measure ℝ) [IsProbabilityMeasure μ] (hμ : μ (Set.Iio 0) = 0)
    (P : SamplePath) (t : ℝ) (ht : 0 ≤ t) :
    ∑ i ∈ Finset.Icc 1 (P.A t), (G μ (t - P.τ i - P.w i) - G μ (t - P.τ i)) =
      ∑ i ∈ Finset.Icc 1 (P.A t),
        ∫ s in Set.Ici 0, (Set.Ioc (t - (P.τ i + P.w i)) (t - P.τ i)).indicator
          (fun _ => (1 : ℝ)) s ∂μ := by sorry

end ReedGGN.SystemEq
Source
Reed, The G/GI/N Queue in the Halfin–Whitt Regime, arXiv:0912.2837v1, p. 8, proof of Proposition 2.1, first and second equalities of the chain
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