 Convolution theorem

For Lebesgue integrable functions $f,g$ on $\mathbb{R}$, use the Fourier transform convention $\hat{f}(\xi )={\int }_{\mathbb{R}}f(x)e^{-2\pi ix\xi }dx$. ThenThus the integral combining all translated products becomes an ordinary multiplication at each frequency. Different Fourier transform normalizations can place a constant in this identity; fixing the convention prevents that ambiguity. Its use in filtering is illustrated by ^[ref].

For the indicator function $q=1_{[0,1]}$,with $\mathrm{sinc}(0)=1$. Therefore the triangular function $q\ast q$ has Fourier transform $e^{-2\pi i\xi }{\mathrm{sinc}}^2(\xi )$. The extra factor of the sinc function improves the large-frequency bound from a constant times $1/|\xi |$ to one times $1/|\xi {|}^2$, matching the smoother output in the overlap picture. Fourier decay of repeated interval convolutions extends this calculation to further repetitions.

For a proof outline, Fubini's theorem permits exchanging the two integrals because the integral of $|f(y)g(x-y)|$ over $(x,y)$ is $\Vert f{\Vert }_1\Vert g{\Vert }_1<\infty$. Set $u=x-y$ in the inner integral:The factorization of the complex exponential is the mechanism behind the simplification. The discrete convolution version similarly turns coefficient sums into products of generating functions.