§5·3, p. 27 — the renewal strong law: n_t/t → 1/μ₁ with probability one
ProvedSmithRegenerative.CLT.renewal_sllnlimit-theoremp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theorystrong-law
Let be a renewal process — independent, identically distributed, non-negative random variables with — with , and let be the number of epochs () in . If , then with probability one
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 be replaced by the deterministic quantity in the proofs of Lemma 8 and Theorem 9.
Formalization Note The limit is along the real time . 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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.