Exponential moment of compound Poisson aggregate claims
ProvedKyprianou.Ch01.aggregateClaims_expMomentapplicationscompound-poissonkyprianou-ch01
Let be the aggregate claims process built from a compound Poisson driver: counts the arrivals of a Poisson process of rate (i.i.d. exponential interarrival times) and the claims are i.i.d. with law , independent of the arrivals. Fix and a time , and suppose is integrable. Then:
- the claim law has a finite exponential moment, ;
- the exponential moment of is given by
This is the real-exponential (moment generating function) counterpart of the compound Poisson characteristic exponent. In the Cramér–Lundberg model it turns the Lundberg equation for the surplus into the explicit equation .
Formalization Note. aggregateClaims arrival claims t is the driftless compound Poisson path at time , i.e. ; the binder arrival is the interarrival sequence of the driver.
Preamble
import Definitions.Def_LeanLevy_Processes_CompoundPoisson import Mathlib import Definitions.Def_Kyprianou_Ch01_RiskQueueCore open MeasureTheory ProbabilityTheory Kyprianou.Ch01 Set Filter open scoped NNReal ENNReal set_option autoImplicit false universe u
Formal statement
theorem Kyprianou.Ch01.aggregateClaims_expMoment
{Ω : Type u} [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P]
(arrival claims : ℕ → Ω → ℝ) (rate : ℝ≥0)
(F : Measure ℝ) [IsProbabilityMeasure F]
(hd : IsCompoundPoissonDriver arrival claims rate F P)
(hrate : 0 < rate)
(θ : ℝ) (t : ℝ≥0) (ht : 0 < t)
(hint : Integrable
(fun ω => Real.exp (θ * aggregateClaims arrival claims t ω)) P) :
Integrable (fun y : ℝ => Real.exp (θ * y)) F ∧
(∫ ω, Real.exp (θ * aggregateClaims arrival claims t ω) ∂P) =
Real.exp ((rate : ℝ) * (t : ℝ) * ((∫ y, Real.exp (θ * y) ∂F) - 1)) := by
sorrySource
Kyprianou (2006), Introductory Lectures on Fluctuations of Lévy Processes with Applications, §1.2.2 (compound Poisson process) together with Theorem 3.6 (exponential moments, ); used in §1.3.1 for the Cramér–Lundberg Laplace exponent.