= Dyadic transformation
{wiki}
= Doubling map
{synonym}
The <doubling map> is the <discrete dynamical system>
$$
F(x)=2x\pmod1
$$
on the <unit circle> represented by $0\leq x<1$. In a <binary expansion>, it shifts the digits one place to the left. This makes a small uncertainty in later digits become a large uncertainty after sufficiently many iterates.
Its <Devaney chaos> can be checked directly. The <periodic points of the doubling map> are the grids $j/(2^n-1)$; their mesh tends to zero, giving <dense periodic points>. Every nonempty open arc contains an interval $[j/2^n,(j+1)/2^n]$ for large enough $n$. Its image under $F^n$ covers the <unit circle>, proving <topological mixing> and hence <topological transitivity>. Finally, for any initial point $x$ and arbitrarily large $n$, choose $y=x+2^{-n}/4$ modulo one. Their initial <circle metric> distance tends to zero, while the distance between $F^n(x)$ and $F^n(y)$ is $1/4$. This proves <sensitive dependence on initial conditions> with a fixed separation threshold smaller than $1/4$.
Back to article page