ae eq zero of integral char window
ProvedLevyStochCalc.Poisson.ae_eq_zero_of_integral_char_windowcontext-reviewlevystochcalcsource-import
The source theorem LevyStochCalc.Poisson.ae_eq_zero_of_integral_char_window is extracted from LevyStochCalc.Poisson.WindowFiltration. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.
Preamble
import Definitions.Def_LevyStochCalc_Poisson_WindowFiltration_F001
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
/-!
# The natural filtration is generated by the counts on finite-intensity windows
The reference intensity is a product with a σ-finite mark measure, so a set of times at most `T`
splits into the null part at nonpositive times and a countable increasing union of sets inside
windows `(0, T] × A` with `ν A` finite. The counts on those windows are almost surely finite, so
their real parts generate the natural filtration modulo null sets, and the characters of those
real counts separate.
-/
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 Window
Formal statement
theorem _root_.LevyStochCalc.Poisson.ae_eq_zero_of_integral_char_window (N : PoissonRandomMeasure P ν) (T : ℝ)
{Z : Ω → ℂ} (hZ : Integrable Z P)
(hZm : AEStronglyMeasurable[Probability.aug (naturalFiltration N T) ‹MeasurableSpace Ω› P]
Z P)
(h : ∀ (F : Finset (WindowSet E ν T)) (w : F → ℝ),
∫ ω, Complex.exp
((∑ D : F, (N.N ω ((D : WindowSet E ν T) : Set (ℝ × E))).toReal * w D : ℝ)
* Complex.I) * Z ω ∂P = 0) :
Z =ᵐ[P] 0 := by sorry
Source