An interval map has a horseshoe if there are two closed subintervals with disjoint interiors such thatIt is chaotic in Glendinning's sense if some positive iterate has a horseshoe.
Suppose are the points of a 3-cycle and put , . There are two possible cyclic orders. Ifthen the intermediate value theorem givesConsequently both and contain . If insteadthenand again both second images contain . Thus in either cyclic order has a horseshoe.
LetThe covering relations areThus the covering graph has adjacency matrixThe two closed length-three walksgive a horseshoe from two closed covering walks for , so must be chaotic. Moreover,By counting cycles in an interval covering graph, the number of primitive length-three cyclic itineraries isHence must have at least, and the connect-the-dots realization shows that it need have only, distinct 3-cycles.
SetTheir covering graph iswith adjacency matrixThe closed walks and give a horseshoe from two closed covering walks for , so must be chaotic. Sincecounting cycles in an interval covering graph givesdistinct 3-cycles in the minimum case, attained by the corresponding connect-the-dots interval map.
TakeNowsoThe recurrent pieces of this covering graph are the two-cycle and the loop at ; neither contains two competing closed routes. Alsoso this ordering forces no 3-cycle.
The bound is attained by the piecewise-linear functionIndeed,is a 4-cycle with the required spatial order. On , the fourth iterate is the identity function. Within , the fixed point is andso every other point eventually leaves and enters . The map therefore has no horseshoe in any iterate and is not chaotic. The minimum number of distinct 3-cycles is consequently .
Articles by others on the same topic
There are currently no matching articles.