Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.1 (part 1) — R =_L Q + MR has a unique stationary law

Open
GoldieRenewal.Kesten.existence_uniqueness

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

kesten-theoremperpetuityrandom-difference-equation

Let QQQ and MMM be random variables with joint law μ\muμ on R2\mathbb R^2R2 (no independence and no sign condition is assumed). Suppose MMM satisfies the conditions of Lemma 2.2 for some κ>0\kappa>0κ>0: E∣M∣κ=1\mathbf E|M|^\kappa=1E∣M∣κ=1, E∣M∣κlog⁡+∣M∣<∞\mathbf E|M|^\kappa\log^+|M|<\inftyE∣M∣κlog+∣M∣<∞, and the conditional law of log⁡∣M∣\log|M|log∣M∣ given M≠0M\ne0M=0 is nonarithmetic. Suppose also that (4.2) E∣Q∣κ<∞\mathbf E|Q|^\kappa<\inftyE∣Q∣κ<∞.

Then there is a unique probability law ρ\rhoρ on R\mathbb RR for RRR satisfying the random difference equation

R=LQ+MR,R independent of (Q,M)(1.1).R\overset{\mathcal L}{=}Q+MR,\qquad R\text{ independent of }(Q,M)\qquad(1.1).R=LQ+MR,R independent of (Q,M)(1.1).

That is, ρ\rhoρ is the law of Q+MRQ+MRQ+MR when ((Q,M),R)∼μ⊗ρ((Q,M),R)\sim\mu\otimes\rho((Q,M),R)∼μ⊗ρ, and every probability law with this property equals ρ\rhoρ.

This is the first assertion of Theorem 4.1 (Kesten's theorem in dimension one). It is the classical existence and uniqueness of the stationary law of the affine recursion Rn=Qn+MnRn−1R_n=Q_n+M_nR_{n-1}Rn​=Qn​+Mn​Rn−1​. Under the hypotheses, Lemma 2.2 gives Elog⁡∣M∣<0\mathbf E\log|M|<0Elog∣M∣<0, and E∣Q∣κ<∞\mathbf E|Q|^\kappa<\inftyE∣Q∣κ<∞ gives Elog⁡+∣Q∣<∞\mathbf E\log^+|Q|<\inftyElog+∣Q∣<∞. The stationary law is then the law of the a.s. convergent perpetuity ∑k≥1Πk−1Qk\sum_{k\ge1}\Pi_{k-1}Q_k∑k≥1​Πk−1​Qk​.

Formalization Note A law for RRR satisfying (1.1) is a probability measure ρ\rhoρ with rdeOperator μ ρ = ρ, i.e. the image of μ⊗ρ\mu\otimes\rhoμ⊗ρ under ((q,m),r)↦q+mr((q,m),r)\mapsto q+mr((q,m),r)↦q+mr equals ρ\rhoρ. Uniqueness is among all probability laws on R\mathbb RR.

Preamble
import Mathlib
import Definitions.Def_GoldieRenewal_Implicit_CramerConditions
import Definitions.Def_GoldieRenewal_Kesten_RandomDifferenceEquation
Formal statement
namespace GoldieRenewal.Kesten

open MeasureTheory ProbabilityTheory
open scoped ENNReal

/-- **Theorem 4.1, part 1: existence and uniqueness of the law of `R`** (Goldie, *Implicit renewal
theory and tails of solutions of random equations*, Ann. Appl. Probab. 1(1) (1991), p. 135,
Theorem 4.1: "there is a unique law for `R` satisfying (1.1)"). Let `(Q, M)` have joint law `μ`,
let `M` satisfy the conditions of Lemma 2.2 for some `κ > 0`, and suppose (4.2) `E|Q|^κ < ∞`.
Then there is exactly one probability law `ρ` on `ℝ` with `R =_L Q + MR`, `R` independent of
`(Q, M)`.

**Formalization Note** A law for `R` satisfying (1.1) is a probability measure `ρ` with
`rdeOperator μ ρ = ρ`; uniqueness is among all probability laws on `ℝ`. This is the first
conjunct of `GoldieRenewal.Kesten.theorem_4_1`. -/
theorem existence_uniqueness (κ : ℝ) (μ : Measure (ℝ × ℝ)) [IsProbabilityMeasure μ]
    (hM : GoldieRenewal.Implicit.CramerConditions κ (μ.map Prod.snd))
    (hQ : ∫⁻ p, ENNReal.ofReal (|p.1| ^ κ) ∂μ < ∞) :
    ∃ ρ : ProbabilityMeasure ℝ,
      rdeOperator μ (ρ : Measure ℝ) = ρ ∧
        ∀ ρ' : ProbabilityMeasure ℝ, rdeOperator μ (ρ' : Measure ℝ) = ρ' → ρ' = ρ := by sorry

end GoldieRenewal.Kesten
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. 135, Theorem 4.1 (first assertion: 'there is a unique law for R satisfying (1.1)'); classical, cf. Kesten (1973), Vervaat (1979)

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