The Mandelbrot set is one of the best-known examples of mathematical visualization, beauty, and motif. It has become popular for its aesthetic appeal and as an example of a complex structure arising from the application of simple rules.

**The Mandelbrot** set is a set of complex numbers {\displaystyle c}which is used as a function{\displaystyle f_{c}(z)=z^{2}+c}does not deviate when iterating from{\displaystyle z=0}, that is, the order from{\displaystyle f_{c}(0)}, {\displaystyle f_{c}(f_{c}(0))}, etc., are still limited in absolute value.

Its definition is credited to Adrien Douady who named it in honor of the mathematician Benoit Mandelbrot . ^{[1]} The set is connected to a Julia set , and the associated Julia sets produce similarly complex fractal shapes.

Figure Mandelbrot sets can be generated by sampling complex numbers and testing, for each sample point{\displaystyle c}, is the order dark{\displaystyle f_{c}(0),f_{c}(f_{c}(0)),\dotsc } go to infinity (in practice does it leave some neighborhood predefined value of 0 after a predefined number of iterations). If the real number and the imaginary part of{\displaystyle c}as image coordinates on the complex plane , pixels can then be colored according to how fast the sequence is from{\displaystyle |f_{c}(0)|,|f_{c}(f_{c}(0))|,\dotsc }crosses an arbitrarily chosen threshold, with a special color (black) used for values{\displaystyle c}whose sequence has not crossed a threshold after a predetermined number of iterations (this is necessary to clearly distinguish Mandelbrot set images from complementary images). When{\displaystyle c}is held constant and the initial value is the value{\displaystyle z}notated with{\displaystyle z_{0))instead, it gets the set value Julia for each point{\displaystyle c}in the space parameter of the function.

Images from the Mandelbrot set show complex and very complicated boundaries that reveal increasingly finer recursive detail at increasing magnification. In other words, the boundaries of the Mandelbrot set are *fractal curves* . The "style" of these repeating details depends on the region of the set being examined. Set boundaries also incorporate smaller versions of the main shape, so that the fractal property of self-similarity holds for the entire set, and not just for its parts.

Mandelbrot sets have become popular outside of mathematics both for their aesthetic appeal and as examples of complex structures arising from the application of simple rules. This is one of the most famous examples of visualizing mathematics and the beauty of mathematics .

## History

Mandelbrot sets have their origins in complex dynamics , a field first investigated by French mathematicians Pierre Fatou and Gaston Julia in the early 20th century. The fractal was first defined and drawn in 1978 by Robert W. Brooks and Peter Matelski as part of a Kleinian group study .. ^{[2]} On March 1, 1980, at the IBM Thomas J. Watson Research Center in Yorktown Heights , New York , Benoit Mandelbrot first saw visualization. ^{[3]}

Mandelbrot studied the parameter space of quadratic polynomials in an article appearing in 1980. ^{[4]} The mathematical study of Mandelbrot sets really began with the work of mathematicians Adrien Douady and John H. Hubbard (1985), ^{[1]} who established many of their fundamental properties and named the set in honor of Mandelbrot for his influential work on fractal geometry .

Mathematicians Heinz-Otto Peitgen and Peter Richter became known for promoting the set with photographs, a book (1986), ^{[5]} and an exhibition touring the international Goethe-Institut Germany (1985). ^{[6] }^{[7]}

A cover article in the August 1985 *Scientific American* introduced a wide audience to the algorithm for calculating the Mandelbrot set. The cover features an image located at −0.909 + −0.275 *i* and created by Peitgen et al. ^{[8] }^{[9]} Mandelbrot sets became popular in the mid-1980s as computer graphics demos , when personal computers became powerful enough to plot and display sets in high resolution. ^{[10]}

The work of Douady and Hubbard coincides with a major increase in interest in complex dynamics and abstract mathematics , and the study of Mandelbrot sets has become a centerpiece of this field. The full list of everyone who has contributed to the understanding of the set since then is long but would include Mikhail Lyubich , ^{[11] }^{[12]} Curt McMullen , John Milnor , Mitsuhiro Shishikura and Jean-Christophe Yoccoz .

## Formal Definition

The Mandelbrot set is the set of *c* values in the complex plane whose orbit of the critical value z = 0 under the Quadratic Iteratal

- {\displaystyle z_{n+1}=z_{n}^{2}+c}

remain restricted . ^{[13]} Thus, a complex number *c* is a member of the Mandelbrot set if, when starting with *z *_{0} = 0 and applying iteration repeatedly, the absolute value of *z *_{n} remains bound for all *n* > 0.

For example, for *c* = 1, the order is 0, 1, 2, 5, 26, ..., which tends to infinity , so 1 is not an element of the Mandelbrot set. On the other hand, for *c* =−1, the order is 0, −1, 0, −1, 0, ..., which is restricted, so −1 is indeed included in the set.

*M*. Point

*c*is colored black if it is included in the set, and white if it is not. Re [

*c*] and Im [

*c*] show the real and imaginary parts of

*c*.

The Mandelbrot set can also be defined as the locus of connectedness of a family of polynomials

## Graphical representation

The graphical representation of the Mandelbrot set and its structure in the edge area is only possible on a computer using so-called fractal generators . Each pixel corresponds to a value{\displaystyle c}complex field. For each pixel, the computer determines whether the associated sequence is diverging or not. That's the amount{\displaystyle |z_{n}|}eines Members in order of value{\displaystyle s=2}exceed, it is clear that the results are diverging. Number{\displaystyle n}the iteration step up to that point can serve as a measure of the degree of divergence. Pixels are assigned a color according to a predefined color table that corresponds to each value{\displaystyle n}give color.

In order to achieve a harmonious boundary between successive colors from an aesthetic point of view, the boundary is used in practice{\displaystyle s}not the smallest possible value{\displaystyle s=2}selected, but the value is significantly greater than{\displaystyle 2}, otherwise the color bar width will oscillate. The larger this value is chosen, the better the color boundaries correspond to the equipotential lines , which result when the Mandelbrot set is interpreted as electrically charged conductors . For continuous color gradients, As in the zoom series above, factor evaluation is required where{\displaystyle s}is exceeded when its value is exceeded the first time.

Due to the number of iteration steps{\displaystyle n}, after that the limit{\displaystyle s}exceeded, can be of any size, a stopping criterion in the form of the maximum number of iteration steps must be specified. Score{\displaystyle c}, the consequences of which have not yet exceeded the limit{\displaystyle s}afterwards be{\displaystyle \mathbb {M} }expected. The smaller the distance{\displaystyle c}to{\displaystyle \mathbb {M} }is, the bigger the number{\displaystyle n}usually after{\displaystyle s}exceeded. The greater the edge magnification{\displaystyle \mathbb {M} }displayed, the greater the maximum number of iteration steps that must be selected, and the more computation time is required. It can be seen that the order of the initial values{\displaystyle c}converge, the computation of the sequence can be terminated earlier.

The graphical representation of edges is very attractive{\displaystyle \mathbb {M} }with a wealth of forms. The greater the magnification selected, the more complex structures can be found there. With a suitable computer program , these edges can be displayed as on a microscope at any magnification. The only two artistic liberties that exist are the selection of image parts and the assignment of colors at divergence levels.

Zooming in is often necessary to examine desired structures, which cannot be computed with hardware-supported data types because of their limited accuracy. Therefore, some programs contain an arithmetic long number data type with arbitrarily selectable precision. This means that (almost) any zoom factor is possible.

## Basic properties

The Mandelbrot set is a compact set , because it is closed and contained in a closed disk with radius 2 around the origin . More specifically, one point{\displaystyle c}is included in the Mandelbrot group if and only if

- {\displaystyle |P_{c}^{n}(0)|\leq 2}for all{\displaystyle n\geq 0.}

In other words, the absolute value of{\displaystyle P_{c}^{n}(0)}must stay at or below 2 for{\displaystyle c}is in the Mandelbrot set, as if that absolute value exceeded 2, the sequence would pass to infinity.

intersection of{\displaystyle M}with the exact real axis being the interval [−2, 1/4]. Parameters along this interval can be entered into a one-to-one correspondence with those in the actual logistic family ,

- {\displaystyle x_{n+1}=rx_{n}(1-x_{n}),\quad r\in [1,4].}

Correspondence provided by

- {\displaystyle z=r\left({\frac {1}{2}}-x\right),\quad c={\frac {r}{2}}\left(1-{\frac {r}{2}}\right).}

In fact, it provides a correspondence between the entire parameter space of the logistic family and that of the Mandelbrot set.

Douady and Hubbard have shown that the Mandelbrot set is connected . In fact, they construct a conformal isomorphism between the complement of the Mandelbrot set and the complement of the closed unit disk . Mandelbrot initially suspected that the Mandelbrot set was disconnected . This guess is based on a program-generated computer image that can't detect the thin filaments connecting the various parts{\displaystyle M}. After further experimentation, he revised his conjecture, deciding that{\displaystyle M}must be connected. There is also a topological proof for connectedness discovered in 2001 by Jeremy Kahn . ^{[14]}

The dynamic formula for the uniformity of the complement of the Mandelbrot set, which arises from Douady and Hubbard's proof of relatedness{\displaystyle M}, giving rise to the external rays of the Mandelbrot set. These rays can be used to study Mandelbrot sets in combinatorial terms and form the backbone of Jean-Christophe Yoccoz's #Mathematics work . ^{[15]}

the limit of the Mandelbrot set is exactly the branching locus of the quadratic family; that is, a parameter set{\displaystyle c}where dynamics change abruptly under small changes{\displaystyle c.}It can be constructed as a bounded set of plane sequence algebraic curves , which are *Mandelbrot curves* , of the general type known as polynomial lemniskats . The Mandelbrot curve is defined by setting *p *_{0} = *z* , *p *_{n +1} = *p *_{n}^{ 2} + *z* , and then interpreting the set of points | *p *_{n} ( *z* ) | = 2 in the complex plane as a curve in the Cartesian plane of degree 2 ^{n +1} in *x* and *y*. This algebraic curve appears in a Mandelbrot drawing set calculated using the "escape time algorithm" mentioned below.

## Number string behavior

Various structural elements{\displaystyle \mathbb {M} }closely related to the particular behavior of the sequence of numbers, that is{\displaystyle \mathbb {M} }the underlying. Depends on the value{\displaystyle c}, there are four possibilities:

- When the values converge to a fixed point.
- When converging with a periodic limit cycle consisting of two or more values. It also covers cases where sequences behave periodically from the start.
- Because this is never repeated, but still limited. Some values exhibit chaotic behavior with alternation between nearly periodic boundary cycles and random behavior.
- Primarily deviating towards infinity ( certain divergence ).

All{\displaystyle c}*uncertain* values are held differently{\displaystyle \mathbb {M} }.

The following table shows examples of the four value iteration limit behaviors{\displaystyle z_{n+1}=z_{n}^{2}+c}from{\displaystyle z_{0}=0}:

Parameter | Score{\displaystyle z_{2},z_{3},z_{4},z_{5},\ldots } | Fixed point |
---|---|---|

Real axis value... |
||

{\displaystyle c=-3} | {\displaystyle 6,\,33,\,1086,\,1179393,\,\dotsc } | A certain value difference{\displaystyle +\infty } |

{\displaystyle c=-2} | {\displaystyle 2,\,2,\,2,\,2,\,\dotsc } | Convergence remains towards the point of continuity{\displaystyle 2} |

{\displaystyle c=-1{,}75} | {\displaystyle {\tfrac {21}{16}},\,-{\tfrac {7}{256}},\,-{\tfrac {114639}{65536}},\,\dotsc } | Fixed convergence to a three-sequence cycle{\displaystyle -1{,}74697\ldots ,\,1{,}30193\ldots ,\,-0{,}54958\ldots } |

{\displaystyle c=-1{,}5} | {\displaystyle {\tfrac {3}{4}},\,-{\tfrac {15}{16}},\,-{\tfrac {159}{256}},\,-{\tfrac {73023}{65536}},\,\dotsc } | Chaotic behavior |

{\displaystyle c=-1{,}4} | {\displaystyle 0{,}56,\,-1{,}0864,\,-0{,}21973504,\,\dotsc } | Convergence remains 32 to limit cycles |

{\displaystyle c=-1{,}25} | {\displaystyle {\tfrac {5}{16}},\,-{\tfrac {295}{256}},\,{\tfrac {5105}{65536}},\,\dotsc } | Convergence to alternating sequence cycles{\displaystyle -1{,}20710\ldots ,\,0{,}20710\ldots } |

{\displaystyle c=-1} | {\displaystyle -1,\,0,\,-1,\,0,\,-1,\,0,\,\dotsc } | Instant convergence doesn't keep the alternating sequence cycles{\displaystyle -1,\,0} |

{\displaystyle c=-0{,}75} | {\displaystyle -{\tfrac {3}{16}},\,-{\tfrac {183}{256}},\,-{\tfrac {15663}{65536}},\,\dotsc } | Convergence is somewhat fixed towards a certain point{\displaystyle -{\tfrac {1}{2}}} |

{\displaystyle c=-0{,}5} | {\displaystyle -{\tfrac {1}{4}},\,-{\tfrac {7}{16}},\,-{\tfrac {79}{256}},\,-{\tfrac {26527}{65536}},\,\dotsc } | Fixed point convergence{\displaystyle {\tfrac {1}{2}}-{\sqrt {\tfrac {3}{4}}}} |

{\displaystyle c=-0{,}25} | {\displaystyle -{\tfrac {3}{16}},\,-{\tfrac {55}{256}},\,-{\tfrac {13359}{65536}},\,\dotsc } | Convergence fixed point value{\displaystyle {\tfrac {1}{2}}-{\sqrt {\tfrac {1}{2}}}} |

{\displaystyle c=0} | {\displaystyle 0,\,0,\,0,\,0,\,0,\,0,\,\dotsc } | Convergence against a fixed point{\displaystyle 0} |

{\displaystyle c=+0{,}25} | {\displaystyle {\tfrac {5}{16}},\,{\tfrac {89}{256}},\,{\tfrac {24305}{65536}},\,\dotsc } | Convergence towards a fixed point{\displaystyle {\tfrac {1}{2}}} |

{\displaystyle c=+1} | {\displaystyle 2,\,5,\,26,\,677,\,458330,\,\dotsc } | Certain differences at fixed values{\displaystyle +\infty } |

In the field of complex numbers... |
||

{\displaystyle c=-i} | {\displaystyle -1-i,\,i,\,-1-i,\,i,\,\dotsc } | Instant convergence against alternating boundary cycles{\displaystyle -1-i,\,i} |

{\displaystyle c=-{\tfrac {1}{8}}+{\tfrac {3}{4}}i} | {\displaystyle -{\tfrac {43}{64}}+{\tfrac {9}{16}}i} | Convergence towards a triple limit cycle |

## Geometric scoring

Convergence occurs precisely for values{\displaystyle c}that compose the interior of the cardioid , the "body" of{\displaystyle \mathbb {M} }, as well as for their innumerable many boundary points. Periodic boundary cycles can be found at (more or less) "stubs" of circular values as in "heads", in satellite cardioids as well as at many edge points of this component. A fundamental conjecture says that there is a limit cycle for all points in the Mandelbrot set. The sequence is strictly pre-periodic for innumerable parameters, which is often called the Misiurewicz-Thurston point (after Michał Misiurewicz and William Thurston ). This includes the dot-like "antenna tip".{\displaystyle z=-2}the far left and the branch point of the Mandelbrot set.

In the innumerable other points of the Mandelbrot set, sequences can behave in a variety of ways, each of which results in a very different dynamical system and some are the subject of intensive research. Je according to the definition of the word, "chaotic" behavior can be found.