(5·3·4) — Σ₁^{n_t+1} y_i/(n_t + 1) → κ₁ with probability one (printed ν₁)
ProvedSmithRegenerative.Ergodic.eq_5_3_4limit-theoremp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1regenerative-processstrong-law
Let be a renewal process with and , and let be a cumulative process relative to it, with cycle increments . If and , then, with probability one,
This is the strong law of large numbers for the increments, evaluated at the random index ; combined with the renewal strong law it gives the limit of along regeneration epochs.
Formalization Note The paper prints the limit as ; that is a misprint for ( is here, and the next display of the proof concludes ). The statement uses . The limit is along real .
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
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.