Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Proposition 2.1, the reverse argument (p. 9) — ∫₀ᵗ Σ 1{w̃ᵢ > t − s} dF(s) = Σ (G(t − w̃ᵢ) − G(t))

Proved
ReedGGN.SystemEq.prop_2_1_reverse_argument

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 NNN servers, Q0Q_0Q0​ initial customers and nonnegative waiting times w~i\tilde w_iw~i​ of the initial customers N+iN+iN+i. Then for every t≥0t\ge 0t≥0,

∫0t∑i=1(Q0−N)+1{w~i>t−s} dF(s)=∑i=1(Q0−N)+(G(t−w~i)−G(t)).\int_0^t\sum_{i=1}^{(Q_0-N)^+}1\{\tilde w_i>t-s\}\,dF(s)=\sum_{i=1}^{(Q_0-N)^+}\big(G(t-\tilde w_i)-G(t)\big).∫0t​i=1∑(Q0​−N)+​1{w~i​>t−s}dF(s)=i=1∑(Q0​−N)+​(G(t−w~i​)−G(t)).

This is the last step of the proof of Proposition 2.1: it converts the contribution of the initial waiting customers to ∫0t(Q(t−s)−N)+ dF(s)\int_0^t (Q(t-s)-N)^+\,dF(s)∫0t​(Q(t−s)−N)+dF(s) back into tails of FFF.

Formalization Note The integral is over the closed interval [0,t][0,t][0,t], an atom of FFF at 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, the reverse argument (p. 9):
`∫_0^t Σ_{i=1}^{(Q₀−N)⁺} 1{w̃_i > t − s} dF(s) = Σ_{i=1}^{(Q₀−N)⁺} (G(t − w̃_i) − G(t))`,
the integral over the closed interval `[0, t]`. -/
theorem prop_2_1_reverse_argument (μ : Measure ℝ) [IsProbabilityMeasure μ] (hμ : μ (Set.Iio 0) = 0)
    (P : SamplePath) (t : ℝ) (ht : 0 ≤ t) :
    ∫ s in Set.Icc 0 t,
        (∑ i ∈ Finset.Icc 1 (P.Q₀ - P.N), if t - s < P.wt i then (1 : ℝ) else 0) ∂μ =
      ∑ i ∈ Finset.Icc 1 (P.Q₀ - P.N), (G μ (t - P.wt i) - G μ t) := by sorry

end ReedGGN.SystemEq
Source
Reed, The G/GI/N Queue in the Halfin–Whitt Regime, arXiv:0912.2837v1, p. 9, proof of Proposition 2.1 ("A reverse argument can now also be used to show that")
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