The image of the full interval under the tent map is . Since , this image contains the critical point zero and the right endpoint one; its next image is again . Moreover, any interval with lies inside the image of . Thus the core interval of an expanding tent map is
Every point outside enters after one iterate and then stays there. For there are no points of the domain outside .
To prove interval exactness of a tent-map core, first take a nondegenerate closed interval and put . Each is an interval. If does not straddle zero, the corresponding branch is affine with slope of magnitude , so . If it straddles zero, its image has right endpoint one and
If both and contain zero, then contains , whence . Otherwise at most one of these two steps folds across the critical point. Consequently, unless the full core has already been reached,
Since , indefinite failure to reach would give intervals of unbounded length inside an interval of length . This is impossible, proving . For an interval with open endpoints, apply the argument to any nondegenerate closed subinterval inside it; its image already covers , while the image of the original interval cannot leave .
Now let be any nonempty relatively open subset of and choose a closed nondegenerate . Some maps onto , so there are points with and . Therefore and . The intermediate value theorem yields with . This is a periodic point of , of period dividing . Every such contains one, so the periodic points are dense in the whole core .
Use the interval exactness of a tent-map core from the preceding part. Choose two separated nondegenerate closed intervals inside . There are integers with . Taking works for both, because :
Within each , the continuous function attains both endpoint levels and . Choose a segment between those levels, reversing its orientation if necessary. Starting from a point at level , take the first point at level one, and then the last point at level before it. Between these two points, continuity and the first-passage choice give , with all intermediate levels attained. The interior of that segment therefore satisfies . The intervals are disjoint and lie inside .
Thus interval exactness produces a horseshoe:
This is a horseshoe for an interval map for an iterate of , proving Glendinning chaos for every . The proof does not require the same horseshoe iterate to work for every parameter.
For , use centered tent-map period-doubling renormalization. Let
The image lies to the right of , with disjoint interiors, because . It lies in the positive branch. Consequently,
and its range is contained in . The orientation-reversing affine map gives the exact topological conjugacy
Thus renormalization squares the slope and halves the return period. Since , there is a least for which . Minimality implies , and all previous slopes are in the renormalizable range. Successive affine maps therefore conjugate the restriction of on a nested central interval to .
By the preceding part, an iterate has a horseshoe for an interval map. Pull its two branch intervals and its range interval back through the composed conjugacy. They give a horseshoe for . Therefore
At the endpoint , one renormalization gives the full slope-two tent map, so the argument includes that endpoint without assuming the strict inequality from part (a).

Articles by others on the same topic (0)

There are currently no matching articles.