Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§1.2, p. 246 — the elementary renewal theorem: H(t)/t → μ₁⁻¹ as t → ∞ (μ₁ ≤ ∞, limit 0 if μ₁ = ∞)

Proved
SmithRenewal.Elementary.elementary_renewal_theorem

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

elementary-renewal-theoremlimit-theoremp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theory

Let X1,X2,…X_1, X_2, \dotsX1​,X2​,… be a renewal process: independent, identically distributed, non-negative random variables that do not vanish with probability one. Let Sn=X1+⋯+XnS_n = X_1 + \dots + X_nSn​=X1​+⋯+Xn​, let NtN_tNt​ be the number of renewals n≥1n \ge 1n≥1 with Sn≤tS_n \le tSn​≤t, let H(t)=ENtH(t) = \mathbb E N_tH(t)=ENt​ be the renewal function and μ1=EXi≤∞\mu_1 = \mathbb E X_i \le \inftyμ1​=EXi​≤∞ the mean lifetime. Then

H(t)t⟶μ1−1(t→∞),\frac{H(t)}{t} \longrightarrow \mu_1^{-1} \qquad (t \to \infty),tH(t)​⟶μ1−1​(t→∞),

where the limit μ1−1\mu_1^{-1}μ1−1​ is interpreted as zero if μ1=∞\mu_1 = \inftyμ1​=∞.

The elementary renewal theorem is the first-order asymptotics of the renewal function: in the long run renewals occur at rate 1/μ11/\mu_11/μ1​ on average. It underlies long-run average cost and reward computations for renewal and regenerative models in inventory, maintenance and queueing.

Formalization Note H(t)H(t)H(t) and μ1\mu_1μ1​ are lower integrals in [0,∞][0,\infty][0,∞], the ratio is formed in [0,∞][0,\infty][0,∞], and the limit is the inverse in [0,∞][0,\infty][0,∞], where ∞−1=0\infty^{-1} = 0∞−1=0 is exactly the paper's convention. No hypothesis on μ1\mu_1μ1​, no second moment and no non-lattice condition is assumed.

Preamble
import Mathlib
import Definitions.Def_SmithRenewal_Elementary_RenewalProcess

open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal
Formal statement
namespace SmithRenewal.Elementary

/-- The elementary renewal theorem (Smith, *Renewal Theory and Its Ramifications*, J. R. Statist. Soc. B 20(2):243–283 (1958), §1.2, p. 246, unnumbered display): "H(t)/t → μ₁⁻¹ as
t → ∞, where μ₁ = EX_i ≤ ∞, and the limit μ₁⁻¹ is interpreted as zero if μ₁ = ∞."

Formalization Note: `H(t) = E N_t` and `μ₁ = E X_i` are lower integrals in `[0, ∞]`, the ratio
is `H(t) / ofReal t` in `[0, ∞]` and the limit `μ₁⁻¹` is the inverse in `[0, ∞]`, so
`∞⁻¹ = 0` is exactly the paper's convention. No hypothesis on `μ₁` is made (`μ₁ > 0` follows
from `P {X_i = 0} < 1`). -/
theorem elementary_renewal_theorem {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (X : ℕ → Ω → ℝ) (hX : IsRenewalProcess P X) :
    Tendsto (fun t : ℝ => H X P t / ENNReal.ofReal t) atTop (𝓝 (mu1 X P)⁻¹) := by sorry

end SmithRenewal.Elementary
Source
Smith, Renewal Theory and Its Ramifications, J. R. Statist. Soc. B 20(2):243–283 (1958), DOI 10.1111/j.2517-6161.1958.tb00294.x, §1.2, p. 246, elementary renewal theorem
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