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
[0,1)
x0=x
foralln\ge0, xn+1=(2xn)\bmod1
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