Symbolic dynamics and horseshoes
Encode a hyperbolic invariant set by bi-infinite itineraries, count periodic behavior, and state precisely what a horseshoe proves about a system.
On this page
The question for today
What you’ll understand
- Define the two-sided full shift and a topological conjugacy to an invariant set.
- Count fixed points of shift iterates without confusing points with distinct cycles.
- Distinguish a horseshoe's invariant chaotic subset from a global attracting set or a typical-orbit claim.
A chaotic-looking picture becomes a theorem when its trajectories can be coded and the code obeys a known dynamical rule. The Smale horseshoe gives a precise version of stretching, contraction, and return: points that remain in a selected region for all positive and negative iterates form an invariant set, and their strip itineraries behave like a shift of symbols. The conclusion describes a particular invariant subset. It does not claim that every starting point is chaotic or that the subset attracts a physically typical ensemble.
The full shift carries both past and future
Let Sigma be the set of all bi-infinite sequences of zeros and ones, indexed by every integer. Give it the product topology, for example through a weighted distance in which disagreement near index zero matters more than disagreement far away. The left shift sends the symbol at index j+1 into index j. It is a homeomorphism because shifting right reverses it. A one-sided shift instead forgets its earliest symbol and is not invertible, so the two models encode different amounts of past information.
For a diffeomorphism F on a geometric invariant set Lambda, an itinerary map h is a topological conjugacy when it is a homeomorphism and h after F equals shift after h. Every allowed symbolic orbit then corresponds to exactly one geometric orbit with the same temporal organization. A noninjective coding may give only a semiconjugacy, which transfers fewer properties without further argument. Boundaries and overlapping coding rectangles must be handled rather than silently assuming every symbolic label identifies one point.
Nested strips create a genuinely invariant horseshoe
In an ideal two-strip horseshoe, a smooth invertible planar map contracts one direction, expands the other, folds, and crosses a reference square in two separated strips with the standard full-crossing geometry. Keep only points that stay in the square for every integer iterate. Future strip choices narrow one coordinate; past choices narrow the other. Uniform contraction of the nested rectangles then identifies one point for every bi-infinite itinerary. This is the mechanism behind the invariant Cantor set and its conjugacy, not a consequence of a decorative U-shaped image alone.
The invariant set supports dense periodic points, topological transitivity, sensitive dependence, and positive topological entropy. Finite binary words generate exponentially many distinguishable orbit segments. A sequence repeating a word gives a periodic point, while nonperiodic sequences give nonperiodic orbits. The set is usually a saddle-type invariant Cantor set rather than an attractor: many nearby points leave the chosen square. Area contraction or one expanding singular value by itself establishes neither the required return geometry nor the full symbolic correspondence.
A transverse homoclinic orbit can force a horseshoe
The Smale–Birkhoff homoclinic theorem connects this model to less explicitly constructed maps. For a continuously differentiable planar diffeomorphism, a transverse intersection away from a hyperbolic saddle fixed point between its stable and unstable manifolds produces a horseshoe for a suitable iterate in the nearby homoclinic dynamics. A hyperbolic periodic point can be treated through its period iterate. Transverse means the tangent stable and unstable directions span the plane at the intersection; merely drawing two curves close together or tangent is insufficient.
This is a theorem about an invariant set for some iterate, so time units must be preserved. If F to the k has a full two-symbol horseshoe, the corresponding entropy lower bound per original iteration is log two divided by k. It does not follow that the whole phase space has one mixing attractor, that almost every initial point visits the horseshoe, or that its symbolic probability law is automatically a fair independent coin process. Those are additional topological, measure-theoretic, or physical-observability questions. The rigorous gain is already substantial: complicated recurrence is forced on a precisely identified invariant subset.
Work it through
Count points and cycles separately
In a full two-symbol horseshoe, count points fixed by F³, then determine how many have minimal period three and how many distinct three-cycles they form. Assume F itself is conjugate to the full shift on this set.
A sequence fixed by the third shift is determined by its three-symbol block, so there are 2³=8 fixed points of F³ under the conjugacy.
A minimal period dividing three is either one or three. The constant all-zero and all-one sequences give the two period-one points, leaving six points of minimal period three.
Each minimal three-cycle contains three different points, so six points form two cycles. The repeating blocks 001 and 011 represent the two cyclic classes; rotating a block changes the chosen point on its cycle rather than creating a new cycle.
F³ has eight fixed points on the horseshoe: two fixed points of F and six points arranged into two distinct three-cycles.
The living notebook
Explore the model
Interactive lab · matrix
Stretch and contraction are ingredients, not a horseshoe
Pause and reset, then set both controls to diagonal scale a = 0.5 and shear b = 2. Predict area scale 0.5 while the largest singular value exceeds one; inspect the selected-matrix readouts and transformed square. For a fresh comparison, pause and reset, then set a = 1 and b = 0, giving the identity. This linear family has no folding-return construction or coded invariant Cantor set. Playback interpolates geometry and does not iterate the matrix. Use it to isolate why one-step stretching plus area contraction is insufficient to prove horseshoe dynamics.
- Area scale · det A
- 1.4
- Singular values · σmax, σmin
- 1.597, 0.876
- Condition number · κ₂(A)
- 1.823
The selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forA horseshoe theorem needs repeated return, hyperbolic strip geometry, and a verified invariant coding beyond one-step deformation.
Pause & reason
Check your understanding
Your turn
Try it yourself
For the full two-symbol shift, count points fixed by the fourth iterate and points of minimal period four. How many distinct four-cycles result? Explain why subtracting only the two constant sequences would be wrong.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Periods dividing four are one, two, and four. The points fixed by the second iterate include both of the shorter possibilities.
Compare with the solution
There are 2⁴=16 points fixed by the fourth iterate. Exactly 2²=4 of them are fixed by the second iterate: two constant sequences and two alternating period-two sequences. Removing those four leaves twelve points of minimal period four. Each four-cycle contains four points, so there are three distinct four-cycles. Subtracting only the constants would incorrectly retain the alternating sequences, which repeat after two shifts and therefore do not have minimal period four.
Keep the idea
Take it with you
- A two-sided symbolic conjugacy encodes both forward and backward geometric dynamics on an invariant set.
- Periodic-point counts must remove shorter periods before dividing into distinct cycles.
- Horseshoes prove structured chaos on a subset; attraction, typicality, and probability laws are additional claims.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.