Smoothness of Fourier Transforms for Rapidly Decaying Functions

Click For Summary

Discussion Overview

The discussion revolves around the smoothness of Fourier transforms for rapidly decaying functions, exploring the conditions under which a function's Fourier transform is smooth. Participants examine theoretical aspects, proofs, and definitions related to the Fourier transform and Schwartz space.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • Some participants propose that if a function f decays rapidly, specifically if \lim_{x \to \infty} f(x) = 0, then its Fourier transform F is smooth.
  • Others argue that for the Fourier transform to exist, f(x) must tend to zero, and suggest that if f and all its derivatives decay faster than any polynomial, then F should be smooth, though they acknowledge there may be less strict conditions.
  • A later reply questions the triviality of the statement regarding the smoothness of F when f and its derivatives decay rapidly, seeking references for proof.
  • One participant references a lemma from their PDEs course, stating that if f is in the Schwartz space, then its Fourier transform is also in the Schwartz space, implying smoothness.
  • Another participant discusses the definition of Schwartz space and its implications for smooth functions with compact support, noting that such functions are non-zero only locally.
  • One participant attempts to prove the smoothness of the Fourier transform by induction, focusing on the behavior of derivatives of f as x approaches infinity.
  • Another participant provides an example of a smooth function with compact support, illustrating that it decays rapidly as it approaches infinity.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the conditions required for the smoothness of the Fourier transform. Multiple competing views and approaches are presented, with some participants seeking clarification and proof for their claims.

Contextual Notes

Some discussions involve assumptions about the definitions of functions in Schwartz space and the nature of compact support, which may not be fully resolved. The proofs and reasoning presented rely on specific mathematical definitions and properties that are not universally agreed upon.

mnb96
Messages
711
Reaction score
5
Hello,
I read somewhere that if a function f decays rapidly (e.g. [itex]\lim_{x \to \infty}f(x)=0 )[/itex], then its Fourier transform F is smooth.
How can I prove this? (Reference to some sources are welcome too).
Thanks.
 
Physics news on Phys.org
I think f(x) has to tend to zero for the Fourier transform to even exist.
Just did some musing. If f and all its derivatives decay faster than any polynomial (eg, exponentially fast), F should be smooth. I'm sure there are less strict conditions though.

Sometimes the FT is studied as an isomorphism from the Schwartz space to itself (functions from ___ to ___ whose derivatives of all orders and types decay exponentially fast. Sometimes it's expressed as having a certain finite norm)
 
Jerbearrrrrr said:
...If f and all its derivatives decay faster than any polynomial (eg, exponentially fast), F should be smooth...

do you have a reference to a proof for this statement?
It doesn´t look like a trivial result, at least to me.
 
My lecture notes lol. You need to use the fact that FT(f ') = k*FT(f), and the inverse/dual (not sure precisely what to call it) of this fact.From my PDEs course last term. It's actually like the first thing that was proven after defining the FT:

Defn (Fourier Transform)
for [tex]f \in L^1(R^n;C) \ \ \ \ \ \ \ \ \hat{f} (\mu) := \int _{R^n} f(x) e^{-ix.\mu} dx[/tex]
[tex](\mu \in R^n, \hat{f} : R^n \to C)[/tex]

Lemma
Let [tex]f \in S(R^n)[/tex]. Then [tex]\hat{f} \in S(R^n)[/tex].
Proof
For any multi-indices [tex]k_1, k_2[/tex]
[tex]sup_\mu | \mu^{k_1} \nabla ^{k_2} \hat{f} (\mu)| \leq sup |F(\nabla _x ^{k_1} (x^{k_2} f))(\mu)|\leq | | \nabla _x ^{k_1}(x^{k_2} f) | | _{L^1}[/tex]

I've sloppily used F(f) to be the Fourier transform of f that changes x to mu. The ||.|| thing is the L1 norm which is just "integrate me over all space".
It's presented as a one liner but I guess there are quite a few ideas involved.

Oh, and S is
[tex]S:= \{f \in C^{\infty} (R) : lim_{x \to \infty} \frac{|\nabla ^k f(x) |}{|x| ^m} \to 0 \ \ \forall k,m\}[/tex]
So thingies in S are definitely smooth and decaying.
 
Last edited:
Last edited by a moderator:
Oh. Yes, it is clear.
Compact support means (well it doesn't, but it does) the function is non-zero only locally (in some closed set).

ie it looks like a bump.
 
I tried to prove it this way (by induction on the power of [itex]|x|^m[/itex]).
The cases when [itex]m\geq 0[/itex], are trivial so we assume m<0, and f is smooth with [itex]\lim_{x \to \infty}f(x)=0[/itex].
Let k=-m

Base (k=1):

[tex]\lim_{x\to +\infty} xf^{(n)}}(x) = \lim_{x\to +\infty} \frac{x}{[f^{(n)}(x)]^{-1}} = \lim_{x \to \infty}\frac{f^{(n+1)}}{-[f^{(n)}(x)]^{-2}} = 0[/tex]Induction:

[tex]\lim_{x\to +\infty} x^{i+1}f^{(n)}}(x) = \lim_{x\to +\infty} \frac{x}{[x^{i}f^{(n)}(x)]^{-1}}= \lim_{x\to +\infty} \frac{1}{D[(x^{i}f^{(n)}(x))^{-1}]} = 0[/tex]

The last step is due to the fact that the denominator is the product of two smooth functions (which by induction hypothesis tends to 0, and so all its derivatives).

If this is correct, it looks more clear to me. Perhaps I don't clearly understand the definition of function with compact support (at least I don't know how to use that definition).
 
Last edited:
[PLAIN]http://img707.imageshack.us/img707/2655/compsupp.png
This is a smooth function with compact support. (Assume it's smooth anyway)

It's only non-zero locally.
So towards infinity...of course it decays fast, because it IS zero.
 
Last edited by a moderator:

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 14 ·
Replies
14
Views
5K
  • · Replies 6 ·
Replies
6
Views
14K
  • · Replies 8 ·
Replies
8
Views
6K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
3K