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.

26 Marco Abate<br />

defined for |t| small enough. Hence,<br />

1<br />

sup<br />

k k logαk < ∞,<br />

as we wanted.<br />

To estimate δk we have to take care of small divisors. First of all, for each k ≥ 2<br />

we associate to δk a specific decomposition of the form<br />

δk = ε −1<br />

δk1 ···δkν k , (31)<br />

with k > k1 ≥ ··· ≥ kν, k = k1 + ···+ kν and ν ≥ 2, and hence, by induction, a<br />

specific decomposition of the form<br />

δk = ε −1<br />

l0 ε−1<br />

l1<br />

···ε −1<br />

, (32)<br />

lq<br />

where l0 = k and k > l1 ≥ ··· ≥ lq ≥ 2. For m ≥ 2letNm(k) be the number of<br />

factors ε −1<br />

l in the expression (32)ofδk satisfying<br />

εl < 1<br />

4 Ωλ (m).<br />

Notice that Ωλ (m) is non-increasing with respect to m and it tends to zero as m goes<br />

to infinity. The next lemma contains the key estimate.<br />

Lemma 4.14. For all m ≥ 2 we have<br />

�<br />

0, if k ≤ m ,<br />

Nm(k) ≤ 2k<br />

m − 1, if k > m.<br />

Proof. We argue by induction on k. Ifl≤ k ≤ m we have εl ≥ Ωλ (m), and<br />

hence Nm(k)=0.<br />

Assume now k > m, sothat2k/m−1≥1. Write δk as in (31);wehaveafew<br />

cases to consider.<br />

Case 1: εk ≥ 1<br />

4 Ωλ (m). Then<br />

N(k)=N(k1)+···+ N(kν),<br />

and applying the induction hypothesis to each term we get N(k) ≤ (2k/m) − 1.<br />

Case 2: εk < 1 4 Ω λ (m). Then<br />

N(k)=1 + N(k1)+···+ N(kν),<br />

and there are three subcases.<br />

Case 2.1: k1 ≤ m.Then<br />

N(k)=1 ≤ 2k<br />

− 1,<br />

m<br />

and we are done.<br />

Case 2.2: k1 ≥ k2 > m. Then there is ν ′ such that 2 ≤ ν ′ ≤ ν and kν ′ > m ≥ kν ′ +1,<br />

and we again have

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

Saved successfully!

Ooh no, something went wrong!