Documentation

Mathlib.MeasureTheory.MeasurableSpace.CountablyGenerated

Countably generated measurable spaces #

We say a measurable space is countably generated if it can be generated by a countable set of sets.

In such a space, we can also build a sequence of finer and finer finite measurable partitions of the space such that the measurable space is generated by the union of all partitions.

Main definitions #

Main statements #

The file also contains measurability results about memPartition, from which the properties of countablePartition are deduced.

We say a measurable space is countably generated if it can be generated by a countable set of sets.

Instances

    A countable set of sets that generate the measurable space. We insert ∅ to ensure it is nonempty.

    Equations
    Instances For

      A countable sequence of sets generating the measurable space.

      Equations
      Instances For
        theorem MeasurableSpace.CountablyGenerated.comap {α : Type u_1} {β : Type u_2} [m : MeasurableSpace β] [h : CountablyGenerated β] (f : α → β) :
        @[instance 100]

        Any measurable space structure on a countable space is countably generated.

        We say that a measurable space separates points if for any two distinct points, there is a measurable set containing one but not the other.

        Instances
          theorem MeasurableSpace.separatesPoints_def {α : Type u_1} [MeasurableSpace α] [hs : SeparatesPoints α] {x y : α} (h : ∀ (s : Set α), MeasurableSet s → x ∈ s → y ∈ s) :
          x = y
          theorem MeasurableSpace.exists_measurableSet_of_ne {α : Type u_1} [MeasurableSpace α] [SeparatesPoints α] {x y : α} (h : x ≠ y) :
          ∃ (s : Set α), MeasurableSet s ∧ x ∈ s ∧ y ∉ s
          theorem MeasurableSpace.separatesPoints_iff {α : Type u_1} [MeasurableSpace α] :
          SeparatesPoints α ↔ ∀ (x y : α), (∀ (s : Set α), MeasurableSet s → (x ∈ s ↔ y ∈ s)) → x = y
          theorem MeasurableSpace.separating_of_generateFrom {α : Type u_1} (S : Set (Set α)) [h : SeparatesPoints α] (x y : α) :
          (∀ s ∈ S, x ∈ s ↔ y ∈ s) → x = y

          If the measurable space generated by S separates points, then this is witnessed by sets in S.

          theorem MeasurableSpace.SeparatesPoints.mono {α : Type u_1} {m m' : MeasurableSpace α} [hsep : SeparatesPoints α] (h : m ≤ m') :

          We say that a measurable space is countably separated if there is a countable sequence of measurable sets separating points.

          Instances
            @[instance 100]

            If a measurable space admits a countable separating family of measurable sets, there is a countably generated coarser space which still separates points.

            noncomputable def MeasurableSpace.mapNatBool (α : Type u_1) [MeasurableSpace α] [CountablyGenerated α] (x : α) (n : ℕ) :

            A map from a measurable space to the Cantor space ℕ → Bool induced by a countable sequence of sets generating the measurable space.

            Equations
            Instances For

              If a measurable space is countably generated and separates points, it is measure equivalent to some subset of the Cantor space ℕ → Bool (equipped with the product sigma algebra). Note: s need not be measurable, so this map need not be a MeasurableEmbedding to the Cantor Space.

              If a measurable space admits a countable sequence of measurable sets separating points, it admits a measurable injection into the Cantor space ℕ → Bool (equipped with the product sigma algebra).

              theorem MeasurableSpace.measurableSet_succ_memPartition {α : Type u_1} (t : ℕ → Set α) (n : ℕ) {s : Set α} (hs : s ∈ memPartition t n) :
              theorem MeasurableSpace.measurableSet_generateFrom_memPartition_iff {α : Type u_1} (t : ℕ → Set α) (n : ℕ) (s : Set α) :
              MeasurableSet s ↔ ∃ (S : Finset (Set α)), ↑S ⊆ memPartition t n ∧ s = ⋃₀ ↑S
              theorem MeasurableSpace.generateFrom_iUnion_memPartition_le {α : Type u_1} [m : MeasurableSpace α] {t : ℕ → Set α} (ht : ∀ (n : ℕ), MeasurableSet (t n)) :
              generateFrom (⋃ (n : ℕ), memPartition t n) ≤ m
              theorem MeasurableSpace.generateFrom_memPartition_le {α : Type u_1} [m : MeasurableSpace α] {t : ℕ → Set α} (ht : ∀ (n : ℕ), MeasurableSet (t n)) (n : ℕ) :
              theorem MeasurableSpace.measurableSet_memPartition {α : Type u_1} [MeasurableSpace α] {t : ℕ → Set α} (ht : ∀ (n : ℕ), MeasurableSet (t n)) (n : ℕ) {s : Set α} (hs : s ∈ memPartition t n) :
              theorem MeasurableSpace.measurableSet_memPartitionSet {α : Type u_1} [MeasurableSpace α] {t : ℕ → Set α} (ht : ∀ (n : ℕ), MeasurableSet (t n)) (n : ℕ) (a : α) :

              For each n : ℕ, countablePartition α n is a partition of the space in at most 2^n sets. Each partition is finer than the preceding one. The measurable space generated by the union of all those partitions is the measurable space on α.

              Equations
              Instances For
                theorem MeasurableSpace.disjoint_countablePartition {α : Type u_1} [m : MeasurableSpace α] [h : CountablyGenerated α] {n : ℕ} {s t : Set α} (hs : s ∈ countablePartition α n) (ht : t ∈ countablePartition α n) (hst : s ≠ t) :
                def MeasurableSpace.countablePartitionSet {α : Type u_1} [m : MeasurableSpace α] [h : CountablyGenerated α] (n : ℕ) (a : α) :
                Set α

                The set in countablePartition α n to which a : α belongs.

                Equations
                Instances For
                  theorem MeasurableSpace.countablePartitionSet_eq_iff {α : Type u_1} [m : MeasurableSpace α] [h : CountablyGenerated α] {n : ℕ} (a : α) {s : Set α} (hs : s ∈ countablePartition α n) :
                  theorem MeasurableSpace.countablePartitionSet_of_mem {α : Type u_1} [m : MeasurableSpace α] [h : CountablyGenerated α] {n : ℕ} {a : α} {s : Set α} (hs : s ∈ countablePartition α n) (ha : a ∈ s) :

                  A class registering that either α is countable or β is a countably generated measurable space.

                  Instances