MHB Proving Parseval's Theorem for Schwartz Functions with Compact Support

  • Thread starter Thread starter Sonifa
  • Start date Start date
  • Tags Tags
    Sampling Theorem
Sonifa
Messages
4
Reaction score
0
How to prove the following:

Suppose f is in the Schwartz Space ( smooth function with very fast decay). Its Fourier transform is smooth and has compact support contained in the interval (1/2,-1/2)

Show,

∫ (|f(x)|^2) dx = ∑ (|f(n)|^2) (where integral over R and sum up over n for all intergers)
 
Last edited:
Physics news on Phys.org
Sonifa said:
How to prove the following:

Suppose f is in the Schwartz Space ( smooth function with very fast decay). Its Fourier transform is smooth and has compact support contained in the interval (1/2,-1/2)

Show,

∫ (|f(x)|^2) dx = ∑ (|f(n)|^2) (where integral over R and sum up over n for all intergers)
I would start by using the Parseval theorem $$\int_{\mathbb{R}}|f(x)|^2dx = \int_{\mathbb{R}}|\hat{f}(\omega)|^2d\omega.$$

The sampling theorem (taking the sampling interval $\delta$ to be $\delta = 1$) says that $$f(x) = \sum_{n=-\infty}^\infty f(n)\phi(x-n),$$ where $\phi$ is a smooth function whose Fourier transform $\hat{\phi}$ is identically $1$ on $\bigl(-\frac12,\frac12\bigr)$ and has support in $(-\pi,\pi)$. Then $$\hat{f}(\omega) = \sum_{n=-\infty}^\infty f(n)\hat{\phi}(\omega -n)$$. Can you use that to show that $$\int_{\mathbb{R}}|\hat{f}(\omega)|^2d\omega = \sum_{n=-\infty}^\infty |f(n)|^2$$?

Edit. Correction: the Fourier transform of $\phi(x-n)$ is not $\hat{\phi}(\omega -n)$, but something like $e^{in\omega}\hat{\phi}(\omega) .$
 
Last edited:
We all know the definition of n-dimensional topological manifold uses open sets and homeomorphisms onto the image as open set in ##\mathbb R^n##. It should be possible to reformulate the definition of n-dimensional topological manifold using closed sets on the manifold's topology and on ##\mathbb R^n## ? I'm positive for this. Perhaps the definition of smooth manifold would be problematic, though.

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 14 ·
Replies
14
Views
5K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
5K
Replies
2
Views
2K