DOCSLIB.ORG

Chaotic Dynamics and Fractals

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Chaotic Dynamics and Fractals Chaotic Dynamics and Fractals Eric Kuennen February 10, 2005 Contents 1 Discrete Dynamics: Iteration and Types of Orbits. 2 2 Graphical Analysis, and Attracting and Repelling Fixed Points 6 3 The Quadratic Family and Bifurcations. 9 4 Transition to Chaos. 9 5 Symbolic Dynamics. 9 6 The Definition of Chaos. 9 7 Period 3 Theorem and Sarkovskii’s Theorem. 9 8 Fractals: Cantor set, Sierpinski Triangle, Koch Snowflake, fractal dimen- sion. 9 9 Create your own fractal: Iterated Function Systems. 9 10 Complex Dynamics, the Julia Set. 9 11 The Mandelbrot Set. 9 12 The Hen´on Map. 9 13 Strange Attractors. The Lorenz Attractor. 9 14 Smale’s Horseshoe and Homoclinic Tangles. 9 15 Fractal Growth Phenomena: Percolation, Diffusion-Limited Aggregation, Ballistic Deposition, Eden Clusters. 9 16 Fractal Growth Phenomena: Cellular Automata. 9 1 1 DISCRETE DYNAMICS: ITERATION AND TYPES OF ORBITS. 2 Primary Reference: A First Course in Chaotic Dynamical Systems , Robert Devaney, Addison-Wesley 1992 Secondary References: Fractals, Scaling, and Growth Far From Equilibrium. Peal Meakin, Cambridge University Press, 1998. Nonlinear Oscillations, Dynamic Systems, and Bifurcations of Vector Fields , J. Guck- enheimer and P. Holmes. Springer-Verlag New York Inc., 1983. 1 Discrete Dynamics: Iteration and Types of Orbits. We will study how functions behave under iteration. More specifically, we’ll look at what happens to a point z0 under repeated applications of some function f(z). Example. Let Pn represent the population of rabbits after n months. Suppose the population grows by 5% each month. Then Pn+1 = Pn +0.05Pn, or Pn+1 =1.05Pn. This is called a first-order difference equation. The solution to this difference equation will be an explicit formula for P which depends only on n and P0, the initial population of rabbits. To find the solution, we can iterate using the difference equation P +1 = 1.05P , starting with the initial population P0. P1 = 1.05P0, 2 P2 = 1.05P1 = (1.05) P0, : P = 1.05P ¡1 = (1.05) P0. Since what is going on is simply repeated multiplication by 1.05, let’s define f(x) = 1.05x. Then we can write the difference equation as P = f(P ¡1), and the solution to the difference equation as P = f (P0). 1 DISCRETE DYNAMICS: ITERATION AND TYPES OF ORBITS. 3 To iterate a function means to repeatedly compose the function with itself. Let f(z) represent some function of z. Then the second iterate of f is f 2(z) = f(f(z)), and the third iterate of f is f 3(z) = f(f 2(z)) = f(f(f(z))). In general, the n-th iterate of f is f (z) = f(f ¡1(z)) = f(f(f(f(....f(z))))), meaning f composed with itself n times. Example 1. Let f(z) = 3z2 1. Then − f 2(z) = 3(3z2 1)2 1 = 27z4 18z2 + 2, − − − and f 3(z) = 3(3(3z2 1)2 1)2 1 = 2187z8 2916z6 + 1296z4 216z2 + 11. − − − − − A formula for f 4(z) is left to the reader if desired. Note that f 2(z) does not mean [f(z)]2. The orbit of z0 under f is the following sequence of points: 2 z0, z1 = f(z0), z2 = f (z0), ..., z = f (z0), ... { } The starting point z0 is referred to as the initial condition or seed. Types of orbits. A fixed point for f is a point z0 such that f(z0) = z0. Note that 2 if z0 is a fixed point, then f (z0) = f(f(z0)) = f(z0) = z0, so a fixed point will produce an orbit of the form z0, z0, z0,...,z0, ... { } Fixed points for a function f(z) satisfy the equation f(z) = z, so they can be found by solving the equation f(z) = z. ¢ Examples. x = 1 is the only fixed point for f(x) = 3x + 2, and 1 3 are − 2 ± 2 the only two fixed points for f(x) = x2 + 1. As an exercise, find all the fixed points for f(x) = x2 + 1 and f(x) = x3 3x. − A periodic point for f with period n is a point z0 such that f (z0) = z0, for some n > 0, and i The smallest such n is called the prime period of the orbit, and orbit of z0 is 1 DISCRETE DYNAMICS: ITERATION AND TYPES OF ORBITS. 4 called a periodic orbit, or an n-cycle. If z0 is a periodic point with period n, then the orbit will look like the following: ¡ ¡1 1 z0, f(z0), ...,f (z0), z0, f(z0), ..., f (z0), z0, ... A point z0 can also be eventually fixed or eventually periodic if the orbit becomes fixed or periodic after some number of initial iterations. 2 Example. Consider f(z) = z 1. Then the orbit of z0 = 0 is the 2-cycle − 0, -1, 0, -1, 0, -1, 0, -1, 0, ... Example. Consider f(z) = iz. Then the orbit of z0 = 1 is the 4-cycle 1, i, -1, -i, 1, i, -1, -i, 1, ... ¢ 1 3 Example. Consider f(z)=( + i)z. Then the orbit of z0 = 2i is the 3-cycle − 2 2 2i, -√3 i, √3 i, 2i, -√3 i, √3 i, 2i, ... − − − − 2 Example. Consider f(z) = z . Then the orbit of z0 = i is eventually fixed: i, 1, 1, 1, 1, 1, ... − Typically, however, an orbit is not fixed or periodic, but will converge to, or be attracted by an fixed point or periodic orbit. It may be attracted to infinity, in which case the orbit is said to be unbounded. Sometimes, an orbit will never settle down to any pattern and behave quite chaotically. We will make more precise definitions and see examples of these behaviors later. Example: Finding Square Roots. To find the decimal representation of √2, we can make an initial guess for √2, and call this initial guess x0. If x0 < √2, then √2x0 < 2, 2 √ £ so 2 < 0 , so we have 2 x0 < √2 < . x0 If instead x0 > √2, we will end up with 2 x0 > √2 > . x0 2 √ £ So either way, 2 is between x0 and 0 . So for our next guess, why not try half-way between 2 x0 and £0 ? That is, let 1 2 x1 = (x0 + ) 2 x0 1 DISCRETE DYNAMICS: ITERATION AND TYPES OF ORBITS. 5 1 2 . As an exercise, iterate f(x) = 2 (x + £) starting with several different initial seeds x0 to observe the convergence of the orbit to a fixed point at √2. Which functions iterates will converge to √α? Exercise. Use a pocket calculator to find x50 if you begin with the initial condition £ x0 = 10 under the functions f(x) = √x, f(x) = e , f(x) = sin x and f(x) = cos x. In each case, what seems to happen to x as n ? → ∞ Let’s close this section with examples of two special functions. Example. The Doubling Function is defined on [0,1) as D(x) = 2x mod 1. That is, 2x for 0 x < 1/2 D(x) = ≤ 2x 1 for 1/2 x < 1 − ≤ Sketch a graph of the function D(x) on the interval [0,1). Discuss the behavior of D(x) for the following seeds: x0 = 1/3, x0 = 1/5, x0 = 1/7, Example. The Tent Function is defined on [0,1] as 2x for 0 x 1/2 T (x) = ≤ ≤ 2 2x for 1/2 x 1 − ≤ ≤ Find a formula for T 2(x). Sketch graphs of the functions T (x) and T 2(x) on the interval [0,1]. Find all fixed points for T (x) and T 2(x). 2 GRAPHICAL ANALYSIS, AND ATTRACTING AND REPELLING FIXED POINTS6 2 Graphical Analysis, and Attracting and Repelling Fixed Points Graphical analysis is a tool to help visualize orbits for functions of a single real variable f(x). First we note that the graphs of y = f(x) and y = x will intersect at the real fixed points for f(x). So we begin our graphical analysis by plotting y = f(x) and the diagonal y = x on the same axes. To sketch an orbit, we pick an initial condition x0, then find y0 = f(x0) by moving vertically to the graph of y = f(x). Then, to iterate we wish to let x1 = y0, that is, let the new x-value be the previous y-value. This is switching can be accomplished on the graph by moving horizontally to the diagonal. Then we begin again by moving vertically to the graph of y = f(x), then horizontally to the diagonal y = x, etc. Examples. On the plots below, use graphical analysis to analyze the orbits of f(x) = x3 and f(x) = x2 1.1. − Looking at f(x) = x3, from graphical analysis, we can see that f has three fixed points, at x = 0, 1, and 1. Orbits that begin inside the interval (-1,1) tend to the fixed point at − x = 0, while orbits outside of the interval [-1,1] tend to positive or negative infinity. We say that the fixed point at o is attracting, while the fixed points at 1 and -1 are repelling. Meanwhile, we can see that f(x) = x2 = 1.1 has two fixed points, at x .66 and ≈ − x 1.66. In both cases, orbits that begin the fixed point do not tend towards the fixed ≈ point, and so both are said to be repelling. However, in the case of the fixed point near x = .66, nearby orbits to not seem to be attracted to infinity. − An exellent web-based applet for making these ”cobweb” graphs is found at http://www.emporia.edu/math-cs/yanikjoe/Chaos/CobwebPlot.htm 2 GRAPHICAL ANALYSIS, AND ATTRACTING AND REPELLING FIXED POINTS7 A fixed point z0 is said to be an attracting fixed point for f if there is a neighborhood D of z0 such that if z D, then f (z) D for all n > 0, and in fact ∈ ∈ f (z) z0 as n .
Load more

Recommended publications
  • Fractal Growth on the Surface of a Planet and in Orbit Around It
    Wilfrid Laurier University Scholars Commons @ Laurier Physics and Computer Science Faculty Publications Physics and Computer Science 10-2014 Fractal Growth on the Surface of a Planet and in Orbit around It Ioannis Haranas Wilfrid Laurier University, [email protected] Ioannis Gkigkitzis East Carolina University, [email protected] Athanasios Alexiou Ionian University Follow this and additional works at: https://scholars.wlu.ca/phys_faculty Part of the Mathematics Commons, and the Physics Commons Recommended Citation Haranas, I., Gkigkitzis, I., Alexiou, A. Fractal Growth on the Surface of a Planet and in Orbit around it. Microgravity Sci. Technol. (2014) 26:313–325. DOI: 10.1007/s12217-014-9397-6 This Article is brought to you for free and open access by the Physics and Computer Science at Scholars Commons @ Laurier. It has been accepted for inclusion in Physics and Computer Science Faculty Publications by an authorized administrator of Scholars Commons @ Laurier. For more information, please contact [email protected]. 1 Fractal Growth on the Surface of a Planet and in Orbit around it 1Ioannis Haranas, 2Ioannis Gkigkitzis, 3Athanasios Alexiou 1Dept. of Physics and Astronomy, York University, 4700 Keele Street, Toronto, Ontario, M3J 1P3, Canada 2Departments of Mathematics and Biomedical Physics, East Carolina University, 124 Austin Building, East Fifth Street, Greenville, NC 27858-4353, USA 3Department of Informatics, Ionian University, Plateia Tsirigoti 7, Corfu, 49100, Greece Abstract: Fractals are defined as geometric shapes that exhibit symmetry of scale. This simply implies that fractal is a shape that it would still look the same even if somebody could zoom in on one of its parts an infinite number of times.
    [Show full text]
  • An Image Cryptography Using Henon Map and Arnold Cat Map
    International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395-0056 Volume: 05 Issue: 04 | Apr-2018 www.irjet.net p-ISSN: 2395-0072 An Image Cryptography using Henon Map and Arnold Cat Map. Pranjali Sankhe1, Shruti Pimple2, Surabhi Singh3, Anita Lahane4 1,2,3 UG Student VIII SEM, B.E., Computer Engg., RGIT, Mumbai, India 4Assistant Professor, Department of Computer Engg., RGIT, Mumbai, India ---------------------------------------------------------------------***--------------------------------------------------------------------- Abstract - In this digital world i.e. the transmission of non- 2. METHODOLOGY physical data that has been encoded digitally for the purpose of storage Security is a continuous process via which data can 2.1 HENON MAP be secured from several active and passive attacks. Encryption technique protects the confidentiality of a message or 1. The Henon map is a discrete time dynamic system information which is in the form of multimedia (text, image, introduces by michel henon. and video).In this paper, a new symmetric image encryption 2. The map depends on two parameters, a and b, which algorithm is proposed based on Henon’s chaotic system with for the classical Henon map have values of a = 1.4 and byte sequences applied with a novel approach of pixel shuffling b = 0.3. For the classical values the Henon map is of an image which results in an effective and efficient chaotic. For other values of a and b the map may be encryption of images. The Arnold Cat Map is a discrete system chaotic, intermittent, or converge to a periodic orbit. that stretches and folds its trajectories in phase space. Cryptography is the process of encryption and decryption of 3.
    [Show full text]
  • WHAT IS a CHAOTIC ATTRACTOR? 1. Introduction J. Yorke Coined the Word 'Chaos' As Applied to Deterministic Systems. R. Devane
    WHAT IS A CHAOTIC ATTRACTOR? CLARK ROBINSON Abstract. Devaney gave a mathematical definition of the term chaos, which had earlier been introduced by Yorke. We discuss issues involved in choosing the properties that characterize chaos. We also discuss how this term can be combined with the definition of an attractor. 1. Introduction J. Yorke coined the word `chaos' as applied to deterministic systems. R. Devaney gave the first mathematical definition for a map to be chaotic on the whole space where a map is defined. Since that time, there have been several different definitions of chaos which emphasize different aspects of the map. Some of these are more computable and others are more mathematical. See [9] a comparison of many of these definitions. There is probably no one best or correct definition of chaos. In this paper, we discuss what we feel is one of better mathematical definition. (It may not be as computable as some of the other definitions, e.g., the one by Alligood, Sauer, and Yorke.) Our definition is very similar to the one given by Martelli in [8] and [9]. We also combine the concepts of chaos and attractors and discuss chaotic attractors. 2. Basic definitions We start by giving the basic definitions needed to define a chaotic attractor. We give the definitions for a diffeomorphism (or map), but those for a system of differential equations are similar. The orbit of a point x∗ by F is the set O(x∗; F) = f Fi(x∗) : i 2 Z g. An invariant set for a diffeomorphism F is an set A in the domain such that F(A) = A.
    [Show full text]
  • MATH34042: Discrete Time Dynamical Systems David Broomhead (Based on Original Notes by James Montaldi) School of Mathematics, University of Manchester 2008/9
    MATH34042: Discrete Time Dynamical Systems David Broomhead (based on original notes by James Montaldi) School of Mathematics, University of Manchester 2008/9 Webpage: http://www.maths.manchester.ac.uk/∼dsb/Teaching/DynSys email: [email protected] Overview (2 lectures) Dynamical systems continuous/discrete; autonomous/non-autonomous. Iteration, orbit. Applica- tions (population dynamics, Newton’s method). A dynamical system is a map f : S S, and the set S is called the state space. Given an initial point x0 S, the orbit of x0 is the sequence x0,x1,x2,x3,... obtained by repeatedly applying f: ∈ → n x1 = f(x0), x2 = f(x1), x3 = f(x2),...,xn = f (x0), ... Basic question of dynamical systems: given x0, what is behaviour of orbit? Or, what is behaviour of most orbits? + + Example Let f : R R be given by f(x)= √x. Let x0 = 2. Then x1 = f(2)= √2 1.4142. And ≈ x = √2 1.1892 and x = √1.1892 1.0905. 2 p → 3 The orbit of≈2 therefore begins {2.0, 1.4142,≈ 1.1892, 1.0905, ...}. The orbit of 3 begins {3.0, 1.7321, 1.3161, 1.1472, ...}. The orbit of 0.5 begins {0.5, 0.7071, 0.8409, .9170, .9576, ...}. All are getting closer to 1. Regular dynamics fixed points, periodic points and orbits. Example f(x)= cos(x). Globally attracting fixed point at x = 0.739085 . ··· Chaotic dynamics Basic idea is unpredictability. There is no “typical’ behaviour. Example f(x)= 4x(1 − x), x [0,1]: Split the interval into two halves: L = [0, 1 ] and R = [ 1 ,1].
    [Show full text]
  • MA427 Ergodic Theory
    MA427 Ergodic Theory Course Notes (2012-13) 1 Introduction 1.1 Orbits Let X be a mathematical space. For example, X could be the unit interval [0; 1], a circle, a torus, or something far more complicated like a Cantor set. Let T : X ! X be a function that maps X into itself. Let x 2 X be a point. We can repeatedly apply the map T to the point x to obtain the sequence: fx; T (x);T (T (x));T (T (T (x))); : : : ; :::g: We will often write T n(x) = T (··· (T (T (x)))) (n times). The sequence of points x; T (x);T 2(x);::: is called the orbit of x. We think of applying the map T as the passage of time. Thus we think of T (x) as where the point x has moved to after time 1, T 2(x) is where the point x has moved to after time 2, etc. Some points x 2 X return to where they started. That is, T n(x) = x for some n > 1. We say that such a point x is periodic with period n. By way of contrast, points may move move densely around the space X. (A sequence is said to be dense if (loosely speaking) it comes arbitrarily close to every point of X.) If we take two points x; y of X that start very close then their orbits will initially be close. However, it often happens that in the long term their orbits move apart and indeed become dramatically different.
    [Show full text]
  • Attractors and Orbit-Flip Homoclinic Orbits for Star Flows
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 141, Number 8, August 2013, Pages 2783–2791 S 0002-9939(2013)11535-2 Article electronically published on April 12, 2013 ATTRACTORS AND ORBIT-FLIP HOMOCLINIC ORBITS FOR STAR FLOWS C. A. MORALES (Communicated by Bryna Kra) Abstract. We study star flows on closed 3-manifolds and prove that they either have a finite number of attractors or can be C1 approximated by vector fields with orbit-flip homoclinic orbits. 1. Introduction The notion of attractor deserves a fundamental place in the modern theory of dynamical systems. This assertion, supported by the nowadays classical theory of turbulence [27], is enlightened by the recent Palis conjecture [24] about the abun- dance of dynamical systems with finitely many attractors absorbing most positive trajectories. If confirmed, such a conjecture means the understanding of a great part of dynamical systems in the sense of their long-term behaviour. Here we attack a problem which goes straight to the Palis conjecture: The fini- tude of the number of attractors for a given dynamical system. Such a problem has been solved positively under certain circunstances. For instance, we have the work by Lopes [16], who, based upon early works by Ma˜n´e [18] and extending pre- vious ones by Liao [15] and Pliss [25], studied the structure of the C1 structural stable diffeomorphisms and proved the finitude of attractors for such diffeomor- phisms. His work was largely extended by Ma˜n´e himself in the celebrated solution of the C1 stability conjecture [17]. On the other hand, the Japanesse researchers S.
    [Show full text]
  • ORBIT EQUIVALENCE of ERGODIC GROUP ACTIONS These Are Partial Lecture Notes from a Topics Graduate Class Taught at UCSD in Fall 2
    1 ORBIT EQUIVALENCE OF ERGODIC GROUP ACTIONS ADRIAN IOANA These are partial lecture notes from a topics graduate class taught at UCSD in Fall 2019. 1. Group actions, equivalence relations and orbit equivalence 1.1. Standard spaces. A Borel space (X; BX ) is a pair consisting of a topological space X and its σ-algebra of Borel sets BX . If the topology on X can be chosen to the Polish (i.e., separable, metrizable and complete), then (X; BX ) is called a standard Borel space. For simplicity, we will omit the σ-algebra and write X instead of (X; BX ). If (X; BX ) and (Y; BY ) are Borel spaces, then a map θ : X ! Y is called a Borel isomorphism if it is a bijection and θ and θ−1 are Borel measurable. Note that a Borel bijection θ is automatically a Borel isomorphism (see [Ke95, Corollary 15.2]). Definition 1.1. A standard probability space is a measure space (X; BX ; µ), where (X; BX ) is a standard Borel space and µ : BX ! [0; 1] is a σ-additive measure with µ(X) = 1. For simplicity, we will write (X; µ) instead of (X; BX ; µ). If (X; µ) and (Y; ν) are standard probability spaces, a map θ : X ! Y is called a measure preserving (m.p.) isomorphism if it is a Borel isomorphism and −1 measure preserving: θ∗µ = ν, where θ∗µ(A) = µ(θ (A)), for any A 2 BY . Example 1.2. The following are standard probability spaces: (1) ([0; 1]; λ), where [0; 1] is endowed with the Euclidean topology and its Lebegue measure λ.
    [Show full text]
  • Efficient Method for Detection of Periodic Orbits in Chaotic Maps And
    Efficient Method for Detection of Periodic Orbits in Chaotic Maps and Flows A Thesis by Jonathan Crofts in partial fulfillment of the requirements for the degree of Doctor of Philosophy. Department of Mathematics University of Leicester March 2007. c Jonathan J Crofts, 2007. arXiv:0706.1940v2 [nlin.CD] 13 Jun 2007 Acknowledgements I would like to thank Ruslan Davidchack, my supervisor, for his many suggestions and constant support and understanding during this research. I am also thankful to Michael Tretyakov for his support and advice. Further, I would like to acknowledge my gratitude to the people from the Department of Mathematics at the University of Leicester for their help and support. Finally, I would like to thank my family and friends for their patience and sup- port throughout the past few years. In particular, I thank my wife Lisa and my daughter Ellen, without whom I would have completed this research far quicker, but somehow, it just would not have been the same. At this point I would also like to reassure Lisa that I will get a real job soon. Leicester, Leicestershire, UK Jonathan J. Crofts 31 March 2007 i Contents Abstract iv List of figures v List of tables vi 1 Introduction 1 1.1 History,theoryandapplications . 1 1.2 Periodicorbits............................... 3 1.2.1 Periodicorbittheory . 4 1.2.2 Efficient detection of UPOs . 6 1.3 Extendedsystems............................. 9 1.4 Anoteonnumerics............................ 10 1.4.1 Intervalarithmetic . 12 1.5 Overview.................................. 14 1.6 Thesisresults ............................... 16 2 Conventional techniques for detecting periodic orbits 18 2.1 Specialcases................................ 18 2.1.1 One-dimensionalmaps .
    [Show full text]
  • Infinitely Renormalizable Quadratic Polynomials 1
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 352, Number 11, Pages 5077{5091 S 0002-9947(00)02514-9 Article electronically published on July 12, 2000 INFINITELY RENORMALIZABLE QUADRATIC POLYNOMIALS YUNPING JIANG Abstract. We prove that the Julia set of a quadratic polynomial which ad- mits an infinite sequence of unbranched, simple renormalizations with complex bounds is locally connected. The method in this study is three-dimensional puzzles. 1. Introduction Let P (z)=z2 + c be a quadratic polynomial where z is a complex variable and c is a complex parameter. The filled-in Julia set K of P is, by definition, the set of points z which remain bounded under iterations of P .TheJulia set J of P is the boundary of K. A central problem in the study of the dynamical system generated by P is to understand the topology of a Julia set J, in particular, the local connectivity for a connected Julia set. A connected set J in the complex plane is said to be locally connected if for every point p in J and every neighborhood U of p there is a neighborhood V ⊆ U such that V \ J is connected. We first give the definition of renormalizability. A quadratic-like map F : U ! V is a holomorphic, proper, degree two branched cover map, whereT U and V are ⊂ 1 −n two domains isomorphic to a disc and U V .ThenKF = n=0 F (U)and JF = @KF are the filled-in Julia set and the Julia set of F , respectively. We only consider those quadratic-like maps whose Julia sets are connected.
    [Show full text]
  • 1D Dynamics: Symbolic Coding
    1D Dynamics: Symbolic Coding 1. Full shift of two symbols – Let X = {s =(s0s1s2 ··· si ··· ); si =0 or 1} be the collection of all sequences of 0 and 1. – For s =(s0s1 ··· si ··· ), t =(t0t1 ··· ti ··· ), let ∞ |s − t | d(s, t) = i i X i i=0 2 Claim: (i) (X,d) is a metric space. s t 1 (ii) d( , ) ≤ 2n iff si = ti for all i < n. Proof: (i) d(s, t) ≥ 0 and d(s, t) = d(t, s) are obvious. For the triangle inequality, observe ∞ ∞ ∞ |si − ti| |si − vi| |vi − ti| d(s, t) = ≤ + X 2i X 2i X 2i i=0 i=0 i=0 = d(s, v)+ d(v, t). (ii) is straight forward from definition. – Let σ : X → X be define by σ(s0s1 ··· si ··· )=(s1s2 ··· si+1 ··· ). Claim: σ : X → X is continuous. Proof: 1 For ε > 0 given let n be such that 2n < ε. Let 1 s t s t δ = 2n+1 . For d( , ) <δ, d(σ( ), σ( )) < ε. – (X,σ) as a dynamical system: Claim (a) σ : X → X have exactly 2n periodic points of period n. (b) Union of all periodic orbits are dense in X. (c) There exists a transitive orbit. Proof: (a) The number of periodic point in X is the same as the number of strings of 0, 1 of length n, which is 2n. (b) ∀s =(s0s1 · · · sn · · · ), let sn =(s0s1 · · · sn; s0s1 · · · sn; · · · ). We have 1 d(sn, s) < . 2n−1 So sn → s as n →∞. (c) List all possible strings of length 1, then of length 2, then of length 3, and so on.
    [Show full text]
  • Multiple Periodic Solutions and Fractal Attractors of Differential Equations with N-Valued Impulses
    mathematics Article Multiple Periodic Solutions and Fractal Attractors of Differential Equations with n-Valued Impulses Jan Andres Department of Mathematical Analysis and Applications of Mathematics, Faculty of Science, Palacký University, 17. listopadu 12, 771 46 Olomouc, Czech Republic; [email protected] Received: 10 September 2020; Accepted: 30 September 2020; Published: 3 October 2020 Abstract: Ordinary differential equations with n-valued impulses are examined via the associated Poincaré translation operators from three perspectives: (i) the lower estimate of the number of periodic solutions on the compact subsets of Euclidean spaces and, in particular, on tori; (ii) weakly locally stable (i.e., non-ejective in the sense of Browder) invariant sets; (iii) fractal attractors determined implicitly by the generating vector fields, jointly with Devaney’s chaos on these attractors of the related shift dynamical systems. For (i), the multiplicity criteria can be effectively expressed in terms of the Nielsen numbers of the impulsive maps. For (ii) and (iii), the invariant sets and attractors can be obtained as the fixed points of topologically conjugated operators to induced impulsive maps in the hyperspaces of the compact subsets of the original basic spaces, endowed with the Hausdorff metric. Five illustrative examples of the main theorems are supplied about multiple periodic solutions (Examples 1–3) and fractal attractors (Examples 4 and 5). Keywords: impulsive differential equations; n-valued maps; Hutchinson-Barnsley operators; multiple periodic solutions; topological fractals; Devaney’s chaos on attractors; Poincaré operators; Nielsen number MSC: 28A20; 34B37; 34C28; Secondary 34C25; 37C25; 58C06 1. Introduction The theory of impulsive differential equations and inclusions has been systematically developed (see e.g., the monographs [1–4], and the references therein), among other things, especially because of many practical applications (see e.g., References [1,4–11]).
    [Show full text]
  • Dynamical Systems and Ergodic Theory
    MATH36206 - MATHM6206 Dynamical Systems and Ergodic Theory Teaching Block 1, 2017/18 Lecturer: Prof. Alexander Gorodnik PART III: LECTURES 16{30 course web site: people.maths.bris.ac.uk/∼mazag/ds17/ Copyright c University of Bristol 2010 & 2016. This material is copyright of the University. It is provided exclusively for educational purposes at the University and is to be downloaded or copied for your private study only. Chapter 3 Ergodic Theory In this last part of our course we will introduce the main ideas and concepts in ergodic theory. Ergodic theory is a branch of dynamical systems which has strict connections with analysis and probability theory. The discrete dynamical systems f : X X studied in topological dynamics were continuous maps f on metric spaces X (or more in general, topological→ spaces). In ergodic theory, f : X X will be a measure-preserving map on a measure space X (we will see the corresponding definitions below).→ While the focus in topological dynamics was to understand the qualitative behavior (for example, periodicity or density) of all orbits, in ergodic theory we will not study all orbits, but only typical1 orbits, but will investigate more quantitative dynamical properties, as frequencies of visits, equidistribution and mixing. An example of a basic question studied in ergodic theory is the following. Let A X be a subset of O+ ⊂ the space X. Consider the visits of an orbit f (x) to the set A. If we consider a finite orbit segment x, f(x),...,f n−1(x) , the number of visits to A up to time n is given by { } Card 0 k n 1, f k(x) A .
    [Show full text]