Jump to content

Ergodicity

From Wikipedia, the free encyclopedia

In mathematics, especially in ergodic theory, ergodicity is a way of saying that a dynamical system behaves as one indivisible statistical system, rather than being composed of statistically distinguishable subsystems. More precisely, a measure-preserving dynamical system is ergodic if every invariant measurable set has either measure zero or full measure. Equivalently, the system cannot be decomposed, up to sets of measure zero, into two smaller invariant parts of positive measure.[1]

Ergodic theorems relate this condition to the equality of time averages and space averages. Under suitable hypotheses, the time average of an observable along almost every orbit is equal to its space average.[2] Ergodicity itself, however, is not the same as randomness, mixing, chaos, or the assertion that every individual orbit visits every part of the space.

Ergodicity may also be described in terms of ergodic measures: an invariant probability measure is ergodic if it cannot be decomposed into a nontrivial convex combination of other invariant probability measures.[3]

Ergodic systems occur in many areas of physics, geometry, probability theory, and dynamical systems. The origins of the subject lie in statistical physics, where Ludwig Boltzmann formulated the ergodic hypothesis in connection with the foundations of statistical mechanics.

Informal explanation and motivation

[edit]

Ergodicity is a way of saying that a system has no hidden division into smaller statistically separate parts.[4][5] If the system is observed for a long time, its long-run statistical behavior is governed by one invariant measure, rather than by a choice among several different invariant components.

First example: coin tossing

[edit]

A simple example comes from coin tossing. Suppose the same biased coin is tossed forever, with probability {\displaystyle p} of heads on each toss. The resulting stationary process is ergodic: apart from events of probability zero, there is no further permanent statistical label attached to the sequence. In particular, the long-run frequency of heads is {\displaystyle p} for almost every sequence.[6][2]

By contrast, suppose that before any tosses are made, one of two coins is chosen at random: one coin has probability {\displaystyle p_{1}} of heads, and the other has probability {\displaystyle p_{2}}. The chosen coin is then tossed forever. This process is stationary, but it is not ergodic. The hidden choice of coin is an invariant fact about the whole infinite sequence, and it separates the process into two statistically different components.[7][5]

In a measure-preserving dynamical system, this idea is expressed by saying that every invariant measurable set has either measure zero or full measure.[4] Equivalently, the system cannot be decomposed, up to sets of measure zero, into two invariant parts of positive measure.

Ergodicity is related to the equality of time averages and space averages through ergodic theorems. It should not be confused with randomness, mixing, chaos, or the claim that every individual orbit visits every part of the space.

Second example: irrational rotations of a circle

[edit]

Another basic example comes from rotations of the circle.[8] Let {\displaystyle R_{\alpha }} be the rotation of the circle through the angle {\displaystyle 2\pi \alpha } radians. After {\displaystyle n} iterations, a point has been rotated by {\displaystyle 2\pi n\alpha }.

If {\displaystyle \alpha } is rational, say {\displaystyle \alpha =p/q} in lowest terms, then every point is periodic: after {\displaystyle q} iterations it returns to its original position. With respect to Lebesgue measure on the circle, this rotation is not ergodic. For example, the nonconstant function

{\displaystyle f(e^{i\theta })=\cos(q\theta )}

is invariant under the rotation, since replacing {\displaystyle \theta } by {\displaystyle \theta +2\pi p/q} does not change {\displaystyle \cos(q\theta )}. The circle can thus be divided into smaller invariant pieces, such as {\displaystyle a<\cos(q\theta )<b}.

If {\displaystyle \alpha } is irrational, the orbit of every point is dense in the circle. In fact, the irrational rotation is ergodic with respect to Lebesgue measure: every measurable set that is invariant under the rotation has either measure zero or full measure. Thus the system has many different individual orbits, but it has no nontrivial measurable decomposition into invariant statistical components.

This example also shows that ergodicity is weaker than mixing. Irrational rotations are ergodic, but they are not mixing.

Measurable sets and invariant events

[edit]

In the measure-theoretic definition of ergodicity, the basic data are a measure space {\displaystyle X}, and a time-evolution of its points. In the coin-toss example, the state space may be taken to be the space of infinite sequences of outcomes, and the time evolution is the shift map on this space. In the rotation example, the state space is the circle, and the time evolution is repeated application of the rotation. Both are examples of discrete time dynamical systems. The elements of the space {\displaystyle X} are possible states of the system. A measurable set is a collection of states to which the theory assigns a measure, such as length, area, volume, or probability. The space {\displaystyle X} is equipped with a sigma-algebra {\displaystyle {\mathcal {B}}} of sets that are allowed to be measured.

When {\displaystyle X} is a topological space, such as an interval, a circle, or a manifold, the usual choice is often the Borel sigma-algebra, generated by the open sets. In probability examples, measurable sets are events. For instance, in an infinite sequence of coin tosses, the event "the first toss is heads" is measurable, as is the event "the long-run frequency of heads exists and is equal to {\displaystyle p}".

A set is invariant if membership in it is unchanged by the time evolution, up to sets of measure zero. For a transformation {\displaystyle T:X\to X}, this is usually written as

{\displaystyle T^{-1}A=A}

or, more generally, denoting the symmetric difference of sets by {\displaystyle \Delta }:

{\displaystyle \mu (T^{-1}A\triangle A)=0.}

A (discrete time) measure preserving system is thus the pair {\displaystyle (X,T)} where {\displaystyle X} is a measure space and {\displaystyle T} is a measure-preserving transformation.

An invariant measurable set represents a statistical property of the state that persists under the dynamics. Ergodicity says that every such persistent measurable property is trivial: it holds either almost nowhere (i.e., only on a set of measure zero) or almost everywhere (i.e., everywhere except a set of measure zero).

Physical motivation

[edit]

The original motivation for ergodicity came from statistical mechanics.[9][10] In classical mechanics, the state of a system is represented by a point in phase space: for example, the positions and momenta of all particles in a gas. The time evolution of the system moves this point through phase space.

For an isolated Hamiltonian system, the energy is conserved, so the motion is confined to an energy surface

{\displaystyle H(q,p)=E.}

Hamiltonian flow preserves the natural phase-space volume, called Liouville measure.[11][12] After restricting to an energy surface, this gives the measure underlying the microcanonical ensemble.[10]

The physical question was whether long-time averages along the actual motion of one system can be replaced by averages over the corresponding energy surface. For an observable {\displaystyle f}, this asks whether a time average such as

{\displaystyle \lim _{T\to \infty }{1 \over T}\int _{0}^{T}f(\phi _{t}(x))\,dt}

agrees, for typical initial states {\displaystyle x}, representing the state of the large number of particles in the gas, with the average of {\displaystyle f} over the energy surface. The ergodic hypothesis was an early attempt to justify this replacement.

In modern measure-theoretic language, ergodicity does not mean that a trajectory literally passes through every point of the energy surface. Rather, it means that, relative to the chosen invariant measure, there is no further invariant measurable decomposition of the system into smaller statistical components. Under suitable hypotheses, ergodic theorems then imply the equality of time averages and space averages for many observables.[4][2]

History and etymology

[edit]

The term ergodic is usually attributed to Ludwig Boltzmann and is commonly explained as a combination of the Greek words ἔργον (ergon, "work") and ὁδός (hodos, "path").[4] The exact historical development of the term is not entirely straightforward; it has also been connected with Boltzmann's term ergomonode, used in his work on statistical mechanics.[10]

The concept arose in the attempt to justify the use of statistical methods in statistical mechanics. In that setting, one wants to relate time averages along the motion of a mechanical system to averages over a space of possible states. This motivation led to the ergodic hypothesis, according to which a mechanical system may, under suitable assumptions, be treated as if its long-time behavior samples the relevant state space.

The original physical form of the hypothesis was later replaced by more precise mathematical notions in ergodic theory, especially the measure-theoretic definition in terms of invariant measurable sets. In 1913, Michel Plancherel showed that one natural formulation of the classical mechanical ergodic hypothesis could not hold as originally stated.[13][10]

Ergodicity in physics and geometry

[edit]

Ergodicity appears in several related settings in physics and geometry. In each case, one must specify both the state space and the invariant measure. The common measure-theoretic question is whether the system has nontrivial invariant measurable subsets.[4][9]

In statistical mechanics

[edit]

In statistical mechanics, ergodicity is used to justify replacing long-time averages of observables by averages over an invariant ensemble. For isolated Hamiltonian systems, the relevant ensemble is usually the microcanonical ensemble on an energy surface. This is the setting of the classical ergodic hypothesis.[10][9]

Rigorous proofs of ergodicity for realistic many-particle systems are difficult. Important mathematical examples come from dynamical billiards, where idealized particle collisions provide systems for which ergodicity can sometimes be proved.[14][15]

Simple dynamical systems

[edit]

Basic examples of ergodic and non-ergodic systems occur already in low-dimensional dynamics.[16][17] Irrational rotations of the circle are ergodic with respect to Lebesgue measure, but they are not mixing. Other standard examples include the baker's map, Arnold's cat map, Bernoulli shifts, and certain billiard systems. These examples illustrate different relations between ergodicity, mixing, entropy, and chaotic behavior.

In geometry

[edit]

Ergodic flows also arise naturally in geometry. A central example is the geodesic flow on a Riemannian manifold, usually considered on the unit tangent bundle with its natural invariant measure.[18][19]

On a flat torus, motion in a fixed irrational direction is dense on the torus and is ergodic after restricting to that direction. The full geodesic flow on the unit tangent bundle is not ergodic, since the direction of motion is conserved. By contrast, the geodesic flow on a compact Riemannian manifold of negative curvature is ergodic with respect to the natural invariant measure. This provides one of the classical families of examples in ergodic theory and is closely related to Anosov flows.

Other geometric examples include horocycle flows, flows on translation surfaces, and billiard flows. In these settings, ergodicity concerns invariant measurable subsets of the appropriate phase space, not whether a single path literally passes through every point.[18][19]

In quantum mechanics

[edit]

In quantum mechanics, the word ergodicity is used more cautiously, since quantum evolution is not described by point trajectories in classical phase space. Related notions appear in quantum chaos and in the quantum ergodicity theorem, which concerns the distribution of eigenfunctions in a semiclassical limit. These ideas are related to, but not identical with, classical measure-theoretic ergodicity.[20][21]

Definition for discrete-time systems

[edit]

Ergodic measures provide one of the cornerstones with which ergodicity is generally discussed. A formal definition follows.

Invariant measure

[edit]

Let {\displaystyle (X,{\mathcal {B}})} be a measurable space. If {\displaystyle T} is a measurable function from {\displaystyle X} to itself and {\displaystyle \mu } a probability measure on {\displaystyle (X,{\mathcal {B}})}, then a measure-preserving dynamical system is defined as a dynamical system for which {\displaystyle \mu {\mathord {\left(T^{-1}(A)\right)}}=\mu (A)} for all {\displaystyle A\in {\mathcal {B}}}. Such a {\displaystyle T} is said to preserve {\displaystyle \mu ;} equivalently, that {\displaystyle \mu } is {\displaystyle T}-invariant.[4]

Ergodic measure

[edit]

A measurable function {\displaystyle T} is said to be {\displaystyle \mu }-ergodic or that {\displaystyle \mu } is an ergodic measure for {\displaystyle T} if {\displaystyle T} preserves {\displaystyle \mu } and the following condition holds:[4]

For any {\displaystyle A\in {\mathcal {B}}} such that {\displaystyle T^{-1}(A)=A} either {\displaystyle \mu (A)=0} or {\displaystyle \mu (A)=1}.

In other words, there are no {\displaystyle T}-invariant subsets up to measure 0 (with respect to {\displaystyle \mu }).

Some authors[22] relax the requirement that {\displaystyle T} preserves {\displaystyle \mu } to the requirement that {\displaystyle T} is a non-singular transformation with respect to {\displaystyle \mu }, meaning that {\displaystyle N} is a subset of measure zero if and only if {\displaystyle T^{-1}(N)} is.

Examples

[edit]

The simplest example is when {\displaystyle X} is a finite set and {\displaystyle \mu } is the normalized counting measure. Then a self-map of {\displaystyle X} preserves {\displaystyle \mu } if and only if it is a bijection, and it is ergodic if and only if {\displaystyle T} has only one orbit (that is, for every {\displaystyle x,y\in X} there exists {\displaystyle k\in \mathbb {N} } such that {\displaystyle y=T^{k}(x)}). For example, if {\displaystyle X=\{1,2,\ldots ,n\}} then the cycle {\displaystyle (1\,2\,\cdots \,n)} is ergodic, but the permutation {\displaystyle (1\,2)(3\,4\,\cdots \,n)} is not (it has the two invariant subsets {\displaystyle \{1,2\}} and {\displaystyle \{3,4,\ldots ,n\}}).

Equivalent formulations

[edit]

The definition given above admits the following immediate reformulations:[23][5]

  • for every {\displaystyle A\in {\mathcal {B}}} with {\displaystyle \mu {\mathord {\left(T^{-1}(A)\bigtriangleup A\right)}}=0} we have {\displaystyle \mu (A)=0} or {\displaystyle \mu (A)=1\,} (where {\displaystyle \bigtriangleup } denotes the symmetric difference);
  • for every {\displaystyle A\in {\mathcal {B}}} with positive measure we have {\textstyle \mu {\mathord {\left(\bigcup _{n=1}^{\infty }T^{-n}(A)\right)}}=1};
  • for every two sets {\displaystyle A,B\in {\mathcal {B}}} of positive measure, there exists {\displaystyle n>0} such that {\displaystyle \mu {\mathord {\left(\left(T^{-n}(A)\right)\cap B\right)}}>0};
  • Every measurable function {\displaystyle f:X\to \mathbb {R} } with {\displaystyle f\circ T=f} is constant on a subset of full measure.

Importantly for applications, the condition in the last characterisation can be restricted to square-integrable functions only:

  • If {\displaystyle f\in L^{2}(X,\mu )} and {\displaystyle f\circ T=f} then {\displaystyle f} is constant almost everywhere.

Further examples

[edit]

Bernoulli shifts and subshifts

[edit]

Let {\displaystyle S} be a finite set and {\displaystyle X=S^{\mathbb {Z} }} with {\displaystyle \mu } the product measure (each factor {\displaystyle S} being endowed with its normalized counting measure). Then the shift operator {\displaystyle T} defined by {\displaystyle T\left((s_{k})_{k\in \mathbb {Z} })\right)=(s_{k+1})_{k\in \mathbb {Z} }} is {\displaystyle \mu }-ergodic.[6]

There are many more ergodic measures for the shift map {\displaystyle T} on {\displaystyle X}. Periodic sequences give finitely supported measures. More interestingly, there are infinitely-supported ones which are subshifts of finite type.

Irrational rotations

[edit]

Let {\displaystyle X} be the unit circle {\displaystyle \{z\in \mathbb {C} ,\,|z|=1\}}, with its Lebesgue measure {\displaystyle \mu }. For any {\displaystyle \theta \in \mathbb {R} } the rotation of {\displaystyle X} of angle {\displaystyle \theta } is given by {\displaystyle T_{\theta }(z)=e^{2i\pi \theta }z}. If {\displaystyle \theta =p/q} is rational, then {\displaystyle T_{\theta }} is not ergodic for Lebesgue measure; for example, the nonconstant function {\displaystyle z\mapsto z^{q}} is invariant under the rotation. On the other hand, if {\displaystyle \theta } is irrational then {\displaystyle T_{\theta }} is ergodic.[8]

Arnold's cat map

[edit]

Let {\displaystyle X=\mathbb {R} ^{2}/\mathbb {Z} ^{2}} be the 2-torus. Then any element {\displaystyle g\in \mathrm {SL} _{2}(\mathbb {Z} )} defines a self-map of {\displaystyle X} since {\displaystyle g\left(\mathbb {Z} ^{2}\right)=\mathbb {Z} ^{2}}. When {\textstyle g=\left({\begin{array}{cc}2&1\\1&1\end{array}}\right)} one obtains the so-called Arnold's cat map, which is ergodic for the Lebesgue measure on the torus.[17][24]

Ergodic theorems

[edit]

If {\displaystyle \mu } is a probability measure on a space {\displaystyle X} which is ergodic for a transformation {\displaystyle T} the pointwise ergodic theorem of G. D. Birkhoff states that for every integrable function {\displaystyle f:X\to \mathbb {R} } and for {\displaystyle \mu }-almost every point {\displaystyle x\in X} the time average on the orbit of {\displaystyle x} converges to the space average of {\displaystyle f}.[23][2] Formally this means that {\displaystyle \lim _{k\to +\infty }\left({\frac {1}{k+1}}\sum _{i=0}^{k}f\left(T^{i}(x)\right)\right)=\int _{X}fd\mu .}

The mean ergodic theorem of J. von Neumann is a similar, weaker statement about averaged translates of square-integrable functions.[23][5]

[edit]

Dense orbits

[edit]

For a continuous transformation of a second-countable topological space with a Borel probability measure {\displaystyle \mu }, ergodicity implies that {\displaystyle \mu }-almost every orbit is dense in the support of {\displaystyle \mu }.[25]

This is not an equivalence since for a transformation which is not uniquely ergodic, but for which there is an ergodic measure with full support {\displaystyle \mu _{0}}, for any other ergodic measure {\displaystyle \mu _{1}} the measure {\textstyle {\frac {1}{2}}(\mu _{0}+\mu _{1})} is not ergodic for {\displaystyle T} but its orbits are dense in the support. Explicit examples can be constructed with shift-invariant measures.[26]

The topological counterpart to ergodicity is a minimal dynamical system, in which the orbit of every point is dense.

Mixing

[edit]

A measure-preserving system is called mixing if sets become asymptotically independent under iteration. Mixing implies ergodicity under standard hypotheses. The converse is not true, for example a rotation with irrational angle on the circle (which is ergodic per the examples above) is not mixing (for a sufficiently small interval its successive images will not intersect itself most of the time). Bernoulli shifts are mixing, and so is Arnold's cat map.

More precisely, a transformation {\displaystyle T} of a probability measure space {\displaystyle (X,\mu )} is said to be mixing for the measure {\displaystyle \mu } if for any measurable sets {\displaystyle A,B\subset X} the following holds:[27] {\displaystyle \lim _{n\to +\infty }\mu \left(T^{-n}A\cap B\right)=\mu (A)\mu (B)}

It is immediate that a mixing transformation is also ergodic (taking {\displaystyle A} to be a {\displaystyle T}-stable subset and {\displaystyle B} its complement).

This notion of mixing is sometimes called strong mixing, as opposed to weak mixing which means that {\displaystyle \lim _{n\to +\infty }{\frac {1}{n}}\sum _{k=1}^{n}\left|\mu (T^{-k}A\cap B)-\mu (A)\mu (B)\right|=0}

Entropy

[edit]

Kolmogorov–Sinai entropy is another invariant of measure-preserving systems. It measures the average information produced by the dynamics, rather than whether the system decomposes into invariant measurable components. Thus entropy and ergodicity answer different questions: an ergodic system may have zero entropy, while positive entropy alone does not imply ergodicity unless one restricts to an ergodic component.

Proper ergodicity

[edit]

The transformation {\displaystyle T} is said to be properly ergodic if it does not have an orbit of full measure.[22] In the discrete case this means that the measure {\displaystyle \mu } is not supported on a finite orbit of {\displaystyle T}.

Definition for continuous-time dynamical systems

[edit]

The definition is essentially the same for continuous-time dynamical systems as for a single transformation.[5][24] Let {\displaystyle (X,{\mathcal {B}})} be a measurable space and for each {\displaystyle t\in \mathbb {R} _{+}}, then such a system is given by a family {\displaystyle T_{t}} of measurable functions from {\displaystyle X} to itself, so that for any {\displaystyle t,s\in \mathbb {R} _{+}} the relation {\displaystyle T_{s+t}=T_{s}\circ T_{t}} holds (usually it is also asked that the orbit map from {\displaystyle \mathbb {R} _{+}\times X\to X} is also measurable). If {\displaystyle \mu } is a probability measure on {\displaystyle (X,{\mathcal {B}})} then we say that {\displaystyle T_{t}} is {\displaystyle \mu }-ergodic or {\displaystyle \mu } is an ergodic measure for {\displaystyle T} if each {\displaystyle T_{t}} preserves {\displaystyle \mu } and the following condition holds:

For any {\displaystyle A\in {\mathcal {B}}}, if for all {\displaystyle t\in \mathbb {R} _{+}} we have {\displaystyle T_{t}^{-1}(A)\subset A} then either {\displaystyle \mu (A)=0} or {\displaystyle \mu (A)=1}.

Examples

[edit]

As in the discrete case the simplest example is that of a transitive action, for instance the action on the circle given by {\displaystyle T_{t}(z)=e^{2i\pi t}z} is ergodic for Lebesgue measure.

An example with infinitely many orbits is given by the flow along an irrational slope on the torus: let {\displaystyle X=\mathbb {S} ^{1}\times \mathbb {S} ^{1}} and {\displaystyle \alpha \in \mathbb {R} }. Let {\displaystyle T_{t}(z_{1},z_{2})=\left(e^{2i\pi t}z_{1},e^{2\alpha i\pi t}z_{2}\right)}; then if {\displaystyle \alpha \not \in \mathbb {Q} } this is ergodic for the Lebesgue measure.

Ergodic flows

[edit]

Further examples of ergodic flows are:[18][19]

Ergodicity in compact metric spaces

[edit]

If {\displaystyle X} is a compact metric space it is naturally endowed with the σ-algebra of Borel sets. The additional structure coming from the topology then allows a much more detailed theory for ergodic transformations and measures on {\displaystyle X}.[28]

Functional analysis interpretation

[edit]

A very powerful alternate characterization of ergodic measures can be given using the theory of Banach spaces. The signed Radon measures on {\displaystyle X} form a Banach space, of which the set {\displaystyle {\mathcal {P}}(X)} of probability measures on {\displaystyle X} is a convex subset. Given a continuous transformation {\displaystyle T} of {\displaystyle X}, the subset {\displaystyle {\mathcal {P}}(X)^{T}} of {\displaystyle T}-invariant measures is a closed convex subset, and a measure is ergodic for {\displaystyle T} if and only if it is an extreme point of this convex set.[28]

Existence of ergodic measures

[edit]

In the setting above, the Krylov–Bogolyubov argument shows that {\displaystyle {\mathcal {P}}(X)^{T}} is nonempty.[28][29] It is also compact and convex in the weak-* topology; hence by the Krein–Milman theorem it has extreme points. Therefore a continuous transformation of a compact metric space always admits ergodic measures.

Ergodic decomposition

[edit]

In general an invariant measure need not be ergodic. In the compact metric setting, Choquet theory applied to the compact convex set {\displaystyle {\mathcal {P}}(X)^{T}} of invariant probability measures implies that an invariant measure can be expressed as the barycenter of a probability measure supported on the set of ergodic measures. This is referred to as the ergodic decomposition of the measure.[7][30][31]

Example

[edit]

In the case of {\displaystyle X=\{1,\ldots ,n\}} and {\displaystyle T=(1\,2)(3\,4\,\cdots \,n)} the normalized counting measure is not ergodic. The ergodic measures for {\displaystyle T} are the uniform measures {\displaystyle \mu _{1},\mu _{2}} supported on the subsets {\displaystyle \{1,2\}} and {\displaystyle \{3,\ldots ,n\}}, and every {\displaystyle T}-invariant probability measure can be written in the form {\displaystyle t\mu _{1}+(1-t)\mu _{2}} for some {\displaystyle t\in [0,1]}. In particular {\textstyle {\frac {2}{n}}\mu _{1}+{\frac {n-2}{n}}\mu _{2}} is the ergodic decomposition of the normalized counting measure.

Continuous systems

[edit]

The same functional-analytic interpretation applies to continuous actions of {\displaystyle \mathbb {R} } or {\displaystyle \mathbb {R} _{+}} on compact metric spaces, with invariant measures taken with respect to the corresponding flow or semigroup.

Unique ergodicity

[edit]

The transformation {\displaystyle T} is said to be uniquely ergodic if there is a unique {\displaystyle T}-invariant Borel probability measure {\displaystyle \mu } on {\displaystyle X}.

In the examples considered above, irrational rotations of the circle are uniquely ergodic;[32] shift maps are not.

Probabilistic interpretation: ergodic processes

[edit]

If {\displaystyle \left(X_{n}\right)_{n\geq 1}} is a discrete-time stochastic process with state space {\displaystyle S}, its joint distribution defines a probability measure on the path space {\displaystyle S^{\mathbb {N} }}. The process is stationary if this probability measure is invariant under the shift map

{\displaystyle \left(x_{n}\right)_{n\geq 1}\mapsto \left(x_{n+1}\right)_{n\geq 1}.}

A stationary process is said to be ergodic if this shift-invariant probability measure is ergodic. Equivalently, every shift-invariant event has probability zero or one. This is a particular case of the notions discussed above.

The simplest case is that of an independent and identically distributed process, which corresponds to a product measure on the path space and is ergodic for the shift map. Another important case is that of a stationary Markov chain, which is discussed in detail below.

A similar interpretation holds for continuous-time stochastic processes, though the construction of the measurable structure of the action is more complicated.

Ergodicity of Markov chains

[edit]

The dynamical system associated with a Markov chain

[edit]

Let {\displaystyle S} be a finite set. A Markov chain on {\displaystyle S} is defined by a matrix {\displaystyle P\in [0,1]^{S\times S}}, where {\displaystyle P(s_{1},s_{2})} is the transition probability from {\displaystyle s_{1}} to {\displaystyle s_{2}}, so for every {\displaystyle s\in S} we have {\textstyle \sum _{s'\in S}P(s,s')=1}.[33] A stationary measure for {\displaystyle P} is a probability measure {\displaystyle \nu } on {\displaystyle S} such that {\displaystyle \nu P=\nu }; that is,

{\displaystyle \sum _{s'\in S}\nu (s')P(s',s)=\nu (s)}

for all {\displaystyle s\in S}.

Using this data we can define a probability measure {\displaystyle \mu _{\nu }} on the path space {\displaystyle X=S^{\mathbb {Z} }} with its product σ-algebra by giving the measures of cylinder sets as follows:

{\displaystyle \mu _{\nu }\{x\in S^{\mathbb {Z} }:x_{n}=s_{n},\ldots ,x_{m}=s_{m}\}=\nu (s_{n})P(s_{n},s_{n+1})\cdots P(s_{m-1},s_{m}).}

Stationarity of {\displaystyle \nu } then means that the measure {\displaystyle \mu _{\nu }} is invariant under the shift map

{\displaystyle T\left(\left(s_{k}\right)_{k\in \mathbb {Z} }\right)=\left(s_{k+1}\right)_{k\in \mathbb {Z} }.}

Criterion for ergodicity

[edit]

The measure {\displaystyle \mu _{\nu }} is ergodic for the shift map if the associated finite Markov chain is irreducible, that is, if any state can be reached with positive probability from any other state in a finite number of steps.[33]

For a finite irreducible Markov chain, there is a unique stationary measure. A stronger sufficient condition, often used to ensure convergence to the stationary measure, is that {\displaystyle 1} be a simple eigenvalue of the matrix {\displaystyle P} and that all other eigenvalues of {\displaystyle P} in {\displaystyle \mathbb {C} } have modulus less than {\displaystyle 1}.

Note that in probability theory a finite Markov chain is often called ergodic if it is irreducible and aperiodic. Aperiodicity is not necessary for the associated shift-invariant measure {\displaystyle \mu _{\nu }} to be ergodic; it is instead related to stronger convergence and mixing properties. Hence the notion of "ergodicity" for a Markov chain and the notion of ergodicity for the associated shift-invariant measure are closely related but not identical.[34]

Examples

[edit]

Uniform transition matrix

[edit]

If {\displaystyle P(s,s')=1/|S|} for all {\displaystyle s,s'\in S}, then the stationary measure on {\displaystyle S} is the uniform probability measure. The corresponding measure {\displaystyle \mu _{\nu }} on {\displaystyle S^{\mathbb {Z} }} is the product of uniform probability measures. This gives the Bernoulli shift example from above.[6][33]

Non-ergodic Markov chains

[edit]

Markov chains with more than one recurrent communicating class are not irreducible, and the associated stationary shift measures need not be ergodic. If {\displaystyle S_{1},S_{2}\subsetneq S} are two distinct recurrent communicating classes, there are stationary measures {\displaystyle \nu _{1},\nu _{2}} supported on {\displaystyle S_{1},S_{2}} respectively. The corresponding shift-invariant measures on {\displaystyle S^{\mathbb {Z} }} are ergodic on their separate components, but a nontrivial convex combination of them is not ergodic.[33]

A very simple example is the chain on {\displaystyle S=\{1,2\}} given by the matrix

{\displaystyle \left({\begin{array}{cc}1&0\\0&1\end{array}}\right),}

in which both states are absorbing.

A periodic chain

[edit]

The Markov chain on {\displaystyle S=\{1,2\}} given by the matrix

{\displaystyle \left({\begin{array}{cc}0&1\\1&0\end{array}}\right)}

is irreducible but periodic. Thus it is not ergodic in the aperiodic Markov-chain sense, although the associated measure {\displaystyle \mu } on {\displaystyle \{1,2\}^{\mathbb {Z} }} is ergodic for the shift map. However, the shift is not mixing for this measure. For the sets

{\displaystyle A=\{x\in \{1,2\}^{\mathbb {Z} }:x_{0}=1\}}

and

{\displaystyle B=\{x\in \{1,2\}^{\mathbb {Z} }:x_{0}=2\}}

we have {\textstyle \mu (A)={\frac {1}{2}}=\mu (B)}, but

{\displaystyle \mu \left(T^{-n}A\cap B\right)={\begin{cases}{\frac {1}{2}}&{\text{if }}n{\text{ is odd}},\\0&{\text{if }}n{\text{ is even}}.\end{cases}}}

Generalisations

[edit]

The definition of ergodicity extends from a single transformation to group actions.[35][36] Let {\displaystyle G} be a group acting measurably on a measure space {\displaystyle (X,{\mathcal {B}},\mu )}. If the action preserves {\displaystyle \mu }, meaning that

{\displaystyle \mu (g^{-1}A)=\mu (A)}

for every {\displaystyle g\in G} and every {\displaystyle A\in {\mathcal {B}}}, then the action is said to be ergodic if every measurable set {\displaystyle A} satisfying

{\displaystyle g^{-1}A=A}

for all {\displaystyle g\in G} has either {\displaystyle \mu (A)=0} or {\displaystyle \mu (X\setminus A)=0}. Equivalently, every invariant measurable set is either null or conull.

The classical cases of a single invertible transformation and a continuous-time flow correspond to actions of {\displaystyle \mathbb {Z} } and {\displaystyle \mathbb {R} }, respectively. The same definition also applies to non-abelian groups.[37]

There is also a nonsingular version. If the action does not preserve {\displaystyle \mu } but preserves its measure class, so that null sets are carried to null sets, then {\displaystyle \mu } is called quasi-invariant. In that setting, the action is called ergodic if every measurable set that is invariant modulo null sets is either null or conull.

Important examples include actions of semisimple Lie groups and their lattices, such as boundary actions on Furstenberg boundaries.[37]

The same terminology is also used for measurable equivalence relations. A measurable equivalence relation is said to be ergodic if every saturated measurable subset is either null or conull.

Representation-theoretic formulation

[edit]

Ergodicity also has a representation-theoretic formulation. Let {\displaystyle G} be a group and let {\displaystyle \pi :G\to U({\mathcal {H}})} be a unitary representation on a Hilbert space {\displaystyle {\mathcal {H}}}. In this context, the representation is sometimes called ergodic if it has no nonzero invariant vectors,[36][38] that is,

{\displaystyle {\mathcal {H}}^{G}={v\in {\mathcal {H}}:\pi (g)v=v{\text{ for all }}g\in G}={0}.}

This condition can also be expressed in terms of matrix coefficients. For {\displaystyle x,y\in {\mathcal {H}}}, define

{\displaystyle f_{x,y}(g)=\langle \pi (g)x,y\rangle .}

Matrix coefficients of unitary representations are weakly almost periodic. Since {\displaystyle WAP(G)} has a unique invariant mean {\displaystyle m}, the representation is ergodic if and only if

{\displaystyle m(f_{x,y})=0}

for all {\displaystyle x,y\in {\mathcal {H}}}.[36] When {\displaystyle G} is compact, this invariant mean is integration with respect to normalized Haar measure, so the condition becomes

{\displaystyle \int _{G}\langle \pi (g)x,y\rangle \,dg=0}

for all {\displaystyle x,y\in {\mathcal {H}}}.

This terminology is compatible with the usual notion of ergodicity for measure-preserving actions. Suppose that {\displaystyle G} acts on a probability space {\displaystyle (X,{\mathcal {B}},\mu )} by measure-preserving transformations. The associated Koopman representation is the unitary representation of {\displaystyle G} on {\displaystyle L^{2}(X,\mu )} defined by

{\displaystyle (U_{g}f)(x)=f(g^{-1}x).}

The action of {\displaystyle G} is ergodic if and only if the only {\displaystyle G}-invariant functions in {\displaystyle L^{2}(X,\mu )} are the constant functions.[5][36] Equivalently,

{\displaystyle L^{2}(X,\mu )^{G}=\mathbb {C} \mathbf {1} .}

Let {\displaystyle L_{0}^{2}(X,\mu )} denote the orthogonal complement of the constant functions,

{\displaystyle L_{0}^{2}(X,\mu )=\left\{f\in L^{2}(X,\mu ):\int _{X}f\,d\mu =0\right\}.}

Then the action is ergodic if and only if the restricted Koopman representation on {\displaystyle L_{0}^{2}(X,\mu )} is ergodic in the representation-theoretic sense, meaning that it has no nonzero invariant vector.[5][35]

For a single invertible transformation {\displaystyle T}, this is the same statement for the unitary operator {\displaystyle U_{T}f=f\circ T^{-1}}. In this language, ergodicity means that the eigenspace for the eigenvalue {\displaystyle 1} consists only of the constant functions.

Notes

[edit]
  1. Peter Walters (1982). "preliminaries". An introduction to ergodic theory. p. 2.
  2. 1 2 3 4 Silva & Danilenko 2023, p. 35.
  3. Silva & Danilenko 2023, p. 45.
  4. 1 2 3 4 5 6 7 Walters 1982, p. 2.
  5. 1 2 3 4 5 6 7 Petersen 1983, Chapter 1.
  6. 1 2 3 Walters 1982, p. 32.
  7. 1 2 Walters 1982, p. 153.
  8. 1 2 Walters 1982, p. 29.
  9. 1 2 3 Arnold & Avez 1968, Introduction.
  10. 1 2 3 4 5 Gallavotti 1995.
  11. Arnold & Avez 1968, Chapter 1.
  12. Katok & Hasselblatt 1995, Part 4.
  13. Plancherel 1913.
  14. Katok & Hasselblatt 1995, Chapter 6.
  15. Sinai 1970.
  16. Walters 1982, pp. 29–32.
  17. 1 2 Katok & Hasselblatt 1995, Chapter 2.
  18. 1 2 3 Katok & Hasselblatt 1995, Chapter 17.
  19. 1 2 3 Brin & Stuck 2002, Chapter 5.
  20. Stöckmann 1999, Chapter 1.
  21. Zelditch 2006.
  22. 1 2 Aaronson 1997, p. 21.
  23. 1 2 3 Walters 1982, Chapter 1.
  24. 1 2 Brin & Stuck 2002, Chapter 1.
  25. Walters 1982, Chapter 5.
  26. "Example of a measure-preserving system with dense orbits that is not ergodic". MathOverflow. September 1, 2011. Retrieved May 16, 2020.
  27. Walters 1982, Section 1.7.
  28. 1 2 3 Walters 1982, p. 152.
  29. Brin & Stuck 2002, Chapter 7.
  30. https://arxiv.org/abs/1909.04896
  31. https://ncatlab.org/nlab/show/ergodic+decomposition+theorem
  32. Walters 1982, p. 159.
  33. 1 2 3 4 Walters 1982, p. 42.
  34. "Different uses of the word "ergodic"". MathOverflow. September 4, 2011. Retrieved May 16, 2020.
  35. 1 2 Zimmer 1984, Chapter 2.
  36. 1 2 3 4 Glasner 2003, Chapter 1.
  37. 1 2 Zimmer 1984, Chapters 2-3.
  38. Bekka, de la Harpe & Valette 2008, Appendix A.

References

[edit]
  • Aaronson, Jon (1997), An Introduction to Infinite Ergodic Theory, Mathematical Surveys and Monographs, vol. 50, Providence, Rhode Island: American Mathematical Society, doi:10.1090/surv/050, ISBN 0-8218-0494-4, MR 1450400.
  • Arnold, Vladimir I.; Avez, André (1968), Ergodic Problems of Classical Mechanics, Mathematical Physics Monograph Series, New York: W. A. Benjamin.
  • Bekka, Bachir; de la Harpe, Pierre; Valette, Alain (2008), Kazhdan's Property (T), Cambridge University Press, ISBN 978-0-521-88720-5.
  • Brin, Michael; Stuck, Garrett (2002), Introduction to Dynamical Systems, Cambridge University Press, ISBN 0-521-80841-3.
  • Gallavotti, Giovanni (1995), "Ergodicity, ensembles, irreversibility in Boltzmann and beyond", Journal of Statistical Physics, 78 (5–6): 1571–1589, arXiv:chao-dyn/9403004, Bibcode:1995JSP....78.1571G, doi:10.1007/BF02180143, S2CID 17605281.
  • Glasner, Eli (2003), Ergodic Theory via Joinings, Mathematical Surveys and Monographs, vol. 101, American Mathematical Society, ISBN 0-8218-3372-3.
  • Katok, Anatole; Hasselblatt, Boris (1995), Introduction to the Modern Theory of Dynamical Systems, Cambridge University Press, ISBN 978-0-521-57557-7.
  • Kechris, Alexander S.; Miller, Benjamin D. (2004), Topics in Orbit Equivalence, Lecture Notes in Mathematics, vol. 1852, Springer, doi:10.1007/b99421.
  • Petersen, Karl (1983), Ergodic Theory, Cambridge University Press, ISBN 978-0-521-23632-4.
  • Plancherel, Michel (1913), "Beweis der Unmöglichkeit ergodischer mechanischer Systeme", Annalen der Physik, 42: 1061–1063, doi:10.1002/andp.19133471509.
  • Ruelle, David (1978), Thermodynamic Formalism: The Mathematical Structures of Classical Equilibrium Statistical Mechanics, Addison-Wesley, ISBN 978-0-201-13504-6.
  • Silva, César E.; Danilenko, Alexandre I. (2023), Ergodic Theory, Encyclopedia of Complexity and Systems Science Series (2nd ed.), Springer.
  • Sinai, Yakov G. (1970), "Dynamical systems with elastic reflections. Ergodic properties of dispersing billiards", Russian Mathematical Surveys, 25 (2): 137–189, doi:10.1070/RM1970v025n02ABEH003794.
  • Stöckmann, Hans-Jürgen (1999), Quantum Chaos: An Introduction, Cambridge: Cambridge University Press, doi:10.1017/CBO9780511524622, ISBN 978-0-521-02715-1.
  • Walters, Peter (1982), An Introduction to Ergodic Theory, Springer, ISBN 0-387-95152-0.
  • Zelditch, Steve (2006), "Quantum ergodicity and mixing of eigenfunctions", Encyclopedia of Mathematical Physics, Elsevier: 183–196.
  • Zimmer, Robert J. (1984), Ergodic Theory and Semisimple Groups, Monographs in Mathematics, vol. 81, Birkhäuser.
[edit]
Ergodicity
Morty Proxy This is a proxified and sanitized view of the page, visit original site.