Julia set explained

In the context of complex dynamics, a branch of mathematics, the Julia set and the Fatou set are two complementary sets (Julia "laces" and Fatou "dusts") defined from a function. Informally, the Fatou set of the function consists of values with the property that all nearby values behave similarly under repeated iteration of the function, and the Julia set consists of values such that an arbitrarily small perturbation can cause drastic changes in the sequence of iterated function values.Thus the behavior of the function on the Fatou set is "regular", while on the Julia set its behavior is "chaotic".

The Julia set of a function    is commonly denoted

\operatorname{J}(f), and the Fatou set is denoted \operatorname{F}(f). These sets are named after the French mathematicians Gaston Julia^[1] and Pierre Fatou^[2] whose work began the study of complex dynamics during the early 20th century.

Formal definition

Let

f(z) be a non-constant holomorphic function from the Riemann sphere onto itself. Such functions f(z) are precisely the non-constant complex rational functions, that is, f(z) = p(z)/q(z) where p(z) and q(z) are complex polynomials. Assume that p and q have no common roots, and at least one has degree larger than 1. Then there is a finite number of open sets F _{1,} ..., F _{r} that are left invariant by f(z) and are such that:

1. The union of the sets

F _{i} is dense in the plane andf(z) behaves in a regular and equal way on each of the sets F _{i} .

The last statement means that the termini of the sequences of iterations generated by the points of

F _{i} are either precisely the same set, which is then a finite cycle, or they are finite cycles of circular or annular shaped sets that are lying concentrically. In the first case the cycle is attracting, in the second case it is neutral.

These sets

F _{i} are the Fatou domains of f(z) , and their union is the Fatou set \operatorname{F}(f) of f(z) . Each of the Fatou domains contains at least one critical point of f(z) , that is, a (finite) point z satisfying f'(z) = 0 , or f(z) = inf ty if the degree of the numerator p(z) is at least two larger than the degree of the denominator q(z) , or if f(z) = 1 /g(z) + c for some c and a rational function g(z) satisfying this condition.

The complement of

\operatorname{F}(f) is the Julia set \operatorname{J}(f) of f(z) . If all the critical points are preperiodic, that is they are not periodic but eventually land on a periodic cycle, then \operatorname{J}(f) is all the sphere. Otherwise, \operatorname{J}(f) is a nowhere dense set (it is without interior points) and an uncountable set (of the same cardinality as the real numbers). Like \operatorname{F}(f) , \operatorname{J}(f) is left invariant by f(z) , and on this set the iteration is repelling, meaning that |f(z) - f(w)| > |z - w| for all w in a neighbourhood of z (within \operatorname{J}(f) ). This means that f(z) behaves chaotically on the Julia set. Although there are points in the Julia set whose sequence of iterations is finite, there are only a countable number of such points (and they make up an infinitesimal part of the Julia set). The sequences generated by points outside this set behave chaotically, a phenomenon called deterministic chaos.

There has been extensive research on the Fatou set and Julia set of iterated rational functions, known as rational maps. For example, it is known that the Fatou set of a rational map has either 0, 1, 2 or infinitely many components.^[3] Each component of the Fatou set of a rational map can be classified into one of four different classes.^[4]

Equivalent descriptions of the Julia set

\operatorname{J}(f) is the smallest closed set containing at least three points which is completely invariant under f.\operatorname{J}(f) is the closure of the set of repelling periodic points.

• For all but at most two points

z \in X , the Julia set is the set of limit points of the full backwards orbit c up _{n} f ^{-n} (z). (This suggests a simple algorithm for plotting Julia sets, see below.)

• If f is an entire function, then

\operatorname{J}(f) is the boundary of the set of points which converge to infinity under iteration.

• If f is a polynomial, then

\operatorname{J}(f) is the boundary of the filled Julia set; that is, those points whose orbits under iterations of f remain bounded.

Properties of the Julia set and Fatou set

The Julia set and the Fatou set of f are both completely invariant under iterations of the holomorphic function f:^[5]

f ^{-1} (\operatorname{J}(f)) = f(\operatorname{J}(f)) = \operatorname{J}(f), f ^{-1} (\operatorname{F}(f)) = f(\operatorname{F}(f)) = \operatorname{F}(f).

Examples

For

f(z) = z ^{2} the Julia set is the unit circle and on this the iteration is given by doubling of angles (an operation that is chaotic on the points whose argument is not a rational fraction of 2 \pi ). There are two Fatou domains: the interior and the exterior of the circle, with iteration towards 0 and ∞, respectively.

For

g(z) = z ^{2} - 2 the Julia set is the line segment between −2 and 2. There is one Fatou domain: the points not on the line segment iterate towards ∞. (Apart from a shift and scaling of the domain, this iteration is equivalent to x \to 4 (x - \tfrac{ 1 }{ 2 }) ^{2} on the unit interval, which is commonly used as an example of chaotic system.)

The functions f and g are of the form

z ^{2} + c , where c is a complex number. For such an iteration the Julia set is not in general a simple curve, but is a fractal, and for some values of c it can take surprising shapes. See the pictures below.

For some functions f(z) we can say beforehand that the Julia set is a fractal and not a simple curve. This is because of the following result on the iterations of a rational function:

This means that each point of the Julia set is a point of accumulation for each of the Fatou domains. Therefore, if there are more than two Fatou domains, each point of the Julia set must have points of more than two different open sets infinitely close, and this means that the Julia set cannot be a simple curve. This phenomenon happens, for instance, when f(z) is the Newton iteration for solving the equation

P(z) : = z ^{n} - 1 = 0 ~ : ~ n > 2 :f(z) = z - (P(z))/(P'(z)) = (1+ (n -1 )z ^{n})/(nz ^{n-1}) ~ .

The image on the right shows the case n = 3.

Quadratic polynomials

A very popular complex dynamical system is given by the family of complex quadratic polynomials, a special case of rational maps. Such quadratic polynomials can be expressed as

f _{c(z)} = z ^{2} + c ~, where c is a complex parameter. Fix some R > 0 large enough that R ^{2} - R \ge |c|. (For example, if is in the Mandelbrot set, then |c| \le 2 , so we may simply let R = 2 ~. ) Then the filled Julia set for this system is the subset of the complex plane given byK(f _{c)} = \left\{z \in C : \forall n \in N, |f ^{n(z)|} _{c} \le R \right\}~, where f ^{n(z)} _{c} is the nth iterate of f _{c(z).} The Julia set J(f _{c)} of this function is the boundary of K(f _{c)} .

The parameter plane of quadratic polynomials – that is, the plane of possible c values – gives rise to the famous Mandelbrot set. Indeed, the Mandelbrot set is defined as the set of all c such that

J(f _{c)} is connected. For parameters outside the Mandelbrot set, the Julia set is a Cantor space: in this case it is sometimes referred to as Fatou dust.

In many cases, the Julia set of c looks like the Mandelbrot set in sufficiently small neighborhoods of c. This is true, in particular, for so-called Misiurewicz parameters, i.e. parameters c for which the critical point is pre-periodic. For instance:

• At c = i, the shorter, front toe of the forefoot, the Julia set looks like a branched lightning bolt.
• At c = −2, the tip of the long spiky tail, the Julia set is a straight line segment.

In other words, the Julia sets

J(f _{c)} are locally similar around Misiurewicz points.^[6]

Generalizations

The definition of Julia and Fatou sets easily carries over to the case of certain maps whose image contains their domain; most notably transcendental meromorphic functions and Adam Epstein's finite-type maps.

Julia sets are also commonly defined in the study of dynamics in several complex variables.

Pseudocode

The below pseudocode implementations hard code the functions for each fractal. Consider implementing complex number operations to allow for more dynamic and reusable code.

Pseudocode for normal Julia sets

f(z) = z ^{2} + c

R = escape radius # choose R > 0 such that R**2 - R >= sqrt(cx**2 + cy**2)

for each pixel (x, y) on the screen, do:

Pseudocode for multi-Julia sets

f(z) = z ^{n} + c R = escape radius # choose R > 0 such that R**n - R >= sqrt(cx**2 + cy**2)

for each pixel (x, y) on the screen, do:

Another recommended option is to reduce color banding between iterations by using a renormalization formula for the iteration. ^[7]

Such formula is given to be,

mu = k + 1 - (log { log {|z _{k} |)/() }}\forall f _{c,n} (z) = z ^{n} + lowerpowerterms + c

where

k is the escaping iteration, bounded by some K such that 0 \leq k < K and K \in N , and |z _{k} | is the magnitude of the last iterate before escaping.

This can be implemented, very simply, like so:

1. simply replace the last 4 lines of code from the last example with these lines of code:

if(iteration

max_iteration) return black;else abs_z = zx * zx + zy * zy; return iteration + 1 - log(log(abs_z))/log(n);

The difference is shown below with a Julia set defined as

f _{c,} (z) where c = -0 . 835 - 0 . 321 i .

The potential function and the real iteration number

The Julia set for

f(z) = z ^{2} is the unit circle, and on the outer Fatou domain, the potential function φ(z) is defined by φ(z) = log|z|. The equipotential lines for this function are concentric circles. As |f(z)| = |z| ^{2} we have\varphi(z) = \lim _{k\toinfty} (log |z _{k|})/(2 ^{k}) ,

where

z _{k} is the sequence of iteration generated by z. For the more general iteration f(z) = z ^{2} + c , it has been proved that if the Julia set is connected (that is, if c belongs to the (usual) Mandelbrot set), then there exist a biholomorphic map ψ between the outer Fatou domain and the outer of the unit circle such that |\psi(f(z))| = |\psi(z)| ^{2} .^[8] This means that the potential function on the outer Fatou domain defined by this correspondence is given by:\varphi(z) = \lim _{k\toinfty} (log |z _{k|})/(2 ^{k}) .

This formula has meaning also if the Julia set is not connected, so that we for all c can define the potential function on the Fatou domain containing ∞ by this formula. For a general rational function f(z) such that ∞ is a critical point and a fixed point, that is, such that the degree m of the numerator is at least two larger than the degree n of the denominator, we define the potential function on the Fatou domain containing ∞ by:

\varphi(z) = \lim _{k\toinfty} (log |z _{k|})/(d ^{k}) ,

where d = m − n is the degree of the rational function.^[9]

If N is a very large number (e.g. 10¹⁰⁰), and if k is the first iteration number such that

|z _{k|} > N , we have that(log |z _{k|})/(d ^{k}) = (log (N))/(d ^{\nu(z)}) ,

for some real number

\nu(z) , which should be regarded as the real iteration number, and we have that:\nu(z) = k - (log ( log |z _{k|/log(N))})/(log (d)) ,

where the last number is in the interval [0,&nbsp;1). For iteration towards a finite attracting cycle of order ''r'', we have that if <math>z^*</math> is a point of the cycle, then <math>f(f(...f(z^*))) = z^*</math> (the ''r''-fold composition), and the number :<math>\alpha = \frac{1}{\left |(d(f(f(\cdots f(z))))/dz)_{z=z^*} \right |} \qquad (> 1)</math> is the ''attraction'' of the cycle. If ''w'' is a point very near <math>z^*</math> and ''w''&prime; is ''w'' iterated ''r'' times, we have that :<math>\alpha = \lim_{k\to\infty} \frac{|w - z^*|}{|w' - z^*|}.</math> Therefore, the number <math>|z_{kr} - z^*|\alpha^{k}</math> is almost independent of ''k''. We define the potential function on the Fatou domain by: :<math>\varphi(z) = \lim_{k\to\infty} \frac{1}{(|z_{kr} - z^*|\alpha^{k})}.</math> If ε is a very small number and ''k'' is the first iteration number such that <math>|z_k - z^*| < \epsilon</math>, we have that :<math>\varphi(z) = \frac{1}{(\varepsilon \alpha^{\nu(z)})}</math> for some real number <math>\nu(z)</math>, which should be regarded as the real iteration number, and we have that: :<math>\nu(z) = k - \frac{\log(\varepsilon/|z_k - z^*|)}{\log(\alpha)}.</math> If the attraction is ∞, meaning that the cycle is ''super-attracting'', meaning again that one of the points of the cycle is a critical point, we must replace ''α'' by :<math>\alpha = \lim_{k\to\infty} \frac{\log|w' - z^*|}{\log|w - z^*|},</math> where ''w''&prime; is ''w'' iterated ''r'' times and the formula for ''φ''(''z'') by: :<math>\varphi(z) = \lim_{k\to\infty} \frac{\log(1/|z_{kr} - z^*|)}{\alpha^k}. </math> And now the real iteration number is given by: :<math>\nu(z) = k - \frac{\log(\log|z_k - z^*|/\log(\varepsilon))}{\log(\alpha)}.</math> For the colouring we must have a cyclic scale of colours (constructed mathematically, for instance) and containing ''H'' colours numbered from 0 to ''H''−1 (''H'' = 500, for instance). We multiply the real number <math>\nu(z)</math> by a fixed real number determining the density of the colours in the picture, and take the integral part of this number modulo ''H''. The definition of the potential function and our way of colouring presuppose that the cycle is attracting, that is, not neutral. If the cycle is neutral, we cannot colour the Fatou domain in a natural way. As the terminus of the iteration is a revolving movement, we can, for instance, colour by the minimum distance from the cycle left fixed by the iteration. ==Field lines== [[Image:Juliasetsdkfieldlines2.jpg|thumb|right|The equipotential lines for iteration towards infinity]]In each Fatou domain (that is not neutral) there are two systems of lines orthogonal to each other: the equipotential lines (for the potential function or the real iteration number) and the field lines.

If we colour the Fatou domain according to the iteration number (and not the real iteration number

\nu(z) , as defined in the previous section), the bands of iteration show the course of the equipotential lines. If the iteration is towards ∞ (as is the case with the outer Fatou domain for the usual iteration z ^{2} + c ), we can easily show the course of the field lines, namely by altering the colour according as the last point in the sequence of iteration is above or below the x-axis (first picture), but in this case (more precisely: when the Fatou domain is super-attracting) we cannot draw the field lines coherently - at least not by the method we describe here. In this case a field line is also called an external ray.

Let z be a point in the attracting Fatou domain. If we iterate z a large number of times, the terminus of the sequence of iteration is a finite cycle C, and the Fatou domain is (by definition) the set of points whose sequence of iteration converges towards C. The field lines issue from the points of C and from the (infinite number of) points that iterate into a point of C. And they end on the Julia set in points that are non-chaotic (that is, generating a finite cycle). Let r be the order of the cycle C (its number of points) and let

z ^{*} be a point in C. We have f(f( ... f(z ^{*)))} = z ^{*} (the r-fold composition), and we define the complex number α by\alpha = (d(f(f( ... f(z))))/dz) _{z = z ^{*}} .

If the points of C are

z _{i,} i = 1 , ... , r (z _{1} = z ^{*)} , α is the product of the r numbers f'(z _{i)} . The real number 1/|α| is the attraction of the cycle, and our assumption that the cycle is neither neutral nor super-attracting, means that . The point z ^{*} is a fixed point for f(f( ... f(z))) , and near this point the map f(f( ... f(z))) has (in connection with field lines) character of a rotation with the argument β of α (that is, \alpha = |\alpha|e ^{\beta} ).

In order to colour the Fatou domain, we have chosen a small number ε and set the sequences of iteration

z _{k} (k = 0 , 1 , 2 , ... , z _{0} = z) to stop when |z _{k} - z ^{*|} < \epsilon , and we colour the point z according to the number k (or the real iteration number, if we prefer a smooth colouring). If we choose a direction from z ^{*} given by an angle θ, the field line issuing from z ^{*} in this direction consists of the points z such that the argument ψ of the number z _{k} - z ^{*} satisfies the condition that\psi - k\beta = \theta \mod \pi.

For if we pass an iteration band in the direction of the field lines (and away from the cycle), the iteration number k is increased by 1 and the number ψ is increased by β, therefore the number

\psi - k\beta \mod \pi is constant along the field line.

A colouring of the field lines of the Fatou domain means that we colour the spaces between pairs of field lines: we choose a number of regularly situated directions issuing from

z ^{*} , and in each of these directions we choose two directions around this direction. As it can happen that the two field lines of a pair do not end in the same point of the Julia set, our coloured field lines can ramify (endlessly) in their way towards the Julia set. We can colour on the basis of the distance to the center line of the field line, and we can mix this colouring with the usual colouring. Such pictures can be very decorative (second picture).

A coloured field line (the domain between two field lines) is divided up by the iteration bands, and such a part can be put into a one-to-one correspondence with the unit square: the one coordinate is (calculated from) the distance from one of the bounding field lines, the other is (calculated from) the distance from the inner of the bounding iteration bands (this number is the non-integral part of the real iteration number). Therefore, we can put pictures into the field lines (third picture).

Plotting the Julia set

Methods :

• Distance Estimation Method for Julia set (DEM/J)
• Inverse Iteration Method (IIM)

Using backwards (inverse) iteration (IIM)

As mentioned above, the Julia set can be found as the set of limit points of the set of pre-images of (essentially) any given point. So we can try to plot the Julia set of a given function as follows. Start with any point z we know to be in the Julia set, such as a repelling periodic point, and compute all pre-images of z under some high iterate

f ^{n} of f.

Unfortunately, as the number of iterated pre-images grows exponentially, this is not feasible computationally. However, we can adjust this method, in a similar way as the "random game" method for iterated function systems. That is, in each step, we choose at random one of the inverse images of f.

For example, for the quadratic polynomial f_c, the backwards iteration is described by

z _{n-1} = \sqrt{z _{n} - c} .

At each step, one of the two square roots is selected at random.

Note that certain parts of the Julia set are quite difficult to access with the reverse Julia algorithm. For this reason, one must modify IIM/J (it is called MIIM/J) or use other methods to produce better images.

Using DEM/J

As a Julia set is infinitely thin we cannot draw it effectively by backwards iteration from the pixels. It will appear fragmented because of the impracticality of examining infinitely many startpoints. Since the iteration count changes vigorously near the Julia set, a partial solution is to imply the outline of the set from the nearest color contours, but the set will tend to look muddy.

A better way to draw the Julia set in black and white is to estimate the distance of pixels (DEM) from the set and to color every pixel whose center is close to the set. The formula for the distance estimation is derived from the formula for the potential function φ(z). When the equipotential lines for φ(z) lie close, the number

|\varphi'(z)| is large, and conversely, therefore the equipotential lines for the function \delta(z) = \varphi(z)/|\varphi'(z)| should lie approximately regularly. It has been proven that the value found by this formula (up to a constant factor) converges towards the true distance for z converging towards the Julia set.

We assume that f(z) is rational, that is,

f(z) = p(z)/q(z) where p(z) and q(z) are complex polynomials of degrees m and n, respectively, and we have to find the derivative of the above expressions for φ(z). And as it is only z _{k} that varies, we must calculate the derivative z' _{k} of z _{k} with respect to z. But as z _{k} = f(f( … f(z))) (the k-fold composition), z' _{k} is the product of the numbers f'(z _{k)} , and this sequence can be calculated recursively by z' _{k+1} = f'(z _{k)z'} _{k} , starting with z' _{0} = 1 (before the calculation of the next iteration z _{k+1} = f(z _{k)} ).

For iteration towards ∞ (more precisely when, so that ∞ is a super-attracting fixed point), we have

|\varphi'(z)| = \lim _{k\toinfty} (|z' _{k|})/(|z ^{k} _{k|d}) ,

and consequently:

\delta(z) = \varphi(z)/|\varphi'(z)| = \lim _{k\toinfty} log |z _{k||z} _{k|/|z'} _{k|.}

For iteration towards a finite attracting cycle (that is not super-attracting) containing the point and having order r, we have

|\varphi'(z)| = \lim _{k\toinfty} |z' _{kr} |/(|z _{kr} - z ^{*|} ^{2} \alpha ^{k} ),

and consequently:

\delta(z) = \varphi(z)/|\varphi'(z)| = \lim _{k\toinfty} |z _{kr} - z ^{*|/|z'} _{kr} |.

For a super-attracting cycle, the formula is:

\delta(z) = \lim _{k\toinfty} log |z _{kr} - z ^{*|} ^{2 /|z'} ^{kr} |.

We calculate this number when the iteration stops. Note that the distance estimation is independent of the attraction of the cycle. This means that it has meaning for transcendental functions of "degree infinity" (e.g. sin(z) and tan(z)).

Besides drawing of the boundary, the distance function can be introduced as a 3rd dimension to create a solid fractal landscape.

See also

• Douady rabbit
• Limit set
• Stable and unstable sets
• No wandering domain theorem
• Chaos theory

Bibliography

• Book: Lennart . Carleson . Lennart Carleson . Theodore W. . Gamelin . 1993 . Complex Dynamics . Springer.
• Adrien . Douady . John H. . Hubbard . 1984 . Etude dynamique des polynômes complexes . Prépublications mathémathiques d'Orsay . 2 . .   [''op.cit.''] . Prépublications mathémathiques d'Orsay. 1985 . 4.
• Book: Milnor, J.W. . John W. Milnor . Dynamics in One Complex Variable . Third . Annals of Mathematics Studies . 160 . Princeton University Press . 2006 . 1990 . .
  First appeared in as a Web site: Stony Brook IMS Preprint. https://web.archive.org/web/20060424085751/http://www.math.sunysb.edu/preprints.html. 2006-04-24. available as Dynamics in one complex variable: Introductory lectures. math.DS/9201272. Milnor. John W.. 1990.
• Web site: Alexander . Bogomolny . Alexander Bogomolny . Mandelbrot Set and Indexing of Julia Sets . . Algebra curriculum.
• Web site: Evgeny . Demidov . The Mandelbrot and Julia sets' anatomy . 2003.
• Book: Beardon, Alan F. . Iteration of Rational Functions . Springer . 1991 . 0-387-95151-2.

External links

• • • Web site: Julia set fractal (2D) . Paul . Bourke . personal site .
• Web site: Julia sets . Jamie . Sawyer . 6 April 2007 . blog .
• Web site: Julia jewels: An exploration of Julia sets . Michael . McGoodwin . personal site .
• Web site: Crop circle Julia Set . Lucy . Pringle . personal site .
• Web site: Interactive Julia Set Applet . Josh . Greig . dead . https://web.archive.org/web/20120326020259/http://www.hightechdreams.com/weaver.php?topic=fractals . 2012-03-26.
• Web site: Julia and Mandelbrot set explorer . David E. . Joyce . Clark University . academic personal site .
• Web site: A simple program to generate Julia sets . liazardie.com . dead . https://web.archive.org/web/20110317020756/http://www.lizardie.com/links/download/fractal-generator . 2011-03-17. – Windows, 370 kB
• Web site: A collection of applets . SourceForge . – one of the applets can render Julia sets, via Iterated Function Systems.
• Web site: Julia meets HTML5 . Google Labs . HTML5 Fractal generator for your browser . dead . https://web.archive.org/web/20110218135200/http://juliamap.googlelabs.com/ . 2011-02-18.
• Web site: Julia . GNU R Package . generate Julia or Mandelbrot set at a given region and resolution . r-project.org . 25 November 2014 .
• Web site: Julia sets . – A visual explanation of Julia Sets.
• Web site: FractalTS . github.io . – Mandelbrot, Burning ship and corresponding Julia set generator.
• Web site: Julia set images, online rendering . finengin.net .
• Web site: Understanding Julia and Mandelbrot Sets . - A visual explanation.

Notes and References

1. Gaston Julia (1918) "Mémoire sur l'iteration des fonctions rationnelles", Journal de Mathématiques Pures et Appliquées, vol. 8, pages 47–245.
2. Pierre Fatou (1917) "Sur les substitutions rationnelles", Comptes Rendus de l'Académie des Sciences de Paris, vol. 164, pages 806–808 and vol. 165, pages 992–995.
3. Beardon, Iteration of Rational Functions, Theorem 5.6.2.
4. Beardon, Iteration of Rational Functions, Theorem 7.1.1.
5. Beardon, Iteration of Rational Functions, Theorem 3.2.4.
6. [Tan Lei]
7. Web site: Vepstas . Linas . Renormalizing the Mandelbrot Escape . linas.org . Creative Commons . 5 November 2023 . ps1.
8. Adrien . Douady . John H. . Hubbard . 1984 . Etude dynamique des polynômes complexes . Prépublications mathémathiques d'Orsay . 2 . .   [''op.cit.''] . Prépublications mathémathiques d'Orsay. 1985 . 4.
9. Book: Peitgen, Heinz-Otto . . Richter Peter . 1986 . Springer-Verlag . Heidelberg . 0-387-15851-0 .

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Julia set".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.