Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 1, p. 638 — reciprocal asymptotic rates of a time change and its inverse

Proved
HLambdaG.Main.lemma_1

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

inversep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1queueingsample-pathtime-change

Let TTT be a finite, nonnegative, nondecreasing, right-continuous time change on [0,∞)[0,\infty)[0,∞) with T(s)→∞T(s)\to\inftyT(s)→∞, and let S(t)=inf⁡{s≥0:T(s)>t}S(t)=\inf\{s\geq0:T(s)>t\}S(t)=inf{s≥0:T(s)>t}. For every fixed λ>0\lambda>0λ>0,

S(t)t⟶λ(t→∞)⟺T(s)s⟶λ−1(s→∞).\frac{S(t)}{t}\longrightarrow\lambda\quad(t\to\infty) \quad\Longleftrightarrow\quad \frac{T(s)}{s}\longrightarrow\lambda^{-1}\quad(s\to\infty).tS(t)​⟶λ(t→∞)⟺sT(s)​⟶λ−1(s→∞).

This inversion principle translates a growth rate between the customer and time scales used in the main theorem.

Formalization Note The ratios are real-valued. Their values at zero are irrelevant to limits at infinity.

Preamble
import Mathlib
import Definitions.Def_HLambdaG_Main_Setting

open scoped NNReal
Formal statement
namespace HLambdaG.Main

open Filter Topology

/-- Lemma 1, p. 638: reciprocal asymptotic rates for a time change and its inverse. -/
theorem lemma_1 (τ : TimeChange) (lam : ℝ) (hlam : 0 < lam) :
    Tendsto (fun t : ℝ≥0 => (inv τ t : ℝ) / (t : ℝ)) atTop (𝓝 lam) ↔
      Tendsto (fun s : ℝ≥0 => (τ.T s : ℝ) / (s : ℝ)) atTop (𝓝 lam⁻¹) := by sorry

end HLambdaG.Main
Source
Glynn and Whitt, Extensions of the queueing relations L = λW and H = λG, Oper. Res. 37 (1989), p. 638, Lemma 1, https://doi.org/10.1287/opre.37.4.634
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

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