the connecting lemma(s)

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

Upload: wayne

Post on 13-Jan-2016

83 views

Category:

Documents


0 download

DESCRIPTION

The Connecting Lemma(s). Following Hayashi, Wen&Xia, Arnaud. Pugh’s Closing Lemma. If an orbit comes back very close to itself. Pugh’s Closing Lemma. If an orbit comes back very close to itself. Is it possible to close it by a small pertubation of the system ?. Pugh’s Closing Lemma. - PowerPoint PPT Presentation

TRANSCRIPT

Page 1: The Connecting Lemma(s)

The Connecting Lemma(s)

Following Hayashi, Wen&Xia, Arnaud

Page 2: The Connecting Lemma(s)

Pugh’s Closing Lemma

• If an orbit comes back very close to itself

Page 3: The Connecting Lemma(s)

Pugh’s Closing Lemma

• If an orbit comes back very close to itself

•Is it possible to close it by a small pertubation of the system ?

Page 4: The Connecting Lemma(s)

Pugh’s Closing Lemma

• If an orbit comes back very close to itself

•Is it possible to close it by a small pertubation of the system ?

Page 5: The Connecting Lemma(s)

An orbit coming back very close

Page 6: The Connecting Lemma(s)

A C0-small perturbation

Page 7: The Connecting Lemma(s)

The orbit is closed!

Page 8: The Connecting Lemma(s)

A C1-small perturbation: No closed orbit!

Page 9: The Connecting Lemma(s)

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

Page 10: The Connecting Lemma(s)

Pugh’s closing lemma (1967)

If x is a non-wandering point of a diffeomorphism f on a compact manifold, then there is g, arbitrarily C1-close to f, such that x is a periodic point of g.

•Also holds for vectorfields

•Conservative, symplectic systems (Pugh&Robinson)

Page 11: The Connecting Lemma(s)

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

Page 12: The Connecting Lemma(s)

For diffeos

Page 13: The Connecting Lemma(s)

2) Selecting points:

Page 14: The Connecting Lemma(s)

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 C1-small perturbations?

Page 15: The Connecting Lemma(s)

The connecting lemma (Hayashi 1997)

By a C1-perturbation:

Page 16: The Connecting Lemma(s)

Variations on Hayashi’s lemma

x non-periodic point

Arnaud,Wen & Xia

Page 17: The Connecting Lemma(s)

Corollary 1: for C1-generic f,H(p) = cl(Ws(p)) cl(Wu(p))

Page 18: The Connecting Lemma(s)

Other variation

x non-periodic

in the closure of

Wu(p)

Page 19: The Connecting Lemma(s)

Corollary 2: for C1-generic fcl(Wu(p)) is Lyapunov stable

Carballo Morales & Pacifico

Corollary 3: for C1-generic fH(p) is a chain recurrent class

Page 20: The Connecting Lemma(s)

30 years from Pugh to Hayashi : why ?

Pugh’s

strategy :

Page 21: The Connecting Lemma(s)

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.

Page 22: The Connecting Lemma(s)

Hayashi changes the strategy:

Page 23: The Connecting Lemma(s)

Hayashi’s 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.

Page 24: The Connecting Lemma(s)

What is the notion of « being nearby »?Back to Pugh’s argument For any C1-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 Cf i(C)= Ø

0<iN

Page 25: The Connecting Lemma(s)

Then the cube C verifies:

Page 26: The Connecting Lemma(s)

For any pair x,y

Page 27: The Connecting Lemma(s)

There are x=x0, …,xN=y such that

Page 28: The Connecting Lemma(s)

The ball B( f i(xi), d(f i(xi),f i(xi+1)) ) where is the safety distance

is contained in f i( (1+)C )

Page 29: The Connecting Lemma(s)

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

Page 30: The Connecting Lemma(s)

The tiled cube C is a N-perturbation box for (f,) if:

for any sequence (x0,y0), … , (xn,yn),

with xi & yi in the same tile

Page 31: The Connecting Lemma(s)

There is g -C1-close to f,

perturbation in Cf(C)…fN-1(C)

Page 32: The Connecting Lemma(s)

There is g -C1-close to f,

perturbation in Cf(C)…fN-1(C)

Page 33: The Connecting Lemma(s)

There is g -C1-close to f,

perturbation in Cf(C)…fN-1(C)

Page 34: The Connecting Lemma(s)

The connecting lemma

Theorem Any tiled cube C,

whose tiles are Pugh’s tiles

and verifying Cf i(C)= Ø, 0<iN

is a perturbation box

Page 35: The Connecting Lemma(s)

Why this statment implies the connecting lemmas ?

Page 36: The Connecting Lemma(s)
Page 37: The Connecting Lemma(s)
Page 38: The Connecting Lemma(s)
Page 39: The Connecting Lemma(s)
Page 40: The Connecting Lemma(s)
Page 41: The Connecting Lemma(s)
Page 42: The Connecting Lemma(s)

x0=y0=f i(0)(p)x1=y1=f i(1)(p)…xn=f i(n)(p); yn=f –j(m)(p)xn+1=yn+1=f -j(m-1)(p)…xm+n=ym+n=f –j(0)(p)

By construction, for any k,

xk and yk belong to

the same tile

Page 43: The Connecting Lemma(s)
Page 44: The Connecting Lemma(s)

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

Page 45: The Connecting Lemma(s)

Proof of the connecting lemma:

Page 46: The Connecting Lemma(s)

Consider (xi,yi) in the same tile

Page 47: The Connecting Lemma(s)

Consider the last yi in the tile of x0

Page 48: The Connecting Lemma(s)

And consider the next xi

Page 49: The Connecting Lemma(s)

Delete all the intermediary points

Page 50: The Connecting Lemma(s)

Consider the last yi in the tile

Page 51: The Connecting Lemma(s)

Delete all intermediary points

Page 52: The Connecting Lemma(s)

On get a new sequence (xi,yi) with at most 1 pair in a tile

x0 and yn

are the original

x0 and yn

Page 53: The Connecting Lemma(s)

Pugh gives sequences of points joining xi to yi

Page 54: The Connecting Lemma(s)

There may have conflict between the perturbations in adjacent tiles

Page 55: The Connecting Lemma(s)

Consider the first conflict zone

Page 56: The Connecting Lemma(s)

One jump directly to the last adjacent point

Page 57: The Connecting Lemma(s)

One delete all intermediary points

Page 58: The Connecting Lemma(s)

One does the same in the next conflict zone, etc, until yn

Page 59: The Connecting Lemma(s)

Why can one solve any conflict?

Page 60: The Connecting Lemma(s)
Page 61: The Connecting Lemma(s)

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

Page 62: The Connecting Lemma(s)
Page 63: The Connecting Lemma(s)
Page 64: The Connecting Lemma(s)
Page 65: The Connecting Lemma(s)
Page 66: The Connecting Lemma(s)
Page 67: The Connecting Lemma(s)
Page 68: The Connecting Lemma(s)
Page 69: The Connecting Lemma(s)
Page 70: The Connecting Lemma(s)
Page 71: The Connecting Lemma(s)
Page 72: The Connecting Lemma(s)
Page 73: The Connecting Lemma(s)
Page 74: The Connecting Lemma(s)
Page 75: The Connecting Lemma(s)