Julia set

Julia set (ice).png

In complex dynamics, the Julia set J(f)[1] of a holomorphic function f informally consists of those points whose long-time behavior under repeated iteration of f can change drastically under arbitrarily small perturbations (bifurcation locus).

The Fatou set F(f) of f is the complement of the Julia set: that is, the set of points which exhibit 'stable' behavior.

Thus on F(f), the behavior of f is 'regular', while on J(f), it is 'chaotic'.

These sets are named after the French mathematicians Gaston Julia,[2] and Pierre Fatou[3] who initiated the theory of complex dynamics in the early 20th century.

Contents

Formal definition

Let

\displaystyle f:X\to X

be a holomorphic map of a Riemann surface X to itself. Assume that X is either the Riemann sphere, the complex plane, or the once-punctured complex plane, as the other cases do not give rise to interesting dynamics. (Such maps are completely classified.)

Consider f as a discrete dynamical system on the phase space X, and consider the behavior of the iterates f^n of f (that is, the n-fold compositions of f with itself).

The Fatou set of f consists of all points z\in X such that the family of iterates

(f^n)_{n\in\mathbb{N}}

forms a normal family in the sense of Montel when restricted to some open neighborhood of z.

The Julia set of f is the complement of the Fatou set in X.

Equivalent descriptions of the Julia set

Properties of the Julia set and Fatou set

The Julia set and the Fatou set of f are both completely invariant under f, i.e.

f^{-1}(J(f)) = f(J(f)) = J(f)

and

f^{-1}(F(f)) = f(F(f)) = F(f).[4]

Rational maps

Julia set (in white) for the rational function associated to Newton's method for ƒ:z→z3−1. Coloring of Fatou set according to attractor (the roots of ƒ)

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.[5] Each component of the Fatou set of a rational map can be classified into one of four different classes.[6]

Quadratic polynomials

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

f_c(z) = z^2 + c\,

where c is a complex parameter.

A Julia set plot showing julia sets for different values of c, the plot resembles the Mandelbrot set

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 set: 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:

In other words the Julia sets J(f_c) are locally similar around Misiurewicz points.[7]

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 Epstein's 'finite-type maps'.

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

Plotting the Julia set

Using backwards (inverse) iteration (IIM)

A Julia set plot, generated using backwards iteration

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 computationally feasible. 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}^2 = 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 hard to reach with the reverse Julia algorithm. For this reason, other methods usually produce better images.

Using DEM/J

Julia set : image with C source code using DEM/J

See also

Notes

  1. ↑ Note that in other areas of mathematics the notation J(f) can also represent the Jacobian matrix of a real valued mapping f between smooth manifolds.
  2. ↑ Gaston Julia (1918) "Mémoire sur l'iteration des fonctions rationnelles," Journal de Mathématiques Pures et Appliquées, vol. 8, pages 47-245.
  3. ↑ 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.
  4. ↑ Beardon, Iteration of Rational Functions, Theorem 3.2.4
  5. ↑ Beardon, Iteration of Rational Functions, Theorem 5.6.2
  6. ↑ Beardon, Theorem 7.1.1
  7. ↑ Lei.pdf Tan Lei, "Similarity between the Mandelbrot set and Julia Sets", Communications in Mathematical Physics 134 (1990), pp. 587-617.

References

External links