Suvarna Garge (Editor)

Filled Julia set

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Filled Julia set

The filled-in Julia set   K ( f ) of a polynomial   f is :

Contents

  • 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 )   = d e f   { z C : f ( k ) ( z )   a s   k }
    where :

    C is the set of complex numbers

      f ( k ) ( z ) is the   k -fold composition of f with itself = iteration of function f

    Relation to the Fatou set

    The filled-in Julia set is the (absolute) complement of the attractive basin of infinity.
    K ( f ) = C A f ( )

    The attractive basin of infinity is one of the components of the Fatou set.
    A f ( ) = 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 ) = A f ( )

    where :
    A f ( ) denotes the attractive basin of infinity = exterior of filled-in Julia set = set of escaping points for f

    A f ( )   = d e f   { z C : f ( k ) ( z )   a s   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 ) = z 2 + c , which are often denoted by f c , where c is any complex number. In this case, the spine S c of the filled Julia set   K is defined as arc between β -fixed point and β ,

    S c = [ β , β ]

    with such properties:

  • spine lies inside   K . This makes sense when K is connected and full
  • spine is invariant under 180 degree rotation,
  • spine is a finite topological tree,
  • Critical point z c r = 0 always belongs to the spine.
  • β -fixed point is a landing point of external ray of angle zero R 0 K ,
  • β is landing point of external ray R 1 / 2 K .
  • Algorithms for constructing the spine:

  • detailed version is described by A. Douady
  • 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 .
  • Curve R  :

    R   = d e f   R 1 / 2     S c     R 0

    divides dynamical plane into two components.

    References

    Filled Julia set Wikipedia


    Similar Topics