Fourier Transforms - The Convolution Theorem.

binbagsss
Messages
1,291
Reaction score
12
Ok so I've seen the convolution theorem written as:

F(h(x)\otimesg(x))=H(k)G(k)

(And this is how it appears when I have a quick google).

My book then does a problem in which is uses:

F(h(x)g(x))=H(k)\otimesG(k)

Where H(k)=F(h(x)) and similarly G(k)=F(g(x)),
and F represents a Fourier transform


My question
- I can't see how these are equivalent at all?

Many Thanks to anyone who can help shed some light !
 
Physics news on Phys.org
binbagsss:
Please post your math questions in one of the Math HW forums. This helps to organize the questions so that posters can receive appropriate responses to questions.
 
binbagsss said:
Ok so I've seen the convolution theorem written as:

F(h(x)\otimesg(x))=H(k)G(k)

(And this is how it appears when I have a quick google).

My book then does a problem in which is uses:

F(h(x)g(x))=H(k)\otimesG(k)

Where H(k)=F(h(x)) and similarly G(k)=F(g(x)),
and F represents a Fourier transform


My question
- I can't see how these are equivalent at all?

Many Thanks to anyone who can help shed some light !

Take a look at:
http://ugastro.berkeley.edu/infrared09/PDF-2009/convolution2.pdf

It gives an argument for the formula on the last page.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...

Similar threads

Replies
3
Views
1K
Replies
5
Views
1K
Replies
2
Views
2K
Replies
2
Views
1K
Replies
8
Views
2K
Replies
2
Views
3K
Replies
5
Views
2K
Back
Top