# Measure-preserving dynamical system

Measure-preserving dynamical system

In mathematics, a measure-preserving dynamical system is an object of study in the abstract formulation of dynamical systems, and ergodic theory in particular.

## Definition

A measure-preserving dynamical system is defined as a probability space and a measure-preserving transformation on it. In more detail, it is a system

$(X, \mathcal{B}, \mu, T)$

with the following structure:

• X is a set,
• $\mathcal B$ is a σ-algebra over X,
• $\mu:\mathcal{B}\rightarrow[0,1]$ is a probability measure, so that μ(X) = 1, and $\mu(\empty)=0$
• $T:X\rightarrow X$ is a measurable transformation which preserves the measure μ, i. e. each $A\in \mathcal{B}$ satisfies
$\mu(T^{-1}A)=\mu(A).\,$

This definition can be generalized to the case in which T is not a single transformation that is iterated to give the dynamics of the system, but instead is a monoid (or even a group) of transformations $T_{s} : X \to X$ parametrized by $s \in \mathbb{Z}$ (or $\mathbb{R}$, or $\mathbb{N} \cup \{ 0 \}$, or $[0, + \infty)$), where each transformation Ts satisfies the same requirements as T above. In particular, the transformations obey the rules

• $T_{0} = \mathrm{id}_{X} : X \to X$, the identity function on X;
• $T_{s} \circ T_{t} = T_{t + s}$, whenever all the terms are well-defined;
• $T_{s}^{-1} = T_{-s}$, whenever all the terms are well-defined.

The earlier, simpler case fits into this framework by defining $T_s := T^{\,s}$ for $s \in \mathbb{N}$.

The existence of invariant measures for certain maps and Markov processes is established by the Krylov–Bogolyubov theorem.

## Examples

Example of a (Lebesgue) measure preserving map: $T\colon [0,1)\rightarrow[0,1),$ $x \mapsto 2x \mod 1.$

Examples include:

## Homomorphisms

The concept of a homomorphism and an isomorphism may be defined.

Consider two dynamical systems $(X, \mathcal{A}, \mu, T)$ and $(Y, \mathcal{B}, \nu, S)$. Then a mapping

$\phi:X \to Y$

is a homomorphism of dynamical systems if it satisfies the following three properties:

1. The map φ is measurable,
2. For each $B \in \mathcal{B}$, one has μ(ϕ − 1B) = ν(B),
3. For μ-almost all $x \in X$, one has ϕ(Tx) = Sx).

The system $(Y, \mathcal{B}, \nu, S)$ is then called a factor of $(X, \mathcal{A}, \mu, T)$.

The map φ is an isomorphism of dynamical systems if, in addition, there exists another mapping

$\psi:Y \to X$

that is also a homomorphism, which satisfies

1. For μ-almost all $x \in X$, one has x = ψ(ϕx)
2. For ν-almost all $y \in Y$, one has y = ϕ(ψy).

## Generic points

A point $x \in X$ is called a generic point if the orbit of the point is distributed uniformly according to the measure.

## Symbolic names and generators

Consider a dynamical system $(X, \mathcal{B}, T, \mu)$, and let Q = { Q1, ..., Qk } be a partition of X into k measurable pair-wise disjoint pieces. Given a point x ∈ X, clearly x belongs to only one of the Qi. Similarly, the iterated point T nx can belong to only one of the parts as well. The symbolic name of x, with regards to the partition Q, is the sequence of integers {an} such that

$T^nx \in Q_{a_n}.\,$

The set of symbolic names with respect to a partition is called the symbolic dynamics of the dynamical system. A partition Q is called a generator or generating partition if μ-almost every point x has a unique symbolic name.

## Operations on partitions

Given a partition Q = { Q1, ..., Qk } and a dynamical system $(X, \mathcal{B}, T, \mu)$, we define T-pullback of Q as

$T^{-1}Q = \{T^{-1}Q_1,\ldots,T^{-1}Q_k\}.\,$

Further, given two partitions Q = { Q1, ..., Qk } and R = { R1, ..., Rm }, we define their refinement $\scriptstyle Q \vee R$ as

$Q \vee R = \{Q_i \cap R_j\ |\ i=1,\ldots,k,\ j=1,\ldots,m,\ \mu(Q_i \cap R_j) > 0 \}.\,$

With these two constructs we may define refinement of an iterated pullback

\begin{align} \vee_{n=0}^N T^{-n}Q & = \{Q_{i_0} \cap T^{-1}Q_{i_1} \cap \cdots \cap T^{-N}Q_{i_N} \\ & {} \qquad |\ i_\ell = 1,\ldots,k ,\ \ell=0,\ldots,N, \\ & {} \qquad \mu(Q_{i_0} \cap T^{-1}Q_{i_1} \cap \cdots \cap T^{-N}Q_{i_N})>0 \} \end{align}

which plays crucial role in the construction of the measure-theoretic entropy of a dynamical system.

## Measure-theoretic entropy

The entropy of a partition Q is defined as

$H(Q)=-\sum_{m=1}^k \mu (Q_m) \log \mu(Q_m).$

The measure-theoretic entropy of a dynamical system $(X, \mathcal{B}, T, \mu)$ with respect to a partition Q = { Q1, ..., Qk } is then defined as

$h_\mu(T,Q) = \lim_{N \rightarrow \infty} \frac{1}{N} H\left(\bigvee_{n=0}^N T^{-n}Q\right).\,$

Finally, the Kolmogorov–Sinai or measure-theoretic entropy of a dynamical system $(X, \mathcal{B},T,\mu)$ is defined as

$h_\mu(T) = \sup_Q h_\mu(T,Q).\,$

where the supremum is taken over all finite measurable partitions. A theorem of Yakov G. Sinai in 1959 shows that the supremum is actually obtained on partitions that are generators. Thus, for example, the entropy of the Bernoulli process is log 2, since every real number has a unique binary expansion. That is, one may partition the unit interval into the intervals [0, 1/2) and [1/2, 1]. Every real number x is either less than 1/2 or not; and likewise so is the fractional part of 2nx.

If the space X is compact and endowed with a topology, or is a metric space, then the topological entropy may also be defined.

## References

• Michael S. Keane, Ergodic theory and subshifts of finite type, (1991), appearing as Chapter 2 in Ergodic Theory, Symbolic Dynamics and Hyperbolic Spaces, Tim Bedford, Michael Keane and Caroline Series, Eds. Oxford University Press, Oxford (1991). ISBN 0-19-853390-X (Provides expository introduction, with exercises, and extensive references.)
• Lai-Sang Young, "Entropy in Dynamical Systems" (pdf; ps), appearing as Chapter 16 in Entropy, Andreas Greven, Gerhard Keller, and Gerald Warnecke, eds. Princeton University Press, Princeton, NJ (2003). ISBN 0-691-11338-6

## Examples

• T. Schürmann and I. Hoffmann, The entropy of strange billiards inside n-simplexes. J. Phys. A28, page 5033ff, 1995. PDF-Dokument

Wikimedia Foundation. 2010.

### Look at other dictionaries:

• Dynamical system (definition) — This article presents the many ways to define a dynamical system. See the main article, dynamical system, for an overview of the topic. The dynamical system concept is a mathematical formalization for any fixed rule which describes the time… …   Wikipedia

• Dynamical system — This article is about the general aspects of dynamical systems. For technical details, see Dynamical system (definition). For the study, see Dynamical systems theory. Dynamical redirects here. For other uses, see Dynamics (disambiguation). The… …   Wikipedia

• Random dynamical system — In mathematics, a random dynamical system is a measure theoretic formulation of a dynamical system with an element of randomness , such as the dynamics of solutions to a stochastic differential equation. It consists of a base flow, the noise ,… …   Wikipedia

• Base flow (random dynamical systems) — In mathematics, the base flow of a random dynamical system is the dynamical system defined on the noise probability space that describes how to fast forward or rewind the noise when one wishes to change the time at which one starts the random… …   Wikipedia

• Dynamical systems theory — is an area of applied mathematics used to describe the behavior of complex dynamical systems, usually by employing differential equations or difference equations. When differential equations are employed, the theory is called continuous dynamical …   Wikipedia

• List of dynamical systems and differential equations topics — This is a list of dynamical system and differential equation topics, by Wikipedia page. See also list of partial differential equation topics, list of equations. Contents 1 Dynamical systems, in general 2 Abstract dynamical systems 3 …   Wikipedia

• Ergodicity — For other uses, see Ergodic (disambiguation). In mathematics, the term ergodic is used to describe a dynamical system which, broadly speaking, has the same behavior averaged over time as averaged over space. In physics the term is used to imply… …   Wikipedia

• Bernoulli scheme — In mathematics, the Bernoulli scheme or Bernoulli shift is a generalization of the Bernoulli process to more than two possible outcomes.[1][2] Bernoulli schemes are important in the study of dynamical systems, as most such systems (such as Axiom… …   Wikipedia

• Subshift of finite type — In mathematics, subshifts of finite type are used to model dynamical systems, and in particular are the objects of study in symbolic dynamics and ergodic theory. They also describe the set of all possible sequences executed by a finite state… …   Wikipedia

• Entropy (disambiguation) — Additional relevant articles may be found in the following categories: Thermodynamic entropy Entropy and information Quantum mechanical entropy Entropy, in thermodynamics, is a measure of the energy in a thermodynamic system not available to do… …   Wikipedia