rightCont
ProvedLevyStochCalc.Poisson.IsPoissonFiltration.rightContcontext-reviewlevystochcalcsource-import
The source theorem LevyStochCalc.Poisson.IsPoissonFiltration.rightCont is extracted from LevyStochCalc.Poisson.Filtered. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.
Preamble
import Definitions.Def_LevyStochCalc_Poisson_Filtered_F000
/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/
/-!
# Poisson random measures with respect to a filtration
`IsPoissonFiltration N ℱ` says that the counts of the Poisson random measure `N` on regions
of the past `(-∞, t] × E` are `ℱ t`-measurable and that, for `0 ≤ s`, the σ-algebra `ℱ s` is
independent of the σ-algebra generated by the counts on *all* measurable regions of the future
`(s, ∞) × E`. Independence of `ℱ s` from the count on a single strip `(s, t] × A` of finite
intensity is the special case `IsPoissonFiltration.indep`. The natural filtration of `N` is an
instance, a smaller filtration to which `N` is adapted is one, and so is the right-continuous
version `ℱ₊`: for a finite family of future regions `D`, the counts `N(D ∩ ((r, ∞) × E))` are
jointly independent of `ℱ r ⊇ ℱ₊ s` and increase to `N(D)` as `r ↓ s`.
-/
open MeasureTheory ProbabilityTheory Filter Topology
open scoped ENNReal
namespace LevyStochCalc.Poisson
universe u v
variable {Ω : Type u} [MeasurableSpace Ω] {E : Type v} [MeasurableSpace E]
{P : Measure Ω} [IsProbabilityMeasure P] {ν : Measure E} [SigmaFinite ν]
Formal statement
theorem _root_.LevyStochCalc.Poisson.IsPoissonFiltration.rightCont {N : PoissonRandomMeasure P ν}
{ℱ : Filtration ℝ ‹MeasurableSpace Ω›} (h : IsPoissonFiltration N ℱ) :
IsPoissonFiltration N ℱ.rightCont := by sorry
Source