23.11.2012 Views

Discrete Holomorphic Local Dynamical Systems

Discrete Holomorphic Local Dynamical Systems

Discrete Holomorphic Local Dynamical Systems

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

60 Eric Bedford<br />

Fig. 1 Filtration behavior of Hénon maps<br />

3. If (x,y) ∈ V − , then the orbit f n (x,y), n≥ 0, can stay in V − for only finite time.<br />

After f n (x,y) leaves V − , it cannot reenter, which means that it stays in V ∪V + .<br />

In particular, if an orbit is bounded in forward time, then it must enter V and<br />

remain there.<br />

This Theorem is illustrated in Figure 1. The arrows give the possibilities where a<br />

point might map; the dashed circular arrow indicates that an orbit can remain in V −<br />

for only finite time.<br />

K ± = {(x,y) ∈ C 2 : { f ±n (x,y),n ≥ 0} is bounded}<br />

= {(x,y) ∈ C 2 : with bounded f orward/backward orbit}<br />

K := K + ∩ K − , J ± = ∂K ± , J = J + ∩ J − , U + = C 2 − K +<br />

Proposition 1.3. The iterates { f n ,n ≥ 0} are a normal family on the interior of K + ,<br />

and for (x0,y0) ∈ J + , there is no neighborhood U ∋ (x0,y0) on which this family is<br />

normal.<br />

Proof. If p ∈ int(K + ), then the forward orbit cannot enter V + . It can remain in V −<br />

for only finite time, so a neighborhood of p must ultimately be in V. Thus the forward<br />

iterates of a neighborhood of p are ultimately bounded by R in a neighborhood<br />

of p, so the iterates are a normal family in a neighborhood of p. IfU is an open set<br />

that intersects J + ,thenU ∩K + �= /0andU ∩(C 2 − K + ) �= /0. Thus U contains points<br />

where the forward iterates are bounded and points whose orbits tend to ∞. Thus f n<br />

cannot be normal on U. ⊓⊔<br />

Exercise: Show that if p ∈ int(K + ) is fixed, then the eigenvalues of Dfp have<br />

modulus ≤1.<br />

Proposition 1.4. We have K ⊂ V and K + ⊂ V ∪V − .Further,U + = �<br />

n≥0 f −n V + ,<br />

where the union V + ⊂ f −1 V + ⊂··· is increasing.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!