Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§5·3, proof of Theorem 7 — w_{t+Z_t}/t → κ₁/μ₁ with probability one

Proved
SmithRegenerative.Ergodic.regeneration_limit

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

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

Under the hypotheses of Theorem 7 — wtw_twt​ a cumulative process, μ1=Et1<∞\mu_1 = E t_1 < \inftyμ1​=Et1​<∞, κ~1=Ey~1<∞\tilde\kappa_1 = E\tilde y_1 < \inftyκ~1​=Ey~​1​<∞, t0=0t_0 = 0t0​=0 and w0=0w_0 = 0w0​=0 — let Zt=∑i=1nt+1ti−tZ_t = \sum_{i=1}^{n_t+1} t_i - tZt​=∑i=1nt​+1​ti​−t. Then, with probability one,

lim⁡t→∞wt+Ztt=κ1μ1,\lim_{t \to \infty} \frac{w_{t+Z_t}}{t} = \frac{\kappa_1}{\mu_1},t→∞lim​twt+Zt​​​=μ1​κ1​​,

where κ1=Ey1\kappa_1 = E y_1κ1​=Ey1​.

This is the ergodic theorem along the regeneration epochs t+Zt=Tnt+1t + Z_t = T_{n_t+1}t+Zt​=Tnt​+1​; Lemma 8 then transfers it to all times ttt.

Formalization Note μ1<∞\mu_1 < \inftyμ1​<∞ and κ~1<∞\tilde\kappa_1 < \inftyκ~1​<∞ are integrability hypotheses; μ1>0\mu_1 > 0μ1​>0 follows from P{t1=0}<1P\{t_1 = 0\} < 1P{t1​=0}<1 and is not assumed separately. 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

/-- **The ergodic limit along regeneration epochs** (Smith, *Regenerative stochastic processes*,
Proc. R. Soc. Lond. A 232(1188):6–31 (1955), §5·3, proof of Theorem 7, p. 27, unnumbered):
"Thus, from (5·3·3) and (5·3·4), lim_{t=∞} w_{t+Z_t}/t = κ₁/μ₁, with probability one."

Hypotheses are those of Theorem 7: `w_t` a cumulative process, `μ₁ < ∞`, `κ̃₁ < ∞`, `t₀ = 0`,
`w₀ = 0`.

Formalization Note: `t + Z_t = Σ_{i=1}^{n_t+1} t_i` is a regeneration epoch. `μ₁ < ∞` is
integrability of `t₁` and `κ̃₁ < ∞` integrability of `ỹ₁`; `μ₁ = ∫ t₁ dP` (strictly positive,
since `P{t₁ = 0} < 1`; not assumed separately) and `κ₁ = ∫ y₁ dP`. `w₀ = 0` holds at every
sample point. `IsCumulativeProcess` reads (C1) literally, with `ỹ_n` identically distributed and
no joint independence of `t` and `y`. The limit is along real `t → ∞`. -/
theorem regeneration_limit {Ω : Type*} [MeasurableSpace Ω] {P : Measure Ω}
    [IsProbabilityMeasure P] (t : ℕ → Ω → ℝ) (w : ℝ → Ω → ℝ) (hren : IsRenewalProcess P t)
    (ht0 : ∀ ω, t 0 ω = 0) (hw0 : ∀ ω, w 0 ω = 0) (hμ : Integrable (t 1) P)
    (hcum : IsCumulativeProcess P t w) (hκ : Integrable (cycleVariation t w 1) P) :
    ∀ᵐ ω ∂P, Tendsto (fun s : ℝ => w (s + Z t s ω) ω / s) atTop
      (𝓝 ((∫ ω, cycleIncrement t w 1 ω ∂P) / ∫ ω, 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 Theorem 7 (display after (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