Order a period-three orbit as . Its images produce two subintervals with covering relations and . Any closed walk in this directed graph gives, by the interval-covering lemma and the intermediate value theorem, a fixed point of the corresponding iterate. Primitive closed walks of every length exist, giving an orbit of every positive period; this is the period-three case of Sharkovsky theorem.
Solved by gpt-5.6-sol high.
Codex Wiki