ae count time singleton le one
ProvedLevyStochCalc.Poisson.ae_count_time_singleton_le_onecontext-reviewlevystochcalcsource-import
The source theorem LevyStochCalc.Poisson.ae_count_time_singleton_le_one is extracted from LevyStochCalc.Poisson.Simplicity. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.
Preamble
import Definitions.Def_LevyStochCalc_Poisson_ZeroIntensity_F000
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
/-!
# Time-simplicity of a Poisson random measure on a finite-intensity set
On a set of finite reference intensity the count of a Poisson random measure exceeds one with
probability at most the square of the intensity. The reference intensity is a product with
Lebesgue measure in time, so the masses of the dyadic time slabs of such a set are the integrals
of an integrable density over intervals of vanishing length, and therefore have vanishing
supremum. A union bound then makes the probability that some slab of level `n` carries two or
more points tend to zero, so almost surely no two points share a time and every point is simple.
-/
open MeasureTheory ProbabilityTheory Filter
open scoped ENNReal NNReal Topology
namespace LevyStochCalc.Poisson
universe u v w
variable {Ω : Type u} [MeasurableSpace Ω] {E : Type v} [MeasurableSpace E]
{P : Measure Ω} [IsProbabilityMeasure P] {ν : Measure E} [SigmaFinite ν]
section Tail
end Tail
section Mesh
end Mesh
section Simple
Formal statement
theorem _root_.LevyStochCalc.Poisson.ae_count_time_singleton_le_one (N : PoissonRandomMeasure.{u, v, w} P ν)
{B : Set (ℝ × E)} (hB : MeasurableSet B) (hfin : referenceIntensity ν B ≠ ⊤) :
∀ᵐ ω ∂P, ∀ s : ℝ, N.N ω (B ∩ {s} ×ˢ Set.univ) ≤ 1 := by sorry
Source