Paper 4, Section II, E
Let be closed bounded intervals in , and let be a continuous map.
Explain what is meant by the statement that ' -covers ' (written . For a collection of intervals define the associated directed graph and transition matrix . Derive an expression for the number of (not necessarily least) period- points of in terms of .
Let have a 5 -cycle
such that for where indices are taken modulo 5 . Write down the directed graph and transition matrix for the -covering relations between the intervals . Compute the number of -cycles which are guaranteed to exist for , for each integer , and the intervals the points move between.
Explain carefully whether or not is guaranteed to have a horseshoe. Must be chaotic? Could be a unimodal map? Justify your answers.
Similarly, a continuous map has a 5 -cycle
For what integer values of , is guaranteed to have an -cycle?
Is guaranteed to have a horseshoe? Must be chaotic? Justify your answers.