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.
- measurable : Measurable f
- map_eq : MeasureTheory.Measure.map f μa = μb
Instances For
An alias of MeasureTheory.MeasurePreserving.comp with a convenient defeq and argument order
for MeasurableEquiv
If μ univ < n * μ s and f is a map preserving measure μ,
then for some x ∈ s and 0 < m < n, 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.