Sharkovskii's theorem


Sharkovskii's theorem

In mathematics, Sharkovskii's theorem is a result about discrete dynamical systems. One of the implications of the theorem is that if a continuous discrete dynamical system on the real line has a periodic point of period 3, then it must have periodic points of every other period.

The theorem

Suppose

:"f" : RR

is a continuous function. We say that the number "x" is a "periodic point of period m" if "f" "m"("x") = "x" (where "f" "m" denotes the composition of "m" copies of "f") and having "least period m" if furthermore "f" "k"("x") ≠ "x" for all 0 < "k" < "m". We are interested in the possible periods of periodic points of "f". Consider the following ordering of the positive integers::3, 5, 7, 9, ... ,2·3, 2·5, 2·7, ... , 22·3, 22·5, ..... , 24, 23, 22, 2, 1.

We start, that is, with the odd numbers in increasing order, then 2 times the odds, 4 times the odds, 8 times the odds, etc., and at the end we put the powers of two in decreasing order. Sarkovskii's theorem states that if "f" has a periodic point of period "m" and "m" ≤ "n" in the above ordering, then "f" has also a periodic point of period "n".

As a consequence, we see that if "f" has only finitely many periodic points, then they must all have periods which are powers of two. Furthermore, if there is a periodic point of period three, then there are periodic points of all other periods.

Sharkovskii's theorem does not state that there are "stable" cycles of those periods, just that there are cycles of those periods. For systems such as the logistic map, the bifurcation diagram shows a range of parameter values for which apparently the only cycle has period 3. In fact, there must be cycles of all periods there, but they are not stable and therefore not visible on the computer generated picture.

Interestingly, the above "Sharkovskii ordering" of the positive integers also occurs in a slightly different context in connection with the logistic

The assumption of continuity is important, as the discontinuous function f : x ightarrow (1-x)^{-1}, for which every value has period 3, would otherwise be a counterexample.

History

This result (also known as Sharkovsky's theorem) is named for Oleksandr Mikolaiovich Sharkovsky.

Generalizations

Sarkovskii's theorem does not immediately apply to dynamical systems on other topological spaces. It is easy to find a circle map with periodic points of period 3 only: take a rotation by 120 degrees, for example. But some generalizations are possible, typically involving the mapping class group of the space minus a periodic orbit.

References

*
*


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Chaos theory — This article is about chaos theory in Mathematics. For other uses of Chaos theory, see Chaos Theory (disambiguation). For other uses of Chaos, see Chaos (disambiguation). A plot of the Lorenz attractor for values r = 28, σ = 10, b = 8/3 …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Symbolic dynamics — In mathematics, symbolic dynamics is the practice of modelling a topological or smooth dynamical system by a discrete space consisting of infinite sequences of abstract symbols, each of which corresponds to a state of the system, with the… …   Wikipedia


Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.