Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5·3, proof of Lemma 8 — the renewal strong law n_t/t → 1/μ₁ with probability one

Proved
SmithRegenerative.Ergodic.count_div_tendsto

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. Let t0=0t_0 = 0t0​=0, Tk=t1+⋯+tkT_k = t_1 + \dots + t_kTk​=t1​+⋯+tk​, and let nt=#{k≥0:Tk≤t}n_t = \#\{k \ge 0 : T_k \le t\}nt​=#{k≥0:Tk​≤t} be the number of regenerations 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 renewal-theoretic strong law the paper quotes from Doob (1948). It converts statements indexed by the number of cycles into statements indexed by time, and is used in Lemma 8 and in Theorem 7.

Formalization Note The limit is taken along real t→∞t \to \inftyt→∞. The hypothesis P{t1=0}<1P\{t_1 = 0\} < 1P{t1​=0}<1 implies μ1>0\mu_1 > 0μ1​>0; positivity is not assumed separately.

Preamble
import Mathlib
import Definitions.Def_SmithRegenerative_Ergodic_Renewal

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace SmithRegenerative.Ergodic

/-- **Renewal strong law** (Smith, *Regenerative stochastic processes*, Proc. R. Soc. Lond. A
232(1188):6–31 (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."

The context of the sentence is Lemma 8: `t₀ = 0` and `μ₁ = E t₁ < ∞`.

Formalization Note: `t` is a renewal process (`IsRenewalProcess`: `t₁, t₂, …` i.i.d.,
non-negative, `P{t₁ = 0} < 1`) with delay `t₀ = 0` at every sample point; `μ₁ < ∞` is
integrability of `t₁`, and `μ₁ = ∫ t₁ dP`, which is strictly positive under the hypotheses (it
is not assumed separately). `n_t` is `count t t ω`, the number of `k ≥ 0` with `T_k ≤ t`. The
limit is along real `t → ∞`. -/
theorem count_div_tendsto {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω}
    [IsProbabilityMeasure P] (t : ℕ → Ω → ℝ) (hren : IsRenewalProcess P t)
    (ht0 : ∀ ω, t 0 ω = 0) (hμ : Integrable (t 1) P) :
    ∀ᵐ ω ∂P, Tendsto (fun s : ℝ => (count t s ω : ℝ) / s) atTop
      (𝓝 (∫ ω, t 1 ω ∂P)⁻¹) := by sorry

end SmithRegenerative.Ergodic
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 (unnumbered)
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