Proof of Proposition 2.1, the reverse argument (p. 9) — ∫₀ᵗ Σ 1{w̃ᵢ > t − s} dF(s) = Σ (G(t − w̃ᵢ) − G(t))
ProvedReedGGN.SystemEq.prop_2_1_reverse_argumentmany-server-queuep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueingstieltjes-integral
Let be a service-time distribution on with tail , and fix a sample path of the queue with servers, initial customers and nonnegative waiting times of the initial customers . Then for every ,
This is the last step of the proof of Proposition 2.1: it converts the contribution of the initial waiting customers to back into tails of .
Formalization Note The integral is over the closed interval , an atom of at included. is a probability measure on with , and for every real .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.