Convergence of Fourier series explained

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.

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 . For such an f the Fourier coefficients

\widehat{f}(n)

are defined by the formula
\widehat{f}(n)=1
2\pi
2\pi
\int
0

f(t)e-intdt,n\in\Z.

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

f\sim\sumn\widehat{f}(n)eint.

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

SN(f;t)=

N
\sum
n=-N

\widehat{f}(n)eint.

The question of whether a Fourier series converges is: Do the functions

SN(f)

(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

\widehat{f}(n)

, inserting it into the formula for

SN

and doing some algebra gives that

SN(f)=f*DN

where ∗ stands for the periodic convolution and

DN

is the Dirichlet kernel, which has an explicit formula,
D
n(t)=
\sin((n+1)t)
2
\sin(t/2)

.

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

\int|Dn(t)|dt\toinfty

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

f

is an absolutely continuous function,

\left|\widehatf(n)\right|\le{K\over|n|}

for

K

a constant that only depends on

f

.

If

f

is a bounded variation function,

\left|\widehatf(n)\right|\le{{\rmvar}(f)\over2\pi|n|}.

If

f\inCp

\left|\widehat{f}(n)\right|\le{\|f(p)

\|
L1

\over|n|p}.

If

f\inCp

and

f(p)

has modulus of continuity

\omegap

,

\left|\widehat{f}(n)\right|\le{\omega(2\pi/n)\over|n|p}

and therefore, if

f

is in the α-Hölder class

\left|\widehat{f}(n)\right|\le{K\over|n|\alpha}.

Pointwise convergence

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

\pi
\int
0

\left|

f(x0+t)+f(x0-t)
2

-\ell\right|

dt
t

<infty,

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]

f(x)=

infty
\sum
n=1
1
n2

\sin\left[\left(

n3
2

+1\right)

x
2

\right].

Uniform convergence

Suppose

f\inCp

, and

f(p)

has modulus of continuity

\omega

; then the partial sums of the Fourier series converge to the function with speed[2]

|f(x)-(SNf)(x)|\leK{lnN\overNp}\omega(2\pi/N)

for a constant

K

that does not depend upon

f

, nor

p

, nor

N

.

This theorem, first proved by D Jackson, tells, for example, that if

f

satisfies the

\alpha

-Hölder condition, then

|f(x)-(SNf)(x)|\leK{lnN\overN\alpha}.

If

f

is

2\pi

periodic and absolutely continuous on

[0,2\pi]

, then the Fourier series of

f

converges uniformly, but not necessarily absolutely, to

f

.[3]

Absolute convergence

A function ƒ has an absolutely converging Fourier series if

\|f\|A:=\sum

infty
n=-infty

|\widehat{f}(n)|<infty.

Obviously, if this condition holds then

(SNf)(t)

converges absolutely for every t and on the other hand, it is enough that

(SNf)(t)

converges absolutely for even one t, then thiscondition 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 Fourierseries 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

f

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

\|f\|A\lec\alpha\|f\|{\rm\alpha},    \|f\|K:=\sum

+infty
n=-infty

|n||\widehat{f}(n)|2\lec\alpha

2
\|f\|
{\rmLip

\alpha}

for

\|f\|{\rm\alpha}

the constant in theHölder condition,

c\alpha

a constant only dependent on

\alpha

;

\|f\|K

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

O(1/n\alpha)

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.

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

\limN → infty

2\pi
\int
0

\left|f(x)-SN(f)(x) \right|2dx=0

i.e., 

SNf

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, 

SN(f)

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

(an)

infty
n=1
is Cesàro summable to some a if

\limn\toinfty

1
n
n
\sum
k=1

sk=a.

Where with

sk

we denote the th partial sum:

sk=a1++ak=

k
\sum
n=1

an

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

SN

with an appropriate notion. Hence we define
K
N(f;t)=1
N
N-1
\sum
n=0

Sn(f;t),N\ge1,

and ask: does

KN(f)

converge to f?

KN

is no longerassociated with Dirichlet's kernel, but with Fejér's kernel, namely

KN(f)=f*FN

where

FN

is Fejér's kernel,
F
N=1
N
N-1
\sum
n=0

Dn.

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

KN(f)

converges uniformly to ƒ).

KN(f)

converges to ƒ in the

L1

norm.

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

SN(f;t)

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.

\int|DN(t)|dt=

4
\pi2

logN+O(1).

See Big O notation for the notation O(1). The actual value

4/\pi2

is both difficult to calculate (see Zygmund 8.3) and of almost no use. The fact that for some constant c we have

\int|DN(t)|dt>clogN+O(1)

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

\limN\toinfty

SN(f;t)
logN

=0.

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,

\varlimsupN\toinfty

SN(f;t)
\omega(N)

=infty.

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

\varlimsupN\toinfty

SN(f;t)
\sqrt{logN
}=\infty.

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

SN(f;t1,t2)=\sum

|n1|\leqN,|n2|\leqN

\widehat{f}(n1,n

i(n1t1+n2t2)
2)e

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

\sum
2\leq
nN2
2

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

log2N

while for circular partial sums it is of the order of

\sqrt{N}

.

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.

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

Lp

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

\sqrt{logn}

divergence result discussed above. A simpler proof that gives only log log n can be found in Kahane's book.

Notes and References

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