Markov odometer explained

In mathematics, a Markov odometer is a certain type of topological dynamical system. It plays a fundamental role in ergodic theory and especially in orbit theory of dynamical systems, since a theorem of H. Dye asserts that every ergodic nonsingular transformation is orbit-equivalent to a Markov odometer.^[1]

The basic example of such system is the "nonsingular odometer", which is an additive topological group defined on the product space of discrete spaces, induced by addition defined as

x \mapsto x + \underline{ 1 } , where \underline{ 1 }: = ( 1 , 0 , 0 , ... ) . This group can be endowed with the structure of a dynamical system; the result is a conservative dynamical system.

The general form, which is called "Markov odometer", can be constructed through Bratteli–Vershik diagram to define Bratteli–Vershik compactum space together with a corresponding transformation.

Nonsingular odometers

Several kinds of non-singular odometers may be defined.^[2] These are sometimes referred to as adding machines.^[3] The simplest is illustrated with the Bernoulli process. This is the set of all infinite strings in two symbols, here denoted by

\Omega = \{ 0 , 1 \} ^{N} endowed with the product topology. This definition extends naturally to a more general odometer defined on the product space\Omega = \prod _{n\inN} \left( Z /k _{nZ\right)} for some sequence of integers (k _{n)} with each k _{n\ge} 2 .

The odometer for

k _{n=2} for all n is termed the dyadic odometer, the von Neumann–Kakutani adding machine or the dyadic adding machine.

The topological entropy of every adding machine is zero. Any continuous map of an interval with a topological entropy of zero is topologically conjugate to an adding machine, when restricted to its action on the topologically invariant transitive set, with periodic orbits removed.

Dyadic odometer

The set of all infinite strings in strings in two symbols

\Omega = \{ 0 , 1 \} ^{N} has a natural topology, the product topology, generated by the cylinder sets. The product topology extends to a Borel sigma-algebra; let l{B} denote that algebra. Individual points x\in\Omega are denoted as x = (x _{1,x} _{2,x} _{3, … ).}

The Bernoulli process is conventionally endowed with a collection of measures, the Bernoulli measures, given by

\mu _{p(x} _{n=1)=p} and \mu _{p(x} _{n=0)=1-p} , for some 0 <p< 1 independent of n . The value of p =1 / 2 is rather special; it corresponds to the special case of the Haar measure, when \Omega is viewed as a compact Abelian group. Note that the Bernoulli measure is not the same as the 2-adic measure on the dyadic integers! Formally, one can observe that \Omega is also the base space for the dyadic integers; however, the dyadic integers are endowed with a metric, the p-adic metric, which induces a metric topology distinct from the product topology used here.

The space

\Omega can be endowed with addition, defined as coordinate addition, with a carry bit. That is, for each coordinate, let(x + y) _{n=x} _{n+y} _{n+\varepsilon} _{n\bmod2} where \varepsilon _{0=0} and\varepsilon _{n=\begin{cases} 0} & x _{n-1} + y _{n-1} < 2 \\ 1 & x _{n-1} + y _{n-1} =2 \end{cases}

inductively. Increment-by-one is then called the (dyadic) odometer. It is the transformation

T:\Omega\to\Omega given by T(x) = x + \underline{ 1 } , where \underline{ 1 }: = ( 1 , 0 , 0 , ... ) . It is called the odometer due to how it looks when it "rolls over": T is the transformation T\left( 1 , ... , 1 , 0 ,x _{k+1} ,x _{k+2} , ... \right) = \left( 0 , ... , 0 , 1 ,x _{k+1} ,x _{k+2} , ... \right) . Note that T ^{-1} ( 0 , 0 , … ) = ( 1 , 1 , … ) and that T is l{B} -measurable, that is, T ^{-1} (\sigma)\in l{B} for all \sigma\in l{B}.

The transformation

T is non-singular for every \mu _{p} . Recall that a measurable transformation \tau:\Omega\to\Omega is non-singular when, given \sigma\in l{B} , one has that \mu(\tau ^{-1} \sigma) =0 if and only if \mu(\sigma) =0 . In this case, one finds(d \mu _{p} \circ T)/(d \mu _{p}) = \left( (1- p)/(p\right)) ^{\varphi} where \varphi(x) =min \left\{ n\in N \mid x _{n} = 0 \right\} -2 . Hence T is nonsingular with respect to \mu _{p} .

The transformation

T is ergodic. This follows because, for every x \in \Omega and natural number n , the orbit of x under T ^{0,T} ^{1, … ,T} ^{2 ^{n-1}} is the set \{ 0 , 1 \} ^{n} . This in turn implies that T is conservative, since every invertible ergodic nonsingular transformation in a nonatomic space is conservative.

Note that for the special case of

p =1 / 2 , that \left(\Omega, l{B},\mu _{1/2} ,T\right) is a measure-preserving dynamical system.

Integer odometers

The same construction enables to define such a system for every product of discrete spaces. In general, one writes

\Omega = \prod _{n\inN} A _{n} for A _{n=Z/m} _{nZ=\{} 0 , 1 , ... ,m _{n-1\}} with m _{n\ge2} an integer. The product topology extends naturally to the product Borel sigma-algebra l{B} on \Omega . A product measure on l{B} is conventionally defined as style\mu=\prod _{n\inN} \mu _{n} , given some measure \mu _{n} on A _{n} . The corresponding map is defined by T(x _{1,...,x} _{k,x} _{k+1} ,x _{k+2} , ... ) = ( 0 , ... , 0 ,x _{k+1,x} _{k+1} ,x _{k+2} , ... ) where k is the smallest index for which x _{k} ≠ m _{k-1} . This is again a topological group.

A special case of this is the Ornstein odometer, which is defined on the space

\Omega = \left( Z / 2 Z \right) x \left( Z / 3 Z \right) x \left( Z / 4 Z \right) x … with the measure a product of\mu _{n(j)=\begin{cases} 1/2} & if j =0 \\ 1 / 2 (n +1 ) & if j\ne 0 \\ \end{cases}

Sandpile model

A concept closely related to the conservative odometer is that of the abelian sandpile model. This model replaces the directed linear sequence of finite groups constructed above by an undirected graph

(V,E) of vertexes and edges. At each vertex v\in V one places a finite group Z /n Z with n = deg(v) the degree of the vertex v . Transition functions are defined by the graph Laplacian. That is, one can increment any given vertex by one; when incrementing the largest group element (so that it increments back down to zero), each of the neighboring vertexes are incremented by one.

Sandpile models differ from the above definition of a conservative odometer in three different ways. First, in general, there is no unique vertex singled out as the starting vertex, whereas in the above, the first vertex is the starting vertex; it is the one that is incremented by the transition function. Next, the sandpile models in general use undirected edges, so that the wrapping of the odometer redistributes in all directions. A third difference is that sandpile models are usually not taken on an infinite graph, and that rather, there is one special vertex singled out, the "sink", which absorbs all increments and never wraps. The sink is equivalent to cutting away the infinite parts of an infinite graph, and replacing them by the sink; alternately, as ignoring all changes past that termination point.

Markov odometer

Let

B = (V,E) be an ordered Bratteli–Vershik diagram, consists on a set of vertices of the form style\coprod _{n\inN} V ^{(n)} (disjoint union) where V ^{0} is a singleton and on a set of edges style\coprod _{n\inN} E ^{(n)} (disjoint union).

The diagram includes source surjection-mappings

s ^{(n)} _{n:E} \to V ^{(n-1)} and range surjection-mappings r ^{(n)} _{n:E} \to V ^{(n)} . We assume that e,e' \in E ^{(n)} are comparable if and only if r _{n(e)} = r _{n(e')} .

For such diagram we look at the product space

style E: = \prod _{n\inN} E ^{(n)} equipped with the product topology. Define "Bratteli–Vershik compactum" to be the subspace of infinite paths,X _{B} : = \left\{ x = (x _{n)} _{n\inN} \in E\mid x _{n\in} E ^{(n)} and r (x _{n)} = s(x _{n+1} ) \right\}

Assume there exists only one infinite path

x _{max} = (x _{n)} _{n} for which each x _{n} is maximal and similarly one infinite path x _{min} . Define the "Bratteli-Vershik map" T _{B:X} _{B} \to X _{B} by T( x _{max} ) = x _{min} and, for any x = (x _{n)} _{n\in} ≠ x _{max} define T _{B(x} _{1,...,x} _{k,x} _{k+1} , ... ) = (y _{1,...,y} _{k,x} _{k+1} , ... ) , where k is the first index for which x _{k} is not maximal and accordingly let (y _{1,...,y} _{k)} be the unique path for which y _{1,...,y} _{k-1} are all maximal and y _{k} is the successor of x _{k} . Then T _{B} is homeomorphism of X _{B} .

Let

P = \left(P ^{(1)} ,P ^{(2)} , ... \right) be a sequence of stochastic matrices P ^{(n)} = \left(p ^{(n)} _{(v,e) \in V ^{n-1} x E ^{(n)}} \right) such that p ^{(n)} _{v,e} > 0 if and only if v = s _{n(e)} . Define "Markov measure" on the cylinders of X _{B} by \mu _{P} ([e _{1,...,e} _{n])} = p ^{( 1 )} _{s _{1(e} _{1),e} _{1}} … p ^{(n)} _{s _{n(e} _{n),e} _{n}} . Then the system \left(X _{B,} l{B}, \mu _{P,} T _{B} \right) is called a "Markov odometer".

One can show that the nonsingular odometer is a Markov odometer where all the

V ^{(n)} are singletons.

See also

• Abelian sandpile model

Further reading

• Book: Aaronson, J. . An Introduction to Infinite Ergodic Theory . . 25–32 . 9781470412814 . Mathematical surveys and monographs . 50 . 1997.
• Book: Dooley, Anthony H. . Markov odometers . 1063.37005 . 60–80 . Bezuglyi . Sergey . Kolyada . Sergiy . Topics in dynamics and ergodic theory. Survey papers and mini-courses presented at the international conference and US-Ukrainian workshop on dynamical systems and ergodic theory, Katsiveli, Ukraine, August 21–30, 2000 . Cambridge . . 0-521-53365-1 . Lond. Math. Soc. Lect. Note Ser. . 310 . 2003 .

Notes and References

1. A.H. . Dooley . T. . Hamachi . Nonsingular dynamical systems, Bratteli diagrams and Markov odometers . . 138 . 93–123 . 2003 . 10.1007/BF02783421 . free.
2. Book: Alexander I. . Danilenko . Cesar E. . Silva . Ergodic Theory: Nonsingular Transformations . Mathematics of Complexity and Dynamical Systems . Meyers . Robert A. . 2011 . 0803.2424 . 10.1007/978-1-4614-1806-1_22 . free . Springer .
3. Book: Matthew . Nicol . Karl . Petersen . Ergodic Theory: Basic Examples and Constructions . https://www.math.uh.edu/~nicol/pdffiles/petersen.pdf . Encyclopedia of Complexity and Systems Science . Springer . 2009 . 978-0-387-30440-3 . 10.1007/978-0-387-30440-3_177.