Open main menu

Wikipedia β

A sinusoidal curve, with peak amplitude (1). 
Illustration of phase shift θ
In the first row is the graph of the unit pulse function f (t) and its Fourier transform  (ω), a function of frequency ω. Translation (that is, delay) in the time domain goes over to complex phase shifts in the frequency domain. In the second row is shown g(t), a delayed unit pulse, beside the real and imaginary parts of the Fourier transform. The Fourier transform decomposes a function into eigenfunctions for the group of translations.

The Fourier transform decomposes a function of time (a signal) into the frequencies that make it up, in a way similar to how a musical chord can be expressed as the frequencies (or pitches) of its constituent notes. The Fourier transform of a function of time itself is a complex-valued function of frequency, whose absolute value represents the amount of that frequency present in the original function, and whose complex argument is the phase offset of the basic sinusoid in that frequency. The Fourier transform is called the frequency domain representation of the original signal. The term Fourier transform refers to both the frequency domain representation and the mathematical operation that associates the frequency domain representation to a function of time. The Fourier transform is not limited to functions of time, but in order to have a unified language, the domain of the original function is commonly referred to as the time domain. For many functions of practical interest, one can define an operation that reverses this: the inverse Fourier transformation, also called Fourier synthesis, of a frequency domain representation combines the contributions of all the different frequencies to recover the original function of time.

Fourier transforms
Continuous Fourier transform
Fourier series
Discrete-time Fourier transform
Discrete Fourier transform
Discrete Fourier transform over a ring
Fourier analysis
Related transforms

Linear operations performed in one domain (time or frequency) have corresponding operations in the other domain, which are sometimes easier to perform. The operation of differentiation in the time domain corresponds to multiplication by the frequency,[remark 1] so some differential equations are easier to analyze in the frequency domain. Also, convolution in the time domain corresponds to ordinary multiplication in the frequency domain. Concretely, this means that any linear time-invariant system, such as a filter applied to a signal, can be expressed relatively simply as an operation on frequencies.[remark 2] After performing the desired operations, transformation of the result can be made back to the time domain. Harmonic analysis is the systematic study of the relationship between the frequency and time domains, including the kinds of functions or operations that are "simpler" in one or the other, and has deep connections to almost all areas of modern mathematics.

Functions that are localized in the time domain have Fourier transforms that are spread out across the frequency domain and vice versa, a phenomenon known as the uncertainty principle. The critical case for this principle is the Gaussian function, of substantial importance in probability theory and statistics as well as in the study of physical phenomena exhibiting normal distribution (e.g., diffusion). The Fourier transform of a Gaussian function is another Gaussian function. Joseph Fourier introduced the transform in his study of heat transfer, where Gaussian functions appear as solutions of the heat equation.

The Fourier transform can be formally defined as an improper Riemann integral, making it an integral transform, although this definition is not suitable for many applications requiring a more sophisticated integration theory.[remark 3] For example, many relatively simple applications use the Dirac delta function, which can be treated formally as if it were a function, but the justification requires a mathematically more sophisticated viewpoint.[remark 4] The Fourier transform can also be generalized to functions of several variables on Euclidean space, sending a function of 3-dimensional space to a function of 3-dimensional momentum (or a function of space and time to a function of 4-momentum). This idea makes the spatial Fourier transform very natural in the study of waves, as well as in quantum mechanics, where it is important to be able to represent wave solutions as functions of either space or momentum and sometimes both. In general, functions to which Fourier methods are applicable are complex-valued, and possibly vector-valued.[remark 5] Still further generalization is possible to functions on groups, which, besides the original Fourier transform on or n (viewed as groups under addition), notably includes the discrete-time Fourier transform (DTFT, group = ), the discrete Fourier transform (DFT, group = mod N) and the Fourier series or circular Fourier transform (group = S1, the unit circle ≈ closed finite interval with endpoints identified). The latter is routinely employed to handle periodic functions. The fast Fourier transform (FFT) is an algorithm for computing the DFT.



The Fourier transform of the function f is traditionally denoted by adding a circumflex:  . There are several common conventions for defining the Fourier transform of an integrable function f : .[1][2] Here we will use the following definition:


for any real number ξ.

When the independent variable x represents time (with SI unit of seconds), the transform variable ξ represents frequency (in hertz). Under suitable conditions, f is determined by   via the inverse transform:


for any real number x.

The statement that f can be reconstructed from   is known as the Fourier inversion theorem, and was first introduced in Fourier's Analytical Theory of Heat,[3][4] although what would be considered a proof by modern standards was not given until much later.[5][6] The functions f and   often are referred to as a Fourier integral pair or Fourier transform pair.[7]

For other common conventions and notations, including using the angular frequency ω instead of the frequency ξ, see Other conventions and Other notations below. The Fourier transform on Euclidean space is treated separately, in which the variable x often represents position and ξ momentum. The conventions chosen in this article are those of harmonic analysis, and are characterized as the unique conventions such that the Fourier transform is both unitary on L2 and an algebra homomorphism from L1 to L, without renormalizing the Lebesgue measure.[8]

Many other characterizations of the Fourier transform exist. For example, one uses the Stone–von Neumann theorem: the Fourier transform is the unique unitary intertwiner for the symplectic and Euclidean Schrödinger representations of the Heisenberg group.


In 1822, Joseph Fourier showed that some functions could be written as an infinite sum of harmonics.[9]


In the first frames of the animation, a function f is resolved into Fourier series: a linear combination of sines and cosines (in blue). The component frequencies of these sines and cosines spread across the frequency spectrum, are represented as peaks in the frequency domain (actually Dirac delta functions, shown in the last frames of the animation). The frequency domain representation of the function, , is the collection of these peaks at the frequencies that appear in this resolution of the function.

One motivation for the Fourier transform comes from the study of Fourier series. In the study of Fourier series, complicated but periodic functions are written as the sum of simple waves mathematically represented by sines and cosines. The Fourier transform is an extension of the Fourier series that results when the period of the represented function is lengthened and allowed to approach infinity.[10]

Due to the properties of sine and cosine, it is possible to recover the amplitude of each wave in a Fourier series using an integral. In many cases it is desirable to use Euler's formula, which states that e = cos(2πθ) + i sin(2πθ), to write Fourier series in terms of the basic waves e. This has the advantage of simplifying many of the formulas involved, and provides a formulation for Fourier series that more closely resembles the definition followed in this article. Re-writing sines and cosines as complex exponentials makes it necessary for the Fourier coefficients to be complex valued. The usual interpretation of this complex number is that it gives both the amplitude (or size) of the wave present in the function and the phase (or the initial angle) of the wave. These complex exponentials sometimes contain negative "frequencies". If θ is measured in seconds, then the waves e and e−2π both complete one cycle per second, but they represent different frequencies in the Fourier transform. Hence, frequency no longer measures the number of cycles per unit time, but is still closely related.

There is a close connection between the definition of Fourier series and the Fourier transform for functions f that are zero outside an interval. For such a function, we can calculate its Fourier series on any interval that includes the points where f is not identically zero. The Fourier transform is also defined for such a function. As we increase the length of the interval on which we calculate the Fourier series, then the Fourier series coefficients begin to look like the Fourier transform and the sum of the Fourier series of f begins to look like the inverse Fourier transform. To explain this more precisely, suppose that T is large enough so that the interval [−T/2, T/2] contains the interval on which f is not identically zero. Then the nth series coefficient cn is given by:


Comparing this to the definition of the Fourier transform, it follows that


since f (x) is zero outside [−T/2, T/2]. Thus the Fourier coefficients are just the values of the Fourier transform sampled on a grid of width 1/T, multiplied by the grid width 1/T.

Under appropriate conditions, the Fourier series of f will equal the function f. In other words, f can be written:


where the last sum is simply the first sum rewritten using the definitions ξn = n/T, and Δξ = n + 1/Tn/T = 1/T.

This second sum is a Riemann sum, and so by letting T → ∞ it will converge to the integral for the inverse Fourier transform given in the definition section. Under suitable conditions, this argument may be made precise.[11]

In the study of Fourier series the numbers cn could be thought of as the "amount" of the wave present in the Fourier series of f. Similarly, as seen above, the Fourier transform can be thought of as a function that measures how much of each individual frequency is present in our function f, and we can recombine these waves by using an integral (or "continuous sum") to reproduce the original function.


The following figures provide a visual illustration of how the Fourier transform measures whether a frequency is present in a particular function. The depicted function f (t) = cos(6πt) e−πt2 oscillates at 3 Hz (if t measures seconds) and tends quickly to 0. (The second factor in this equation is an envelope function that shapes the continuous sinusoid into a short pulse. Its general form is a Gaussian function). This function was specially chosen to have a real Fourier transform that can easily be plotted. The first image contains its graph. In order to calculate  (3) we must integrate e−2πi(3t)f (t). The second image shows the plot of the real and imaginary parts of this function. The real part of the integrand is almost always positive, because when f (t) is negative, the real part of e−2πi(3t) is negative as well. Because they oscillate at the same rate, when f (t) is positive, so is the real part of e−2πi(3t). The result is that when you integrate the real part of the integrand you get a relatively large number (in this case 1/2). On the other hand, when you try to measure a frequency that is not present, as in the case when we look at  (5), you see that both real and imaginary component of this function vary rapidly between positive and negative values, as plotted in the third image. Therefore, in this case, the integrand oscillates fast enough so that the integral is very small and the value for the Fourier transform for that frequency is nearly zero.

The general situation may be a bit more complicated than this, but this in spirit is how the Fourier transform measures how much of an individual frequency is present in a function f (t).

Properties of the Fourier transformEdit

Here we assume f (x), g(x) and h(x) are integrable functions: Lebesgue-measurable on the real line satisfying:


We denote the Fourier transforms of these functions as  (ξ), ĝ(ξ) and ĥ(ξ) respectively.

Basic propertiesEdit

The Fourier transform has the following basic properties:[12]

For any complex numbers a and b, if h(x) = af (x) + bg(x), then ĥ(ξ) = a ·  (ξ) + b · ĝ(ξ).
Translation / time shifting
For any real number x0, if h(x) = f (xx0), then ĥ(ξ) = e−2πix0ξ  (ξ).
Modulation / frequency shifting
For any real number ξ0 if h(x) = e−2πixξ0 f (x), then ĥ(ξ) =  (ξξ0).
Time scaling
For a non-zero real number a, if h(x) = f (ax), then
The case a = −1 leads to the time-reversal property, which states: if h(x) = f (−x), then ĥ(ξ) =  (−ξ).
If h(x) = f (x), then
In particular, if f is real, then one has the reality condition
that is, is a Hermitian function. And if f is purely imaginary, then
Substituting ξ = 0 in the definition, we obtain
That is, the evaluation of the Fourier transform at the origin (ξ = 0) equals the integral of f over all its domain.

Invertibility and periodicityEdit

Under suitable conditions on the function f, it can be recovered from its Fourier transform . Indeed, denoting the Fourier transform operator by F, so F( f ) := , then for suitable functions, applying the Fourier transform twice simply flips the function: F2( f )(x) = f (−x), which can be interpreted as "reversing time". Since reversing time is two-periodic, applying this twice yields F4( f ) = f, so the Fourier transform operator is four-periodic, and similarly the inverse Fourier transform can be obtained by applying the Fourier transform three times: F3(  ) = f. In particular the Fourier transform is invertible (under suitable conditions).

More precisely, defining the parity operator P that inverts time, P[ f ] : tf (−t):


These equalities of operators require careful definition of the space of functions in question, defining equality of functions (equality at every point? equality almost everywhere?) and defining equality of operators – that is, defining the topology on the function space and operator space in question. These are not true for all functions, but are true under various conditions, which are the content of the various forms of the Fourier inversion theorem.

This fourfold periodicity of the Fourier transform is similar to a rotation of the plane by 90°, particularly as the two-fold iteration yields a reversal, and in fact this analogy can be made precise. While the Fourier transform can simply be interpreted as switching the time domain and the frequency domain, with the inverse Fourier transform switching them back, more geometrically it can be interpreted as a rotation by 90° in the time–frequency domain (considering time as the x-axis and frequency as the y-axis), and the Fourier transform can be generalized to the fractional Fourier transform, which involves rotations by other angles. This can be further generalized to linear canonical transformations, which can be visualized as the action of the special linear group SL2() on the time–frequency plane, with the preserved symplectic form corresponding to the uncertainty principle, below. This approach is particularly studied in signal processing, under time–frequency analysis.

Units and dualityEdit

In mathematics, one often does not think of any units as being attached to the two variables t and ξ. But in physical applications, ξ must have inverse units to the units of t. For example, if t is measured in seconds, ξ should be in cycles per second for the formulas here to be valid. If the scale of t is changed and t is measured in units of 2π seconds, then either ξ must be in the so-called "angular frequency", or one must insert some constant scale factor into some of the formulas. If t is measured in units of length, then ξ must be in inverse length, e.g., wavenumbers. That is to say, there are two copies of the real line: one measured in one set of units, where t ranges, and the other in inverse units to the units of t, and which is the range of ξ. So these are two distinct copies of the real line, and cannot be identified with each other. Therefore, the Fourier transform goes from one space of functions to a different space of functions: functions which have a different domain of definition.

In general, ξ must always be taken to be a linear form on the space of ts, which is to say that the second real line is the dual space of the first real line. See the article on linear algebra for a more formal explanation and for more details. This point of view becomes essential in generalisations of the Fourier transform to general symmetry groups, including the case of Fourier series.

That there is no one preferred way (often, one says "no canonical way") to compare the two copies of the real line which are involved in the Fourier transform—fixing the units on one line does not force the scale of the units on the other line—is the reason for the plethora of rival conventions on the definition of the Fourier transform. The various definitions resulting from different choices of units differ by various constants. If the units of t are in seconds but the units of ξ are in angular frequency, then the angular frequency variable is often denoted by one or another Greek letter, for example, ω = 2πξ is quite common. Thus (writing 1 for the alternative definition and for the definition adopted in this article)


as before, but the corresponding alternative inversion formula would then have to be


To have something involving angular frequency but with greater symmetry between the Fourier transform and the inversion formula, one very often sees still another alternative definition of the Fourier transform, with a factor of 2π, thus


and the corresponding inversion formula then has to be


Furthermore, there is no way to fix which square root of negative one will be meant by the symbol i (it makes no sense to speak of "the positive square root" since only real numbers can be positive, similarly it makes no sense to say "rotation counter-clockwise", because until i is chosen, there is no fixed way to draw the complex plane), and hence one occasionally sees the Fourier transform written with i in the exponent instead of i, and vice versa for the inversion formula, a convention that is equally valid as the one chosen in this article, which is the most usual one.

For example, in probability theory, the characteristic function ϕ of the probability density function f of a random variable X of continuous type is defined without a negative sign in the exponential, and since the units of x are ignored, there is no 2π either:


(In probability theory, and in mathematical statistics, the use of the Fourier—Stieltjes transform is preferred, because so many random variables are not of continuous type, and do not possess a density function, and one must treat discontinuous distribution functions, i.e., measures which possess "atoms".)

From the higher point of view of group characters, which is much more abstract, all these arbitrary choices disappear, as will be explained in the later section of this article, on the notion of the Fourier transform of a function on an Abelian locally compact group.

Uniform continuity and the Riemann–Lebesgue lemmaEdit

The sinc function, which is the Fourier transform of the rectangular function, is bounded and continuous, but not Lebesgue integrable.

The Fourier transform may be defined in some cases for non-integrable functions, but the Fourier transforms of integrable functions have several strong properties.

The Fourier transform of any integrable function f is uniformly continuous and[13]


By the Riemann–Lebesgue lemma,[14]


However, need not be integrable. For example, the Fourier transform of the rectangular function, which is integrable, is the sinc function, which is not Lebesgue integrable, because its improper integrals behave analogously to the alternating harmonic series, in converging to a sum without being absolutely convergent.

It is not generally possible to write the inverse transform as a Lebesgue integral. However, when both f and are integrable, the inverse equality


holds almost everywhere. That is, the Fourier transform is injective on L1(). (But if f is continuous, then equality holds for every x.)

Plancherel theorem and Parseval's theoremEdit

Let f (x) and g(x) be integrable, and let  (ξ) and ĝ(ξ) be their Fourier transforms. If f (x) and g(x) are also square-integrable, then we have Parseval's Formula:[15]


where the bar denotes complex conjugation.

The Plancherel theorem, which follows from the above, states that[16]


Plancherel's theorem makes it possible to extend the Fourier transform, by a continuity argument, to a unitary operator on L2(). On L1() ∩ L2(), this extension agrees with original Fourier transform defined on L1(), thus enlarging the domain of the Fourier transform to L1() + L2() (and consequently to Lp() for 1 ≤ p ≤ 2). Plancherel's theorem has the interpretation in the sciences that the Fourier transform preserves the energy of the original quantity. The terminology of these formulas is not quite standardised. Parseval's theorem was proved only for Fourier series, and was first proved by Lyapunov. But Parseval's formula makes sense for the Fourier transform as well, and so even though in the context of the Fourier transform it was proved by Plancherel, it is still often referred to as Parseval's formula, or Parseval's relation, or even Parseval's theorem.

See Pontryagin duality for a general formulation of this concept in the context of locally compact abelian groups.

Poisson summation formulaEdit

The Poisson summation formula (PSF) is an equation that relates the Fourier series coefficients of the periodic summation of a function to values of the function's continuous Fourier transform. The Poisson summation formula says that for sufficiently regular functions f,


It has a variety of useful forms that are derived from the basic one by application of the Fourier transform's scaling and time-shifting properties. The formula has applications in engineering, physics, and number theory. The frequency-domain dual of the standard Poisson summation formula is also called the discrete-time Fourier transform.

Poisson summation is generally associated with the physics of periodic media, such as heat conduction on a circle. The fundamental solution of the heat equation on a circle is called a theta function. It is used in number theory to prove the transformation properties of theta functions, which turn out to be a type of modular form, and it is connected more generally to the theory of automorphic forms where it appears on one side of the Selberg trace formula.


Suppose f (x) is a differentiable function, and both f and its derivative f ′ are integrable. Then the Fourier transform of the derivative is given by


More generally, the Fourier transformation of the nth derivative f(n) is given by


By applying the Fourier transform and using these formulas, some ordinary differential equations can be transformed into algebraic equations, which are much easier to solve. These formulas also give rise to the rule of thumb "f (x) is smooth if and only if  (ξ) quickly falls to 0 for |ξ| → ∞." By using the analogous rules for the inverse Fourier transform, one can also say "f (x) quickly falls to 0 for |x| → ∞ if and only if  (ξ) is smooth."

Convolution theoremEdit

The Fourier transform translates between convolution and multiplication of functions. If f (x) and g(x) are integrable functions with Fourier transforms  (ξ) and ĝ(ξ) respectively, then the Fourier transform of the convolution is given by the product of the Fourier transforms  (ξ) and ĝ(ξ) (under other conventions for the definition of the Fourier transform a constant factor may appear).

This means that if:


where denotes the convolution operation, then:


In linear time invariant (LTI) system theory, it is common to interpret g(x) as the impulse response of an LTI system with input f (x) and output h(x), since substituting the unit impulse for f (x) yields h(x) = g(x). In this case, ĝ(ξ) represents the frequency response of the system.

Conversely, if f (x) can be decomposed as the product of two square integrable functions p(x) and q(x), then the Fourier transform of f (x) is given by the convolution of the respective Fourier transforms (ξ) and (ξ).

Cross-correlation theoremEdit

In an analogous manner, it can be shown that if h(x) is the cross-correlation of f (x) and g(x):


then the Fourier transform of h(x) is:


As a special case, the autocorrelation of function f (x) is:


for which



One important choice of an orthonormal basis for L2() is given by the Hermite functions


where Hen(x) are the "probabilist's" Hermite polynomials, defined as


Under this convention for the Fourier transform, we have that


In other words, the Hermite functions form a complete orthonormal system of eigenfunctions for the Fourier transform on L2().[12] However, this choice of eigenfunctions is not unique. There are only four different eigenvalues of the Fourier transform (±1 and ±i) and any linear combination of eigenfunctions with the same eigenvalue gives another eigenfunction. As a consequence of this, it is possible to decompose L2() as a direct sum of four spaces H0, H1, H2, and H3 where the Fourier transform acts on Hek simply by multiplication by ik.

Since the complete set of Hermite functions provides a resolution of the identity, the Fourier transform can be represented by such a sum of terms weighted by the above eigenvalues, and these sums can be explicitly summed. This approach to define the Fourier transform was first done by Norbert Wiener.[17] Among other properties, Hermite functions decrease exponentially fast in both frequency and time domains, and they are thus used to define a generalization of the Fourier transform, namely the fractional Fourier transform used in time-frequency analysis.[18] In physics, this transform was introduced by Edward Condon.[19]

Connection with the Heisenberg groupEdit

The Heisenberg group is a certain group of unitary operators on the Hilbert space L2() of square integrable complex valued functions f on the real line, generated by the translations (Ty f )(x) = f (x + y) and multiplication by eixξ, (Mξ f )(x) = eixξ f (x). These operators do not commute, as their (group) commutator is


which is multiplication by the constant (independent of x) eiyξU(1) (the circle group of unit modulus complex numbers). As an abstract group, the Heisenberg group is the three-dimensional Lie group of triples (x, ξ, z) ∈ 2 × U(1), with the group law


Denote the Heisenberg group by H1. The above procedure describes not only the group structure, but also a standard unitary representation of H1 on a Hilbert space, which we denote by ρ : H1B(L2()). Define the linear automorphism of 2 by


so that J2 = −I. This J can be extended to a unique automorphism of H1:


According to the Stone–von Neumann theorem, the unitary representations ρ and ρj are unitarily equivalent, so there is a unique intertwiner WU(L2()) such that


This operator W is the Fourier transform.

Many of the standard properties of the Fourier transform are immediate consequences of this more general framework.[20] For example, the square of the Fourier transform, W2, is an intertwiner associated with J2 = −I, and so we have (W2f )(x) = f (−x) is the reflection of the original function f.

Complex domainEdit

The integral for the Fourier transform


can be studied for complex values of its argument ξ. Depending on the properties of f, this might not converge off the real axis at all, or it might converge to a complex analytic function for all values of ξ = σ + , or something in between.[21]

The Paley–Wiener theorem says that f is smooth (i.e., n-times differentiable for all positive integers n) and compactly supported if and only if  (σ + ) is a holomorphic function for which there exists a constant a > 0 such that for any integer n ≥ 0,


for some constant C. (In this case, f is supported on [−a, a].) This can be expressed by saying that is an entire function which is rapidly decreasing in σ (for fixed τ) and of exponential growth in τ (uniformly in σ).[22]

(If f is not smooth, but only L2, the statement still holds provided n = 0.[23]) The space of such functions of a complex variable is called the Paley—Wiener space. This theorem has been generalised to semisimple Lie groups.[24]

If f is supported on the half-line t ≥ 0, then f is said to be "causal" because the impulse response function of a physically realisable filter must have this property, as no effect can precede its cause. Paley and Wiener showed that then extends to a holomorphic function on the complex lower half-plane τ < 0 which tends to zero as τ goes to infinity.[25] The converse is false and it is not known how to characterise the Fourier transform of a causal function.[26]

Laplace transformEdit

The Fourier transform  (ξ) is related to the Laplace transform F(s), which is also used for the solution of differential equations and the analysis of filters.

It may happen that a function f for which the Fourier integral does not converge on the real axis at all, nevertheless has a complex Fourier transform defined in some region of the complex plane.

For example, if f (t) is of exponential growth, i.e.,


for some constants C, a ≥ 0, then[27]


convergent for all τ < −a, is the two-sided Laplace transform of f.

The more usual version ("one-sided") of the Laplace transform is


If f is also causal, then


Thus, extending the Fourier transform to the complex domain means it includes the Laplace transform as a special case—the case of causal functions—but with the change of variable s = 2π.


If has no poles for aτb, then


by Cauchy's integral theorem. Therefore, the Fourier inversion formula can use integration along different lines, parallel to the real axis.[28]

Theorem: If f (t) = 0 for t < 0, and |f (t)| < Cea|t| for some constants C, a > 0, then


for any τ < −a/.

This theorem implies the Mellin inversion formula for the Laplace transformation,[27]


for any b > a, where F(s) is the Laplace transform of f (t).

The hypotheses can be weakened, as in the results of Carleman and Hunt, to f (t) eat being L1, provided that t is in the interior of a closed interval on which f is continuous and of bounded variation, and provided that the integrals are taken in the sense of Cauchy principal values.[29]

L2 versions of these inversion formulas are also available.[30]

Fourier transform on Euclidean spaceEdit

The Fourier transform can be defined in any arbitrary number of dimensions n. As with the one-dimensional case, there are many conventions. For an integrable function f (x), this article takes the definition:


where x and ξ are n-dimensional vectors, and x · ξ is the dot product of the vectors. The dot product is sometimes written as x, ξ.

All of the basic properties listed above hold for the n-dimensional Fourier transform, as do Plancherel's and Parseval's theorem. When the function is integrable, the Fourier transform is still uniformly continuous and the Riemann–Lebesgue lemma holds.[14]

Uncertainty principleEdit

Generally speaking, the more concentrated f (x) is, the more spread out its Fourier transform  (ξ) must be. In particular, the scaling property of the Fourier transform may be seen as saying: if we squeeze a function in x, its Fourier transform stretches out in ξ. It is not possible to arbitrarily concentrate both a function and its Fourier transform.

The trade-off between the compaction of a function and its Fourier transform can be formalized in the form of an uncertainty principle by viewing a function and its Fourier transform as conjugate variables with respect to the symplectic form on the time–frequency domain: from the point of view of the linear canonical transformation, the Fourier transform is rotation by 90° in the time–frequency domain, and preserves the symplectic form.

Suppose f (x) is an integrable and square-integrable function. Without loss of generality, assume that f (x) is normalized:


It follows from the Plancherel theorem that  (ξ) is also normalized.

The spread around x = 0 may be measured by the dispersion about zero[31] defined by


In probability terms, this is the second moment of |f (x)|2 about zero.

The Uncertainty principle states that, if f (x) is absolutely continuous and the functions x·f (x) and f ′(x) are square integrable, then[12]


The equality is attained only in the case


where σ > 0 is arbitrary and C1 = 42/σ so that f is L2-normalized.[12] In other words, where f is a (normalized) Gaussian function with variance σ2, centered at zero, and its Fourier transform is a Gaussian function with variance σ−2.

In fact, this inequality implies that:


for any x0, ξ0.[11]

In quantum mechanics, the momentum and position wave functions are Fourier transform pairs, to within a factor of Planck's constant. With this constant properly taken into account, the inequality above becomes the statement of the Heisenberg uncertainty principle.[32]

A stronger uncertainty principle is the Hirschman uncertainty principle, which is expressed as:


where H(p) is the differential entropy of the probability density function p(x):


where the logarithms may be in any base that is consistent. The equality is attained for a Gaussian, as in the previous case.

Sine and cosine transformsEdit

Fourier's original formulation of the transform did not use complex numbers, but rather sines and cosines. Statisticians and others still use this form. An absolutely integrable function f for which Fourier inversion holds good can be expanded in terms of genuine frequencies (avoiding negative frequencies, which are sometimes considered hard to interpret physically[33]) λ by


This is called an expansion as a trigonometric integral, or a Fourier integral expansion. The coefficient functions a and b can be found by using variants of the Fourier cosine transform and the Fourier sine transform (the normalisations are, again, not standardised):




Older literature refers to the two transform functions, the Fourier cosine transform, a, and the Fourier sine transform, b.

The function f can be recovered from the sine and cosine transform using


together with trigonometric identities. This is referred to as Fourier's integral formula.[27][34][35][36]

Spherical harmonicsEdit

Let the set of homogeneous harmonic polynomials of degree k on n be denoted by Ak. The set Ak consists of the solid spherical harmonics of degree k. The solid spherical harmonics play a similar role in higher dimensions to the Hermite polynomials in dimension one. Specifically, if f (x) = e−π|x|2P(x) for some P(x) in Ak, then  (ξ) = ik f (ξ). Let the set Hk be the closure in L2(n) of linear combinations of functions of the form f (|x|)P(x) where P(x) is in Ak. The space L2(n) is then a direct sum of the spaces Hk and the Fourier transform maps each space Hk to itself and is possible to characterize the action of the Fourier transform on each space Hk.[14]

Let f (x) = f0(|x|)P(x) (with P(x) in Ak), then




Here Jn + 2k − 2/2 denotes the Bessel function of the first kind with order n + 2k − 2/2. When k = 0 this gives a useful formula for the Fourier transform of a radial function.[37] Note that this is essentially the Hankel transform. Moreover, there is a simple recursion relating the cases n + 2 and n[38] allowing to compute, e.g., the three-dimensional Fourier transform of a radial function from the one-dimensional one.

Restriction problemsEdit

In higher dimensions it becomes interesting to study restriction problems for the Fourier transform. The Fourier transform of an integrable function is continuous and the restriction of this function to any set is defined. But for a square-integrable function the Fourier transform could be a general class of square integrable functions. As such, the restriction of the Fourier transform of an L2(n) function cannot be defined on sets of measure 0. It is still an active area of study to understand restriction problems in Lp for 1 < p < 2. Surprisingly, it is possible in some cases to define the restriction of a Fourier transform to a set S, provided S has non-zero curvature. The case when S is the unit sphere in n is of particular interest. In this case the Tomas–Stein restriction theorem states that the restriction of the Fourier transform to the unit sphere in n is a bounded operator on Lp provided 1 ≤ p2n + 2/n + 3.

One notable difference between the Fourier transform in 1 dimension versus higher dimensions concerns the partial sum operator. Consider an increasing collection of measurable sets ER indexed by R ∈ (0,∞): such as balls of radius R centered at the origin, or cubes of side 2R. For a given integrable function f, consider the function fR defined by:


Suppose in addition that fLp(n). For n = 1 and 1 < p < ∞, if one takes ER = (−R, R), then fR converges to f in Lp as R tends to infinity, by the boundedness of the Hilbert transform. Naively one may hope the same holds true for n > 1. In the case that ER is taken to be a cube with side length R, then convergence still holds. Another natural candidate is the Euclidean ball ER = {ξ : |ξ| < R}. In order for this partial sum operator to converge, it is necessary that the multiplier for the unit ball be bounded in Lp(n). For n ≥ 2 it is a celebrated theorem of Charles Fefferman that the multiplier for the unit ball is never bounded unless p = 2.[17] In fact, when p ≠ 2, this shows that not only may fR fail to converge to f in Lp, but for some functions fLp(n), fR is not even an element of Lp.

Fourier transform on function spacesEdit

On Lp spacesEdit

On L1Edit

The definition of the Fourier transform by the integral formula


is valid for Lebesgue integrable functions f; that is, fL1(n).

The Fourier transform F : L1(n) → L(n) is a bounded operator. This follows from the observation that


which shows that its operator norm is bounded by 1. Indeed, it equals 1, which can be seen, for example, from the transform of the rect function. The image of L1 is a subset of the space C0(n) of continuous functions that tend to zero at infinity (the Riemann–Lebesgue lemma), although it is not the entire space. Indeed, there is no simple characterization of the image.

On L2Edit

Since compactly supported smooth functions are integrable and dense in L2(n), the Plancherel theorem allows us to extend the definition of the Fourier transform to general functions in L2(n) by continuity arguments. The Fourier transform in L2(n) is no longer given by an ordinary Lebesgue integral, although it can be computed by an improper integral, here meaning that for an L2 function f,


where the limit is taken in the L2 sense. Many of the properties of the Fourier transform in L1 carry over to L2, by a suitable limiting argument.

Furthermore, F : L2(n) → L2(n) is a unitary operator.[39] For an operator to be unitary it is sufficient to show that it is bijective and preserves the inner product, so in this case these follow from the Fourier inversion theorem combined with the fact that for any f, gL2(n) we have


In particular, the image of L2(n) is itself under the Fourier transform.

On other LpEdit

The definition of the Fourier transform can be extended to functions in Lp(n) for 1 ≤ p ≤ 2 by decomposing such functions into a fat tail part in L2 plus a fat body part in L1. In each of these spaces, the Fourier transform of a function in Lp(n) is in Lq(n), where q = p/p − 1 is the Hölder conjugate of p (by the Hausdorff–Young inequality). However, except for p = 2, the image is not easily characterized. Further extensions become more technical. The Fourier transform of functions in Lp for the range 2 < p < ∞ requires the study of distributions.[13] In fact, it can be shown that there are functions in Lp with p > 2 so that the Fourier transform is not defined as a function.[14]

Tempered distributionsEdit

One might consider enlarging the domain of the Fourier transform from L1 + L2 by considering generalized functions, or distributions. A distribution on n is a continuous linear functional on the space Cc(n) of compactly supported smooth functions, equipped with a suitable topology. The strategy is then to consider the action of the Fourier transform on Cc(n) and pass to distributions by duality. The obstruction to do this is that the Fourier transform does not map Cc(n) to Cc(n). In fact the Fourier transform of an element in Cc(n) can not vanish on an open set; see the above discussion on the uncertainty principle. The right space here is the slightly larger space of Schwartz functions. The Fourier transform is an automorphism on the Schwartz space, as a topological vector space, and thus induces an automorphism on its dual, the space of tempered distributions.[14] The tempered distributions include all the integrable functions mentioned above, as well as well-behaved functions of polynomial growth and distributions of compact support.

For the definition of the Fourier transform of a tempered distribution, let f and g be integrable functions, and let and ĝ be their Fourier transforms respectively. Then the Fourier transform obeys the following multiplication formula,[14]


Every integrable function f defines (induces) a distribution Tf by the relation


for all Schwartz functions φ. So it makes sense to define Fourier transform f of Tf by


for all Schwartz functions φ. Extending this to all tempered distributions T gives the general definition of the Fourier transform.

Distributions can be differentiated and the above-mentioned compatibility of the Fourier transform with differentiation and convolution remains true for tempered distributions.


Fourier–Stieltjes transformEdit

The Fourier transform of a finite Borel measure μ on n is given by:[40]


This transform continues to enjoy many of the properties of the Fourier transform of integrable functions. One notable difference is that the Riemann–Lebesgue lemma fails for measures.[13] In the case that = f (x) dx, then the formula above reduces to the usual definition for the Fourier transform of f. In the case that μ is the probability distribution associated to a random variable X, the Fourier–Stieltjes transform is closely related to the characteristic function, but the typical conventions in probability theory take eixξ instead of e−2πixξ.[12] In the case when the distribution has a probability density function this definition reduces to the Fourier transform applied to the probability density function, again with a different choice of constants.

The Fourier transform may be used to give a characterization of measures. Bochner's theorem characterizes which functions may arise as the Fourier–Stieltjes transform of a positive measure on the circle.[13]

Furthermore, the Dirac delta function, although not a function, is a finite Borel measure. Its Fourier transform is a constant function (whose specific value depends upon the form of the Fourier transform used).

Locally compact abelian groupsEdit

The Fourier transform may be generalized to any locally compact abelian group. A locally compact abelian group is an abelian group that is at the same time a locally compact Hausdorff topological space so that the group operation is continuous. If G is a locally compact abelian group, it has a translation invariant measure μ, called Haar measure. For a locally compact abelian group G, the set of irreducible, i.e. one-dimensional, unitary representations are called its characters. With its natural group structure and the topology of pointwise convergence, the set of characters Ĝ is itself a locally compact abelian group, called the Pontryagin dual of G. For a function f in L1(G), its Fourier transform is defined by[13]


The Riemann–Lebesgue lemma holds in this case;  (ξ) is a function vanishing at infinity on Ĝ.

Gelfand transformEdit

The Fourier transform is also a special case of Gelfand transform. In this particular context, it is closely related to the Pontryagin duality map defined above.

Given an abelian locally compact Hausdorff topological group G, as before we consider space L1(G), defined using a Haar measure. With convolution as multiplication, L1(G) is an abelian Banach algebra. It also has an involution * given by


Taking the completion with respect to the largest possibly C*-norm gives its enveloping C*-algebra, called the group C*-algebra C*(G) of G. (Any C*-norm on L1(G) is bounded by the L1 norm, therefore their supremum exists.)

Given any abelian C*-algebra A, the Gelfand transform gives an isomorphism between A and C0(A^), where A^ is the multiplicative linear functionals, i.e. one-dimensional representations, on A with the weak-* topology. The map is simply given by


It turns out that the multiplicative linear functionals of C*(G), after suitable identification, are exactly the characters of G, and the Gelfand transform, when restricted to the dense subset L1(G) is the Fourier–Pontryagin transform.

Compact non-abelian groupsEdit

The Fourier transform can also be defined for functions on a non-abelian group, provided that the group is compact. Removing the assumption that the underlying group is abelian, irreducible unitary representations need not always be one-dimensional. This means the Fourier transform on a non-abelian group takes values as Hilbert space operators.[41] The Fourier transform on compact groups is a major tool in representation theory[42] and non-commutative harmonic analysis.

Let G be a compact Hausdorff topological group. Let Σ denote the collection of all isomorphism classes of finite-dimensional irreducible unitary representations, along with a definite choice of representation U(σ) on the Hilbert space Hσ of finite dimension dσ for each σ ∈ Σ. If μ is a finite Borel measure on G, then the Fourier–Stieltjes transform of μ is the operator on Hσ defined by


where U(σ) is the complex-conjugate representation of U(σ) acting on Hσ. If μ is absolutely continuous with respect to the left-invariant probability measure λ on G, represented as


for some fL1(λ), one identifies the Fourier transform of f with the Fourier–Stieltjes transform of μ.

The mapping


defines an isomorphism between the Banach space M(G) of finite Borel measures (see rca space) and a closed subspace of the Banach space C(Σ) consisting of all sequences E = (Eσ) indexed by Σ of (bounded) linear operators Eσ : HσHσ for which the norm


is finite. The "convolution theorem" asserts that, furthermore, this isomorphism of Banach spaces is in fact an isometric isomorphism of C* algebras into a subspace of C(Σ). Multiplication on M(G) is given by convolution of measures and the involution * defined by


and C(Σ) has a natural C*-algebra structure as Hilbert space operators.

The Peter–Weyl theorem holds, and a version of the Fourier inversion formula (Plancherel's theorem) follows: if fL2(G), then


where the summation is understood as convergent in the L2 sense.

The generalization of the Fourier transform to the noncommutative situation has also in part contributed to the development of noncommutative geometry.[citation needed] In this context, a categorical generalization of the Fourier transform to noncommutative groups is Tannaka–Krein duality, which replaces the group of characters with the category of representations. However, this loses the connection with harmonic functions.


In signal processing terms, a function (of time) is a representation of a signal with perfect time resolution, but no frequency information, while the Fourier transform has perfect frequency resolution, but no time information: the magnitude of the Fourier transform at a point is how much frequency content there is, but location is only given by phase (argument of the Fourier transform at a point), and standing waves are not localized in time – a sine wave continues out to infinity, without decaying. This limits the usefulness of the Fourier transform for analyzing signals that are localized in time, notably transients, or any signal of finite extent.

As alternatives to the Fourier transform, in time-frequency analysis, one uses time-frequency transforms or time-frequency distributions to represent signals in a form that has some time information and some frequency information – by the uncertainty principle, there is a trade-off between these. These can be generalizations of the Fourier transform, such as the short-time Fourier transform or fractional Fourier transform, or other functions to represent signals, as in wavelet transforms and chirplet transforms, with the wavelet analog of the (continuous) Fourier transform being the continuous wavelet transform.[18]


Some problems, such as certain differential equations, become easier to solve when the Fourier transform is applied. In that case the solution to the original problem is recovered using the inverse Fourier transform.

Analysis of differential equationsEdit

Perhaps the most important use of the Fourier transformation is to solve partial differential equations. Many of the equations of the mathematical physics of the nineteenth century can be treated this way. Fourier studied the heat equation, which in one dimension and in dimensionless units is


The example we will give, a slightly more difficult one, is the wave equation in one dimension,


As usual, the problem is not to find a solution: there are infinitely many. The problem is that of the so-called "boundary problem": find a solution which satisfies the "boundary conditions"


Here, f and g are given functions. For the heat equation, only one boundary condition can be required (usually the first one). But for the wave equation, there are still infinitely many solutions y which satisfy the first boundary condition. But when one imposes both conditions, there is only one possible solution.

It is easier to find the Fourier transform ŷ of the solution than to find the solution directly. This is because the Fourier transformation takes differentiation into multiplication by the variable, and so a partial differential equation applied to the original function is transformed into multiplication by polynomial functions of the dual variables applied to the transformed function. After ŷ is determined, we can apply the inverse Fourier transformation to find y.

Fourier's method is as follows. First, note that any function of the forms


satisfies the wave equation. These are called the elementary solutions.

Second, note that therefore any integral


(for arbitrary a+, a, b+, b) satisfies the wave equation. (This integral is just a kind of continuous linear combination, and the equation is linear.)

Now this resembles the formula for the Fourier synthesis of a function. In fact, this is the real inverse Fourier transform of a± and b± in the variable x.

The third step is to examine how to find the specific unknown coefficient functions a± and b± that will lead to y satisfying the boundary conditions. We are interested in the values of these solutions at t = 0. So we will set t = 0. Assuming that the conditions needed for Fourier inversion are satisfied, we can then find the Fourier sine and cosine transforms (in the variable x) of both sides and obtain




Similarly, taking the derivative of y with respect to t and then applying the Fourier sine and cosine transformations yields




These are four linear equations for the four unknowns a± and b±, in terms of the Fourier sine and cosine transforms of the boundary conditions, which are easily solved by elementary algebra, provided that these transforms can be found.

In summary, we chose a set of elementary solutions, parametrised by ξ, of which the general solution would be a (continuous) linear combination in the form of an integral over the parameter ξ. But this integral was in the form of a Fourier integral. The next step was to express the boundary conditions in terms of these integrals, and set them equal to the given functions f and g. But these expressions also took the form of a Fourier integral because of the properties of the Fourier transform of a derivative. The last step was to exploit Fourier inversion by applying the Fourier transformation to both sides, thus obtaining expressions for the coefficient functions a± and b± in terms of the given boundary conditions f and g.

From a higher point of view, Fourier's procedure can be reformulated more conceptually. Since there are two variables, we will use the Fourier transformation in both x and t rather than operate as Fourier did, who only transformed in the spatial variables. Note that ŷ must be considered in the sense of a distribution since y(x, t) is not going to be L1: as a wave, it will persist through time and thus is not a transient phenomenon. But it will be bounded and so its Fourier transform can be defined as a distribution. The operational properties of the Fourier transformation that are relevant to this equation are that it takes differentiation in x to multiplication by and differentiation with respect to t to multiplication by if where f is the frequency. Then the wave equation becomes an algebraic equation in ŷ:


This is equivalent to requiring ŷ(ξ, f ) = 0 unless ξ = ±f. Right away, this explains why the choice of elementary solutions we made earlier worked so well: obviously = δ(ξ ± f ) will be solutions. Applying Fourier inversion to these delta functions, we obtain the elementary solutions we picked earlier. But from the higher point of view, one does not pick elementary solutions, but rather considers the space of all distributions which are supported on the (degenerate) conic ξ2f2 = 0.

We may as well consider the distributions supported on the conic that are given by distributions of one variable on the line ξ = f plus distributions on the line ξ = −f as follows: if ϕ is any test function,


where s+, and s, are distributions of one variable.

Then Fourier inversion gives, for the boundary conditions, something very similar to what we had more concretely above (put ϕ(ξ, f ) = ei(+tf ), which is clearly of polynomial growth):




Now, as before, applying the one-variable Fourier transformation in the variable x to these functions of x yields two equations in the two unknown distributions s± (which can be taken to be ordinary functions if the boundary conditions are L1 or L2).

From a calculational point of view, the drawback of course is that one must first calculate the Fourier transforms of the boundary conditions, then assemble the solution from these, and then calculate an inverse Fourier transform. Closed form formulas are rare, except when there is some geometric symmetry that can be exploited, and the numerical calculations are difficult because of the oscillatory nature of the integrals, which makes convergence slow and hard to estimate. For practical calculations, other methods are often used.

The twentieth century has seen the extension of these methods to all linear partial differential equations with polynomial coefficients, and by extending the notion of Fourier transformation to include Fourier integral operators, some non-linear equations as well.

Fourier transform spectroscopyEdit

The Fourier transform is also used in nuclear magnetic resonance (NMR) and in other kinds of spectroscopy, e.g. infrared (FTIR). In NMR an exponentially shaped free induction decay (FID) signal is acquired in the time domain and Fourier-transformed to a Lorentzian line-shape in the frequency domain. The Fourier transform is also used in magnetic resonance imaging (MRI) and mass spectrometry.

Quantum mechanicsEdit

The Fourier transform is useful in quantum mechanics in two different ways. To begin with, the basic conceptual structure of Quantum Mechanics postulates the existence of pairs of complementary variables, connected by the Heisenberg uncertainty principle. For example, in one dimension, the spatial variable q of, say, a particle, can only be measured by the quantum mechanical "position operator" at the cost of losing information about the momentum p of the particle. Therefore, the physical state of the particle can either be described by a function, called "the wave function", of q or by a function of p but not by a function of both variables. The variable p is called the conjugate variable to q. In Classical Mechanics, the physical state of a particle (existing in one dimension, for simplicity of exposition) would be given by assigning definite values to both p and q simultaneously. Thus, the set of all possible physical states is the two-dimensional real vector space with a p-axis and a q-axis called the phase space.

In contrast, quantum mechanics chooses a polarisation of this space in the sense that it picks a subspace of one-half the dimension, for example, the q-axis alone, but instead of considering only points, takes the set of all complex-valued "wave functions" on this axis. Nevertheless, choosing the p-axis is an equally valid polarisation, yielding a different representation of the set of possible physical states of the particle which is related to the first representation by the Fourier transformation


Physically realisable states are L2, and so by the Plancherel theorem, their Fourier transforms are also L2. (Note that since q is in units of distance and p is in units of momentum, the presence of Planck's constant in the exponent makes the exponent dimensionless, as it should be.)

Therefore, the Fourier transform can be used to pass from one way of representing the state of the particle, by a wave function of position, to another way of representing the state of the particle: by a wave function of momentum. Infinitely many different polarisations are possible, and all are equally valid. Being able to transform states from one representation to another is sometimes convenient.

The other use of the Fourier transform in both quantum mechanics and quantum field theory is to solve the applicable wave equation. In non-relativistic quantum mechanics, Schrödinger's equation for a time-varying wave function in one-dimension, not subject to external forces, is


This is the same as the heat equation except for the presence of the imaginary unit i. Fourier methods can be used to solve this equation.

In the presence of a potential, given by the potential energy function V(x), the equation becomes


The "elementary solutions", as we referred to them above, are the so-called "stationary states" of the particle, and Fourier's algorithm, as described above, can still be used to solve the boundary value problem of the future evolution of ψ given its values for t = 0. Neither of these approaches is of much practical use in quantum mechanics. Boundary value problems and the time-evolution of the wave function is not of much practical interest: it is the stationary states that are most important.

In relativistic quantum mechanics, Schrödinger's equation becomes a wave equation as was usual in classical physics, except that complex-valued waves are considered. A simple example, in the absence of interactions with other particles or fields, is the free one-dimensional Klein–Gordon–Schrödinger–Fock equation, this time in dimensionless units,


This is, from the mathematical point of view, the same as the wave equation of classical physics solved above (but with a complex-valued wave, which makes no difference in the methods). This is of great use in quantum field theory: each separate Fourier component of a wave can be treated as a separate harmonic oscillator and then quantized, a procedure known as "second quantization". Fourier methods have been adapted to also deal with non-trivial interactions.

Signal processingEdit

The Fourier transform is used for the spectral analysis of time-series. The subject of statistical signal processing does not, however, usually apply the Fourier transformation to the signal itself. Even if a real signal is indeed transient, it has been found in practice advisable to model a signal by a function (or, alternatively, a stochastic process) which is stationary in the sense that its characteristic properties are constant over all time. The Fourier transform of such a function does not exist in the usual sense, and it has been found more useful for the analysis of signals to instead take the Fourier transform of its autocorrelation function.

The autocorrelation function R of a function f is defined by


This function is a function of the time-lag τ elapsing between the values of f to be correlated.

For most functions f that occur in practice, R is a bounded even function of the time-lag τ and for typical noisy signals it turns out to be uniformly continuous with a maximum at τ = 0.

The autocorrelation function, more properly called the autocovariance function unless it is normalized in some appropriate fashion, measures the strength of the correlation between the values of f separated by a time lag. This is a way of searching for the correlation of f with its own past. It is useful even for other statistical tasks besides the analysis of signals. For example, if f (t) represents the temperature at time t, one expects a strong correlation with the temperature at a time lag of 24 hours.

It possesses a Fourier transform,


This Fourier transform is called the power spectral density function of f. (Unless all periodic components are first filtered out from f, this integral will diverge, but it is easy to filter out such periodicities.)

The power spectrum, as indicated by this density function P, measures the amount of variance contributed to the data by the frequency ξ. In electrical signals, the variance is proportional to the average power (energy per unit time), and so the power spectrum describes how much the different frequencies contribute to the average power of the signal. This process is called the spectral analysis of time-series and is analogous to the usual analysis of variance of data that is not a time-series (ANOVA).

Knowledge of which frequencies are "important" in this sense is crucial for the proper design of filters and for the proper evaluation of measuring apparatuses. It can also be useful for the scientific analysis of the phenomena responsible for producing the data.

The power spectrum of a signal can also be approximately measured directly by measuring the average power that remains in a signal after all the frequencies outside a narrow band have been filtered out.

Spectral analysis is carried out for visual signals as well. The power spectrum ignores all phase relations, which is good enough for many purposes, but for video signals other types of spectral analysis must also be employed, still using the Fourier transform as a tool.

Other notationsEdit

Other common notations for  (ξ) include:


Denoting the Fourier transform by a capital letter corresponding to the letter of function being transformed (such as f (x) and F(ξ)) is especially common in the sciences and engineering. In electronics, omega (ω) is often used instead of ξ due to its interpretation as angular frequency, sometimes it is written as F( ), where j is the imaginary unit, to indicate its relationship with the Laplace transform, and sometimes it is written informally as F(2πf ) in order to use ordinary frequency.

The interpretation of the complex function  (ξ) may be aided by expressing it in polar coordinate form


in terms of the two real functions A(ξ) and φ(ξ) where:


is the amplitude and


is the phase (see arg function).

Then the inverse transform can be written:


which is a recombination of all the frequency components of f (x). Each component is a complex sinusoid of the form eixξ whose amplitude is A(ξ) and whose initial phase angle (at x = 0) is φ(ξ).

The Fourier transform may be thought of as a mapping on function spaces. This mapping is here denoted F and F( f ) is used to denote the Fourier transform of the function f. This mapping is linear, which means that F can also be seen as a linear transformation on the function space and implies that the standard notation in linear algebra of applying a linear transformation to a vector (here the function f) can be used to write F f instead of F( f ). Since the result of applying the Fourier transform is again a function, we can be interested in the value of this function evaluated at the value ξ for its variable, and this is denoted either as F f (ξ) or as ( F f )(ξ). Notice that in the former case, it is implicitly understood that F is applied first to f and then the resulting function is evaluated at ξ, not the other way around.

In mathematics and various applied sciences, it is often necessary to distinguish between a function f and the value of f when its variable equals x, denoted f (x). This means that a notation like F( f (x)) formally can be interpreted as the Fourier transform of the values of f at x. Despite this flaw, the previous notation appears frequently, often when a particular function or a function of a particular variable is to be transformed. For example,


is sometimes used to express that the Fourier transform of a rectangular function is a sinc function, or


is used to express the shift property of the Fourier transform.

Notice, that the last example is only correct under the assumption that the transformed function is a function of x, not of x0.

Other conventionsEdit

The Fourier transform can also be written in terms of angular frequency:


whose units are radians per second.

The substitution ξ = ω/ into the formulas above produces this convention:


Under this convention, the inverse transform becomes:


Unlike the convention followed in this article, when the Fourier transform is defined this way, it is no longer a unitary transformation on L2(n). There is also less symmetry between the formulas for the Fourier transform and its inverse.

Another convention is to split the factor of (2π)n evenly between the Fourier transform and its inverse, which leads to definitions:


Under this convention, the Fourier transform is again a unitary transformation on L2(n). It also restores the symmetry between the Fourier transform and its inverse.

Variations of all three conventions can be created by conjugating the complex-exponential kernel of both the forward and the reverse transform. The signs must be opposites. Other than that, the choice is (again) a matter of convention.

Summary of popular forms of the Fourier transform
ordinary frequency ξ (Hz) unitary  
angular frequency ω (rad/s) unitary  

As discussed above, the characteristic function of a random variable is the same as the Fourier–Stieltjes transform of its distribution measure, but in this context it is typical to take a different convention for the constants. Typically characteristic function is defined


As in the case of the "non-unitary angular frequency" convention above, there is no factor of 2π appearing in either of the integral, or in the exponential. Unlike any of the conventions appearing above, this convention takes the opposite sign in the exponential.

Computation methodsEdit

The appropriate computation method largely depends how the original mathematical function is represented and the desired form of the output function.

Since the fundamental definition of a Fourier transform is an integral, functions that can be expressed as closed-form expressions are commonly computed by working the integral analytically to yield a closed-form expression in the Fourier transform conjugate variable as the result. This is the method used to generate tables of Fourier transforms,[43] including those found in the table below (Fourier transform#Tables of important Fourier transforms).

Many computer algebra systems such as Matlab and Mathematica that are capable of symbolic integration are capable of computing Fourier transforms analytically. For example, to compute the Fourier transform of f (t) = cos(6πt) e−πt2 one might enter the command integrate cos(6*pi*t) exp(−pi*t^2) exp(-i*2*pi*f*t) from -inf to inf into Wolfram Alpha.

Numerical integration of closed-form functionsEdit

If the input function is in closed-form and the desired output function is a series of ordered pairs (for example a table of values from which a graph can be generated) over a specified domain, then the Fourier transform can be generated by numerical integration at each value of the Fourier conjugate variable (frequency, for example) for which a value of the output variable is desired.[44] Note that this method requires computing a separate numerical integration for each value of frequency for which a value of the Fourier transform is desired.[45][46] The numerical integration approach works on a much broader class of functions than the analytic approach, because it yields results for functions that do not have closed form Fourier transform integrals.

Numerical integration of a series of ordered pairsEdit

If the input function is a series of ordered pairs (for example, a time series from measuring an output variable repeatedly over a time interval) then the output function must also be a series of ordered pairs (for example, a complex number vs. frequency over a specified domain of frequencies), unless certain assumptions and approximations are made allowing the output function to be approximated by a closed-form expression. In the general case where the available input series of ordered pairs are assumed be samples representing a continuous function over an interval (amplitude vs. time, for example), the series of ordered pairs representing the desired output function can be obtained by numerical integration of the input data over the available interval at each value of the Fourier conjugate variable (frequency, for example) for which the value of the Fourier transform is desired.[47]

Explicit numerical integration over the ordered pairs can yield the Fourier transform output value for any desired value of the conjugate Fourier transform variable (frequency, for example), so that a spectrum can be produced at any desired step size and over any desired variable range for accurate determination of amplitudes, frequencies, and phases corresponding to isolated peaks. Unlike limitations in DFT and FFT methods, explicit numerical integration can have any desired step size and compute the Fourier transform over any desired range of the congugate Fourier transform variable (for example, frequency).

Discrete Fourier Transforms and Fast Fourier TransformsEdit

If the ordered pairs representing the original input function are equally spaced in their input variable (for example, equal time steps), then the Fourier transform is known as a discrete Fourier transform (DFT), which can be computed either by explicit numerical integration, by explicit evaluation of the DFT definition, or by fast Fourier transform (FFT) methods. In contrast to explicit integration of input data, use of the DFT and FFT methods produces Fourier transforms described by ordered pairs of step size equal to the reciprocal of the original sampling interval. For example, if the input data is sampled for 10 seconds, the output of DFT and FFT methods will have a 0.1 Hz frequency spacing.

Tables of important Fourier transformsEdit

The following tables record some closed-form Fourier transforms. For functions f (x), g(x) and h(x) denote their Fourier transforms by , ĝ, and ĥ respectively. Only the three most common conventions are included. It may be useful to notice that entry 105 gives a relationship between the Fourier transform of a function and the original function, which can be seen as relating the Fourier transform and its inverse.

Functional relationshipsEdit

The Fourier transforms in this table may be found in Erdélyi (1954) or Kammler (2000, appendix).

Function Fourier transform
unitary, ordinary frequency
Fourier transform
unitary, angular frequency
Fourier transform
non-unitary, angular frequency
101         Linearity
102         Shift in time domain
103         Shift in frequency domain, dual of 102
104         Scaling in the time domain. If |a| is large, then f (ax) is concentrated around 0 and
spreads out and flattens.
105         Duality. Here needs to be calculated using the same method as Fourier transform column. Results from swapping "dummy" variables of x and ξ or ω or ν.
107         This is the dual of 106
108         The notation fg denotes the convolution of f and g — this rule is the convolution theorem
109         This is the dual of 108
110 For f (x) purely real       Hermitian symmetry. z indicates the complex conjugate.
111 For f (x) purely real and even  (ξ),  (ω) and  (ν) are purely real even functions.
112 For f (x) purely real and odd  (ξ),  (ω) and  (ν) are purely imaginary odd functions.
113         Complex conjugation, generalization of 110
114         This follows from rules 101 and 103 using Euler's formula:
115         This follows from 101 and 103 using Euler's formula:

Square-integrable functionsEdit

The Fourier transforms in this table may be found in Campbell & Foster (1948), Erdélyi (1954), or Kammler (2000, appendix).

Function Fourier transform
unitary, ordinary frequency
Fourier transform
unitary, angular frequency
Fourier transform
non-unitary, angular frequency
201         The rectangular pulse and the normalized sinc function, here defined as sinc(x) = sin(πx)/πx
202         Dual of rule 201. The rectangular function is an ideal low-pass filter, and the sinc function is the non-causal impulse response of such a filter. The sinc function is defined here as sinc(x) = sin(πx)/πx
203         The function tri(x) is the triangular function
204         Dual of rule 203.
205         The function u(x) is the Heaviside unit step function and a > 0.
206         This shows that, for the unitary Fourier transforms, the Gaussian function eαx2 is its own Fourier transform for some choice of α. For this to be integrable we must have Re(α) > 0.
207         For Re(a) > 0. That is, the Fourier transform of a two-sided decaying exponential function is a Lorentzian function.
208         Hyperbolic secant is its own Fourier transform
209         Hn is the nth-order Hermite polynomial. If a = 1 then the Gauss–Hermite functions are eigenfunctions of the Fourier transform operator. For a derivation, see Hermite polynomial. The formula reduces to 206 for n = 0.


The Fourier transforms in this table may be found in Erdélyi (1954) or Kammler (2000, appendix).

Function Fourier transform
unitary, ordinary frequency
Fourier transform
unitary, angular frequency
Fourier transform
non-unitary, angular frequency
301         The distribution δ(ξ) denotes the Dirac delta function.
302         Dual of rule 301.
303         This follows from 103 and 301.
304         This follows from rules 101 and 303 using Euler's formula:
305         This follows from 101 and 303 using
308         Here, n is a natural number and δ(n)(ξ) is the nth distribution derivative of the Dirac delta function. This rule follows from rules 107 and 301. Combining this rule with 101, we can transform all polynomials.
        Dual of rule 308. δ(n)(ξ) is the nth distribution derivative of the Dirac delta function. This rule follows from 106 and 302.
309         Here sgn(ξ) is the sign function. Note that 1/x is not a distribution. It is necessary to use the Cauchy principal value when testing against Schwartz functions. This rule is useful in studying the Hilbert transform.
310         1/xn is the homogeneous distribution defined by the distributional derivative
311         This formula is valid for 0 > α > −1. For α > 0 some singular terms arise at the origin that can be found by differentiating 318. If Re α > −1, then |x|α is a locally integrable function, and so a tempered distribution. The function α ↦ |x|α is a holomorphic function from the right half-plane to the space of tempered distributions. It admits a unique meromorphic extension to a tempered distribution, also denoted |x|α for α ≠ −2, −4,... (See homogeneous distribution.)
        Special case of 311.
312         The dual of rule 309. This time the Fourier transforms need to be considered as a Cauchy principal value.
313         The function u(x) is the Heaviside unit step function; this follows from rules 101, 301, and 312.
314         This function is known as the Dirac comb function. This result can be derived from 302 and 102, together with the fact that
as distributions.
315         The function J0(x) is the zeroth order Bessel function of first kind.
316         This is a generalization of 315. The function Jn(x) is the nth order Bessel function of first kind. The function Tn(x) is the Chebyshev polynomial of the first kind.
317         γ is the Euler–Mascheroni constant.
318         This formula is valid for 1 > α > 0. Use differentiation to derive formula for higher exponents. u is the Heaviside function.

Two-dimensional functionsEdit

Function Fourier transform
unitary, ordinary frequency
Fourier transform
unitary, angular frequency
Fourier transform
non-unitary, angular frequency
400         The variables ξx, ξy, ωx, ωy, νx, νy are real numbers. The integrals are taken over the entire plane.
401         Both functions are Gaussians, which may not have unit volume.
402         The function is defined by circ(r) = 1 for 0 ≤ r ≤ 1, and is 0 otherwise. The result is the amplitude distribution of the Airy disk, and is expressed using J1 (the order-1 Bessel function of the first kind).[48]

Formulas for general n-dimensional functionsEdit

Function Fourier transform
unitary, ordinary frequency
Fourier transform
unitary, angular frequency
Fourier transform
non-unitary, angular frequency
501         The function χ[0, 1] is the indicator function of the interval [0, 1]. The function Γ(x) is the gamma function. The function Jn/2 + δ is a Bessel function of the first kind, with order n/2 + δ. Taking n = 2 and δ = 0 produces 402.[49]
502         See Riesz potential where the constant is given by
The formula also holds for all α ≠ −n, −n − 1, … by analytic continuation, but then the function and its Fourier transforms need to be understood as suitably regularized tempered distributions. See homogeneous distribution.
503         This is the formula for a multivariate normal distribution normalized to 1 with a mean of 0. Bold variables are vectors or matrices. Following the notation of the aforementioned page, Σ = σ σT and Σ−1 = σ−T σ−1
504         Here[50]

See alsoEdit


  1. ^ Up to an imaginary constant factor whose magnitude depends on what Fourier transform convention is used.
  2. ^ The Laplace transform is a generalization of the Fourier transform that offers greater flexibility for many such applications.
  3. ^ Depending on the application a Lebesgue integral, distributional, or other approach may be most appropriate.
  4. ^ Vretblad (2000) provides solid justification for these formal procedures without going too deeply into functional analysis or the theory of distributions.
  5. ^ In relativistic quantum mechanics one encounters vector-valued Fourier transforms of multi-component wave functions. In quantum field theory, operator-valued Fourier transforms of operator-valued functions of spacetime are in frequent use, see for example Greiner & Reinhardt (1996).



  • Boashash, B., ed. (2003), Time-Frequency Signal Analysis and Processing: A Comprehensive Reference, Oxford: Elsevier Science, ISBN 0-08-044335-4 .
  • Bracewell, R. N. (2000), The Fourier Transform and Its Applications (3rd ed.), Boston: McGraw-Hill, ISBN 0-07-116043-4 .
  • Campbell, George; Foster, Ronald (1948), Fourier Integrals for Practical Applications, New York: D. Van Nostrand Company, Inc. .
  • Chatfield, Chris (2004), The Analysis of Time Series: An Introduction, Texts in Statistical Science (6th ed.), London: Chapman & Hall/CRC .
  • Clozel, Laurent; Delorme, Patrice (1985), "Sur le théorème de Paley-Wiener invariant pour les groupes de Lie réductifs réels", C. R. Acad. Sci. Paris, série I, 300: 331–333 .
  • de Groot, Sybren R.; Mazur, Peter (1984), Non-Equilibrium Thermodynamics (2nd ed.), New York: Dover .
  • Erdélyi, Arthur, ed. (1954), Tables of Integral Transforms, Vol. 1, McGraw-Hill .
  • Grafakos, Loukas (2004), Classical and Modern Fourier Analysis, Prentice-Hall, ISBN 0-13-035399-X .
  • Hewitt, Edwin; Ross, Kenneth A. (1970), Abstract harmonic analysis, Die Grundlehren der mathematischen Wissenschaften, Band 152, Vol. II: Structure and analysis for compact groups. Analysis on locally compact Abelian groups, Springer, MR 0262773 .
  • Jordan, Camille (1883), Cours d'Analyse de l'École Polytechnique, Vol. II, Calcul Intégral: Intégrales définies et indéfinies (2nd ed.), Paris .
  • Kammler, David (2000), A First Course in Fourier Analysis, Prentice Hall, ISBN 0-13-578782-3 .
  • Kirillov, Alexandre; Gvishiani, Alexei D. (1982) [1979], Theorems and Problems in Functional Analysis, Springer  (translated from Russian).
  • Press, William H.; Flannery, Brian P.; Teukolsky, Saul A.; Vetterling, William T. (1992), Numerical Recipes in C: The Art of Scientific Computing, Second Edition (2nd ed.), Cambridge University Press .
  • Rudin, Walter (1987), Real and Complex Analysis (3rd ed.), Singapore: McGraw Hill, ISBN 0-07-100276-6 .
  • Simonen, P.; Olkkonen, H. (1985), "Fast method for computing the Fourier integral transform via Simpson's numerical integration", Journal of biomedical engineering, 7 (4): 337–340, doi:10.1016/0141-5425(85)90067-6 .
  • Wiener, Norbert (1949), Extrapolation, Interpolation, and Smoothing of Stationary Time Series With Engineering Applications, Cambridge, Mass.: Technology Press and John Wiley & Sons and Chapman & Hall .
  • Wilson, R. G. (1995), Fourier Series and Optical Transform Techniques in Contemporary Optics, New York: Wiley, ISBN 0-471-30357-7 .

External linksEdit