Lundberg inequality for the claim-epoch random walk of the Cramér–Lundberg model
ProvedKyprianou.Ch01.claimEpochLundbergBoundLet be i.i.d. exponential interarrival times of rate and i.i.d. claim sizes with law , all jointly independent on a probability space (a compound Poisson driver). For a premium rate put
the net change of the Cramér–Lundberg surplus between consecutive claim epochs, ending with the -th claim. Let satisfy the discrete Lundberg equation
with integrable. Then for every real initial capital ,
The left-hand side is the probability that the surplus, observed just after its claim epochs, ever drops strictly below zero. Ruin of the continuous-time surplus can happen only at a claim epoch, so this inequality gives Lundberg's exponential bound on the ultimate ruin probability (Kyprianou, Theorem 1.10(i)).
Formalization Note. The binder arrival is the interarrival sequence of IsCompoundPoissonDriver (its name follows the parent statement), so arrival i ω is and the partial sum is the -th claim epoch.
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
theorem Kyprianou.Ch01.claimEpochLundbergBound
{Ω : Type u} [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P]
(arrival claims : ℕ → Ω → ℝ) (rate : ℝ≥0)
(F : Measure ℝ) [IsProbabilityMeasure F]
(hd : IsCompoundPoissonDriver arrival claims rate F P)
(premium : ℝ) (nu : ℝ) (hnu : 0 ≤ nu)
(hint : Integrable
(fun ω => Real.exp (-nu * (premium * arrival 0 ω - claims 0 ω))) P)
(hroot : (∫ ω, Real.exp
(-nu * (premium * arrival 0 ω - claims 0 ω)) ∂P) = 1)
(x : ℝ) :
P {ω | ∃ n : ℕ, x + ∑ i ∈ Finset.range (n + 1),
(premium * arrival i ω - claims i ω) < 0} ≤
ENNReal.ofReal (Real.exp (-nu * x)) := by
sorry