Logistic Map f(x) = x(1 x) is Topologically Conjugate to the Map f(x) =(2 ) x(1 x)

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

ONE DIMENSIONAL CHAOTIC DYNAMICAL SYSTEMS

PERIODIC POINTS OF THE FAMILY OF TENT MAPS

Solutions to homework assignment #7 Math 119B UC Davis, Spring for 1 r 4. Furthermore, the derivative of the logistic map is. L r(x) = r(1 2x).

NONLINEAR DYNAMICS PHYS 471 & PHYS 571

ON TRIANGULAR AND BAKER f S MAPS WITH GOLDEN MEAN AS THE PARAMETER VALUE

A Note on the Generalized Shift Map

Study the dynamics of the nonspreading Airy packets from the time evolution operator

Oscillations in Damped Driven Pendulum: A Chaotic System

Faà di Bruno s Formula and Nonhyperbolic Fixed Points of One-Dimensional Maps

MS 2001: Test 1 B Solutions

Devaney's Chaos of One Parameter Family. of Semi-triangular Maps

L Enseignement Mathématique, t. 40 (1994), p AN ERGODIC ADDING MACHINE ON THE CANTOR SET. by Peter COLLAS and David KLEIN

LINEAR CHAOS? Nathan S. Feldman

2. THE FUNDAMENTAL THEOREM: n\n(n)

CHAOTIC UNIMODAL AND BIMODAL MAPS

Introduction to Dynamical Systems Basic Concepts of Dynamics

Lectures on Periodic Orbits

WHAT IS A CHAOTIC ATTRACTOR?

Turbulence and Devaney s Chaos in Interval

Number of limit cycles of the Liénard equation

3.4. ZEROS OF POLYNOMIAL FUNCTIONS

FAÀ DI BRUNO S FORMULA AND NONHYPERBOLIC FIXED POINTS OF ONE-DIMENSIONAL MAPS

Minimum Polynomials of Linear Transformations

Core Mathematics 3 Algebra

Li- Yorke Chaos in Product Dynamical Systems

arxiv: v3 [nlin.ao] 3 Aug 2013

Nonlinear Dynamics. Moreno Marzolla Dip. di Informatica Scienza e Ingegneria (DISI) Università di Bologna.

INVESTIGATION OF CHAOTICITY OF THE GENERALIZED SHIFT MAP UNDER A NEW DEFINITION OF CHAOS AND COMPARE WITH SHIFT MAP

Function Junction: Homework Examples from ACE

Mathematic 108, Fall 2015: Solutions to assignment #7

(x + 1)(x 2) = 4. x

PHY411 Lecture notes Part 5

One dimensional Maps

Example Chaotic Maps (that you can analyze)

Chaotic Properties of the Elementary Cellular Automaton Rule 40 in Wolfram s Class I

Chaotic Subsystem Come From Glider E 3 of CA Rule 110

7x 5 x 2 x + 2. = 7x 5. (x + 1)(x 2). 4 x

UNCOUNTABLE ω-limit SETS WITH ISOLATED POINTS

arxiv: v1 [math.ds] 17 Nov 2015

Local corrections of discriminant bounds and small degree extensions of quadratic base fields

Math 142 (Summer 2018) Business Calculus 5.8 Notes

THE GOLDEN MEAN SHIFT IS THE SET OF 3x + 1 ITINERARIES

Math 354 Transition graphs and subshifts November 26, 2014

Course Name: MAT 135 Spring 2017 Master Course Code: N/A. ALEKS Course: Intermediate Algebra Instructor: Master Templates

Complicated dynamics from simple functions

Chapter 2. Polynomial and Rational Functions. 2.6 Rational Functions and Their Graphs. Copyright 2014, 2010, 2007 Pearson Education, Inc.

Topological conjugacy and symbolic dynamics

Polynomial Interpolation

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

Unit 2, Ongoing Activity, Little Black Book of Algebra II Properties

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

Review questions for Math 111 final. Please SHOW your WORK to receive full credit Final Test is based on 150 points

From Determinism to Stochasticity

8.3 Partial Fraction Decomposition

RELAXATION AND TRANSIENTS IN A TIME-DEPENDENT LOGISTIC MAP

NON-MONOTONICITY HEIGHT OF PM FUNCTIONS ON INTERVAL. 1. Introduction

Solution to Homework #5 Roy Malka 1. Questions 2,3,4 of Homework #5 of M. Cross class. dv (x) dx

DO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED.

ME DYNAMICAL SYSTEMS SPRING SEMESTER 2009

Section 6.6 Evaluating Polynomial Functions

SCHOOL OF DISTANCE EDUCATION

Chaos and Cryptography

CHAPTER 2 FEIGENBAUM UNIVERSALITY IN 1-DIMENSIONAL NONLINEAR ALGEBRAIC MAPS

Reference Material /Formulas for Pre-Calculus CP/ H Summer Packet

Synchronization and Bifurcation Analysis in Coupled Networks of Discrete-Time Systems

PERIODICITY AND INDECOMPOSABILITY

Algebra Review 2. 1 Fields. A field is an extension of the concept of a group.

Factors of Polynomials Factoring For Experts

On the periodic logistic equation

Chapter 7 Polynomial Functions. Factoring Review. We will talk about 3 Types: ALWAYS FACTOR OUT FIRST! Ex 2: Factor x x + 64

16 Period doubling route to chaos

SF2729 GROUPS AND RINGS LECTURE NOTES

Dynamical Systems and Ergodic Theory PhD Exam Spring Topics: Topological Dynamics Definitions and basic results about the following for maps and

Random linear systems and simulation

Quartic Equation. By CH vd Westhuizen A unique Solution assuming Complex roots. Ax^4 + Bx^3 + Cx^2 + Dx + E = 0

Institute of Computer Science

An Undergraduate s Guide to the Hartman-Grobman and Poincaré-Bendixon Theorems

Chemical Kinetics and the Rössler System. 1 Introduction. 2 The NH 3 - HCl reaction. Dynamics at the Horsetooth Volume 2, 2010.

Prelim Examination 2010 / 2011 (Assessing Units 1 & 2) MATHEMATICS. Advanced Higher Grade. Time allowed - 2 hours

6x 2 8x + 5 ) = 12x 8

Chapter 3 Higher Order Linear ODEs

1.4 The Jacobian of a map

Lesson 7.1 Polynomial Degree and Finite Differences

Experience in Factoring Large Integers Using Quadratic Sieve

Handling of Chaos in Two Dimensional Discrete Maps

APPLYING SIGNED DISTANCE METHOD FOR FUZZY INVENTORY WITHOUT BACKORDER. Huey-Ming Lee 1 and Lily Lin 2 1 Department of Information Management

DYNAMICAL PROPERTIES OF MONOTONE DENDRITE MAPS

Chapter 2 Overview: Introduction to Limits and Derivatives

f[x_, μ_] := 4. μ... Nest[f[#,...] &,...,...] Plot[{x, f[...]}, {x, 0, 1}, AspectRatio Equal]

An Exactly Solvable 3 Body Problem

Nonlinear Dynamics and Chaos Summer 2011

Algebra 2 Segment 1 Lesson Summary Notes

Application of Polynomial Interpolation in the Chinese Remainder Problem

Review 1. 1 Relations and Functions. Review Problems

Introduction The Fibonacci numbers are traditionally described as a sequence F. = 0 and τ τ 1. =. To obtain the Fibonacci numbers as a

The Basics: Twenty-Seven Problems

Eidul- Adha Break. Darul Arqam North Scope and Sequence Revised 6/01/18 8 th Algebra I. 1 st Quarter (41 Days)

Questions of autonomy

On new chaotic mappings in symbol space

Transcription:

Tamkang Journal of Science and Engineering, Vol. 10, No 1, pp. 8994 (2007) 89 Logistic Map f(x) =x(1 x) is Topologically Conjugate to the Map f(x) =(2) x(1 x) Chyi-Lung Lin* and Mon-Ling Shei Department of Physics, Soochow University, Taipei, Taiwan 111, R.O.C. Abstract We prove that the well-known logistic map, f(x) =x(1 x), is topologically conjugate to the map f(x)=(2) x(1 x). The logistic map thus has the same dynamics at parameter values and 2, and hence has the 2symmetry in dynamics. To examine this symmetry, we study the (, s) n relation of f n, which is obtained by eliminating x from the equations f n (x)=xand s = df n (x)/dx. We then obtain an equation directly relating and s for period-n point of f. We derive the (, s) n relation for period n = 1, 2, 3, and 4, and we show that the (, s) n relations are invariant under the transformation of 2. Key Words: Logistic Map, Topologically Conjugate, Symmetry, Invariant, Periodic Bifurcation 1. Introduction Logistic map is defined by f(x)=x(1 x), where is the parameter. For decades, several iterated functions have been extensively studied, and rich contents have been explored. Logistic map is one of the well-known maps, and has become a standard map for studying iteration. This map contains all the interesting subjects in non-linear dynamics; we list some references in [19]. In general, the values of x and of logistic map are restricted in the ranges, 0 x 1, 0 4so that each x in the interval [0, 1] is mapped onto the same interval [0, 1]. It is known that there is a stable fixed point x*=0in the range 0 1, and another stable fixed point x * 1 1 in the range 1 3. After that, we have pe- riod-doubling bifurcation at = 3, 3.4494897, 3.54409. These numerical results are well known and are easy *Corresponding author. E-mail: cllin@scu.edu.tw to reproduce on computer. However, it is a puzzle why we have two neighbor regions, 0 1 and 1 3, that each has a stable fixed point of f. According to Sharkovsky ordering [1], the appearance of the order of periods should be 1 2 4 8, but instead we now have 1 1 2 4 8. This seems the Sharkovsky ordering is slightly violated. However, it does not. If we extend the range of to include the part of < 0, we will find that period-doubling bifurcation also occurs in the region < 0, see Figure 1, where the abscissa is the -axis. We note that the parameter values at which bifurcations occur are symmetrical to = 1. That is we have two Sharkovsky orderings, one is in the region >1 and the other is in the region < 1. Figure 1, then gives the explanation why we see the ordering 1 1 2 4 8 in the region > 0. From the period-doubling bifurcation, we see that logistic map has symmetrical dynamics with respect to =1. We also list some of the numerical results on Table 1. The first column indicates the period-doubling bifurca-

90 Chyi-Lung Lin and Mon-Ling Shei Figure 1. The period doubling bifurcation diagram for the map f(x)= x(1 x), where is extended to the range <0. Table 1. The parameter values of the bifurcation from period 2 i to period 2 i+1 Bifurcation Parameter values at Bifurcation + ( >0) Parameter values at Bifurcation - ( <0) 1 2 3-1 2 1 2 2 1+ 6 1 6 3.44948974-1.44948974 2 2 2 3 3.54409036-1.54409036 2 3 2 4 3.56440727-1.56440727 2 4 2 5 3.56875942-1.56875942 2 5 2 6 3.56969161-1.56969161 2 6 2 7 3.56989126-1.56989126 2 7 2 8 3.56993402-1.56993402 tion from period-2 i to period-2 i+1. The second column is the corresponding values for the occurrence of bifurcation in the range > 0. We denote such by +. The third column is the values for the occurrence of bifurcation in the range < 0, and we denote such by -. We note that for each row on Table 1 we have + + - = 2. (1) Formula (1) means that if there were a period-doubling bifurcation occurring at a parameter value, then there is also a period-doubling bifurcation occurring at a parameter value 2. This shows that the map f(x)=x(1 x) has a symmetrical dynamics in parameter values and 2. Logistic map thus has the symmetry in replacing by 2. Or we say that logistic map is topologically conjugate to the map f(x)=(2) x(1 x). The logistic map is known to be conjugate to the following maps [1]: f(x)=(2)x x 2, f(x)=cx 2, f(x)= 1 cx 2. To our knowledge, it has not been discussed that the logistic map is conjugate to the map: f(x)=(2) x(1 x). We will prove this conjugacy in section 2. To examine the 2symmetry, we study the (, s) n relation, where is the parameter value that f n (x) has fixed points; that is f n (x)=x; and s is the slope of the function f n (x) calculated at the fixed point of f n (x). We study the (, s) n relation in sec. 3. We will show in sec. 4 and sec. 5. that all these (, s) n relations have the 2 symmetry. The (, s) n relation is important, as from which we can determine the range of having stable period-n points. The beginning of the appearance of period three is known to be at the parameter value 1 8. Strogatz [10] in his book said that this result is often mentioned but always without proof. Saha and he [11] then gave a derivation for that, using an elementary way, and would like to know a more elegant way of derivation. We give here another derivation of this result through the study of the (, s) n relation for n =3.

Logistic Map f(x) = x(1 x) is Topologically Conjugate to the Map f(x) = (2 ) x(1 x) 91 2. The Map g(x) =(2)x(1 x) is Topologically Conjugate to Logistic Map We are to prove that the map g(x)=(2)x(1 x)is topologically conjugate to logistic map f(x)=x(1 x). Mathematically, if two maps, f: A A and g: B B are topologically conjugate, then there is a homeomorphism h: A B such that hof= goh, where h(x) is a continuous, one-to-one function, and has an inverse. We may rewrite such topologically conjugate map g as: g = hofoh -1. (2) We thus need to find an h relating these two maps. We consider a linear conjugacy, h(x)=ax+ b, where a and b are to be properly chosen. With such an h(x), we have g = hofoh -1 = A + Bx+ Cx 2 b, with Ab( 1 ), a b B ( 1 2 ), andc 1. We Choose ba( 1), then a a we get A =0,andB =2. Choosing a, then we 2 have C = (2 ). And therefore we have the final result: g(x)=(2) x(1 x). (3) 1 Thus through the function hx ( ) x, the 2 2 map g(x) =(2)x(1 x) is shown to be topologically conjugate to logistic map f(x)=x(1 x). And hence logistic map has the symmetry in replacing by 2. Due to this symmetry, the whole contents of logistic map may only be studied in the range 1. We will examine this symmetry below in the determination of the range of that has stable periodic points. 3. The (, s) n Relation For notations, we write f 2 (x)=f(f(x)), the second iterate of x for f. And f n (x)=f(f n 1 (x)), the nth iterate of x for f. We say an x is a period-n point of f if f n (x) x = 0, and if in addition, x f i (x), where, i =1,2,,n-1. For period-n points, in general, we need to study the two equations: f n (x)=x, (4) s = df n (x)/dx. (5) Eq. (4) contains the relation of and the period-n point x. Eq. (5) defines the slope function of f n (x), and it relates the slope s to and x. If we eliminate the period-n point x from these two equations, we then obtain an equation directly relating and s, where is the parameter value at which the map f has period-n points, and s is slope of f n (x) calculated at the period-n point. We call this equation the (, s) n relation of f n (x). From the (, s) n relation, we can determine the value of s for a given, and we can therefore check whether there exists period-n points or not, depending on the value of s is real or not. The value of s might be complex due to that the period-n points x solved from (4) might be complex. Of course, if such an x is complex, it means this x is not a period-n point. If s is real, we can check the stability of the period-n points depending on whether the value of s is in the range -1 s 1. For stable period-n points, the slope s should be in the range -1 s 1. Taking this requirement to the (, s) n relation, we can determine the range of for the existence of stable period-n points. We show this in sections 4 and 5. If the number n in (4) is not a prime, then the equation f n (x) x = 0 contains also those points with smaller period m for which n is an integer. To determine truly period-n points, we need to exclude those shorter period m points from (4). For instance, if n = 6, then Eq. (4), f 6 (x) x = 0, contains points with periods: 1, 2, 3, and 6. To have six as the prime period of f, Eq. (4) should be replaced by the equation:

92 Chyi-Lung Lin and Mon-Ling Shei (f 6 (x) x)/(f 1 (x)f 2 (x)f 3 (x)) = 0, (6) of f 3 : where f 1 (x)=f(x) x, f 2 (x)=(f 2 (x) x)/(f(x) x), f 3 (x)= (f 3 (x) x)/(f(x) x). The division of f 1 (x) in (6) is to exclude the fixed points of f from the equation f 6 (x) x = 0. And the division of f 2 (x) is to exclude the prime period-2 points of f. We note that f 2 (x) contains only the prime period-2 points of f, that is, it has excluded the fixed points of f. Otherwise, we will do twice the elimination of fixed points of f. And the same, the division of f 3 (x) is to exclude the prime period-3 points of f from the equation f 6 (x) x = 0. Then the x in (6) is guaranteed to be a prime period-6 point, and won t be a fixed point, or a period-2 point, or a period-3 point of f. In the following sections, we show that the (, s) n relation has the symmetry of 2 and its applications. We consider n = 3 first, since period-3 is more interesting. 4. The (, s) n Relation of f 3 The parameter value for the birth of period 3 of logistic map is known to be at =1 8. Below we show how to derive this value through studying the (, s) n relation. The equation for period-3 of f is (f 3 (x) x)/(f(x) x) = 0. Expanding this equation, we obtain 6 6 5 6 5 4 5 6 4 x ( 3 ) x ( 4 3 ) x 3 4 5 6 3 2 3 4 5 2 ( 3 5 ) x ( 3 3 2 ) x 2 3 4 2 ( 2 2 ) x (1 ) 0 (7) For the slope equation of f 3 (x), we have s df 3 ( x)/ dx 7 7 7 6 6 7 5 8 x 28 x ( 12 36 ) x (30 20 ) x ( 4 4 24 4 ) x 6 7 4 4 5 6 7 3 4 5 6 2 3 4 5 3 (6 6 6 ) x ( 2 2 2 ) x (8) We use J. J. Sylvester method [12] to eliminate the x from Eqs. (7) and (8). We then obtain the (, s) n relation 6 5 4 3 2 6 4 24 ( 16 2 s) ( 32 4 s) 2 ( 6416 ss ) 0 (9) We can use (9) to determine the range of for the existence of stable period-3 points. Solving the s from (9), we obtain s 2 2 2 2 (8 2 ) 2 2 7 2 7 (10) From (10), we see that for s to be real, it needs 2 2 7 0, that is 1+ 8,or1 8. Therefore, in the range > 0, period-3 starts at = 1 8. We can also check that the values of x of period-3 points at this parameter value are all real. For stable period-3 points, it needs -1 s 1. Setting s = 1 in (9), we get only one value of that is real and positive; the value is =1+ 8 3.8284. Setting s = -1, we get 3.8415. Therefore stable period-3 points exist and only exist in the range 3.8248 3.8415. We can directly check that Eq. (9) is invariant under the transformation of 2. Or, it may be easier to see this symmetry by changing the valuable from to y = 1. Then (9) becomes 6 4 2 2 y y s y s s 11 (35 2 ) ( 18 89) 0 (11) Eq. (11) contains only even powers of y, and is thus obviously symmetrical to y and -y. Thus Eq. (9), the (, s) n relation for n = 3, reflects the 2symmetry of the logistic map. 5. The (, s) n Relation for Other Periodic Points 5.1 The (, s) n Relation of f The equation for fixed point is x(1 x) =x. The slope equation is s = (1 2x). From these two equations, and considering x 0, we easily obtain the (, s) relation

Logistic Map f(x) = x(1 x) is Topologically Conjugate to the Map f(x) = (2 ) x(1 x) 93 of f: or, (12) (13) From (13), Eq. (12) is obviously invariant under 2. From (12), we see that the stable fixed points, x* 0, exist in the range 1 3. 5.2 The (, s) n Relation of f 2 The equation for period-2 point is (f 2 (x) x)/(f(x) x) = 0. Together with the slope equation s = df 2 (x)/dx,we obtain the (, s) n relation of f 2 : or, 2 ( s 4) 0, (14) (15) From (15), Eq. (14) is thus invariant under 2. From (14), we see that stable period-2 points exist in the range 3 1 6 3. 44949. 5.3 The (, s) n Relation of f 4 The equation for period-4 point is (f 4 (x) x)/(f 2 (x) x) = 0. Together with the slope equation s = df 4 (x)/dx,we obtain the (, s) n relation of f 4 : or, 2 (2 ss ) 0 2 2 2 2 y ( s1) 0 2 2 y ( s5) 0 12 11 10 9 8 12 48 40 ( 192 s) 7 6 5 (384 8 s) (64 20 s) 8s ( 1024 48 ss ) ( 512 96s4 s ) 2 4 2 3 2 2 2 3 (2048 64s4 s ) (4096 768s48 s s ) 0, (16) 12 10 8 6 y 18 y (123 sy ) ( 524 8 sy ) (15112 ss ) y ( 1858 16s2 s ) y s s s 2 4 2 2 2 3 (4861 779 47 ) 0 (17) From (17), Eq. (16) is invariant under 2. From (16), we see that stable period-4 points exist in the range 3.44949 3.54409, and may also be in the range 3.9601 3.96077. Above examples all show that the (, s) n relation reflects the 2symmetry. The (, s) n relation of f n becomes complicated when n getting larger and larger, and is difficult to obtain. We hope that Eqs. (1217) may give some hints for obtaining the (, s) n relation for higher period of 2 n. This will be helpful for obtaining the Feigenbaum constant in an analytical form. Acknowledgments The first author would like to thank the National Science Council of the Republic of China for support. (NSC Grants No. 88-2112-M-031-001), and to Professor Pierre Collet for helpful discussions and suggesting the similarity transformation, and to Laboratoire de Physique Théorique et Haute Energies, Université Paris-Sud, France, for the hospitality received there, while he was a visitor there. References [1] Denny Gulick, Encounters with Chaos, Mc-Graw- Hill, Inc., p. 110 (1992). [2] Steven, H., Strogaze, Nonlinear Dynamics and Chaos, Addition-Wesley Publishing Company (1994). [3] Robert, L., Devaney, An Introduction to Chaotic Dynamical Systems, 2nd-Edition, Addison-Wesley Publishing Company (1989). [4] Robert, L., Devaney, A First Course in Chaotic Dynamical Systems Theory and Experiment, Addison- Wesley Publishing Company, The Advanced Book Program (1992). [5] Mitchell Feigenbaum, Quantitative Universality for a Class of Nonlinear Transformations, J. of Stat. Physics, Vol. 19, p. 25 (1978). [6] Mitchell Feigenbaum, The Universal Metric Prop-

94 Chyi-Lung Lin and Mon-Ling Shei erties of Nonlinear Transformations, J. of Stat. Physics., Vol. 1, p. 69 (1979). [7] Pierre Collet and Jean-Pierre Eckmann, Iterated Maps on The Interval As Dynamical Systems, Birkhauser Boston, (1980). [8] Edward Ott, Chaos in Dynamical Systems, Cambridge University Press (1993). [9] Alligood, K. T., Sauer, T. D. and Yorke, J. A., Chaos, Spring-Verlag, New York, Inc. (1997). [10] Ibid. 2, p. 363. [11] Saha, P. and Strogatz, S. H., The Birth of Period Three, Mathematics Magazine, Vol. 68, pp. 4347 (1995). [12] Hillman, A. P. and Alexanderson, G. L., Abstract Algebra, PWS Publishing Company, Boston, MA. U.S.A. (2000). Manuscript Received: May. 12, 2005 Accepted: Mar. 21, 2006