Emergence of Chaos

(There is order in chaos)

An iterative process with a simple quadratic equation f(x) = x² + c when considered in the complex domain, led to computer graphics of unusual richness, beauty and appeal, and constituted one of the fundamental pieces in the foundation of the new science of fractals.

A study of iterations with another quadratic equation f(x) = kx(1-x) was a cornerstone in a related development of the science of chaos. This is a well known logisitic equation. The process x_n+1 = kx_n(1 - x_n) often closely describes a population change from year n to the next year (n+1). The first term (kx) reflects the reproduction tendency which is proportional to the present population. The need to coexist and share resources is presented by the inhibiting term (1-x). Robert May, an Australian mathematician engrossed in Biology, studied the global behavior of the process in its dependency on the selection of the coefficient k. (The iterations are modeled elsewhere.)

In the real domain, iterative processes admit quite a transparent graphical representation. Start with x₀. Draw a vertical line until it intersects the graph of y = f(x). At the point of intersection y = f(x₀). Take this y as a new iterate: x₁ = f(x₀). Since we are accustomed to have x values on the horizontal axis, recall that the equation of the diagonal in the first quadrant is y = x. Trace a horizontal line until its intersection with the diagonal and then downwards towards x-axis. Now starting with x₁ you obtain x₂ in a similar way. A vertical line up to the graph, then a horizontal line towards the diagonal. There is no need to continue the lines until they meet the axes. Just move intermittently between the graph and the diagonal.

On the diagram, subsequent iterates become closer and closer and each closer to the point of intersection of the graph and the diagonal. The point of intersection is a solution of the equation x = f(x). Such a solution is called stable because iterates {x_n} tend to converge there. Not all solutions of x = f(x) are stable. If f(x) = kx(1-x) then obviously x=0 is a solution of x=f(x). This one is unstable. However close to 0 one selects the first approximation x₀, x₁ will be father away from 0 than x₀, and the next iterate x₂ will be even farther on and so on.

Below, the applet's panel is split into two parts - left and right. The horizontal axis on the right corresponds to a parameter a changing from .7 through 1. When you select a parameter by clicking on the right graph, on the left, the function f(x) = 4ax(1-x) is graphed, and iterations start with a randomly selected x₀. I replaced k with 4a so that the top of the graph (attained for x = 1/2) is always equal to a.

Now let's experiment with the iterations as a changes. For a while the equation x = 4ax(1-x) will have a single stable point. Then, as a moves over a = 0.75, the process begins alternating between two different points without converging to either. This is what is depicted on the right. A single curve of stable solutions of x = f(x) splits into two over the point corresponding to a = 0.75.

After a = 0.86237... the two curves split further into four whereas the iteration oscillate between four different points. Next four points are replaced by 8 and 8 by 16 and so on. Note too that the horizontal distance between the split points (points of bifurcation) grows shorter and shorter. Until the bifurcation becomes so fast at the point a=.892 that iterates race all over a segment instead of alternating between a few fixed points. The behavior is chaotic in the sense that it's absolutely impossible to predict where the next iterate will appear. Ian Stewart (p. 58) gives the following definition: Chaos is apparently random behavior with purely deterministic causes.

Interestingly, for some values of a even after the point 0.86237... there appears some regularity. You can easily find a window where iterates oscillate between three different points forming a 3-cycle. If you are patient you'll be able to detect a 6-cycle as well. Of course there are 12- and 24-cycles and others. The program is just not accurate enough to support deeper investigation.

The reason for the bifurcation may be surmised from the graph of the second iterate function y=f(f(x)). Besides 0, the graph of the function crosses the diagonal at three points. The points A and C are stable so that depending on where they start the iterates of y=f(f(x)) will converge to either A or C. The point B, like 0, is a repeller. However close to B you start iterations they will escape from there and converge to either A or C.

The terminology is as follows.

1. The point x is stationary (or fixed) for y=f(x) iff x=f(x).
2. A stationary point x is attractive iff for x₀ sufficiently close to x the iteration {x_n} converge to x.
3. A stationary point x is repelling iff no iterations {x_n} with x₀x ever converge to x.
4. A finite sequence of points {x_n, x_n+1, ..., x_n+p-1} with p>1, is a p-cycle iff x_n=f(x_n+p-1) and x_nf(x_n+q-1) for 2q<p. Cycles may be both attractive and repelling.

You can observe from the graphs that their slopes behave differently at the attractive and repelling points. A point x is attractive if |slope(f(x))|<1. A point x is repelling if |slope(f(x))|>1.

Another thing is worth noting. With the parameter a near but less than 0.75, the slope of the graph at the stationary point is less than 1 in absolute value. As a approaches 0.75 the absolute value of the slop grows and, at 0.75, becomes 1. This makes the point unstable and eventually causes the iterations split into a 2-cycle. First the 2-cycle is attractive. Then, as a grows, it loses its stability and, eventually, splits into a 4-cycle.

References

1. J. Gleick, Chaos, Viking, 1987
2. D. R. Hofstadter, Metamagical Themas, Basic Books, Inc., 1985, Chapter 16.
3. B. Mandelbrot, The Fractal Geometry of Nature, W.H.Freeman and Co., NY, 1977.
4. Chaos and Fractals, R. L. Devaney and Linda Keen, eds., AMS, 1989.
5. G. Strang, Introduction to Applied Mathematics, Wellesley-Cambridge Press, MA, 1986.
6. I. Stewart, Nature's Numbers, BasicBooks, 1995.

About Fractals

• Dot Patterns, Pascal Triangle and Lucas Theorem
• Sierpinski Gasket Via Chaos Game
• The Chaos Game: Address Space vs IFS
• Sierpinski Gasket By Common Trema Removal
• Sierpinski Gasket By Trema Removal
• Sierpinski's Gasket and Dihedral Symmetry
• Collage Theorem And Iterated Function Systems
• Variations on the Theme of (Triangular) Tremas
• Variations on the Theme of (Rectangular) Tremas
• Sierpinski Gasket and Tower of Hanoi
• Fractal Curves and Dimension
• Color Cycling on the Mandelbrot Set
• Iterations and the Mandelbrot Set
• Mandelbrot and Julia sets
• Emergence of Chaos
• Logistic Model

Copyright © 1996-2009 Alexander Bogomolny