Horseshoe Chaos

While I struggle with supposedly impossible inversions, I'd like to introduce you all to Smale's horseshoe. This object is where the definition of chaos originates yet it is a relatively simple idea.

You start with a square. Squish is down and pull it out to the sides then bend it at the halfway point so it looks like a horseshoe. Then replace it over the square so that the two lengths form vertical strips on the square. This is the basic transformation of the horseshoe map. It is also invertible. Take the bent strips, rotate back to horizontal, and unbend it then squish it in from the sides and pull from the top and bottom then you get the square again. If you do this inversion again you get strips intersection horizontally.

Repeatedly performing the forward transformations you get more and increasingly thin vertical strips: 2 strips become 4, 4 strips become 8 i.e. each strip gets two thinner strips within it at each iteration. Doing the same backwards, you get lots of increasingly thinner horizontal strips. The points in the strips are the points that remain in the set at that iteration. Most points leave after even just a few iterations in either direction.

If you overlay the two directions, the points at the intersections that remain in the square under all iterations (if you iterate infinitely in either direction). This is the invariant set. This set is a Cantor set (disconnected and unstable fractal).

If you labelled each point with 0 or 1 at each iteration you could describe the positions of all the points in the square e.g. .0101 means a point that is in the 6th vertical strip after four iterations (the right hand strip of the left hand strip of the right hand strip of the left hand strip in the first iteration) or

If you can see that...sorry if it's too small.

Since you can do this in both directions, the whole dynamics of any point in the square can be described by it's bi-infinite sequence of positions.
Knowing this we can construct any orbit we like and we know it will describe at least one point in the square.
So we can make a periodic point: ...010101.0101010... which alternates from the left to the right. Since we have infinite lengths in both direction, we can make (uncountably) infinitely many of these periodic points.
Or we can make a non-periodic point: ...010001101100000.1010100110111... by, for example, 'counting' in binary as above or just by adding the wrong value to a periodic point i.e. ...01010101.0101011...is non-periodic. There are (uncountably) infinite of these too.
Among this set of non-periodic orbits we can find at least one that comes arbitrarily close to the invariant set. This is trivial since you can take just part of the sequence that describes a point in the invariant set and it would come as close as you like!

I hope you are following since I have just demonstrated that Smale's horseshoe perfectly defines chaos.
Chaotic motion must consist of the following:
- infinitely many periodic orbits
- non-periodic orbits
- dense orbits - ones that come arbitrarily close to any point in the set.
There tends also to be the condition of sensitive dependence on initial conditions but this can be shown through the dense orbits - you can take two sequences that are the same for any arbitrary iterations and in the next they can end up in two different strips i.e. they may start very close but can end up very far apart.

Voila!

Strogatz does give a very basic introduction but for a more detailed approach read the first chapter of "Elements of Applied Bifurcation Theory" by Yuri Kuznetsov. Wiki also has its own explanation.