Convergence of Fourier series

Last updated

In mathematics, the question of whether the Fourier series of a periodic function converges to a given function is researched by a field known as classical harmonic analysis, a branch of pure mathematics. Convergence is not necessarily given in the general case, and certain criteria must be met for convergence to occur.

Contents

Determination of convergence requires the comprehension of pointwise convergence, uniform convergence, absolute convergence, Lp spaces, summability methods and the Cesàro mean.

Preliminaries

Consider f an integrable function on the interval [0, 2π]. For such an f the Fourier coefficients are defined by the formula

It is common to describe the connection between f and its Fourier series by

The notation ~ here means that the sum represents the function in some sense. To investigate this more carefully, the partial sums must be defined:

The question of whether a Fourier series converges is: Do the functions (which are functions of the variable t we omitted in the notation) converge to f and in which sense? Are there conditions on f ensuring this or that type of convergence?

Before continuing, the Dirichlet kernel must be introduced. Taking the formula for , inserting it into the formula for and doing some algebra gives that

where ∗ stands for the periodic convolution and is the Dirichlet kernel, which has an explicit formula,

The Dirichlet kernel is not a positive kernel, and in fact, its norm diverges, namely

a fact that plays a crucial role in the discussion. The norm of Dn in L1(T) coincides with the norm of the convolution operator with Dn, acting on the space C(T) of periodic continuous functions, or with the norm of the linear functional f → (Snf)(0) on C(T). Hence, this family of linear functionals on C(T) is unbounded, when n  ∞.

Magnitude of Fourier coefficients

In applications, it is often useful to know the size of the Fourier coefficient.

If is an absolutely continuous function,

for a constant that only depends on .

If is a bounded variation function,

If

If and has modulus of continuity [ citation needed ],

and therefore, if is in the α-Hölder class

Pointwise convergence

Superposition of sinusoidal wave basis functions (bottom) to form a sawtooth wave (top); the basis functions have wavelengths l/k (k=integer) shorter than the wavelength l of the sawtooth itself (except for k=1). All basis functions have nodes at the nodes of the sawtooth, but all but the fundamental have additional nodes. The oscillation about the sawtooth is called the Gibbs phenomenon Sawtooth Fourier Analysis.JPG
Superposition of sinusoidal wave basis functions (bottom) to form a sawtooth wave (top); the basis functions have wavelengths λ/k (k=integer) shorter than the wavelength λ of the sawtooth itself (except for k=1). All basis functions have nodes at the nodes of the sawtooth, but all but the fundamental have additional nodes. The oscillation about the sawtooth is called the Gibbs phenomenon

There are many known sufficient conditions for the Fourier series of a function to converge at a given point x, for example if the function is differentiable at x. Even a jump discontinuity does not pose a problem: if the function has left and right derivatives at x, then the Fourier series converges to the average of the left and right limits (but see Gibbs phenomenon).

The Dirichlet–Dini Criterion states that: if ƒ is 2π–periodic, locally integrable and satisfies

then (Snf)(x0) converges to ℓ. This implies that for any function f of any Hölder class α > 0, the Fourier series converges everywhere to f(x).

It is also known that for any periodic function of bounded variation, the Fourier series converges everywhere. See also Dini test. In general, the most common criteria for pointwise convergence of a periodic function f are as follows:

There exist continuous functions whose Fourier series converges pointwise but not uniformly; see Antoni Zygmund, Trigonometric Series , vol. 1, Chapter 8, Theorem 1.13, p. 300.

However, the Fourier series of a continuous function need not converge pointwise. Perhaps the easiest proof uses the non-boundedness of Dirichlet's kernel in L1(T) and the Banach–Steinhaus uniform boundedness principle. As typical for existence arguments invoking the Baire category theorem, this proof is nonconstructive. It shows that the family of continuous functions whose Fourier series converges at a given x is of first Baire category, in the Banach space of continuous functions on the circle.

So in some sense pointwise convergence is atypical, and for most continuous functions the Fourier series does not converge at a given point. However Carleson's theorem shows that for a given continuous function the Fourier series converges almost everywhere.

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

Uniform convergence

Suppose , and has modulus of continuity ; then the partial sums of the Fourier series converge to the function with speed [2]

for a constant that does not depend upon , nor , nor .

This theorem, first proved by D Jackson, tells, for example, that if satisfies the -Hölder condition, then

If is periodic and absolutely continuous on , then the Fourier series of converges uniformly, but not necessarily absolutely, to . [3]

Absolute convergence

A function ƒ has an absolutely converging Fourier series if

Obviously, if this condition holds then converges absolutely for every t and on the other hand, it is enough that converges absolutely for even one t, then this condition holds. In other words, for absolute convergence there is no issue of where the sum converges absolutely — if it converges absolutely at one point then it does so everywhere.

The family of all functions with absolutely converging Fourier series is a Banach algebra (the operation of multiplication in the algebra is a simple multiplication of functions). It is called the Wiener algebra, after Norbert Wiener, who proved that if ƒ has absolutely converging Fourier series and is never zero, then 1/ƒ has absolutely converging Fourier series. The original proof of Wiener's theorem was difficult; a simplification using the theory of Banach algebras was given by Israel Gelfand. Finally, a short elementary proof was given by Donald J. Newman in 1975.

If belongs to a α-Hölder class for α > 1/2 then

for the constant in the Hölder condition, a constant only dependent on ; is the norm of the Krein algebra. Notice that the 1/2 here is essential—there are 1/2-Hölder functions, which do not belong to the Wiener algebra. Besides, this theorem cannot improve the best known bound on the size of the Fourier coefficient of a α-Hölder function—that is only and then not summable.

If ƒ is of bounded variation and belongs to a α-Hölder class for some α > 0, it belongs to the Wiener algebra. [ citation needed ]

Norm convergence

The simplest case is that of L2, which is a direct transcription of general Hilbert space results. According to the Riesz–Fischer theorem, if ƒ is square-integrable then

i.e.,  converges to ƒ in the norm of L2. It is easy to see that the converse is also true: if the limit above is zero, ƒ must be in L2. So this is an if and only if condition.

If 2 in the exponents above is replaced with some p, the question becomes much harder. It turns out that the convergence still holds if 1 < p < ∞. In other words, for ƒ in Lp,  converges to ƒ in the Lp norm. The original proof uses properties of holomorphic functions and Hardy spaces, and another proof, due to Salomon Bochner relies upon the Riesz–Thorin interpolation theorem. For p = 1 and infinity, the result is not true. The construction of an example of divergence in L1 was first done by Andrey Kolmogorov (see below). For infinity, the result is a corollary of the uniform boundedness principle.

If the partial summation operator SN is replaced by a suitable summability kernel (for example the Fejér sum obtained by convolution with the Fejér kernel), basic functional analytic techniques can be applied to show that norm convergence holds for 1  p < ∞.

Convergence almost everywhere

The problem whether the Fourier series of any continuous function converges almost everywhere was posed by Nikolai Lusin in the 1920s. It was resolved positively in 1966 by Lennart Carleson. His result, now known as Carleson's theorem, tells the Fourier expansion of any function in L2 converges almost everywhere. Later on, Richard Hunt generalized this to Lp for any p > 1.

Contrariwise, Andrey Kolmogorov, as a student at the age of 19, in his very first scientific work, constructed an example of a function in L1 whose Fourier series diverges almost everywhere (later improved to diverge everywhere).

Jean-Pierre Kahane and Yitzhak Katznelson proved that for any given set E of measure zero, there exists a continuous function ƒ such that the Fourier series of ƒ fails to converge on any point of E.

Summability

Does the sequence 0,1,0,1,0,1,... (the partial sums of Grandi's series) converge to ½? This does not seem like a very unreasonable generalization of the notion of convergence. Hence we say that any sequence is Cesàro summable to some a if

Where with we denote the kth partial sum:

It is not difficult to see that if a sequence converges to some a then it is also Cesàro summable to it.

To discuss summability of Fourier series, we must replace with an appropriate notion. Hence we define

and ask: does converge to f? is no longer associated with Dirichlet's kernel, but with Fejér's kernel, namely

where is Fejér's kernel,

The main difference is that Fejér's kernel is a positive kernel. Fejér's theorem states that the above sequence of partial sums converge uniformly to ƒ. This implies much better convergence properties

Results about summability can also imply results about regular convergence. For example, we learn that if ƒ is continuous at t, then the Fourier series of ƒ cannot converge to a value different from ƒ(t). It may either converge to ƒ(t) or diverge. This is because, if converges to some value x, it is also summable to it, so from the first summability property above, x = ƒ(t).

Order of growth

The order of growth of Dirichlet's kernel is logarithmic, i.e.

See Big O notation for the notation O(1). The actual value is both difficult to calculate (see Zygmund 8.3) and of almost no use. The fact that for some constant c we have

is quite clear when one examines the graph of Dirichlet's kernel. The integral over the n-th peak is bigger than c/n and therefore the estimate for the harmonic sum gives the logarithmic estimate.

This estimate entails quantitative versions of some of the previous results. For any continuous function f and any t one has

However, for any order of growth ω(n) smaller than log, this no longer holds and it is possible to find a continuous function f such that for some t,

The equivalent problem for divergence everywhere is open. Sergei Konyagin managed to construct an integrable function such that for every t one has

It is not known whether this example is best possible. The only bound from the other direction known is log n.

Multiple dimensions

Upon examining the equivalent problem in more than one dimension, it is necessary to specify the precise order of summation one uses. For example, in two dimensions, one may define

which are known as "square partial sums". Replacing the sum above with

lead to "circular partial sums". The difference between these two definitions is quite notable. For example, the norm of the corresponding Dirichlet kernel for square partial sums is of the order of while for circular partial sums it is of the order of .

Many of the results true for one dimension are wrong or unknown in multiple dimensions. In particular, the equivalent of Carleson's theorem is still open for circular partial sums. Almost everywhere convergence of "square partial sums" (as well as more general polygonal partial sums) in multiple dimensions was established around 1970 by Charles Fefferman.

Notes

  1. Gourdon, Xavier (2009). Les maths en tête. Analyse (2ème édition) (in French). Ellipses. p. 264. ISBN   978-2729837594.
  2. Jackson (1930), p21ff.
  3. Stromberg (1981), Exercise 6 (d) on p. 519 and Exercise 7 (c) on p. 520.

Related Research Articles

<span class="mw-page-title-main">Dirac delta function</span> Generalized function whose value is zero everywhere except at zero

In mathematical analysis, the Dirac delta function, also known as the unit impulse, is a generalized function on the real numbers, whose value is zero everywhere except at zero, and whose integral over the entire real line is equal to one. Since there is no function having this property, to model the delta "function" rigorously involves the use of limits or, as is common in mathematics, measure theory and the theory of distributions.

<span class="mw-page-title-main">Fourier transform</span> Mathematical transform that expresses a function of time as a function of frequency

In physics, engineering and mathematics, the Fourier transform (FT) is an integral transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function. The Fourier transform is analogous to decomposing the sound of a musical chord into the intensities of its constituent pitches.

<span class="mw-page-title-main">Fourier series</span> Decomposition of periodic functions into sums of simpler sinusoidal forms

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

In mathematics, the Gibbs phenomenon is the oscillatory behavior of the Fourier series of a piecewise continuously differentiable periodic function around a jump discontinuity. The th partial Fourier series of the function produces large peaks around the jump which overshoot and undershoot the function values. As more sinusoids are used, this approximation error approaches a limit of about 9% of the jump, though the infinite Fourier series sum does eventually converge almost everywhere except points of discontinuity.

In mathematics, smooth functions and analytic functions are two very important types of functions. One can easily prove that any analytic function of a real argument is smooth. The converse is not true, as demonstrated with the counterexample below.

In mathematics, the Poisson summation formula 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. Consequently, the periodic summation of a function is completely defined by discrete samples of the original function's Fourier transform. And conversely, the periodic summation of a function's Fourier transform is completely defined by discrete samples of the original function. The Poisson summation formula was discovered by Siméon Denis Poisson and is sometimes called Poisson resummation.

<span class="mw-page-title-main">Fejér kernel</span>

In mathematics, the Fejér kernel is a summability kernel used to express the effect of Cesàro summation on Fourier series. It is a non-negative kernel, giving rise to an approximate identity. It is named after the Hungarian mathematician Lipót Fejér (1880–1959).

In mathematics, the discrete-time Fourier transform (DTFT) is a form of Fourier analysis that is applicable to a sequence of discrete values.

<span class="mw-page-title-main">Dirac comb</span> Periodic distribution ("function") of "point-mass" Dirac delta sampling

In mathematics, a Dirac comb is a periodic function with the formula

In mathematics, the Dirichlet–Jordan test gives sufficient conditions for a real-valued, periodic function f to be equal to the sum of its Fourier series at a point of continuity. Moreover, the behavior of the Fourier series at points of discontinuity is determined as well. It is one of many conditions for the convergence of Fourier series.

In mathematics, the Riesz–Fischer theorem in real analysis is any of a number of closely related results concerning the properties of the space L2 of square integrable functions. The theorem was proven independently in 1907 by Frigyes Riesz and Ernst Sigismund Fischer.

In mathematics, and specifically in potential theory, the Poisson kernel is an integral kernel, used for solving the two-dimensional Laplace equation, given Dirichlet boundary conditions on the unit disk. The kernel can be understood as the derivative of the Green's function for the Laplace equation. It is named for Siméon Poisson.

<span class="mw-page-title-main">Empirical distribution function</span> Distribution function associated with the empirical measure of a sample

In statistics, an empirical distribution function is the distribution function associated with the empirical measure of a sample. This cumulative distribution function is a step function that jumps up by 1/n at each of the n data points. Its value at any specified value of the measured variable is the fraction of observations of the measured variable that are less than or equal to the specified value.

In mathematics, Fejér's theorem, named after Hungarian mathematician Lipót Fejér, states the following:

The Bochner–Riesz mean is a summability method often used in harmonic analysis when considering convergence of Fourier series and Fourier integrals. It was introduced by Salomon Bochner as a modification of the Riesz mean.

Carleson's theorem is a fundamental result in mathematical analysis establishing the pointwise (Lebesgue) almost everywhere convergence of Fourier series of L2 functions, proved by Lennart Carleson. The name is also often used to refer to the extension of the result by Richard Hunt to Lp functions for p(1, ∞] and the analogous results for pointwise almost everywhere convergence of Fourier integrals, which can be shown to be equivalent by transference methods.

<span class="mw-page-title-main">Dirichlet kernel</span>

In mathematical analysis, the Dirichlet kernel, named after the German mathematician Peter Gustav Lejeune Dirichlet, is the collection of periodic functions defined as

In mathematical analysis, the Szegő limit theorems describe the asymptotic behaviour of the determinants of large Toeplitz matrices. They were first proved by Gábor Szegő.

In mathematics, singular integral operators of convolution type are the singular integral operators that arise on Rn and Tn through convolution by distributions; equivalently they are the singular integral operators that commute with translations. The classical examples in harmonic analysis are the harmonic conjugation operator on the circle, the Hilbert transform on the circle and the real line, the Beurling transform in the complex plane and the Riesz transforms in Euclidean space. The continuity of these operators on L2 is evident because the Fourier transform converts them into multiplication operators. Continuity on Lp spaces was first established by Marcel Riesz. The classical techniques include the use of Poisson integrals, interpolation theory and the Hardy–Littlewood maximal function. For more general operators, fundamental new techniques, introduced by Alberto Calderón and Antoni Zygmund in 1952, were developed by a number of authors to give general criteria for continuity on Lp spaces. This article explains the theory for the classical operators and sketches the subsequent general theory.

In mathematics, a summability kernel is a family or sequence of periodic integrable functions satisfying a certain set of properties, listed below. Certain kernels, such as the Fejér kernel, are particularly useful in Fourier analysis. Summability kernels are related to approximation of the identity; definitions of an approximation of identity vary, but sometimes the definition of an approximation of the identity is taken to be the same as for a summability kernel.

References

Textbooks

The Katznelson book is the one using the most modern terminology and style of the three. The original publishing dates are: Zygmund in 1935, Bari in 1961 and Katznelson in 1968. Zygmund's book was greatly expanded in its second publishing in 1959, however.

Articles referred to in the text

This is the first proof that the Fourier series of a continuous function might diverge. In German
The first is a construction of an integrable function whose Fourier series diverges almost everywhere. The second is a strengthening to divergence everywhere. In French.
This is the original paper of Carleson, where he proves that the Fourier expansion of any continuous function converges almost everywhere; the paper of Hunt where he generalizes it to spaces; two attempts at simplifying the proof; and a book that gives a self contained exposition of it.
In this paper the authors show that for any set of zero measure there exists a continuous function on the circle whose Fourier series diverges on that set. In French.
The Konyagin paper proves the divergence result discussed above. A simpler proof that gives only log log n can be found in Kahane's book.