Kyprianou.ProofPreparation.poisson_prefix_sum_law
ProvedKyprianou.ProofPreparation.poisson_prefix_sum_lawcandidate-decomposition
Automatically extracted helper theorem Kyprianou.ProofPreparation.poisson_prefix_sum_law from oversized parent candidate 81a258adc97c4344f640c13016c61161d02554f5de4b4ab7ab8267bce3298d43.
Preamble
import Mathlib import Definitions.Def_LeanLevy_Processes_LevyProcess import Definitions.Def_Kyprianou_Ch01_LevyTripletExponent import Definitions.Def_KLSModular_LevyStochCalc_Poisson_RandomMeasure import Definitions.Def_Kyprianou_Ch02_CompletedPoissonFiltration set_option pp.explicit true set_option pp.fullNames true set_option pp.universes true open MeasureTheory ProbabilityTheory Filter Complex open scoped NNReal ENNReal Nat Topology set_option autoImplicit false
Formal statement
namespace Kyprianou.ProofPreparation
theorem poisson_prefix_sum_law
{Ω : Type} [MeasurableSpace Ω]
(P : Measure Ω) [IsProbabilityMeasure P]
(rate : ℕ → ℝ≥0) (N : ℕ → Ω → ℕ)
(hlaw : ∀ k, P.map (N k) = poissonMeasure (rate k))
(hind : iIndepFun N P) :
∀ n : ℕ,
P.map (fun ω => ∑ k ∈ Finset.range (n + 1), N k ω) =
poissonMeasure (∑ k ∈ Finset.range (n + 1), rate k) := by sorry
end Kyprianou.ProofPreparation
Source
candidate-decomposition:2004a3aa-1f5c-4edd-8bf7-f67523bab94c:81a258adc97c4344f640c13016c61161d02554f5de4b4ab7ab8267bce3298d43