Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(9.16), p. 148 — in Case 2b (M ≤ 0 a.s.), ∫₀^∞ |P(R > t) − P(MM′R > t)| t^{κ−1} dt < ∞

Proved
GoldieRenewal.Implicit.eq_9_16

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

heavy-tailsp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theory

Let MMM satisfy the conditions of Lemma 2.2 with M≤0M\le0M≤0 a.s., let M′M'M′ have the law of MMM, and let R,M,M′R, M, M'R,M,M′ be independent. If (2.8) and (2.9) hold, then

∫0∞∣P(R>t)−P(MM′R>t)∣ tκ−1 dt<∞.(9.16)\int_0^\infty |P(R>t)-P(MM'R>t)|\,t^{\kappa-1}\,dt<\infty . \tag{9.16}∫0∞​∣P(R>t)−P(MM′R>t)∣tκ−1dt<∞.(9.16)

This reduces Case 2b to Case 1: the product MM′MM'MM′ is nonnegative and satisfies the conditions of Lemma 2.2 with the same κ\kappaκ, and (9.16) is condition (2.8) for it.

Formalization Note The conclusion is condition (2.8) with MM′MM'MM′ in place of MMM. The copy M′M'M′ lives on the same probability space as RRR and MMM (the paper's common probability space, p. 144).

Preamble
import Mathlib
import Definitions.Def_GoldieRenewal_Implicit_CramerConditions
import Definitions.Def_GoldieRenewal_Implicit_TailConstants
open MeasureTheory ProbabilityTheory
Formal statement
namespace GoldieRenewal.Implicit

/-- **(9.16)** (Goldie 1991, Ann. Appl. Probab. 1(1), §9, proof of Theorem 2.3, Case 2b, p. 148).
Suppose `M` satisfies the conditions of Lemma 2.2 and `M ≤ 0` a.s., `M′` has the law of `M`, and
`R, M, M′` are independent. If (2.8) and (2.9) hold, then
`∫₀^∞ |P(R > t) − P(MM′R > t)| t^{κ−1} dt < ∞`.

**Formalization Note** The conclusion is (2.8) for the multiplier `MM′` in place of `M`
(`TailCondPlus P (M·M′) R κ`, integrability of the signed integrand on `(0, ∞)`). The copy `M′` is
assumed on the given probability space (the paper's "common probability space", p. 144):
the statement quantifies over every space carrying such `R, M, M′`. -/
theorem eq_9_16 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (M M' R : Ω → ℝ) (hM : Measurable M) (hM' : Measurable M') (hR : Measurable R) (κ : ℝ)
    (hC : CramerConditions κ (P.map M)) (hident : IdentDistrib M' M P P)
    (hind : iIndepFun (fun i : Fin 3 => (![R, M, M'] : Fin 3 → Ω → ℝ) i) P)
    (hM_nonpos : ∀ᵐ ω ∂P, M ω ≤ 0)
    (h28 : TailCondPlus P M R κ) (h29 : TailCondMinus P M R κ) :
    TailCondPlus P (fun ω => M ω * M' ω) R κ := 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, §9, proof of Theorem 2.3, Case 2b, (9.16), p. 148
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