Fourier transform convolution proof

mcheung4
Messages
22
Reaction score
0

Homework Statement



Let FT(f) = Fourier transform of f, (f*g)(x) = convolution of f and g.
Given FT(f*g) = FT(f)FT(g), the first part of the convolution theorem, show that FT[fg] = [FT(f)*FT(g)]/2pi.


Homework Equations



Duality: FT2f(x) = (2pi)f(-x)

Convolution: (f*g)(x) = ∫f(u)g(x-u)du


The Attempt at a Solution



FT(f*g) = FT(f)FT(g)
FT2(f*g) = FT[FT(f)FT(g)]
LHS = FT2(f*g)(x) = (2pi)(f*g)(-x) (by duality) =(2pi)∫f(u)g(-x-u)du (by convolution) = (2pi)∫{[FT2f(-u)][FT2g(x+u)]}/(2pi)2 du
implying that RHS = FT[FT(f)FT(g)] = (1/2pi)∫FT[FT(f(-u))]FT[FT(g(x+u))] du ≠ FT[fg] = [FT(f)*FT(g)]/2pi

Where did I go wrong?

Thanks!
 
Physics news on Phys.org
Try letting f = FT(F) and g=FT(G). Then evaluate FT2(f*g) and FT[FT(f)FT(g)] separately and show they are equal.
 
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...
Back
Top