20.07.2013 Views

NEAR OPTIMAL BOUNDS IN FREIMAN'S THEOREM

NEAR OPTIMAL BOUNDS IN FREIMAN'S THEOREM

NEAR OPTIMAL BOUNDS IN FREIMAN'S THEOREM

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.

HOLOMORPHIC OPEN BOOK DECOMPOSITIONS 55<br />

Remark 3.3<br />

We may assume without loss of generality that v0 ≡ u0 and f0 ≡ 0.Ifz ∈ ˙S,thenwe<br />

denote by T (z) > 0 the positive return time of the point u0(z); that is, we have<br />

T (z) := inf T>0 φT (u0(z)) ∈ u0( ˙S) < +∞.<br />

We claim that the return time z ↦→ T (z) extends continuously over the punctures of<br />

the surface, and that therefore there is an upper bound<br />

T := sup T (z) < ∞.<br />

z∈ ˙S<br />

Using (2.1)and(2.6), we note that, asymptotically near the punctures, φT (u0(s, t)) ∈<br />

S 1 × R 2 has the following structure:<br />

φT (u0(s, t)) = t + α(r(s))T, r(s) exp[i(α0 + β(r(s))T )] ,<br />

where r(s) is a strictly decreasing function, α0 is some constant, and α(r),β(r) are<br />

suitable functions for which the limits limr→0 β(r) and limr→0 α(r) exist and are not<br />

zero. Hence, if T = T (u0(s, t)) is the positive return time at the point u0(s, t), then<br />

T u0(s, t) =<br />

and therefore the limit for s →+∞exists.<br />

2π<br />

|β(r(s))| ,<br />

The remainder of this section is devoted to the proof of Theorem 3.2. We recall<br />

that the functions aτ and fτ satisfy the Cauchy-Riemann type equation (2.9)whichis<br />

¯∂jτ (aτ + ifτ ) = u ∗<br />

0 λ ◦ jτ − i(u ∗<br />

0 λ) − γτ − i(γτ ◦ jτ ),<br />

where the complex structure jτ is given by (2.8)or<br />

jτ (z) = πλTu0(z) −1 Tφfτ (z)(u0(z)) −1 · J φfτ (z)(u0(z)) <br />

Tφfτ (z) u0(z) πλTu0(z),<br />

and that γτ is a closed 1-form on S with d(γτ ◦ jτ ) = 0.<br />

The following L ∞ -bound is the crucial ingredient for the compactness result. We<br />

claim that<br />

sup<br />

0≤τ

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

Saved successfully!

Ooh no, something went wrong!