# Iterations and the Mandelbrot Set

In a chapter from *The Beauty of Fractals*, Adrien Douady (who coined the term *Mandelbrot set*) recollects:

... in 1980, whenever I told my friends that I was just starting with J.H. Hubbard a study of polynomials of degree 2 in one complex variable (and more specifically those of the form ^{2} + c),

However, Douady and Hubbard made a major contribution to the understanding of the Mandelbrot set and its role in the Description of dynamics of iterative processes. As the Fundamental Theorem of Algebra clearly indicates, the complex plane rather than the real line is the proper place for the study of polynomials. And, in hindsight, the study of even simple polynomials of degree 2 in the complex plain has thrown a new light on the behavior of more general iterative processes.

Consider the simplest parabola f(x) = x^{2} with x real. Starting with a point x_{0} we form a sequence, x_{0}, x_{1} = f(x_{0}), x_{2} = f(x_{1}), x_{3} = f(x_{2}), and so on, where each consecutive term is obtained by applying the function f to its predecessor. (This is a general definition of an *iterative process* that works for any function f.)

For x_{0} = 1/2 we successively get, x_{1} = 1/4, x_{2} = 1/16, x_{3} = 1/256, ... The terms become smaller and eventually converge to x = 0. The same is, of course, true for any starting point x_{0} that satisfies |x_{0}| < 1. 0 is an attractive fixed point for f(x) = x^{2}. Likewise, for |x_{0}| > 1, the terms grow without bound towards infinity (). Two points satisfy |x_{0}| = 1, x_{0} = ±1. Obviously, f(1) = 1 so that 1 is a *fixed* point of f(x). Also, with x_{0} = -1, x_{k} = 1, for k > 0. There is nothing to be added in the case of the real parameter x.

Consider now the same function in the complex plane: f(z) = z^{2}. z = 0 is still an attractive fixed point to which all iterations converge that start with z_{0}, |z_{0}| < 1. Also, as before, if |z_{0}| > 1, the iterations grow without bound. However, interesting things happen when |z_{0}| = 1. All such points are expressed as e^{it} = cos(t) + i sin(t), where t is the radian measure of the corresponding central angle. When the number is squared, t doubles. Take, for example, z_{0} = e^{2/3}, so that z_{0}^{3} = 1. We have, z_{1} = e^{2*2/3}, z_{2} = e^{4*2/3} = e^{2/3} = z_{0}. The two points z_{0} and z_{1} form a cycle of period 2. With z_{0} = e^{2/5}, z_{1} = e^{2*2/5}, z_{2} = e^{4*2/5}, z_{3} = e^{8*2/5} = e^{3*2/5}, z_{4} = e^{6*2/5} = e^{2/5} = z_{0}, a cycle of period 4. Since modulo 7 doubling of 1 leads to the sequence 1, 2, 4, 8 = 1 (mod 7), starting with z_{0} = e^{2/7} gives rise to a cycle of period 3. All numbers corresponding to a fractional part of the whole circle belong to one cycle or another. In 1975, Li and Yorke proved that once there is a cycle of order 3, there are cycles of any other order. (You may try finding such cycles for a few periods other than 2,3,4. Also there exists another cycle of period 3. Can you find it?)

It is natural to think that the behavior of iterations that start with z_{0} = e^{it}, where t is not a fractional part of 2 is *chaotic* and generate the set dense on the circle. This is not always the case. Look at the number 22^{-n!}. The sum, when shifted a digit at a time (which is equivalent to multplying it by 2) fills in the set with the only accumulation points at 0 and the negative powers of 2.

For a function f, its *filled-in Julia set* K_{f} is defined as the set of starting points z_{0} for which the iterations {z_{k}} remain bounded. The boundary of K_{f} is known as the *Julia set*, J_{f}. The Julia set of f(z) = z^{2} is the unit circle, its filled-in Julia set is the unit disk (the unit circle plus its interior.)

Unexpectedly, a great variety of shapes is obtained by a small variation in the basic function. Mandelbrot began with f_{c}(z) = z^{2} + c. It was proven yet by Julia and Fatou before 1920 that Julia sets are either connected or totally disconnected (something like the Cantor set, where, for any two points, it is possible to find two subsets both open and closed in the set, each containing only one of the points.) For f_{c}, the usual notation for the Julia set is (a simplified) J_{c}. In 1980, Mandelbrot has discovered the set M of parameter values c for which Julia sets are connected. This set that now bears his name may also be defined as the set of c's for which iterations {z_{k}} starting with z_{0} = 0 remain bounded. This is due to another theorem of Julia and Fatou that links *critical points* (points where the derivative of the function vanishes) of a function with the behavior of iterations. The only critical point of f_{c} is z = 0. This is why the point 0 appears in the definition of the Mandelbrot set.

The main purpose of the Mandelbrot set is to index Julia sets corresponding to various values of the parameter c. When c belongs to the Mandelbrot set, J_{c} is connected. For c outside M, J_{c} is totally disconnected and known as the *fractal dust*. Both M and J_{c} are visualized with a simple algorithm that assigns a color value to a pixel depending on how fast it was found out whether iterations for that pixel escape to infinity. Since for c inside M, the iterations remain bounded, pixels corresponding to the Mandelbrot set consume the greatest amount of the computational time.

What if applet does not run? |

However, iterations inside M evolve differently depending on the value of c. (Behavior of the iterations is related to the appearance of the Julia sets J_{c}.) For example, for c inside the big cardioid, the iterations converge. For c inside the big circle to the left of the cardioid, the iterations converge to a cycle of period 2. For c inside each wart attached to the cardioid, the iterations converge to a periodic cycle whose period is determined by the corresponding wart. The applet helps you visualize the behavior of the iterates. To select c, click inside the applet. Press the "Iterate" button to see the progress of the iterative process.

The wart that contains the point (-0.1, .75) results in 3-cycles. The point (-0.1, 0.85) that belongs to a smaller wart attached to the previous one, leads to a 6-cycle, very much as in the period doubling we observed for real-valued iterations. For c = (-0.735, 0.165) the iterations converge rather slowly in a delightfully chaotic manner. Starting with c = (-0.5, 0.575), the program draws a nice 5-star. (If the image of the Mandelbrot set disappears, for example, after scrolling the page, click the "Clear" button to bring it back.

### References

*Chaos and Fractals*, R.L.Devaney and Linda Keen, eds., AMS, 1989.- G.Chang and T.W.Sederberg,
*Over And Over Again*, MAA, 1997 - D.Davis,
*The Nature and Power of Mathematics*, Princeton University Press, 1993 - T.Y.Li and J.A.Yorke, "Period Three Implies Chaos",
*Amer. Math. Monthly*,**82**, 985-992. - B.Mandelbrot,
*The Fractal Geometry of Nature*, W.H.Freeman and Co., NY, 1977. - H.-O.Peitgen, P.H.Richter,
*The Beauty of Fractals*, Springer-Verlag, 1986 *The Science of Fractal Images*, H.-O.Peitgen, D.Saupe, eds., Springer-Verlag, 1988

### 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
- Weird curves bound normal areas
- Exercise with Square Spiral

|Contact| |Front page| |Contents| |Did you know?| |Geometry|

Copyright © 1996-2018 Alexander Bogomolny

70194288