Fourier series explained

A Fourier series is an expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series, but not all trigonometric series are Fourier series.^[1] 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 Common forms of the Fourier series below.

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.

Fourier series are closely related to the Fourier transform, which can be used to 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 a circle, usually denoted as

T or S _{1} . The Fourier transform is also part of Fourier analysis, but is defined for functions on R ^{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.

Common forms of the Fourier series

A Fourier series is a continuous, periodic function created by a summation of harmonically related sinusoidal functions. It has several different, but equivalent, forms, shown here as partial sums. But in theory

N → inf ty. The subscripted symbols, called coefficients, and the period, P, determine the function s _{\scriptscriptstyle} (x) as follows:

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

\tfrac{P}{n} in the same units as x .

• a frequency equal to

\tfrac{n}{P} in the reciprocal units of x .

Clearly these series can represent functions that are just a sum of one or more of the harmonic frequencies. The remarkable thing is that it can also represent the intermediate frequencies and/or non-sinusoidal functions because of the infinite number of terms. The amplitude-phase form is particularly useful for its insight into the rationale for the series coefficients. (see) The exponential form is most easily generalized for complex-valued functions. (see)

The equivalence of these forms requires certain relationships among the coefficients. For instance, the trigonometric identity:means that:

Therefore

A _{n} and B _{n} are the rectangular coordinates of a vector with polar coordinates D _{n} and \varphi _{n.}

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.

But typically the coefficients are determined by frequency/harmonic analysis of a given real-valued function

s(x), and x represents time:

The objective is for

s _{\scriptstyle{infty} } to converge to s(x) at most or all values of x in an interval of length P. For the well-behaved functions typical of physical processes, equality is customarily assumed, and the Dirichlet conditions provide sufficient conditions.

The notation

\int _{P} represents integration over the chosen interval. Typical choices are [ - P/ 2 , P/ 2 ] and [ 0 , P] . Some authors define P \triangleq 2 \pi because it simplifies the arguments of the sinusoid functions, at the expense of generality. And some authors assume that s(x) is also P -periodic, in which case s _{\scriptstyle{infty} } approximates the entire function. The \tfrac{ 2 }{P} scaling factor is explained by taking a simple case: s(x) = \cos \left( 2 \pi \tfrac{k}{P} x \right). Only the n = k term of is needed for convergence, with A _{k} =1 and B _{k} = 0 .   Accordingly provides:A _{k} = (2)/(P) \underbrace{\int _{P} \cos ^{2} \left( 2 \pi \tfrac{k}{P} x \right) dx} _{P/2} = 1 ,       as required.

Exponential form coefficients

Another applicable identity is Euler's formula:

\begin{align} \cos\left( 2 \pi \tfrac{n}{P} x - \varphi _{n} \right) &{}\equiv \tfrac{ 1 }{ 2 } e {P}x - \varphi _{n} \right)} + \tfrac{ 1 }{ 2 } e ^{-i} {P}x - \varphi _{n} \right)} \\[ 6 pt] & = \left(\tfrac{ 1 }{ 2 } e ^{- i \varphi _{n}} \right) ⋅ e ^{i} {P}x} + \left(\tfrac{ 1 }{ 2 } e ^{- i \varphi _{n}} \right) ^{*} ⋅ e ^{i} {P}x} \end{align}

(Note: the ∗ denotes complex conjugation.)

Substituting this into and comparison with ultimately reveals:

Conversely:

Substituting into also reveals:^[2]

Complex-valued functions

and also apply when

s(x) is a complex-valued function.This follows by expressing \operatorname{Re}(s _{N} (x)) and \operatorname{Im}(s _{N(x))} as separate real-valued Fourier series, and s _{N(x)} = \operatorname{Re}(s _{N(x))} + i \operatorname{Im}(s _{N(x)).}

Derivation

The coefficients

D _{n} and \varphi _{n} can be understood and derived in terms of the cross-correlation between s(x) and a sinusoid at frequency \tfrac{n}{P} . For a general frequency f, and an analysis interval [x _{0,x} _{0+P],} the cross-correlation function:

is essentially a matched filter, with template

\cos( 2 \pi f x) .The maximum of \Chi _{f(\tau)} is a measure of the amplitude (D) of frequency f in the function s(x) , and the value of \tau at the maximum determines the phase (\varphi) of that frequency. Figure 2 is an example, where s(x) is a square wave (not shown), and frequency f is the 4 ^{th} harmonic. It is also an example of deriving the maximum from just two samples, instead of searching the entire function. Combining with gives:\begin{align} \Chi _{n(\varphi)} & = \tfrac{ 2 }{P} \int _{P} s(x) ⋅ \cos\left( 2 \pi \tfrac{n}{P} x - \varphi \right) dx ; \varphi \in [ 0 , 2 \pi]\\ & = \cos(\varphi) ⋅ \underbrace{\tfrac{ 2 }{P}\int _{P} s(x) ⋅ \cos\left( 2 \pi \tfrac{n}{P} x\right) dx} _{A} + \sin(\varphi) ⋅ \underbrace{\tfrac{ 2 }{P}\int _{P} s(x) ⋅ \sin\left( 2 \pi \tfrac{n}{P} x\right) dx} _{B} \\ & = \cos(\varphi) ⋅ A + \sin(\varphi) ⋅ B \end{align}

The derivative of

\Chi _{n(\varphi)} is zero at the phase of maximum correlation.\Chi' _{n(\varphi)=\sin(\varphi) ⋅} A - \cos(\varphi) ⋅ B = 0 \longrightarrow \tan(\varphi) = (B)/(A) \longrightarrow \varphi = \arctan(B, A)

Therefore, computing

A _{n} and B _{n} according to creates the component's phase \varphi _{n} of maximum correlation. And the component's amplitude is:\begin{align} D _{n} \triangleq \Chi _{n(\varphi} _{n) &=} \cos(\varphi _{n) ⋅} A _{n} + \sin(\varphi _{n) ⋅} B _{n} \\ & = (A _{n})/(\sqrt{A ^{2} _{n}) }\cdot A_n + \frac\cdot B_n =\frac&= \sqrt.\end

Other 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 such as \widehat{s}(n) or S[n] , and functional notation often replaces subscripting:\begin{align} s(x) & = \sum ^{inf ty} _{n =-inf ty} \widehat{s}(n) ⋅ e ^{i} {P} x} && \scriptstyle commonmathematicsnotation \\ & = \sum ^{inf ty} _{n =-inf ty} S[n] ⋅ e ^{i} {P} x} && \scriptstyle commonengineeringnotation \end{align}

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 ^{inf ty} _{n =-inf ty} S[n] ⋅ \delta \left(f - (n)/(P) \right),

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 \tfrac{ 1 }{P} , which is called the fundamental frequency. s _{infty} (x) can be recovered from this representation by an inverse Fourier transform:\begin{align} l{F} ^{-1} \{S(f)\} & = \int ^{inf ty} _{-inf ty} \left( \sum ^{inf ty} _{n =-inf ty} S[n] ⋅ \delta \left(f - (n)/(P) \right)\right) e ^{i} df, \\[ 6 pt] & = \sum ^{inf ty} _{n =-inf ty} S[n] ⋅ \int ^{inf ty} _{-inf ty} \delta\left(f - (n)/(P) \right) e ^{i} df, \\[ 6 pt] & = \sum ^{inf ty} _{n =-inf ty} S[n] ⋅ e ^{i} {P} x} \triangleq s _{infty(x). \end{align}}

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.

Analysis example

]]

Consider a sawtooth function:

s(x) = (x)/(\pi) , for - \pi < x < \pi, s(x + 2 \pi k) = s(x), for - \pi < x < \pi and k \in Z . In this case, the Fourier coefficients are given by\begin{align} A _{n} & = (1)/(\pi) \int ^{\pi} _{- \pi} s(x) \cos(nx)dx = 0 , n \ge 0 . \\[ 4 pt] B _{n} & = (1)/(\pi) \int ^{\pi} _{- \pi} s(x) \sin(nx) dx\\[ 4 pt] & =- (2)/(\pi n) \cos(n\pi) + (2)/(\pi ^{2} n ^{2}) \sin(n\pi)\\[ 4 pt] & = (2 ( -1 ) ^{n+1})/(\pi n) , n \ge 1 .\end{align} It can be shown that the Fourier series converges to s(x) at every point x where s is differentiable, and therefore:

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.

Convergence

See main article: Convergence of Fourier series. A proof that a Fourier series is a valid representation of any periodic function (that satisfies the Dirichlet conditions) is overviewed in .

In engineering applications, the Fourier series is generally assumed to converge except at jump discontinuities since the functions encountered in engineering are better-behaved than functions encountered 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) .^[3] If a function is square-integrable on the interval [x _{0,x} _{0+P]} , then the Fourier series converges to the function at almost everywhere. It is possible to define Fourier coefficients for more general functions or distributions, in which case point wise convergence often fails, and convergence in norm or weak convergence is usually studied.

History

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. 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^[4] 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.^[5] 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.

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^[6] and Bernhard Riemann^{[7] [8]} 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,^[9] shell theory,^[10] etc.

Beginnings

Joseph Fourier wrote:

This immediately gives any coefficient a_k of the trigonometrical 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 integralcan be carried out term-by-term. But all terms involving

\cos( 2 j +1 ) (\pi y)/(\cos( 2 k +1 ) 2) (\pi y)/(2) for vanish when integrated from −1 to 1, leaving only the k ^{th} term.

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

The Fourier series expansion of the sawtooth function (above) looks more complicated than the simple formula

s(x) = \tfrac{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] x [ 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 period of time has elapsed) is given byT(x,y) = 2 \sum ^{inf ty} _{n =1} (( -1 ) ^{n+1})/(n) \sin(nx) {\sinh(ny) \over \sinh(n\pi)}. Here, sinh is the hyperbolic sine function. This solution of the heat equation is obtained by multiplying each term of 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.

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{align}& A _{0} \ & A _{n} for n \ge 1 \ & B _{n} for n \ge 1 \end{align}	Remarks	Reference
s(x) = A \left	\sin\left(\fracx\right)\right	\quad \text 0 \le x < P		\begin{align} A _{0} = & (2 A)/(\pi) \\ A _{n} = & \begin{cases} (-4 A)/(\pi) (1)/(n ^{2-1}) & n even \\ 0 & n odd \end{cases}\\ B _{n} = & 0 \\ \end{align}	Full-wave rectified sine	^[11]
s(x) = \begin{cases} A \sin\left( (2 \pi)/(P) x\right) & for 0 \le x < P/ 2 \\ 0 & for P/ 2 \le x < P\\ \end{cases}		\begin{align} A _{0} = & (A)/(\pi) \\ A _{n} = & \begin{cases} (-2 A)/(\pi) (1)/(n ^{2-1}) & n even \\ 0 & n odd \end{cases}\\ B _{n} = & \begin{cases} (A)/(2) & n =1 \\ 0 & n > 1 \end{cases}\\ \end{align}	Half-wave rectified sine
s(x) = \begin{cases} A & for 0 \le x < D ⋅ P \\ 0 & for D ⋅ P \le x < P\\ \end{cases}		\begin{align} A _{0} = & AD\\ A _{n} = & (A)/(n \pi) \sin \left( 2 \pi n D \right)\\ B _{n} = & (2 A)/(n \pi) \left( \sin \left( \pi n D \right) \right) ^{2\\ \end{align}}	0 \le D \le 1
s(x) = (Ax)/(P) for 0 \le x < P		\begin{align} A _{0} = & (A)/(2) \\ A _{n} = & 0 \\ B _{n} = & (- A)/(n \pi) \\ \end{align}
s(x) = A - (Ax)/(P) for 0 \le x < P		\begin{align} A _{0} = & (A)/(2) \\ A _{n} = & 0 \\ B _{n} = & (A)/(n \pi) \\ \end{align}
s(x) = (4 A)/(P ^{2}) \left( x - (P)/(2) \right) ^{2} for 0 \le x < P		\begin{align} A _{0} = & (A)/(3) \\ A _{n} = & (4 A)/(\pi ^{2} n ^{2}) \\ B _{n} = & 0 \\ \end{align}

Table of basic properties

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 ⋅ s(x) + b ⋅ r(x)	a ⋅ S[n] + b ⋅ R[n]	a,b \in C
Time reversal / Frequency reversal	s( - x)	S[ - n]
Time conjugation	s ^{*(x)}	S ^{*[-n]}
Time reversal & conjugation	s ^{*(-x)}	S ^{*[n]}
Real part in time	\operatorname{Re}{(s(x))}	(1)/(2) (S[n] + S ^{*[-n])}
Imaginary part in time	\operatorname{Im}{(s(x))}	(1)/(2 i) (S[n] - S ^{*[-n])}
Real part in frequency	(1)/(2) (s(x) + s ^{*(-x))}	\operatorname{Re}{(S[n])}
Imaginary part in frequency	(1)/(2 i) (s(x) - s ^{*(-x))}	\operatorname{Im}{(S[n])}
Shift in time / Modulation in frequency	s(x - x _{0)}	S[n] ⋅ e ^{- i 2 \pi\tfrac{x _{0}} {P}n}	x _{0} \in R	^[12]
Shift in frequency / Modulation in time	s(x) ⋅ e ^{i 2 \pi (n _{0})/(P) x}	S[n - n _{0]}	n _{0} \in Z

Symmetry properties

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:^[13]

\begin{array}{rccccccccc} Timedomain & s & = & s _{_{RE}} & + & s _{_{RO}} & + & i s _{_{IE}} & + & \underbrace{i s _{_{IO}} } \\&\Bigg\Updownarrow\mathcal & &\Bigg\Updownarrow\mathcal & &\ \ \Bigg\Updownarrow\mathcal & &\ \ \Bigg\Updownarrow\mathcal & &\ \ \Bigg\Updownarrow\mathcal\\\text & S & = & S_\text & + & \overbrace & + & i S_\text & + & S_\text\end

From this, various relationships are apparent, for example:

• The transform of a real-valued function is the even symmetric function . Conversely, an even-symmetric transform implies a real-valued time-domain.
• The transform of an imaginary-valued function is the odd symmetric function, and the converse is true.
• The transform of an even-symmetric function is the real-valued function, and the converse is true.
• The transform of an odd-symmetric function is the imaginary-valued function, and the converse is true.

Other properties

Riemann–Lebesgue lemma

If

S is integrable, $\backslash lim\_$

\to \infty

S[n]=0, $\backslash lim\_\; a\_n=0$ and $\backslash lim\_\; b\_n=0.$ This result is known as the Riemann–Lebesgue lemma.

Parseval's theorem

See main article: Parseval's theorem. If

s belongs to L ^{2(P)} (periodic over an interval of length P ) then: $\backslash frac\backslash int\_\; |s(x)|^2\; \backslash ,\; dx\; =\; \backslash sum\_^\backslash infty\; \backslash Bigl|S[n]\backslash Bigr|^2.$

Plancherel's theorem

See main article: Plancherel theorem. If

c _{0,} c _{\pm} , c _{\pm} , \ldots are coefficients and 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 Z ,

• The pointwise product: $$h\_(x)\; \backslash triangleq\; s\_(x)\backslash cdot\; r\_(x)$$ is also

P -periodic, and its Fourier series coefficients are given by the discrete convolution of the S and R sequences: $$H[n]\; =\; \backslash [n].$$

• The periodic convolution: $$h\_(x)\; \backslash triangleq\; \backslash int\_\; s\_(\backslash tau)\backslash cdot\; r\_(x-\backslash tau)\backslash ,\; d\backslash tau$$ is also

P -periodic, with Fourier series coefficients: $$H[n]\; =\; P\; \backslash cdot\; S[n]\backslash cdot\; R[n].$$

• A doubly infinite sequence

\left \{c _{n} \right \} _{n} in c _{0(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(Z)} . See ^[14]

Derivative property

We say that

s belongs to C ^{k(T)} if s is a 2-periodic function on R which is k times differentiable, and its k ^{th} derivative is continuous.

• If

s \in C ^{1(T)} , then the Fourier coefficients \widehat{s'}[n] of the derivative s' can be expressed in terms of the Fourier coefficients \widehat{s}[n] of the function s , via the formula \widehat{s'}[n] = in \widehat{s}[n] .

• If

s \in C ^{k(T)} , then \widehat{s ^{(k)} }[n] = (in)^k \widehat[n]. In particular, since for a fixed k\geq 1 we have \widehat{s ^{(k)} }[n]\to 0 as n\to inf ty , it follows that |n| ^{k\widehat{s}[n]} tends to zero, which means that the Fourier coefficients converge to zero faster than the kth power of n for any k\geq 1 .

Compact groups

See main article: Compact group, Lie group and Peter–Weyl theorem.

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 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.

Riemannian manifolds

See main article: Laplace operator and Riemannian manifold.

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

See main article: Pontryagin duality.

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 R .

Extensions

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] x [ - \pi,\pi] :

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.^[15]

Fourier series of Bravais-lattice-periodic-function

A three-dimensional Bravais lattice is defined as the set of vectors of the form:$$\backslash mathbf\; =\; n\_1\backslash mathbf\_1\; +\; n\_2\backslash mathbf\_2\; +\; n\_3\backslash mathbf\_3$$where

n _{i} are integers and a _{i} are three linearly independent vectors. Assuming we have some function, f( r ) , such that it obeys the condition of periodicity for any Bravais lattice vector R , f( r ) = f( R + r ) , 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 r in the coordinate-system of the lattice:$$\backslash mathbf\; =\; x\_1\backslash frac+\; x\_2\backslash frac+\; x\_3\backslash frac,$$where a _{i} \triangleq | a _{i|,} meaning that a _{i} is defined to be the magnitude of a _{i} , so \hat{ a _{i} } = \frac is the unit vector directed along a _{i} .

Thus we can define a new function,$$g(x\_1,x\_2,x\_3)\; \backslash triangleq\; f(\backslash mathbf)\; =\; f\; \backslash left\; (x\_1\backslash frac+x\_2\backslash frac+x\_3\backslash frac\; \backslash right).$$

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 \left [ 0 , a _{1\right} ] for x _{1} , we can define the following:$$h^\backslash mathrm(m\_1,\; x\_2,\; x\_3)\; \backslash triangleq\; \backslash frac\backslash int\_0^\; g(x\_1,\; x\_2,\; x\_3)\backslash cdot\; e^\backslash ,\; dx\_1$$

And then we can write:$$g(x\_1,\; x\_2,\; x\_3)=\backslash sum\_^\backslash infty\; h^\backslash mathrm(m\_1,\; x\_2,\; x\_3)\; \backslash cdot\; e^$$

Further defining:

We can write

g once again as:$$g(x\_1,\; x\_2,\; x\_3)=\backslash sum\_^\backslash infty\; \backslash sum\_^\backslash infty\; h^\backslash mathrm(m\_1,\; m\_2,\; x\_3)\; \backslash cdot\; e^\; \backslash cdot\; e^$$

Finally applying the same for the third coordinate, we define:

We write

g as:$$g(x\_1,\; x\_2,\; x\_3)=\backslash sum\_^\backslash infty\; \backslash sum\_^\backslash infty\; \backslash sum\_^\backslash infty\; h^\backslash mathrm(m\_1,\; m\_2,\; m\_3)\; \backslash cdot\; e^\; \backslash cdot\; e^\backslash cdot\; e^$$

Re-arranging:$$g(x\_1,\; x\_2,\; x\_3)=\backslash sum\_\; h^\backslash mathrm(m\_1,\; m\_2,\; m\_3)\; \backslash cdot\; e^.$$

Now, every reciprocal lattice vector can be written (but does not mean that it is the only way of writing) as

G = m _{1g} _{1} + m _{2g} _{2} + m _{3g} _{3} , where m _{i} are integers and g _{i} are reciprocal lattice vectors to satisfy g _{i} ⋅ a _{j} =2 \pi\delta _{ij} (\delta _{ij} = 1 for i = j , and \delta _{ij} = 0 for i ≠ j ). Then for any arbitrary reciprocal lattice vector G and arbitrary position vector r in the original Bravais lattice space, their scalar product is:$$\backslash mathbf\; \backslash cdot\; \backslash mathbf\; =\; \backslash left\; (m\_1\backslash mathbf\_1\; +\; m\_2\backslash mathbf\_2\; +\; m\_3\backslash mathbf\_3\; \backslash right)\; \backslash cdot\; \backslash left\; (x\_1\backslash frac+\; x\_2\backslash frac\; +x\_3\backslash frac\; \backslash right)\; =\; 2\backslash pi\; \backslash left(x\_1\backslash frac+x\_2\backslash frac+x\_3\backslash frac\; \backslash right).$$

So it is clear that in our expansion of

g(x _{1,x} _{2,x} _{3)} = f( r ) , the sum is actually over reciprocal lattice vectors:$$f(\backslash mathbf)=\backslash sum\_\; h(\backslash mathbf)\; \backslash cdot\; e^,$$

where $$h(\backslash mathbf)\; =\; \backslash frac\; \backslash int\_0^\; dx\_3\; \backslash ,\; \backslash frac\backslash int\_0^\; dx\_2\; \backslash ,\; \backslash frac\backslash int\_0^\; dx\_1\; \backslash ,\; f\backslash left(x\_1\backslash frac\; +\; x\_2\backslash frac\; +\; x\_3\backslash frac\; \backslash right)\backslash cdot\; e^.$$

Assuming$$\backslash mathbf\; =\; (x,y,z)\; =\; x\_1\backslash frac+x\_2\backslash frac+x\_3\backslash frac,$$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:which after some calculation and applying some non-trivial cross-product identities can be shown to be equal to:$$\backslash frac$$

(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

a _{1} is parallel to the x axis, a _{2} lies in the xy-plane, and a _{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 a _{1} , a _{2} and a _{3} . In particular, we now know that$$dx\_1\; \backslash ,\; dx\_2\; \backslash ,\; dx\_3\; =\; \backslash frac\; \backslash cdot\; dx\; \backslash ,\; dy\; \backslash ,\; dz.$$

We can write now

h( G ) 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(\backslash mathbf)\; =\; \backslash frac\backslash int\_\; d\backslash mathbf\; f(\backslash mathbf)\backslash cdot\; e^$$writing d r for the volume element dx dy dz ; and where C is the primitive unit cell, thus, a _{1 ⋅ (a} _{2} x a _{3)} is the volume of the primitive unit cell.

Hilbert space interpretation

See main article: Hilbert space.

In the language of Hilbert spaces, the set of functions

\left\{e ^{inx} _{n = e} : n \in \Z\right\} is an orthonormal basis for the space L ^{2([-\pi,\pi])} of square-integrable functions on [ - \pi,\pi] . This space is actually a Hilbert space with an inner product given for any two elements f and g by:\langle f, g \rangle \triangleq (1)/(2 \pi) \int ^{\pi} _{- \pi} f(x)g ^{*(x)dx,} where g ^{*} (x) is the complex conjugate of g(x). The basic Fourier series result for Hilbert spaces can be written asf = \sum ^{inf ty} _{n =-inf ty} \langle f,e _{n} \rangle e _{n.} This corresponds exactly to the complex exponential formulation given above. The version with sines and cosines is also justified with the Hilbert space interpretation. Indeed, the sines and cosines form an orthogonal set:$$\backslash int\_^\; \backslash cos(mx)\backslash ,\; \backslash cos(nx)\backslash ,\; dx\; =\; \backslash frac\backslash int\_^\; \backslash cos((n-m)x)+\backslash cos((n+m)x)\backslash ,\; dx\; =\; \backslash pi\; \backslash delta\_,\; \backslash quad\; m,\; n\; \backslash ge\; 1,$$$$\backslash int\_^\; \backslash sin(mx)\backslash ,\; \backslash sin(nx)\backslash ,\; dx\; =\; \backslash frac\backslash int\_^\; \backslash cos((n-m)x)-\backslash cos((n+m)x)\backslash ,\; dx\; =\; \backslash pi\; \backslash delta\_,\; \backslash quad\; m,\; n\; \backslash ge\; 1$$(where δ_mn is the Kronecker delta), and$$\backslash int\_^\; \backslash cos(mx)\backslash ,\; \backslash sin(nx)\backslash ,\; dx\; =\; \backslash frac\backslash int\_^\; \backslash sin((n+m)x)+\backslash sin((n-m)x)\backslash ,\; dx\; =\; 0;$$furthermore, the sines and cosines are orthogonal to the constant function 1 . An orthonormal basis for L ^{2([-\pi,\pi])} consisting of real functions is formed by the functions 1 and \sqrt{ 2 } \cos (nx) , \sqrt{ 2 } \sin (nx) with n= 1,2,.... 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

See main article: Convergence of Fourier series.

These theorems, 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.^{[16] [17] [18] [19]}

The earlier :

s _{_{N}} (x) = \sum ^{N} _{n =- N} S[n] e ^{i} {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 ^{i} {P}x}.

Least squares property

Parseval's theorem implies that:

Convergence theorems

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

We have already mentioned that if

s is continuously differentiable, then (i ⋅ n) S[n] is the n ^{th} Fourier coefficient of the derivative s' . It follows, essentially from the Cauchy–Schwarz inequality, that s _{infty} is absolutely summable. The sum of this series is a continuous function, equal to s , since the Fourier series converges in the mean to s :

This result can be proven easily if

s is further assumed to be C ^{2} , since in that case n ^{2S[n]} tends to zero as n → inf ty . 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:\sup _{x} |s(x) - s _{_{N}} (x)| \le \sum _{|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 Lennart Carleson's much more sophisticated result that the Fourier series of an L ^{2} function actually 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.^[20]

See also

• ATS theorem
• Carleson's theorem
• Dirichlet kernel
• Discrete Fourier transform
• Fast Fourier transform
• Fejér's theorem
• Fourier analysis
• 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
• Spectral theory
• Sturm–Liouville theory
• Residue theorem integrals of f(z), singularities, poles

References

Further reading

• Book: William E. Boyce . Richard C. DiPrima . Elementary Differential Equations and Boundary Value Problems . 8th . John Wiley & Sons, Inc. . New Jersey . 2005 . 0-471-43338-1.
• Book: Joseph Fourier, translated by Alexander Freeman . The Analytical Theory of Heat . Dover Publications . 2003 . 0-486-49531-0 . 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.
• Enrique A. Gonzalez-Velasco . Connections in Mathematical Analysis: The Case of Fourier Series . American Mathematical Monthly . 99 . 1992 . 427–441 . 5 . 10.2307/2325087. 2325087 .
• Book: Fetter. Alexander L. . Walecka. John Dirk . Theoretical Mechanics of Particles and Continua. 2003. Courier . 978-0-486-43261-8.
• Felix Klein, Development of mathematics in the 19th century. Mathsci Press Brookline, Mass, 1979. Translated by M. Ackerman from Vorlesungen über die Entwicklung der Mathematik im 19 Jahrhundert, Springer, Berlin, 1928.
• Book: Walter Rudin . Walter Rudin . Principles of mathematical analysis . registration . 3rd . McGraw-Hill, Inc. . New York . 1976 . 0-07-054235-X.
• Book: A. Zygmund . Antoni Zygmund . Trigonometric Series . Trigonometric Series . third . Cambridge University Press . Cambridge . 2002 . 0-521-89053-5. The first edition was published in 1935.

External links

• • Fourier's Series . 10 . 753–758 . Ernest . Hobson . 1 . E. W. Hobson.

Notes and References

1. Book: Zygmund . A. . Trigonometric Series . 2002 . Cambridge University Press . 0-521-89053-5 . 3rd . Cambridge, UK.
2. Book: Pinkus . Allan . Fourier Series and Integral Transforms . Zafrany . Samy . 1997 . Cambridge University Press . 0-521-59771-4 . 1st . Cambridge, UK . 42–44.
3. Book: Tolstov, Georgi P.. Fourier Series. Courier-Dover. 1976. 0-486-63317-9.
4. Book: Stillwell, John. Routledge History of Philosophy. Routledge. 2013. 978-1-134-92880-4. Ten. C. L.. VII: The Nineteenth Century. 204. Logic and the philosophy of mathematics in the nineteenth century. John Stillwell. https://books.google.com/books?id=91AqBgAAQBAJ&pg=PA204.
5. Book: Cajori, Florian. A History of Mathematics. Macmillan. 1893. 283. Florian Cajori.
6. Lejeune-Dirichlet. Peter Gustav. Peter Gustav Lejeune Dirichlet. 1829. Sur la convergence des séries trigonométriques qui servent à représenter une fonction arbitraire entre des limites données. On the convergence of trigonometric series which serve to represent an arbitrary function between two given limits. Journal für die reine und angewandte Mathematik. fr. 4. 157–169. 0806.1294.
7. Web site: Ueber die Darstellbarkeit einer Function durch eine trigonometrische Reihe. About the representability of a function by a trigonometric series. live. https://web.archive.org/web/20080520085248/http://www.maths.tcd.ie/pub/HistMath/People/Riemann/Trig/. 20 May 2008. 19 May 2008. Habilitationsschrift, Göttingen; 1854. Abhandlungen der Königlichen Gesellschaft der Wissenschaften zu Göttingen, vol. 13, 1867. Published posthumously for Riemann by Richard Dedekind. de.
8. Book: Remmert, Reinhold. Theory of Complex Functions: Readings in Mathematics. 1991. Springer. 9780387971957. 29.
9. Book: Nerlove. Marc. Analysis of Economic Time Series. Economic Theory, Econometrics, and Mathematical Economics. Grether. David M.. Carvalho. Jose L.. Elsevier. 1995. 0-12-515751-7. registration.
10. [Wilhelm Flügge]
11. Book: Papula, Lothar. Mathematische Formelsammlung: für Ingenieure und Naturwissenschaftler. Vieweg+Teubner Verlag. 2009. 978-3834807571. Mathematical Functions for Engineers and Physicists. de.
12. Book: Shmaliy, Y.S.. Continuous-Time Signals. Springer . 2007 . 978-1402062711.
13. Book: Proakis. John G. . Manolakis. Dimitris G.. Dimitris Manolakis . Digital Signal Processing: Principles, Algorithms, and Applications. registration. 1996. Prentice Hall. 978-0-13-373762-2. 3rd. 291.
14. Web site: Characterizations of a linear subspace associated with Fourier series . MathOverflow . 2010-11-19 . 2014-08-08.
15. https://www.youtube.com/watch?v=V7l9Im9zneg Vanishing of Half the Fourier Coefficients in Staggered Arrays
16. Book: Siebert, William McC. . Circuits, signals, and systems . MIT Press . 1985 . 978-0-262-19229-3 . 402.
17. Book: Marton . L. . Advances in Electronics and Electron Physics . Marton . Claire . Academic Press . 1990 . 978-0-12-014650-5 . 369.
18. Book: Kuzmany, Hans . Solid-state spectroscopy . Springer . 1998 . 978-3-540-63913-8 . 14.
19. Book: Pribram . Karl H. . Brain and perception . Yasue . Kunio . Jibu . Mari . Lawrence Erlbaum Associates . 1991 . 978-0-89859-995-4 . 26.
20. Book: Katznelson . Yitzhak . An introduction to Harmonic Analysis . Dover Publications, Inc. . 2nd corrected . 1976 . New York, NY . 0-486-63331-4.