Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5·3, p. 27 — the renewal strong law: n_t/t → 1/μ₁ with probability one

Proved
SmithRegenerative.CLT.renewal_slln

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

limit-theoremp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theorystrong-law

Let t1,t2,…t_1, t_2, \dotst1​,t2​,… be a renewal process — independent, identically distributed, non-negative random variables with P{t1=0}<1P\{t_1 = 0\} < 1P{t1​=0}<1 — with t0=0t_0 = 0t0​=0, and let ntn_tnt​ be the number of epochs Tk=t0+⋯+tkT_k = t_0 + \dots + t_kTk​=t0​+⋯+tk​ (k≥0k \ge 0k≥0) in [0,t][0, t][0,t]. If μ1=Et1<∞\mu_1 = E t_1 < \inftyμ1​=Et1​<∞, then with probability one

lim⁡t→∞ntt=1μ1.\lim_{t \to \infty} \frac{n_t}{t} = \frac{1}{\mu_1}.t→∞lim​tnt​​=μ1​1​.

This is the strong law of large numbers for renewal processes; it is the step that lets the random number of cycles completed by time ttt be replaced by the deterministic quantity t/μ1t/\mu_1t/μ1​ in the proofs of Lemma 8 and Theorem 9.

Formalization Note The limit is along the real time t→∞t \to \inftyt→∞. μ1>0\mu_1 > 0μ1​>0 follows from the hypotheses.

Preamble
import Mathlib
import Definitions.Def_SmithRegenerative_CLT_CumulativeProcess

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace SmithRegenerative.CLT

/-- Smith (1955), §5·3, proof of Lemma 8, p. 27 (unnumbered): "It may easily be deduced from
renewal theory (see Doob, 1948) that `n_t/t → μ₁⁻¹` with probability one."

For a renewal process with `t₀ = 0` and `μ₁ = E t₁ < ∞`, `n_t / t → 1/μ₁` almost surely as the
real time `t → ∞`. -/
theorem renewal_slln {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (τ : ℕ → Ω → ℝ) (hτ : IsRenewal P τ) (hμ : Integrable (τ 1) P) :
    ∀ᵐ ω ∂P, Tendsto (fun t : ℝ => (count τ t ω : ℝ) / t) atTop (𝓝 (mu1 P τ)⁻¹) := by sorry

end SmithRegenerative.CLT
Source
Smith, Regenerative stochastic processes, Proc. R. Soc. Lond. A 232(1188):6–31 (1955), DOI 10.1098/rspa.1955.0198, p. 27, §5·3, proof of Lemma 8
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