Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (6.10)–(6.12) — the Wiener–Hopf transform relation for the G/G/1 delay

Proved
QueueingFundamentals.GG1.wiener_hopf_transform

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

g-g-1laplace-transformp2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueingwiener-hopf

Let ν\nuν be a stationary delay distribution of the G/G/1 queue with interarrival law AAA and service law BBB, let WqW_qWq​ be its CDF, UUU the law of S−TS-TS−T, and define Wq−(t)=∫−∞tWq(t−x) dU(x)W_q^-(t)=\int_{-\infty}^{t}W_q(t-x)\,dU(x)Wq−​(t)=∫−∞t​Wq​(t−x)dU(x) for t<0t<0t<0 and Wq−(t)=0W_q^-(t)=0Wq−​(t)=0 for t≥0t\ge0t≥0 (6.10). Then

Wq−(t)+Wq(t)=∫−∞tWq(t−x) dU(x)(−∞<t<∞).(6.11)W_q^-(t)+W_q(t)=\int_{-\infty}^{t}W_q(t-x)\,dU(x)\qquad(-\infty<t<\infty). \tag{6.11}Wq−​(t)+Wq​(t)=∫−∞t​Wq​(t−x)dU(x)(−∞<t<∞).(6.11)

Write Wˉq(s)=∫−∞∞e−stWq(t) dt\bar W_q(s)=\int_{-\infty}^{\infty}e^{-st}W_q(t)\,dtWˉq​(s)=∫−∞∞​e−stWq​(t)dt and Wˉq−(s)=∫−∞∞e−stWq−(t) dt\bar W_q^-(s)=\int_{-\infty}^{\infty}e^{-st}W_q^-(t)\,dtWˉq−​(s)=∫−∞∞​e−stWq−​(t)dt for the two-sided Laplace transforms, A∗,B∗A^*,B^*A∗,B∗ for the Laplace–Stieltjes transforms and U∗(s)=∫e−sx dU(x)U^*(s)=\int e^{-sx}\,dU(x)U∗(s)=∫e−sxdU(x). For every complex sss with Re⁡s>0\operatorname{Re}s>0Res>0 and ∫e(Re⁡s)x dA(x)<∞\int e^{(\operatorname{Re}s)x}\,dA(x)<\infty∫e(Res)xdA(x)<∞,

U∗(s)=A∗(−s)B∗(s),Wˉq−(s)+Wˉq(s)=Wˉq(s)A∗(−s)B∗(s),U^*(s)=A^*(-s)B^*(s),\qquad \bar W_q^-(s)+\bar W_q(s)=\bar W_q(s)A^*(-s)B^*(s),U∗(s)=A∗(−s)B∗(s),Wˉq−​(s)+Wˉq​(s)=Wˉq​(s)A∗(−s)B∗(s),

and, whenever A∗(−s)B∗(s)≠1A^*(-s)B^*(s)\ne1A∗(−s)B∗(s)=1,

Wˉq(s)=Wˉq−(s)A∗(−s)B∗(s)−1.(6.12)\bar W_q(s)=\frac{\bar W_q^-(s)}{A^*(-s)B^*(s)-1}. \tag{6.12}Wˉq​(s)=A∗(−s)B∗(s)−1Wˉq−​(s)​.(6.12)

This is the transform form of Lindley's equation: it reduces the G/G/1 delay to the determination of Wˉq−\bar W_q^-Wˉq−​.

Formalization Note The page does not say where the transforms converge. The strip used here, 0<Re⁡s0<\operatorname{Re}s0<Res with a finite exponential moment of AAA at Re⁡s\operatorname{Re}sRes (so that A∗(−s)A^*(-s)A∗(−s) exists), is a labelled hypothesis; the division in (6.12) is stated only where its denominator is nonzero.

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_GG1_Lindley
Formal statement
namespace QueueingFundamentals.GG1

open MeasureTheory

/-- Eqs. (6.10)–(6.12) (pp.285–286). Let `ν` be a stationary delay distribution of the G/G/1 queue
with interarrival law `A` and service law `B`, `W_q = cdfOf ν`, `U` the law of `S − T`, and
`W_q^−` as in (6.10). Then
(6.11) `W_q^−(t) + W_q(t) = ∫_{−∞}^{t} W_q(t − x) dU(x)` for all real `t`; and for every complex
`s` in the strip `0 < Re s` where `A` has the exponential moment `∫ e^{(Re s)x} dA(x) < ∞`
(a strip the page leaves implicit), `U^*(s) = A^*(−s)B^*(s)`,
`W̄_q^−(s) + W̄_q(s) = W̄_q(s)A^*(−s)B^*(s)`, and, when `A^*(−s)B^*(s) ≠ 1`,
(6.12) `W̄_q(s) = W̄_q^−(s)/(A^*(−s)B^*(s) − 1)`, with two-sided Laplace transforms `W̄`. -/
theorem wiener_hopf_transform (A B ν : Measure ℝ) (hA : IsLifetimeLaw A) (hB : IsLifetimeLaw B)
    (hν : IsStationaryDelay A B ν) :
    (∀ t : ℝ, negPart (diffLaw A B) (cdfOf ν) t + cdfOf ν t =
        ∫ x in Set.Iic t, cdfOf ν (t - x) ∂(diffLaw A B)) ∧
    ∀ s : ℂ, 0 < s.re → Integrable (fun x : ℝ => Real.exp (s.re * x)) A →
      QueueingFundamentals.MG1.lst (diffLaw A B) s = QueueingFundamentals.MG1.lst A (-s) * QueueingFundamentals.MG1.lst B s ∧
      twoSidedLaplace (negPart (diffLaw A B) (cdfOf ν)) s + twoSidedLaplace (cdfOf ν) s =
        twoSidedLaplace (cdfOf ν) s * (QueueingFundamentals.MG1.lst A (-s) * QueueingFundamentals.MG1.lst B s) ∧
      (QueueingFundamentals.MG1.lst A (-s) * QueueingFundamentals.MG1.lst B s ≠ 1 →
        twoSidedLaplace (cdfOf ν) s =
          twoSidedLaplace (negPart (diffLaw A B) (cdfOf ν)) s / (QueueingFundamentals.MG1.lst A (-s) * QueueingFundamentals.MG1.lst B s - 1)) := by sorry

end QueueingFundamentals.GG1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, pp.285–286, Eqs. (6.10), (6.11), U*(s) = A*(−s)B*(s) and (6.12)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

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