Fourier series
A Fourier series ( ) is a series expansion of a periodic function into a sum of trigonometric functions.
≈ 28 min read
Fourier series. encyclopegia.org, snapshot enwiki-001378175976. /a/fourier-series
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
A Fourier series ( ) is a series expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series. 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 .
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.
File:SquareWaveFourierArrows,rotated,nocaption 20fps.gif|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).
File:Fourier Series.svg|The first four partial sums of the Fourier series for a square wave. As more harmonics are added, the partial sums converge to the square wave. File:Fourier series and transform.gif|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 \mathbb{T} or S_1 . The Fourier transform is also part of Fourier analysis, but is defined for functions on \mathbb{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 series expansion.
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. \begin{align} &\int_{-1}^1\varphi(y)\cos(2k+1)\frac{\pi y}{2}\,dy \\ &= \int_{-1}^1\left(a\cos\frac{\pi y}{2}\cos(2k+1)\frac{\pi y}{2}+a'\cos 3\frac{\pi y}{2}\cos(2k+1)\frac{\pi y}{2}+\cdots\right)\,dy \end{align} 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 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
The Fourier series expansion of the sawtooth function (below) 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] \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}^\infty \frac{(-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 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 -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=-\infty}^\infty c_n e^{i 2\pi \tfrac{n}{P} x }, such that the Fourier coefficients c_n are complex numbers defined by the integral c_n = \frac{1}{P}\int_0^P s(x)\ e^{-i 2\pi \tfrac{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=-\infty}^\infty c_n e^{i 2\pi \tfrac{n}{P} x }.
For functions satisfying the Dirichlet sufficiency conditions, pointwise convergence holds. 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).
The definition naturally extends to the Fourier series of a (periodic) distribution s (also called Fourier-Schwartz series). Then the Fourier series converges to s(x) in the distribution sense.
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. {{Equation box 1 |title=Exponential form |indent=:|border|border colour=#0073CF|background colour=#F5FFFA|cellpadding=6 |equation={{NumBlk| | s_N(x) = \sum_{n=-N}^N c_n\ e^{i 2\pi \tfrac{n}{P}x} | }}}} 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 . These series can represent functions that are just a sum of one or more frequencies in the harmonic spectrum. In the limit N\to\infty , a trigonometric series can also represent the intermediate frequencies or non-sinusoidal functions because of the infinite number of terms. \cos x = \frac{e^{ix} + e^{-ix}}{2}, \quad \sin x = \frac{e^{ix} - e^{-ix}}{2i}, resulting in: with c_{0} being the mean value of s on the interval P . Conversely: , a periodic continuation of the linear function s(x)=x/\pi on the interval (-\pi,\pi] Consider a sawtooth function: s(x) = s(x + 2\pi k) = \frac{x}{\pi}, \quad \mathrm{for } -\pi In this case, the Fourier coefficients are given by \begin{align} a_0 &= 0.\\ a_n & = \frac{1}{\pi}\int_{-\pi}^{\pi}s(x) \cos(nx)\,dx = 0, \quad n \ge 1. \\ b_n & = \frac{1}{\pi}\int_{-\pi}^{\pi}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}, \quad 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: \begin{align} s(x) &= a_0 + \sum_{n=1}^\infty \left[a_n\cos\left(nx\right)+b_n \sin\left(nx\right)\right] \\[4pt] &=\frac{2}{\pi}\sum_{n=1}^\infty \frac{(-1)^{n+1}}{n} \sin(nx), \quad \mathrm{for}\ (x-\pi)\ \text{is not a multiple of}\ 2\pi. \end{align} 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 as where A_{n} is the amplitude and \varphi_{n} is the phase shift of the n^{th} harmonic. The equivalence of and follows from the trigonometric identity: \cos\left(2\pi \tfrac{n}{P}x-\varphi_n\right) = \cos(\varphi_n)\cos\left(2\pi \tfrac{n}{P} x\right) + \sin(\varphi_n)\sin\left(2\pi \tfrac{n}{P} x\right), which implies a_n = A_n \cos(\varphi_n)\quad \text{and}\quad b_n = A_n \sin(\varphi_n) are the rectangular coordinates of a vector written in polar coordinates as A_n \angle \varphi_n = a_n + i b_{n} where A_n = \sqrt{a_n^2 + b_n^2}\quad \text{and}\quad \varphi_n = \operatorname{atan2}(b_n, a_n) = -\operatorname{Arg}(c_n) An example of determining the parameter \varphi_n for one value of n is shown in Figure 2.
It is the value of \varphi at the maximum correlation between s(x) and a cosine template, \cos(2\pi \tfrac{n}{P} x - \varphi) . The blue graph is the cross-correlation function, also known as a matched filter: \begin{align} \Chi(\varphi) &= \int_{P} s(x) \cdot \cos\left( 2\pi \tfrac{n}{P} x -\varphi \right)\, dx\quad \varphi \in \left[ 0, 2\pi \right]\\ &=\cos(\varphi) \underbrace{\int_{P} s(x) \cdot \cos\left( 2\pi \tfrac{n}{P} x\right) dx}_{X(0)} + \sin(\varphi) \underbrace{\int_{P} s(x) \cdot \sin\left( 2\pi \tfrac{n}{P} x\right) dx}_{ X(\pi/2) } \end{align} Fortunately, it is not necessary to evaluate this entire function, because its derivative is zero at the maximum: X'(\varphi) = \sin(\varphi)\cdot X(0) - \cos(\varphi)\cdot X(\pi/2) = 0, \quad \textrm{at}\ \varphi = \varphi_n.
Hence \varphi_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 \widehat{s}(n) or S[n], and functional notation often replaces subscripting: \begin{align} s(x) &= \sum_{n=-\infty}^\infty \widehat{s}(n)\cdot e^{i 2\pi \tfrac{n}{P} x} && \scriptstyle \text{common mathematics notation} \\ &= \sum_{n=-\infty}^\infty S[n]\cdot e^{i 2\pi \tfrac{n}{P} x} && \scriptstyle \text{common engineering notation} \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_{n=-\infty}^\infty S[n]\cdot \delta \left(f-\frac{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(x) can be recovered from this representation by an inverse Fourier transform: \begin{align} \mathcal{F}^{-1}\{S(f)\} &= \int_{-\infty}^\infty \left( \sum_{n=-\infty}^\infty S[n]\cdot \delta \left(f-\frac{n}{P}\right)\right) e^{i 2 \pi f x}\,df, \\[6pt] &= \sum_{n=-\infty}^\infty S[n]\cdot \int_{-\infty}^\infty \delta\left(f-\frac{n}{P}\right) e^{i 2 \pi f x}\,df, \\[6pt] &= \sum_{n=-\infty}^\infty S[n]\cdot e^{i 2\pi \tfrac{n}{P} x} \ \ \triangleq \ s(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.{{efn-ua| Since the integral defining the Fourier transform of a periodic function is not convergent, it is necessary to view the periodic function and its transform as distributions.
In this sense \mathcal{F} \{ e^{i 2\pi \tfrac{n}{P} x} \} is a Dirac delta function, which is an example of a distribution. }}
Table of basic transformation rules
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. \mathsf{Time\ domain} & s & = & s_{\mathrm{RE}} & + & s_{\mathrm{RO}} & + & i\ s_{\mathrm{IE}} & + & i\ s_{\mathrm{IO}} \\ &\Bigg\Updownarrow\mathcal{F} & &\Bigg\Updownarrow\mathcal{F} & &\ \ \Bigg\Updownarrow\mathcal{F} & &\ \ \Bigg\Updownarrow\mathcal{F} & &\ \ \Bigg\Updownarrow\mathcal{F}\\ \mathsf{Frequency\ domain} & S & = & S_\mathrm{RE} & + & i\ S_\mathrm{IO}\, & + & i\ S_\mathrm{IE} & + & S_\mathrm{RO} \end{array} From this, various relationships are apparent, for example: The transform of a real-valued function (s_\mathrm{RE}+s_\mathrm{RO}) is the conjugate symmetric function S_\mathrm{RE}+i\ S_\mathrm{IO}.
Conversely, a conjugate symmetric transform implies a real-valued time-domain. The transform of an imaginary-valued function (i\ s_\mathrm{IE}+i\ s_\mathrm{IO}) is the conjugate antisymmetric function S_\mathrm{RO}+i\ S_\mathrm{IE}, and the converse is true.
The transform of a conjugate symmetric function (s_\mathrm{RE}+i\ s_\mathrm{IO}) is the real-valued function S_\mathrm{RE}+S_\mathrm{RO}, and the converse is true. The transform of a conjugate antisymmetric function (s_\mathrm{RO}+i\ s_\mathrm{IE}) is the imaginary-valued function i\ S_\mathrm{IE}+i\ S_\mathrm{IO}, and the converse is true.
If S is integrable, \lim_{|n| \to \infty} S[n]=0 , \lim_{n \to +\infty} a_n=0 and \lim_{n \to +\infty} b_n=0. If s belongs to L^2(P) (periodic over an interval of length P ) then: \frac{1}{P}\int_{P} |s(x)|^2 \, dx = \sum_{n=-\infty}^\infty \Bigl|S[n]\Bigr|^2.
If c_0,\, c_{\pm 1},\, c_{\pm 2}, \ldots are coefficients and \sum_{n=-\infty}^\infty |c_n|^2 then there is a unique function s\in L^2(P) such that S[n] = c_n for every n . 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 \int_{P} 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 If s \in C^k(\mathbb{R}) , then the Fourier coefficients of the k^{\text{th}} derivative of s can be expressed in terms of the Fourier coefficients \widehat{s}[n] of s , via the formula \widehat{s^{(k)}}[n] = \left(i\frac{2\pi n}{P}\right)^k \widehat{s}[n]. In particular, since for any fixed k\geq 1 we have \widehat{s^{(k)}}[n]\to 0 as n\to\infty , it follows that |n|^k\widehat{s}[n] tends to zero, i.e., the Fourier coefficients converge to zero faster than the k^{\text{th}} power of |n| . c_n = \hat\mu(n)=\frac{1}{P}\int_0^P \ e^{-i 2\pi \tfrac{n}{P} x }\,d\mu(x), \quad \forall n\in\mathbb{Z}, for any \mu \in M , where M is the space finite Borel measures on the interval [0,P] . As such, when \mu \in M , the function \hat{\mu}(n) is also referred to as a Fourier-Stieltjes transform.
This follows from an earlier and more concrete representation of a Radon measure (i.e. a locally finite Borel measure) on \mathbb{R} , given by F. Riesz. That is, if F is a function of bounded variation on the interval [0,P] then the Fourier coefficients can be expressed by the Riemann-Stieltjes integral c_n = \frac{1}{P}\int_0^P \ e^{-i 2\pi \tfrac{n}{P} x }\,dF(x), \quad \forall n\in\mathbb{Z}, called the Fourier-Stieltjes coefficients of F . As the distributional derivative of F is a Radon measure, it is subject to the Lebesgue decomposition and can be expressed as dF = F'dx + dF_s .
If dF_s = 0 the expression reduces to the original definition of the Fourier coefficients, hence a Fourier series is a Fourier-Stieltjes series. The question whether or not \mu exists for a given sequence of c_n forms the basis of the trigonometric moment problem. The Fourier series can be generalized still further from measures to distributions.
If the Fourier coefficients are determined by a distribution F \in \mathcal{D}' then the series is sometimes described as a Fourier-Schwartz series. While it is often extremely difficult to decide whether a given series is a Fourier or a Fourier-Stieltjes series, deciding whether or not it is a Fourier-Schwartz series is relatively trivial. \begin{align} f(x,y) & = \sum_{j,k \in \Z} c_{j,k}e^{ijx}e^{iky},\\[5pt] c_{j,k} & = \frac{1}{4 \pi^2} \int_{-\pi}^\pi \int_{-\pi}^\pi f(x,y) e^{-ijx}e^{-iky}\, dx \, dy. \end{align} 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. \mathbf{R} = n_1\mathbf{a}_1 + n_2\mathbf{a}_2 + n_3\mathbf{a}_3 where n_i are integers and \mathbf{a}_i are three linearly independent but not necessarily orthogonal vectors.
Let us consider some function f(\mathbf{r}) with the same periodicity as the Bravais lattice, i.e. f(\mathbf{r}) = f(\mathbf{R}+\mathbf{r}) for any lattice vector \mathbf{R} . This situation frequently occurs in solid-state physics where f(\mathbf{r}) might, for example, represent the effective potential that an electron "feels" inside a periodic crystal.
In presence of such a periodic potential, the quantum-mechanical description of the electron results in a periodically modulated plane-wave commonly known as Bloch state. In order to develop f(\mathbf{r}) in a Fourier series, it is convenient to introduce an auxiliary function g(x_1,x_2,x_3) \triangleq f(\mathbf{r}) = f{ \left (x_1\frac{\mathbf{a}_1}{a_1} + x_2\frac{\mathbf{a}_2}{a_2} + x_3\frac{\mathbf{a}_3}{a_3} \right )}.
Both f(\mathbf{r}) and g(x_1,x_2,x_3) contain essentially the same information. However, instead of the position vector \mathbf{r} , the arguments of g are coordinates x_{1,2,3} along the unit vectors \mathbf{a}_{i}/{a_i} of the Bravais lattice, such that g is an ordinary periodic function in these variables, 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)\quad\forall\;x_1,x_2,x_3.
This trick allows us to develop g as a multi-dimensional Fourier series, in complete analogy with the square-periodic function discussed in the previous section. Its Fourier coefficients are \begin{align} c(m_1, m_2, m_3) = \frac{1}{a_3}\int_0^{a_3} dx_3 \frac{1}{a_2}\int_0^{a_2} dx_2 \frac{1}{a_1}\int_0^{a_1} dx_1\, g(x_1, x_2, x_3)\, e^{-i 2\pi \left(\tfrac{m_1}{a_1} x_1+\tfrac{m_2}{a_2} x_2 + \tfrac{m_3}{a_3} x_3\right)} \end{align}, where m_1,m_2,m_3 are all integers. c(m_1,m_2,m_3) plays the same role as the coefficients c_{j,k} in the previous section but in order to avoid double subscripts we note them as a function.
Once we have these coefficients, the function g can be recovered via the Fourier series g(x_1, x_2, x_3)=\sum_{m_1, m_2, m_3 \in \Z } \,c(m_1, m_2, m_3) \, e^{i 2\pi \left( \tfrac{m_1}{a_1} x_1+ \tfrac{m_2}{a_2} x_2 + \tfrac{m_3}{a_3} x_3\right)}. We would now like to abandon the auxiliary coordinates x_{1,2,3} and to return to the original position vector \mathbf{r} .
This can be achieved by means of the reciprocal lattice whose vectors \mathbf{b}_{1,2,3} are defined such that they are orthonormal (up to a factor 2\pi ) to the original Bravais vectors \mathbf{a}_{1,2,3} , \mathbf{a}_i\cdot\mathbf{b_j}=2\pi\delta_{ij}, with \delta_{ij} the Kronecker delta. With this, the scalar product between a reciprocal lattice vector \mathbf{Q} and an arbitrary position vector \mathbf{r} written in the Bravais lattice basis becomes \mathbf{Q} \cdot \mathbf{r} = \left ( m_1\mathbf{b}_1 + m_2\mathbf{b}_2 + m_3\mathbf{b}_3 \right ) \cdot \left (x_1\frac{\mathbf{a}_1}{a_1}+ x_2\frac{\mathbf{a}_2}{a_2} +x_3\frac{\mathbf{a}_3}{a_3} \right ) = 2\pi \left( x_1\frac{m_1}{a_1}+x_2\frac{m_2}{a_2}+x_3\frac{m_3}{a_3} \right ), which is exactly the expression occurring in the Fourier exponents.
The Fourier series for f(\mathbf{r}) =g(x_1,x_2,x_3) can therefore be rewritten as a sum over all the reciprocal lattice vectors \mathbf{Q}= m_1\mathbf{b}_1+m_2\mathbf{b}_2+m_3\mathbf{b}_3 , f(\mathbf{r})=\sum_{\mathbf{Q}} c(\mathbf{Q})\, e^{i \mathbf{Q} \cdot \mathbf{r}}, and the coefficients are c(\mathbf{Q}) = \frac{1}{a_3} \int_0^{a_3} dx_3 \, \frac{1}{a_2}\int_0^{a_2} dx_2 \, \frac{1}{a_1}\int_0^{a_1} dx_1 \, f\left(x_1\frac{\mathbf{a}_1}{a_1} + x_2\frac{\mathbf{a}_2}{a_2} + x_3\frac{\mathbf{a}_3}{a_3} \right) e^{-i \mathbf{Q} \cdot \mathbf{r}}. The remaining task will be to convert this integral over lattice coordinates back into a volume integral.
The relation between the lattice coordinates x_{1,2,3} and the original cartesian coordinates \mathbf{r} = (x,y,z) is a linear system of equations, \mathbf{r} = x_1\frac{\mathbf{a}_1}{a_1}+x_2\frac{\mathbf{a}_2}{a_2}+x_3\frac{\mathbf{a}_3}{a_3}, which, when written in matrix form, \begin{bmatrix}x\\y\\z\end{bmatrix} =\mathbf{J}\begin{bmatrix}x_1\\x_2\\x_3\end{bmatrix} =\begin{bmatrix}\frac{\mathbf{a}_1}{a_1},\frac{\mathbf{a}_2}{a_2},\frac{\mathbf{a}_3}{a_3}\end{bmatrix}\begin{bmatrix}x_1\\x_2\\x_3\end{bmatrix}\,, involves a constant matrix \mathbf{J} whose columns are the unit vectors \mathbf{a}_j/a_j of the Bravais lattice. When changing variables from \mathbf{r} to (x_1,x_2,x_3) in an integral, the same matrix \mathbf{J} appears as a Jacobian matrix \mathbf{J}=\begin{bmatrix} \dfrac{\partial x}{\partial x_1} & \dfrac{\partial x}{\partial x_2} & \dfrac{\partial x}{\partial x_3 } \\[12pt] \dfrac{\partial y}{\partial x_1} & \dfrac{\partial y}{\partial x_2} & \dfrac{\partial y}{\partial x_3} \\[12pt] \dfrac{\partial z}{\partial x_1} & \dfrac{\partial z}{\partial x_2} & \dfrac{\partial z}{\partial x_3} \end{bmatrix}\,.
Its determinant J is therefore also constant and can be inferred from any integral over any domain; here we choose to calculate the volume of the primitive unit cell \Gamma in both coordinate systems: V_{\Gamma} = \int_{\Gamma} d^3 r = J \int_{0}^{a_1} dx_1 \int_{0}^{a_2} dx_2 \int_{0}^{a_3} dx_3=J\, a_1 a_2 a_3 The unit cell being a parallelepiped, we have V_{\Gamma}=\mathbf{a}_1\cdot(\mathbf{a}_2 \times \mathbf{a}_3) and thus d^3r=J dx_1 dx_2 dx_3 =\frac{\mathbf{a}_1\cdot(\mathbf{a}_2 \times \mathbf{a}_3)}{a_1 a_2 a_3} dx_1 dx_2 dx_3. This allows us to write c (\mathbf{Q}) as the desired volume integral over the primitive unit cell \Gamma in ordinary cartesian coordinates: c(\mathbf{Q}) = \frac{1}{\mathbf{a}_1\cdot(\mathbf{a}_2 \times \mathbf{a}_3)}\int_{\Gamma} d^3 r\, f(\mathbf{r})\cdot e^{-i \mathbf{Q} \cdot \mathbf{r}}\,. \langle f, g \rangle = \frac{1}{2\pi}\int_{-\pi}^{\pi} f(x)\overline{g(x)}\,dx.
This space is equipped with the orthonormal basis \left\{e_n=e^{inx}: n \in \Z\right\} . Then the (generalized) Fourier series expansion of f \in L^{2}([-\pi,\pi]) , given by f(x) = \sum_{n=-\infty}^\infty c_n e^{i n x }, can be written as f=\sum_{n=-\infty}^\infty \langle f,e_n \rangle \, e_n. The sine-cosine form follows in a similar fashion.
Indeed, the sines and cosines form an orthogonal set: \int_{-\pi}^{\pi} \cos(mx)\, \cos(nx)\, dx = \frac{1}{2}\int_{-\pi}^{\pi} \cos((n-m)x)+\cos((n+m)x)\, dx = \pi \delta_{mn}, \quad m, n \ge 1, \int_{-\pi}^{\pi} \sin(mx)\, \sin(nx)\, dx = \frac{1}{2}\int_{-\pi}^{\pi} \cos((n-m)x)-\cos((n+m)x)\, dx = \pi \delta_{mn}, \quad m, n \ge 1 (where is the Kronecker delta), and \int_{-\pi}^{\pi} \cos(mx)\, \sin(nx)\, dx = \frac{1}{2}\int_{-\pi}^{\pi} \sin((n+m)x)+\sin((n-m)x)\, dx = 0; Hence, the set \left\{1,\sqrt{2}\cos x,\sqrt{2}\sin x,\dots,\sqrt{2}\cos (nx),\sqrt{2}\sin (nx),\dots \right\}, 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_series_square_wave_circles_animation.gif|link=//upload.wikimedia.org/wikipedia/commons/b/bd/Fourier_series_square_wave_circles_animation.svg|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)] Fourier_series_sawtooth_wave_circles_animation.gif|link=//upload.wikimedia.org/wikipedia/commons/1/1e/Fourier_series_sawtooth_wave_circles_animation.svg|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_Fourier_Convergence.gif |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 do not specify the convergence conditions, are sometimes referred to generically as Fourier's theorem or the Fourier theorem.
Least squares property
The earlier : s_N(x) = \sum_{n=-N}^N S[n]\ e^{i 2\pi\tfrac{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^{i 2\pi\tfrac{n}{P}x}. Parseval's theorem implies that: {{math theorem | math_statement=The trigonometric polynomial s_N is the unique best trigonometric polynomial of degree N approximating s(x) , in the sense that, for any trigonometric polynomial p_N \neq s_N of degree N , we have: \|s_N - s\|_2 where the Hilbert space norm is defined as: \| g \|_2 = \sqrt{{1 \over P} \int_P |g(x)|^2 \, dx}. }} f(x) = \sum_{n=1}^{\infty} \frac{1}{n^2} \sin\left[ \left( 2^{n^3} +1 \right) \frac{x}{2}\right].
Because the function is even the Fourier series contains only cosines: \sum_{m=0}^\infty C_m \cos(mx). The coefficients are: C_m=\frac 1\pi\sum_{n=1}^{\infty} \frac{1}{n^2} \left\{\frac 2{2^{n^3} +1-2m}+\frac 2{2^{n^3} +1+2m}\right\} As 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 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 th 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 Non-harmonic Fourier series Residue theorem integrals of f(z), singularities, poles Sine and cosine transforms Spectral theory Sturm–Liouville theory Trigonometric moment problem
Bibliography
2003 unabridged republication of the 1878 English translation by Alexander Freeman of Fourier's work Théorie Analytique de la Chaleur, originally published in 18221. Translated by M. Ackerman from Vorlesungen über die Entwicklung der Mathematik im 19. Jahrhundert, Springer, Berlin, 1928. The first edition was published in 19351.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1378175976 under CC BY-SA 4.0; modifications have been made.
References
- ↩Wikipedia “Fourier series” publication date (×2) · confidence 0.95 revision URL