# mathlibdocumentation

measure_theory.card_measurable_space

# Cardinal of sigma-algebras #

If a sigma-algebra is generated by a set of sets s, then the cardinality of the sigma-algebra is bounded by (max (#s) 2) ^ ℵ₀. This is stated in measurable_space.cardinal_generate_measurable_le and measurable_space.cardinal_measurable_set_le.

In particular, if #s ≤ 𝔠, then the generated sigma-algebra has cardinality at most 𝔠, see measurable_space.cardinal_measurable_set_le_continuum.

For the proof, we rely on an explicit inductive construction of the sigma-algebra generated by s (instead of the inductive predicate generate_measurable). This transfinite inductive construction is parameterized by an ordinal < ω₁, and the cardinality bound is preserved along each step of the construction. We show in measurable_space.generate_measurable_eq_rec that this indeed generates this sigma-algebra.

def measurable_space.generate_measurable_rec {α : Type u} (s : set (set α)) :
.αset (set α)

Transfinite induction construction of the sigma-algebra generated by a set of sets s. At each step, we add all elements of s, the empty set, the complements of already constructed sets, and countable unions of already constructed sets. We index this construction by an ordinal < ω₁, as this will be enough to generate all sets in the sigma-algebra.

This construction is very similar to that of the Borel hierarchy.

Equations
theorem measurable_space.self_subset_generate_measurable_rec {α : Type u} (s : set (set α)) (i : .α) :
theorem measurable_space.empty_mem_generate_measurable_rec {α : Type u} (s : set (set α)) (i : .α) :
theorem measurable_space.compl_mem_generate_measurable_rec {α : Type u} {s : set (set α)} {i j : .α} (h : j < i) {t : set α} (ht : t ) :
theorem measurable_space.Union_mem_generate_measurable_rec {α : Type u} {s : set (set α)} {i : .α} {f : set α} (hf : ∀ (n : ), ∃ (j : .α) (H : j < i), ) :
(⋃ (n : ), f n)
theorem measurable_space.generate_measurable_rec_subset {α : Type u} (s : set (set α)) {i j : .α} (h : i j) :
theorem measurable_space.cardinal_generate_measurable_rec_le {α : Type u} (s : set (set α)) (i : .α) :

At each step of the inductive construction, the cardinality bound ≤ (max (#s) 2) ^ ℵ₀ holds.

theorem measurable_space.generate_measurable_eq_rec {α : Type u} (s : set (set α)) :
{t : set α | = ⋃ (i : .α),

generate_measurable_rec s generates precisely the smallest sigma-algebra containing s.

theorem measurable_space.cardinal_generate_measurable_le {α : Type u} (s : set (set α)) :

If a sigma-algebra is generated by a set of sets s, then the sigma-algebra has cardinality at most (max (#s) 2) ^ ℵ₀.

theorem measurable_space.cardinal_measurable_set_le {α : Type u} (s : set (set α)) :

If a sigma-algebra is generated by a set of sets s, then the sigma algebra has cardinality at most (max (#s) 2) ^ ℵ₀.

If a sigma-algebra is generated by a set of sets s with cardinality at most the continuum, then the sigma algebra has the same cardinality bound.

If a sigma-algebra is generated by a set of sets s with cardinality at most the continuum, then the sigma algebra has the same cardinality bound.