Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 8 — (w_{t+Z_t} − w_t)/t^{1/p} → 0 with probability one when t₀ = 0, μ₁ < ∞, κ̃_p < ∞

Proved
SmithRegenerative.Ergodic.lemma_8

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

cumulative-processlimit-theoremp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1regenerative-process

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 (conditions (C1), (C2), with identically distributed cycle variations y~n\tilde y_ny~​n​). Let Zt=∑i=1nt+1ti−tZ_t = \sum_{i=1}^{n_t+1} t_i - tZt​=∑i=1nt​+1​ti​−t, so that t+Ztt + Z_tt+Zt​ is a regeneration epoch after ttt. If p>0p > 0p>0 and κ~p=Ey~1 p<∞\tilde\kappa_p = E \tilde y_1^{\,p} < \inftyκ~p​=Ey~​1p​<∞, then, with probability one,

lim⁡t→∞wt+Zt−wtt1/p=0.\lim_{t \to \infty} \frac{w_{t+Z_t} - w_t}{t^{1/p}} = 0 .t→∞lim​t1/pwt+Zt​​−wt​​=0.

The lemma says that the gap between the cumulative process at time ttt and at the next completed regeneration epoch is negligible. With p=1p = 1p=1 it reduces Theorem 7 to the behaviour of www along regeneration epochs.

Formalization Note κ~p<∞\tilde\kappa_p < \inftyκ~p​<∞ is integrability of y~1 p\tilde y_1^{\,p}y~​1p​ (real power; y~1≥0\tilde y_1 \ge 0y~​1​≥0). The condition w0=0w_0 = 0w0​=0 is not assumed. 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

/-- **Lemma 8** (Smith, *Regenerative stochastic processes*, Proc. R. Soc. Lond. A
232(1188):6–31 (1955), §5·3, p. 26): "If t₀ = 0, μ₁ < ∞, and κ̃_p < ∞ (p > 0), then
lim_{t=∞} (w_{t+Z_t} − w_t)/t^{1/p} = 0, with probability one."

Here `w_t` is a cumulative process (the standing context of §5·3), `Z_t = Σ_{i=1}^{n_t+1} t_i − t`
(p. 26) and `κ̃_p = E ỹ_1^p`, `ỹ_n` the variation of `w` over the `n`-th cycle.

Formalization Note: `μ₁ < ∞` is integrability of `t₁`; `κ̃_p < ∞` is integrability of `ỹ_1^p`
(real power; `ỹ_1 ≥ 0` at every sample point under the hypotheses). `w₀ = 0` is not assumed (the
lemma does not state it). The cumulative-process hypothesis is `IsCumulativeProcess`: (C1) read
literally, (C2), and `ỹ_n` identically distributed; no joint independence of cycle lengths and
increments. `t^{1/p}` is `Real.rpow`; the limit is along real `t → ∞`. The page's proof bound
(5·3·1) by `ỹ_{n_t+1}` alone omits the cycle `n_t`; the statement itself is unaffected. -/
theorem lemma_8 {Ω : 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)
    (p : ℝ) (hp : 0 < p) (hκ : Integrable (fun ω => cycleVariation t w 1 ω ^ p) P) :
    ∀ᵐ ω ∂P, Tendsto (fun s : ℝ => (w (s + Z t s ω) ω - w s ω) / s ^ (1 / p)) atTop
      (𝓝 0) := 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, pp. 26–27, §5·3, 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