MATH 614 Dynamical Systems and Chaos Lecture 3: Classification of fixed points.

Similar documents
MATH 614 Dynamical Systems and Chaos Lecture 2: Periodic points. Hyperbolicity.

2 Problem Set 2 Graphical Analysis

MATH 409 Advanced Calculus I Lecture 12: Uniform continuity. Exponential functions.

Limits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes

Discrete dynamics on the real line

Simplifying Rational Expressions and Functions

Prime Factorization and GCF. In my own words

Econ Slides from Lecture 1

MATH 614 Dynamical Systems and Chaos Lecture 6: Symbolic dynamics.

Fixed Points & Fatou Components

x y More precisely, this equation means that given any ε > 0, there exists some δ > 0 such that

Alternate Locations of Equilibrium Points and Poles in Complex Rational Differential Equations

MA651 Topology. Lecture 9. Compactness 2.

NAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key

Solutions to homework Assignment #6 Math 119B UC Davis, Spring 2012

MS 3011 Exercises. December 11, 2013

Solutions for Homework Assignment 2

Chapter-2 Relations and Functions. Miscellaneous

Homework 8 Solutions to Selected Problems

+ 1 3 x2 2x x3 + 3x 2 + 0x x x2 2x + 3 4

Economics 204 Fall 2011 Problem Set 2 Suggested Solutions

PERIODIC POINTS OF THE FAMILY OF TENT MAPS

CHAPTER 10: POLYNOMIALS (DRAFT)

MATH 409 Advanced Calculus I Lecture 10: Continuity. Properties of continuous functions.

1) Synthetic Division: The Process. (Ruffini's rule) 2) Remainder Theorem 3) Factor Theorem

The Schwarzian Derivative

MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

Math 547, Exam 2 Information.

Qualitative Theory of Differential Equations and Dynamics of Quadratic Rational Functions

FRACTAL GEOMETRY, DYNAMICAL SYSTEMS AND CHAOS

Suppose that f is continuous on [a, b] and differentiable on (a, b). Then

Math 201C Homework. Edward Burkard. g 1 (u) v + f 2(u) g 2 (u) v2 + + f n(u) a 2,k u k v a 1,k u k v + k=0. k=0 d

(Rgs) Rings Math 683L (Summer 2003)

h(x) lim H(x) = lim Since h is nondecreasing then h(x) 0 for all x, and if h is discontinuous at a point x then H(x) > 0. Denote

Lecture 4: Optimization. Maximizing a function of a single variable

Math /Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined

Chapter 2 Invertible Mappings

Discrete Math. Instructor: Mike Picollelli. Day 10

Math 418 Algebraic Geometry Notes

Week 5: Functions and graphs

CHAOTIC BEHAVIOR IN A FORECAST MODEL

Simple Iteration, cont d

Math 0320 Final Exam Review

2. The Concept of Convergence: Ultrafilters and Nets

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

Zoology of Fatou sets


9 FUNCTIONS. 9.1 The Definition of Function. c Dr Oksana Shatalov, Fall

RELATIONS AND FUNCTIONS

MAS331: Metric Spaces Problems on Chapter 1

ABSTRACT. HEWITT, CHRISTINA M. Real Roots of Polynomials with Real Coefficients. (Under the direction of Dr. Michael Singer).

MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION

Chapter 6: Rational Expr., Eq., and Functions Lecture notes Math 1010

Section 11.1 Sequences

Global Attractivity of a Higher-Order Nonlinear Difference Equation

Nonhyperbolic Dynamics for Competitive Systems in the Plane and Global Period-doubling Bifurcations

MATH 614 Dynamical Systems and Chaos Lecture 11: Maps of the circle.

MCMULLEN S ROOT-FINDING ALGORITHM FOR CUBIC POLYNOMIALS

Polynomial Rings. i=0

THE INVERSE FUNCTION THEOREM

Math 121 Homework 2 Solutions

Section 0.2 & 0.3 Worksheet. Types of Functions

Math 115 Spring 11 Written Homework 10 Solutions

COMPLETION AND DIFFERENTIABILITY IN WEAKLY O-MINIMAL STRUCTURES

Final Exam Solutions June 10, 2004

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

where c R and the content of f is one. 1

Chapter 8: Taylor s theorem and L Hospital s rule

A. H. Hall, 33, 35 &37, Lendoi

Contra θ-c-continuous Functions

Integer-Valued Polynomials

Polynomial Rings. i=0. i=0. n+m. i=0. k=0

ON ALMOST PSEUDO-VALUATION DOMAINS, II. Gyu Whan Chang

We first review various rules for easy differentiation of common functions: The same procedure works for a larger number of terms.

Chapter 2: Functions, Limits and Continuity

MATH 409 Advanced Calculus I Lecture 11: More on continuous functions.

MATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG

UNIQUE PRIME CARTESIAN FACTORIZATION OF GRAPHS OVER FINITE FIELDS

MATH 614 Dynamical Systems and Chaos Lecture 16: Rotation number. The standard family.

Notes 6: Polynomials in One Variable

MATH 614 Dynamical Systems and Chaos Lecture 15: Maps of the circle.

Complex Numbers: Definition: A complex number is a number of the form: z = a + bi where a, b are real numbers and i is a symbol with the property: i

8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)

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

Notation. 0,1,2,, 1 with addition and multiplication modulo

Contents. 1 Introduction to Dynamics. 1.1 Examples of Dynamical Systems

More Polynomial Equations Section 6.4

Lecture 2: Convex Sets and Functions

Homework problems from Chapters IV-VI: answers and solutions

Evolution of the McMullen Domain for Singularly Perturbed Rational Maps

PreCalculus: Semester 1 Final Exam Review

Chapter 4. Remember: F will always stand for a field.

3.4. ZEROS OF POLYNOMIAL FUNCTIONS

MATH 3300 Test 1. Name: Student Id:

Dynamics of Tangent. Robert L. Devaney Department of Mathematics Boston University Boston, Mass Linda Keen

1. Theorem. (Archimedean Property) Let x be any real number. There exists a positive integer n greater than x.

Section 1.4 Tangents and Velocity

SPECIAL POINTS AND LINES OF ALGEBRAIC SURFACES

MTH4100 Calculus I. Lecture notes for Week 2. Thomas Calculus, Sections 1.3 to 1.5. Rainer Klages

Local dynamics of holomorphic maps

Transcription:

MATH 614 Dynamical Systems and Chaos Lecture 3: Classification of fixed points.

Periodic points Definition. A point x X is called a fixed point of a map f : X X if f(x) = x. A point x X is called a periodic point of a map f : X X if f m (x) = x for some integer m 1. The least integer m satisfying this relation is called the prime period of x. A point x X is called an eventually periodic point of the map f if for some integer k 0 the point f k (x) is a periodic point of f.

Properties of periodic points If x is a periodic point of prime period m, then f n (x) = x if and only if m divides n. If x is a periodic point of prime period m, then f n 1 (x) = f n 2 (x) if and only if m divides n 1 n 2. If x is a periodic point of prime period m, then the orbit of x consists of m points. If x is a periodic point, then every element of the orbit of x is also a periodic point of the same period. A point is eventually periodic if and only if its orbit is finite (as a set). If the map f is invertible, then every eventually periodic point is actually periodic.

Classification of fixed points Let X be a subset of R, f : X X be a continuous map, and x 0 be a fixed point of f. Definition. The stable set of the fixed point x 0, denoted W s (x 0 ), consists of all points x X such that f n (x) x 0 as n. In the case f is invertible, the unstable set of x 0, denoted W u (x 0 ), is the stable set of x 0 considered as a fixed point of f 1. The fixed point x 0 is weakly attracting if the stable set W s (x 0 ) contains an open neighborhood of x 0, i.e., (x 0 ε,x 0 +ε) W s (x 0 ) for some ε > 0. The fixed point x 0 is weakly repelling if there exists an open neighborhood U of x 0 such that for each x U \{x 0 } the orbit O + (x) is not completely contained in U.

Proposition Suppose f is invertible. Then a fixed point x 0 of f is weakly repelling if and only if x 0 is a weakly attracting fixed point of the inverse map f 1. Proof: It is no loss to assume that the domain of f includes an interval U = (x 0 ε,x 0 +ε) for some ε > 0. Since the map f is continuous and invertible, it is strictly monotone on U. Let us choose ε 0, 0 < ε 0 < ε, so that f(u 0 ) U, where U 0 = (x 0 ε 0,x 0 +ε 0 ). Then f 2 is strictly increasing on U 0. If x 0 is not an isolated fixed point of f 2, then it is neither weakly attracting nor weakly repelling for both f and f 1. Therefore it is no loss to assume that x 0 is the only fixed point of f 2 in the interval U 0. Then the function g(x) = f 2 (x) x maintains its sign on (x 0 ε 0,x 0 ) and on (x 0,x 0 +ε 0 ). If those signs are and +, then x 0 is both weakly repelling for f 2 and weakly attracting for f 2. Otherwise x 0 is neither. Finally, x 0 is weakly repelling for f if and only if it is so for f 2. Also, x 0 is weakly attracting for f 1 if and only if it is for f 2.

Classification of fixed points (continued) Definition. The fixed point x 0 is attracting if for some λ (0,1) there exists an open interval U containing x 0 such that f(x) x 0 λ x x 0 for all x U. The point x 0 is super-attracting if such an interval exists for any λ (0, 1). It is no loss to assume that U = (x 0 ε,x 0 +ε) for some ε > 0. Then it follows that f(u) U and f n (x) x 0 λ n x x 0 for all x U and n = 1,2,... In particular, the orbit of any point x U converges to x 0. Hence an attracting fixed point is weakly attracting as well. Definition. The fixed point x 0 is repelling if there exist λ > 1 and an open interval U containing x 0 such that f(x) x 0 λ x x 0 for all x U. It is easy to observe that any repelling fixed point is weakly repelling as well.

Theorem Suppose that a map f : X X is differentiable at a fixed point x 0 and let λ = f (x 0 ) be the multiplier of x 0. Then (i) x 0 is attracting if and only if λ < 1; (ii) x 0 is super-attracting if and only if λ = 0; (iii) x 0 is repelling if and only if λ > 1. Proof: Since λ = f (x 0 ), for any δ > 0 there exists ε > 0 such that λ δ < f(x) x 0 x x 0 < λ+δ whenever 0 < x x 0 < ε. Then ( λ δ) x x 0 f(x) x 0 ( λ +δ) x x 0 for x x 0 < ε. Notice that the numbers λ δ and λ +δ can be made arbitrarily close to λ. In the case λ < 1, we obtain that x 0 is an attracting fixed point. Furthermore, if λ = 0, then x 0 is super-attracting. However x 0 is not super-attracting if λ 0. In the case λ > 1, we obtain that x 0 is a repelling fixed point. Finally, in the case λ = 1 the fixed point x 0 is neither attracting nor repelling.

Classification of periodic points Let X be a subset of R, f : X X be a continuous map, and x 0 be a periodic point of f with prime period m. Then x 0 is a fixed point of the map f m. The stable set of the periodic point x 0, denoted W s (x 0 ), is defined as the stable set of the same point considered a fixed point of f m. That is, W s (x 0 ) consists of all points x X such that f nm (x) x 0 as n. In the case f is invertible, so is the map f m. In this case the unstable set of x 0, denoted W u (x 0 ), is defined as the stable set of x 0 considered a fixed point of (f m ) 1. The periodic point x 0 is called weakly attracting (resp. attracting, super-attracting, weakly repelling, repelling) if it enjoys the same property as a fixed point of f m.

Newton s method Newton s method is an iterative process for finding roots of a polynomial. Given a nonconstant polynomial Q, consider a rational function f(x) = x Q(x) Q (x). It turns out that, for a properly chosen initial point x 0, the orbit x 0,f(x 0 ),f 2 (x 0 ),... converges very fast to a root of Q. Suppose z is a simple root of Q, that is, Q(z) = 0 while Q (z) 0. Clearly, z is a fixed point of the map f. We have f (z) = 1 Q (z)q (z) Q(z)Q (z) (Q (z)) 2 = Q(z)Q (z) (Q (z)) 2 = 0. Thus z is a super-attracting fixed point of f.