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

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

70 CASIM ABBAS<br />

so that, for z ∈ B, wehave<br />

<br />

∂(φτ ◦ ατ )(z) = ∂jτ φτ ατ (z) ◦ ∂sατ (z)<br />

= u ∗<br />

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

0λ)ατ (z) ◦ ∂sατ (z)<br />

<br />

− (α ∗<br />

τ γτ )(z) · ∂<br />

+ i(α∗ τ<br />

∂s γτ )(z) · ∂<br />

<br />

∂t<br />

and<br />

=: ˆFτ (z) + ˆGτ (z)<br />

=: ˆHτ (z),<br />

(3.8)<br />

sup ˆFτ L<br />

τ<br />

p (B) < ∞ for some p>2 (3.9)<br />

since ατ → ατ0 in W 1,p (B) and supτ jτ L∞ < ∞. Wealsohave<br />

sup ˆGτ C<br />

τ<br />

k (B ′ ) < ∞ (3.10)<br />

for any ball B ′ ⊂ B ′ ⊂ B and any integer k ≥ 0 in view of Proposition 3.9 (the<br />

proposition asserts uniform convergence after passing to a suitable subsequence, but<br />

uniform bounds on all derivatives are established in the proof). We claim now that,<br />

for every ball B ′ ⊂ B ′ ⊂ B, there is a constant CB ′ > 0 such that<br />

∇(φτ ◦ ατ )L p (B ′ ) ≤ CB ′, ∀ τ ∈ [0,τ0). (3.11)<br />

Arguing indirectly, we may assume that there is a sequence τk ↗ τ0 such that<br />

Now define<br />

∇(φτk ◦ ατk)L p (B ′ ) →∞ for some ball B ′ ⊂ B ′ ⊂ B. (3.12)<br />

εk := inf ε>0 ∃ x ∈ B ′ : ∇(φτk ◦ ατk)L p (Bε(x)) ≥ ε 2/p−1 ,<br />

which are positive numbers since ε (2/p)−1 →+∞. Because we assumed (3.12) we<br />

must have infk εk = 0, hence we will assume that εk → 0. Otherwise, if ε0 =<br />

(1/2) infk εk > 0, then we cover B ′ with finitely many balls of radius ε0, andwe<br />

would get a k-uniform L p -bound on each of them, contradicting (3.12). We claim that<br />

∇(φτk ◦ ατk)L p (Bε k (x)) ≤ ε (2/p)−1<br />

k , ∀ x ∈ B ′ . (3.13)<br />

Otherwise, we could find y ∈ B ′ so that<br />

∇(φτk ◦ ατk)Lp (Bε (y)) >ε k (2/p)−1<br />

k ,

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

Saved successfully!

Ooh no, something went wrong!