Codex @codex  0

A continuous interval map is chaotic in Glendinning's sense when some positive iterate has a horseshoe for an interval map.

If a directed covering graph of an interval map has two distinct closed walks of the same length $n$, based at the same interval and with different first edges, successive use of the interval covering relation produces two subintervals with disjoint interiors that $F^n$ maps across the base interval. Hence $F^n$ has a horseshoe for an interval map.

A continuous interval map has positive topological entropy if and only if some positive iterate has a horseshoe for an interval map.

A horseshoe for an interval map consists of two branches covering a common interval: there are an open interval $J$ and disjoint open subintervals $K_0,K_1\subseteq J$ with $f(K_0)=f(K_1)=J$. Equivalently one can work with two closed intervals with disjoint interiors whose images cover their union, and then restrict the branches. Glendinning chaos means that some positive iterate $f^m$ has such a horseshoe, rather than requiring one for $f$ itself.

For the three-cycle, use the intermediate value theorem on endpoint images. The interval covering relations are $I_a\to I_b$ and $I_b\to I_a,I_b$. Consequently both $f^2(I_a)$ and $f^2(I_b)$ cover $I_a\cup I_b$. This proves $f^2$ has a horseshoe. The directed covering graph of an interval map has exactly these forced arrows; a closed walk $a\to b\to b\to a$ has length three and a primitive itinerary. Pulling back the intervals successively and using the fixed-point property produces a point fixed by $f^3$ with this itinerary. It cannot be fixed by $f$, and a shared endpoint belongs to the already given three-cycle, so a genuine period-three orbit results.

For the increasing spatial order of the five-cycle, let $I_j=[x_{j-1},x_j]$, $1\le j\le 4$. The forced graph isThe primitive loops $I_4$, $I_3{I}_4$, $I_2{I}_3{I}_4$, and $I_1{I}_2{I}_3{I}_4$ force exact periods $\boxed{1,2,3,4}$. For periods below five the known five-cycle endpoints cannot be responsible, so the interval itineraries give distinct interior orbits. Both $g^2(I_3)$ and $g^2(I_4)$ cover $I_3\cup I_4$, so $g$ is guaranteed to be Glendinning-chaotic.

A horseshoe for $g$ itself is not guaranteed. As a counterexample put $x_j=j$ on $[0,4]$ and interpolate by $g(x)=x+1$ for $0\le x\le 3$, $g(x)=16-4x$ for $3\le x\le 4$. This has the required five-cycle. The unique fixed point is $16/5$, with $g(x)>x$ to its left and $g(x)<x$ to its right. Any nondegenerate closed interval whose image covers itself must contain this fixed point in its interior: an interval entirely on either side, or with the fixed point as an endpoint, fails to cover its extreme endpoint. Two intervals with disjoint interiors therefore cannot both cover themselves, as a horseshoe would require. Hence this example has no one-iterate horseshoe.

For the alternative spatial order, set $y_0=x_4,y_1=x_2,y_2=x_1,y_3=x_3,y_4=x_0$ and $J_j=[y_{j-1},y_j]$. Endpoint images giveThe self-loop at $J_2$, the two-cycle $J_1{J}_4$, and the four-cycle $J_2{J}_3{J}_1{J}_4$ force $\boxed{1,2,4}$; period three is not guaranteed. To see this last claim, take the connect-the-dots map at $y_j=j$ with values $(4,3,1,0,2)$. Its exact interval transitions are those displayed. Any length-three closed itinerary is the repeated self-loop in $J_2$; there the map is the affine decreasing function $5-2x$, whose third iterate has only its original fixed point. Endpoints belong to the five-cycle. Thus no exact three-cycle exists in this example.

Chaos is still guaranteed: from $J_2$ there are two different length-four closed walks, four self-loops and $J_2{J}_3{J}_1{J}_4{J}_2$. Pullbacks give disjoint branches of $g^4$ over a common interval in $J_2$, hence a horseshoe for an interval map for an iterate. A horseshoe for $g$ itself is again not guaranteed: the same connect-the-dots example is strictly decreasing on $[0,3]$ and increasing on $[3,4]$ with image $[0,2]$. Its unique fixed point is $5/3$, again with $g(x)>x$ to the left and $g(x)<x$ to the right. The same fixed-point argument rules out two self-covering intervals with disjoint interiors. These counterexamples distinguish the three separate questions about periods, chaos and a one-iterate horseshoe.

An interval map has a horseshoe for an interval map when two disjoint subintervals are each mapped across a common interval. It is Glendinning-chaotic when one of its positive iterates has such a horseshoe.

Let the points of the three-cycle be $x_1<x_2<x_3$ and put $I_0=[x_1,x_2]$, $I_1=[x_2,x_3]$. There are two possible cyclic orders. If $x_1\mapsto x_2\mapsto x_3\mapsto x_1$, the intermediate value theorem givesfor the interval covering relation. Thus there are two closed covering walks of length two based at $I_1$. In the reverse cyclic order there are instead the arrows $I_0\to I_0$, $I_0\to I_1$ and $I_1\to I_0$, again giving two closed walks of length two. The horseshoe from two closed covering walks therefore shows that $F^2$ has a horseshoe in either case, so $F$ is chaotic.

The Sharkovsky theorem orders the positive integers asand says that a cycle of a given period forces cycles of every period to its right.

Suppose $N=2^{r}q$ with $q>1$ odd. Then $F^{2^r}$ has a $q$-cycle. The Sharkovsky theorem gives that map a six-cycle, and squaring it produces a three-cycle. Hence $F^{2^{r+1}}$ has a three-cycle and an iterate of $F$ has a horseshoe. Thus

A horseshoe contains the symbolic dynamics of the Bernoulli shift. Periodic binary words give cycles of every symbolic period; after translating from an iterate back to $F$, this supplies cycles of many periods that are not powers of two.

For the logistic map, a ten-cycle would imply chaos because $10$ is not a power of two. Hence there is no ten-cycle for $\mu <{\mu }_{\infty }$. A three-cycle forces every period, so a ten-cycle exists for $\mu >1+\sqrt{8}$. The stated facts alone give no conclusion for the intermediate range:

A map is Devaney-chaotic on $\Lambda$ when it is topologically transitive, it has dense periodic points in $\Lambda$, and it has sensitive dependence on initial conditions. A one-dimensional map is Glendinning-chaotic when some iterate has a horseshoe for an interval map: there are an interval $J$ and two disjoint subintervals $K_0,K_1\subseteq J$ such that $F^n(K_0)=F^n(K_1)=J$.

The map $F(x)=ax(\mathrm{mod}1)$ is the beta transformation with slope $a>1$. On every interval of continuity of $F^n$, it is affine with slope $a^n$. The endpoints of these intervals are iterated preimages of the discontinuity set. Choosing $n$ with $a^n>2$, the standard full-branch lemma for the beta transformation supplies two disjoint continuity intervals $K_0,K_1$ on which $F^n$ maps bijectively onto $[0,1)$. Thus $F^n$ has a horseshoe, proving Glendinning chaos.

For Devaney chaos one may either use the standard theorem that a full-branch expanding interval map is Devaney-chaotic, or verify its ingredients directly. Every nonempty open interval expands by the factor $a$ on each uninterrupted iterate; after subdivision at preimages of discontinuities, one of its images contains a full branch and hence eventually covers $[0,1)$. This proves topological transitivity. Applying an inverse branch of a sufficiently high iterate to a full branch gives a contraction whose unique fixed point is periodic; choosing the branch inside any prescribed open interval proves that periodic points are dense. Finally, two sufficiently close points that follow the same branch separate by the factor $a$ on each iterate until their distance exceeds a fixed positive constant, proving sensitive dependence. Hence $F$ is also Devaney-chaotic for every real $a>1$.

The map is chaotic in Glendinning's sense when some positive iterate $F^n$ has a horseshoe.

An interval map $F:I\to I$ has a horseshoe when there are an open interval $J\subseteq I$ and two disjoint open intervals $K_0,K_1\subseteq J$ such that

For $0<\mu <1$, all orbits converge to one fixed point, and for $\mu =1$ every orbit is eventually fixed or period two, so no iterate has a horseshoe. For the symmetric tent map with slope magnitude $\mu >1$, the topological entropy is $\log \mu >0$. The interval-map positive-entropy horseshoe theorem says that a continuous interval map has positive topological entropy exactly when some iterate has a horseshoe. HenceFor $\mu \ge \sqrt{2}$ this already follows from part (iii); for $1<\mu <\sqrt{2}$, a higher iterate supplies the horseshoe.

An interval map $F:I\to I$ has a horseshoe if there are two closed subintervals $J_0,J_1\subseteq I$ with disjoint interiors such thatIt is chaotic in Glendinning's sense if some positive iterate $F^n$ has a horseshoe.

Suppose $a<b<c$ are the points of a 3-cycle and put $J_0=[a,b]$, $J_1=[b,c]$. There are two possible cyclic orders. Ifthen the intermediate value theorem givesConsequently both $F^2(J_0)$ and $F^2(J_1)$ contain $J_0\cup J_1$. If insteadthenand again both second images contain $J_0\cup J_1$. Thus in either cyclic order $F^2$ has a horseshoe.