Dyadic transformation explained

The dyadic transformation (also known as the dyadic map, bit shift map, 2x mod 1 map, Bernoulli map, doubling map or sawtooth map[1] [2]) is the mapping (i.e., recurrence relation)

T:[0,1)\to[0,1)infty

x\mapsto(x0,x1,x2,\ldots)

(where

[0,1)infty

is the set of sequences from

[0,1)

) produced by the rule

x0=x

foralln\ge0,xn+1=(2xn)\bmod1

.[3]

Equivalently, the dyadic transformation can also be defined as the iterated function map of the piecewise linear function

T(x)=\begin{cases}2x&0\lex<

1
2

\\2x-1&

1
2

\lex<1.\end{cases}

The name bit shift map arises because, if the value of an iterate is written in binary notation, the next iterate is obtained by shifting the binary point one bit to the right, and if the bit to the left of the new binary point is a "one", replacing it with a zero.

The dyadic transformation provides an example of how a simple 1-dimensional map can give rise to chaos. This map readily generalizes to several others. An important one is the beta transformation, defined as

T\beta(x)=\betax\bmod1

. This map has been extensively studied by many authors. It was introduced by Alfréd Rényi in 1957, and an invariant measure for it was given by Alexander Gelfond in 1959 and again independently by Bill Parry in 1960.[4] [5] [6]

Notes and References

  1. http://www.ibiblio.org/e-notes/Chaos/saw.htm Chaotic 1D maps
  2. Wolf, A. "Quantifying Chaos with Lyapunov exponents," in Chaos, edited by A. V. Holden, Princeton University Press, 1986.
  3. http://www.maths.bristol.ac.uk/~maxcu/Doubling.pdf Dynamical Systems and Ergodic Theory – The Doubling Map
  4. A. Rényi, “Representations for real numbers and their ergodic properties”, Acta Math Acad Sci Hungary, 8, 1957, pp. 477–493.
  5. A.O. Gel’fond, “A common property of number systems”, Izv Akad Nauk SSSR Ser Mat, 23, 1959, pp. 809–814.
  6. W. Parry, “On the β -expansion of real numbers”, Acta Math Acad Sci Hungary, 11, 1960, pp. 401–416.