(4.55) — ψ_h in closed form: (1−G(x))/(1−G(x−t)) for t ≤ x < M, 1−G(x) for x ≤ t
ProvedManyServerFluid.Uniqueness.eq_4_55fluid-limithazard-ratep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueing
Let be the function (4.45)–(4.46) for , the hazard rate. For :
This identity, used at the start of the proof of Theorem 4.1, turns the exponential of the integrated hazard into survival-function ratios, which is where the factors and of the representation (4.3) come from.
Formalization Note. The paper's (4.55) also lists the value "otherwise", and writes the second case as without . For the definition (4.46) gives , hence , not ; only values on are used. We state the two cases on , where (4.46) and (4.55) agree.
Preamble
import Mathlib import Definitions.Def_ManyServerFluid_Uniqueness_Model import Definitions.Def_ManyServerFluid_Uniqueness_AgeEquation open MeasureTheory Filter Topology Set open scoped ENNReal
Formal statement
namespace ManyServerFluid.Uniqueness
/-- (4.55), proof of Theorem 4.1, p. 69: ψ_h in closed form on [0, M) × [0, ∞):
ψ_h(x, t) = (1 − G(x))/(1 − G(x − t)) if 0 ≤ t ≤ x < M, and ψ_h(x, t) = 1 − G(x) if 0 ≤ x ≤ t,
x < M. -/
theorem eq_4_55 (S : ServiceLaw) (x t : ℝ) (hx : x ∈ S.Ages) :
(0 ≤ t → t ≤ x → S.psiEll S.h (x, t) = (1 - S.G x) / (1 - S.G (x - t))) ∧
(x ≤ t → S.psiEll S.h (x, t) = 1 - S.G x) := by sorry
end ManyServerFluid.Uniqueness
Source
Kaspi and Ramanan, Law of Large Numbers Limits for Many-Server Queues, Ann. Appl. Probab. 21(1) (2011), p. 69, proof of Theorem 4.1 (§4.3.4), (4.55); definitions (4.45)–(4.46), p. 67
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.