Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 2.2 — under (2.3)–(2.5), −∞ ≤ E log|M| < 0 and m = E|M|^κ log|M| ∈ (0, ∞)

Proved
GoldieRenewal.Implicit.lemma_2_2

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

cramer-conditionp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1renewal-theory

Let MMM be a real random variable such that, for some κ>0\kappa>0κ>0,

(2.3) E∣M∣κ=1,(2.4) E∣M∣κlog⁡+∣M∣<∞,\text{(2.3)}\ E|M|^\kappa = 1,\qquad \text{(2.4)}\ E|M|^\kappa\log^+|M|<\infty,(2.3) E∣M∣κ=1,(2.4) E∣M∣κlog+∣M∣<∞,

and (2.5) the conditional law of log⁡∣M∣\log|M|log∣M∣ given M≠0M\neq0M=0 is nonarithmetic. Then

(2.6)−∞≤Elog⁡∣M∣<0and(2.7)m:=E∣M∣κlog⁡∣M∣∈(0,∞).\text{(2.6)}\quad -\infty\le E\log|M|<0 \qquad\text{and}\qquad \text{(2.7)}\quad m := E|M|^\kappa\log|M|\in(0,\infty).(2.6)−∞≤Elog∣M∣<0and(2.7)m:=E∣M∣κlog∣M∣∈(0,∞).

Lemma 2.2 shows that the Cramér-type conditions force a negative drift of log⁡∣M∣\log|M|log∣M∣ and a finite positive constant mmm; mmm is the mean of the tilted law η(du)=eκuP(log⁡∣M∣∈du)\eta(du) = e^{\kappa u}P(\log|M|\in du)η(du)=eκuP(log∣M∣∈du) and is the normalising constant of the implicit renewal theorem.

Formalization Note (2.6) is stated as: Elog⁡+∣M∣<∞E\log^+|M|<\inftyElog+∣M∣<∞, so that Elog⁡∣M∣=Elog⁡+∣M∣−Elog⁡−∣M∣E\log|M| = E\log^+|M| - E\log^-|M|Elog∣M∣=Elog+∣M∣−Elog−∣M∣ is a well-defined extended real (with log⁡0=−∞\log 0=-\inftylog0=−∞), and this extended real is negative; the value −∞-\infty−∞ is allowed. (2.7) is stated as integrability of ∣M∣κlog⁡∣M∣|M|^\kappa\log|M|∣M∣κlog∣M∣ together with m>0m>0m>0.

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

/-- **Lemma 2.2** (Goldie, *Implicit renewal theory and tails of solutions of random equations*,
Ann. Appl. Probab. 1(1):126–166 (1991), p. 129). Let `M` be a random variable such that, for some
`κ > 0`, (2.3) `E|M|^κ = 1`, (2.4) `E|M|^κ log⁺|M| < ∞` and (2.5) the conditional law of `log|M|`
given `M ≠ 0` is nonarithmetic. Then (2.6) `−∞ ≤ E log|M| < 0` and (2.7)
`m := E|M|^κ log|M| ∈ (0, ∞)`.

**Formalization Note** The hypotheses are `CramerConditions κ (P.map M)` (the law of `M`).
(2.6) is stated as: `E log⁺|M| < ∞` (so `E log|M| = E log⁺|M| − E log⁻|M|` is a well-defined element
of `[−∞, ∞)`, with `log 0 = −∞`), and this extended real is `< 0`; the value `−∞` is allowed, as in
the paper. (2.7) is stated as integrability of `|M|^κ log|M|` (finiteness) together with `0 < m`. -/
theorem lemma_2_2 {Ω : Type*} [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
    (M : Ω → ℝ) (hM : Measurable M) (κ : ℝ) (hC : CramerConditions κ (P.map M)) :
    (logPlusMoment (P.map M) < ∞ ∧ logAbsMean (P.map M) < 0) ∧
      (Integrable (fun x : ℝ => |x| ^ κ * Real.log |x|) (P.map M) ∧
        0 < cramerMean κ (P.map M)) := 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. 129, Lemma 2.2
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