mathlibdocumentation

measure_theory.covering.vitali_family

Vitali families #

On a metric space X with a measure μ, consider for each x : X a family of measurable sets with nonempty interiors, called sets_at x. This family is a Vitali family if it satisfies the following property: consider a (possibly non-measurable) set s, and for any x in s a subfamily f x of sets_at x containing sets of arbitrarily small diameter. Then one can extract a disjoint subfamily covering almost all s.

Vitali families are provided by covering theorems such as the Besicovitch covering theorem or the Vitali covering theorem. They make it possible to formulate general versions of theorems on differentiations of measure that apply in both contexts.

This file gives the basic definition of Vitali families. More interesting developments of this notion are deferred to other files:

• constructions of specific Vitali families are provided by the Besicovitch covering theorem, in besicovitch.vitali_family, and by the Vitali covering theorem, in vitali.vitali_family.
• The main theorem on differentiation of measures along a Vitali family is proved in vitali_family.ae_tendsto_rn_deriv.

Main definitions #

• vitali_family μ is a structure made, for each x : X, of a family of sets around x, such that one can extract an almost everywhere disjoint covering from any subfamily containing sets of arbitrarily small diameters.

Let v be such a Vitali family.

• v.fine_subfamily_on describes the subfamilies of v from which one can extract almost everywhere disjoint coverings. This property, called v.fine_subfamily_on.exists_disjoint_covering_ae, is essentially a restatement of the definition of a Vitali family. We also provide an API to use efficiently such a disjoint covering.
• v.filter_at x is a filter on sets of X, such that convergence with respect to this filter means convergence when sets in the Vitali family shrink towards x.

References #

@[nolint]
structure vitali_family {α : Type u_1} [metric_space α] {m : measurable_space α} (μ : measure_theory.measure α) :
Type u_1

On a metric space X with a measure μ, consider for each x : X a family of measurable sets with nonempty interiors, called sets_at x. This family is a Vitali family if it satisfies the following property: consider a (possibly non-measurable) set s, and for any x in s a subfamily f x of sets_at x containing sets of arbitrarily small diameter. Then one can extract a disjoint subfamily covering almost all s.

Vitali families are provided by covering theorems such as the Besicovitch covering theorem or the Vitali covering theorem. They make it possible to formulate general versions of theorems on differentiations of measure that apply in both contexts.

def vitali_family.mono {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} (v : vitali_family μ) (ν : measure_theory.measure α) (hν : ν μ) :

A Vitali family for a measure μ is also a Vitali family for any measure absolutely continuous with respect to μ.

Equations
def vitali_family.fine_subfamily_on {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} (v : vitali_family μ) (f : α → set (set α)) (s : set α) :
Prop

Given a Vitali family v for a measure μ, a family f is a fine subfamily on a set s if every point x in s belongs to arbitrarily small sets in v.sets_at x ∩ f x. This is precisely the subfamilies for which the Vitali family definition ensures that one can extract a disjoint covering of almost all s.

Equations
theorem vitali_family.fine_subfamily_on.exists_disjoint_covering_ae {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) :
∃ (t : set α) (u : α → set α), t s (∀ (x : α), x tu x v.sets_at x f x) μ (s \ ⋃ (x : α) (H : x t), u x) = 0
@[protected]
def vitali_family.fine_subfamily_on.index {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) :
set α

Given h : v.fine_subfamily_on f s, then h.index is a subset of s parametrizing a disjoint covering of almost every s.

Equations
@[protected]
def vitali_family.fine_subfamily_on.covering {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) :
α → set α

Given h : v.fine_subfamily_on f s, then h.covering x is a set in the family, for x ∈ h.index, such that these sets form a disjoint covering of almost every s.

Equations
theorem vitali_family.fine_subfamily_on.index_subset {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) :
theorem vitali_family.fine_subfamily_on.covering_disjoint {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) :
theorem vitali_family.fine_subfamily_on.covering_disjoint_subtype {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) :
theorem vitali_family.fine_subfamily_on.covering_mem {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) {x : α} (hx : x h.index) :
h.covering x f x
theorem vitali_family.fine_subfamily_on.covering_mem_family {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) {x : α} (hx : x h.index) :
theorem vitali_family.fine_subfamily_on.measure_diff_bUnion {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) :
μ (s \ ⋃ (x : α) (H : x h.index), h.covering x) = 0
theorem vitali_family.fine_subfamily_on.index_countable {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s)  :
@[protected]
theorem vitali_family.fine_subfamily_on.measurable_set_u {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) {x : α} (hx : x h.index) :
theorem vitali_family.fine_subfamily_on.measure_le_tsum_of_absolutely_continuous {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s) {ρ : measure_theory.measure α} (hρ : ρ μ) :
ρ s ∑' (x : (h.index)), ρ (h.covering x)
theorem vitali_family.fine_subfamily_on.measure_le_tsum {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} {v : vitali_family μ} {f : α → set (set α)} {s : set α} (h : s)  :
μ s ∑' (x : (h.index)), μ (h.covering x)
def vitali_family.filter_at {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} (v : vitali_family μ) (x : α) :
filter (set α)

Given a vitali family v, then v.filter_at x is the filter on set α made of those families that contain all sets of v.sets_at x of a sufficiently small diameter. This filter makes it possible to express limiting behavior when sets in v.sets_at x shrink to x.

Equations
theorem vitali_family.mem_filter_at_iff {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} (v : vitali_family μ) {x : α} {s : set (set α)} :
s v.filter_at x ∃ (ε : ) (H : ε > 0), ∀ (a : set α), a v.sets_at xa a s
@[protected, instance]
def vitali_family.filter_at_ne_bot {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} (v : vitali_family μ) (x : α) :
theorem vitali_family.eventually_filter_at_iff {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} (v : vitali_family μ) {x : α} {P : set α → Prop} :
(∀ᶠ (a : set α) in v.filter_at x, P a) ∃ (ε : ) (H : ε > 0), ∀ (a : set α), a v.sets_at xa P a
theorem vitali_family.eventually_filter_at_mem_sets {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} (v : vitali_family μ) (x : α) :
∀ᶠ (a : set α) in v.filter_at x, a v.sets_at x
theorem vitali_family.frequently_filter_at_iff {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} (v : vitali_family μ) {x : α} {P : set α → Prop} :
(∃ᶠ (a : set α) in v.filter_at x, P a) ∀ (ε : ), ε > 0(∃ (a : set α) (H : a v.sets_at x), a P a)
theorem vitali_family.eventually_filter_at_subset_of_nhds {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} (v : vitali_family μ) {x : α} {o : set α} (hx : o 𝓝 x) :
∀ᶠ (a : set α) in v.filter_at x, a o
theorem vitali_family.fine_subfamily_on_of_frequently {α : Type u_1} [metric_space α] {m0 : measurable_space α} {μ : measure_theory.measure α} (v : vitali_family μ) (f : α → set (set α)) (s : set α) (h : ∀ (x : α), x s(∃ᶠ (a : set α) in v.filter_at x, a f x)) :
s