Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 9.3 — if ∫₀^t u^κ P(R > u) du ~ C₊t, then P(R > t) ~ C₊t^{−κ}

Proved
GoldieRenewal.Implicit.lemma_9_3

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

heavy-tailsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1tauberian-theorem

Let RRR be a real random variable, κ>0\kappa>0κ>0 and C+∈RC_+\in\mathbb RC+​∈R. If

∫0tuκP(R>u) du∼C+t(t→∞),\int_0^t u^\kappa P(R>u)\,du \sim C_+ t\qquad (t\to\infty),∫0t​uκP(R>u)du∼C+​t(t→∞),

then

P(R>t)∼C+t−κ(t→∞).P(R>t)\sim C_+t^{-\kappa}\qquad(t\to\infty).P(R>t)∼C+​t−κ(t→∞).

This Tauberian step turns the averaged statement delivered by the key renewal theorem into the pointwise tail asymptotics (2.10); monotonicity of t↦P(R>t)t\mapsto P(R>t)t↦P(R>t) is what makes it possible.

Formalization Note "∫0t⋯∼C+t\int_0^t\cdots\sim C_+t∫0t​⋯∼C+​t" is read as t−1∫0tuκP(R>u) du→C+t^{-1}\int_0^t u^\kappa P(R>u)\,du\to C_+t−1∫0t​uκP(R>u)du→C+​ and "P(R>t)∼C+t−κP(R>t)\sim C_+t^{-\kappa}P(R>t)∼C+​t−κ" as tκP(R>t)→C+t^\kappa P(R>t)\to C_+tκP(R>t)→C+​; for C+=0C_+=0C+​=0 these are o(t)o(t)o(t) and o(t−κ)o(t^{-\kappa})o(t−κ), the paper's reading (p. 130).

Preamble
import Mathlib
open MeasureTheory Filter Topology
Formal statement
namespace GoldieRenewal.Implicit

/-- **Lemma 9.3** (Goldie 1991, Ann. Appl. Probab. 1(1), p. 143). If
`∫₀^t u^κ P(R > u) du ~ C₊ t` as `t → ∞`, then `P(R > t) ~ C₊ t^{−κ}` as `t → ∞`.

**Formalization Note** `R` is any real random variable and `κ > 0` (the standing exponent of §2).
"`~ C₊ t`" is read as `(∫₀^t u^κ P(R > u) du) / t → C₊` and "`P(R > t) ~ C₊ t^{−κ}`" as
`t^κ P(R > t) → C₊`, which includes the case `C₊ = 0` read as `o(t)` and `o(t^{−κ})` (the paper's
convention, p. 130). The integrand is bounded and measurable on `[0, t]`, so the interval integral is
the paper's value. -/
theorem lemma_9_3 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (R : Ω → ℝ) (hR : Measurable R) (κ : ℝ) (hκ : 0 < κ) (C : ℝ)
    (h : Tendsto (fun t : ℝ => (∫ u in (0 : ℝ)..t, u ^ κ * P.real {ω | u < R ω}) / t)
      atTop (𝓝 C)) :
    Tendsto (fun t : ℝ => t ^ κ * P.real {ω | t < R ω}) atTop (𝓝 C) := by sorry

end GoldieRenewal.Implicit
Source
Goldie, Implicit renewal theory and tails of solutions of random equations, Ann. Appl. Probab. 1(1):126–166 (1991), DOI 10.1214/aoap/1177005985, p. 143, Lemma 9.3
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