Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.2(i) — upper tail: t^κP(R > t) = C₊ − (1/2π)ℜ∮ e^{−iθ log t} ĝ₁(θ)/(1 − η̂(θ)) dθ + O(t^{−β/2})

Open
GoldieRenewal.Rates.theorem_3_2_i

by tianyipeng · Nov 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

heavy-tailsimplicit-renewal-theoremrate-of-convergence

Let (Ω,A,P)(\Omega,\mathcal A,P)(Ω,A,P) be a probability space, κ>0\kappa>0κ>0, β>0\beta>0β>0, and let M≥0M\ge0M≥0 and RRR be independent real random variables with

EMκ=1  (2.3),EMκ+β<∞  (3.3),\mathbf E M^\kappa=1\ \ (2.3),\qquad \mathbf E M^{\kappa+\beta}<\infty\ \ (3.3),EMκ=1  (2.3),EMκ+β<∞  (3.3),

and (3.4): the conditional law of log⁡M\log MlogM given M≠0M\neq0M=0 is spread out. Let η(dx)=eκxP(log⁡M∈dx)\eta(dx)=e^{\kappa x}P(\log M\in dx)η(dx)=eκxP(logM∈dx) be the tilted law, and suppose that η\etaη satisfies the decomposition (3.1) and the subsequent conditions of Theorem 3.1 at this β\betaβ. Let g1(t)=eκt(P(R>et)−P(MR>et))g_1(t)=e^{\kappa t}\big(P(R>e^t)-P(MR>e^t)\big)g1​(t)=eκt(P(R>et)−P(MR>et)) (3.5), let C+C_+C+​ be the constant (2.12), and let C\mathscr CC be any admissible rectangle contour in the strip D={−β<ℑθ<0}D=\{-\beta<\Im\theta<0\}D={−β<ℑθ<0} enclosing all zeros of 1−η^1-\hat\eta1−η^​ in DDD. If

∫0∞∣P(R>t)−P(MR>t)∣ tκ+β−1 dt<∞(3.7),\int_0^\infty\big|P(R>t)-P(MR>t)\big|\,t^{\kappa+\beta-1}\,dt<\infty\qquad(3.7),∫0∞​​P(R>t)−P(MR>t)​tκ+β−1dt<∞(3.7),

then, as t→∞t\to\inftyt→∞,

tκP(R>t)=C+−12πℜ∮Ce−iθlog⁡t g^1(θ)1−η^(θ) dθ+O(t−β/2)(3.8).t^\kappa P(R>t)=C_+-\frac1{2\pi}\Re\oint_{\mathscr C}e^{-i\theta\log t}\,\frac{\hat g_1(\theta)}{1-\hat\eta(\theta)}\,d\theta+O(t^{-\beta/2})\qquad(3.8).tκP(R>t)=C+​−2π1​ℜ∮C​e−iθlogt1−η^​(θ)g^​1​(θ)​dθ+O(t−β/2)(3.8).

This is part (i) of Goldie's Theorem 3.2, the rate-of-approach refinement of the implicit renewal theorem for the upper tail: the second-order term of tκP(R>t)−C+t^\kappa P(R>t)-C_+tκP(R>t)−C+​ is an explicit contour integral determined by the zeros of 1−η^1-\hat\eta1−η^​ in the strip, up to an error O(t−β/2)O(t^{-\beta/2})O(t−β/2).

Formalization Note Same conventions as GoldieRenewal.Rates.theorem_3_2: (3.7) is printed with P(R>−t)P(R>-t)P(R>−t) and is read with P(R>t)P(R>t)P(R>t); integrability on (0,∞)(0,\infty)(0,∞) is IntegrableOn; the expansion is stated with the exponent −iθlog⁡t-i\theta\log t−iθlogt that the proof establishes (ExpansionPos); moments are lower Lebesgue integrals; M≥0M\ge0M≥0 almost surely.

Preamble
import Mathlib
import Definitions.Def_GoldieRenewal_Rates_Transforms
import Definitions.Def_GoldieRenewal_Rates_Model
import Definitions.Def_GoldieRenewal_Rates_Expansion

open MeasureTheory ProbabilityTheory
Formal statement
namespace GoldieRenewal.Rates

/-- **Theorem 3.2(i)** (Goldie 1991, p. 132; rate of approach in the implicit renewal theorem,
upper tail, `M ≥ 0`). Let `M ≥ 0` be independent of `R` with (2.3) `E|M|^κ = 1`, (3.3)
`E|M|^{κ+β} < ∞` for some `β > 0`, and (3.4) the conditional law of `log|M|` given `M ≠ 0`
spread out. Suppose `η(dx) := e^{κx}P(log M ∈ dx)` satisfies (3.1) and the subsequent
conditions of Theorem 3.1 (`StoneConditions η β`). Then (3.7)
`∫₀^∞ |P(R > t) − P(MR > t)| t^{κ+β−1} dt < ∞` implies (3.8):
for every admissible rectangle contour `𝒞`,
`t^κ P(R > t) = C₊ − (1/2π) ℜ ∮_𝒞 e^{−iθ log t} ĝ₁(θ)/(1 − η̂(θ)) dθ + O(t^{−β/2})`.
Formalization Note: this is part (i) of `GoldieRenewal.Rates.theorem_3_2`, with the same
conventions: (3.7) is read with `P(R > t)`; "`∫₀^∞ |h(t)| t^{κ+β−1} dt < ∞`" is
`IntegrableOn (h · t^{κ+β−1}) (0, ∞)`; (3.8) is `ExpansionPos` (exponent `−iθ log t`). -/
theorem theorem_3_2_i {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (M R : Ω → ℝ) (hM : Measurable M) (hR : Measurable R) (hM_nonneg : ∀ᵐ ω ∂P, 0 ≤ M ω)
    (h_indep : IndepFun R M P) (κ β : ℝ) (hκ : 0 < κ) (hβ : 0 < β)
    (h_2_3 : ∫⁻ ω, ENNReal.ofReal (|M ω| ^ κ) ∂P = 1)
    (h_3_3 : ∫⁻ ω, ENNReal.ofReal (|M ω| ^ (κ + β)) ∂P < ⊤)
    (h_3_4 : SpreadOut (logLawGivenNonzero P M))
    (h_stone : StoneConditions (tiltedLaw P M κ) β)
    (h_3_7 : IntegrableOn (fun t : ℝ =>
        (P.real {ω | t < R ω} - P.real {ω | t < M ω * R ω}) * t ^ (κ + β - 1)) (Set.Ioi 0)) :
    ExpansionPos P M R κ β := by sorry

end GoldieRenewal.Rates
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. 132, Theorem 3.2(i), (3.3)–(3.8)

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