The Connecting Lemma(s) Following Hayashi, Wen&Xia, Arnaud.

Slides:



Advertisements
Similar presentations
Lower Bounds for Additive Spanners, Emulators, and More David P. Woodruff MIT and Tsinghua University To appear in FOCS, 2006.
Advertisements

2. Piecewise-smooth maps Chris Budd. Maps Key idea … The functions or one of their nth derivatives, differ when Discontinuity set Interesting discontinuity.
Mechanisms of non feedback controlling chaos and suppression of chaotic motion Alexander Loskutov Moscow State University
COMP 482: Design and Analysis of Algorithms
10.4 Ellipses p An ellipse is a set of points such that the distance between that point and two fixed points called Foci remains constant d1 d2.
Hamiltonian Chaos and the standard map Poincare section and twist maps. Area preserving mappings. Standard map as time sections of kicked oscillator (link.
2.3. B OUNDING V OLUMES Bounding volumes of use for collision detection.
A Limit Case of the “Ring Problem” E. Barrabés 1, J.M. Cors 2 and G.R.Hall 3 1 Universitat de Girona 2 Universitat Politècnica de Catalunya 3 Boston University.
MATHEMATICAL MODELS OF SPIKE CODES AS DETERMINISTIC DYNAMICAL SYSTEMS Eleonora Catsigeras Universidad de la República Uruguay Neural Coding Montevideo.
The effect of cantori on transport in chaotic magnetic fields Stuart Hudson Cantori are the invariant sets remaining after destruction of the KAM surfaces.
BIOLOGICAL NEURONAL NETWORKS AS DETERMINISTIC DYNAMICAL SYSTEMS Eleonora Catsigeras Universidad de la República Uruguay
Section 11.6 – Conic Sections
STABILITY under CONSTRAINED SWITCHING Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at Urbana-Champaign.
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
Chaotic dynamics Perturbation theory Quasi integrable Hamiltonians Small divisor problem KAM theorem, Melnikov’s integral Numerical measurements of Lyapunov.
1 A global theory for dynamics J Palis. 2 Abstract We will address one of the most challenging and central problems in dynamical systems, can we describe.
CHΑΟS and (un-) predictability Simos Ichtiaroglou Section of Astrophysics, Astronomy and Mechanics Physics Department University of Thessaloniki.
Stable Cloth Animation By Matthew Fisher. Overview Choose Underlying Model Define Equations of State Integrate Equations of State –Deal With Explosions.
Lyapunov Exponents By Anna Rapoport. Lyapunov A. M. ( ) Alexander Lyapunov was born 6 June 1857 in Yaroslavl, Russia in the family of the famous.
Math 310 Sections Isometry. Transformations Def A transformation is a map from the plane to itself that takes each point in the plane to exactly.

Section 9.1 The Ellipse.
Identify, write, and graph an equation of direct variation.
KS Connected Rate of Change The chain rule can be used to solve problem involving rates of change. Example 1 The length of the side of a square is increasing.
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
Direct Variation 5-4. Vocabulary Direct variation- a linear relationship between two variable that can be written in the form y = kx or k =, where k 
1 Economics & Evolution Number 3. 2 The replicator dynamics (in general)
Controlling Chaos! Dylan Thomas and Alex Yang. Why control chaos? One may want a system to be used for different purposes at different times Chaos offers.
Section – Ratio, Proportion, Variation The Vocabulary.
MATH4248 Weeks Topics: review of rigid body motion, Legendre transformations, derivation of Hamilton’s equations of motion, phase space and Liouville’s.
IDENTIFYING COMPETITIVE ADVANTAGES Three common tools used in industry to analyze and develop competitive advantages include: – Porter’s Five Forces Model.
Vectors in Space. 1. Describe the set of points (x, y, z) defined by the equation (Similar to p.364 #7-14)
Many of the figures from this book may be reproduced free of charge in scholarly articles, proceedings, and presentations, provided only that the following.
The Lorenz attractor is mixing
Void Traversal for Guaranteed Delivery in Geometric Routing
Valence Electrons.
JIMO Team MeetingJune 17, 2004 Europa Orbiter Study Update Rodney L. Anderson Martin W. Lo.
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
JCT – boundaries of the components of the complement of a Jordan curve - I The boundary of a component of the complement of a Jordan curve is a subset.
Object Oriented Programming Lab 7. Lab Task#1 Create a create POINT to represent a point in Cartesian coordinate system Choose appropriate data members.
Making graphs and using equations of ellipses. An ellipse is the set of all points P in a plane such that the sum of the distance from P to 2 fixed points.
SIAM Conference on Applications of Dynamical Systems Snowbird, Utah May 2009 Distinguished trajectories in time dependent geophysical flows Ana M.
Satellite Motion Satellite – a projectile moving fast enough to fall continually around the Earth rather than into it - the Earth surface drops a vertical.
Krishnendu ChatterjeeFormal Methods Class1 MARKOV CHAINS.
Chapter 8 Lesson 5 Objective: To use the Side-Splitter and Triangle – Angle Bisector Theorems.
What is the standard n dimensional unit cube?
Distance and Midpoints
8.5 Proportions in Triangles
Parallel Lines and Proportional Parts
Stability of Differential Equations
Chapter 3 The Real Numbers.
Managing Operational Planning and Resource Management Financial
Geometry 7.4 Parallel Lines and Proportional Parts
in collaboration with M. Bojowald, G. Hossain, S. Shankaranarayanan
CSE 421: Introduction to Algorithms
Objective: To use the Side-Splitter theorem.
Inverse Variation.
Qiudong Wang, University of Arizona (Joint With Kening Lu, BYU)
Chapter 8 Lesson 5 Objective: To use the Side-Splitter and Triangle –Angle Bisector Theorems.
Dynamics of Bursting Spike Renormalization
Chapter 3 The Real Numbers.
Demo: IMF 1. What is = __________
Composition of Matter Matter - Everything in the universe is composed of matter Matter is anything that occupies space and has mass Mass – quantity of.
Aim: How do we analyze the area under velocity-time graphs?
Monica Berrondo, Marc Ostermeier, Jeffrey J. Gray  Structure 
Proportions in Triangles
This is a whole set of apples.
Physics 451/551 Theoretical Mechanics
Graphical Analysis of Motion
Notes 13-5: Conditional Probability
Presentation transcript:

The Connecting Lemma(s) Following Hayashi, Wen&Xia, Arnaud

Pughs Closing Lemma If an orbit comes back very close to itself

Pughs Closing Lemma If an orbit comes back very close to itself Is it possible to close it by a small pertubation of the system ?

Pughs Closing Lemma If an orbit comes back very close to itself Is it possible to close it by a small pertubation of the system ?

An orbit coming back very close

A C 0 -small perturbation

The orbit is closed!

A C 1 -small perturbation: No closed orbit!

For C 1 -perturbation less than, one need a safety distance, proportional to the jump:

Pughs closing lemma (1967) If x is a non-wandering point of a diffeomorphism f on a compact manifold, then there is g, arbitrarily C 1 -close to f, such that x is a periodic point of g. Also holds for vectorfields Conservative, symplectic systems (Pugh&Robinson)

What is the strategy of Pugh? 1) spread the perturbation on a long time interval, for making the constant very close to 1. For flows: very long flow boxes

For diffeos

2) Selecting points:

The connecting lemma If the unstable manifold of a fixed point comes back very close to the stable manifold Can one create homoclinic intersection by C 1 - small perturbations?

The connecting lemma (Hayashi 1997) By a C 1 -perturbation:

Variations on Hayashis lemma x non-periodic point Arnaud, Wen & Xia

Corollary 1: for C 1 -generic f, H(p) = cl(W s (p)) cl(W u (p))

Other variation x non-periodic in the closure of W u (p)

Corollary 2: for C 1 -generic f cl(W u (p)) is Lyapunov stable Carballo Morales & Pacifico Corollary 3: for C 1 -generic f H(p) is a chain recurrent class

30 years from Pugh to Hayashi : why ? Pughs strategy :

This strategy cannot work for connecting lemma: There is no more selecting lemmas Each time you select one red and one blue point, There are other points nearby.

Hayashi changes the strategy:

Hayashis strategy. Each time the orbit comes back very close to itself, a small perturbations allows us to shorter the orbit: one jumps directly to the last return nearby, forgiving the intermediar orbit segment.

What is the notion of « being nearby »? Back to Pughs argumentFor any C 1 -neighborhood of f and any >0 there is N>0 such that: For any point x there are local coordinate around x such that Any cube C with edges parallela to the axes and C f i (C)= Ø 0<i N

Then the cube C verifies:

For any pair x,y

There are x=x 0, …,x N =y such that

The ball B( f i (x i ), d(f i (x i ),f i (x i+1 )) ) where is the safety distance is contained in f i ( (1+ )C )

Perturbation boxes 1) Tiled cube : the ratio between adjacent tiles is bounded

The tiled cube C is a N-perturbation box for (f, ) if: for any sequence (x 0,y 0 ), …, (x n,y n ), with x i & y i in the same tile

There is g -C 1 -close to f, perturbation in C f(C) … f N-1 (C)

There is g -C 1 -close to f, perturbation in C f(C) … f N-1 (C)

There is g -C 1 -close to f, perturbation in C f(C) … f N-1 (C)

The connecting lemma Theorem Any tiled cube C, whose tiles are Pughs tiles and verifying C f i (C)= Ø, 0<i N is a perturbation box

Why this statment implies the connecting lemmas ?

x 0 =y 0 =f i(0) (p) x 1 =y 1 =f i(1) (p) … x n =f i(n) (p); y n =f –j(m) (p) x n+1 =y n+1 =f -j(m-1) (p) … x m+n =y m+n =f –j(0) (p) By construction, for any k, x k and y k belong to the same tile

For definition of perturbation box, there is a g C 1 -close to f

Proof of the connecting lemma:

Consider (x i,y i ) in the same tile

Consider the last y i in the tile of x 0

And consider the next x i

Delete all the intermediary points

Consider the last y i in the tile

Delete all intermediary points

On get a new sequence (x i,y i ) with at most 1 pair in a tile x 0 and y n are the original x 0 and y n

Pugh gives sequences of points joining x i to y i

There may have conflict between the perturbations in adjacent tiles

Consider the first conflict zone

One jump directly to the last adjacent point

One delete all intermediary points

One does the same in the next conflict zone, etc, until y n

Why can one solve any conflict?

There is no m other point nearby! the strategy is well defined