Math 2.0

Dynamical systems and ergodic theory Definition

Conservative system

Builds on Sigma-finite measureQuasi-measure-preserving mapIterated functionPoincaré recurrence theorem

Definition

Let (X,𝒜,μ)(X, \mathcal{A}, \mu) be a measure space with μ\mu σ-finite, and let T ⁣:X→XT \colon X \to X be a quasi-measure-preserving map, with iterates TnT^n. The map TT is conservative if for every A∈𝒜A \in \mathcal{A} with μ(A)>0\mu(A) > 0 there is an integer n≥1n \ge 1 with μ(A∩T−n(A))>0.\mu(A \cap T^{-n}(A)) > 0.

Remarks

Equivalently, TT has no wandering set of positive measure, where W∈𝒜W \in \mathcal{A} is wandering if the sets T−n(W)T^{-n}(W), n≥0n \ge 0, are pairwise disjoint. For a conservative TT, almost every point of each A∈𝒜A \in \mathcal{A} returns to AA infinitely often. The Hopf decomposition splits XX, up to null sets, into an invariant part on which TT is conservative and a part that is a union of wandering sets.

Example: every measure-preserving map of a finite measure space is conservative, by the Poincaré recurrence theorem. For instance, an irrational rotation of the circle with Lebesgue measure is conservative.

Non-example: the translation T(x)=x+1T(x) = x + 1 on ℝ\R with Lebesgue measure preserves the measure, but for A=[0,1)A = [0, 1) one has T−n(A)=[−n,1−n)T^{-n}(A) = [-n, 1 - n), which is disjoint from AA for every n≥1n \ge 1. So μ(A∩T−n(A))=0\mu(A \cap T^{-n}(A)) = 0 for all n≥1n \ge 1, and TT is not conservative.

Reading path

To understand this page from the ground up, read these 8 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Almost everywhere concept
  2. Finite measure concept
  3. Iterated function concept
  4. Measure-preserving transformation concept
  5. Quasi-measure-preserving map concept
  6. Sigma-finite measure concept
  7. Poincaré recurrence theorem statement
  8. Conservative system definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Conservative_system
About this page
TagQXK4Q72WCV
URIm2://QXK4Q72WCV
Kinddefinition
WritingW0 stub
MSC37A40, 37A05, 28D05
DefinesConservative system
UsesSigma-finite measure, Quasi-measure-preserving map, Iterated function, Poincaré recurrence theorem

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.