Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2.6: countable Poisson support and finite support at finite intensity

Proved
Kyprianou.poissonRandomMeasureSupportCountable

by WillR · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

kyprianou-ch02levy-itom_prm_support

The support of the Poisson random measure is almost surely countable, and its restriction to each finite-intensity measurable set has almost surely finitely many atoms.

Preamble
import Mathlib
import Definitions.Def_LeanLevy_RandomMeasure_PoissonRandomMeasure
import Definitions.Def_LeanLevy_RandomMeasure_PoissonPointFamily
import Definitions.Def_KLSModular_LevyStochCalc_Poisson_RandomMeasure
open MeasureTheory ProbabilityTheory
open scoped NNReal ENNReal
set_option autoImplicit false
Formal statement
namespace Kyprianou
theorem poissonRandomMeasureSupportCountable
    {Ω : Type} [MeasurableSpace Ω] (P : Measure Ω)
    [IsProbabilityMeasure P] (levyMeasure : Measure ℝ) [SigmaFinite levyMeasure]
    (N : LevyStochCalc.Poisson.PoissonRandomMeasure.{0, 0, 0} P levyMeasure) :
    (∀ᵐ ω ∂P,
      Set.Countable {z : ℝ × ℝ | N.N ω {z} ≠ 0}) ∧
    ∀ (A : Set (ℝ × ℝ)), MeasurableSet A →
      LevyStochCalc.Poisson.referenceIntensity levyMeasure A < ⊤ →
      ∀ᵐ ω ∂P,
        Set.Finite {z : ℝ × ℝ | z ∈ A ∧ N.N ω {z} ≠ 0}
    := by sorry
end Kyprianou
Source
Kyprianou (2006), Corollary 2.6, p. 40
Read-back

What the Lean code literally says, in plain math · opencode-go/muse-spark-1.3-contributor

Theorem Kyprianou.poissonRandomMeasureSupportCountable:

Signature and hypotheses:

  • Ω : Type with instance [MeasurableSpace Ω].
  • P : Measure Ω with instance [IsProbabilityMeasure P].
  • levyMeasure : Measure ℝ with instance [SigmaFinite levyMeasure].
  • N : LevyStochCalc.Poisson.PoissonRandomMeasure.{0,0,0} P levyMeasure.
  • The .{0,0,0} instantiates the three universe parameters of that definition all to universe 0; i.e. no higher-universe lifting, all data live in small Type.

Conclusion, a conjunction of:

  1. ∀ᵐ ω ∂P, ...: for P-almost every witness ω : Ω, the support set {z : ℝ × ℝ | N.N ω {z} ≠ 0}, where {z} is the singleton in ℝ × ℝ and N.N ω {z} is the random-measure field applied at ω, is Set.Countable.
  2. For every witness A : Set (ℝ × ℝ), if MeasurableSet A and LevyStochCalc.Poisson.referenceIntensity levyMeasure A < ⊤ — i.e. finite intensity on A — then for P-almost every ω : Ω, {z : ℝ × ℝ | z ∈ A ∧ N.N ω {z} ≠ 0} is Set.Finite.
Human review
  • Endorsed by Shuze Chen · Nov 20, 2026

    Confirmed by the moderator at approval.

  • Endorsed by WillR · Nov 20, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me