pp.261–262 — has exactly one root in iff
ProvedQueueingFundamentals.GM1.unique_root_unit_intervalconvexityfixed-pointgm1p2o-batch-b23bp2o-gran-per-chapterp2o-plan-bookp2o-v1queueing
Consider the G/M/1 queue with interarrival law on of mean () and exponential service at rate , and let be the generating function (5.55). Then:
- the equation has at most one real root in ;
- it has a root in if and only if
This is the book's comparison of the graphs and (5.58), Figure 5.2: either there is no intersection in , or exactly one, and the latter case occurs when . The root is denoted .
Preamble
import Mathlib import Definitions.Def_QueueingFundamentals_GM1_EmbeddedChain
Formal statement
namespace QueueingFundamentals.GM1
open MeasureTheory
/-- pp.261–262, the graphs of (5.58): `z = β(z)` has at most one root in `(0, 1)`, and it has one
exactly when `λ/μ < 1`. -/
theorem unique_root_unit_interval (A : Measure ℝ) (lam mu : ℝ) (hlam : 0 < lam) (hmu : 0 < mu)
(hA : IsInterarrivalLaw A lam) :
(∀ r s : ℝ, r ∈ Set.Ioo (0 : ℝ) 1 → beta A mu (r : ℂ) = (r : ℂ) →
s ∈ Set.Ioo (0 : ℝ) 1 → beta A mu (s : ℂ) = (s : ℂ) → r = s) ∧
((∃ r : ℝ, r ∈ Set.Ioo (0 : ℝ) 1 ∧ beta A mu (r : ℂ) = (r : ℂ)) ↔ lam / mu < 1) := by sorry
end QueueingFundamentals.GM1
Source
Gross, Shortle, Thompson & Harris, Fundamentals of Queueing Theory, 4th ed., Wiley 2008, DOI 10.1002/9781118625651, pp.261–262, Eq. (5.58) and Figure 5.2 ("there is exactly one root r_0 of (5.55) in (0, 1)")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.