Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9 — moment of the cycle containing time t

Proved
SmithRegenerative.Moments.lemma_9_cycle_moment

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

moment-boundp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theory

Let (wt)(w_t)(wt​) be a cumulative process with cycle lengths tnt_ntn​, cycle increments yn=wTn−wTn−1y_n=w_{T_n}-w_{T_{n-1}}yn​=wTn​​−wTn−1​​, and let ntn_tnt​ be the number of renewal epochs in [0,t][0,t][0,t], so that cycle ntn_tnt​, the interval [Tnt−1,Tnt)[T_{n_t-1},T_{n_t})[Tnt​−1​,Tnt​​), contains ttt. If p>0p>0p>0 and E∣y1∣p<∞\mathbb E|y_1|^p<\inftyE∣y1​∣p<∞, then ∣ynt∣p|y_{n_t}|^p∣ynt​​∣p is integrable for every t≥0t\geq0t≥0, and

E∣ynt∣p=o(t)(t→∞).\mathbb E|y_{n_t}|^{p}=o(t)\qquad(t\to\infty).E∣ynt​​∣p=o(t)(t→∞).

The cycle containing ttt is length-biased, so its moment is not E∣y1∣p\mathbb E|y_1|^pE∣y1​∣p; the lemma says it still grows sublinearly. Applied to the variation process w~t\tilde w_tw~t​, whose cycle increments are y~n\tilde y_ny~​n​, it controls the incomplete-cycle remainder in both parts of Theorem 8.

Formalization Note Smith writes Ey1p\mathbb E y_1^pEy1p​ for real p>0p>0p>0 and his proof integrates from 0−0-0−, i.e. treats a nonnegative cycle quantity. The statement is taken for ∣yn∣p|y_n|^p∣yn​∣p: it is the printed lemma when y≥0y\ge0y≥0 (in particular for y~\tilde yy~​) and the meaningful pppth moment for a signed increment. The power is the real power Real.rpow of a nonnegative number.

Preamble
import Mathlib
import Definitions.Def_SmithRegenerative_Moments_CumulativeProcess
Formal statement
namespace SmithRegenerative.Moments

open MeasureTheory Filter

/-- Smith, *Regenerative stochastic processes*, Proc. R. Soc. Lond. A
232(1188):6–31 (1955), p. 28, Lemma 9.
Formalization Note: the paper writes `Ey₁^p` for a real `p > 0` without saying
`y₁ ≥ 0`; its proof integrates from `0−`, i.e. treats a nonnegative cycle
quantity. The statement is taken for `|y_n|^p`, which is the printed lemma when
`y ≥ 0` and the meaningful `p`th moment for a signed `y`. Theorem 8 applies it to
the cumulative process `w̃` (whose cycle increments are the `ỹ_n ≥ 0`).
`y_{n_t}` is the increment of cycle `n_t`, the cycle `[T_{n_t-1}, T_{n_t})`
containing `t`. -/
theorem lemma_9_cycle_moment {Ω : Type*} [MeasurableSpace Ω]
    (C : CumulativeProcess Ω) (p : ℝ) (hp : 0 < p)
    (hκp : Integrable
      (fun ω => |cycleReward C.renewal C.w 1 ω| ^ p) C.renewal.P) :
    (∀ t : ℝ, 0 ≤ t → Integrable
      (fun ω => |cycleReward C.renewal C.w (C.renewal.count t ω) ω| ^ p)
        C.renewal.P) ∧
    (fun t : ℝ =>
      ∫ ω, |cycleReward C.renewal C.w (C.renewal.count t ω) ω| ^ p
        ∂C.renewal.P) =o[atTop] (fun t : ℝ => t) := by sorry

end SmithRegenerative.Moments
Source
Smith, Regenerative stochastic processes, Proc. R. Soc. Lond. A 232(1188):6–31 (1955), DOI 10.1098/rspa.1955.0198, p. 28, Lemma 9
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