Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(4.55) — ψ_h in closed form: (1−G(x))/(1−G(x−t)) for t ≤ x < M, 1−G(x) for x ≤ t

Proved
ManyServerFluid.Uniqueness.eq_4_55

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

fluid-limithazard-ratep2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1queueing

Let ψh(x,t)=exp⁡(rh(x,t))\psi_h(x,t) = \exp(r_h(x,t))ψh​(x,t)=exp(rh​(x,t)) be the function (4.45)–(4.46) for ℓ=h\ell = hℓ=h, the hazard rate. For x∈[0,M)x \in [0,M)x∈[0,M):

ψh(x,t)={1−G(x)1−G(x−t),0≤t≤x<M,1−G(x),0≤x≤t.\psi_h(x,t) = \begin{cases}\dfrac{1-G(x)}{1-G(x-t)}, & 0 \le t \le x < M,\\[2mm] 1-G(x), & 0 \le x \le t.\end{cases}ψh​(x,t)=⎩⎨⎧​1−G(x−t)1−G(x)​,1−G(x),​0≤t≤x<M,0≤x≤t.​

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 (1−G(x+t))/(1−G(x))(1-G(x+t))/(1-G(x))(1−G(x+t))/(1−G(x)) and 1−G(t−s)1-G(t-s)1−G(t−s) of the representation (4.3) come from.

Formalization Note. The paper's (4.55) also lists the value 000 "otherwise", and writes the second case as 0≤x≤t<∞0 \le x \le t < \infty0≤x≤t<∞ without x<Mx < Mx<M. For x≥Mx \ge Mx≥M the definition (4.46) gives rh=0r_h = 0rh​=0, hence ψh=1\psi_h = 1ψh​=1, not 000; only values on [0,M)×[0,∞)[0,M)\times[0,\infty)[0,M)×[0,∞) are used. We state the two cases on [0,M)[0,M)[0,M), 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
  • Endorsed by Shuze Chen · Oct 7, 2026

    Confirmed by the moderator at approval.

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