Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proof of Theorem 3.2(i), pp. 154–155 — ℜr₁ is bounded, measurable and satisfies the Tauberian condition (9.25) with p = 1

Proved
GoldieRenewal.Rates.r1_bounded_tauberian

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

implicit-renewal-theoremrate-of-convergencetauberian

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 satisfying the hypotheses of Goldie's Theorem 3.2: EMκ=1\mathbf E M^\kappa=1EMκ=1 (2.3), EMκ+β<∞\mathbf E M^{\kappa+\beta}<\inftyEMκ+β<∞ (3.3), the conditional law of log⁡M\log MlogM given M≠0M\ne0M=0 is spread out (3.4), and the tilted law η(dx)=eκxP(log⁡M∈dx)\eta(dx)=e^{\kappa x}P(\log M\in dx)η(dx)=eκxP(logM∈dx) satisfies (3.1) and the subsequent conditions of Theorem 3.1. Assume (3.7): ∫0∞∣P(R>t)−P(MR>t)∣ tκ+β−1 dt<∞\int_0^\infty|P(R>t)-P(MR>t)|\,t^{\kappa+\beta-1}\,dt<\infty∫0∞​∣P(R>t)−P(MR>t)∣tκ+β−1dt<∞. Let C\mathscr CC be the positively oriented boundary of an axis-parallel rectangle contained in the strip D={−β<ℑθ<0}D=\{-\beta<\Im\theta<0\}D={−β<ℑθ<0} whose interior contains every zero of 1−η^1-\hat\eta1−η^​ in DDD. Write 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), g^1(θ)=∫Reiθtg1(t) dt\hat g_1(\theta)=\int_{\mathbb R}e^{i\theta t}g_1(t)\,dtg^​1​(θ)=∫R​eiθtg1​(t)dt, and

c(t)=12π∮Ce−iθt1−η^(θ) dθ.c(t)=\frac1{2\pi}\oint_{\mathscr C}\frac{e^{-i\theta t}}{1-\hat\eta(\theta)}\,d\theta .c(t)=2π1​∮C​1−η^​(θ)e−iθt​dθ.

Let r(t)=eκtP(R>et)r(t)=e^{\kappa t}P(R>e^t)r(t)=eκtP(R>et) and r1(t)=C+−r(t)−(g1∗c)(t) 1t>0r_1(t)=C_+-r(t)-(g_1*c)(t)\,\mathbf 1_{t>0}r1​(t)=C+​−r(t)−(g1​∗c)(t)1t>0​, where (g1∗c)(t)=∫Rg1(u)c(t−u) du(g_1*c)(t)=\int_{\mathbb R}g_1(u)c(t-u)\,du(g1​∗c)(t)=∫R​g1​(u)c(t−u)du and C+C_+C+​ is the constant (2.12). Then f:=ℜr1f:=\Re r_1f:=ℜr1​ is measurable and bounded on R\mathbb RR, and there are constants AAA, x0x_0x0​ such that the Tauberian condition (9.25) of Theorem 9.6 holds with p=1p=1p=1:

f(x)−f(x+y)≤A e−βx/2,0≤y≤e−βx/2, x>x0.f(x)-f(x+y)\le A\,e^{-\beta x/2},\qquad 0\le y\le e^{-\beta x/2},\ x>x_0 .f(x)−f(x+y)≤Ae−βx/2,0≤y≤e−βx/2, x>x0​.

These are the hypotheses on fff under which the Beurling–Ganelius Tauberian remainder theorem (Theorem 9.6, with the kernel K(t)=be−bt1t>0K(t)=be^{-bt}\mathbf 1_{t>0}K(t)=be−bt1t>0​, for which one may take p=1p=1p=1) turns (9.24), K∗ℜr1(t)=o(e−βt)K*\Re r_1(t)=o(e^{-\beta t})K∗ℜr1​(t)=o(e−βt), into ℜr1(t)=O(e−βt/2)\Re r_1(t)=O(e^{-\beta t/2})ℜr1​(t)=O(e−βt/2) in the proof of Theorem 3.2(i).

Formalization Note r1r_1r1​ is r1Fun, ccc is cFun, g1g_1g1​ is gPos; the contour is described by EnclosesZerosInStrip and RectangleIntegral. The exponent −βx/(p+1)-\beta x/(p+1)−βx/(p+1) of (9.25) is written with p=1p=1p=1.

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

open MeasureTheory ProbabilityTheory Complex
Formal statement
namespace GoldieRenewal.Rates

/-- **Hypotheses of Theorem 9.6 for `ℜ r₁`** (Goldie 1991, proof of Theorem 3.2(i),
pp. 154–155). Under the hypotheses of Theorem 3.2 and (3.7), for an admissible rectangle
contour `𝒞`, the function `f := ℜ r₁`, with `r₁(t) = C₊ − r(t) − g₁ ∗ c(t) 1_{t>0}`, is
measurable, bounded, and satisfies the Tauberian condition (9.25) with `p = 1`:
`f(x) − f(x + y) ≤ A e^{−βx/2}` for `0 ≤ y ≤ e^{−βx/2}`, `x > x₀`, for some `A`, `x₀`. -/
theorem r1_bounded_tauberian {Ω : 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))
    (z w : ℂ)
    (h_C : EnclosesZerosInStrip (fun θ => 1 - charTransform (tiltedLaw P M κ) θ) β z w) :
    Measurable (fun t : ℝ => (r1Fun P M R κ z w t).re) ∧
    (∃ B : ℝ, ∀ x : ℝ, |(r1Fun P M R κ z w x).re| ≤ B) ∧
    ∃ A x₀ : ℝ, ∀ x : ℝ, x₀ < x → ∀ y : ℝ, 0 ≤ y → y ≤ Real.exp (-(β * x) / 2) →
      (r1Fun P M R κ z w x).re - (r1Fun P M R κ z w (x + y)).re ≤
        A * Real.exp (-(β * x) / 2) := 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, §9, proof of Theorem 3.2(i), pp. 154–155 (verification of the hypotheses of Theorem 9.6 for ℜr₁)

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