Chaotic Behavior of the Folding Map on the Equilateral Triangle

Similar documents
Chapter 23. Predicting Chaos The Shift Map and Symbolic Dynamics

B5.6 Nonlinear Systems

Invariant manifolds of the Bonhoeffer-van der Pol oscillator

PHY411 Lecture notes Part 5

Finding numerically Newhouse sinks near a homoclinic tangency and investigation of their chaotic transients. Takayuki Yamaguchi

arxiv: v1 [nlin.cd] 20 Jul 2010

Lesson 4: Non-fading Memory Nonlinearities

Introduction to Dynamical Systems Basic Concepts of Dynamics

The Homoclinic Tangle and Smale s Horseshoe Map

The Hausdorff measure of a Sierpinski-like fractal

Linear Algebra March 16, 2019

Periodic Sinks and Observable Chaos

DYNAMICAL SYSTEMS. I Clark: Robinson. Stability, Symbolic Dynamics, and Chaos. CRC Press Boca Raton Ann Arbor London Tokyo

Introduction to Applied Nonlinear Dynamical Systems and Chaos

COMPLEX DYNAMICS AND CHAOS CONTROL IN DUFFING-VAN DER POL EQUATION WITH TWO EXTERNAL PERIODIC FORCING TERMS

Dynamical Systems and Chaos Part I: Theoretical Techniques. Lecture 4: Discrete systems + Chaos. Ilya Potapov Mathematics Department, TUT Room TD325

11 Chaos in Continuous Dynamical Systems.

Dynamical Systems. Pierre N.V. Tu. An Introduction with Applications in Economics and Biology Second Revised and Enlarged Edition.

A MINIMAL 2-D QUADRATIC MAP WITH QUASI-PERIODIC ROUTE TO CHAOS

CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for DYNAMICAL SYSTEMS. COURSE CODES: TIF 155, FIM770GU, PhD

On the periodic logistic equation

FINAL PROJECT TOPICS MATH 399, SPRING αx 0 x < α(1 x)

Construction of Lyapunov functions by validated computation

Synchronization and control in small networks of chaotic electronic circuits

Dynamics of Modified Leslie-Gower Predator-Prey Model with Predator Harvesting

Nonlinear dynamics & chaos BECS

0 Sets and Induction. Sets

BIFURCATIONS AND CHAOS IN A PERIODICALLY FORCED PROTOTYPE ADAPTIVE CONTROL SYSTEM 1

Period-doubling cascades of a Silnikov equation

7 Planar systems of linear ODE

6.2 Brief review of fundamental concepts about chaotic systems

AMADEU DELSHAMS AND RAFAEL RAMíREZ-ROS

Mathematical Foundations of Neuroscience - Lecture 7. Bifurcations II.

BASINS OF ATTRACTION FOR TRIPLE LOGISTIC MAPS. 1. Introduction

On dynamical properties of multidimensional diffeomorphisms from Newhouse regions: I

Chaos in the Dynamics of the Family of Mappings f c (x) = x 2 x + c

Linear Algebra Review

Control and synchronization of Julia sets of the complex dissipative standard system

In Arnold s Mathematical Methods of Classical Mechanics (1), it

Sufficient conditions for a period incrementing big bang bifurcation in one-dimensional maps.

April 13, We now extend the structure of the horseshoe to more general kinds of invariant. x (v) λ n v.

EXACT DARK SOLITON, PERIODIC SOLUTIONS AND CHAOTIC DYNAMICS IN A PERTURBED GENERALIZED NONLINEAR SCHRODINGER EQUATION

The Existence of Chaos in the Lorenz System

Example Chaotic Maps (that you can analyze)

Symmetry Properties of Confined Convective States

34 th United States of America Mathematical Olympiad

UNIFORM SUBHARMONIC ORBITS FOR SITNIKOV PROBLEM

Constructing a chaotic system with any number of equilibria

TRIANGLE CENTERS DEFINED BY QUADRATIC POLYNOMIALS

On Riddled Sets and Bifurcations of Chaotic Attractors

One dimensional Maps

AN INTRODUCTION TO FRACTALS AND COMPLEXITY

The symmetric group R + :1! 2! 3! 1. R :1! 3! 2! 1.

A FRANKS LEMMA FOR CONVEX PLANAR BILLIARDS

SIMPLE CHAOTIC FLOWS WITH ONE STABLE EQUILIBRIUM

B5.6 Nonlinear Systems

Essential hyperbolicity versus homoclinic bifurcations. Global dynamics beyond uniform hyperbolicity, Beijing 2009 Sylvain Crovisier - Enrique Pujals

Approximating Chaotic Saddles for Delay Differential Equations

In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation.

ESTIMATES OF TOPOLOGICAL ENTROPY OF CONTINUOUS MAPS WITH APPLICATIONS

Co-existence of Regular and Chaotic Motions in the Gaussian Map

COUNTING AND SYMMETRY

Congruence. Chapter The Three Points Theorem

Example of a Blue Sky Catastrophe

The number of simple modules of a cellular algebra

Systems of Linear Equations

Solutions for Chapter Solutions for Chapter 17. Section 17.1 Exercises

The phenomenon: complex motion, unusual geometry

Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

AN INTRODUCTION TO FRACTALS AND COMPLEXITY

Entropy production for a class of inverse SRB measures

ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Functions

GROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION

MTH301 Calculus II Glossary For Final Term Exam Preparation

Math 314H EXAM I. 1. (28 points) The row reduced echelon form of the augmented matrix for the system. is the matrix

1 Overview. CS348a: Computer Graphics Handout #8 Geometric Modeling Original Handout #8 Stanford University Thursday, 15 October 1992

TWELVE LIMIT CYCLES IN A CUBIC ORDER PLANAR SYSTEM WITH Z 2 -SYMMETRY. P. Yu 1,2 and M. Han 1

Coupled Chaotic Fluctuations in a Model of International Trade and Innovation: Some Preliminary Results

THREE DIMENSIONAL SYSTEMS. Lecture 6: The Lorenz Equations

THE POINCARÉ RECURRENCE PROBLEM OF INVISCID INCOMPRESSIBLE FLUIDS

Recent new examples of hidden attractors

Available online at ScienceDirect. Procedia IUTAM 19 (2016 ) IUTAM Symposium Analytical Methods in Nonlinear Dynamics

Barcelona, Spain. RTBP, collinear points, periodic orbits, homoclinic orbits. Resumen

Are numerical studies of long term dynamics conclusive: the case of the Hénon map

3. Which of these numbers does not belong to the set of solutions of the inequality 4

MATH 614 Dynamical Systems and Chaos Lecture 24: Bifurcation theory in higher dimensions. The Hopf bifurcation.

DIHEDRAL GROUPS II KEITH CONRAD

WHAT IS A CHAOTIC ATTRACTOR?

Discrete Time Coupled Logistic Equations with Symmetric Dispersal

A Novel Three Dimension Autonomous Chaotic System with a Quadratic Exponential Nonlinear Term

TOPOLOGICAL ENTROPY FOR DIFFERENTIABLE MAPS OF INTERVALS

CHALMERS, GÖTEBORGS UNIVERSITET. EXAM for DYNAMICAL SYSTEMS. COURSE CODES: TIF 155, FIM770GU, PhD

Molecular Spectroscopy. January 24, 2008 Introduction to Group Theory and Molecular Groups

Singular Perturbations in the McMullen Domain

On low speed travelling waves of the Kuramoto-Sivashinsky equation.

Rings and Fields Theorems

Scott Taylor 1. EQUIVALENCE RELATIONS. Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that:

Corrections to Introduction to Topological Manifolds (First edition) by John M. Lee December 7, 2015

Torus Maps from Weak Coupling of Strong Resonances

2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.

Transcription:

9th IFAC Symposium on Nonlinear Control Systems Toulouse, France, September 4-6, 0 FrB.6 Chaotic Behavior of the Folding Map on the Equilateral Triangle Abstract Tetsuya Ishikawa and Tomohisa Hayakawa Department of Mechanical and Environmental Informatics Tokyo Institute of Technology, Tokyo 5-855, JAPAN hayakawa@mei.titech.ac.jp A In recent years, it becomes important to understand chaotic behaviors in order to analyze nonlinear dynamics because chaotic behavior can be observed in many models in the field of physics, biology, and so on. To understand chaotic behaviors, investigating mechanisms of chaos is necessary and it is meaningful to study simple models that shows chaotic behaviors. In this paper, we propose an extremely simple triangle folding map and show that the map has k-periodic points for any integer k, and show the map has sensitivity to initial conditions. Finally, we discuss the connection with the Sierpinski gasket and construct similar types of fractal geometry.. Introduction Chaotic behavior embedded in dynamical systems has been attracting huge attention in the field of nonlinear dynamical systems theory since 960s. 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 problem 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 observe 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 [,, to cite but a few (see also [ 5 and the references therein). In this paper, we propose a simple folding map for equilateral triangles that has sensitivity with respect to the initial conditions. Specifically, due to the symmetries that the equilateral triangle possess, we show that restricting the domain of the triangle through an equivalence relation reveals essential relationship of the folding map. Furthermore, we provide fixed point analysis and periodic point analysis associated with this mapping operation by sequentially partitioning the restricted domain. Finally, we discuss some connections of the folding map to the Sierpinski gasket, which is well known to be composed of self-homothetic triangles, This research was supported in part by the Aihara Innovative Mathematical Modelling Project, the Japan Society for the Promotion of Science (JSPS) through the Funding Program for World- Leading Innovative R&D on Science and Technology (FIRST Program), initiated by the Council for Science and Technology Policy (CSTP). L B L M M N N C Figure.: Operation of the folding for the equilateral triangle and propose a scheme to construct other interesting fractals by removing certain regions of the equilateral triangle.. Folding Map on the Equilateral Triangle Consider the equilateral triangle ABC. Let its domain be denoted byt and let the midpoints of the edges AB, BC, CA be denoted by L, M, N, respectively. Furthermore, consider the following simple folding operation (also see Figure.): [ Fold along NL and bring A to M. [ Fold along LM and bring B to N. [ Fold along MN and bring C to L. [4 Rotate LMN around its center byπ radian. [5 Enlarge LMN by double so that MNL coincides with ABC. Note that the triangle LMN in [4 is also equilateral and homothetic to the triangle ABC with the scale factor. After the folding operation above, the resulting triangle in[6 becomes identical to the equilateral triangle in[. We denote this folding operation [ [6 by F : T T. For example, the point P T shown in [ of Figure. is mapped by the function F to another point F(P) in [6. It is immediate that the mapf is surjective and injectivity is discussed below. Now, it is important to note that there are several variations of prescribing the operation from[4 to[5 in Figure. in order to define the surjective map from T to T. For example, by rotating the triangle LMN by π 6 radian, instead of π radian, counterclockwise (or clockwise), we can obtain a similar map to the original map T. Or, more easily, the triangle LMN in [4 can be flipped upsidedown to arrive at Copyright 0 IFAC 767

Figure.: Visualization of the mapping scheme for a given point Figure.: Equivalence relation [5 through which we can construct a surjective map from T to T. This commonality is due to the reflective and rotational symmetry that the equilateral triangles possess and it is preferable to characterize the map that describe the essential dynamics of the folding operation. The following notion precludes the ambiguity of the folding operation F. Definition. Equivalence relation ont. Consider the map F : T T defined by Figure.. Two points P,Q T are considered to be equivalent ifpis transformed to Q via rotation by π/ or 4π/ 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 equiv X {t T : t has the equivalence relation with a point inx}, () the equivalence set associated with the set X 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 other points (on the other symmetric axes) that have equivalence relation with it. Otherwise, a point on T has 5 other points that have equivalence relation to each other (see Figure., left). In any case, it is important to note that any pointp T has a unique point in D that has the equivalence relation with P, where the closed subsetd T is given by partitioningt with the three symmetric axes (Figure., 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 D, instead of the original equilateral tri- Figure.4: Domain D in the coordinate system (left) and its subdomains (right) angle T, and define a new map f : D D associated with the folding map F under the equivalence relation given by Definition.. Note that for a point R D, f(r) D has the equivalence relation with F(R) 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 oft be and, as shown in Figure.4 (left), let the center of the equilateral triangle is placed at the origin and 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. below. For the statement of the following results, let the domaind be further partitioned into the 4 identical closed subdomains D i, i = 0,,,, as given by Figure.4 (right), which are homothetic to the right triangled. Definition. Folding map for the equilateral triangle. For the point p = [x,y T in the closed domain D R, the folding map f : D D for the equilateral triangle is given by where f(p) f i (p), p D i, i = 0,,,, () f 0 (p) f (p) f (p) f (p) [ [ 0 x 0 y [ [ x y [ 0 + [ [ x y [ [ x y + +, () [ [, (4), (5). (6) Since each subdomain D i is defined as a closed set for all i = 0,,,, adjacent domains share the points on their boundaries. Note, however, that the map f defined in Definition. has no ambiguity in that when p (D i D j ) it follows thatf i (p) = f j (p) so that the pointpon the intersection of the domains is mapped to the same point in D. Henceforth, for a subset S D, f(s) denotes the set of pointsf(p),p D, which is also a subset ofd. Copyright 0 IFAC 768

E F D C A B Figure.: Definition of points A, B,..., F on the boundary D of the right triangle Figure 4.: Mapping of the whole partitioned domaind by f. Fixed Point and Periodic Point Analysis on the Boundary ofd In this section, we restrict our attention on the boundary D of the domain D and provide analysis in regards to the fixed points and the periodic points. Specifically, note that the folding mapf maps every point on D onto D. In other words, the set D is a positively invariant set with respect to f. For the analysis presented in this section, we define the mapf : D D as f (p) = f i (p), p (D i D), i = 0,,,, (7) wheref i ( ), i = 0,,,, are given by () (6). Theorem.. Consider the folding map f given by (7). For D, let A,B,...,F denote the points shown in Figure.. Then the mapf : D D satisfies the following properties. i) The k-times composite map f k has k fixed points on the edges A-B-E. ii) The k-times composite map f k has k fixed points on the edge E-A. iii) Thek-times composite mapf k hask+ fixed points on D. iv) The Lyapunov exponent of f is ln almost everywhere. 4. Extended Fixed Point and Periodic Point Analysis overd 4.. Geometric Interpretation of the Triangle Folding Map In this section, we provide characterization of the fixed and the periodic points of the folding map f over the domain D and compute the Lyapunov exponent of the map. As defined in Definition., the folding map f is composed of the operation such that any domaind i, i {0,,,}, is enlarged double and coincides with the domaind after certain operation of rotation and/or reflection. For example, f(d ) = D can be understood by looking at the operation shown in Figure 4.. This is due to the fact that the piecewise map f is affine with its subdomainsd i, i = 0,,,, are homothetic to D with the ratio /. In other words, the domain S that Figure 4.: Four subdomains that are mapped byf to D 0 satisfies f(s) = D is given by either D 0, D, D, or D. Furthermore, it can be observed that the finer domains each of which are mapped by f to D 0 are shown in Figure 4.. Each of these 4 finer domains is characterized as the 0th domain whered i is further partitioned into 4 smaller identical subdomains for i = 0,,, as for the case of D shown in Figure.4. Since each of these 4 smaller subdomains is mapped byf tod 0, it is mapped tod by the composite map f f. Now, it follows from the above analysis that each of the small 6 right triangles in Figure 4. is mapped by f = f f tod and this operation is understood as applying rotation and/or reflection, and magnification in an appropriate manner to the small right triangles. The above interpretation of the mapping operation turns out to be useful in understanding the successive mapping f f. In the following, we give mathematical representation of the partitioned domains and characterized the relationship between the partitioned domains and the mapf. Definition 4. Partitioning operation Π. For a closed right triangle E that is homothetic to D, the partitioning operationπ i,i = 0,,,, overe is defined as in Figure 4.. Definition 4. Sequentially partitioned set by a sequence. For a givenn N, consider the collection of finite sequences S n given by { } S n s = {s i } n i=0 : s i {0,,,}, i = 0,,...,n. (8) Then the subset D s, where s = {s 0,s,...,s n } S n, is Copyright 0 IFAC 769

4.. Periodic Points of the Triangle Folding Map The main result of this section is shown in Theorem 4. below. Figure 4.: Partitioning operationπ i over a right trianglee Theorem 4.. The k-times folding map f k : D D for the equilateral triangle has4 k fixed points. Corollary 4.. The number of k-periodic points associated with the folding mapf is given by N k = 4 k m M k N m, N = 4, () defined as Figure 4.4: Examples ford, D,D D s Π sn Π sn Π s0 (D). (9) For simplicity of exposition, we write D ij...k to denote D {i,j,...,k}. Remark 4.. According to this definition, the notationd i used in the previous sections stands ford {i}. Figure 4.4 shows several examples of the domains that are represented by the notation given by (9). Next, we define a left shift operation for the sequences. Definition 4. Left shift operation of sequences. For a given n N and the finite sequence s = {s 0,s,...,s n } S, let k N be k < n. The left shift operation for s is defined as the binary operation : S N S given by s i {s i,s i+,...,s n }. (0) This definition makes it possible to simply represent the folding map for the equilateral triangle. Theorem 4.. For a given n N and the finite sequence s = {s 0,s,...,s n } S, let k N be k < n. Then it follows that i) f k (D s ) = D s k, ii) f k (p) D s k,p D s. The result i) in Theorem 4. indicates the fact that applying the folding map f is equivalent to shifting left the subscript s of D s by, while ii) suggests that the mapped pointf k (p) ofp D byf k may be estimated. wherem k is the collection of divisors ofk except fork itself. Equivalently, the number of k-periodic solutions is given by N k /k. Theorem 4.. For every fixed point p D and every j N, there exists a finite sequence s S k such that p D rep(s,j), whererep(s,j) represents It is important to note that from the definition of the map given in Definition. every fixed point of f k is an unstable periodic points of f, where its inverse does not exist, so that it is in general difficult to determine these points. Using Theorem 4., however, it turns out that those fixed points can be easily identified with arbitrary accuracy. Specifically, when k =, for example, it follows that each of the domains D 000,D 00,...,D possesses fixed point in its domain. Furthermore, it follows from Theorem 4. that the fixed point in D ijk lies in a smaller domain D ijkijk. The domain D ijkijk, by definition, is a connected domain and the area ofd ijkijk can be made arbitrarily small by repeating the sequence ijk in the subscript. Thereby, the domain in which the fixed point is contained can be identified with arbitrary accuracy. Figure 4.5 shows the fixed points of the maps f,f,...,f 6. It is interesting to point out that the fix points of f k are likely to be placed on circles, especially for the case of largek. Finally, Figure 4.6 shows (some of) the periodic points for periods,, and 4. The groups of periodic points are differentiated by color so that the points in the same color belong to the same set of periodic points, among 4.. whichlyapunov the orderexponent of the periodic of the Folding sequences Map is designated by numeric numbers. Note that only sets of periodic points are visualized for the case off andf 4. The following theorem provides the Lyapunov exponent of the folding map for the equilateral triangle. Theorem 4.4. The Lyapunov exponent of the folding map f for the equilateral triangle isln almost everywhere. Theorem 4.5. First, note that the eigenvalues of the Jacobian matrices for f 0,f,f,f defined in Definition. are in their magnitude. Therefore, for every vector v on the unit circle as a initial point, the Lyapunov exponent λ(p, v) Copyright 0 IFAC 770

4 4 4 Figure 4.6:,, 4-periodic points Figure 4.5: fixed points of the mapsf,f,...,f 6 is given by λ(p,v) limsup N = limsup N N ln Df N (x)v N ln N v = ln, a.e., wheredf N (x) denotes the Jacobian matrixf N atx. 5. Triangle Folding Map and Sierpinski Gasket In the triangle folding scheme defined in Figure., assume that the new operation that the small equilateral triangle LMN is removed is added in the scheme before the operation[. [0 Remove the triangle LMN from ABC. Figure 5. shows the collection of initial points that are not taken off after the infinitely many repeated operation of[0 [5. This pictorial figure is widely known as the Sierpinski gasket which contain a fractal structure. In fact, Figure 5. depicts the sequence of removing the triangle areas and this evolution of geometry describes the way of construct the Sierpinski gasket. Using the triangle folding map being analyzed in the paper, the representation of Sierpinski gasket can be explained as follows: Since Sierpinski gasket has the rotational and the reflective symmetries, we restrict our attention on the domain D as indicated in Figure.. In this case, the removing operation [0 of the triangle LMN corresponds to removing the Figure 5.: Collection of initial points that are not taken off after the infinitely many repeated mappings off domaind fromd (recall Figure.4). Now, define D j,m rm { x D f m (x) D j }, () which indicates the domain from which a point is not mapped onto the domain D j after the mth operation of [0 [5. With this notation, the domain from which a point is never mapped onto the domain D j after arbitrary number of the operation is characterized by D j rm m=0 D j,m rm, () and hence the Sierpinski gasket is represented aseqv Drm. Note that we obtain the Sierpinski gasket from eqv Drm j with j =. It is worth investigating the equivalence relation of eqv Drm j for j = 0,,. Figure 5. shows the pictorial figures for each of the cases. 6. Conclusion We proposed a simple folding map associated with the equilateral triangle and provide analysis in terms of the selfhomothetic partitioning of the domain. Future works include the fixed point and periodic point analysis on the Sierpinski gasket. It is also worth 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 [ S. Smale, Diffeomorphisms with many periodic points. Columbia University, Dept. of Mathematics, 96. Copyright 0 IFAC 77

Figure 5.: Resulting pictorial figure after the operation of [0 [5 once (left), twice (center), and three times (right) Figure 5.: eqv Drm 0 (upper left), eqv D rm eqv Drm (lower left),eqv Drm (lower right) (upper right), [ S. Smale, The Mathemaics of Time: Essays on Dynamical Systems, Economic Processes and Related Topics. Springer- Varlag, 980. [ V. K. Melnikov, On the stability of the center for time periodic perturbations, Trans. Moscow Math., vol., pp. 57, 96. [4 J. Guckenheimer and P. Holmes, Nonlinear oscillations dynamical systems, and bifurcations of vector fields, J. Appl. Mech., vol. 5, 984. [5 A. Mielke, P. Holmes, and O. O Reilly, Cascades of homoclinic orbits to, and chaos near, a hamiltonian saddle-center, J. Dyn. Diff. Eqn., vol. 4, no., pp. 95 6, 99. Copyright 0 IFAC 77