Abstract
In recent years, it becomes important to understand chaotic behaviors of nonlinear dynamical systems in order to analyze nonlinear dynamics because chaotic phenomena can be observed in many models in the field of physics, biology, and engineering. To understand chaotic behaviors, investigating some key mechanisms of chaos is necessary and it is essential to investigate simple models that exhibit chaotic behaviors. In this article, we propose an extremely simple triangle folding map and show that the triangle folding map has k-periodic points for any integer k. Furthermore, we observe that the triangle folding map has sensitivity to initial conditions. Finally, we modify the way of folding the triangle to generalize the mapping in folding and expanding procedures to include some bifurcation parameters.
Access provided by Autonomous University of Puebla. Download chapter PDF
Similar content being viewed by others
Keywords
1 Introduction
Chaotic behavior embedded in dynamical systems has been attracting huge attention in the field of nonlinear dynamical systems theory since 1960s. Wide variety of results have also been reported concerning chaotic systems in many areas such as fundamental field of physics and biology as well.
One of the major objectives of investigating chaos is to elucidate the mechanism of generating chaotic behavior. A mathematical approach to address analysis problems of chaotic systems is to observe simple nonlinear dynamics and find key factors that give rise to chaos. The simplicity of the nonlinear models to consider is central in obtaining better understanding of complicated behaviors. Notable examples of such relatively simple dynamic models are the logistic map, the tent map, the Horseshoe map [12, 13], to cite but a few (see also [1–5, 7–9, 11] and the references therein).
In our earlier paper [6], we considered a simple folding map for equilateral triangles (which we call the triangle folding map) that has sensitivity with respect to the initial conditions. The operation is shown in Fig. 7.1 and defined by the the following procedure:
-
[1]
Fold along NL and bring A to M.
-
[2]
Fold along LM and bring B to N.
-
[3]
Fold along MN and bring C to L.
-
[4]
Rotate LMN around its center by \(\pi \) radian.
-
[5]
Enlarge LMN by double so that MNL coincides with ABC.
Specifically, we provided fixed point analysis and periodic point analysis associated with this mapping operation by sequentially partitioning a restricted domain. Furthermore, we discussed some connections of the folding map to the Sierpinski gasket, which is well known to be composed of self-homothetic triangles, and proposed a scheme to construct other interesting fractals by removing certain regions of the equilateral triangle.
In this article, we introduce a bifurcation parameter for the folding angle and generalize this triangle folding map so that the operation in [6] reduces to a special case of the new map. In particular, we call the operation the orthogonally projective triangle folding map and provide a similar analysis given in [6] in terms of the fixed points. We note that the preliminary results of this article can be found in [10].
2 Orthogonally Projective Triangle Folding Map
For the orthogonally projective triangle folding map, consider the equilateral triangle ABC given by [4] in Fig. 7.1. In order to introduce the bifurcation parameter in the folding operation, let \(\theta \) be the folding angle in operation [2] and [3] in Fig. 7.1 and the sequence of operation is given by Fig. 7.2.
After the folding operation above, the resulting triangle in [5] becomes identical to the equilateral triangle in [1]. We denote this folding operation [1]–[5] by \(F:\fancyscript{T}\rightarrow \fancyscript{T}\). For example, the point \(\mathrm {P} \in \fancyscript{T}\) shown in [1] of Fig. 7.3 is mapped by the function \(F\) to another point \(F(\mathrm {P})\) in [5]. For the case where the folding angle \(\theta \) is small, i.e., \(\cos ^{-1} \frac{1}{3} < \theta < \displaystyle {\frac{\pi }{2}}\), the operation is shown in Fig. 7.4. Note that the operation given by Fig. 7.1 corresponds to the case of \(\theta =0\). It is immediate that the map \(F\) is surjective as discussed below.
Now, it is important to note that there are several variations of prescribing the operation from [3] to [4] in Fig. 7.2 in order to define the surjective map from \(\fancyscript{T}\) to \(\fancyscript{T}\). For example, by rotating the triangle by \(\frac{\pi }{6}\) radian, instead of \(\pi \) radian, counterclockwise (or clockwise), we can obtain a similar map to the original map \(\fancyscript{T}\). Or, more easily, the triangle in [3] can be flipped upside down to arrive at [4] through which we can construct a surjective map from \(\fancyscript{T}\) to \(\fancyscript{T}\). This commonality is due to the reflective and the rotational symmetry that the equilateral triangles possess and it is preferable to characterize the map that describes the essential dynamics of the folding operation. The following notion precludes the ambiguity of the operation \(F\).
Definition 7.1
(Equivalence relation on \(\fancyscript{T}\)) Consider the map \(F:\fancyscript{T}\rightarrow \fancyscript{T}\) defined by Fig. 7.2. Two points \(\mathrm {P,Q} \in \fancyscript{T}\) are considered to be equivalent if \(\mathrm {P}\) is transformed to \(\mathrm {Q}\) via rotation by \(2\pi /3\) or \(4\pi /3\) radians, or reflection with respect to the symmetric axis of the equilateral triangle, or the combination of the rotation and the reflection. Specifically, we denote by
the equivalence set associated with the set \(\fancyscript{X} \subset \fancyscript{T}\).
Note that the center of the equilateral triangle has its equivalence relation with itself, and any point on the symmetric axis (except for the center) has 2 other points (on the other symmetric axes) that have equivalence relation with it. Otherwise, a point on \(\fancyscript{T}\) has 5 other points that have equivalence relation to each other (see Fig. 7.5, left). In any case, it is important to note that any point \(\mathrm {P} \in \fancyscript{T}\) has a unique point in \(\fancyscript{D}\) that has the equivalence relation with \(\mathrm {P}\), where the closed subset \(\fancyscript{D} \subset \fancyscript{T}\) is given by partitioning \(\fancyscript{T}\) with the three symmetric axes (Fig. 7.5, right). Note that the 6 partitioned sets are right triangles and are all identical to each other in the shape and the size so that the choice of the partitioned set is not important.
Now, from the analysis above, we restrict the domain and the codomain into \(\fancyscript{D}\), instead of the original equilateral triangle \(\fancyscript{T}\), and define a new map \(f:\fancyscript{D}\rightarrow \fancyscript{D}\) associated with the folding map \(F\) under the equivalence relation given by Definition 7.1. Note that for a point \(\mathrm {R} \in \fancyscript{D}\), \(f(\mathrm {R}) \in \fancyscript{D}\) has the equivalence relation with \(F(\mathrm {R}) \in \fancyscript{T}\).
In order to describe the map \(f\) more clearly, we define the \(x\)-\(y\) coordinate system to the triangle. Specifically, let the length of the edges of \(\fancyscript{T}\) be \(2\sqrt{3}\) and, as shown in Fig. 7.6, let the center of the equilateral triangle be placed at the origin, and let the bottom edge be parallel to the \(x\)-axis. In this case, the map \(f\) is described by a piecewise affine function given in Definition 7.2 below.
For the statement of the following results, let the domain \(\fancyscript{D}\) be further partitioned into the 4 closed subdomains \(\fancyscript{D}_i\), \(i=0,1,2,3\), for the case of \(0\le \theta < \cos ^{-1} \frac{1}{3}\) as given by Fig. 7.7 (left) and the 2 closed subdomains \(\fancyscript{D}_i\), \(i=2,3\), for the case of \(\cos ^{-1} \displaystyle {\frac{1}{3}} < \theta < \displaystyle {\frac{\pi }{2}}\) as given by Fig. 7.7 (right).
Definition 7.2
(Orthogonally projective triangle folding map) For the point \(p = [x,y]^\mathrm {T}\) in the closed domain \(\fancyscript{D} \subset \mathbb {R}^2\), the folding map \(f^\theta :\fancyscript{D}\rightarrow \fancyscript{D}\) for the equilateral triangle is given by
where
Since each subdomain \(\fancyscript{D}_i^\theta \) is defined as a closed set for all \(i=0,1,2,3\), adjacent domains share the points on their boundaries. Note, however, that the map \(f^\theta \) defined in Definition 7.2 has no ambiguity in that when \(p \in (\fancyscript{D}_i^\theta \cap \fancyscript{D}_j^\theta )\) it follows that \(f_i^\theta (p) = f_j^\theta (p)\) so that the point \(p\) on the intersection of the domains is mapped to the same point in \(\fancyscript{D}\).
Henceforth, for a subset \(S \subset \fancyscript{D}\), \(f^\theta (S)\) denotes the set of points \(f(p)\), \(p\in \fancyscript{D}\), which is also a subset of \(\fancyscript{D}\).
3 Tetrahedron Map
In this section, we consider the special case of the orthogonally projective triangle folding map. Specifically, consider the map \(f^\theta \) for the case of \(\theta = \cos ^{-1} \frac{1}{3}\). This value is the critical value for the expression of the piecewise affine function and the folding in [2] of Fig. 7.3 is characterized by the tetrahedron as shown in Fig. 7.8.
For this specialized map, we write \(f^\bigtriangleup \) to denote \(f^{\cos ^{-1} \frac{1}{3}}\).
Definition 7.3
(Tetrahedron map) For the point \(p = [x,y]^\mathrm {T}\) in the closed domain \(\fancyscript{D} \subset \mathbb {R}^2\), the tetrahedron map \(f^\bigtriangleup :\fancyscript{D}\rightarrow \fancyscript{D}\) for the equilateral triangle is given by
where
3.1 Fixed Point and Periodic Point Analysis on the Boundary of \(\fancyscript{D}\)
In this section, we restrict our attention on the boundary \(\partial \fancyscript{D}\) of the domain \(\fancyscript{D}\) and provide analysis in regards to the fixed points and the periodic points. Specifically, note that the folding map \(f\) maps every point on \(\partial \fancyscript{D}\) onto \(\partial \fancyscript{D}\). In other words, the set \(\partial \fancyscript{D}\) is a positively invariant set with respect to \(f\).
For the analysis presented in this section, we define the map \(f_\partial ^\triangle :\partial \fancyscript{D}\rightarrow \partial \fancyscript{D}\) as
where \(f_i^\triangle (\cdot )\), \(i=2,3\), are given by (7.4). Furthermore, for the statement of the following result, let the points A, B, C, D be placed on the boundary of \(\fancyscript{D}\) as shown in Fig. 7.9.
Theorem 7.1
Consider the tetrahedron map \(f_\partial ^\triangle \) given by (7.4). For \(\partial \fancyscript{D}\), let \(\mathrm {A},\mathrm {B},\mathrm {C},\mathrm {D}\) denote the points shown in Fig. 7.9. Then the map \(f_\partial ^\triangle :\partial \fancyscript{D}\rightarrow \partial \fancyscript{D}\) satisfies the following properties:
-
1.
For \(k\) even, the \(k\)-times composite map \((f_\partial ^\triangle )^k\) has \(2^{k/2}\) fixed points on the edge A-B.
-
2.
For \(k\) even, the \(k\)-times composite map \((f_\partial ^\triangle )^k\) has \(2^{k/2}\) fixed points on the edge B-D.
-
3.
For \(k\) even, the \(k\)-times composite map \((f_\partial ^\triangle )^k\) has \(2^{k/2+1}-1\) fixed points on \(\partial \fancyscript{D}\).
-
4.
For \(k\) odd, the \(k\)-times composite map \((f_\partial ^\triangle )^k\) has a unique fixed point on \(\partial \fancyscript{D}\), which is the vertex B.
Proof
The results can be shown from the relationship given in Fig. 7.10 where \(f_\partial \) is surjective from \(\partial \fancyscript{D}\) to \(\partial \fancyscript{D}\).\(\square \)
4 Extended Fixed Point and Periodic Point Analysis for Tetrahedron Map
4.1 Geometric Interpretation of the Triangle Folding Map
In this section, we provide characterization of the fixed and the periodic points of the tetrahedron map \(f^\triangle \) over the domain \(\fancyscript{D}\) and compute the Lyapunov exponent of the map. In the following, we give mathematical representation of the partitioned domains and characterize the relationship between the partitioned domains and the map \(f^\triangle \).
Definition 7.4
(Sequentially partitioned set by a sequence) For a given \(k \in \mathbb {N}\), consider the collection of finite sequences \(\fancyscript{S}_k\) given by
Then the subset \(\fancyscript{D}_s\), where \(s = \{ s_0, s_1, \ldots , s_{k-1} \} \in \fancyscript{S}_k\), is defined as
For simplicity of exposition, we write \(\fancyscript{D}_{ij{\ldots }k}\) to denote \(\fancyscript{D}_{\{i, j,\ldots ,k\}}\).
Consider the partitioned domains for the map \((f^\triangle )^2\). Note that \(f^\triangle \) maps \(\fancyscript{D}_2\) and \(\fancyscript{D}_3\) to \(\fancyscript{D}\) (see Fig. 7.11).
In other words, by taking the inverse map in Fig. 7.11, we can characterize the partitioned domains for the map \((f^\triangle )^2\), which are shown in Fig. 7.12.
In a similar manner, it is possible to characterize the partitioned domains for the map \((f^\triangle )^k\) by applying the similar procedure [1] in Fig. 7.12 to the partitioned domains for the map \((f^\triangle )^{k-1}\). As an example, the partitioned domains for the map \((f^\triangle )^3\) is shown in Fig. 7.13.
In summary, the partitioned domains for \(f^\bigtriangleup \), \((f^\bigtriangleup )^2\), \((f^\bigtriangleup )^3\), \((f^\bigtriangleup )^4\) are shown in Fig. 7.14.
Remark 7.1
According to this definition, the notation \(\fancyscript{D}_i\) used in the previous sections stands for \(\fancyscript{D}_{\{i\}}\).
Definition 7.5
Let \(k,l \in \mathbb {Z}^+\) and let \(u = \left\{ u_0, u_1, \ldots , u_{k-1} \right\} \in \fancyscript{S}_k\) and \(v = \left\{ v_0, v_1, \ldots , v_{l-1} \right\} \in \fancyscript{S}_l\). Then the operation \(\oplus :\fancyscript{S}_k \times \fancyscript{S}_l \rightarrow \fancyscript{S}_{k+l}\) is defined as
Theorem 7.2
For any \(s \in \fancyscript{S}_k\), \(k \in \mathbb {Z}^{+}\), it follows that
Next, we define a left shift operation for the sequence \(s\).
Definition 7.6
( Left shift operation of sequences) For a given \(k\in \mathbb {N}\) and the finite sequence \(s = \{ s_0, s_1, \ldots , s_{k-1} \} \in \fancyscript{S}\), let \(i\in \mathbb {N}\) be \(i<k\). The left shift operation for \(s\) is defined as the binary operation \(\ll \, : \fancyscript{S} \times \mathbb {N} \rightarrow \fancyscript{S}\) given by
This definition makes it possible to simply represent the tetrahedron map for the equilateral triangle.
Theorem 7.3
For a given \(k\in \mathbb {N}\) and the finite sequence \(s = \{ s_0, s_1, \ldots , s_{k-1} \} \in \fancyscript{S}\), let \(i\in \mathbb {N}\) be \(i<k\). Then it follows that
-
1.
\((f^\triangle )^{i} \left( D_s \right) = D_{s \ll i}\),
-
2.
\((f^\triangle )^{i}(p) \in \fancyscript{D}_{s \ll i}\), \(p \in \fancyscript{D}_s\).
Proof
We show the case of \(i=1\) in (i) because the result of (i) can be shown by applying the case of \(i=1\) and the result of (ii) is immediate from (i).
Note from Definition 7.4 that
Note that \(f^\triangle (\fancyscript{D}_{s_0}) = \fancyscript{D}\) for every \(s_0 \in \{ 2, 3 \}\). Hence, it follows that
which completes the proof.\(\square \)
The result (i) in Theorem 7.3 indicates the fact that applying the tetrahedron map \(f\) is equivalent to shifting left the subscript \(s\) of \(\fancyscript{D}_s\) by 1, while (ii) suggests that the mapped point \((f^\triangle )^k(p)\) of \(p\in \fancyscript{D}\) by \((f^\triangle )^k\) may be estimated.
Theorem 7.4
(Grey code property) Let \(k \in \mathbb {Z}^+\). For the partitioned domains \(\fancyscript{D}_s\) and \(\fancyscript{D}_{s'}\) for the map \((f^\triangle )^k\) with \(s' = \left\{ s'_0, s'_1, \ldots , s'_{k-1} \right\} \in \fancyscript{S}_k\), there exists \(0 \le \alpha \le k-1\) such that
Proof
The result is proven by invoking induction.\(\square \)
4.2 Periodic Points of the Tetrahedron Map
The main result of this section is shown in Theorems 7.5 and 7.6 below. Before stating the result, we need to provide several preliminary lemmas.
Lemma 7.1
Let \(g^\triangle \) denote \((f^\triangle )^k\). Then, for any \(s \in \fancyscript{S}_k\), \(k \in \mathbb {Z}^{+}\), the map \(g_{\mathrm {dom}(\fancyscript{D}_s)}^\triangle \) is bijective.
Lemma 7.2
Let \(l \in \mathbb {Z}\) and \(k \in \mathbb {Z}^{+}\) be such that \(k\) is even and \(0 \le l \le k\), and let \(s = \left\{ s_0, s_1, \ldots , s_{k-1} \right\} \in \fancyscript{S}_k\). Then it follows that
Theorem 7.5
The \(k\)-times tetrahedron map \((f^\triangle )^k:\fancyscript{D}\rightarrow \fancyscript{D}\) has a unique fixed point on \(\fancyscript{D}_s\), \(s \in \fancyscript{S}_k\), \(k \in \mathbb {Z}^{+}\).
Proof
The fixed point of the map \((f^\triangle )^k\) on \(\fancyscript{D}_s\) can be obtained by solving the equation \(g^\bigtriangleup = (f^\bigtriangleup )^k (p) = p\) or, equivalently,
Now, since
it follows that (7.14) has a unique solution \(p\).\(\square \)
Lemma 7.3
Let \(p\) be the fixed point for \((f^\triangle )^k\). Then there do not exist two distinct sequences \(\alpha \) and \(\beta \) of length \(k\) such that \(p \in \fancyscript{D}_\alpha \) and \(p \in \fancyscript{D}_\beta \).
Theorem 7.6
The map \((f^\triangle )^k\) possesses \(2^k\) fixed points on \(\fancyscript{D}\).
Proof
It follows from Theorem 7.5 and Lemma 7.3 that \((f^\triangle )^k\) possesses a fixed point on the boundary or the interior of \(\fancyscript{D}_s\). Note that these fixed points are not shared by 2 different domains. Hence, the number of fixed points is equal to the number of the partitioned domains.\(\square \)
4.3 Chaos by the Tetrahedron Map
In this section, we show that the tetrahedron map exhibits chaotic behavior.
Theorem 7.7
The tetrahedron map \(f^\triangle :\fancyscript{D}\rightarrow \fancyscript{D}\) is topologically transitive on \(\fancyscript{D}\) and possesses dense periodic points on \(\fancyscript{D}\).
Hence, the tetrahedron map \(f^\triangle \) exhibits chaotic behavior on \(\fancyscript{D}\).
Figure 7.15 shows the partitioned domains and the corresponding fixed points for \(f^\bigtriangleup \), \((f^\bigtriangleup )^2\), \((f^\bigtriangleup )^3\), \((f^\bigtriangleup )^4\).
Theorem 7.8
Let \(k \in \mathbb {Z}^+\) and let \(i \le k\) be an integer. Furthermore, define the circular function \(\mathrm{Circ}^k_i:\fancyscript{S}^k\rightarrow \fancyscript{S}^k\) given by
Then there exists \(s \in \fancyscript{S}_k\) such that
where \(x_s\) denotes a fixed point for the map \((f^\bigtriangleup )^k\).
Proof
It suffices to show \(f^\bigtriangleup (x_s) = x_{\mathrm{Circ}^k_1 (s)}\). For any \(s = \left\{ s_0, s_1, \ldots ,s_{k-1} \right\} \in \fancyscript{S}_k\), it follows that
and hence
On the other hand, it follows that for \(x_{\mathrm{Circ}^k_1 (s)}\),
By comparing the above two equations, we obtain
and hence \(f^\bigtriangleup (x_s) = x_{\mathrm{Circ}^k_1 (s)}\).\(\square \)
Corollary 7.1
The number \(T_k\) of periodic orbits with the fundamental period \(k\) is given by \(T_1=2\) and
Figure 7.16 shows the periodic orbits of period 1, 2, 3, and 4.
5 Conclusion
In this article, we proposed a simple folding map associated with the equilateral triangle and provided intensive analysis for the case where the folding leads to form the tetrahedron. Specifically, we showed that each partitioned domain possesses a unique fixed point for the map \((f^\triangle )^k\) and the labels of the domains satisfy the grey code property. Furthermore, we showed that when \(\theta \) is less than the value of \(\cos ^{-1}\frac{1}{3}\), the \(f^\triangle \) exhibits chaotic behavior in the sense of Devaney. Future works include investigating the connections and the differences between the folding map and the well-known horseshoe map, which also has the notion of ‘folding’ in its operation.
References
Amaral, G.F.V., Letellier, C., Aguirre, L.A.: Piecewise affine models of chaotic attractors: the Rossler and Lorenz systems. Interdisc. J. Nonlinear Sci., Chaos 16 (2006)
Chen, G., Yu, X.: Chaos Control: Theory and Applications. Springer, Berlin (2003)
Devaney, R.: An Introduction to Chaotic Dynamical Systems. Addison-Wesley Studies in Nonlinearity. Westview Press, Reading (2003)
Guckenheimer, J., Holmes, P.: Nonlinear oscillations dynamical systems, and bifurcations of vector fields. J. Appl. Mech. 51 (1984)
Guckenheimer, J., Holmes, P.: Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields. Springer, New York (1983)
Ishikawa, T., Hayakawa, T.: Chaotic behavior of the folding map on the equilateral triangle. In: Proc. Sympo. Nonlin. Contr. Syst., 767–772 (2013)
May, R.M.: Simple mathematical models with very complicated dynamics. Nature 261(5560), 459–467 (1976)
Melnikov, V.K.: On the stability of the center for time periodic perturbations. Trans. Moscow Math. 12, 1–57 (1963)
Mielke, A., Holmes, P., O’Reilly, O.: Cascades of homoclinic orbits to, and chaos near, a hamiltonian saddle-center. J. Dyn. Diff. Eqn. 4(1), 95–126 (1992)
Nishimura, J., Hayakawa, T.: Chaotic dynamics of orthogonally projective triangle folding map. In: Proc. IEEE Conf. Dec. Contr., 813–815 (2014)
Robinson, C.: Dynamical Systems: Stability, Symbolic Dynamics, and Chaos. CRC Press, Boca Raton (1998)
Smale, S.: Diffeomorphisms With Many Periodic Points. Department of Mathematics, Columbia University, New York (1963)
Smale, S.: The Mathematics of Time: Essays on Dynamical Systems. Economic Processes and Related Topics. Springer, New York (1980)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Japan
About this chapter
Cite this chapter
Nishimura, J., Hayakawa, T. (2015). Chaotic Behavior of Orthogonally Projective Triangle Folding Map. In: Aihara, K., Imura, Ji., Ueta, T. (eds) Analysis and Control of Complex Dynamical Systems. Mathematics for Industry, vol 7. Springer, Tokyo. https://doi.org/10.1007/978-4-431-55013-6_7
Download citation
DOI: https://doi.org/10.1007/978-4-431-55013-6_7
Published:
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-55012-9
Online ISBN: 978-4-431-55013-6
eBook Packages: EngineeringEngineering (R0)