Filled Julia set

From HandWiki
Short description: Complex Set that does not escape under iteration of a given function

The filled-in Julia set K(f) of a polynomial f is the union of a Julia set and its interior, non-escaping set.

Formal definition

The filled-in Julia set K(f) of a polynomial f is defined as the set of all points z of the dynamical plane that have bounded orbit with respect to f K(f)=def{z∈ℂ:f(k)(z)↛∞ask→∞} where:

Relation to the Fatou set

The filled-in Julia set is the (absolute) complement of the attractive basin of infinity. K(f)=ℂ∖Af(∞)

The attractive basin of infinity is one of the components of the Fatou set. Af(∞)=F∞

In other words, the filled-in Julia set is the complement of the unbounded Fatou component: K(f)=F∞C.

Relation between Julia, filled-in Julia set and attractive basin of infinity

The Julia set is the common boundary of the filled-in Julia set and the attractive basin of infinity J(f)=∂K(f)=∂Af(∞) where: Af(∞) denotes the attractive basin of infinity = exterior of filled-in Julia set = set of escaping points for f

Af(∞) =def {z∈ℂ:f(k)(z)→∞ as k→∞}.

If the filled-in Julia set has no interior then the Julia set coincides with the filled-in Julia set. This happens when all the critical points of f are pre-periodic. Such critical points are often called Misiurewicz points.

Spine

The most studied polynomials are probably those of the form f(z)=z2+c, which are often denoted by fc, where c is any complex number. In this case, the spine Sc of the filled Julia set K is defined as arc between β-fixed point and −β, Sc=[−β,β] with such properties:

  • spine lies inside K.[1] This makes sense when K is connected and full[2]
  • spine is invariant under 180 degree rotation,
  • spine is a finite topological tree,
  • Critical point zcr=0 always belongs to the spine.[3]
  • β-fixed point is a landing point of external ray of angle zero ℛ0K,
  • −β is landing point of external ray ℛ1/2K.

Algorithms for constructing the spine:

  • detailed version is described by A. Douady[4]
  • Simplified version of algorithm:
    • connect −β and β within K by an arc,
    • when K has empty interior then arc is unique,
    • otherwise take the shortest way that contains 0.[5]

Curve R: R=defR1/2∪Sc∪R0 divides dynamical plane into two components.

Images

Names

Notes

  1. ↑ Douglas C. Ravenel: External angles in the Mandelbrot set: the work of Douady and Hubbard. University of Rochester
  2. ↑ John Milnor : Pasting Together Julia Sets: A Worked Out Example of Mating. Experimental Mathematics Volume 13 (2004)
  3. ↑ Saaed Zakeri: Biaccessiblility in quadratic Julia sets I: The locally-connected case
  4. ↑ A. Douady, “Algorithms for computing angles in the Mandelbrot set,” in Chaotic Dynamics and Fractals, M. Barnsley and S. G. Demko, Eds., vol. 2 of Notes and Reports in Mathematics in Science and Engineering, pp. 155–168, Academic Press, Atlanta, Georgia, USA, 1986.
  5. ↑ K M. Brucks, H Bruin : Topics from One-Dimensional Dynamics Series: London Mathematical Society Student Texts (No. 62) page 257
  6. ↑ The Mandelbrot Set And Its Associated Julia Sets by Hermann Karcher

References

  1. Peitgen Heinz-Otto, Richter, P.H. : The beauty of fractals: Images of Complex Dynamical Systems. Springer-Verlag 1986. ISBN 978-0-387-15851-8.
  2. Bodil Branner : Holomorphic dynamical systems in the complex plane. Department of Mathematics Technical University of Denmark, MAT-Report no. 1996-42.