Joint Poisson law of two cumulative counts at ordered times for one mark set
ProvedKyprianou.Ch06.twoTimeMarkedPoissonCumulativeCountJointLawFor the authentic Chapter 6 marked Poisson process, one measurable finite-intensity mark set A and observation times 0≤s≤t, the probability that N_s(A)=k and N_t(A)=k+l equals the product of Poisson masses with parameters s n(A) and (t-s)n(A). This uses original zero-initial-count and monotone path assumptions to identify cumulative counts with consecutive increments, and the separately proved two-interval independent Poisson count law. It is a finite-dimensional building block for overlapping mark/time cylinders.
Preamble
import Mathlib import Definitions.Def_Kyprianou_Ch06_MarkedPoissonPointProcess open MeasureTheory open scoped NNReal ENNReal open Kyprianou.Ch06 set_option autoImplicit false
Formal statement
theorem Kyprianou.Ch06.twoTimeMarkedPoissonCumulativeCountJointLaw
{Omega E : Type} [MeasurableSpace Omega] [MeasurableSpace E]
(P : Measure Omega) (n : Measure E)
(N : Omega → NNReal → Set E → Nat)
(hPPP : Kyprianou.Ch06.IsMarkedPoissonPointProcess P n N)
(A : Set E) (hA : MeasurableSet A) (hFinite : n A < ⊤)
(s t : NNReal) (hst : s ≤ t) (k l : Nat) :
P {omega | N omega s A = k ∧ N omega t A = k+l} =
ProbabilityTheory.poissonMeasure
(s * (n A).toNNReal) {k} *
ProbabilityTheory.poissonMeasure
((t-s) * (n A).toNNReal) {l} := by sorry