Fourier series

(Redirected from Fourier expansion)

In mathematics, a Fourier series, named in honor of Joseph Fourier (1768-1830), is a representation of a periodic function (often taken to have period 2π — in a sense, the simplest case) as a sum of periodic functions of the form

$x\mapsto e^{inx},$

which are harmonics of e^{i x}. By Euler's formula, the series can be expressed equivalently in terms of sine and cosine functions.

Fourier was the first to study systematically such infinite series, after preliminary investigations by Euler, d'Alembert, and Daniel Bernoulli. He applied these series to the solution of the heat equation, publishing his initial results in 1807 and 1811, and publishing his Théorie analytique de la chaleur in 1822. From a modern point of view, Fourier's results are somewhat informal, due in no small part to the lack of a precise notion of function and integral in the early nineteenth century. Later, Dirichlet and Riemann expressed Fourier's results with greater precision and formality.

Many other Fourier-related transforms have since been defined, extending to other applications the initial idea of representing any periodic function as a superposition of harmonics. This general area of inquiry is now sometimes called harmonic analysis.

Contents

1 Definition of Fourier series

2 Example

3 Convergence of Fourier series

4 Orthogonality

5 Some positive consequences of the homomorphism properties of exp

5.1 Shifting property
5.2 Convolution theorems

6 Plancherel's and Parseval's theorem

7 General formulation

8 See also

9 References

10 External links

Definition of Fourier series

Suppose that f(x), a complex-valued function of a real variable, is periodic with period 2π, and is square-integrable over the interval from 0 to 2π. Let

$F_n =\frac{1}{2\pi}\int_{-\pi}^\pi f(x)\,e^{-inx}\,dx.$

Then, the Fourier series representation of f(x) is given by

$f(x) = \sum_{n=-\infty}^{\infty} F_n \,e^{inx}.$

Each term in this sum is called a Fourier mode. In the important special case of a real-valued function f(x), one often uses the equality

$e^{inx}=\cos(nx)+i\sin(nx) \,\!$

(derived from Euler's formula) to equivalently represent f(x) as an infinite linear combination of functions of the form $\cos(nx) \,\!$ and $\sin(nx) \,\!$ , that is

$f(x) = \frac{1}{2}a_0 + \sum_{n=1}^\infty\left[a_n\cos(nx)+b_n\sin(nx)\right]$ , where

$a_n = \frac{1}{\pi}\int_{-\pi}^\pi f(x)\cos(nx)\,dx$ and $b_n = \frac{1}{\pi}\int_{-\pi}^\pi f(x)\sin(nx)\,dx$

which corresponds to $F_n = (a_n - i b_n) / 2 \,\!$ and $F_n = F_{-n}^*.$

Example

Let f(x) = x be the identity function for x from −π to π. Outside this domain, the Fourier series implicitly requires that we define the function periodically.

We will compute the Fourier coefficients for this function. Notice that cos(nx) is an even function, while f and sin(nx) are odd functions.

$a_0 = \frac{1}{2\pi}\int_{-\pi}^{\pi}f(x)dx=\frac{1}{2\pi}\int_{-\pi}^{\pi} x dx= 0$

$a_n=\frac{1}{\pi}\int_{-\pi}^{\pi}f(x)\cos(nx)dx= \frac{1}{\pi}\int_{-\pi}^{\pi}x \cos(nx)dx = 0$

$b_n= \frac{1}{\pi}\int_{-\pi}^{\pi}f(x)\sin(nx)dx=\frac{1}{\pi}\int_{-\pi}^{\pi} x \sin(nx)dx =$

$=\frac{2}{\pi}\int_{0}^{\pi} x\sin(nx) dx= \frac{2}{\pi}\left( \left[-\frac{x\cos(nx)}{n}\right]_0^{\pi}+\left[\frac{\sin(nx)}{n^2}\right]_0^{\pi} \right)=(-1)^{n+1}\frac{2}{n}$

Notice that a₀ and a_n are 0 because x and x cos(nx) are odd functions. Hence the Fourier series for f(x) = x is:

$f(x)=x=a_0 + \sum_{n=1}^{\infty}(a_n\cos(nx)+b_n\sin(nx)) =$

$=\sum_{n=1}^{\infty}(-1)^{n+1}\frac{2}{n} \sin(nx), \quad \forall x\in (-\pi,\pi)$

For an application of this Fourier series, see the value of the Riemann zeta function at s=2.

Convergence of Fourier series

While the Fourier coefficients a_n and b_n can be formally defined for any function for which the integrals make sense, whether the series so defined actually converges to f(x) depends on the properties of f.

The simplest answer is that if f is square-integrable then

$\lim_{N\rightarrow\infty}\int_{-\pi}^\pi\left|f(x)-\sum_{n=-N}^{N} F_n\,e^{inx}\right|^2\,dx=0$

(this is convergence in the norm of the space L²).

There are also many known tests that ensure that the series converges at a given point x. For example, if the function is differentiable at x. Even a jump discontinuity does not pose a problem: if the function has left and right derivatives at x, then the Fourier series will converge to the average of the left and right limits (but see Gibbs phenomenon).

However, a fact that many find surprising, is that the Fourier series of a continuous function need not converge pointwise. A discussion of the counterexample, along with other positive and negative results in the general spirit of "for functions of type X, the Fourier series converges in sense Y" may be found in Convergence of Fourier series.

Orthogonality

The Fourier basis functions are orthogonal in the discrete space

$\sum_{n=-\infty}^\infty e^{inx}e^{-iny}=2\pi\sum_{n=-\infty}^\infty \delta(x-y+2\pi n)=2\pi\,\delta_{2\pi}(x-y)$

where δ(x) is the Dirac delta function and δ_T(x) is the Dirac comb function. The Fourier basis functions are orthogonal in the continuous space as well:

$\frac{1}{2\pi}\int_{-\pi}^\pi e^{inx}e^{-imx}\,dx = \delta_{nm}$

where δ_nm is the Kronecker delta function.

Some positive consequences of the homomorphism properties of exp

Because "basis functions" e^ikx are homomorphisms of the real line (more precisely, of the "circle group") we have some useful identities:

Shifting property

$g(x)=f(x-y) \,\!$

then (if G is the transform of g)

$G_k = e^{-iky}F_k \,\!$ .

Convolution theorems

Main article: Convolution

If h(t) is the cyclic convolution of f(t) and g(t):

$h(t)=\int_{-\pi}^\pi f(t')g(t-t')\,dt'$

where g(t)=g(t+2nπ), then the Fourier series transforms are related by:

$H_n=2\pi\,F_nG_n.\,$

Conversely, if H_n=2πF_nG_n, then h(t) will be the cyclic convolution of f(t) and g(t).

In the discrete space, if H_n is the discrete convolution of F_n and G_n:

$H_k=\sum_{n=-\infty}^\infty F_n G_{k-n}$

then the inverse transforms are related by:

$h(t)=f(t)g(t)\,$

and conversely, if h(t)=f(t)g(t), then H_n will be the discrete convolute of F_n and G_n.

These theorems may be proven using the orthogonality relationships.

Plancherel's and Parseval's theorem

Another important property of the Fourier series is the Plancherel theorem

$\sum_{n=-\infty}^\infty F_nG^*_n = \frac{1}{2\pi} \int_{-\pi}^\pi f(x)g^*(x)\,dx$

Parseval's theorem, a special case of the Plancherel theorem, states that

$\sum_{n=-\infty}^\infty |F_n|^2 = \frac{1}{2\pi} \int_{-\pi}^\pi |f(x)|^2 dx \,$

which can be restated for the real-valued f(x) case above,

$\frac{a_0^2}{4} + \frac{1}{2} \sum_{n=1}^\infty \left( a_n^2 + b_n^2 \right) = \frac{1}{2\pi} \int_{-\pi}^\pi f(x)^2 dx$ .

These theorems may be proven using the orthogonality relationships.

General formulation

The useful properties of Fourier series are largely derived from the orthogonality and homomorphism property of the functions $e^{inx} \,\!$ . Other sequences of orthogonal functions have similar properties, although some useful identities concerning e.g. convolutions are no longer true once we lose the homomorphism property. Examples include sequences of Bessel functions and orthogonal polynomials. Such sequences are commonly the solutions of a differential equation; a large class of useful sequences are solutions of the so-called Sturm-Liouville problems.

References

Yitzhak Katznelson, An introduction to harmonic analysis, Second corrected edition. Dover Publications, Inc., New York, 1976. ISBN 0486633314

External links

Fourier series example problems at exampleproblems.com
Java applet shows Fourier series expansion of an arbitrary function

Categories: Fourier analysis | Fourier series | Mathematical series

Last updated: 08-23-2005 01:47:40

Fourier series - Your Art History Reference Guide!