28.07.2013 Views

Master Dissertation

Master Dissertation

Master Dissertation

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

7.2.2 Uniqueness<br />

We still need to prove that the decomposition of d is unique. To this end<br />

we need the following result<br />

Theorem 7.11. Let u ∈ D ′ (R n ) with support supp u = {0}. Then there<br />

exists a N ∈ N such that<br />

where cα ∈ C.<br />

u = <br />

|a|≤N<br />

cα∂ α δ,<br />

This theorem is a consequence of the following lemmas.<br />

Lemma 7.12.<br />

1<br />

k! ∂k t f(xt) = <br />

|α|=k<br />

x α<br />

α! f (α) (xt) (7.17)<br />

Proof. The first we note that by the chain rule, we may write the left hand<br />

side as<br />

1<br />

k! ∂k t f(xt) = 1<br />

<br />

n<br />

k <br />

∂ <br />

xi f(y) <br />

k! ∂yi<br />

i=1<br />

y=xt<br />

It is this form we will use when proving (7.17) by induction. That is, we<br />

want to prove<br />

1<br />

n<br />

∂<br />

k xi f(y) =<br />

k! ∂yi<br />

xα α! ∂αf(y) i=1<br />

59<br />

|α|=k

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

Saved successfully!

Ooh no, something went wrong!