Finite-moment compound Poisson driver has almost-sure sample path linear upper envelope
ProvedKyprianou.Ch01.finiteMeanRealCompoundPoissonLinearGrowthcompound-poissonkyprianou-ch01linear-growthstrong-law
With finite mean offspring PMF, matching integer jump masses and a genuine compound Poisson driver, the real compound Poisson process has an almost-sure globally finite linear upper envelope K(1+t) for all t≥0. This follows from strong laws for Poisson arrivals and iid integrable marks. Retains the original assumptions from the Chapter 1 reverse Lamperti programme.
Preamble
import Mathlib import Definitions.Def_Kyprianou_Ch01_BranchingClocks import Definitions.Def_Kyprianou_Ch01_LampertiInverse import Definitions.Def_Kyprianou_Ch01_BranchingGenerator import Definitions.Def_LeanLevy_Processes_CompoundPoisson open MeasureTheory ProbabilityTheory Kyprianou.Ch01 Set Filter open scoped NNReal ENNReal set_option autoImplicit false
Formal statement
theorem Kyprianou.Ch01.finiteMeanRealCompoundPoissonLinearGrowth
{Ω : Type*} [MeasurableSpace Ω]
(Q : Measure Ω) [IsProbabilityMeasure Q]
(rate : ℝ≥0) (hrate : 0 < rate)
(offspring : PMF ℕ) (hNoZeroJumps : offspring 1 = 0)
(hFiniteMean : Summable
(fun k : ℕ => (offspring k).toReal * (k : ℝ)))
(law : PopulationLaws)
(hbranch : HasBranchingProperty law)
(hMarkov : IsPopulationMarkovSemigroup law)
(hInitial : ∀ y : ℕ, law y 0 = PMF.pure y)
(hRates : IsBranchingRateGenerator law rate offspring)
(arrival marks : ℕ → Ω → ℝ)
(jumpLaw : Measure ℝ) [IsProbabilityMeasure jumpLaw]
(hdriver : IsCompoundPoissonDriver
arrival marks rate jumpLaw Q)
(hSupport : jumpLaw
{x : ℝ | ∃ k : ℕ, x = (k : ℝ) - 1} = 1)
(hJumpMass : ∀ k : ℕ,
jumpLaw ({((k : ℝ) - 1)} : Set ℝ) = offspring k) :
∀ᵐ ω ∂Q,
∃ K : ℝ, 0 ≤ K ∧
∀ t : ℝ≥0,
ProbabilityTheory.compoundPoisson 0 arrival marks (t : ℝ) ω ≤
K * (1 + (t : ℝ)) := by
sorrySource
Kyprianou (2006), Chapter 1 section 1.3.4, equations (1.18)-(1.19), nonexplosion under finite offspring first moment.