Mandelbrot set

The Mandelbrot set (/ˈmændəlbroʊt, -brɒt/) is a two-dimensional set which is very popular, even outside mathematics, due to how, despite having a relatively simple definition, it exhibits complex fractal structures when visualized and magnified. The set is defined in the complex plane as the complex numbers c {\displaystyle c} for which the function f c ( z ) = z 2 + c {\displaystyle f_{c}(z)=z^{2}+c} does not diverge to infinity when iterated starting at z = 0 {\displaystyle z=0} , i.e., for which the sequence f c ( 0 ) {\displaystyle f_{c}(0)} , f c ( f c ( 0 ) ) {\displaystyle f_{c}(f_{c}(0))} , etc., remains bounded in absolute value.
This set was first defined and drawn by Robert W. Brooks and Peter Matelski in 1978, as part of a study of Kleinian groups. Afterwards, in 1980, Benoit Mandelbrot obtained high-quality visualizations of the set while working at IBM's Thomas J. Watson Research Center in Yorktown Heights, New York.
Images of the Mandelbrot set exhibit an infinitely complicated boundary that reveals progressively ever-finer recursive detail at increasing magnifications; mathematically, the boundary of the Mandelbrot set is a fractal curve. The "style" of this recursive detail depends on the region of the set boundary being examined. Mandelbrot set images may be created by sampling the complex numbers and testing, for each sample point c {\displaystyle c} , whether the sequence f c ( 0 ) , f c ( f c ( 0 ) ) , … {\displaystyle f_{c}(0),f_{c}(f_{c}(0)),\dotsc } goes to infinity. Treating the real and imaginary parts of c {\displaystyle c} as image coordinates on the complex plane, pixels may then be colored according to how soon the sequence | f c ( 0 ) | , | f c ( f c ( 0 ) ) | , … {\displaystyle |f_{c}(0)|,|f_{c}(f_{c}(0))|,\dotsc } crosses an arbitrarily chosen threshold (the threshold must be at least 2, as −2 is the complex number with the largest magnitude within the set, but otherwise the threshold is arbitrary). If c {\displaystyle c} is held constant and the initial value of z {\displaystyle z} is varied instead, the corresponding Julia set for the point c {\displaystyle c} is obtained.
The Mandelbrot set has its origin in complex dynamics, a field first investigated by the French mathematicians Pierre Fatou and Gaston Julia at the beginning of the 20th century. The fractal was first defined and drawn in 1978 by Robert W. Brooks and Peter Matelski as part of a study of Kleinian groups. On 1 March 1980, at IBM's Thomas J. Watson Research Center in Yorktown Heights, New York, Benoit Mandelbrot first visualized the set.
Mandelbrot studied the parameter space of quadratic polynomials in an article that appeared in 1980. The mathematical study of the Mandelbrot set really began with work by the mathematicians Adrien Douady and John H. Hubbard (1985), who established many of its fundamental properties and named the set in honor of Mandelbrot for his influential work in fractal geometry.
The mathematicians Heinz-Otto Peitgen and Peter Richter became well known for promoting the set with photographs, books (1986), and an internationally touring exhibit of the German Goethe-Institut (1985).
The cover article of the August 1985 Scientific American introduced the algorithm for computing the Mandelbrot set. The cover was created by Peitgen, Richter and Saupe at the University of Bremen. The Mandelbrot set became prominent in the mid-1980s as a computer-graphics demo, when personal computers became powerful enough to plot and display the set in high resolution.
The work of Douady and Hubbard occurred during an increase in interest in complex dynamics and abstract mathematics, and the topological and geometric study of the Mandelbrot set remains a key topic in the field of complex dynamics.
The Mandelbrot set is the uncountable set of values of c in the complex plane for which the orbit of the critical point z = 0 {\textstyle z=0} under iteration of the quadratic map
remains bounded. Thus, a complex number c is a member of the Mandelbrot set if, when starting with z 0 = 0 {\displaystyle z_{0}=0} and applying the iteration repeatedly, the absolute value of z n {\displaystyle z_{n}} remains bounded for all n > 0 {\displaystyle n>0} .
For example, for c = 1, the sequence 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 {\displaystyle c=-1} , the sequence is 0, −1, 0, −1, 0, ..., which is bounded, so −1 does belong to the set.
The Mandelbrot set can also be defined as the connectedness locus of the family of quadratic polynomials f ( z ) = z 2 + c {\displaystyle f(z)=z^{2}+c} , the subset of the space of parameters c {\displaystyle c} for which the Julia set of the corresponding polynomial forms a connected set. In the same way, the boundary of the Mandelbrot set can be defined as the bifurcation locus of this quadratic family, the subset of parameters near which the dynamic behavior of the polynomial (when it is iterated repeatedly) changes drastically.
The Mandelbrot set is a compact set, since it is closed and contained in the closed disk of radius 2 centred on zero. A point c {\displaystyle c} belongs to the Mandelbrot set if and only if | z n | ≤ 2 {\displaystyle |z_{n}|\leq 2} for all n ≥ 0 {\displaystyle n\geq 0} . In other words, the absolute value of z n {\displaystyle z_{n}} must remain at or below 2 for c {\displaystyle c} to be in the Mandelbrot set, M {\displaystyle M} , and if that absolute value exceeds 2, the sequence will escape to infinity. Since c = z 1 {\displaystyle c=z_{1}} , it follows that | c | ≤ 2 {\displaystyle |c|\leq 2} , establishing that c {\displaystyle c} will always be in the closed disk of radius 2 around the origin.
The intersection of M {\displaystyle M} with the real axis is the interval [ − 2 , 1 4 ] {\displaystyle \left[-2,{\frac {1}{4}}\right]} . The parameters along this interval can be put in one-to-one correspondence with those of the real logistic family,
The correspondence is given by
This gives a correspondence between the entire parameter space of the logistic family and that of the Mandelbrot set.
Douady and Hubbard showed that the Mandelbrot set is connected. They constructed an explicit conformal isomorphism between the complement of the Mandelbrot set and the complement of the closed unit disk. Mandelbrot had originally conjectured that the Mandelbrot set is disconnected. This conjecture was based on computer pictures generated by programs that are unable to detect the thin filaments connecting different parts of M {\displaystyle M} . Upon further experiments, he revised his conjecture, deciding that M {\displaystyle M} should be connected. A topological proof of the connectedness was discovered in 2001 by Jeremy Kahn.
The dynamical formula for the uniformisation of the complement of the Mandelbrot set, arising from Douady and Hubbard's proof of the connectedness of M {\displaystyle M} , gives rise to external rays of the Mandelbrot set. These rays can be used to study the Mandelbrot set in combinatorial terms and form the backbone of the Yoccoz parapuzzle.
The boundary of the Mandelbrot set is the bifurcation locus of the family of quadratic polynomials. In other words, the boundary of the Mandelbrot set is the set of all parameters c {\displaystyle c} for which the dynamics of the quadratic map z n = z n − 1 2 + c {\displaystyle z_{n}=z_{n-1}^{2}+c} exhibits sensitive dependence on c , {\displaystyle c,} i.e. changes abruptly under arbitrarily small changes of c . {\displaystyle c.} It can be constructed as the limit set of a sequence of plane algebraic curves, the Mandelbrot curves, of the general type known as polynomial lemniscates. The Mandelbrot curves are defined by setting p 0 = z , p n + 1 = p n 2 + z {\displaystyle p_{0}=z,\ p_{n+1}=p_{n}^{2}+z} , and then interpreting the set of points | p n ( z ) | = 2 {\displaystyle |p_{n}(z)|=2} in the complex plane as a curve in the real Cartesian plane of degree 2 n + 1 {\displaystyle 2^{n+1}} in x and y. Each curve n > 0 {\displaystyle n>0} is the mapping of an initial circle of radius 2 under p n {\displaystyle p_{n}} . These algebraic curves appear in images of the Mandelbrot set computed using the "escape time algorithm" mentioned below.
The main cardioid is the period 1 continent. It is the region of parameters c {\displaystyle c} for which the map f c ( z ) = z 2 + c {\displaystyle f_{c}(z)=z^{2}+c} has an attracting fixed point. It consists of all parameters of the form c ( μ ) := μ 2 ( 1 − μ 2 ) {\displaystyle c(\mu ):={\frac {\mu }{2}}\left(1-{\frac {\mu }{2}}\right)} for some μ {\displaystyle \mu } in the open unit disk.
To the left of the main cardioid, attached to it at the point c = − 3 / 4 {\displaystyle c=-3/4} , a circular bulb, the period-2 bulb is visible. The bulb consists of c {\displaystyle c} for which f c {\displaystyle f_{c}} has an attracting cycle of period 2. It is the filled circle of radius 1/4 centered around −1.
More generally, for every positive integer q > 2 {\displaystyle q>2} , there are ϕ ( q ) {\displaystyle \phi (q)} circular bulbs tangent to the main cardioid called period-q bulbs (where ϕ {\displaystyle \phi } denotes the Euler phi function), which consist of parameters c {\displaystyle c} for which f c {\displaystyle f_{c}} has an attracting cycle of period q {\displaystyle q} . More specifically, for each primitive q {\displaystyle q} th root of unity r = e 2 π i p q {\displaystyle r=e^{2\pi i{\frac {p}{q}}}} (where 0 < p q < 1 {\displaystyle 0<{\frac {p}{q}}<1} ), there is one period-q bulb called the p q {\displaystyle {\frac {p}{q}}} bulb, which is tangent to the main cardioid at the parameter c p q := c ( r ) = r 2 ( 1 − r 2 ) , {\displaystyle c_{\frac {p}{q}}:=c(r)={\frac {r}{2}}\left(1-{\frac {r}{2}}\right),} and which contains parameters with q {\displaystyle q} -cycles having combinatorial rotation number p q {\displaystyle {\frac {p}{q}}} . More precisely, the q {\displaystyle q} periodic Fatou components containing the attracting cycle all touch at a common point (commonly called the α {\displaystyle \alpha } -fixed point). If we label these components U 0 , … , U q − 1 {\displaystyle U_{0},\dots ,U_{q-1}} in counterclockwise orientation, then f c {\displaystyle f_{c}} maps the component U j {\displaystyle U_{j}} to the component U j + p ( mod ⁡ q ) {\displaystyle U_{j+p\,(\operatorname {mod} q)}} .
The change of behavior occurring at c p q {\displaystyle c_{\frac {p}{q}}} is known as a bifurcation: the attracting fixed point "collides" with a repelling period-q cycle. As we pass through the bifurcation parameter into the p q {\displaystyle {\tfrac {p}{q}}} -bulb, the attracting fixed point turns into a repelling fixed point (the α {\displaystyle \alpha } -fixed point), and the period-q cycle becomes attracting.
Bulbs that are interior components of the Mandelbrot set in which the maps f c {\displaystyle f_{c}} have an attracting periodic cycle are called hyperbolic components.
It is conjectured that these are the only interior regions of M {\displaystyle M} and that they are dense in M {\displaystyle M} . This problem, known as density of hyperbolicity, is one of the most important open problems in complex dynamics. Hypothetical non-hyperbolic components of the Mandelbrot set are often referred to as "queer" or ghost components. For real quadratic polynomials, this question was proved in the 1990s independently by Lyubich and by Graczyk and Świątek. (Note that hyperbolic components intersecting the real axis correspond exactly to periodic windows in the Feigenbaum diagram. So this result states that such windows exist near every parameter in the diagram.)
Not every hyperbolic component can be reached by a sequence of direct bifurcations from the main cardioid of the Mandelbrot set. Such a component can be reached by a sequence of direct bifurcations from the main cardioid of a little Mandelbrot copy (see below).
Each of the hyperbolic components has a center, which is a point c such that the inner Fatou domain for f c ( z ) {\displaystyle f_{c}(z)} has a super-attracting cycle—that is, that the attraction is infinite. This means that the cycle contains the critical point 0, so that 0 is iterated back to itself after some iterations. Therefore, f c n ( 0 ) = 0 {\displaystyle f_{c}^{n}(0)=0} for some n. If we call this polynomial Q n ( c ) {\displaystyle Q^{n}(c)} (letting it depend on c instead of z), we have that Q n + 1 ( c ) = Q n ( c ) 2 + c {\displaystyle Q^{n+1}(c)=Q^{n}(c)^{2}+c} and that the degree of Q n ( c ) {\displaystyle Q^{n}(c)} is 2 n − 1 {\displaystyle 2^{n-1}} . Therefore, constructing the centers of the hyperbolic components is possible by successively solving the equations Q n ( c ) = 0 , n = 1 , 2 , 3 , . . . {\displaystyle Q^{n}(c)=0,n=1,2,3,...} . The number of new centers produced in each step is given by Sloane's OEIS: A000740.
It is conjectured that the Mandelbrot set is locally connected. This conjecture is known as MLC (for Mandelbrot locally connected). By the work of Adrien Douady and John H. Hubbard, this conjecture would result in a simple abstract "pinched disk" model of the Mandelbrot set. In particular, it would imply the important hyperbolicity conjecture mentioned above.
The work of Jean-Christophe Yoccoz established local connectivity of the Mandelbrot set at all finitely renormalizable parameters; that is, roughly speaking those contained only in finitely many small Mandelbrot copies. Since then, local connectivity has been proved at many other points of M {\displaystyle M} , but the full conjecture is still open.
The Mandelbrot set is self-similar under magnification in the neighborhoods of the Misiurewicz points. It is also conjectured to be self-similar around generalized Feigenbaum points (e.g., −1.401155 or −0.1528 + 1.0397i), in the sense of converging to a limit set. The Mandelbrot set in general is quasi-self-similar, as small slightly different versions of itself can be found at arbitrarily small scales. These copies of the Mandelbrot set are all slightly different, mostly because of the thin threads connecting them to the main body of the set.
The Hausdorff dimension of the boundary of the Mandelbrot set equals 2 as determined by a result of Mitsuhiro Shishikura. The fact that this is greater by a whole integer than its topological dimension, which is 1, reflects the extreme fractal nature of the Mandelbrot set boundary. Roughly speaking, Shishikura's result states that the Mandelbrot set boundary is so "wiggly" that it locally fills space as efficiently as a two-dimensional planar region. Curves with Hausdorff dimension 2, despite being (topologically) 1-dimensional, are oftentimes capable of having nonzero area (more formally, a nonzero planar Lebesgue measure). Whether this is the case for the Mandelbrot set boundary is an unsolved problem.
It has been shown that the generalized Mandelbrot set in higher-dimensional hypercomplex number spaces (i.e. when the power α {\displaystyle \alpha } of the iterated variable z {\displaystyle z} tends to infinity) is convergent to the unit ( α {\displaystyle \alpha } -1)-sphere.
In the Blum–Shub–Smale model of real computation, the Mandelbrot set is not computable, but its complement is computably enumerable. Many simple objects (e.g., the graph of exponentiation) are also not computable in the BSS model. At present, it is unknown whether the Mandelbrot set is computable in models of real computation based on computable analysis, which correspond more closely to the intuitive notion of "plotting the set by a computer". Hertling has shown that the Mandelbrot set is computable in this model if the hyperbolicity conjecture is true.
As a consequence of the definition of the Mandelbrot set, there is a close correspondence between the geometry of the Mandelbrot set at a given point and the structure of the corresponding Julia set. For instance, a value of c belongs to the Mandelbrot set if and only if the corresponding Julia set is connected. Thus, the Mandelbrot set may be seen as a map of the connected Julia sets.
This principle is exploited in virtually all deep results on the Mandelbrot set. For example, Shishikura proved that, for a dense set of parameters in the boundary of the Mandelbrot set, the Julia set has Hausdorff dimension two, and then transfers this information to the parameter plane. Similarly, Yoccoz first proved the local connectivity of Julia sets, before establishing it for the Mandelbrot set at the corresponding parameters.
For every rational number p q {\displaystyle {\tfrac {p}{q}}} , where p and q are coprime, a hyperbolic component of period q bifurcates from the main cardioid at a point on the edge of the cardioid corresponding to an internal angle of 2 π p q {\displaystyle {\tfrac {2\pi p}{q}}} . The part of the Mandelbrot set connected to the main cardioid at this bifurcation point is called the p/q-limb. Computer experiments suggest that the diameter of the limb tends to zero like 1 q 2 {\displaystyle {\tfrac {1}{q^{2}}}} . The best current estimate known is the Yoccoz-inequality, which states that the size tends to zero like 1 q {\displaystyle {\tfrac {1}{q}}} .
A period-q limb will have q − 1 {\displaystyle q-1} "antennae" at the top of its limb. The period of a given bulb is determined by counting these antennas. The numerator of the rotation number, p, is found by numbering each antenna counterclockwise from the limb from 1 to q − 1 {\displaystyle q-1} and finding which antenna is the shortest.
In an attempt to demonstrate that the thickness of the p/q-limb is zero, David Boll carried out a computer experiment in 1991, where he computed the number of iterations required for the series to diverge for z = − 3 4 + i ε {\displaystyle z=-{\tfrac {3}{4}}+i\varepsilon } ( − 3 4 {\displaystyle -{\tfrac {3}{4}}} being the location thereof). As the series does not diverge for the exact value of z = − 3 4 {\displaystyle z=-{\tfrac {3}{4}}} , the number of iterations required increases with a small ε {\displaystyle \varepsilon } . It turns out that multiplying the value of ε {\displaystyle \varepsilon } with the number of iterations required yields an approximation of π {\displaystyle \pi } that becomes better for smaller ε {\displaystyle \varepsilon } . For example, for ε {\displaystyle \varepsilon } = 0.0000001, the number of iterations is 31415928 and the product is 3.1415928. In 2001, Aaron Klebanoff proved Boll's discovery.
The Mandelbrot Set features a fundamental cardioid shape adorned with numerous bulbs directly attached to it. Understanding the arrangement of these bulbs requires a detailed examination of the Mandelbrot Set's boundary. As one zooms into specific portions with a geometric perspective, precise deducible information about the location within the boundary and the corresponding dynamical behavior for parameters drawn from associated bulbs emerges.
The iteration of the quadratic polynomial f c ( z ) = z 2 + c {\displaystyle f_{c}(z)=z^{2}+c} , where c {\displaystyle c} is a parameter drawn from one of the bulbs attached to the main cardioid within the Mandelbrot Set, gives rise to maps featuring attracting cycles of a specified period q {\displaystyle q} and a rotation number p / q {\displaystyle p/q} . In this context, the attracting cycle of exhibits rotational motion around a central fixed point, completing an average of p / q {\displaystyle p/q} revolutions at each iteration.
The bulbs within the Mandelbrot Set are distinguishable by both their attracting cycles and the geometric features of their structure. Each bulb is characterized by an antenna attached to it, emanating from a junction point and displaying a certain number of spokes indicative of its period. For instance, the 2 / 5 {\displaystyle 2/5} bulb is identified by its attracting cycle with a rotation number of 2 / 5 {\displaystyle 2/5} . Its distinctive antenna-like structure comprises a junction point from which five spokes emanate. Among these spokes, called the principal spoke is directly attached to the 2 / 5 {\displaystyle 2/5} bulb, and the 'smallest' non-principal spoke is positioned approximately 2 / 5 {\displaystyle 2/5} of a turn counterclockwise from the principal spoke, providing a distinctive identification as a 2 / 5 {\displaystyle 2/5} -bulb. This raises the question: how does one discern which among these spokes is the 'smallest'? In the theory of external rays developed by Douady and Hubbard, there are precisely two external rays landing at the root point of a satellite hyperbolic component of the Mandelbrot Set. Each of these rays possesses an external angle that undergoes doubling under the angle doubling map θ ↦ {\displaystyle \theta \mapsto } 2 θ {\displaystyle 2\theta } . According to this theorem, when two rays land at the same point, no other rays between them can intersect. Thus, the 'size' of this region is measured by determining the length of the arc between the two angles.
If the root point of the main cardioid is the cusp at c = 1 / 4 {\displaystyle c=1/4} , then the main cardioid is the 0 / 1 {\displaystyle 0/1} -bulb. The root point of any other bulb is just the point where this bulb is attached to the main cardioid. This prompts the inquiry: which is the largest bulb between the root points of the 0 / 1 {\displaystyle 0/1} and 1 / 2 {\displaystyle 1/2} -bulbs? It is clearly the 1 / 3 {\displaystyle 1/3} -bulb. And note that 1 / 3 {\displaystyle 1/3} is obtained from the previous two fractions by Farey addition, i.e., adding the numerators and adding the denominators
0 1 {\displaystyle {\frac {0}{1}}} ⊕ {\displaystyle \oplus } 1 2 {\displaystyle {\frac {1}{2}}} = {\displaystyle =} 1 3 {\displaystyle {\frac {1}{3}}}
Similarly, the largest bulb between the 1 / 3 {\displaystyle 1/3} and 1 / 2 {\displaystyle 1/2} -bulbs is the 2 / 5 {\displaystyle 2/5} -bulb, again given by Farey addition.
1 3 {\displaystyle {\frac {1}{3}}} ⊕ {\displaystyle \oplus } 1 2 {\displaystyle {\frac {1}{2}}} = {\displaystyle =} 2 5 {\displaystyle {\frac {2}{5}}}
The largest bulb between the 2 / 5 {\displaystyle 2/5} and 1 / 2 {\displaystyle 1/2} -bulb is the 3 / 7 {\displaystyle 3/7} -bulb, while the largest bulb between the 2 / 5 {\displaystyle 2/5} and 1 / 3 {\displaystyle 1/3} -bulbs is the 3 / 8 {\displaystyle 3/8} -bulb, and so on. The arrangement of bulbs within the Mandelbrot set follows a remarkable pattern governed by the Farey tree, a structure encompassing all rationals between 0 {\displaystyle 0} and 1 {\displaystyle 1} . This ordering positions the bulbs along the boundary of the main cardioid precisely according to the rational numbers in the unit interval.
Starting with the 1 / 3 {\displaystyle 1/3} bulb at the top and progressing towards the 1 / 2 {\displaystyle 1/2} circle, the sequence unfolds systematically: the largest bulb between 1 / 2 {\displaystyle 1/2} and 1 / 3 {\displaystyle 1/3} is 2 / 5 {\displaystyle 2/5} , between 1 / 3 {\displaystyle 1/3} and 2 / 5 {\displaystyle 2/5} is 3 / 8 {\displaystyle 3/8} , and so forth. Intriguingly, the denominators of the periods of circular bulbs at sequential scales in the Mandelbrot Set conform to the Fibonacci number sequence, the sequence that is made by adding the previous two terms – 1, 2, 3, 5, 8, 13, 21...
The Fibonacci sequence manifests in the number of spiral arms at a unique spot on the Mandelbrot set, mirrored both at the top and bottom. This distinctive location demands the highest number of iterations of for a detailed fractal visual, with intricate details repeating as one zooms in.
The boundary of the Mandelbrot set shows more intricate detail the closer one looks or magnifies the image. The following is an example of an image sequence zooming to a selected c value.
The magnification of the last image relative to the first one is about 10 to 1. Relating to an ordinary computer monitor, it represents a section of a Mandelbrot set with a diameter of 4 million kilometers.
The seahorse "body" is composed by 25 "spokes" consisting of two groups of 12 "spokes" each and one "spoke" connecting to the main cardioid. These two groups can be attributed by some metamorphosis to the two "fingers" of the "upper hand" of the Mandelbrot set; therefore, the number of "spokes" increases from one "seahorse" to the next by 2; the "hub" is a Misiurewicz point. Between the "upper part of the body" and the "tail", there is a distorted copy of the Mandelbrot set, called a "satellite".
The islands in the third-to-last step seem to consist of infinitely many parts, as is the case for the corresponding Julia set J c {\displaystyle J_{c}} . They are connected by tiny structures, so that the whole represents a simply connected set. The tiny structures meet each other at a satellite in the center that is too small to be recognized at this magnification. The value of c {\displaystyle c} for the corresponding J c {\displaystyle J_{c}} is not the image center but, relative to the main body of the Mandelbrot set, has the same position as the center of this image relative to the satellite shown in the 6th step.
While the Mandelbrot set is typically rendered showing outside boundary detail, structure within the bounded set can also be revealed. For example, while calculating whether or not a given c value is bound or unbound, while it remains bound, the maximum value that this number reaches can be compared to the c value at that location. If the sum of squares method is used, the calculated number would be max:(real^2 + imaginary^2) - c:(real^2 + imaginary^2). The magnitude of this calculation can be rendered as a value on a gradient.
This produces results like the following, gradients with distinct edges and contours as the boundaries are approached. The animations serve to highlight the gradient boundaries.
Multibrot sets are bounded sets found in the complex plane for members of the general monic univariate polynomial family of recursions
For an integer d, these sets are connectedness loci for the Julia sets built from the same formula. The full cubic connectedness locus has also been studied; here one considers the two-parameter recursion z ↦ z 3 + 3 k z + c {\displaystyle z\mapsto z^{3}+3kz+c} , whose two critical points are the complex square roots of the parameter k. A parameter is in the cubic connectedness locus if both critical points are stable. For general families of holomorphic functions, the boundary of the Mandelbrot set generalizes to the bifurcation locus.
The Multibrot set is obtained by varying the value of the exponent d. The article has a video that shows the development from d = 0 to 7, at which point there are 6 i.e. ( d − 1 ) {\displaystyle (d-1)} lobes around the perimeter. In general, when d is a positive integer, the central region in each of these sets is always an epicycloid of ( d − 1 ) {\displaystyle (d-1)} cusps. A similar development with negative integral exponents results in ( 1 − d ) {\displaystyle (1-d)} clefts on the inside of a ring, where the main central region of the set is a hypocycloid of ( 1 − d ) {\displaystyle (1-d)} cusps.
There is no perfect extension of the Mandelbrot set into 3D, because there is no 3D analogue of the complex numbers for it to iterate on. There is an extension of the complex numbers into 4 dimensions, the quaternions, that creates a perfect extension of the Mandelbrot set and the Julia sets into 4 dimensions. These can then be either cross-sectioned or projected into a 3D structure. The quaternion (4-dimensional) Mandelbrot set is simply a solid of revolution of the 2-dimensional Mandelbrot set (in the j-k plane), and is therefore uninteresting to look at. Taking a 3-dimensional cross section at d = 0 ( q = a + b i + c j + d k ) {\displaystyle d=0\ (q=a+bi+cj+dk)} results in a solid of revolution of the 2-dimensional Mandelbrot set around the real axis.
The tricorn fractal, also called the Mandelbar set, is the connectedness locus of the anti-holomorphic family z ↦ z ¯ 2 + c {\displaystyle z\mapsto {\bar {z}}^{2}+c} . It was encountered by Milnor in his study of parameter slices of real cubic polynomials. It is not locally connected. This property is inherited by the connectedness locus of real cubic polynomials.
Another non-analytic generalization is the Burning Ship fractal, which is obtained by iterating the following:
There exist a multitude of various algorithms for plotting the Mandelbrot set via a computing device. Here, the naïve "escape time algorithm" will be shown, since it is the most popular and one of the simplest algorithms. In the escape time algorithm, a repeating calculation is performed for each x, y point in the plot area and based on the behavior of that calculation, a color is chosen for that pixel.
The x and y locations of each point are used as starting values in a repeating, or iterating calculation (described in detail below). The result of each iteration is used as the starting values for the next. The values are checked during each iteration to see whether they have reached a critical "escape" condition, or "bailout". If that condition is reached, the calculation is stopped, the pixel is drawn, and the next x, y point is examined.
The color of each point represents how quickly the values reached the escape point. Often black is used to show values that fail to escape before the iteration limit, and gradually brighter colors are used for points that escape. This gives a visual representation of how many cycles were required before reaching the escape condition.
To render such an image, the region of the complex plane we are considering is subdivided into a certain number of pixels. To color any such pixel, let c {\displaystyle c} be the midpoint of that pixel. Iterate the critical point 0 under f c {\displaystyle f_{c}} , checking at each step whether the orbit point has a radius larger than 2. When this is the case, c {\displaystyle c} does not belong to the Mandelbrot set, and color the pixel according to the number of iterations used to find out. Otherwise, keep iterating up to a fixed number of steps, after which we decide that our parameter is "probably" in the Mandelbrot set, or at least very close to it, and color the pixel black.
In pseudocode, this algorithm would look as follows. The algorithm does not use complex numbers and manually simulates complex-number operations using two real numbers, for those who do not have a complex data type. The program may be simplified if the programming language includes complex-data-type operations.
Here, relating the pseudocode to c {\displaystyle c} , z {\displaystyle z} and f c {\displaystyle f_{c}} :
and so, as can be seen in the pseudocode in the computation of x and y:
To get colorful images of the set, the assignment of a color to each value of the number of executed iterations can be made using one of a variety of functions (linear, exponential, etc.).
Here is the code implementing the above algorithm in Python:
The value of power variable can be modified to generate an image of equivalent multibrot set ( z = z power + c {\displaystyle z=z^{\text{power}}+c} ). For example, setting p = 2 produces the associated image.
The Mandelbrot set is widely considered the most popular fractal, and has been referenced several times in popular culture.