Consider the cube $latex K := [0,1]^k subset mathbb{R}^k$. Let $latex f$ be a function defined on $latex K$. For every $latex n in mathbb{Z}^k$, the $latex n$th Fourier coefficient of $latex f$ is defined to be
$latex hat{f}(n) = int_{K} f(x) e^{-2 pi i n cdot x} dx ,$
where for $latex n = (n_1, ldots, n_k)$ and $latex x = (x_1, ldots, x_k) in K$ we denote $latex n cdot x = n_1 x_1 + ldots n_k x_k$. The sum
$latex sum_{n in mathbb{Z}^k} hat{f}(n) e^{2 pi i n cdot x} $
is called the Fourier series of $latex f$. The basic problem in Fourier analysis is whether one can reconstruct $latex f$ from its Fourier coefficients, and in particular, under what conditions, and in what sense, does the Fourier series of $latex f$ converge to $latex f$.
One week into the course, we are ready to start applying the structure theory of Hilbert spaces that we developed in the previous two lectures, together with the Stone-Weierstrass Theorem we proved in the introduction, to obtain easily some results in Fourier series.
Continue reading Advanced Analysis, Notes 3: Hilbert spaces (application: Fourier series) →