Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

isIntegerValued of isPiSystem

Proved
LevyStochCalc.Probability.isIntegerValued_of_isPiSystem

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

context-reviewlevystochcalcsource-import

The source theorem LevyStochCalc.Probability.isIntegerValued_of_isPiSystem is extracted from LevyStochCalc.Probability.IntegerValuedMeasure. The original Lean proposition is retained verbatim, and its proof is tracked separately for remote certification.

Preamble
import Definitions.Def_LevyStochCalc_Probability_IntegerValuedMeasure_F000

/-
Copyright (c) 2026 Christian Garry. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Christian Garry
-/

/-!
# Integer-valued finite measures

A measure is integer-valued when every measurable set carries a natural mass. On a measurable
space with a countable separating family such a measure, if finite, is a finite sum of Dirac
masses: a binary search along the separating family isolates a point of mass at least one, and
removing it lowers the total mass by at least one, so the recursion terminates.

Integrality on a generating π-system already gives integrality everywhere, since the sets of
natural mass form a Dynkin system as soon as the ambient measure is finite.
-/

namespace LevyStochCalc.Probability

open MeasureTheory Filter Set
open scoped ENNReal Topology

variable {α : Type*} [MeasurableSpace α]

section PiSystem

Formal statement

theorem _root_.LevyStochCalc.Probability.isIntegerValued_of_isPiSystem {μ : Measure α} [IsFiniteMeasure μ] {C : Set (Set α)}
    (hgen : ‹MeasurableSpace α› = MeasurableSpace.generateFrom C) (hpi : IsPiSystem C)
    (hC : ∀ B ∈ C, ∃ n : ℕ, μ B = n) (huniv : ∃ N : ℕ, μ Set.univ = N) :
    IsIntegerValued μ := by sorry
Source
https://github.com/cgarryZA/LevyStochCalc

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