Fourier series

Template:Short description Template:Redirect Template:Fourier transforms A Fourier series (Template:IPAc-en) is an expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series.Template:Sfn By expressing a function as a sum of sines and cosines, many problems involving the function become easier to analyze because trigonometric functions are well understood. For example, Fourier series were first used by Joseph Fourier to find solutions to the heat equation. This application is possible because the derivatives of trigonometric functions fall into simple patterns. Fourier series cannot be used to approximate arbitrary functions, because most functions have infinitely many terms in their Fourier series, and the series do not always converge. Well-behaved functions, for example smooth functions, have Fourier series that converge to the original function. The coefficients of the Fourier series are determined by integrals of the function multiplied by trigonometric functions, described in Template:Slink.

The study of the convergence of Fourier series focus on the behaviors of the partial sums, which means studying the behavior of the sum as more and more terms from the series are summed. The figures below illustrate some partial Fourier series results for the components of a square wave.

• 
  A square wave (represented as the blue dot) is approximated by its sixth partial sum (represented as the purple dot), formed by summing the first six terms (represented as arrows) of the square wave's Fourier series. Each arrow starts at the vertical sum of all the arrows to its left (i.e. the previous partial sum).
• 
  The first four partial sums of the Fourier series for a square wave. As more harmonics are added, the partial sums converge to (become more and more like) the square wave.
• 
  Function $s_6(x)$ (in red) is a Fourier series sum of 6 harmonically related sine waves (in blue). Its Fourier transform $S(f)$ is a frequency-domain representation that reveals the amplitudes of the summed sine waves.

Fourier series are closely related to the Fourier transform, a more general tool that can even find the frequency information for functions that are not periodic. Periodic functions can be identified with functions on a circle; for this reason Fourier series are the subject of Fourier analysis on the circle group, denoted by $𝕋$ or $S_1$. The Fourier transform is also part of Fourier analysis, but is defined for functions on ${ℝ}^n$.

Since Fourier's time, many different approaches to defining and understanding the concept of Fourier series have been discovered, all of which are consistent with one another, but each of which emphasizes different aspects of the topic. Some of the more powerful and elegant approaches are based on mathematical ideas and tools that were not available in Fourier's time. Fourier originally defined the Fourier series for real-valued functions of real arguments, and used the sine and cosine functions in the decomposition. Many other Fourier-related transforms have since been defined, extending his initial idea to many applications and birthing an area of mathematics called Fourier analysis.

HistoryTemplate:Anchor

The Fourier series is named in honor of Jean-Baptiste Joseph Fourier (1768–1830), who made important contributions to the study of trigonometric series, after preliminary investigations by Leonhard Euler, Jean le Rond d'Alembert, and Daniel Bernoulli.Template:Efn-ua Fourier introduced the series for the purpose of solving the heat equation in a metal plate, publishing his initial results in his 1807 Mémoire sur la propagation de la chaleur dans les corps solides (Treatise on the propagation of heat in solid bodies), and publishing his Théorie analytique de la chaleur (Analytical theory of heat) in 1822. The Mémoire introduced Fourier analysis, specifically Fourier series. Through Fourier's research the fact was established that an arbitrary (at first, continuous and later generalized to any piecewise-smooth) function can be represented by a trigonometric series. The first announcement of this great discovery was made by Fourier in 1807, before the French Academy. Early ideas of decomposing a periodic function into the sum of simple oscillating functions date back to the 3rd century BC, when ancient astronomers proposed an empiric model of planetary motions, based on deferents and epicycles.

Independently of Fourier, astronomer Friedrich Wilhelm Bessel introduced Fourier series to solve Kepler's equation. His work was published in 1819, unaware of Fourier's work which remained unpublished until 1822.

The heat equation is a partial differential equation. Prior to Fourier's work, no solution to the heat equation was known in the general case, although particular solutions were known if the heat source behaved in a simple way, in particular, if the heat source was a sine or cosine wave. These simple solutions are now sometimes called eigensolutions. Fourier's idea was to model a complicated heat source as a superposition (or linear combination) of simple sine and cosine waves, and to write the solution as a superposition of the corresponding eigensolutions. This superposition or linear combination is called the Fourier series.

From a modern point of view, Fourier's results are somewhat informal, due to the lack of a precise notion of function and integral in the early nineteenth century. Later, Peter Gustav Lejeune Dirichlet and Bernhard Riemann expressed Fourier's results with greater precision and formality.

Although the original motivation was to solve the heat equation, it later became obvious that the same techniques could be applied to a wide array of mathematical and physical problems, and especially those involving linear differential equations with constant coefficients, for which the eigensolutions are sinusoids. The Fourier series has many such applications in electrical engineering, vibration analysis, acoustics, optics, signal processing, image processing, quantum mechanics, econometrics, shell theory, etc.

Beginnings

Joseph Fourier wrote

This immediately gives any coefficient a_k of the trigonometric series for φ(y) for any function which has such an expansion. It works because if φ has such an expansion, then (under suitable convergence assumptions) the integral $$\begin{array}{cc}& \underset{-1}{\overset{1}{\int }}\phi (y)\cos (2k+1)\frac{\pi y}{2}dy\\ & =\underset{-1}{\overset{1}{\int }}(a\cos \frac{\pi y}{2}\cos (2k+1)\frac{\pi y}{2}+a^{\prime }\cos 3\frac{\pi y}{2}\cos (2k+1)\frac{\pi y}{2}+\cdots )dy\end{array}$$ can be carried out term-by-term. But all terms involving $\cos (2j+1)\frac{\pi y}{2}\cos (2k+1)\frac{\pi y}{2}$ for Template:Nowrap vanish when integrated from −1 to 1, leaving only the $k^{\text{th}}$ term, which is 1.

In these few lines, which are close to the modern formalism used in Fourier series, Fourier revolutionized both mathematics and physics. Although similar trigonometric series were previously used by Euler, d'Alembert, Daniel Bernoulli and Gauss, Fourier believed that such trigonometric series could represent any arbitrary function. In what sense that is actually true is a somewhat subtle issue and the attempts over many years to clarify this idea have led to important discoveries in the theories of convergence, function spaces, and harmonic analysis.

When Fourier submitted a later competition essay in 1811, the committee (which included Lagrange, Laplace, Malus and Legendre, among others) concluded: ...the manner in which the author arrives at these equations is not exempt of difficulties and...his analysis to integrate them still leaves something to be desired on the score of generality and even rigour.

Fourier's motivation

This resulting heat distribution in a metal plate is easily solved using Fourier's method

The Fourier series expansion of the sawtooth function (below) looks more complicated than the simple formula $s(x)=\frac{x}{\pi }$, so it is not immediately apparent why one would need the Fourier series. While there are many applications, Fourier's motivation was in solving the heat equation. For example, consider a metal plate in the shape of a square whose sides measure $\pi$ meters, with coordinates $(x,y)\in [0,\pi ]\times [0,\pi ]$. If there is no heat source within the plate, and if three of the four sides are held at 0 degrees Celsius, while the fourth side, given by $y=\pi$, is maintained at the temperature gradient $T(x,\pi )=x$ degrees Celsius, for $x$ in $(0,\pi )$, then one can show that the stationary heat distribution (or the heat distribution after a long time has elapsed) is given by

$T(x,y)=2\sum _{n=1}^{\mathrm{\infty }}\frac{(-1{)}^{n+1}}{n}\sin (nx)\frac{\sinh (ny)}{\sinh (n\pi )}.$

Here, sinh is the hyperbolic sine function. This solution of the heat equation is obtained by multiplying each term of the equation from Analysis § Example by $\sinh (ny)/\sinh (n\pi )$. While our example function $s(x)$ seems to have a needlessly complicated Fourier series, the heat distribution $T(x,y)$ is nontrivial. The function $T$ cannot be written as a closed-form expression. This method of solving the heat problem was made possible by Fourier's work.

Other applications

Another application is to solve the Basel problem by using Parseval's theorem. The example generalizes and one may compute ζ(2n), for any positive integer n.

Definition

The Fourier series of a complex-valued Template:Math-periodic function $s(x)$, integrable over the interval $[0,P]$ on the real line, is defined as a trigonometric series of the form $$\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}{c}_{{}_n}{e}^{i2\pi \frac{n}{P}x},$$ such that the Fourier coefficients $c_{{}_n}$ are complex numbers defined by the integralTemplate:SfnTemplate:Sfn $$c_{{}_n}=\frac{1}{P}\underset{0}{\overset{P}{\int }}s(x)e^{-i2\pi \frac{n}{P}x}dx.$$ The series does not necessarily converge (in the pointwise sense) and, even if it does, it is not necessarily equal to $s(x)$. Only when certain conditions are satisfied (e.g. if $s(x)$ is continuously differentiable) does the Fourier series converge to $s(x)$, i.e., $$s(x)=\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}{c}_{{}_n}{e}^{i2\pi \frac{n}{P}x}.$$ For functions satisfying the Dirichlet sufficiency conditions, pointwise convergence holds.Template:Sfn However, these are not necessary conditions and there are many theorems about different types of convergence of Fourier series (e.g. uniform convergence or mean convergence).Template:Sfn The definition naturally extends to the Fourier series of a (periodic) distribution $s$ (also called Fourier-Schwartz series).Template:Sfn Then the Fourier series converges to $s(x)$ in the distribution sense.Template:Sfn

The process of determining the Fourier coefficients of a given function or signal is called analysis, while forming the associated trigonometric series (or its various approximations) is called synthesis.

Synthesis

A Fourier series can be written in several equivalent forms, shown here as the $N^{\text{th}}$ partial sums $s_{{}_N}(x)$ of the Fourier series of $s(x)$:

Fig 1. The top graph shows a non-periodic function $s(x)$ in blue defined only over the red interval from 0 to P. The function can be analyzed over this interval to produce the Fourier series in the bottom graph. The Fourier series is always a periodic function, even if original function $s(x)$ is not.

Sine-cosine form

Exponential form

The harmonics are indexed by an integer, $n,$ which is also the number of cycles the corresponding sinusoids make in interval $P$. Therefore, the sinusoids have:

• a wavelength equal to $\frac{P}{n}$ in the same units as $x$.
• a frequency equal to $\frac{n}{P}$ in the reciprocal units of $x$.

These series can represent functions that are just a sum of one or more frequencies in the harmonic spectrum. In the limit $N\to \mathrm{\infty }$, a trigonometric series can also represent the intermediate frequencies and/or non-sinusoidal functions because of the infinite number of terms.

Analysis

The coefficients can be given/assumed, such as a music synthesizer or time samples of a waveform. In the latter case, the exponential form of Fourier series synthesizes a discrete-time Fourier transform where variable $x$ represents frequency instead of time. In general, the coefficients are determined by analysis of a given function $s(x)$ whose domain of definition is an interval of length $P$.Template:Efn-uaTemplate:Sfn

Fourier coefficients

The $\frac{2}{P}$ scale factor follows from substituting Template:EquationNote into Template:EquationNote and utilizing the orthogonality of the trigonometric system. The equivalence of Template:EquationNote and Template:EquationNote follows from Euler's formula $$\cos x=\frac{e^{ix}+e^{-ix}}{2},\sin x=\frac{e^{ix}-e^{-ix}}{2i},$$ resulting in:

Exponential form coefficients

$c_{{}_n}=\{\begin{array}{cc}\frac{1}{2}(a_{{}_n}-i{b}_{{}_n})& \text{if }n>0,\\ a_{{}_n}& \text{if }n=0,\\ \frac{1}{2}(a_{{}_{-n}}+i{b}_{{}_{-n}})& \text{if }n<0,\end{array}$

with $c_0$ being the mean value of $s$ on the interval $P$.Template:Sfn Conversely:

Inverse relationships

$\begin{array}{ccc}{a}_{{}_0}& =c_{{}_0}& \\ a_{{}_n}& =c_{{}_n}+c_{{}_{-n}}& \text{for}n>0\\ b_{{}_n}& =i(c_{{}_n}-c_{{}_{-n}})& \text{for}n>0\end{array}$

Example

Plot of the sawtooth wave, a periodic continuation of the linear function $s(x)=x/\pi$ on the interval $(-\pi ,\pi ]$

Animated plot of the first five successive partial Fourier series

Consider a sawtooth function: $$s(x)=s(x+2\pi k)=\frac{x}{\pi },\mathrm{f}\mathrm{o}\mathrm{r}-\pi <x<\pi ,\text{ and }k\in \mathbb{Z}.$$ In this case, the Fourier coefficients are given by $$\begin{array}{cc}{a}_{{}_0}& =0.\\ a_{{}_n}& =\frac{1}{\pi }\underset{-\pi }{\overset{\pi }{\int }}s(x)\cos (nx)dx=0,n\ge 1.\\ b_{{}_n}& =\frac{1}{\pi }\underset{-\pi }{\overset{\pi }{\int }}s(x)\sin (nx)dx\\ & =-\frac{2}{\pi n}\cos (n\pi )+\frac{2}{{\pi }^2{n}^2}\sin (n\pi )\\ & =\frac{2(-1{)}^{n+1}}{\pi n},n\ge 1.\end{array}$$ It can be shown that the Fourier series converges to $s(x)$ at every point $x$ where $s$ is differentiable, and therefore: $$\begin{array}{cc}s(x)& =a_{{}_0}+\sum _{n=1}^{\mathrm{\infty }}[a_{{}_n}\cos \left(nx\right)+b_{{}_n}\sin \left(nx\right)]\\ & =\frac{2}{\pi }\sum _{n=1}^{\mathrm{\infty }}\frac{(-1{)}^{n+1}}{n}\sin (nx),\mathrm{f}\mathrm{o}\mathrm{r}(x-\pi )\text{is not a multiple of}2\pi .\end{array}$$ When $x=\pi$, the Fourier series converges to 0, which is the half-sum of the left- and right-limit of $s$ at $x=\pi$. This is a particular instance of the Dirichlet theorem for Fourier series.

This example leads to a solution of the Basel problem.

Amplitude-phase form

If the function $s(x)$ is real-valued then the Fourier series can also be represented asTemplate:Sfn

Amplitude-phase form

where $A_n$ is the amplitude and ${\phi }_n$ is the phase shift of the $n^{th}$ harmonic.

The equivalence of Template:EquationNote and Template:EquationNote follows from the trigonometric identity: $$\cos (2\pi \frac{n}{P}x-{\phi }_n)=\cos ({\phi }_n)\cos \left(2\pi \frac{n}{P}x\right)+\sin ({\phi }_n)\sin \left(2\pi \frac{n}{P}x\right),$$ which implies $$a_{{}_n}=A_n\cos ({\phi }_n)\text{and}{b}_{{}_n}=A_n\sin ({\phi }_n)$$

Fig 2. The blue curve is the cross-correlation of a square wave and a cosine template, as the phase lag of the template varies over one cycle. The amplitude and phase at the maximum value are the polar coordinates of one harmonic in the Fourier series expansion of the square wave. The corresponding rectangular coordinates can be determined by evaluating the correlation at just two samples separated by 90°.

are the rectangular coordinates of a vector with polar coordinates $A_n$ and ${\phi }_n$ given by $$A_n=\sqrt{a_{{}_n}^2+b_{{}_n}^2}\text{and}{\phi }_n=\mathrm{Arg}(c_n)=\mathrm{atan2}(b_{{}_n},a_{{}_n})$$ where $\mathrm{Arg}(c_n)$ is the argument of $c_n$.

An example of determining the parameter ${\phi }_n$ for one value of $n$ is shown in Figure 2. It is the value of $\phi$ at the maximum correlation between $s(x)$ and a cosine template, $\cos (2\pi \frac{n}{P}x-\phi ).$ The blue graph is the cross-correlation function, also known as a matched filter:

$\begin{array}{cc}\mathrm{X}(\phi )& =\underset{P}{\int }s(x)\cdot \cos (2\pi \frac{n}{P}x-\phi )dx\phi \in [0,2\pi ]\\ & =\cos (\phi )\underset{X(0)}{\underbrace{\underset{P}{\int }s(x)\cdot \cos \left(2\pi \frac{n}{P}x\right)dx}}+\sin (\phi )\underset{X(\pi /2)}{\underbrace{\underset{P}{\int }s(x)\cdot \sin \left(2\pi \frac{n}{P}x\right)dx}}\end{array}$

Fortunately, it isn't necessary to evaluate this entire function, because its derivative is zero at the maximum: $$X^{\prime }(\phi )=\sin (\phi )\cdot X(0)-\cos (\phi )\cdot X(\pi /2)=0,\text{at}\phi ={\phi }_n.$$ Hence $${\phi }_n\equiv \arctan (b_{{}_n}/a_{{}_n})=\arctan (X(\pi /2)/X(0)).$$

Common notations

The notation $c_{{}_n}$ is inadequate for discussing the Fourier coefficients of several different functions. Therefore, it is customarily replaced by a modified form of the function ($s,$ in this case), such as $\hat{s}(n)$ or $S[n],$ and functional notation often replaces subscripting:

$\begin{array}{cccc}s(x)& =\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}\hat{s}(n)\cdot e^{i2\pi \frac{n}{P}x}& & \text{common mathematics notation}\\ & =\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}S[n]\cdot e^{i2\pi \frac{n}{P}x}& & \text{common engineering notation}\end{array}$

In engineering, particularly when the variable $x$ represents time, the coefficient sequence is called a frequency domain representation. Square brackets are often used to emphasize that the domain of this function is a discrete set of frequencies.

Another commonly used frequency domain representation uses the Fourier series coefficients to modulate a Dirac comb:

$S(f)\triangleq \sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}S[n]\cdot \delta (f-\frac{n}{P}),$

where $f$ represents a continuous frequency domain. When variable $x$ has units of seconds, $f$ has units of hertz. The "teeth" of the comb are spaced at multiples (i.e. harmonics) of $\frac{1}{P}$, which is called the fundamental frequency. $s(x)$ can be recovered from this representation by an inverse Fourier transform:

$\begin{array}{cc}{ℱ}^{-1}\{S(f)\}& =\underset{-\mathrm{\infty }}{\overset{\mathrm{\infty }}{\int }}(\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}S[n]\cdot \delta (f-\frac{n}{P}))e^{i2\pi fx}df,\\ & =\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}S[n]\cdot \underset{-\mathrm{\infty }}{\overset{\mathrm{\infty }}{\int }}\delta (f-\frac{n}{P})e^{i2\pi fx}df,\\ & =\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}S[n]\cdot e^{i2\pi \frac{n}{P}x}\triangleq s(x).\end{array}$

The constructed function $S(f)$ is therefore commonly referred to as a Fourier transform, even though the Fourier integral of a periodic function is not convergent at the harmonic frequencies.Template:Efn-ua

Table of common Fourier series

Some common pairs of periodic functions and their Fourier series coefficients are shown in the table below.

• $s(x)$ designates a periodic function with period $P.$
• $a_{{}_0},a_{{}_n},b_{{}_n}$ designate the Fourier series coefficients (sine-cosine form) of the periodic function $s(x).$

Time domain $s(x)$	Plot	Frequency domain (sine-cosine form) $\begin{array}{cc}& a_{{}_0}\\ & a_{{}_n}\text{for }n\ge 1\\ & b_{{}_n}\text{for }n\ge 1\end{array}$	Remarks	Reference
$s(x)=A|\sin \left(\frac{2\pi }{P}x\right)|\text{for }0\le x<P$		$\begin{array}{cc}{a}_{{}_0}=& \frac{2A}{\pi }\\ a_{{}_n}=& \{\begin{array}{cc}\frac{-4A}{\pi }\frac{1}{n^2-1}& n\text{ even}\\ 0& n\text{ odd}\end{array}\\ b_{{}_n}=& 0\\ \end{array}$	Full-wave rectified sine	Template:Rp
$s(x)=\{\begin{array}{cc}A\sin \left(\frac{2\pi }{P}x\right)& \text{for }0\le x<P/2\\ 0& \text{for }P/2\le x<P\end{array}$		$\begin{array}{cc}{a}_{{}_0}=& \frac{A}{\pi }\\ a_{{}_n}=& \{\begin{array}{cc}\frac{-2A}{\pi }\frac{1}{n^2-1}& n\text{ even}\\ 0& n\text{ odd}\end{array}\\ b_{{}_n}=& \{\begin{array}{cc}\frac{A}{2}& n=1\\ 0& n>1\end{array}\\ \end{array}$	Half-wave rectified sine	Template:Rp
$s(x)=\{\begin{array}{cc}A& \text{for }0\le x<D\cdot P\\ 0& \text{for }D\cdot P\le x<P\end{array}$		$\begin{array}{cc}{a}_{{}_0}=& AD\\ a_{{}_n}=& \frac{A}{n\pi }\sin \left(2\pi nD\right)\\ b_{{}_n}=& \frac{2A}{n\pi }{(\sin \left(\pi nD\right))}^2\\ \end{array}$	$0\le D\le 1$
$s(x)=\frac{Ax}{P}\text{for }0\le x<P$		$\begin{array}{cc}{a}_{{}_0}=& \frac{A}{2}\\ a_{{}_n}=& 0\\ b_{{}_n}=& \frac{-A}{n\pi }\\ \end{array}$		Template:Rp
$s(x)=A-\frac{Ax}{P}\text{for }0\le x<P$		$\begin{array}{cc}{a}_{{}_0}=& \frac{A}{2}\\ a_{{}_n}=& 0\\ b_{{}_n}=& \frac{A}{n\pi }\\ \end{array}$		Template:Rp
$s(x)=\frac{4A}{P^2}{(x-\frac{P}{2})}^2\text{for }0\le x<P$		$\begin{array}{cc}{a}_{{}_0}=& \frac{A}{3}\\ a_{{}_n}=& \frac{4A}{{\pi }^2{n}^2}\\ b_{{}_n}=& 0\\ \end{array}$		Template:Rp

Table of basic transformation rules

Template:See also This table shows some mathematical operations in the time domain and the corresponding effect in the Fourier series coefficients. Notation:

• Complex conjugation is denoted by an asterisk.
• $s(x),r(x)$ designate $P$-periodic functions or functions defined only for $x\in [0,P].$
• $S[n],R[n]$ designate the Fourier series coefficients (exponential form) of $s$ and $r.$

Property	Time domain	Frequency domain (exponential form)	Remarks	Reference
Linearity	$a\cdot s(x)+b\cdot r(x)$	$a\cdot S[n]+b\cdot R[n]$	$a,b\in ℂ$
Time reversal / Frequency reversal	$s(-x)$	$S[-n]$		Template:Rp
Time conjugation	$s^{*}(x)$	$S^{*}[-n]$		Template:Rp
Time reversal & conjugation	$s^{*}(-x)$	$S^{*}[n]$
Real part in time	$\mathrm{Re}(s(x))$	$\frac{1}{2}(S[n]+S^{*}[-n])$
Imaginary part in time	$\mathrm{Im}(s(x))$	$\frac{1}{2i}(S[n]-S^{*}[-n])$
Real part in frequency	$\frac{1}{2}(s(x)+s^{*}(-x))$	$\mathrm{Re}(S[n])$
Imaginary part in frequency	$\frac{1}{2i}(s(x)-s^{*}(-x))$	$\mathrm{Im}(S[n])$
Shift in time / Modulation in frequency	$s(x-x_0)$	$S[n]\cdot e^{-i2\pi \frac{x_0}{P}n}$	$x_0\in ℝ$	Template:Rp
Shift in frequency / Modulation in time	$s(x)\cdot e^{i2\pi \frac{n_0}{P}x}$	$S[n-n_0]$	$n_0\in \mathbb{Z}$	Template:Rp

Properties

Symmetry relations

When the real and imaginary parts of a complex function are decomposed into their even and odd parts, there are four components, denoted below by the subscripts RE, RO, IE, and IO. And there is a one-to-one mapping between the four components of a complex time function and the four components of its complex frequency transform:Template:SfnTemplate:Sfn

$\begin{array}{cccccccccc}𝖳𝗂𝗆𝖾𝖽𝗈𝗆𝖺𝗂𝗇& s& =& s_{{}_{\text{RE}}}& +& s_{{}_{\text{RO}}}& +& i{s}_{{}_{\text{IE}}}& +& \underbrace{i{s}_{{}_{\text{IO}}}}\\ & \Updownarrow ℱ& & \Updownarrow ℱ& & \Updownarrow ℱ& & \Updownarrow ℱ& & \Updownarrow ℱ\\ 𝖥𝗋𝖾𝗊𝗎𝖾𝗇𝖼𝗒𝖽𝗈𝗆𝖺𝗂𝗇& S& =& S_{\text{RE}}& +& \overbrace{i{S}_{\text{IO}}}& +& i{S}_{\text{IE}}& +& S_{\text{RO}}\end{array}$

From this, various relationships are apparent, for example:

• The transform of a real-valued function $(s_{{}_{RE}}+s_{{}_{RO}})$ is the conjugate symmetric function $S_{RE}+i{S}_{IO}.$ Conversely, a conjugate symmetric transform implies a real-valued time-domain.
• The transform of an imaginary-valued function $(i{s}_{{}_{IE}}+i{s}_{{}_{IO}})$ is the conjugate antisymmetric function $S_{RO}+i{S}_{IE},$ and the converse is true.
• The transform of a conjugate symmetric function $(s_{{}_{RE}}+i{s}_{{}_{IO}})$ is the real-valued function $S_{RE}+S_{RO},$ and the converse is true.
• The transform of a conjugate antisymmetric function $(s_{{}_{RO}}+i{s}_{{}_{IE}})$ is the imaginary-valued function $i{S}_{IE}+i{S}_{IO},$ and the converse is true.

Riemann–Lebesgue lemma

Template:Main If $S$ is integrable, $\underset{|n|\to \mathrm{\infty }}{\lim }S[n]=0$, $\underset{n\to +\mathrm{\infty }}{\lim }{a}_n=0$ and $\underset{n\to +\mathrm{\infty }}{\lim }{b}_n=0.$

Parseval's theorem

Template:Main If $s$ belongs to $L^2(P)$ (periodic over an interval of length $P$) then: $$\frac{1}{P}\underset{P}{\int }|s(x){|}^{2}dx=\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}|S[n]{|}^2.$$

Plancherel's theorem

Template:Main If $c_0,c_{\pm 1},c_{\pm 2},\dots$ are coefficients and ${\sum }_{n=-\mathrm{\infty }}^{\mathrm{\infty }}|c_n{|}^2<\mathrm{\infty }$ then there is a unique function $s\in L^2(P)$ such that $S[n]=c_n$ for every $n$.

Convolution theorems

Given $P$-periodic functions, $s_{{}_P}$ and $r_{{}_P}$ with Fourier series coefficients $S[n]$ and $R[n],$ $n\in \mathbb{Z},$

• The pointwise product: $$h_{{}_P}(x)\triangleq s_{{}_P}(x)\cdot r_{{}_P}(x)$$ is also $P$-periodic, and its Fourier series coefficients are given by the discrete convolution of the $S$ and $R$ sequences: $$H[n]=\{S*R\}[n].$$
• The periodic convolution: $$h_{{}_P}(x)\triangleq \underset{P}{\int }{s}_{{}_P}(\tau )\cdot r_{{}_P}(x-\tau )d\tau$$ is also $P$-periodic, with Fourier series coefficients: $$H[n]=P\cdot S[n]\cdot R[n].$$
• A doubly infinite sequence ${\left\{c_n\right\}}_{n\in Z}$ in $c_0(\mathbb{Z})$ is the sequence of Fourier coefficients of a function in $L^1([0,2\pi ])$ if and only if it is a convolution of two sequences in ${\ell }^2(\mathbb{Z})$. See

Derivative property

If $s$ is a 2Template:Pi-periodic function on $ℝ$ which is $k$ times differentiable, and its $k^{\text{th}}$ derivative is continuous, then $s$ belongs to the function space $C^k(ℝ)$.

• If $s\in C^k(ℝ)$, then the Fourier coefficients of the $k^{\text{th}}$ derivative of $s$ can be expressed in terms of the Fourier coefficients $\hat{s}[n]$ of $s$, via the formula $$\widehat{s^{(k)}}[n]=(in{)}^k\hat{s}[n].$$ In particular, since for any fixed $k\ge 1$ we have $\widehat{s^{(k)}}[n]\to 0$ as $n\to \mathrm{\infty }$, it follows that $|n{|}^k\hat{s}[n]$ tends to zero, i.e., the Fourier coefficients converge to zero faster than the $k^{\text{th}}$ power of $|n|$.

Compact groups

One of the interesting properties of the Fourier transform which we have mentioned, is that it carries convolutions to pointwise products. If that is the property which we seek to preserve, one can produce Fourier series on any compact group. Typical examples include those classical groups that are compact. This generalizes the Fourier transform to all spaces of the form L²(G), where G is a compact group, in such a way that the Fourier transform carries convolutions to pointwise products. The Fourier series exists and converges in similar ways to the Template:Closed-closed case.

An alternative extension to compact groups is the Peter–Weyl theorem, which proves results about representations of compact groups analogous to those about finite groups.

The atomic orbitals of chemistry are partially described by spherical harmonics, which can be used to produce Fourier series on the sphere.

Riemannian manifolds

If the domain is not a group, then there is no intrinsically defined convolution. However, if $X$ is a compact Riemannian manifold, it has a Laplace–Beltrami operator. The Laplace–Beltrami operator is the differential operator that corresponds to Laplace operator for the Riemannian manifold $X$. Then, by analogy, one can consider heat equations on $X$. Since Fourier arrived at his basis by attempting to solve the heat equation, the natural generalization is to use the eigensolutions of the Laplace–Beltrami operator as a basis. This generalizes Fourier series to spaces of the type $L^2(X)$, where $X$ is a Riemannian manifold. The Fourier series converges in ways similar to the $[-\pi ,\pi ]$ case. A typical example is to take $X$ to be the sphere with the usual metric, in which case the Fourier basis consists of spherical harmonics.

Locally compact Abelian groups

The generalization to compact groups discussed above does not generalize to noncompact, nonabelian groups. However, there is a straightforward generalization to Locally Compact Abelian (LCA) groups.

This generalizes the Fourier transform to $L^1(G)$ or $L^2(G)$, where $G$ is an LCA group. If $G$ is compact, one also obtains a Fourier series, which converges similarly to the $[-\pi ,\pi ]$ case, but if $G$ is noncompact, one obtains instead a Fourier integral. This generalization yields the usual Fourier transform when the underlying locally compact Abelian group is $ℝ$.

Extensions

Fourier-Stieltjes series

Template:See also Let $F(x)$ be a function of bounded variation defined on the closed inverval $[0,P]\subseteq ℝ$. The Fourier series whose coefficients are given byTemplate:Sfn $$c_{{}_n}=\frac{1}{P}\underset{0}{\overset{P}{\int }}{e}^{-i2\pi \frac{n}{P}x}dF(x),\mathrm{\forall }n\in \mathbb{Z},$$ is called the Fourier-Stieltjes series. The space of functions of bounded variation $BV$ is a subspace of $L^1$. As any $F\in BV$ defines a Radon measure (i.e. a locally finite Borel measure on $ℝ$), this definition can be extended as follows.

Consider the space $M$ of all finite Borel measures on the real line; as such $L^1\subset M$.Template:Sfn If there is a measure $\mu \in M$ such that the Fourier-Stieltjes coefficients are given by $$c_n=\hat{\mu }(n)=\frac{1}{P}\underset{0}{\overset{P}{\int }}{e}^{-i2\pi \frac{n}{P}x}d\mu (x),\mathrm{\forall }n\in \mathbb{Z},$$ then the series is called a Fourier-Stieltjes series. Likewise, the function $\hat{\mu }(n)$, where $\mu \in M$, is called a Fourier-Stieltjes transform.Template:Sfn

The question whether or not $\mu$ exists for a given sequence of $c_n$ forms the basis of the trigonometric moment problem.Template:Sfn

Furthermore, $M$ is a strict subspace of the space of (tempered) distributions $𝒟$, i.e., $M\subset 𝒟$. If the Fourier coefficients are determined by a distribution $F\in 𝒟$ then the series is described as a Fourier-Schwartz series. Contrary to the Fourier-Stieltjes series, deciding whether a given series is a Fourier series or a Fourier-Schwartz series is relatively trivial due to the characteristics of its dual space; the Schwartz space $𝒮({ℝ}^n)$.Template:Sfn

Fourier series on a square

We can also define the Fourier series for functions of two variables $x$ and $y$ in the square $[-\pi ,\pi ]\times [-\pi ,\pi ]$: $$\begin{array}{cc}f(x,y)& =\sum _{j,k\in \mathbb{Z}}{c}_{j,k}{e}^{ijx}{e}^{iky},\\ c_{j,k}& =\frac{1}{4{\pi }^2}\underset{-\pi }{\overset{\pi }{\int }}\underset{-\pi }{\overset{\pi }{\int }}f(x,y)e^{-ijx}{e}^{-iky}dxdy.\end{array}$$

Aside from being useful for solving partial differential equations such as the heat equation, one notable application of Fourier series on the square is in image compression. In particular, the JPEG image compression standard uses the two-dimensional discrete cosine transform, a discrete form of the Fourier cosine transform, which uses only cosine as the basis function.

For two-dimensional arrays with a staggered appearance, half of the Fourier series coefficients disappear, due to additional symmetry.

Fourier series of Bravais-lattice-periodic-function

A three-dimensional Bravais lattice is defined as the set of vectors of the form: $$𝐑=n_1{𝐚}_1+n_2{𝐚}_2+n_3{𝐚}_3$$ where $n_i$ are integers and ${𝐚}_i$ are three linearly independent vectors. Assuming we have some function, $f(𝐫)$, such that it obeys the condition of periodicity for any Bravais lattice vector $𝐑$, $f(𝐫)=f(𝐑+𝐫)$, we could make a Fourier series of it. This kind of function can be, for example, the effective potential that one electron "feels" inside a periodic crystal. It is useful to make the Fourier series of the potential when applying Bloch's theorem. First, we may write any arbitrary position vector $𝐫$ in the coordinate-system of the lattice: $$𝐫=x_1\frac{{𝐚}_1}{a_1}+x_2\frac{{𝐚}_2}{a_2}+x_3\frac{{𝐚}_3}{a_3},$$ where $a_i\triangleq |{𝐚}_i|,$ meaning that $a_i$ is defined to be the magnitude of ${𝐚}_i$, so $\widehat{{𝐚}_i}=\frac{{𝐚}_i}{a_i}$ is the unit vector directed along ${𝐚}_i$.

Thus we can define a new function, $$g(x_1,x_2,x_3)\triangleq f(𝐫)=f(x_1\frac{{𝐚}_1}{a_1}+x_2\frac{{𝐚}_2}{a_2}+x_3\frac{{𝐚}_3}{a_3}).$$

This new function, $g(x_1,x_2,x_3)$, is now a function of three-variables, each of which has periodicity $a_1$, $a_2$, and $a_3$ respectively: $$g(x_1,x_2,x_3)=g(x_1+a_1,x_2,x_3)=g(x_1,x_2+a_2,x_3)=g(x_1,x_2,x_3+a_3).$$

This enables us to build up a set of Fourier coefficients, each being indexed by three independent integers $m_1,m_2,m_3$. In what follows, we use function notation to denote these coefficients, where previously we used subscripts. If we write a series for $g$ on the interval $[0,a_1]$ for $x_1$, we can define the following: $$h^{\mathrm{o}\mathrm{n}\mathrm{e}}(m_1,x_2,x_3)\triangleq \frac{1}{a_1}\underset{0}{\overset{a_1}{\int }}g(x_1,x_2,x_3)\cdot e^{-i2\pi \frac{m_1}{a_1}{x}_1}d{x}_1$$

And then we can write: $$g(x_1,x_2,x_3)=\sum _{m_1=-\mathrm{\infty }}^{\mathrm{\infty }}{h}^{\mathrm{o}\mathrm{n}\mathrm{e}}(m_1,x_2,x_3)\cdot e^{i2\pi \frac{m_1}{a_1}{x}_1}$$

Further defining: $$\begin{array}{cc}{h}^{\mathrm{t}\mathrm{w}\mathrm{o}}(m_1,m_2,x_3)& \triangleq \frac{1}{a_2}\underset{0}{\overset{a_2}{\int }}{h}^{\mathrm{o}\mathrm{n}\mathrm{e}}(m_1,x_2,x_3)\cdot e^{-i2\pi \frac{m_2}{a_2}{x}_2}d{x}_2\\ & =\frac{1}{a_2}\underset{0}{\overset{a_2}{\int }}d{x}_2\frac{1}{a_1}\underset{0}{\overset{a_1}{\int }}d{x}_{1}g(x_1,x_2,x_3)\cdot e^{-i2\pi (\frac{m_1}{a_1}{x}_1+\frac{m_2}{a_2}{x}_2)}\end{array}$$

We can write $g$ once again as: $$g(x_1,x_2,x_3)=\sum _{m_1=-\mathrm{\infty }}^{\mathrm{\infty }}\sum _{m_2=-\mathrm{\infty }}^{\mathrm{\infty }}{h}^{\mathrm{t}\mathrm{w}\mathrm{o}}(m_1,m_2,x_3)\cdot e^{i2\pi \frac{m_1}{a_1}{x}_1}\cdot e^{i2\pi \frac{m_2}{a_2}{x}_2}$$

Finally applying the same for the third coordinate, we define: $$\begin{array}{cc}{h}^{\mathrm{t}\mathrm{h}\mathrm{r}\mathrm{e}\mathrm{e}}(m_1,m_2,m_3)& \triangleq \frac{1}{a_3}\underset{0}{\overset{a_3}{\int }}{h}^{\mathrm{t}\mathrm{w}\mathrm{o}}(m_1,m_2,x_3)\cdot e^{-i2\pi \frac{m_3}{a_3}{x}_3}d{x}_3\\ & =\frac{1}{a_3}\underset{0}{\overset{a_3}{\int }}d{x}_3\frac{1}{a_2}\underset{0}{\overset{a_2}{\int }}d{x}_2\frac{1}{a_1}\underset{0}{\overset{a_1}{\int }}d{x}_{1}g(x_1,x_2,x_3)\cdot e^{-i2\pi (\frac{m_1}{a_1}{x}_1+\frac{m_2}{a_2}{x}_2+\frac{m_3}{a_3}{x}_3)}\end{array}$$

We write $g$ as: $$g(x_1,x_2,x_3)=\sum _{m_1=-\mathrm{\infty }}^{\mathrm{\infty }}\sum _{m_2=-\mathrm{\infty }}^{\mathrm{\infty }}\sum _{m_3=-\mathrm{\infty }}^{\mathrm{\infty }}{h}^{\mathrm{t}\mathrm{h}\mathrm{r}\mathrm{e}\mathrm{e}}(m_1,m_2,m_3)\cdot e^{i2\pi \frac{m_1}{a_1}{x}_1}\cdot e^{i2\pi \frac{m_2}{a_2}{x}_2}\cdot e^{i2\pi \frac{m_3}{a_3}{x}_3}$$

Re-arranging: $$g(x_1,x_2,x_3)=\sum _{m_1,m_2,m_3\in \mathbb{Z}}{h}^{\mathrm{t}\mathrm{h}\mathrm{r}\mathrm{e}\mathrm{e}}(m_1,m_2,m_3)\cdot e^{i2\pi (\frac{m_1}{a_1}{x}_1+\frac{m_2}{a_2}{x}_2+\frac{m_3}{a_3}{x}_3)}.$$

Now, every reciprocal lattice vector can be written (but does not mean that it is the only way of writing) as $𝐆=m_1{𝐠}_1+m_2{𝐠}_2+m_3{𝐠}_3$, where $m_i$ are integers and ${𝐠}_i$ are reciprocal lattice vectors to satisfy ${𝐠}_{𝐢}\cdot {𝐚}_{𝐣}=2\pi {\delta }_{ij}$ (${\delta }_{ij}=1$ for $i=j$, and ${\delta }_{ij}=0$ for $i\ne j$). Then for any arbitrary reciprocal lattice vector $𝐆$ and arbitrary position vector $𝐫$ in the original Bravais lattice space, their scalar product is: $$𝐆\cdot 𝐫=(m_1{𝐠}_1+m_2{𝐠}_2+m_3{𝐠}_3)\cdot (x_1\frac{{𝐚}_1}{a_1}+x_2\frac{{𝐚}_2}{a_2}+x_3\frac{{𝐚}_3}{a_3})=2\pi (x_1\frac{m_1}{a_1}+x_2\frac{m_2}{a_2}+x_3\frac{m_3}{a_3}).$$

So it is clear that in our expansion of $g(x_1,x_2,x_3)=f(𝐫)$, the sum is actually over reciprocal lattice vectors: $$f(𝐫)=\sum _{𝐆}h(𝐆)\cdot e^{i𝐆\cdot 𝐫},$$

where $$h(𝐆)=\frac{1}{a_3}\underset{0}{\overset{a_3}{\int }}d{x}_3\frac{1}{a_2}\underset{0}{\overset{a_2}{\int }}d{x}_2\frac{1}{a_1}\underset{0}{\overset{a_1}{\int }}d{x}_{1}f(x_1\frac{{𝐚}_1}{a_1}+x_2\frac{{𝐚}_2}{a_2}+x_3\frac{{𝐚}_3}{a_3})\cdot e^{-i𝐆\cdot 𝐫}.$$

Assuming $$𝐫=(x,y,z)=x_1\frac{{𝐚}_1}{a_1}+x_2\frac{{𝐚}_2}{a_2}+x_3\frac{{𝐚}_3}{a_3},$$ we can solve this system of three linear equations for $x$, $y$, and $z$ in terms of $x_1$, $x_2$ and $x_3$ in order to calculate the volume element in the original rectangular coordinate system. Once we have $x$, $y$, and $z$ in terms of $x_1$, $x_2$ and $x_3$, we can calculate the Jacobian determinant: $$\left|\begin{array}{ccc}\frac{\partial x_1}{\partial x}& \frac{\partial x_1}{\partial y}& \frac{\partial x_1}{\partial z}\\ \frac{\partial x_2}{\partial x}& \frac{\partial x_2}{\partial y}& \frac{\partial x_2}{\partial z}\\ \frac{\partial x_3}{\partial x}& \frac{\partial x_3}{\partial y}& \frac{\partial x_3}{\partial z}\end{array}\right|$$ which after some calculation and applying some non-trivial cross-product identities can be shown to be equal to: $$\frac{a_1{a}_2{a}_3}{{𝐚}_1\cdot ({𝐚}_2\times {𝐚}_3)}$$

(it may be advantageous for the sake of simplifying calculations, to work in such a rectangular coordinate system, in which it just so happens that ${𝐚}_1$ is parallel to the x axis, ${𝐚}_2$ lies in the xy-plane, and ${𝐚}_3$ has components of all three axes). The denominator is exactly the volume of the primitive unit cell which is enclosed by the three primitive-vectors ${𝐚}_1$, ${𝐚}_2$ and ${𝐚}_3$. In particular, we now know that $$d{x}_{1}d{x}_{2}d{x}_3=\frac{a_1{a}_2{a}_3}{{𝐚}_1\cdot ({𝐚}_2\times {𝐚}_3)}\cdot dxdydz.$$

We can write now $h(𝐆)$ as an integral with the traditional coordinate system over the volume of the primitive cell, instead of with the $x_1$, $x_2$ and $x_3$ variables: $$h(𝐆)=\frac{1}{{𝐚}_1\cdot ({𝐚}_2\times {𝐚}_3)}\underset{C}{\int }d𝐫f(𝐫)\cdot e^{-i𝐆\cdot 𝐫}$$ writing $d𝐫$ for the volume element $dxdydz$; and where $C$ is the primitive unit cell, thus, ${𝐚}_1\cdot ({𝐚}_2\times {𝐚}_3)$ is the volume of the primitive unit cell.

Hilbert space

As the trigonometric series is a special class of orthogonal system, Fourier series can naturally be defined in the context of Hilbert spaces. For example, the space of square-integrable functions on $[-\pi ,\pi ]$ forms the Hilbert space $L^2([-\pi ,\pi ])$. Its inner product, defined for any two elements $f$ and $g$, is given by: $$⟨f,g⟩=\frac{1}{2\pi }\underset{-\pi }{\overset{\pi }{\int }}f(x)\overline{g(x)}dx.$$ This space is equipped with the orthonormal basis $\{e_n=e^{inx}:n\in \mathbb{Z}\}$. Then the (generalized) Fourier series expansion of $f\in L^2([-\pi ,\pi ])$, given by $$f(x)=\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}{c}_{{}_n}{e}^{inx},$$ can be written asTemplate:Sfn $$f=\sum _{n=-\mathrm{\infty }}^{\mathrm{\infty }}⟨f,e_n⟩e_n.$$

Sines and cosines form an orthogonal set, as illustrated above. The integral of sine, cosine and their product is zero (green and red areas are equal, and cancel out) when $m$, $n$ or the functions are different, and π only if $m$ and $n$ are equal, and the function used is the same. They would form an orthonormal set, if the integral equaled 1 (that is, each function would need to be scaled by $1/\sqrt{\pi }$).

The sine-cosine form follows in a similar fashion. Indeed, the sines and cosines form an orthogonal set: $$\underset{-\pi }{\overset{\pi }{\int }}\cos (mx)\cos (nx)dx=\frac{1}{2}\underset{-\pi }{\overset{\pi }{\int }}\cos ((n-m)x)+\cos ((n+m)x)dx=\pi {\delta }_{mn},m,n\ge 1,$$ $$\underset{-\pi }{\overset{\pi }{\int }}\sin (mx)\sin (nx)dx=\frac{1}{2}\underset{-\pi }{\overset{\pi }{\int }}\cos ((n-m)x)-\cos ((n+m)x)dx=\pi {\delta }_{mn},m,n\ge 1$$ (where δ_mn is the Kronecker delta), and $$\underset{-\pi }{\overset{\pi }{\int }}\cos (mx)\sin (nx)dx=\frac{1}{2}\underset{-\pi }{\overset{\pi }{\int }}\sin ((n+m)x)+\sin ((n-m)x)dx=0;$$ Hence, the set $$\{\frac{1}{\sqrt{2}},\frac{\cos x}{\sqrt{2}},\frac{\sin x}{\sqrt{2}},\dots ,\frac{\cos (nx)}{\sqrt{2}},\frac{\sin (nx)}{\sqrt{2}},\dots \},$$ also forms an orthonormal basis for $L^2([-\pi ,\pi ])$. The density of their span is a consequence of the Stone–Weierstrass theorem, but follows also from the properties of classical kernels like the Fejér kernel.

Fourier theorem proving convergence of Fourier series

In engineering, the Fourier series is generally assumed to converge except at jump discontinuities since the functions encountered in engineering are usually better-behaved than those in other disciplines. In particular, if $s$ is continuous and the derivative of $s(x)$ (which may not exist everywhere) is square integrable, then the Fourier series of $s$ converges absolutely and uniformly to $s(x)$. If a function is square-integrable on the interval $[x_0,x_0+P]$, then the Fourier series converges to the function almost everywhere. It is possible to define Fourier coefficients for more general functions or distributions, in which case pointwise convergence often fails, and convergence in norm or weak convergence is usually studied.

• 
  Four partial sums (Fourier series) of lengths 1, 2, 3, and 4 terms, showing how the approximation to a square wave improves as the number of terms increases (animation)
• 
  Four partial sums (Fourier series) of lengths 1, 2, 3, and 4 terms, showing how the approximation to a sawtooth wave improves as the number of terms increases (animation)
• 
  Example of convergence to a somewhat arbitrary function. Note the development of the "ringing" (Gibbs phenomenon) at the transitions to/from the vertical sections.

The theorems proving that a Fourier series is a valid representation of any periodic function (that satisfies the Dirichlet conditions), and informal variations of them that don't specify the convergence conditions, are sometimes referred to generically as Fourier's theorem or the Fourier theorem.

Least squares property

The earlier Template:EquationNote:

$s_{{}_N}(x)=\sum _{n=-N}^{N}S[n]e^{i2\pi \frac{n}{P}x},$

is a trigonometric polynomial of degree $N$ that can be generally expressed as:

$p_{{}_N}(x)=\sum _{n=-N}^{N}p[n]e^{i2\pi \frac{n}{P}x}.$

Parseval's theorem implies that:

Convergence theorems

Template:See also Because of the least squares property, and because of the completeness of the Fourier basis, we obtain an elementary convergence result.

Template:Math theorem If $s$ is continuously differentiable, then $(in)S[n]$ is the $n^{\text{th}}$ Fourier coefficient of the first derivative $s^{\prime }$. Since $s^{\prime }$ is continuous, and therefore bounded, it is square-integrable and its Fourier coefficients are square-summable. Then, by the Cauchy–Schwarz inequality,

${(\sum _{n\ne 0}|S[n]|)}^2\le \sum _{n\ne 0}\frac{1}{n^2}\cdot \sum _{n\ne 0}|nS[n]{|}^2.$

This means that $s$ is absolutely summable. The sum of this series is a continuous function, equal to $s$, since the Fourier series converges in $L^1$ to $s$:

This result can be proven easily if $s$ is further assumed to be $C^2$, since in that case $n^{2}S[n]$ tends to zero as $n\to \mathrm{\infty }$. More generally, the Fourier series is absolutely summable, thus converges uniformly to $s$, provided that $s$ satisfies a Hölder condition of order $\alpha >1/2$. In the absolutely summable case, the inequality:

$\underset{x}{\sup }|s(x)-s_{{}_N}(x)|\le \sum _{|n|>N}|S[n]|$

proves uniform convergence.

Many other results concerning the convergence of Fourier series are known, ranging from the moderately simple result that the series converges at $x$ if $s$ is differentiable at $x$, to more sophisticated results such as Carleson's theorem which states that the Fourier series of an $L^2$ function converges almost everywhere.

Divergence

Since Fourier series have such good convergence properties, many are often surprised by some of the negative results. For example, the Fourier series of a continuous T-periodic function need not converge pointwise. The uniform boundedness principle yields a simple non-constructive proof of this fact.

In 1922, Andrey Kolmogorov published an article titled Une série de Fourier-Lebesgue divergente presque partout in which he gave an example of a Lebesgue-integrable function whose Fourier series diverges almost everywhere. He later constructed an example of an integrable function whose Fourier series diverges everywhere.Template:Sfn

It is possible to give explicit examples of a continuous function whose Fourier series diverges at 0: for instance, the even and 2π-periodic function f defined for all x in [0,π] by

$f(x)=\sum _{n=1}^{\mathrm{\infty }}\frac{1}{n^2}\sin \left[(2^{n^3}+1)\frac{x}{2}\right].$

Because the function is even the Fourier series contains only cosines:

$\sum _{m=0}^{\mathrm{\infty }}{C}_m\cos (mx).$

The coefficients are:

$C_m=\frac{1}{\pi }\sum _{n=1}^{\mathrm{\infty }}\frac{1}{n^2}\{\frac{2}{2^{n^3}+1-2m}+\frac{2}{2^{n^3}+1+2m}\}$

As Template:Mvar increases, the coefficients will be positive and increasing until they reach a value of about $C_m\approx 2/(n^2\pi )$ at $m=2^{n^3}/2$ for some Template:Mvar and then become negative (starting with a value around $-2/(n^2\pi )$) and getting smaller, before starting a new such wave. At $x=0$ the Fourier series is simply the running sum of $C_m,$ and this builds up to around

$\frac{1}{n^2\pi }\sum _{k=0}^{2^{n^3}/2}\frac{2}{2k+1}\sim \frac{1}{n^2\pi }\ln 2^{n^3}=\frac{n}{\pi }\ln 2$

in the Template:Mvarth wave before returning to around zero, showing that the series does not converge at zero but reaches higher and higher peaks. Note that though the function is continuous, it is not differentiable.

See also

• ATS theorem
• Carleson's theorem
• Dirichlet kernel
• Discrete Fourier transform
• Fast Fourier transform
• Fejér's theorem
• Fourier analysis
• Fourier inversion theorem
• Fourier sine and cosine series
• Fourier transform
• Gibbs phenomenon
• Half range Fourier series
• Laurent series – the substitution q = e^ix transforms a Fourier series into a Laurent series, or conversely. This is used in the q-series expansion of the j-invariant.
• Least-squares spectral analysis
• Multidimensional transform
• Residue theorem integrals of f(z), singularities, poles
• Sine and cosine transforms
• Spectral theory
• Sturm–Liouville theory
• Trigonometric moment problem

References

Bibliography

• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book 2003 unabridged republication of the 1878 English translation by Alexander Freeman of Fourier's work Théorie Analytique de la Chaleur, originally published in 1822.
• Template:Cite book
• Template:Cite book
• Template:Cite journal
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book Translated by M. Ackerman from Vorlesungen über die Entwicklung der Mathematik im 19 Jahrhundert, Springer, Berlin, 1928.
• Template:Cite journal
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book The first edition was published in 1935.

External links

• Template:Springer
• Template:Cite EB1911
• Template:MathWorld
• Template:Webarchive