count singleton ne zero of restrict ne zero
ProvedLevyStochCalc.Poisson.count_singleton_ne_zero_of_restrict_ne_zerocontext-reviewlevystochcalcsource-import
The source theorem LevyStochCalc.Poisson.count_singleton_ne_zero_of_restrict_ne_zero is extracted from LevyStochCalc.Poisson.JumpTimesEnum. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.
Preamble
import Definitions.Def_LevyStochCalc_Poisson_JumpTimesEnum_F002
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
/-!
# Arrival times as the atom times of a Poisson random measure
The counting process `arrivalCount N A` splits at a positive time into the mass strictly before
that time and the mass carried by the time itself, so on a window on which the restricted measure
is integer-valued a time in `(0, T]` carries mass in the mark set `A` exactly when it is one of
the arrival times `jumpTime N A i`. Such a time therefore lies among the times of any finite atom
set of the restricted measure. Every arrival time of positive index is strictly positive, the
arrival times of a time-simple measure strictly increase, and the chain of arrival times passes
any horizon at which the count is finite.
-/
open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal
namespace LevyStochCalc.Poisson
universe u v w
variable {Ω : Type u} [MeasurableSpace Ω] {E : Type v} [MeasurableSpace E]
{P : Measure Ω} [IsProbabilityMeasure P] {ν : Measure E} [SigmaFinite ν]
section Singleton
variable (N : PoissonRandomMeasure.{u, v, w} P ν) (A : Set E)
end Singleton
section IntegerValued
variable (N : PoissonRandomMeasure.{u, v, w} P ν) (A : Set E)
end IntegerValued
section Positivity
variable (N : PoissonRandomMeasure.{u, v, w} P ν) (A : Set E)
end Positivity
section AtomTimes
variable (N : PoissonRandomMeasure.{u, v, w} P ν) (A : Set E)
end AtomTimes
section Chain
variable (N : PoissonRandomMeasure.{u, v, w} P ν) (A : Set E)
end Chain
section AtomFinset
variable (N : PoissonRandomMeasure.{u, v, w} P ν) (A : Set E)
end AtomFinset
section AtomPoint
variable [MeasurableSingletonClass E]
variable (N : PoissonRandomMeasure.{u, v, w} P ν) (A : Set E)
Formal statement
theorem _root_.LevyStochCalc.Poisson.count_singleton_ne_zero_of_restrict_ne_zero {T : ℝ} {ω : Ω} {p : ℝ × E}
(hp : ((N.N ω).restrict (Set.Ioc (0 : ℝ) T ×ˢ A)) {p} ≠ 0) :
(0 < p.1 ∧ p.1 ≤ T) ∧ N.N ω (({p.1} : Set ℝ) ×ˢ A) ≠ 0 := by sorry
Source