# Graphical exploration of the connectivity sets of alternated Julia sets

## Abstract

Using computer graphics and visualization algorithms, we extend in this work the results obtained analytically in Danca et al. (Int. J. Bifurc. Chaos, 19:2123–2129, 2009), on the connectivity domains of alternated Julia sets, defined by switching the dynamics of two quadratic Julia sets. As proved in Danca et al. (Int. J. Bifurc. Chaos, 19:2123–2129, 2009), the alternated Julia sets exhibit, as for polynomials of degree greater than two, the disconnectivity property in addition to the known dichotomy property (connectedness and totally disconnectedness), which characterizes the standard Julia sets. Via experimental mathematics, we unveil these connectivity domains, which are four-dimensional fractals. The computer graphics results show here, without substituting the proof but serving as a research guide, that for the alternated Julia sets, the Mandelbrot set consists of the set of all parameter values, for which each alternated Julia set is not only connected, but also disconnected.

### Keywords

Alternated Julia sets Connectedness Quadratic maps## 1 Introduction

The alternate iteration of two real Mandelbrot maps was firstly studied in [2], and the alternated iteration of two real logistic maps was treated in [3] using computer tools such as histograms and surrogate tests. In the case of some classes of continuous and discontinuous dynamical systems of integer and fractional order [4], by switching the parameter value in the underlying initial value problem while it is numerically integrated, any attractor may be synthesized. Moreover, in this way, the chaos control and anticontrol of chaos (chaoticization) can be explained and understood in a different way.

As known, the filled Julia set of the complex quadratic polynomial \({P_{c}}:\mathbb{C} \to \mathbb{C}, {P_{c}}(z) = {z^{2}} + c, c \in \mathbb{C}\), is the set \({K_{c}} = \{ z \in \mathbb{C}\mid P_{c}^{ \circ n}(z)\not \to\infty \mbox{ as} n \to\infty \}\), where \(P_{c}^{ \circ n}\) denotes the *n*th iteration of *P*_{c}, while the Julia set of *P*_{c} is *J*_{c}=*∂K*_{c}, i.e. the boundary of the filled Julia set (see, e.g., [5]).

### Remark 1

As it is well known, *J*_{c} is connected if and only if *K*_{c} is connected. If *c* belongs to the Mandelbrot set, then the Julia set is connected while, if it is outside the Mandelbrot set, the Julia set is totally disconnected [6]. This was the key result that inspired Mandelbrot, in 1977, to visualize a set in the complex parameter space consisting of all *c*-values that have connected Julia sets. This set is now known as the Mandelbrot set (\(\mathcal{M}\)).

^{1}the fate of the orbit of the critical points (where derivative vanishes) must be analyzed. This leads to the well-known fundamental topological dichotomy [7, 8] for the Julia sets of quadratic polynomials:

The Julia set is connected if and only if all the critical orbits are bounded.

The Julia set is totally disconnected if (but not only if) all the critical orbits are unbounded. One of the variants of this theorem states that: If the orbit of the critical point is unbounded, then the Julia set is a totally disconnected set (the typical example is the Cantor set, where if the orbit of the critical point is bounded then the Julia set is a connected set). For higher degree polynomials, the fundamental dichotomy theorem is no longer valid. Blanchard, Devaney, and Keen [9] introduced the statement for higher degree polynomials. The Julia set is disconnected if at least one critical point iterates to infinity, but it may or may not be totally disconnected.

For higher degree polynomials, the fundamental theorem is no longer valid. Blanchard, Devaney, and Keen introduced the statement for higher degree polynomials. In this case, the Julia set is disconnected if at least one critical point iterates to infinity, but it may or may not be totally disconnected.

In 1992, Branner and Hubbard stated a conjecture for the general polynomial case of any degree [10] that was subsequently proved by Branner and Hubbard [11]. It completes the Fatou–Julia theorem as follows: The Julia set is totally disconnected if and only if each component of the filled Julia set containing critical points is aperiodic [12, 13].

The disconnectedness means that the filled Julia sets consist of infinitely many pieces. Some of these pieces could be points, while others could be connected sets that are not points. In [1], we proved that the filled Julia set of the alternated iteration of two quadratic family maps can be connected, totally disconnected, and also disconnected (but not totally disconnected). The proof was made by employing analytical techniques.

In this paper, we draw and explore, with the aid of leading edge computer graphics algorithms, the fractal sets of the parameters which represent the three states: *connectedness*, *disconnectedness,* and *totally disconnectedness*, underlining the results previously obtained but also unveiling some new ones. Therefore, the obtained graphical results could represent possible subjects for future analytical works.

The loci or *connectivity classes* (since each Julia set falls into exactly one of the three) corresponding to each of the three connectivity properties of alternated Julia sets, will be denoted by *CL* (Connectedness Locus), *DL* (Disconnectedness Locus) and *TDL* (Totaly Disconnectedness Locus).

In order to graphically study these sets which, as we shall see are four dimensional, we employ a range of techniques for visualizing high dimensional objects more commonly reserved for studying 3D volumes arising from MRI or CT scans, techniques known as volume visualization. The structure of the paper is as follows: In Sect. 2, the alternated Julia sets and their connectivity properties are presented, while in Sect. 3 the connectedness is graphically analyzed.

## 2 Connectivity sets of the alternated Julia sets

*z*

_{n+1}takes the value \(z_{n}^{2} + {c_{2}}\) if

*n*is even and \(z_{n}^{2} + {c_{1}}\) if

*n*is odd. Because of the obvious symmetry of \({P_{{c_{1}}{c_{2}}}}\) and \({P_{{c_{2}}{c_{1}}}}\), we shall consider only the \({P_{{c_{1}}{c_{2}}}}\) case, the corresponding Julia set and filled Julia set being denoted \({J_{{P_{{c_{1}}{c_{2}}}}}}\) and \({K_{{P_{{c_{1}}{c_{2}}}}}}\) respectively. Moreover, because of Remark 1, we will study only

*K*sets.

Next, for the sake of simplicity hereafter, until necessary, we will drop the index *c*_{1}*c*_{2}.

*P*

^{∘n}} is

*P*is a difficult task, the auxiliary quartic polynomial

*Q*shall be introduced

The (un)boundedness of *Q*^{∘n} implies the (un)boundedness of {*P*^{∘n}}, respectively [1]. Thus, using the connectivity properties of *Q* indicated by the general case of the Fatou–Julia theorem, it is proved that this theorem also applies to *P*. To test numerically which values of the parameter *c* give rise to connected, disconnected, or totally disconnected filled Julia sets, without drawing the whole Julia set for each value of *c*, we have to test the boundedness of the orbits of the critical points.

*Q*:

- (i)
The orbits of the critical points 0 and \(\pm\sqrt {-c_{1}}\) are bounded, the alternated Julia set

*K*being*connected*. - (ii)
The orbits of 0 and \(\pm\sqrt{-c_{1}}\) are unbounded, the alternated Julia set

*K*being*totally disconnected*. - (iii)
Either the orbit of 0 is bounded and the orbits of \(\pm \sqrt{-c_{1}}\) are unbounded, or the orbit of 0 is unbounded and the orbits of \(\pm\sqrt{-c_{1}}\) are bounded. In this case,

*K*is*disconnected*if the bounded orbits are periodic and*totally disconnected*if the critical orbits are aperiodic.

## 3 Visualization of the connectivity sets

In this section, we describe the way in which the connectivity domains are plotted.

*B*the set of all complex numbers \(c_{1}, c_{2}\in \mathbb{C,}\) which determine the connectivity sets of alternated Julia sets.

*B*can be considered as a set of points of four coordinates \((\operatorname{Re}(c_{1}),\operatorname{Im}(c_{1}),\operatorname{Re}(c_{2}), \operatorname{Im}(c_{2}))\) in a 4D hyperspace verifying under the iteration (1) one of the relations (i), (ii), or (iii). In order visualize

*B*, it can be imagined in the 4D-Quaternion space [14]. Therefore, in the underlying base {1,

*i*,

*j*,

*k*},

*B*can be described as where

*i*,

*j*, and

*k*are imaginary numbers satisfying the fundamental formula for quaternion multiplicative identities

*i*

^{2}=

*j*

^{2}=

*k*

^{2}=

*ijk*=−1, and forming the quaternion algebra.

Therefore, *B* will be composed by three 4D combined sets corresponding to the three connectivity domains: *CL*, *DL*, and *TDL*.

By using volume rendering, it is possible to study two-dimensional and three-dimensional sections through *B*. To create the 3D volume, we fix one of the four coordinates: \(\operatorname{Re}({c_{1}})\), \(\operatorname{Im}({c_{1}})\), \(\operatorname{Re}({c_{2}})\), or \(\operatorname{Im}({c_{2}})\), this being equivalent to slicing the four-dimensional body *B* with a hyperplane, for example, \(\operatorname{Re}(c_{1})=\mathrm{const}\). Similarly, one obtains different three-dimensional sections by slicing with other hyperplanes, noting that these hyperplanes could be at arbitrary angles to the coordinate axes. If we fix two coordinates, for example \(\operatorname{Re} ({c_{1}})= {k_{1}}\) and \(\operatorname{Im} ({c_{1}}) = {k_{2}}\), with *k*_{1} and *k*_{2} some real constants (there are 6 possible choices for two-dimensional slices \((\operatorname{Re}(c_{1}),\operatorname{Im}(c_{1}))\), \((\operatorname{Re}(c_{1}),\operatorname{Im}(c_{2}))\), and so on) one obtain two-dimensional images.

Volume rendering requires a discrete, finite, and generally regular sampling within a rectangularly bounded region. Therefore, in order to obtain an acceptable resolution of the main structures, the three-dimensional bodies were evaluated in a cubic region defined by the coordinates (−2,−2,−2,) to (2,2,2).

The volumes are sampled such that three different values are assigned to the three regions *CL*, *DL*, and *TDL*. Volume visualization involves forming a mapping between the values at each position in the regular sampling and color/transparency. In the figures throughout this paper, the connected regions are assigned red, the disconnectedness regions blue, and the totally disconnectedness set (being a complement of the connectivity and disconnectivity sets in the considered 4D space) is made entirely transparent.

Volume rendering (see, e.g., [15]) is the process by which it is determined how this volume, consisting of red and blue solid regions and other transparent regions, would appear if it were a real/physical object.

In Fig. 1(b), an alternative visualization is achieved by projecting the connectivity set along the three orthogonal axes \(\operatorname{Im}({c_{1}})\), \(\operatorname{Im} ({c_{2}})\), and \(\operatorname{Re} ({c_{2}})\), respectively.

*B*can additionally be revealed by taking planar slices through the volume, moving the cutting plane along one of the axis (see Fig. 3 where, again, the case \(\operatorname{Re} ({c_{1}}) = 0\) has been illustrated, the successive planes being orthogonal to the axis \(\operatorname{Im}(c_{1})\)).

*A*(−0.8,0.2),

*B*(−0.4,0.2), and

*C*(0,0.2), chosen from

*DL*,

*CL*, and

*TDL*, respectively, generate disconnected, connected, and totally disconnected alternated Julia sets.

*i*=1,2, respectively.

### Remark 2

As can be seen in Fig. 1(b), there are some separated “parts” and “spots” outside of the 3D bodies, but this “disconnectedness” phenomenon is probably due to the limited resolution at which the volume is sampled. Therefore, by using a higher resolution volume sampling (e.g., distance estimators for points near \(\mathcal{M}\) set [5]) these apparently disconnected parts would be shown to be linked to the set.

## 4 Graphical properties of the connectivity sets of alternated Julia sets

The disconnectedness and totally disconnectedness subbodies are unbounded while the connectedness subbodies are bounded (see, e.g., Figs. 1(b) and 2);

There exist typical symmetries like rotational symmetry, symmetry about origin or about one of the axis (see Fig. 5);

There are planar sections, where

*CL*or*DL*may have the shape of the \(\mathcal{M}\) set, or Mandelbrot-like sets (“Multibrot” sets), which correspond to the iterator*z*^{4}+*c*(see, e.g., the first column in Fig. 5 for \(\operatorname{Re}(c_{1})=0\)).

*c*for which each corresponding standard Julia set is connected. Beside this property, by locking to the “ends” of the three-dimensional slices through

*B*in Fig. 2, the first and last rows in Fig. 5, or in Figs. 6, 7, we can deduce the following new property.

### Property 1

*There are two*-*dimensional slices through**B**where the set of all parameter values for which each corresponding alternated Julia set is disconnected is the*\(\mathcal{M}\)*set or*, *at least*, *a set resembling a Mandelbrot set*.

Another example is presented in Fig. 5, where in the first image in the first column, obtained by sectioning the body corresponding to \(\operatorname{Im}(c_{1})=0\), with *c*_{1}=−1.1+*i*0, indicates that sets for which the alternated Julia sets are disconnected, are \(\mathcal{M}\) sets. In the last image of the first column (corresponding to the same body), one can see that \(\mathcal{M}\) corresponds either to connected alternated Julia sets (red color) or to disconnected Julia sets (blue) (see also Fig. 7).

## 5 Conclusion

In this paper, we determined numerically and drew via computer graphics the connectivity loci of the alternated Julia sets introduced in [1] and it appears that, the alternated Julia sets agree with a general form of Fatou–Julia theorem. Thus, the alternated Julia sets can be connected, disconnected, or totally disconnected.

Moreover, we verified visually some other new properties, the most important being that the \(\mathcal{M}\) set represents the set of all points in the complex plane for which the alternated Julia sets are disconnected (but not totally disconnected).

Therefore, even though this work does not substitute for the underlying proof, it could represent a guide for future research.

## Footnotes

- 1.
Intuitively, a

*totally disconnected*set is a set, which can be broken into two pieces at each of its points, the breakpoint being always “in between” the original set while if a set can be separated into two open and disjoint sets such that neither set is empty and both sets combined give the original set, then the set is called*disconnected*. A set which is not disconnected is*connected*.

## Notes

### Acknowledgements

We thank Robert L. Devaney and Bodil Branner for their useful comments, which helped us to understand better the connectivity aspects presented in [1].

We thank the reviewers for their valuable comments, which helped to considerably improve the quality of the manuscript.

The work was supported by iVEC through the use of advanced computing resources located at the University of Western Australia. The volume rendering is performed using Drishti, a “Volume Exploration and Presentation Tool” developed by Ajay Limaye at the Australia National University [16].

### References

- 1.Danca, M.-F., Romera, M., Pastor, G.: Alternated Julia sets and connectivity properties. Int. J. Bifurc. Chaos
**19**, 2123–2129 (2009) MathSciNetMATHCrossRefGoogle Scholar - 2.Almeida, J., Peralta-Salas, D., Romera, M.: Can two chaotic systems give rise to order? Physica D
**200**, 124–132 (2005) MathSciNetMATHCrossRefGoogle Scholar - 3.Romera, M., Small, M., Danca, M.-F.: Deterministic and random synthesis of discrete chaos. Appl. Math. Comput.
**192**, 283–297 (2007) MathSciNetMATHCrossRefGoogle Scholar - 4.Danca, M.-F., Romera, M., Pastor, G., Montoya, F.: Finding attractors of continuous-time systems by parameter switching. Nonlinear Dyn.
**67**, 2317–2342 (2012) MathSciNetMATHCrossRefGoogle Scholar - 5.Peitgen, H.-O., Saupe, D.: The Science of Fractal Images, p. 198. Springer, New York (1988) MATHGoogle Scholar
- 6.Mandelbrot, B.B.: The Fractal Geometry of Nature. Freeman, New York (1977) Google Scholar
- 7.Fatou, P.: Bull. Sur les équations fonctionnelles. Bull. Soc. Math. Fr.
**47**, 161–271 (1919). Also in Bull. Soc. Math. Fr.**48**, 33–94, 208–314 (1920) MathSciNetMATHGoogle Scholar - 8.Julia, G.: FrMémoire sur l’itération des fonctions rationnelles. J. Math. Pures Appl.
**8**, 47–245 (1918) Google Scholar - 9.Blanchard, P., Devaney, R., Keen, L.: Complex dynamics and symbolic dynamics. In: Williams, S.G. (ed.) Symbolic Dynamics and Its Applications. Proc. Symp. Appl. Math., vol. 60, pp. 37–60 (2004) CrossRefGoogle Scholar
- 10.Branner, B., Hubbard, J.H.: Iteration of cubic polynomials. Part I: The global topology of parameter space. Acta Math.
**160**, 143–206 (1988) MathSciNetMATHCrossRefGoogle Scholar - 11.Branner, B., Hubbard, J.H.: Iteration of cubic polynomials. Part II: Patterns and parapatterns. Acta Math.
**169**, 229 (1992) MathSciNetMATHCrossRefGoogle Scholar - 12.Blanchard, P.: Disconnected Julia sets. In: Barnsley, M., Demko, S. (eds.) Chaotic Dynamics and Fractals, pp. 181–201. Academic Press, San Diego (1986) Google Scholar
- 13.Qiu, W., Yin, Y.: Proof of the Branner–Hubbard conjecture on Cantor Julia sets. Sci. China Ser. A
**52**, 45–65 (2009) MathSciNetMATHCrossRefGoogle Scholar - 14.Altmann, S.L.: Rotations, Quaternions, and Double Groups. Clarendon Press, Oxford (1986) MATHGoogle Scholar
- 15.Drebin, R.A., Carpenter, L., Hanrahan, P.: Volume rendering. In: Proceedings of the 15th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’88), vol. 22, pp. 65–74. ACM, New York (1988) CrossRefGoogle Scholar
- 16.Limaye, A.: Drishti: a volume exploration and presentation tool. In: Proceedings SPIE 8506, Developments in X-Ray Tomography VIII, 85060X (2012). http://proceedings.spiedigitallibrary.org/proceeding.aspx?articleid=1384273 Google Scholar