The Connecting Lemma(s) - PowerPoint PPT Presentation

About This Presentation
Title:

The Connecting Lemma(s)

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 ... – PowerPoint PPT presentation

Number of Views:84
Avg rating:3.0/5.0
Slides: 76
Provided by: Christi619
Category:

less

Transcript and Presenter's Notes

Title: The Connecting Lemma(s)


1
The Connecting Lemma(s)
  • Following Hayashi, WenXia, Arnaud

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

3
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 ?

4
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 ?

5
An orbit coming back very close
6
A C0-small perturbation
7
The orbit is closed!
8
A C1-small perturbation
No closed orbit!
9
For C1-perturbation less than ?, one need a
safety distance, proportional to the jump
10
Pughs 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 (PughRobinson)

11
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
12
For diffeos
13
2) Selecting points
14
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?

15
The connecting lemma (Hayashi 1997)
By a C1-perturbation
16
Variations on Hayashis lemma
x non-periodic point
Arnaud, Wen Xia
17
Corollary 1 for C1-generic f,H(p) cl(Ws(p)) ?
cl(Wu(p))
18
Other variation
x non-periodic in the closure of Wu(p)
19
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
20
30 years from Pugh to Hayashi why ?
Pughs strategy
21
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.
22
Hayashi changes the strategy
23
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.

24
What is the notion of  being nearby ?
Back to Pughs argument
For any C1-neighborhood of f and any ?gt0 there
is Ngt0 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) Ø 0lti?N
25
Then the cube C verifies
26
For any pair x,y
27
There are xx0, ,xNy such that
28
The ball B( f i(xi), ? d(f i(xi),f i(xi1)) )
where ? is the safety distance
is contained in f i( (1?)C )
29
Perturbation boxes
  • 1) Tiled cube the ratio between adjacent tiles
    is bounded

30
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
31
  • There is g ?-C1-close to f,
  • perturbation in C?f(C)??fN-1(C)

32
There is g ?-C1-close to f, perturbation in
C?f(C)??fN-1(C)
33
There is g ?-C1-close to f, perturbation in
C?f(C)??fN-1(C)
34
The connecting lemma
  • Theorem Any tiled cube C,
  • whose tiles are Pughs tiles
  • and verifying C?f i(C) Ø, 0lti?N
  • is a perturbation box

35
Why this statment implies the connecting lemmas ?
36
(No Transcript)
37
(No Transcript)
38
(No Transcript)
39
(No Transcript)
40
(No Transcript)
41
(No Transcript)
42
x0y0f i(0)(p) x1y1f i(1)(p) xnf i(n)(p)
ynf j(m)(p) xn1yn1f -j(m-1)(p) xmnymn
f j(0)(p)
By construction, for any k, xk and yk belong to
the same tile
43
(No Transcript)
44
For definition of perturbation box, there is a g
C1-close to f
45
Proof of the connecting lemma
46
Consider (xi,yi) in the same tile
47
Consider the last yi in the tile of x0
48
And consider the next xi
49
Delete all the intermediary points
50
Consider the last yi in the tile
51
Delete all intermediary points
52
On get a new sequence (xi,yi) with at most 1 pair
in a tile
x0 and yn are the original x0 and yn
53
Pugh gives sequences of points joining xi to yi
54
There may have conflict between the perturbations
in adjacent tiles
55
Consider the first conflict zone
56
One jump directly to the last adjacent point
57
One delete all intermediary points
58
One does the same in the next conflict zone, etc,
until yn
59
Why can one solve any conflict?
60
(No Transcript)
61
There is no m other point nearby!?the strategy
is well defined
62
(No Transcript)
63
(No Transcript)
64
(No Transcript)
65
(No Transcript)
66
(No Transcript)
67
(No Transcript)
68
(No Transcript)
69
(No Transcript)
70
(No Transcript)
71
(No Transcript)
72
(No Transcript)
73
(No Transcript)
74
(No Transcript)
75
(No Transcript)
Write a Comment
User Comments (0)
About PowerShow.com