Introduction

The interest in fractal geometry initially arose from the observation of self-similar patterns in nature. One of the first mathematicians who referenced the idea of self-similarity was Leibniz in the 17th century. However, the concept of fractals as we understand them now was not developed until two centuries later. We could highlight for instance the work of Georg Cantor on the Cantor set or the contributions of Helge von Koch, who geometrically exemplified the phenomenon with the so called Koch snowflake. The field of fractal geometry kept evolving, with more abstract approaches such as extending the idea to multiple dimensions.[1]

These advances eventually led us to the mathematical object at issue: The Mandelbrot Set, discovered in 1979 by the mathematician Benoit Mandelbrot. Author of the famous paper How Long Is the Coast of Britain? Statistical Self-Similarity and Fractional Dimension[2], he worked as a researcher at IBM and it was thanks to the powerful computers he had at his disposition that he could plot this emblem of mathematics.[3][4]

The Mandelbrot Set

The Mandelbrot set[5] is related to the behaviour of following complex one dimensional map over infinite iterations: \begin{equation} z_{k+1} = z_{k}^2 + c \end{equation} Where $z, c \in \mathbb{C}$ and $z_{0} = 0$. We say that the Mandelbrot Set is the set of points $c \in \mathbb{C}$ that when plugged in Eq. (1), converge as $k \rightarrow \infty$.

Figure 1. The Mandelbrot set. You can select any area of the set and zoom in into that area to observe the self-similarity. Once you have zoomed in you can use the left and right arrow keys to shift between consequtive zooms. The button at the top left resets the map.

Figure 1 represents these $c$-values plotted in a complex plane bounded within $-1.2 \leq Im(c) \leq 1.2$ and $-2.1 \leq Re(c) \leq 0.7$. It is also important to remark what colours mean in this representation. The main light blue area represents the actual points that belong to the set, whereas the gradient of colours from blue to black is given by the number of iterations necessary to reach the escape condition.[6]

Lemma: The escape condition in the Mandelbrot Set is reached when at some point in the iterations the value of $|z_{k}| > 2$ for some $k$.

Proof. We intend to prove that $|z| > 2 \implies |z^2 + c| > |z|$ (i.e. diverges). First suppose that $|z| > 2$ which, invoking the function definition can be rewritten as $|z^2 + c| > 2$. From the triangle inequality[7] we also know that $|z^2 + c| + |c| \geq |z^2|$. Therefore: \begin{align*} |z^2 + c| &\geq |z^2| - |c| && \text{By the triangle inequality.}\\ |z^2 + c| &> 2|z| - |c| && \text{By the assumption that $|z| > 2$.} \tag{*}\\ \end{align*} Now we need to show that $|z| \geq |c|$ which can be obtained by considering the first iterations: \begin{align*} |z_{1}| &= |c|\\ |z_{2}| &= |c^2 + c| = |c||c + 1| > |c|\\ &\vdots \\ |z_{n}| &> |c|\\ \end{align*} At this point it can easily be deduced that $2|z| - |c| \geq |c|$ from the last result because $|z| \geq |c| \implies |z| - |c| \geq 0 \implies 2|z| - |c| \geq |z| \geq |c|$. This statement combined with (*) leads us to $|z^2 + c| > |z|$ q.e.d.[8][9]

Compact set: A set is compact if it's both bounded and closed.[10][11]

Bounded set: A set is bounded if all the points in the set lie within some fixed distance from one another.[12]

Closed set: A set is closed if it is closed under the limit operation.[13][14]

Saying that the Mandelbrot set is restricted to $|z_{k}| \leq 2$ is equivalent to saying that all the elements are contained in the disk of radius 2 around the origin, which implies it's bounded. Furthermore, from the lemma just proven, it is obvious that all the limit points[15][16] lie in the set. So we can conclude that the Mandelbrot set is a compact set.

Finally, we'll demonstrate the relationship between the sequence of real points $c_{k} = a_{k} + 0i$ in the Mandelbrot set and the period-doubling cascade $a_{k}$ of the logistic map.

Logistic map: Recurrence relation of degree 2 of the form $x_{n+1} = rx_{n}(1 - x_{n})$.[17]

The relationship between logistic maps and the Mandelbrot set follows from a redefinition of the variables. We need to allow $x,r \in \mathbb{C}$ and perform the following variable changes: \begin{align*} z_{n} &= r(x_{n} - \frac{1}{2})\\ c &= \frac{1-(r-1)^2}{4} \end{align*} Now, using simple arithmetic we can rewrite the equation: \begin{align*} x_{n+1} &= rx_{n}(1 - x_{n})\\ x_{n+1} &= r(\frac{1}{4} - (x_{n} - \frac{1}{2})^2)\\ &\vdots \\ z_{n+1} &= z_{n}^2 + c \end{align*} At this point, we can intuitively deduce that both are representations of the same phenomenon. Let's consider the following graph, which we'll use to deepen our understanding about this relationship.

Figure 2. Link between the Mandelbrot set and the bifurcations of the Logistic map.

It is important to mention that each graph represents in Figure 1 a different face of the quadratic map. While the Mandelbrot set represents all the points that converge, the logistic bifurcation map gives the actual values of the period-doubling points for every given r. Even though this information is not directly provided by the Mandelbrot set, each cardioid is actually associated to a certain periodicity (as we can see in Figure 3). This fact together with the previous connection found between $r$ and $c$ clarify why every new cardioid found moving along the real axis in the Mandelbrot set represents a period-doubling point.[18][19][20]


Figure 3. Periodicity associated with every cardioid.[20]

References

  1. Wikipedia. Fractal - Wikipedia, The Free Encyclopedia; 2016. [Online; accessed 13-March-2016]. Available from: https://en.wikipedia.org/w/index.php?title=Fractal&oldid=708994405.
  2. Mandelbrot B. How Long Is the Coast of Britain? Statistical Self- Similarity and Fractional Dimension. Science, New Series. May 5, 1967;156(3775):636-638.
  3. YouTube. The Mandelbrot Set! The only video you need to see!; 2013. [Online; accessed 13-March-2016]. Available from: https://www.youtube.com/watch?v=3yE4d7O17wE.
  4. Wikipedia. Benoit Mandelbrot - Wikipedia, The Free Ency- clopedia; 2016. [Online; accessed 13-March-2016]. Avail- able from: https://en.wikipedia.org/w/index.php?title=Benoit_ Mandelbrot&oldid=708173907.
  5. Wikipedia. Mandelbrot set - Wikipedia, The Free Encyclo- pedia; 2016. [Online; accessed 13-March-2016]. Available from: https://en.wikipedia.org/w/index.php?title=Mandelbrot_ set&oldid=705981104.
  6. Peter Alfeld UoU Department of Mathematics. The Mandelbrot Set.; 1998. [Online; accessed 13-March-2016]. Available from: http://www. math.utah.edu/~pa/math/mandelbrot/mandelbrot.html.
  7. Weisstein E. Triangle inequality.;. [Online; accessed 13-March-2016]. From MathWorld–A Wolfram Web Resource. Available from: http://mathworld.wolfram.com/TriangleInequality.html.
  8. The Math Forum @ Drexel. Complex Numbers and the Mandelbrot Set; 1996. [Online; accessed 13-March-2016]. Available from: http://mathforum.org/library/drmath/view/53807.html.
  9. The Math Forum @ Drexel. Z Values in the Mandelbrot Set; 2006. [Online; accessed 13-March-2016]. Available from: http://mathforum.org/library/drmath/view/68518.html.
  10. Wikipedia. Compact space - Wikipedia, The Free Encyclope- dia; 2016. [Online; accessed 13-March-2016]. Available from: https://en.wikipedia.org/w/index.php?title=Compact_space&oldid=700156441.
  11. Kubota KK. Lecture 2: Compact Sets and Continuous Functions; 1999. [Online; accessed 13-March-2016]. Available from: http://www.msc.uky.edu/ken/ma570/lectures/lecture2/html/compact.htm.
  12. Wikipedia. Bounded set - Wikipedia, The Free Encyclope- dia; 2015. [Online; accessed 13-March-2016]. Available from: https://en.wikipedia.org/w/index.php?title=Bounded_set&oldid=682159057.
  13. Wikipedia. Closed set - Wikipedia, The Free Encyclopedia; 2015. [Online; accessed 13-March-2016]. Available from: https://en.wikipedia.org/w/index.php?title=Closed_set&oldid=681209723.
  14. Weisstein E. Closed Set.;. [Online; accessed 13-March-2016]. From MathWorld - A Wolfram Web Resource. Available from: http://mathworld.wolfram.com/ClosedSet.html.
  15. Wikipedia. Limit point - Wikipedia, The Free Encyclope- dia; 2016. [Online; accessed 13-March-2016]. Available from: https://en.wikipedia.org/w/index.php?title=Limit_point&oldid=709120869.
  16. O'Connor J. Limit points and closed sets in metric spaces; 2004. [Online; accessed 13-March-2016]. Available from: http://www-history.mcs.st-and.ac.uk/~john/MT4522/Lectures/L9.html.
  17. Wikipedia. Talk:Logistic map - Wikipedia, The Free Encyclopedia; 2009. [Online; accessed 13-March-2016]. Available from: https://en.wikipedia.org/wiki/Talk%3ALogistic_map.
  18. Murray R. Studying the Logistic Map and the Mandelbrot Set us- ing SOS Methods; 2006. [Online; accessed 13-March-2016]. Avail- able from: https://www.cds.caltech.edu/~murray/wiki/images/9/95/Gayme_mandelbrot-15aug06.pdf.
  19. Lipa C. Chaos and Fractals;. [Online; accessed 13-March- 2016]. Available from: http://www.math.cornell.edu/~lipa/mec/lesson5.html.
  20. Walton C. Fractals: What is the relationship between the Mandelbrot set and applications of the logistic map?; 2013. [Online; accessed 13-March-2016]. Available from: http://bit.ly/1nHyrLj
  21. Wikipedia. File:Mandelbrot Set Periodicities coloured.png; 2005. [Online; accessed 13-March-2016]. Available from: http://bit.ly/1QPQ99Z.