Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » geometry.college.independent

Topic: Sharkovskii's Theorem
Replies: 1   Last Post: Nov 8, 1993 12:08 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Evelyn Sander

Posts: 187
Registered: 12/3/04
Sharkovskii's Theorem
Posted: Nov 1, 1993 11:52 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Sharkovskii's Theorem

There is a theorem which is both beautiful and important
in the history of dynamical systems. Thus it deserves its
own article. It involves a somewhat strange way to order
the integers, stated at the end of the article. I write
n ">" k to mean n is greater than k in this strange ordering.
Here is the theorem:

Sharkovskii's Theorem (1964): If f is a continuous map from
an interval to the real line, then if f has a point of least period n,
and if n ">" k, then f has a point of least period k.

This says that just knowing one periodic point can
indicate the existence of many other periodic points,
without you ever having to find those other points.

In particular, a continuous real-valued map of an interval with a
point of period three has points of every other period. This is the
subject of one of the most famous papers in dynamical systems, Li and
Yorke's "Period three implies chaos," 1975. This paper is the first
time that the word chaos was used mathematics; it was a well-received
paper that provided the name of a new branch of math. Though it
turned out that the result in the paper had been proved in stronger
form previously (Li and Yorke did not know of Sharkovskii's paper, as
it was in an obscure journal in the Soviet Union), the paper stated
the results in such an exciting and beautiful way, that it is still
quoted to this day.

Strange Ordering of the integers:
3 is "largest," followed by 5 ">" 7 ">" 9 ">" all odd numbers,
backwards from the standard ordering of the integers.

Next largest are,
2*3 ">" 2*5 ">" 2*7 ">" in backward order all integers
of the form 2 times an odd integer. Then:

4*3 ">" 4*5 ">" 4*7 ">" . . .

. . .

2^n*3 ">" 2^n*5 ">" 2^n*7 ">" . . .

2^(n+1)*3 ">" 2^(n+1)*5 ">" 2^(n+1)*7 ">" . . .

. . .

Finally,
. . . 2^n ">" 2^(n-1) ">" . . . ">"4 ">" 2 ">" 1.






Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.