= Binary shift representation of the doubling map
For the doubling map $F(x)=2x\pmod1$ on $[0,1)$, a <binary expansion> $x=0.b_1b_2b_3\ldots$ gives
$$
F(x)=0.b_2b_3b_4\ldots.
$$
Multiplication by two removes the first digit after reduction modulo one. Thus binary <cylinder sets> describe exactly which branches the first few iterates visit.
Concatenating two prescribed finite blocks with enough intervening digits constructs a point whose itinerary visits the associated cylinders in order. Repeating a finite block gives a periodic point arbitrarily close to any prescribed finite prefix. These observations prove <topological mixing> and density of <periodic points>.
At dyadic rationals, terminating and eventually-all-one expansions describe the same number; one consistent convention is to choose the expansion ending in zeros. Therefore the numerical map is not globally bijectively conjugate to the unrestricted one-sided binary sequence space without accounting for endpoint identifications. Binary coding remains a useful representation with those identifications made explicit.
Back to article page