Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(5·3·4) — Σ₁^{n_t+1} y_i/(n_t + 1) → κ₁ with probability one (printed ν₁)

Proved
SmithRegenerative.Ergodic.eq_5_3_4

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

limit-theoremp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1regenerative-processstrong-law

Let t1,t2,…t_1, t_2, \dotst1​,t2​,… be a renewal process with t0=0t_0 = 0t0​=0 and μ1=Et1<∞\mu_1 = E t_1 < \inftyμ1​=Et1​<∞, and let wtw_twt​ be a cumulative process relative to it, with cycle increments yn=wTn−wTn−1y_n = w_{T_n} - w_{T_{n-1}}yn​=wTn​​−wTn−1​​. If E∣y1∣<∞E|y_1| < \inftyE∣y1​∣<∞ and κ1=Ey1\kappa_1 = E y_1κ1​=Ey1​, then, with probability one,

lim⁡t→∞∑i=1nt+1yint+1=κ1.\lim_{t \to \infty} \frac{\sum_{i=1}^{n_t+1} y_i}{n_t + 1} = \kappa_1 .t→∞lim​nt​+1∑i=1nt​+1​yi​​=κ1​.

This is the strong law of large numbers for the increments, evaluated at the random index nt+1n_t + 1nt​+1; combined with the renewal strong law it gives the limit of www along regeneration epochs.

Formalization Note The paper prints the limit as ν1\nu_1ν1​; that is a misprint for κ1\kappa_1κ1​ (ν1=Et0\nu_1 = E t_0ν1​=Et0​ is 000 here, and the next display of the proof concludes κ1/μ1\kappa_1/\mu_1κ1​/μ1​). The statement uses κ1\kappa_1κ1​. The limit is along real t→∞t \to \inftyt→∞.

Preamble
import Mathlib
import Definitions.Def_SmithRegenerative_Ergodic_Renewal
import Definitions.Def_SmithRegenerative_Ergodic_CumulativeProcess

open MeasureTheory ProbabilityTheory Filter Topology
Formal statement
namespace SmithRegenerative.Ergodic

/-- **(5·3·4)** (Smith, *Regenerative stochastic processes*, Proc. R. Soc. Lond. A
232(1188):6–31 (1955), §5·3, proof of Theorem 7, p. 27): "But, by the strong law of large
numbers, lim_{t=∞} Σ₁^{n_t+1} y_i/(n_t + 1) = ν₁ (5·3·4) with probability one".

Formalization Note: the printed right-hand side "ν₁" is a misprint for `κ₁ = E y₁`: `ν₁ = E t₀`
(2·1·2) is `0` here, and the next display of the proof concludes `κ₁/μ₁`. The statement uses
`κ₁ = ∫ y₁ dP`. Hypotheses are those in force in the proof of Theorem 7 that the display needs:
a renewal process with `t₀ = 0` and `μ₁ < ∞` (integrability of `t₁`), a cumulative process `w`
(`IsCumulativeProcess`; (C1) read literally, no joint independence of `t` and `y`), and
`E|y₁| < ∞`, stated directly as integrability of `y₁`. The limit is along real `t → ∞`. -/
theorem eq_5_3_4 {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω} [IsProbabilityMeasure P]
    (t : ℕ → Ω → ℝ) (w : ℝ → Ω → ℝ) (hren : IsRenewalProcess P t)
    (ht0 : ∀ ω, t 0 ω = 0) (hμ : Integrable (t 1) P) (hcum : IsCumulativeProcess P t w)
    (hκ : Integrable (cycleIncrement t w 1) P) :
    ∀ᵐ ω ∂P, Tendsto
      (fun s : ℝ => (∑ i ∈ Finset.Icc 1 (count t s ω + 1), cycleIncrement t w i ω) /
        ((count t s ω : ℝ) + 1))
      atTop (𝓝 (∫ ω, cycleIncrement t w 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 Theorem 7, (5·3·4)
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