Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Corollary 2.6: countable and finite Poisson support, measurable singletons

Proved
Kyprianou.poissonRandomMeasureSupportGenericMeasurableSingletons

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

issue-0053kyprianou-ch02measurable-singletonspoisson-random-measures

The atomic support of a Poisson random measure constructed from an independently marked point family is almost surely countable on a general sigma-finite measurable space, and finite when the intensity has finite total mass. This is the general statement of Corollary 2.6; the earlier real-valued Poisson support theorem remains a useful specialisation. Corrected statement: singletons of the mark space E are assumed measurable (MeasurableSingletonClass E); this is necessary to identify positive singleton masses with observed Poisson atoms.

Preamble
import Mathlib
import Definitions.Def_LeanLevy_RandomMeasure_PoissonPointFamily
import Definitions.Def_LeanLevy_RandomMeasure_PoissonRandomMeasure
open MeasureTheory ProbabilityTheory
open scoped NNReal ENNReal
set_option autoImplicit false
Formal statement
namespace Kyprianou
theorem poissonRandomMeasureSupportGenericMeasurableSingletons
    {Ω E : Type} [MeasurableSpace Ω] [MeasurableSpace E] [MeasurableSingletonClass E]
    [Nonempty E] (P : Measure Ω) [IsProbabilityMeasure P]
    (m : Measure E) [SigmaFinite m]
    (K : ℕ → Ω → ℕ) (Y : ℕ → ℕ → Ω → E)
    (hfamily : ProbabilityTheory.IsPoissonPointFamily K Y m P) :
    (∀ᵐ ω ∂P,
      Set.Countable
        {z : E | ProbabilityTheory.poissonRandomMeasure K Y ω {z} ≠ 0}) ∧
    (m Set.univ < ⊤ →
      ∀ᵐ ω ∂P,
        Set.Finite
          {z : E | ProbabilityTheory.poissonRandomMeasure K Y ω {z} ≠ 0})
      := by sorry
end Kyprianou
Source
Kyprianou (2006), Chapter 2, Corollary 2.6; corrected Lean measurable-space hypothesis
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