Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.11.2 — the Laplace transform pˉ0(s)=z1i+1/(μ(1−z1))\bar p_0(s) = z_1^{i+1}/(\mu(1-z_1))pˉ​0​(s)=z1i+1​/(μ(1−z1​)) for M/M/1

Proved
QueueingFundamentals.Transient.mm1_laplace_p0

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

laplace-transformmm1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueingtransient

Let λ,μ>0\lambda, \mu > 0λ,μ>0 and i≥0i \ge 0i≥0. Let (pn(t))n≥0(p_n(t))_{n \ge 0}(pn​(t))n≥0​ be a solution on [0,∞)[0,\infty)[0,∞) of the M/M/1 forward equations (2.72) with pn(0)=1p_n(0) = 1pn​(0)=1 if n=in = in=i and 000 otherwise, such that (pn(t))n(p_n(t))_n(pn​(t))n​ is a probability distribution for every t≥0t \ge 0t≥0. Let Re⁡s>0\operatorname{Re} s > 0Res>0, let rrr be the square root of (λ+μ+s)2−4λμ(\lambda+\mu+s)^2 - 4\lambda\mu(λ+μ+s)2−4λμ with positive real part, and z1=(λ+μ+s−r)/(2λ)z_1 = (\lambda+\mu+s-r)/(2\lambda)z1​=(λ+μ+s−r)/(2λ). Then t↦e−stp0(t)t \mapsto e^{-st}p_0(t)t↦e−stp0​(t) is integrable on (0,∞)(0,\infty)(0,∞) and the Laplace transform of p0p_0p0​ is

pˉ0(s)=∫0∞e−stp0(t) dt=z1 i+1μ(1−z1).\bar p_0(s) = \int_0^\infty e^{-st} p_0(t)\,dt = \frac{z_1^{\,i+1}}{\mu(1-z_1)} .pˉ​0​(s)=∫0∞​e−stp0​(t)dt=μ(1−z1​)z1i+1​​.

Together with (2.73) this determines the transform Pˉ(z,s)\bar P(z,s)Pˉ(z,s) of the generating function, which is then inverted to obtain (2.75).

Preamble
import Mathlib
import Definitions.Def_QueueingFundamentals_Transient_forwardEquations
import Definitions.Def_QueueingFundamentals_Transient_laplace
Formal statement
namespace QueueingFundamentals.Transient

open MeasureTheory

/-- The Laplace transform of `p₀(t)` for the M/M/1 queue with `N(0) = i` (p.100):
for every probability solution `p` of the forward equations (2.72) with `p_n(0) = [n = i]`,
and every `s` with `Re s > 0`, `e^{-st} p₀(t)` is integrable on `(0, ∞)` and
`p̄₀(s) = z₁^{i+1} / (μ (1 - z₁))`, where `z₁ = (λ+μ+s - r)/(2λ)` and `r` is the square root of
`(λ+μ+s)² - 4λμ` with positive real part. -/
theorem mm1_laplace_p0 (lam mu : ℝ) (hlam : 0 < lam) (hmu : 0 < mu) (i : ℕ)
    (p : ℕ → ℝ → ℝ) (hsol : IsForwardSolution (mm1RHS lam mu) p)
    (hprob : IsProbabilityFamily p) (hinit : ∀ n : ℕ, p n 0 = if n = i then 1 else 0)
    (s : ℂ) (hs : 0 < s.re) (r : ℂ)
    (hr : r ^ 2 = ((lam : ℂ) + (mu : ℂ) + s) ^ 2 - 4 * (lam : ℂ) * (mu : ℂ))
    (hr_re : 0 < r.re) :
    IntegrableOn (fun t : ℝ => Complex.exp (-s * (t : ℂ)) * (p 0 t : ℂ)) (Set.Ioi 0) ∧
      laplace (p 0) s
        = (((lam : ℂ) + (mu : ℂ) + s - r) / (2 * (lam : ℂ))) ^ (i + 1)
          / ((mu : ℂ) * (1 - ((lam : ℂ) + (mu : ℂ) + s - r) / (2 * (lam : ℂ)))) := by sorry

end QueueingFundamentals.Transient
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, p.100, formula for p̄_0(s) following Rouché's theorem, §2.11.2
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