Documentation

Mathlib.Dynamics.Ergodic.MeasurePreserving

Measure preserving maps #

We say that f : α → β is a measure preserving map w.r.t. measures μ : Measure α and ν : Measure β if f is measurable and map f μ = ν. In this file we define the predicate MeasureTheory.MeasurePreserving and prove its basic properties.

We use the term "measure preserving" because in many applications α = β and μ = ν.

References #

Partially based on this Isabelle formalization.

Tags #

measure preserving map, measure

f is a measure preserving map w.r.t. measures μa and μb if f is measurable and map f μa = μb.

Instances For
    theorem MeasureTheory.MeasurePreserving.measure_preimage {α : Type u_1} {β : Type u_2} [MeasurableSpace α] [MeasurableSpace β] {μa : MeasureTheory.Measure α} {μb : MeasureTheory.Measure β} {f : αβ} (hf : MeasureTheory.MeasurePreserving f) {s : Set β} (hs : MeasurableSet s) :
    μa (f ⁻¹' s) = μb s
    theorem MeasureTheory.MeasurePreserving.measure_preimage_emb {α : Type u_1} {β : Type u_2} [MeasurableSpace α] [MeasurableSpace β] {μa : MeasureTheory.Measure α} {μb : MeasureTheory.Measure β} {f : αβ} (hf : MeasureTheory.MeasurePreserving f) (hfe : MeasurableEmbedding f) (s : Set β) :
    μa (f ⁻¹' s) = μb s
    theorem MeasureTheory.MeasurePreserving.measure_symmDiff_preimage_iterate_le {α : Type u_1} [MeasurableSpace α] {μ : MeasureTheory.Measure α} {f : αα} {s : Set α} (hf : MeasureTheory.MeasurePreserving f) (hs : MeasurableSet s) (n : ) :
    μ (s (f^[n] ⁻¹' s)) n μ (s (f ⁻¹' s))
    theorem MeasureTheory.MeasurePreserving.exists_mem_image_mem_of_volume_lt_mul_volume {α : Type u_1} [MeasurableSpace α] {μ : MeasureTheory.Measure α} {f : αα} {s : Set α} (hf : MeasureTheory.MeasurePreserving f) (hs : MeasurableSet s) {n : } (hvol : μ Set.univ < n * μ s) :
    x, x s m, m Set.Ioo 0 n f^[m] x s

    If μ univ < n * μ s and f is a map preserving measure μ, then for some x ∈ s and 0 < m < n, f^[m] x ∈ s.

    theorem MeasureTheory.MeasurePreserving.exists_mem_image_mem {α : Type u_1} [MeasurableSpace α] {μ : MeasureTheory.Measure α} {f : αα} {s : Set α} [MeasureTheory.IsFiniteMeasure μ] (hf : MeasureTheory.MeasurePreserving f) (hs : MeasurableSet s) (hs' : μ s 0) :
    x, x s m x_1, f^[m] x s

    A self-map preserving a finite measure is conservative: if μ s ≠ 0, then at least one point x ∈ s comes back to s under iterations of f. Actually, a.e. point of s comes back to s infinitely many times, see MeasureTheory.MeasurePreserving.conservative and theorems about MeasureTheory.Conservative.