For the doubling map on , a binary expansion gives
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.

Articles by others on the same topic (0)

There are currently no matching articles.