exists iSup setLIntegral timeSlab le
ProvedLevyStochCalc.Poisson.exists_iSup_setLIntegral_timeSlab_lecontext-reviewlevystochcalcsource-import
The source theorem LevyStochCalc.Poisson.exists_iSup_setLIntegral_timeSlab_le 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_Simplicity_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
Formal statement
theorem _root_.LevyStochCalc.Poisson.exists_iSup_setLIntegral_timeSlab_le {f : ℝ → ℝ≥0∞} (hf : Measurable f)
(hfin : ∫⁻ x, f x ≠ ⊤) {ε : ℝ≥0∞} (hε : ε ≠ 0) :
∃ n : ℕ, ⨆ k : ℕ, ∫⁻ x in timeSlab n k, f x ≤ ε := by sorry
Source