The material presented here is rather trivial to those who have spent even a small time looking at chaotic systems. Nevertheless, we found it instructive when we first discovered it for ourselves while studying conics. Hence, as part of recording such little tidbits of trivia that over the years have caught our eyes we are putting it down here.
Consider the iterative map,
Notably, irrespective of what starting number you take (with one exception) it converges to the Golden ratio (Figure 1).
The one exception is when . In this case it is rather obvious why it remains fixed at . However, notably, say you are very close to , e.g. -.61804, then you hover close to for around 7 iterations and then drift away rapidly to converge to quite rapidly. The rate of convergence measured as the number of iterations you take to converge within a certain range of (say in below figure) shows an interesting pattern: for values closer and closer to you take longer and longer to converge to whereas values closer to , not surprisingly, converge faster. Thus, while serves as the near universal attractor and as the near universal repellor for this map, the repellor is actually weaker at repelling values that lie closer to it (Figure 2).
Rather dramatic jumps but still convergent behavior can be obtained at certain points: When we jump between 0 and before moving towards convergence. This behavior can be studied in terms of the maximum value reached by before convergence towards . The distribution of these values for various starting shows a peculiar fractal structure with peaks of decreasing heights as one moves towards the repellor from either direction (Figure 3).
So what it is the connection to conics alluded to above? One can see right away that the above map corresponds to the hyperbola,
The iterations of the map can be rendered geometrically as the famous cobweb diagram used by students of chaotic dynamics: Start with a curve and a point representing on the x-y plane. Move along the vertical direction from that point till you hit the nearest point on the curve. Mark that segment. Then proceed in the horizontal direction till you hit a point on the line . Mark that segment. Then move vertically again to hit the curve and so on. Repeat this procedure till you converge. When you do this procedure for the above hyperbola (Figure 4) then every point except one with x-coordinate converges to the point , which is the attractor. The repellor is . One can see that these fixed points are intersects of the said hyperbola and the line
Now there exists a parabola with the same fixed points as the above hyperbola:
For this parabola, if a starting point for the cobweb diagram lies in the band delimited by the lines then it moves towards . But it does not converge to that point. Instead it is eventually trapped in a four-point orbit: (Figure 5). If the starting point lies outside the above band then it races away to . But there are a some points where it actually converges to one or the fixed points. Any point whose x-coordinate is converges to . Any point whose x-coordinate is or converges to . The closer point’s x-coordinate is to one of the above values the greater the number of iterations it requires to be placed in the final four-point orbit. Thus, the parabola with the same fixed points as the said hyperbola displays a very different behavior — the outcomes are convergence to a fixed point, divergence to or eventually settling into a fixed orbit. However, for certain parabolas such as the logistic parabola, we see the famous chaotic behavior for certain values of .