Counting measure #

In this file we define the counting measure MeasurTheory.Measure.count as MeasureTheory.Measure.sum MeasureTheory.Measure.dirac and prove basic properties of this measure.

source

def MeasureTheory.Measure.count {α : Type u_1} [MeasurableSpace α] :

Measure α

Counting measure on any measurable space.

Equations

MeasureTheory.Measure.count = MeasureTheory.Measure.sum MeasureTheory.Measure.dirac

source

@[simp]

theorem MeasureTheory.Measure.count_ne_zero'' {α : Type u_1} [MeasurableSpace α] [Nonempty α] :

count ≠ 0

source

theorem MeasureTheory.Measure.le_count_apply {α : Type u_1} [MeasurableSpace α] {s : Set α} :

∑' (x : ↑s), 1 ≤ count s

source

theorem MeasureTheory.Measure.count_apply {α : Type u_1} [MeasurableSpace α] {s : Set α} (hs : MeasurableSet s) :

count s = ∑' (x : ↑s), 1

source

theorem MeasureTheory.Measure.count_empty {α : Type u_1} [MeasurableSpace α] :

count ∅ = 0

source

@[simp]

theorem MeasureTheory.Measure.count_apply_finset' {α : Type u_1} [MeasurableSpace α] {s : Finset α} (s_mble : MeasurableSet ↑s) :

count ↑s = ↑s.card

source

@[simp]

theorem MeasureTheory.Measure.count_apply_finset {α : Type u_1} [MeasurableSpace α] [MeasurableSingletonClass α] (s : Finset α) :

count ↑s = ↑s.card

source

theorem MeasureTheory.Measure.count_apply_finite' {α : Type u_1} [MeasurableSpace α] {s : Set α} (s_fin : s.Finite) (s_mble : MeasurableSet s) :

count s = ↑s_fin.toFinset.card

source

theorem MeasureTheory.Measure.count_apply_finite {α : Type u_1} [MeasurableSpace α] [MeasurableSingletonClass α] (s : Set α) (hs : s.Finite) :

count s = ↑hs.toFinset.card

source

theorem MeasureTheory.Measure.count_apply_infinite {α : Type u_1} [MeasurableSpace α] {s : Set α} (hs : s.Infinite) :

count s = ⊤

count measure evaluates to infinity at infinite sets.

source

@[simp]

theorem MeasureTheory.Measure.count_apply_eq_top' {α : Type u_1} [MeasurableSpace α] {s : Set α} (s_mble : MeasurableSet s) :

count s = ⊤ ↔ s.Infinite

source

@[simp]

theorem MeasureTheory.Measure.count_apply_eq_top {α : Type u_1} [MeasurableSpace α] {s : Set α} [MeasurableSingletonClass α] :

count s = ⊤ ↔ s.Infinite

source

@[simp]

theorem MeasureTheory.Measure.count_apply_lt_top' {α : Type u_1} [MeasurableSpace α] {s : Set α} (s_mble : MeasurableSet s) :

count s < ⊤ ↔ s.Finite

source

@[simp]

theorem MeasureTheory.Measure.count_apply_lt_top {α : Type u_1} [MeasurableSpace α] {s : Set α} [MeasurableSingletonClass α] :

count s < ⊤ ↔ s.Finite

source

@[simp]

theorem MeasureTheory.Measure.count_eq_zero_iff {α : Type u_1} [MeasurableSpace α] {s : Set α} :

count s = 0 ↔ s = ∅

source

theorem MeasureTheory.Measure.count_ne_zero_iff {α : Type u_1} [MeasurableSpace α] {s : Set α} :

count s ≠ 0 ↔ s.Nonempty

source

theorem MeasureTheory.Measure.count_ne_zero {α : Type u_1} [MeasurableSpace α] {s : Set α} :

s.Nonempty → count s ≠ 0

Alias of the reverse direction of MeasureTheory.Measure.count_ne_zero_iff.

source

@[deprecated MeasureTheory.Measure.count_eq_zero_iff (since := "2024-11-20")]

theorem MeasureTheory.Measure.empty_of_count_eq_zero {α : Type u_1} [MeasurableSpace α] {s : Set α} :

count s = 0 → s = ∅

Alias of the forward direction of MeasureTheory.Measure.count_eq_zero_iff.

source

@[deprecated MeasureTheory.Measure.empty_of_count_eq_zero (since := "2024-11-20")]

theorem MeasureTheory.Measure.empty_of_count_eq_zero' {α : Type u_1} [MeasurableSpace α] {s : Set α} :

count s = 0 → s = ∅

Alias of the forward direction of MeasureTheory.Measure.count_eq_zero_iff.

source

@[deprecated MeasureTheory.Measure.count_eq_zero_iff (since := "2024-11-20")]

theorem MeasureTheory.Measure.count_eq_zero_iff' {α : Type u_1} [MeasurableSpace α] {s : Set α} :

count s = 0 ↔ s = ∅

Alias of MeasureTheory.Measure.count_eq_zero_iff.

source

@[deprecated MeasureTheory.Measure.count_ne_zero (since := "2024-11-20")]

theorem MeasureTheory.Measure.count_ne_zero' {α : Type u_1} [MeasurableSpace α] {s : Set α} :

s.Nonempty → count s ≠ 0

Alias of the reverse direction of MeasureTheory.Measure.count_ne_zero_iff.

source

@[simp]

theorem MeasureTheory.Measure.count_singleton' {α : Type u_1} [MeasurableSpace α] {a : α} (ha : MeasurableSet {a}) :

count {a} = 1

source

theorem MeasureTheory.Measure.count_singleton {α : Type u_1} [MeasurableSpace α] [MeasurableSingletonClass α] (a : α) :

count {a} = 1

source

theorem MeasureTheory.Measure.count_injective_image' {α : Type u_1} {β : Type u_2} [MeasurableSpace α] [MeasurableSpace β] {f : β → α} (hf : Function.Injective f) {s : Set β} (s_mble : MeasurableSet s) (fs_mble : MeasurableSet (f '' s)) :

count (f '' s) = count s

source

theorem MeasureTheory.Measure.count_injective_image {α : Type u_1} {β : Type u_2} [MeasurableSpace α] [MeasurableSpace β] [MeasurableSingletonClass α] [MeasurableSingletonClass β] {f : β → α} (hf : Function.Injective f) (s : Set β) :

count (f '' s) = count s

source

instance MeasureTheory.Measure.count.isFiniteMeasure {α : Type u_1} [MeasurableSpace α] [Finite α] :

IsFiniteMeasure count

source

@[simp]

theorem MeasureTheory.Measure.count_univ {α : Type u_1} [MeasurableSpace α] [Fintype α] :

count Set.univ = ↑(Fintype.card α)

Documentation

Mathlib.MeasureTheory.Measure.Count

Counting measure #