Choose binary expansions that do not end in an infinite string of ones. The doubling map deletes the first digit: . Given and any neighbourhood of it, choose sufficiently large that its binary cylinder of length is small enough, and choose a point sharing that prefix but with a prescribed tail. After shifts, the tail of may be chosen arbitrarily in . Choose it close to zero or close to one, whichever is at distance more than from . Then but . Hence the map has sensitive dependence on initial conditions, with a uniform separation constant. At dyadic endpoints the cylinder sharing the chosen terminating expansion still contains points arbitrarily close to the endpoint.
Every nonempty relatively open interval contains a binary cylinder whose points share a finite prefix. Given nonempty open sets , choose such a cylinder of length . After binary shifts, contains with the usual half-open cylinder convention. In particular, some point of maps into . Thus is topologically transitive: . Equivalently, concatenate a prefix placing the point in with a tail placing its th iterate in .
Given a binary cylinder with finite prefix , repeat a finite block beginning with that prefix indefinitely. The resulting binary sequence is periodic under the shift and represents a periodic point of an interval map of in the cylinder. If the given prefix consists entirely of ones, append a zero to the block so that its value is less than one; this still preserves the prefix. Since cylinders can be taken inside any nonempty open interval, periodic points are dense.
A point fixed by satisfies , so for . The points with period dividing two are , corresponding to . All other twelve points have least period four. Multiplication by two modulo fifteen groups them into the three cycles
This exhausts the requested four-cycles. The displayed order is the dynamical order, and cyclic changes of the starting point describe the same cycle.

Articles by others on the same topic (0)

There are currently no matching articles.