1. Introduction
Julia set [
1], one of the most attractive fractal sets, is proposed by Gaston Julia when he studied the following complex quadratic polynomial
Since it was proposed, Julia set has attracted significant interests in the topics of property analysis [
2,
3,
4,
5], superior iteration [
6,
7,
8], time-delay [
9], control [
10,
11] and so forth. Due to its good explanation for lots of complicated phenomena, Julia set has also been widely applied in the fields of physics [
12], biology [
13], image cryptography [
14] and so on.
As mentioned in the research of [
15,
16], it may not be quite accurate to depict the evolution of the natural process mentioned above just by employing a unique system. In some cases, the alternated iterations can be used to have a better understanding of the natural process. In particular, for system (
1), Danca
et al. [
17,
18] proposed its alternated version as follows:
where
,
.
Based on the Fatou–Julia theorem [
19] (see Theorem 2), the Julia set (see Definition 1) generated from
, which is denoted as
, can be connected, disconnected and totally disconnected via choosing different parameters
[
17]. To test numerically which values of the parameters
give rise to connected, disconnected, or totally disconnected
, the auxiliary complex quadratic polynomial
was proposed in [
17]:
where
. Furthermore, they proved that the Julia sets generated from
and
are the same with given
. Thus the connectivity of
relies on the critical orbits of system (
3). In [
18], the graphical results of the connectivity loci which represent the three connectivity states of the corresponding
were unveiled by analyzing the critical orbits of (
3). In concrete terms, the fractal sets which represent the connected, disconnected, totally disconnected Julia sets were respectively denoted as the Connectedness–Locus, Disconnectedness–Locus and Totally connectedness–Locus [
17,
18]. Based on these graphical results, some observations about the boundedness and symmetry properties of these connectivity loci were summarized in Section 4 of [
18]. These unproved properties are just the original purpose and the starting point of this article.
Actually, there has been some research on the boundedness and symmetry properties for the fractal sets of complex maps which have only one critical point (see the classical M-J sets [
2,
20,
21] and the generalized M-J sets [
4,
22,
23]). For the systems like (
3) which have more than one critical point, the results mainly focused on the properties of their Julia sets (see the Julia sets of cubic polynomials [
3] and the superior Julia set [
6]). To our knowledge, few research papers have addressed the problems about the boundedness and symmetry properties of their connectivity loci (or Mandelbrot set) since all the critical orbits should be considered.
Thus, as a supplementary research of [
17,
18], the purpose and achievement of this paper are no other than giving the mathematical proof about the two properties of the Connectedness–Locus and the Julia sets generated from (
2) via analyzing all the critical orbits of system (
3).
The remainder of this paper is outlined as follows.
Section 2 recalls some definitions and theorems about the alternated complex map. In
Section 3, the boundedness properties of the alternated Julia sets and the Connectedness–Locus are proposed and proved. In
Section 4, the symmetry properties of the 3-D slice of Connectedness–Locus and the alternated Julia sets are analyzed in two theorems. Simulations are given to support the validity of the results. Finally,
Section 5 concludes the paper.
2. The Fractal Sets Generated from Alternated Complex Map
In this section, some necessary definitions and theorems are recalled and given.
Definition 1. [17] The filled Julia set of the system (2), denoted as , is the set of all the values of initial conditions such thatwhere represents the n-th iteration of the initial point . The Julia set of which is the boundary of the filled Julia set is denoted as Theorem 1. [17,18] and are the same for given and parameter values. Theorem 2. [19] The connectivity properties of the Julia set for a complex polynomial of degree can be identified based on the following cases:The Julia set is connected if and only if all the critical orbits are bounded.
The Julia set is totally disconnected, a cantor set, if (but not only if) all the critical orbits are unbounded.
For a polynomial with at least one critical orbit unbounded, the Julia set is totally disconnected if and only if all the bounded critical orbits are aperiodic.
Then from Theorem 1 and Theorem 2, the connectivity of the
or
(
J and
K have the same connectivity properties [
18]) relies on the boundedness of the three critical points of
:
. The following definition is given.
Definition 2. [18] The Connectedness-Locus of the alternated complex map (2), denoted as , is composed by all the initial constant such that the orbits of 0 and are bounded (since behave the same boundedness properties). In [
17,
18],
is named as “Connectedness–Locus” or “Connected zone”. The reason we denote it as
in this paper is that it has the same efficacy with the classical Mandelbrot set [
20] which gives rise to the connectedness property. Thus, in this paper, we could also call
the Mandelbrot-efficacy set.
As shown in Definition 2,
is formed by the initial constants
, which illustrates that it belongs to a four-dimensional space
. By fixing
, the 3-D slice of
is shown in
Figure 1a (also see the red part of
Figure 1 in [
18]). The internal slice of
with
is revealed in
Figure 1b. The partial enlarged views of
Figure 1b are successively shown in
Figure 1c,d which fully display the beautiful and complex fractal structure of
.
Figure 1.
(a) The 3-D slice of Mandelbrot-efficacy set: ; (b) The 2-D slice of with ; (c,d) The partial enlarged views of .
Figure 1.
(a) The 3-D slice of Mandelbrot-efficacy set: ; (b) The 2-D slice of with ; (c,d) The partial enlarged views of .
The Julia sets
with different parameters
A and
B which are located in
Figure 1d are shown in
Figure 2. It can be seen that
is connected with
but disconnected with
.
Figure 2.
(
a)
with
(A in
Figure 1d); (
b)
with
(B in
Figure 1d).
Figure 2.
(
a)
with
(A in
Figure 1d); (
b)
with
(B in
Figure 1d).
3. Boundedness of the Fractal Sets Generated from Alternated Complex Map
In this section, by analysing the orbits of the three critical points of system (
3), the boundedness properties of
and
are given in the next two theorems.
Theorem 3. where R is the real root of the complex equation .
(Solution of R is based on the Cardan’s formula [24]). Proof. If
such that
, one can get
Since
when
, there exists a
such that
Then,
, one gets
Finally, one can get when . Then from Definition 1, one knows that As , the theorem is obtained. ☐
Theorem 4. where R is the same as Theorem 3.
Proof. Derive the
in Theorem 3 into three cases as follows:
(①): For case ①, one knows that
and
, the orbit of the critical value 0 satisfies that
Then, satisfies the condition of Theorem 3, it is clear that the orbit of 0 is diverging.
(②): For case ②, one knows that
and
, the orbit of the critical value
satisfies that:
Thus, satisfies the condition of Theorem 3, one can know that the orbit of is diverging.
Taken together, for all the three critical values, their orbits are bounded only when (case ③). From Definition 2, one gets: ☐
Remark 1. When , system (2) becomes the classical map (1). The complex equation in Theorem 3 becomes .
Then Theorem 3 becomes:
Theorem 4 becomes:
and mean the Julia set and Mandelbrot set of . The conclusions in this remark are consistent with the classical results [20]. 4. Symmetry of the Fractal Sets Generated from Alternated Complex Map
Symmetry [
2,
4,
23] is an important property of fractal sets. This section focuses on the symmetry properties of the Julia set
and the 3-D slice of the Mandelbrot-efficacy set
. The following two theorems are given and proved.
Theorem 5. The Mandelbrot-efficacy set is symmetric around the -plane.
Proof. For the critical points
, we give them a unitary expression
. Then by choosing any two parameters values
the orbits of all the three critical points
preserve complex conjugacy when
. That is:
Thus, the critical orbits behave the same boundedness property by choosing any two parameters which are symmetric around the -plane. Then, based on Definition 2, the two parts of divided by the -plane are symmetric. ☐
It is illustrated in
Figure 3 that the 2-D slices
have the same morphological structure with
. The simulations verify the validity of the Theorem 5.
Figure 3.
(a) and (b) and (c) and
Figure 3.
(a) and (b) and (c) and
Theorem 6. The Julia set is centrally symmetric around the origin.
Proof. When are given, one gets a corresponding Julia set. For any two initial points and , they map to the same .
Thus for any two points which are centrally symmetric around the origin, their orbits behave the same boundedness properties. From Definition 1, one knows that is centrally symmetric around the origin. ☐
With the help of the graphical method proposed in [
18], we supplement the Disconnectedness-Locus (gray zone) and the Totally disconnectedness-Locus (white zone) to
. Then three different points are picked out and their corresponding filled Julia sets are shown in
Figure 4.
The simulations of both
Figure 4 and
Figure 2 verify the correctness of Theorem 6.
Figure 4.
(
a–
c) The connectivity loci of system (
2) and its partial enlarged views; (
d) Connected
with
0.09,
(D point in (
c)); (
e) Disconnected
with
0.096,
(E point); (
f) Totally disconnected
with
0.098,
(F point).
Figure 4.
(
a–
c) The connectivity loci of system (
2) and its partial enlarged views; (
d) Connected
with
0.09,
(D point in (
c)); (
e) Disconnected
with
0.096,
(E point); (
f) Totally disconnected
with
0.098,
(F point).