Fourier inversion theorem

Short description: Mathematical theorem about functions

In mathematics, the Fourier inversion theorem says that for many types of functions it is possible to recover a function from its Fourier transform. Intuitively it may be viewed as the statement that if we know all frequency and phase information about a wave then we may reconstruct the original wave precisely.

The theorem says that if we have a function f:ℝ->ℂ satisfying certain conditions, and we use the convention for the Fourier transform that

(ℱf)(ξ):=∫ℝe−2πiy⋅ξf(y)dy,

then

f(x)=∫ℝe2πix⋅ξ(ℱf)(ξ)dξ.

In other words, the theorem says that

f(x)=∬ℝ2e2πi(x−y)⋅ξf(y)dydξ.

This last equation is called the Fourier integral theorem.

Another way to state the theorem is that if R is the flip operator i.e. (Rf)(x):=f(−x), then

ℱ−1=ℱR=Rℱ.

The theorem holds if both f and its Fourier transform are absolutely integrable (in the Lebesgue sense) and f is continuous at the point x. However, even under more general conditions versions of the Fourier inversion theorem hold. In these cases the integrals above may not converge in an ordinary sense.

## Contents

* 1 Statement
* 1.1 Inverse Fourier transform as an integral
* 1.2 Fourier integral theorem
* 1.3 Inverse transform in terms of flip operator
* 1.4 Two-sided inverse
* 2 Conditions on the function
* 2.1 Schwartz functions
* 2.2 Integrable functions with integrable Fourier transform
* 2.3 Integrable functions in one dimension
* 2.4 Square integrable functions
* 2.5 Tempered distributions
* 3 Relation to Fourier series
* 4 Applications
* 5 Properties of inverse transform
* 6 Proof
* 7 Notes
* 8 References

## Statement

In this section we assume that f is an integrable continuous function. Use the convention for the Fourier transform that

(ℱf)(ξ):=∫ℝne−2πiy⋅ξf(y)dy.

Furthermore, we assume that the Fourier transform is also integrable.

### Inverse Fourier transform as an integral

The most common statement of the Fourier inversion theorem is to state the inverse transform as an integral. For any integrable function g and all x∈ℝn set

ℱ−1g(x):=∫ℝne2πix⋅ξg(ξ)dξ.

Then for all x∈ℝn we have

ℱ−1(ℱf)(x)=f(x).

### Fourier integral theorem

The theorem can be restated as

f(x)=∫ℝn∫ℝne2πi(x−y)⋅ξf(y)dydξ.

By taking the real part[1] of each side of the above we obtain

f(x)=∫ℝn∫ℝncos⁡(2π(x−y)⋅ξ)f(y)dydξ.

### Inverse transform in terms of flip operator

For any function g define the flip operator[note 1] R by

Rg(x):=g(−x).

Then we may instead define

ℱ−1f:=Rℱf=ℱRf.

It is immediate from the definition of the Fourier transform and the flip operator that both Rℱf and ℱRf match the integral definition of ℱ−1f, and in particular are equal to each other and satisfy ℱ−1(ℱf)(x)=f(x).

Since Rf=Rℱ−1ℱf=RRℱℱf we have R=ℱ2 and

ℱ−1=ℱ3.

### Two-sided inverse

The form of the Fourier inversion theorem stated above, as is common, is that

ℱ−1(ℱf)(x)=f(x).

In other words, ℱ−1 is a left inverse for the Fourier transform. However it is also a right inverse for the Fourier transform i.e.

ℱ(ℱ−1f)(ξ)=f(ξ).

Since ℱ−1 is so similar to ℱ, this follows very easily from the Fourier inversion theorem (changing variables ζ:=−ζ):

f=ℱ−1(ℱf)(x)=∫ℝn∫ℝne2πix⋅ξe−2πiy⋅ξf(y)dydξ=∫ℝn∫ℝne−2πix⋅ζe2πiy⋅ζf(y)dydζ=ℱ(ℱ−1f)(x).

Alternatively, this can be seen from the relation between ℱ−1f and the flip operator and the associativity of function composition, since

f=ℱ−1(ℱf)=ℱRℱf=ℱ(ℱ−1f).

## Conditions on the function

When used in physics and engineering, the Fourier inversion theorem is often used under the assumption that everything "behaves nicely". In mathematics such heuristic arguments are not permitted, and the Fourier inversion theorem includes an explicit specification of what class of functions is being allowed. However, there is no "best" class of functions to consider so several variants of the Fourier inversion theorem exist, albeit with compatible conclusions.

### Schwartz functions

The Fourier inversion theorem holds for all Schwartz functions (roughly speaking, smooth functions that decay quickly and whose derivatives all decay quickly). This condition has the benefit that it is an elementary direct statement about the function (as opposed to imposing a condition on its Fourier transform), and the integral that defines the Fourier transform and its inverse are absolutely integrable. This version of the theorem is used in the proof of the Fourier inversion theorem for tempered distributions (see below).

### Integrable functions with integrable Fourier transform

The Fourier inversion theorem holds for all continuous functions that are absolutely integrable (i.e. L1(ℝn)) with absolutely integrable Fourier transform. This includes all Schwartz functions, so is a strictly stronger form of the theorem than the previous one mentioned. This condition is the one used above in the statement section.

A slight variant is to drop the condition that the function f be continuous but still require that it and its Fourier transform be absolutely integrable. Then f=g almost everywhere where g is a continuous function, and ℱ−1(ℱf)(x)=g(x) for every x∈ℝn.

### Integrable functions in one dimension

Piecewise smooth; one dimension

If the function is absolutely integrable in one dimension (i.e. f∈L1(ℝ)) and is piecewise smooth then a version of the Fourier inversion theorem holds. In this case we define

ℱ−1g(x):=limR->∞∫−RRe2πixξg(ξ)dξ.

Then for all x∈ℝ

ℱ−1(ℱf)(x)=12(f(x−)+f(x+)),

i.e. ℱ−1(ℱf)(x) equals the average of the left and right limits of f at x. At points where f is continuous this simply equals f(x).

A higher-dimensional analogue of this form of the theorem also holds, but according to Folland (1992) is "rather delicate and not terribly useful".

Piecewise continuous; one dimension

If the function is absolutely integrable in one dimension (i.e. f∈L1(ℝ)) but merely piecewise continuous then a version of the Fourier inversion theorem still holds. In this case the integral in the inverse Fourier transform is defined with the aid of a smooth rather than a sharp cut off function; specifically we define

ℱ−1g(x):=limR->∞∫ℝφ(ξ/R)e2πixξg(ξ)dξ,φ(ξ):=e−ξ2.

The conclusion of the theorem is then the same as for the piecewise smooth case discussed above.

Continuous; any number of dimensions

If f is continuous and absolutely integrable on ℝn then the Fourier inversion theorem still holds so long as we again define the inverse transform with a smooth cut off function i.e.

ℱ−1g(x):=limR->∞∫ℝnφ(ξ/R)e2πix⋅ξg(ξ)dξ,φ(ξ):=e−|ξ|2.

The conclusion is now simply that for all x∈ℝn

ℱ−1(ℱf)(x)=f(x).

No regularity condition; any number of dimensions

If we drop all assumptions about the (piecewise) continuity of f and assume merely that it is absolutely integrable, then a version of the theorem still holds. The inverse transform is again defined with the smooth cut off, but with the conclusion that

ℱ−1(ℱf)(x)=f(x)

for almost every x∈ℝn. [2]

### Square integrable functions

In this case the Fourier transform cannot be defined directly as an integral since it may not be absolutely convergent, so it is instead defined by a density argument (see the Fourier transform article). For example, putting

gk(ξ):=∫{y∈ℝn:|y|≤k}e−2πiy⋅ξf(y)dy,k∈ℕ,

we can set ℱf:=limk->∞gk where the limit is taken in the L2-norm. The inverse transform may be defined by density in the same way or by defining it in terms of the Fourier transform and the flip operator. We then have

f(x)=ℱ(ℱ−1f)(x)=ℱ−1(ℱf)(x)

in the mean squared norm. In one dimension (and one dimension only), it can also be shown that it converges for almost every x∈ℝ\- this is Carleson's theorem, but is much harder to prove than convergence in the mean squared norm.

### Tempered distributions

The Fourier transform may be defined on the space of tempered distributions 𝒮′(ℝn) by duality of the Fourier transform on the space of Schwartz functions. Specifically for f∈𝒮′(ℝn) and for all test functions φ∈𝒮(ℝn) we set

⟨ℱf,φ⟩:=⟨f,ℱφ⟩,

where ℱφ is defined using the integral formula. If f∈L1(ℝn)∩L2(ℝn) then this agrees with the usual definition. We may define the inverse transform ℱ−1:𝒮′(ℝn)->𝒮′(ℝn), either by duality from the inverse transform on Schwartz functions in the same way, or by defining it in terms of the flip operator (where the flip operator is defined by duality). We then have

ℱℱ−1=ℱ−1ℱ=Id𝒮′(ℝn).

## Relation to Fourier series

When considering the Fourier series of a function it is conventional to rescale it so that it acts on [0,2π] (or is 2π-periodic). In this section we instead use the somewhat unusual convention taking f to act on [0,1], since that matches the convention of the Fourier transform used here.

The Fourier inversion theorem is analogous to the convergence of Fourier series. In the Fourier transform case we have

f:ℝn->ℂ,f^:ℝn->ℂ,
f^(ξ):=∫ℝne−2πiy⋅ξf(y)dy,
f(x)=∫ℝne2πix⋅ξf^(ξ)dξ.

In the Fourier series case we instead have

f:[0,1]n->ℂ,f^:ℤn->ℂ,
f^(k):=∫[0,1]ne−2πiy⋅kf(y)dy,
f(x)=∑k∈ℤne2πix⋅kf^(k).

In particular, in one dimension k∈ℤ and the sum runs from −∞ to ∞.

## Applications

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.

In applications of the Fourier transform the Fourier inversion theorem often plays a critical role. In many situations the basic strategy is to apply the Fourier transform, perform some operation or simplification, and then apply the inverse Fourier transform.

More abstractly, the Fourier inversion theorem is a statement about the Fourier transform as an operator (see Fourier transform on function spaces). For example, the Fourier inversion theorem on f∈L2(ℝn) shows that the Fourier transform is a unitary operator on L2(ℝn).

## Properties of inverse transform

The inverse Fourier transform is extremely similar to the original Fourier transform: as discussed above, it differs only in the application of a flip operator. For this reason the properties of the Fourier transform hold for the inverse Fourier transform, such as the Convolution theorem and the Riemann–Lebesgue lemma.

Tables of Fourier transforms may easily be used for the inverse Fourier transform by composing the looked-up function with the flip operator. For example, looking up the Fourier transform of the rect function we see that f(x)=rect⁡(ax)⇒(ℱf)(ξ)=1|a|sinc⁡(ξa), so the corresponding fact for the inverse transform is g(ξ)=rect⁡(aξ)⇒(ℱ−1g)(x)=1|a|sinc⁡(−xa).

## Proof

The proof uses a few facts, given f(y) and ℱf(ξ)=∫ℝne−2πiy⋅ξf(y)dy.

1. If x∈ℝn and g(ξ)=e2πix⋅ξψ(ξ), then (ℱg)(y)=(ℱψ)(y−x).
2. If ε∈ℝ and ψ(ξ)=φ(εξ), then (ℱψ)(y)=(ℱφ)(y/ε)/|ε|n.
3. For f,g∈L1(ℝn), Fubini's theorem implies that ∫g(ξ)⋅(ℱf)(ξ)dξ=∫(ℱg)(y)⋅f(y)dy.
4. Define φ(ξ)=e−π|ξ|2; then (ℱφ)(y)=φ(y).
5. Define φε(y)=φ(y/ε)/εn. Then with ∗ denoting convolution, φε is an approximation to the identity: for any continuous f∈L1(ℝn) and point x∈ℝn, limε->0(φε∗f)(x)=f(x) (where the convergence is pointwise).

Since, by assumption, ℱf∈L1(ℝn), then it follows by the dominated convergence theorem that

∫ℝne2πix⋅ξ(ℱf)(ξ)dξ=limε->0∫ℝne−πε2|ξ|2+2πix⋅ξ(ℱf)(ξ)dξ.

Define gx(ξ)=e−πε2|ξ|2+2πix⋅ξ. Applying facts 1, 2 and 4, repeatedly for multiple integrals if necessary, we obtain

(ℱgx)(y)=1εne−πε2|x−y|2=φε(x−y).

Using fact 3 on f and gx, for each x∈ℝn, we have

∫ℝne−πε2|ξ|2+2πix⋅ξ(ℱf)(ξ)dξ=∫ℝn1εne−πε2|x−y|2f(y)dy=(φε*f)(x),

the convolution of f with an approximate identity. But since f∈L1(ℝn), fact 5 says that

limε->0(φε*f)(x)=f(x).

Putting together the above we have shown that

∫ℝne2πix⋅ξ(ℱf)(ξ)dξ=f(x).◻

## Notes

1. ↑ An operator is a transformation that maps functions to functions. The flip operator, the Fourier transform, the inverse Fourier transform and the identity transform are all examples of operators.

## References

* Folland, G. B. (1992). Fourier Analysis and its Applications. Belmont, CA, USA: Wadsworth. ISBN 0-534-17094-3.
* Folland, G. B. (1995). Introduction to Partial Differential Equations (2nd ed.). Princeton, USA: Princeton Univ. Press. ISBN 978-0-691-04361-6.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Fourier inversion theorem. Read more

|

1. ↑ w.l.o.g f is real valued, as any complex-valued function can be split into its real and imaginary parts and every operator appearing here is linear in f.
2. ↑ "DMat0101, Notes 3: The Fourier transform on L^1" (in en-US). I Woke Up In A Strange Place. 2011-03-10. https://yannisparissis.wordpress.com/2011/03/10/dmat0101-notes-3-the-fourier-transform-on-l1.

Retrieved from "https://handwiki.org/wiki/index.php?title=Fourier_inversion_theorem&oldid=177342"