AN INTRODUCTION TO
HARMONIC ANALYSIS Yitzhak Katznelson
Third Corrected Edition
Preface
Harmonic analysis is the study of objects (functions, measures, etc.), defined on topological groups. The group structure enters into the study by allowing the consideration of the translates of the object under study, that is, by placing the object in a translation-invariant space. The study consists of two steps. First: finding the "elementary components" of the object, that is, objects of the same or similar class, which exhibit the simplest behavior under translation and which "belong" to the object under study (harmonic or spectral analysis); and second: finding a way in which the object can be construed as a combination of its elementary components (harmonic or spectral synthesis). The vagueness of this description is due not only to the limitation of the author but also to the vastness of its scope. In trying to make it clearer, one can proceed in various ways† ; we have chosen here to sacrifice generality for the sake of concreteness. We start with the circle group T and deal with classical Fourier series in the first five chapters, turning then to the real line in Chapter VI and coming to locally compact abelian groups, only for a brief sketch, in Chapter VII. The philosophy behind the choice of this approach is that it makes it easier for students to grasp the main ideas and gives them a large class of concrete examples which are essential for the proper understanding of the theory in the general context of topological groups. The presentation of Fourier series and integrals differs from that in [1], [7], [8], and [28] in being, I believe, more explicitly aimed at the general (locally compact abelian) case. The last chapter is an introduction to the theory of commutative Banach algebras. It is biased, studying Banach algebras mainly as a tool in harmonic analysis. This book is an expanded version of a set of lecture notes written † Hence
the indefinite article in the title of the book.
iii
IV
A N I NTRODUCTION TO H ARMONIC A NALYSIS
for a course which I taught at Stanford University during the spring and summer quarters of 1965. The course was intended for graduate students who had already had two quarters of the basic "real-variable" course. The book is on the same level: the reader is assumed to be familiar with the basic notions and facts of Lebesgue integration, the most elementary facts concerning Borel measures, some basic facts about holomorphic functions of one complex variable, and some elements of functional analysis, namely: the notions of a Banach space, continuous linear functionals, and the three key theorems—"the closed graph", the Hahn-Banach, and the "uniform boundedhess" theorems. All the prerequisites can be found in [23] and (except, for the complex variable) in [22]. Assuming these prerequisites, the book, or most of it, can be covered in a one-year course. A slower moving course or one shorter than a year may exclude some of the starred sections (or subsections). Aiming for a one-year course forced the omission not only of the more general setup (non-abelian groups are not even mentioned), but also of many concrete topics such as Fourier analysis on Rn , n > l, and finer problems of harmonic analysis in T or R (some of which can be found in [13]). Also, some important material was cut into exercises, and we urge the reader to do as many of them as he can. The bibliography consists mainly of books, and it is through the bibliographies included in these books that the reader is to become familiar with the many research papers written on harmonic analysis. Only some, more recent, papers are included in our bibliography. In general we credit authors only seldom—most often for identification purposes. With the growing mobility of mathematicians, and the happy amount of oral communication, many results develop within the mathematical folklore and when they find their way into print it is not always easy to determine who deserves the credit. When I was writing Chapter Ill of this book, I was very pleased to produce the simple elegant proof of Theorem 1.6 there. I could swear I did it myself until I remembered two days later that six months earlier, "over a cup of coffee," Lennart Carleson indicated to me this same proof. The book is divided into chapters, sections, and subsections. The chapter numbers are denoted by roman numerals and the sections and subsections, as well as the exercises, by arabic numerals. In cross references within the same chapter, the chapter number is omitted; thus Theorem llI.1.6, which is the theorem in subsection 6 of Section 1 of Chapter Ill, is referred to as Theorem 1.6 within Chapter IlI, and
P REFACE
V
Theorem Ill.1.6 elsewhere. The exercises are gathered at the end of the sections, and exercise V.1.1 is the first exercise at the end of Section 1, Chapter V. Again, the chapter number is omitted when an exercise is referred to within the same chapter. The ends of proofs are marked by a triangle (J). The book was written while I was visiting the University of Paris and Stanford University and it owes its existence to the moral and technical help 1 was so generously given in both places. During the writing I have benefitted from the advice and criticism of many friends; 1 would like to thank them all here. Particular thanks are due to L. Carleson, K. DeLeeuw, J.-P. Kahane, O.C. McGehee, and W. Rudin. I would also like to thank the publisher for the friendly cooperation in the production of this book. Y ITZHAK K ATZNELSON Jerusalem April 1968
The 2002 edition
The second edition was essentially identical with the first, except for the correction of a few misprints. The current edition has some more misprints and “miswritings” corrected, and some material added: an additional section in the first chapter, a few exercises, and an additional appendix. The added material does not reflect the progress in the field in the past thirty or forty years. Almost all of it could, and should have been included in the first edition of the book. Stanford March 2002
Contents
I
Fourier Series on T 1 Fourier coefficients . . . . . . . . . . . . . . . . 2 Summability in norm and homogeneous banach spaces on T . . . . . . . . . . . . . . . . . . . . 3 Pointwise convergence of σn (f ). . . . . . . . . . 4 The order of magnitude of Fourier coefficients . . . . . . . . . . . . . . . . 5 Fourier series of square summable functions . . 6 Absolutely convergent fourier series . . . . . . . 7 Fourier coefficients of linear functionals . . . . 8 Additional comments and applications . . . . .
. . . .
1 2
. . . . . . . .
8 17
. . . . .
. . . . .
22 27 31 35 48
II The Convergence of Fourier Series 1 Convergence in norm . . . . . . . . . . . . . . . . . . . 2 Convergence and divergence at a point . . . . . . . . . ?3 Sets of divergence . . . . . . . . . . . . . . . . . . . . .
55 55 60 64
III The Conjugate Function 1 The conjugate function . . . . . . . . . . . . . . . . . . 2 The maximal function of Hardy and Littlewood . . . . 3 The Hardy spaces . . . . . . . . . . . . . . . . . . . . .
71 71 84 93
. . . . .
. . . . .
IV Interpolation of Linear Operators 105 1 Interpolation of norms and of linear operators . . . . . 105 2 The theorem of Hausdorff-Young . . . . . . . . . . . . 111 V Lacunary Series and Quasi-analytic Classes 117 1 Lacunary series . . . . . . . . . . . . . . . . . . . . . . 117 ?2 Quasi-analytic classes . . . . . . . . . . . . . . . . . . . 125
vii
VIII
A N I NTRODUCTION TO H ARMONIC A NALYSIS
VI Fourier Transforms on the Line 1 Fourier transforms for L1 (R) . . . . . . . . . . 2 Fourier-Stieltjes transforms. . . . . . . . . . . 3 Fourier transforms in Lp (R); 1 < p ≤ 2. . . . . 4 Tempered distributions and pseudo-measures 5 Almost-Periodic functions on the line . . . . 6 The weak-star spectrum of bounded functions 7 The Paley–Wiener theorems . . . . . . . . . . ?8 The Fourier-Carleman transform . . . . . . . . 9 Kronecker’s theorem . . . . . . . . . . . . . . VII Fourier Analysis on Locally Compact Abelian Groups 1 Locally compact abelian groups . . . . . 2 The Haar measure . . . . . . . . . . . . 3 Characters and the dual group . . . . . . 4 Fourier transforms . . . . . . . . . . . . 5 Almost-periodic functions and the Bohr compactification . . . . . . . . . . . . . .
. . . .
. . . .
. . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
. . . . . . . . .
132 133 144 155 162 170 184 188 193 196
. . . .
. . . .
. . . .
. . . .
. . . .
201 201 202 203 205
. . . . . . . . 206
VIII Commutative Banach Algebras 1 Definition, examples, and elementary properties 2 Maximal ideals and multiplicative linear functionals . . . . . . . . . . . . . . . . . 3 The maximal-ideal space and the Gelfand representation . . . . . . . . . . . . . . 4 Homomorphisms of Banach algebras . . . . . . 5 Regular algebras . . . . . . . . . . . . . . . . . . 6 Wiener’s general Tauberian theorem . . . . . . . 7 Spectral synthesis in regular algebras . . . . . . 8 Functions that operate in regular Banach algebras . . . . . . . . . . . . . . . . . . 9 The algebra M (T) and functions that operate on Fourier-Stieltjes coefficients . . . . . . . . . . . 10 The use of tensor products . . . . . . . . . . . .
209 . . . . 209
. . . . 213 . . . . .
. . . . .
. . . . .
. . . . .
220 228 236 241 244
. . . . 250 . . . . 259 . . . . 264
A Vector-Valued Functions 1 Riemann integration . . . . . . . . . . . . . . . . . . . 2 Improper integrals . . . . . . . . . . . . . . . . . . . . . 3 More general integrals . . . . . . . . . . . . . . . . . .
272 272 273 273
CONTENTS
4
IX
Holomorphic vector-valued functions . . . . . . . . . . 273
B Probabilistic Methods 1 Random series . . . . . . . . . . . . . . . . . . . . . . . 2 Fourier coefficients of continuous functions . . . . . . P 3 Paley–Zygmund, when |an |2 = ∞ . . . . . . . . .
275 275 278 279
Bibliography
283
Index
285
Symbols
Kn , 12 P(r, t), 16 Vn (t), 15 Trimλ , 277 rn , 276 e ], 3 S[f f ∗ g, 5 f ∗ g , 179
HC(D), 210 A(T), 31 Bc , 14 C(T), 14 C n (T), 14 C m+η (T), 48 Dn , 13 En (ϕ), 48 M (T), 38 Pinv , 41 S[µ], 35 S[f ], 3 Sn (µ), 36 Sn (µ, t), 37 Sn (f ), 13 Lipα (T), 16 Ω(f, h), 25 H, 28 Hf , 40 δ , 38 δτ , 38 fˆ(n), 3 χX , 153 lipα (T), 16 L1 (T), 2 L∞ (T), 16 Lp (T), 15 µf , 40 ω(f, h), 25 σn (µ), 36 σn (µ, t), 37 σn (f ), 12 σn (f, t), 12
M
fτ , 4 D, 202 R, 1 T, 1 Z, 1 ˆ , 205 D
x
AN INTRODUCTION TO
HARMONIC ANALYSIS
Chapter I
Fourier Series on T
We denote by R the additive group of real numbers and by Z the subgroup consisting of the integers. The group T is defined as the quotient R/2πZ where, as indicated by the notation, 2πZ is the group of the integral multiples of 2π . There is an obvious identification between functions on T and 2π -periodic functions on R, which allows an implicit introduction of notions such as continuity, differentiability, etc. for functions on T. The Lebesgue measure on T, also, can be defined by means of the preceding identification: a function f is integrable on T if the corresponding 2π -periodic function, which we denote again by f , is integrable on [0, 2π) and we set Z
f (t)dt =
Z
2π
f (x)dx.
0
T
In other words, we consider the interval [0, 2π) as a model for T and the Lebesgue measure dt on T is the restriction of the Lebesgue measure of R to [0, 2π). The total mass of dt on T is equal to 2π and many of our formulas would be simpler if we normalized dt to have total mass 1, that is, if we replace it by dx/2π . Taking intervals on R as "models" for T is very convenient, however, and we choose to put dt = dx in order to avoid confusion. We "pay" by having to write the factor 1/2π in front of every integral. An all-important property of dt on T is its translation invariance, that is, for all t0 ∈ T and f defined on T, Z
f (t − t0 )dt =
Z
f (t)dt†
† Throughout this chapter, integrals with unspecified limits of integration are taken over T.
1
2 1
A N I NTRODUCTION TO H ARMONIC A NALYSIS FOURIER COEFFICIENTS
1.1 We denote by L1 (T) the space of all (equivalence† classes of) complex-valued, Lebesgue integrable functions on T. For f ∈ L1 (T) we put Z 1 kf kL1 = |f (t)|dt. 2π T
It is well known that L1 (T), with the norm so defined, is a Banach space.
D EFINITION : A trigonometric polynomial on T is an expression of the form (1.1)
P ∼
N X
an eint .
n=−N
The numbers n appearing in (1.1) are called the frequencies of P ; the largest integer n such that |an | + |a−n | 6= 0 is called the degree of P . The values assumed by the index n are integers so that each of the summands in (1.1) is a function on T. Since (1.1) is a finite sum, it represents a function, which we denote again by P , defined for each t ∈ T by (1.2)
P (t) =
N X
an eint .
n=−N
Let P be defined by (1.2). Knowing the function P we can compute the coefficients an by the formula Z 1 (1.3) P (t)e−int dt an = 2π which follows immediately from the fact that for integers j, ( Z 1 if j = 0, 1 ijt e dt = 2π 0 if j 6= 0. Thus we see that the function P determines the expression (1.1) and there seems to be no point in keeping the distinction between the expression (1.1) and the function P ; we shall consider trigonometric polynomials as both formal expressions and functions. †f
∼ g if f (t) = g(t) almost everywhere
I. F OURIER S ERIES ON T
3
1.2 D EFINITION: A trigonometric series on T is an expression of the form S∼
(1.4)
∞ X
an eint .
n=−∞
Again, n assumes integral values; however, the number of terms in (1.4) may be infinite and there is no assumption whatsoever about the size of the coefficients or about convergence. The conjugate‡ of the series (1.4) is, by definition, the series S˜ ∼
∞ X
−i sgn (n)an eint .
n=−∞
where sgn (n) = 0 if n = 0 and sgn (n) = n/|n| otherwise. 1.3 Let f ∈ L1 (T). Motivated by (1.3) we define the nth Fourier coefficient of f by Z 1 ˆ (1.5) f (n) = f (t)e−int dt. 2π
D EFINITION : The Fourier series S[f ] of a function f ∈ L1 (T) is the trigonometric series ∞ X S[f ] ∼ fˆ(n)eint . −∞
e ] and referred to The series conjugate to S[f ] will be denoted by S[f as the conjugate Fourier series of f . We shall say that a trigonometric series is a Fourier series if it is the Fourier series of some f ∈ L1 (T).
1.4
We turn to some elementary properties of Fourier coefficients.
Theorem. Let f, g ∈ L1 (T), then
(a) (f\ + g)(n) = fˆ(n) + gˆ(n). (b) For any complex number α d)(n) = αfˆ(n). (αf
(c) If f¯ is the complex conjugate§ of f then fˆ¯(n) = fˆ(−n). ‡ See
Chapter III for motivation of the terminology. by: f¯(t) = f (t)) for all t ∈ T.
§ Defined
4
A N I NTRODUCTION TO H ARMONIC A NALYSIS
(d) Denote fτ (t) = f (t − τ ), τ ∈ T; then fˆτ (n) = fˆ(n)e−inτ .
(e) |fˆ(n)| ≤
1 2π
R
|f (t)|dt = kf kL1
The proofs of (a) through (e) follow immediately from (1.5) and the details are left to the reader. 1.5 Corollary. Assume fj ∈ L1 (T), j = 0, 1, . . . , and kfj −f0 kL1 → 0. Then fˆ(n) → fˆ0 (n) uniformly. 1.6 Theorem. Let f ∈ L1 (T), assume fˆ(0) = 0, and define Z t f (τ )dτ. F (t) = 0
Then F is continuous, 2π -periodic, and 1 Fˆ (n) = fˆ(n), n 6= 0. in P ROOF : The continuity (and, in fact, the absolute continuity) of F is evident. The periodicity follows from Z t+2π f (τ )dτ = 2π fˆ(0) = 0, F (t + 2π) − F (t) =
(1.6)
t
and (1.6) is obtained through integration by parts: Z 2π Z −1 2π 0 1 −int 1 1 −int ˆ F (t)e dt = F (t) F (n) = e dt = fˆ. J 2π 0 2π 0 −in in 1.7 We now define the convolution operation in L1 (T). The reader will notice the use of the group structure of T and of the invariance of dt in the subsequent proofs. Theorem. Let f, g ∈ L1 (T). For almost all t, the function f (t − τ )g(τ ) is integrable (as a function of τ on T), and, if we write Z 1 (1.7) h(t) = f (t − τ )g(τ )dτ, 2π
then h ∈ L1 (T) and (1.8)
khkL1 ≤ kf kL1 kgkL1 .
Moreover (1.9)
ˆ h(n) = fˆ(n)ˆ g (n)
for all n.
I. F OURIER S ERIES ON T
5
P ROOF : The functions f (t − τ ) and g(τ ), considered as functions of the two variables (t, x), are clearly measurable, hence so is F (t, τ ) = f (t − τ )g(τ ).
For every τ , F (t, τ ) is just a constant multiple of fτ , hence integrable dt, and Z Z Z 1 1 1 |F (t, τ )|dt dτ = |g(τ )|·kf kL1 dτ = kf kL1 kgkL1 2π 2π 2π Hence, by the theorem of Fubini, f (t−τ )g(τ ) is integrable (over (0, 2π)) as a function of τ for almost all t, and ZZ Z Z Z 1 1 1 1 |F (t, τ )|dt dτ |h(t)|dt = F (t, τ )dτ dt ≤ 2π 2π 2π 4π 2 = kf kL1 kgkL1 which establishes (1.8). In order to prove (1.9) we write ZZ Z 1 1 −int ˆ f (t − τ )e−in(t−τ ) g(τ )e−inτ dt dτ h(n) = h(t)e dt = 2π 4π 2 Z Z 1 1 = f (t)e−int dt· g(τ )e−inτ dτ = fˆ(n)ˆ g (n). 2π 2π As above the change in the order of integration is justified by Fubini’s theorem. J 1.8 D EFINITION : The convolution f ∗ g of the (L1 (T) functions) f and g is the function h defined by (1.8). Using the star notation for the convolution, we can write (1.9):
(1.10)
fd ∗ g(n) = fˆ(n)ˆ g (n).
Theorem. The convolution operation in L1 (T) is commutative, associative, and distributive (with respect to the addition).
P ROOF : The change of variable ϑ = t − τ gives Z Z 1 1 f (t − τ )g(τ )dτ = g(t − ϑ)f (ϑ)dϑ, 2π 2π that is, f ∗ g = g ∗ f.
6
A N I NTRODUCTION TO H ARMONIC A NALYSIS
If f1 , f2 , f3 ∈ L1 (T), then ZZ 1 f1 (t − u − τ )f2 (u)f3 (τ )du dτ = [(f1 ∗ f2 )∗f3 ](t) = 4π 2 ZZ 1 f1 (t − ω)f2 (ω − τ )f3 (τ )dω dτ = [f1 ∗ (f2 ∗ f3 )](t). 4π 2 Finally, the distributive law f1 ∗ (f2 + f3 ) = f1 ∗ f2 + f1 ∗ f3
is evident from (1.7).
J
1.9 Lemma. Assume f ∈ L1 (T) and let ϕ(t) = eint for some integer n. Then (ϕ ∗ f )(t) = fˆ(n)eint .
P ROOF : 1 (ϕ ∗ f )(t) = 2π
Z
in(t−τ )
e
int
f (τ )dτ = e
PN
Corollary. If f ∈ L1 (T) and k(t) =
(1.11)
(k ∗ f )(t) =
1 2π
−N
N X
Z
1 2π
Z
f (τ )e−inτ dτ.
J
an eint , then
an fˆ(n)eint .
−N
EXERCISES FOR SECTION 1 1. Compute the Fourier coefficients of the following functions (defined by their values on [−π, π): (a)
(b)
f (t) =
∆(t) =
(√
2π
0
(
|t| < 1 2
1 2
≤ |t| ≤ π .
1 − |t|
|t| < 1
0
1 ≤ |t| ≤ π .
What relation do you see between f and ∆ ?
(c)
g(t) =
1
−1 < t ≤ 0
−1
0
0
1 ≤ |t|,
I. F OURIER S ERIES ON T
7
What relation do you see between g and ∆? (d)
− π < t < π.
h(t) = t
2. Remembering Euler’s formulas cos t =
1 it (e + e−it ), 2
sin t =
1 it (e − e−it ), 2i
or eit = cos t + i sin t ,
show that the Fourier series of a function f ∈ L1 (T) is formally equal to ∞
A0 X + (An cos nt + Bn sin nt) 2 n=1
where An = fˆ(n) + fˆ(−n) and Bn = i(fˆ(n) − fˆ(−n)). Equivalently: An =
1 π
Z
f (t) cos nt dt
Bn =
1 π
Z
f (t) sin nt dt.
Show also that if f is real valued, then An and Bn are all real; if f is even, that is, if f (t) = f (−t), then Bn = 0 for all n; and if f is odd, that is, if f (t) = −f (−t), then An = 0 for all n. P P 3. Show that if S ∼ aj sin jt. aj cos jt, then S˜ ∼ P N 4. Let f ∈ L1 (T) and let P (t) = −N aneint . Compute the Fourier coefficients of the function f P . 5. Let f ∈ L1 (T), let m be a positive integer, and write f(m) (t) = f (mt).
Show fd (m) (n) =
(
n ) fˆ( m
if m | n.
0
if m - n
6. The trigonometric polynomial cos nt = 12 (eint + e−int ) is of degree n and has 2n zeros on T. Show that no trigonometric polynomial of degree n > 0 can have more than Pn 2n zeros on T. Pn Hint: Identify −n aj eijt on T with z −n −n aj z n+j on |z| = 1. 7. Denote by C ∗ the multiplicative group of complex numbers different from zero. Denote by T ∗ the subgroup of all z ∈ C ∗ such that |z| = 1. Prove that if G is a subgroup of C ∗ which is compact (as a set of complex numbers), then G ⊆ T ∗ . 8. Let G be a compact proper subgroup of T. Prove that G is finite and determine its structure.
8
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Hint: Show that G is discrete. 9. Let G be an infinite subgroup of T. Prove that G is dense in T. Hint: The closure of G in T is a compact subgroup. 10. Let α be an irrational multiple of 2π . Prove that {nα (mod 2π)}n∈Z is dense in T. 11. Prove that a continuous homomorphism of T into C ∗ is necessarily given by an exponential function. Hint: Use exercise 7 to show that the mapping is into T ∗ ; determine the mapping on "small" rational multiples of 2π and use exercise 9. 12 If E is a subset of T and τ0 ∈ T, we define E + τ0 = {t + τ0 : t ∈ E}; we say that E is invariant under translation by τ if E = E + τ . Show that, given a set E , the set of τ ∈ T such that E is invariant under translation by τ is a subgroup of T. Hence prove that if E is a measurable set on T and E is invariant under translation by infinitely many τ ∈ T, then either E or its complement has measure zero. Hint: A set E of positive measure has points of density, that is, points τ such that (2ε)−1 |E ∩(τ −ε, τ +ε)| → 1 as ε → 0. (|E0 | denotes the Lebesgue measure of E0 .) 13. If E and F are subsets of T, we write E + F = {t + τ : t ∈ E, τ ∈ F }
and call E + F the algebraic sum of E and F . Similarly we define the sum of any finite number of sets. A set E is called a basis for Tif there exists an integer N such that E + E + · · · + E (N times) is T. Prove that every set E of positive measure on T is a basis. Hint: Prove that if E contains an interval it is a basis. Using points of density prove that if E has positive measure then E + E contains intervals. 14. Show that measurable proper subgroups of T have measure zero. 15. Show that measurable homomorphisms of T into C ∗ map it into T ∗ . 16. Let f be a measurable homomorphism of T into T ∗ . Show that for all values of n, except possibly one value, fˆ(n) = O. 2
SUMMABILITY IN NORM AND HOMOGENEOUS BANACH SPACES ON T
2.1 We have defined the Fourier series of a function f ∈ L1 (T) as a certain (formal) trigonometric series. The reader may wonder what is the point in the introduction of such formal series. After all, there P int ˆ is no more information in the (formal) expression ∞ than −∞ f (n)e ∞ there is in the simpler one {fˆ(n)}n=−∞ or the even simpler fˆ with the understanding that the function fˆ is defined on the integers. As we Pˆ shall see, both expressions, f (n)eint and f , have their advantages;
I. F OURIER S ERIES ON T
9
the main advantages of the series notation being that it indicates the way in which f can be reconstructed from fˆ. Much of this chapter and all of chapter II will be devoted to clarifying the sense in which Pˆ f (n)eint represents f . In this section we establish some of the main facts; we shall see that fˆ determines f uniquely and we show how we can find f if we know fˆ. Two very important properties of the Banach space L1 (T) are the following: H-1’ If f ∈ L1 (T) and τ ∈ T, then fτ (t) = f (t − τ ) ∈ L1 (T) and kfτ kL1 = kf kL1
H-2’ The L1 (T)-valued function τ 7→ fτ is continuous on T, that is, for f ∈ L1 (T) and τ0 ∈ T (2.1)
lim kfτ − fτ0 kL1 = 0.
τ →τ0
We shall refer to (H-1’) as the translation invariance of L1 (T); it is an immediate consequence of the translation invariance of the measure dt. In order to establish (H-2’) we notice first that (2.1) is clearly valid if f is a continuous function. Remembering that the continuous functions are dense in L1 (T), we now consider an arbitrary f ∈ L1 (T) and ε > 0. Let g be a continuous function on T such that kg − f kL1 < ε/2; thus kfτ − fτ0 kL1 ≤ kfτ − gτ kL1 + kgτ − gτ0 kL1 + kgτ0 − fτ0 kL1 = = k(f − g)τ kL1 + kgτ − gτ0 kL1 + k(g − f )τ0 kL1 ≤ ε + kgτ − gτ0 kL1 .
Hence limkfτ − fτ0 kL1 < ε and, ε being an arbitrary positive number, (H-2’) is established. 2.2 D EFINITION : A summability kernel is a sequence {kn } of continuous 2π -periodic functions satisfying: Z 1 (S-1) kn (t)dt = 1 2π
(S-2) (S-3)
1 2π
Z
|kn (t)|dt ≤ const
For all 0 < δ < π , lim
n→∞
2π−δ
Z
|kn (t)|dt = 0 δ
10
A N I NTRODUCTION TO H ARMONIC A NALYSIS
A positive summability kernel is one such that kn (t) ≥ 0 for all t and n. For positive kernels the assumption (S-2) is clearly redundant. We consider also families kr depending on a continuous parameter r instead of the discrete n. Thus the Poisson kernel P(r, t), which we shall define at the end of this section, is defined for 0 ≤ r < 1 and we replace in (S-3), as well as in the applications, the limit “limn→∞ ” by “limr→1 ”. The following lemma is stated in terms of vector-valued integrals. We refer to Appendix A for the definition and relevant properties. Lemma. Let B be a Banach space, ϕ a continuous B -valued function on T, and {kn } a summability kernel. Then: Z 1 kn (τ )ϕ(τ )dτ = ϕ(0). lim n→∞ 2π
P ROOF : By (S-l) we have, for 0 < δ < π , Z Z 1 1 kn (τ )ϕ(τ )dτ − ϕ(0) = kn (τ )(ϕ(τ ) − ϕ(0))dτ 2π 2π ! Z δ Z 2π−δ (2.2) 1 + kn (τ )(ϕ(τ ) − ϕ(0))dτ. = 2π δ −δ Now
1 Z δ
(2.3) kn (τ )(ϕ(τ ) − ϕ(0))dτ ≤ max kϕ(τ ) − ϕ(0)kB kkn kL1
2π −δ |τ |≤δ B
and
(2.4)
1 Z 2π−δ
kn (τ )(ϕ(τ ) − ϕ(0))dτ ≤
2π δ B Z 2π−δ
1 |kn (τ )|dτ. ≤ max ϕ(τ ) − ϕ(0) B 2π δ
By (S-2) and the continuity of ϕ(τ ) at τ = 0, given ε > 0 we can find δ > 0 so that (2.3) is bounded by ε, and keeping this δ , it results from (S-3) that (2.4) tends to zero as n → ∞ so that (2.2) is bounded by 2ε. J 2.3 For f ∈ L1 (T) we put ϕ(τ ) = fτ (t) = f (t − τ ). By (H-1’) and (H-2’), ϕ is a continuous L1 (T)-valued function on T and ϕ(0) = f . Applying lemma 2.2 we obtain
I. F OURIER S ERIES ON T
11
Theorem. Let f ∈ L1 (T) and {kn } be a summability kernel; then Z 1 (2.5) f = lim kn (τ )fτ dτ n→∞ 2π
in the L1 (T) norm. 2.4 The integrals in (2.5) have the formal appearance of a convolution although the operation involved, that is, vector integration, is different from the convolution as defined in section 1.7. The ambiguity, however, is harmless. Lemma. Let k be a continuous function on T and f ∈ L1 (T). Then Z 1 (2.6) k(τ )fτ dτ = k ∗ f. 2π
P ROOF : Assume first that f is continuous on T. We have, Appendix A, Z X 1 1 k(τ )fτ dτ = lim (τj+1 − τj )k(τj )fτj , 2π 2π j the limit being taken in the L1 (T) norm as the subdivision {τj } of [0, 2π) becomes finer and finer. On the other hand, X 1 lim (τj+1 − τj )k(τj )f (t − τj ) = (k ∗ f )(t) 2π j
uniformly and the lemma is proved for continuous f . For arbitrary f ∈ L1 (T), let ε > 0 be arbitrary and let g be a continuous function on T such that kf − gkL1 < ε. Then, since (2.6) is valid for g , Z Z 1 1 k(τ )fτ dτ − k ∗ f = k(τ )(f − g)τ dτ + k ∗ (g − f ) 2π 2π and consequently
1 Z
k(τ )fτ dτ − k ∗ f ≤ 2kkkL1 ε.
2π L1
Using lemma 2.4 we can rewrite (2.5): (2.5’)
f = lim kn ∗ f n→∞
in the L1 (T) norm.
J
12
A N I NTRODUCTION TO H ARMONIC A NALYSIS
2.5 One of the most useful summability kernels, and probably the best known, is Fejér’s kernel (which we denote by {Kn }) defined by
(2.7)
Kn (t) =
n X
1−
j=−n
|j| ijt e . n+1
The fact that Kn satisfies (S-1) is obvious from (2.7); that Kn (t) ≥ 0 and that (S-3) is satisfied is clear from Lemma. 1 Kn (t) = n+1
sin n+1 2 sin 12 t
2
.
P ROOF : Recall that (2.8)
sin2
t 1 1 1 1 = (1 − cos t) = − e−it + − eit . 2 2 4 2 4
A direct computation of the coefficients in the product shows that X n 1 1 1 |j| ijt − e−it + − eit e = 1− 4 2 4 n+1 j=−n 1 −i(n+1)t 1 1 i(n+1)t 1 = − e + − e . n+1 4 2 4
J
We adhere to the generally used notation and write σn (f ) = Kn ∗ f and σn (f, t) = (Kn ∗ f )(t). It follows from corollary 1.9 that (2.9)
σn (f, t) =
n X −n
1−
|j| ˆ f (j)eijt . n+1
2.6 The fact that σn (f ) → f in the L1 (T) norm for every f ∈ L1 (T), which is a special case of (2.5’), and the fact that σn (f ) is a trigonometric polynomial imply that trigonometric polynomials are dense in L1 (T). Other immediate consequences are the following two important theorems. 2.7 Theorem (The Uniqueness Theorem). Let f ∈ L1 (T) and assume that fˆ(n) = 0 for all n. Then f = 0.
P ROOF : By (2.9) σn (f ) = 0 for all n. Since σn (f ) → f , it follows that f = 0. J
I. F OURIER S ERIES ON T
13
An equivalent form of the uniqueness theorem is: Let f, g ∈ L1 (T) and assume fˆ(n) = gˆ(n) for all n, then f = g . 2.8 Theorem (The Riemann-Lebesgue Lemma). Let f ∈ L1 (T), then lim fˆ(n) = 0. |n|→∞
P ROOF : Let ε > 0 and let P be a trigonometric polynomial on T such that kf − P kL1 < ε. If |n| > degree of P , then |fˆ(n)| = |(f\ − P )(n)| ≤ kf − P kL1 < ε.
J
Remark: If K is a compact set in L1 (T) and ε > 0, there exist a finite number of trigonometric polynomials P1 . . . , PN such that for every f ∈ K there exists a j , 1 ≤ j ≤ N , such that kf − Pj kL1 < ε. If |n| is greater than max1≤j≤N (degree of Pj ) then |fˆ(n)| < ε for all f ∈ K . Thus, the Riemann-Lebesgue lemma holds uniformly on compact subsets of L1 (T). 2.9 is,
(2.10)
For ∈ L1 (T) we denote by Sn (f ) the nth partial sum of S[f ], that
(Sn (f ))(t) = Sn (f, t) =
n X
fˆ(j)eijt .
−n
If we compare (2.9) and (2.10) we see that (2.11)
σn (f ) =
1 (S0 (f ) + S1 (f ) + · · · + Sn (f )), n+1
in other words, the σn (f ) are the arithmetic means† of Sn (f ). It follows that if Sn (f ) converge in L1 (T) as n → ∞, then the limit is necessarily f. From corollary 1.9 it follows that Sn (f ) = Dn ∗ f where Dn is the Dirichlet kernel defined by (2.12)
Dn (t) =
n X −n
eijt =
sin(n + 12 )t . sin 21 t
† Often referred to as the Cesàro means or, especially in Fourier Analysis, as the Fejér means.
14
A N I NTRODUCTION TO H ARMONIC A NALYSIS
It is important to notice that {Dn } is not a summability kernel in our sense. It does satisfy condition (S-1); however, it does not satisfy either (S-2) or (S-3). This explains why the problem of convergence for Fourier series is so much harder than the problem of summability. We shall discuss convergence in chapter II. 2.10 D EFINITION : A homogeneous Banach space on T is a linear subspace B of L1 (T) having a norm k kB ≥ k kL1 under which it is a Banach space, and having the following properties:
(H-1) If f ∈ B and τ ∈ T, then fτ ∈ B and kfτ kB = kf kB (where fτ (t) = f (t − τ )). (H-2) For all f ∈ B,
τ, τ0 ∈ T,
limτ →τ0 kfτ − fτ0 k = 0.
Remarks: Condition (H-1) is referred to as translation invariance and (H-2) as continuity of the translation. We could simplify (H-2) somewhat by requiring continuity at one specific τ0 ∈ T, say τ0 = 0 rather than at every τ ∈ T, since by (H-1) kfτ − fτ0 kB = kfτ −τ0 − f kB
Also, the method of the proof of (H-2’) (see 2.1) shows that if we have a space B satisfying (H-1) and we want to show that it satisfies (H-2) as well, it is sufficient to check the continuity of the translation on a dense subset of B. An almost equivalent statement is Lemma. Let B ⊂ L1 (T) be a Banach space satisfying (H-1). Denote by Bc the set of all f ∈ B such that τ 7→ fτ is a continuous B -valued function. Then Bc is a closed subspace of B .
Examples of homogeneous Banach spaces on T . (a) C(T)–the space of all continuous 2π -periodic functions with the norm (2.13)
kf k∞ = max|f (t)| t
(b) C n (T)–the subspace of C(T) of all n-times continuously differentiable functions (n being a rational integer) with the norm (2.13’)
kf kC n =
n X 1 max|f (j) (t)| t j! j=0
I. F OURIER S ERIES ON T
15
(c) Lp (T), 1 ≤ p
kf kLp =
1 2π
Z
|f (t)|
p
1/p
.
The validity of (H-1) for all three examples is obvious. The validity of (H-2) for (a) and (b) is equivalent to the statement that continuous functions on T are uniformly continuous. The proof of (H-2) for (c) is identical to that of (H-2’) (see 2.1). We now extend Theorem 2.3 to homogeneous Banach spaces on T. 2.11 Theorem. Let B be a homogeneous Banach space on T, let f ∈ B and let {kn } be a summability kernel. Then kkn ∗ f − f k → 0
as
n → ∞.
R 1 P ROOF : Since k kB ≥ k kL1 , the B -valued integral 2π kn (τ )fτ dτ is the same as the L1 (T)-valued integral which, by Lemma 2.4, is equal to kn ∗ f . The theorem now follows from Lemma 2.2. J
2.12 Theorem. Let B be a homogeneous Banach space on T. Then the trigonometric polynomials in B are everywhere dense.
P ROOF : For every. f ∈ B,
σn (f ) → f .
J
Corollary (Weierstrass Approximation Theorem). Every continuous 2π -periodic function can be approximated uniformly by trigonometric polynomials. 2.13 We finish this section by mentioning two important summability kernels. a. The de la Vallée Poussin kernel:
(2.15)
Vn (t) = 2K2n+1 (t) − Kn (t)
(S-1), (S-2) and (S-3) are obvious from (2.15). Vn is a polynomial of ˆ n (j) = 1 if |j| ≤ n + 1; it degree 2n + 1 having the property that V is therefore very useful when we want to approximate a function f by polynomials having the same Fourier coefficients as f over prescribed intervals (namely Vn ∗ f ).
16
A N I NTRODUCTION TO H ARMONIC A NALYSIS
b. The Poisson kernel: for 0 < r < 1 put
(2.16)
P(r, t) =
X
r|j| eijt = 1 + 2
∞ X
rj cos jt =
j=1
1 − r2 . 1 − 2r cos t + r2
It follows from Corollary 1.9 and from the fact that the series in (2.16) converges uniformly, that X (2.17) P(r, t) ∗ f = fˆ(n)r|n| eint . Thus P ∗ f is the Abel mean of S[f ] and Theorem 2.11 (with Poisson’s kernel) states that for f ∈ B , S[f ] is Abel summable to f in the B norm. Compared to the Fejér kernel, the Poisson kernel has the disadvantage of not being a polynomial; however, being essentially the real part of 1+reit the Cauchy kernel—precisely: P(r, t) = < 1−reit , the Poisson kernel links the theory of trigonometric series with the theory of analytic functions. We shall make much use of that in chapter III. Another important property of P(r, t) is that it is a decreasing function of t for 0 < t < π . EXERCISES FOR SECTION 2 1. Show that every measurable homomorphism of T into T ∗ has the form t 7→ eint where n is a rational integer. Hint: Use Exercise 1.16. 2. Show that in the following examples (H-1) is satisfied but (H-2) is not satisfied: (a) L∞ (T)–the space of essentially bounded functions in L1 (T) with the norm kf k∞ = ess sup t∈T |f (t)|
(b) Lipα (T), 0 < α < 1–the subspace of C(T) consisting of the functions f for which |f (t + h) − f (t)| supt∈T, h6=0 <∞ |h|α with the norm kf kLipα = supt |f (t)| + supt∈T, h6=0
|f (t + h) − f (t)| . |h|α
3. Show that for B = L∞ (T), Bc (see Lemma 2.10) is C(T). 4. Assume 0 < α < 1; show that for B = Lipα (T) Bc = lipα (T) =
n
f : lim supt h→0
|f (t + h) − f (t)| =0 . |h|α
o
I. F OURIER S ERIES ON T
17
5. Show that for B = Lip1 (T), Bc = C 1 (T) . 6. Let B be a Banach space on T, satisfying (H-1). Prove that Bc is the closure of the set of trigonometric polynomials in B . 7. Use exercise 1.1 and the fact that step functions are dense in L1 (T) to prove the Riemann-Lebesgue lemma. 8. (Fejér’s lemma). If f ∈ L1 (T) and g ∈ L∞ (T), then lim n→∞
Z
f (t)g(nt)dt = fˆ(0)ˆ g (0).
Hint: Approximate f in the L1 (T) norm by polynomials. 9. Show that for f ∈ L1 (T) the norm of the operator f : g 7→ f ∗ g on L1 (T) is kf kL1 . Hint: kKn kL1 = 1, kKn ∗ f kL1 → kf kL1 . 10. Defining the support of a function f ∈ L1 (T) as the smallest closed set S such that f (t) = 0 almost everywhere in the complement of S , show that the support of f ∗ g for f, g ∈ L1 (T) is included in the algebraic sum support(f ) + support(g). 11. For n = 1, 2, . . . let kn be a Rnonnegative, infinitely differentiable function on T having the properties (i) kn (t)dt = 1, (ii) kn (t) = 0 if |t| > 1/n. Show that {kn } is a summability kernel and deduce that if B is a homogeneous Banach space on T and f ∈ B , then f can be approximated in the B norm by infinitely differentiable functions with supports arbitrarily close to the support of f . 12. (Bernstein)‡ Let P be a trigonometric polynomial of degree n. Show that supt |P 0 (t)| ≤ 2n supt |P (t)|. Hint: P 0 = −P ∗ 2nKn−1 (t) sin nt. Also k2nKn−1 sin ntkL1 (T) < 2n. 13. Let B be a homogeneous Banach space on T. Show that if g ∈ L1 (T) and f ∈ B then g ∗ f ∈ B , and kg ∗ f kB ≤ kgkL1 kf kB .
14. Let B be a homogeneous Banach space on T . Let H ⊂ B be a closed, translation-invariant subspace. Show that H is spanned by the exponentials it contains and deduce that a function f ∈ B is in H if, and only if, for every n ∈ Z such that fˆ(n) 6= 0, there exists g ∈ H such that gˆ(n) 6= 0. 3
POINTWISE CONVERGENCE OF σn (f ).
We saw in section 2 that if f ∈ L1 (T), then σn (f ) converges to f in the topology of any homogeneous Banach space that contains f . In particular, if f ∈ C(T) then σn (f ) converges to f uniformly. However, ‡ Bernstein’s inequality is: sup|P 0 | ≤ n sup|P |, and can be proved similarly, see exercise 14 on page 48.
18
A N I NTRODUCTION TO H ARMONIC A NALYSIS
if f is not continuous, we cannot usually deduce pointwise convergence of σn (f ) from its convergence in norm, nor can we relate the limit of σn (f, t0 ), in case it exists, to f (t0 ), We therefore have to reexamine the integrals defining σn (f ) for pointwise convergence. 3.1 Theorem (Fejér). Let f ∈ L1 (T).
(a) Assume that limh→0 (f (t0 + h) + f (t0 − h)) exists (we allow the values −∞ and +∞); then (3.1)
σn (f, t0 ) →
1 lim (f (t0 + h) + f (t0 − h)) 2 h→0
In particular, if t0 is a point of continuity of f , then σn (f, t0 ) → f (t0 ). (b) If every point of a closed interval I is a point of continuity for f , σn (f, t) converges to f (t) uniformly on I . (c) If for a.e. t, m ≤ f (t), then m ≤ σn (f, t); if for a.e. t, f (t) ≤ M , then σn (f, t) ≤ M . Remark: The proof will be based on the fact that {Kn (t)} is a positive summability kernel which has the following properties: (3.2) For 0 < ϑ < π , lim supϑ
(3.3)
Kn (t) = Kn (−t)
The statement of the theorem remains valid if we replace σn (f ) by kn ∗ f , where {kn } is a positive summability kernel satisfying (3.2) and (3.3). For example: the Poisson kernel satisfies all the these requirements and the statement of the theorem remains valid if we replace σn (f ) by the Abel means of the Fourier series of f .
P ROOF OF F EJÉR ’ S THEOREM : We assume for simplicity that fˇ(t0 ) = lim 21 f (t0 + h) + f (t0 − h) is finite; the modifications needed for the cases fˇ(t0 ) = +∞ or fˇ(t0 ) = −∞ being obvious. Now Z 1 ˇ σn (f, t0 ) − f (t0 ) = Kn (τ ) f (t0 − τ ) − fˇ(t0 ) dτ = 2π T Z ϑ Z 2π−ϑ ! 1 + Kn (τ ) f (t0 − τ ) − fˇ(t0 ) dτ = = (3.4) 2π ϑ −ϑ Z ϑ Z π! f (t + τ ) + f (t − τ ) 1 0 0 = + Kn (τ ) − fˇ(t0 ) dτ. π 2 ϑ 0
I. F OURIER S ERIES ON T
19
(Notice that the last equality in (3.4) depends on (3.3).) Given ε > 0, we choose ϑ > 0 so small that f (t + τ ) + f (t − τ ) 0 0 (3.5) |τ | < ϑ ⇒ − fˇ(t0 ) < ε, 2 and then n0 so large that n > n0 implies (3.6)
supϑ<τ <2π−ϑ Kn (τ ) < ε.
From (3.4), (3.5), and (3.6) we obtain σn (f, t0 ) − fˇ(t + 0) < ε + εkf − fˇ(t0 )kL1 (3.7)
which proves part (a). Part (b) follows from the uniform continuity of f on I ; we can pick ϑ so that (3.5) is valid for all t0 ∈ I , and n0 depends only on ϑ (and ε). 1 Part (c) depends only on the fact that Kn (t) ≥ 0 and 2π Kn (t)dt = 1; if m ≤ f then Z 1 σn (f, t) − m = Kn (τ ) f (t − τ ) − m dτ ≥ 0 2π the integrand being nonnegative. If f ≤ M then Z 1 M − σn (f, t) = Kn (τ ) M − f (t − τ ) dτ ≥ 0 2π for the same reason.
J
Corollary. If t0 is a point of continuity of f and if the Fourier series of f converges at t0 then its sum is f (t0 ) (cf. 2.9). 3.2
Fejér’s condition f (t0 + h) + f (t0 − h) fˇ(t0 ) = lim h→0 2
implies that (3.8)
1 h→0 h lim
Z h f (t0 + τ ) + f (t0 − τ ) − fˇ(t0 ) dτ = 0. 2 0
Requiring the existence of a number fˇ(t) such that (3.8) is valid is far less restrictive than Fejér’s condition and more natural for summable functions. It does not change if we modify f on a set of measure zero and, although for some function f Fejér’s condition may hold for no value t0 , (3.8) holds with fˇ(t0 ) = f (t0 ) for almost all t0 (cf. [28], Vol. 1, p. 65).
20
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Theorem (Lebesgue). If (3.8) holds, then σn (f, t0 ) → f (t0 ). In particular σn (f, t) → f (t) almost everywhere.
P ROOF : As in the proof of Fejér’s theorem, σn (f, t0 ) − fˇ(t0 ) = Z π Z h f (t + τ ) + f (t − τ ) i (3.9) 1 ϑ 0 0 Kn (τ ) + = − fˇ(t0 ) dτ. π 0 2 ϑ 2 sin(n+1)τ /2 1 As Kn (τ ) = n+1 and sin τ2 > πτ for 0 < τ < π , we obtain sin τ /2
(3.10)
Kn (τ ) ≤ min n + 1,
π2 . (n + 1)τ 2
In particular we see that the second integral in (3.9) tends to zero provided (n + 1)ϑ2 tends to ∞. We pick ϑ = n−1/4 and turn to evaluate the first integral. Denote Z h f (t0 + τ ) + f (t0 − τ ) Φ(h) = − fˇ(t0 ) dτ ; 2 0 then Z 1 Z 1 Z ϑ h f (t + τ ) + f (t − τ ) i 1 n 1 ϑ 0 0 ˇ Kn (τ ) − f (t0 ) dτ ≤ + π 0 2 π 0 π n1 Z ϑ dτ n+1 1 π f (t0 + τ ) + f (t0 − τ ) ≤ Φ( ) + − fˇ(t0 ) 2 . π n n + 1 n1 2 τ The term
(3.11)
n+1 1 π Φ( n )
tends to zero by (3.8). Integration by parts gives Z ϑ dτ π f (t0 + τ ) + f (t0 − τ ) − fˇ(t0 ) 2 = 1 n+1 n 2 τ Z ϑ h i ϑ π Φ(τ ) Φ(τ ) 2π = dτ . + n + 1 τ 2 1/n n + 1 1/n τ 3
For ε > 0 and n > n(ε) we have by (3.8) Φ(τ ) < ετ
in
0 < τ < ϑ = n−1/4
hence (3.11) is bounded by πεn 2πε + n+1 n+1
Z
ϑ
1/n
dτ < 3πε. τ2
J
I. F OURIER S ERIES ON T
21
Corollary. If the Fourier series of f ∈ L1 (T) converges on a set E of positive measure, its sum coincides with f almost everywhere on E . In particular, if a Fourier series converges to zero almost everywhere, all its coefficients must vanish.
Remark: This last result is not true for all trigonometric series. There are examples of trigonometric series converging to zero almost everywhere† without being identically zero. 3.3 The need to impose in Theorem 3.2 the strict condition (3.8) rather than the weaker condition Z h f (t0 + τ ) + f (t0 − τ ) (3.8’) Ψ(h) = − fˇ(t0 ) dτ = o(h) 2 0
comes from the fact that in order to carry the integration by parts we π2 have to replace Kn (t) by the monotonic majorant min n + 1, (n+1)τ . 2 If we want to prove the analogous result for P(r, t) rather that Kn (t), the condition (3.8’) is sufficient. Thus we obtain: Theorem (Fatou). If (3.8’) holds, then lim
r→1
∞ X
fˆ(j)r|j| eijt0 = fˇ(t0 ).
−∞
The condition (3.8’) with fˇ(t0 ) = f (t0 ) is satisfied at every point t0 where f is the derivative of its integral (hence almost everywhere). EXERCISES FOR SECTION 3 1. Let 0 < α < 1 and let f ∈ L1 (T). Assume that at the point t0 ∈ T, f satisfies a Lipschitz condition of order α, that is, |f (t0 + τ ) − f (t0 )| < K|τ |α for |τ | < π Prove that for α < 1 |σn (f, t0 ) − f (t0 )| ≤
π+1 Kn−α 1−α
while for α = 1 |σn (f, t0 ) − f (t0 )| ≤ 2πK
Hint: Use (3.10) and (3.4) with ϑ =
log n . n
1 n
† However, a trigonometric series converging to zero everywhere is identically zero (see [13], Chapter 5).
22
A N I NTRODUCTION TO H ARMONIC A NALYSIS If f ∈ Lipα (T), 0 < α ≤ 1, then kσn (f ) − f k∞ ≤
(
const kf kLipα n−α
const
kf kLip1 logn n
when 0 < α < 1, for α = 1.
3. Let f ∈ L∞ (T) and assume |fˆ(n)| < K|n|−1 . Prove that for all n and t, |Sn (f, t)| ≤ kf k∞ + 2K . Hint: n X |j| ˆ Sn (f, t) = σn (f, t) + f (j)eijt . n+1 −n
Pn
−1
4. Show that for all n and t, | 1 j sin jt| ≤ 12 π + 1. Hint: Consider f (t) = t/2 in [0, 2π). 5. Jackson’s kernel is Jn (t) = kKn k−2 K2 (t). Verify L2 n a. {Jn } is a positive summability kernel. b. For −π < t < π , Jn (t) < 2π 4 n−3 t−4 . c. If f ∈ Lip1 (T), then kJn ∗ f − f k∞ ≤ const kf kLip1 n−1 . Compare this to the corresponding estimate for kKn ∗ f − f k∞ in exercise 2 above. 4
THE ORDER OF MAGNITUDE OF FOURIER COEFFICIENTS
The only things we know so far about the size of Fourier coefficients ˆ {f (n)} of a function f ∈ L1 (T) is that they are bounded by kf kL1 , (1.4(e)) and that lim|n|→∞ fˆ(n) = 0 (the Riemann-Lebesgue lemma). In this section we discuss the following three questions: (a) Can the Riemann-Lebesgue lemma be improved to provide a certain rate of vanishing of fˆ(n) as |n| → ∞? We show that the answer to (a) is negative; fˆ(n) can go to zero arbitrarily slowly (see 4.1). (b) In view of the negative answer to (a), is it true that any sequence {an } which tends to zero as |n| → ∞ is the sequence of Fourier coefficients of some f ∈ L1 (T)? The answer to (b) is again negative (see 4.2). (c) How are properties like boundedhess, continuity, smoothness, etc. of a function f reflected by {fˆ(n)}? Question (c), in one form or another, is a recurrent topic in harmonic analysis. In the second half of this section we show how various smoothness conditions affect the size of the Fourier coefficients. “Order of magnitude” conditions on the Fourier coefficients are seldom necessary and sufficient for the function to belong to a given
I. F OURIER S ERIES ON T
23
function space. For example, a necessary condition for f ∈ C(T) is P ˆ P |f (n)|2 < ∞, a sufficient condition is |fˆ(n)| < ∞; in both cases the exponents are best possible. The only spaces, defined by conditions of size or smoothness of the functions, for which we obtain (in the following section) complete characterization, that is, a necessary and sufficient condition expressed in terms of order of magnitude, for a sequence {an } to be the Fourier coefficients of a function in the space, are L2 (T) and its “derivatives”† . 4.1 Theorem. Let {an }∞ n=−∞ be an even sequence of nonnegative numbers tending to zero at infinity. Assume that for n > 0 an−1 + an+1 − 2an ≥ 0.
(4.1)
Then there exists a nonnegative function f ∈ L1 (T) such that fˆ(n) = an . P P ROOF : We remark first that (an − an+1 ) = a0 and that the convexity condition (4.1) implies that (an − an+1 ) is monotonically decreasing with n, hence lim n(an − an+1 ) = 0, n→∞
and consequently N X
n(an−1 + an+1 − 2an ) = a0 − aN − N (aN − aN +1 )
n=1
converges to a0 as N → ∞. Put (4.2)
f (t) =
∞ X
n(an−1 + an+1 − 2an )Kn−1 (t),
n=1
where Kn denotes, as usual, the Fejér kernel. Since kKn kL1 = 1, the series (4.2) converges in L1 (T) and, all its terms being nonnegative, its limit f is nonnegative. Now fˆ(j) =
∞ X
ˆ n−1 (j) = n(an−1 + an+1 − 2an )K
n=1
=
∞ X
n=|j|+1
|j| = a|j| , n(an−1 + an+1 − 2an ) 1 − n
and the proof is complete. † Such
as the space of absolutely continuous functions with derivatives in L2 (T).
J
24
A N I NTRODUCTION TO H ARMONIC A NALYSIS
4.2 Comparing theorem 4.1 to our next theorem shows the basic difference between sine-series (a−n = −an ) and cosine-series (a−n = an ). Theorem. Let f ∈ L1 (T) and assume that fˆ(|n|) = −fˆ(−|n|) ≥ 0. Then X1 fˆ(n) < ∞. n n>0
P ROOF :R Without loss of generality we may assume that fˆ(0) = 0. Write t F (t) = 0 f (τ )dτ ; then F ∈ C(T) and, by theorem 1.6, 1 Fˆ (n) = fˆ(n), in
n 6= 0.
Since F is continuous, we can apply Fejér’s theorem for t0 = 0 and obtain (4.3)
lim 2
N →∞
N X
n=1
1−
n fˆ(n) = i F (0) − Fˆ (0) = −iFˆ (0), N +1 n
fˆ(n) J n ≥ 0, the theorem follows. P P Corollary. If an > 0, an /n = ∞, then an sin nt is not a Fourier series. Hence there exist trigonometric series with coefficients tending to zero which are not Fourier series.
and since
By Theorem 4.1, the series ∞ X X eint cos nt = log n 2 log|n| n=2 |n|≥2
is a Fourier series while, by theorem 4.2, its conjugate series ∞ X X sgn (n) sin nt = −i eint log n 2 log|n| n=2 |n|≥2
is not. 4.3 We turn now to some simple results about the order of magnitude of Fourier coefficients of functions satisfying various smoothness conditions. Theorem. If f ∈ L1 (T) is absolutely continuous, then fˆ(n) = o(1/n).
I. F OURIER S ERIES ON T
25
P ROOF : By theorem 1.6 we have fˆ(n) = (1/in)fb0 (n) and (the RiemannLebesgue lemma) fb0 (n) → 0. J Remark: By repeated application of Theorem 1.6 (i.e., by repeated integration by parts) we see that if f is k-times differentiable and f (k−1) is absolutely continuous‡ then (4.4) as |n| → ∞. fˆ(n) = o n−k 4.4 We can obtain a somewhat more precise estimate than the asymptotic (4.4). All that we have to do is notice that if 0 ≤ j ≤ k, then (j) (n) and hence fˆ(n) = (in)−j fd |fˆ(n)| ≤ |n|−j kf (j) kL1 .
(4.5)
We thus obtain Theorem. If f is k -times differentiable, and f (k−1) is absolutely continuous, then kf (j) kL1 . |fˆ(n)| ≤ min 0≤j≤k |n|j If f is infinitely differentiable, then |fˆ(n)| ≤ min 0≤j
kf (j) kL1 . |n|j
4.5 Theorem. lf f is of bounded variation on T, then |fˆ(n)| ≤
var(f ) . 2π|n|
P ROOF : We integrate by parts using Stieltjes integrals Z Z var(f ) 1 1 |fˆ(n)| = e−int f (t)dt = e−int df (t) ≤ . 2π 2πin 2π|n|
J
4.6 For f ∈ C(T) we denote by ω(f, h) the modulus of continuity of f , that is, ω(f, h) = sup|y|≤h kf (t + y) − f (t)k∞ .
For f ∈ L1 (T) we denote by Ω(f, h) the integral modulus of continuity of f , that is, (4.6)
Ω(f, h) = kf (t + h) − f (t)kL1 .
We clearly have Ω(f, h) ≤ ω(f, h). ‡ So
that f (k) ∈ L1 (T) and f (k−1) is its primitive,
26
A N I NTRODUCTION TO H ARMONIC A NALYSIS
π ). Theorem. For n 6= 0, |fˆ(n)| ≤ 12 Ω(f, |n|
P ROOF : fˆ(n) = of variable,
1 2π
R
−1 2π
f (t)e−int dt =
1 fˆ(n) = 4π
Z
f (t +
R
f (t)e−in(t+π/n) dt; by a change
π ) − f (t) e−int dt, n
hence |fˆ(n)| ≤
1 π Ω(f, ) 2 |n|
J
Corollary. lf f ∈ Lipα (T), then fˆ(n) = O (n−α ). 4.7 Theorem. Let 1 < p ≤ 2 and let q be the conjugate exponent, i.e., P p q = p−1 . If f ∈ Lp (T) then |fˆ(n)|q < ∞.
The case p = 2 will be proved in the following section. The case 1 < p < 2 will be proved in chapter IV. Remark: Theorem 4.7 cannot be extended to p > 2. Thus, if f ∈ Lp (T) P with p > 2, then f ∈ L2 (T) and consequently |fˆ(n)|2 < ∞. This is all that we can assert even for continuous functions. There exist P continuous functions f such that |fˆ(n)|2−ε = ∞ for all ε > 0, see IV.2. In fact, given any {cn } ∈ `2 , there exists a continuous function f such that |fˆ(n)| > |cn |, see Appendix B.2.1.
EXERCISES FOR SECTION 4 I. Given a sequence {ωn } of positive numbers such that ωn → 0 as |n| → ∞, show that there exists a sequence {an } satisfying the conditions of theorem 4.1 and an > ω n for all n. 2. Show that if |fˆ(n)||n|l < ∞, then f is l-times continuously differentiable. Hence, if fˆ(n) = O |n|−k where k > 2, and if
P
l=
(
k−2
k integer
[k] − 1
otherwise
then f is l-times continuously differentiable.
I. F OURIER S ERIES ON T
27
Remarks: Properly speaking the elements of L1 (T) are equivalence classes of functions any two of which differ only on a set of measure zero. Saying that a function f ∈ L1 (T) is continuous or differentiable etc. is a convenient and innocuous abuse of language with obvious meaning. Exercise 2 is all that we can state as a converse to theorem 4.4 if we look for continuous derivatives. It can be improved if we allow square summable derivatives (see exercise 5.5). 3. A function f is analytic on T if in a neighborhood of every t0 ∈ T, f (t) P∞ can be represented by a power series (of the form n=0 an (t − t0 )n ). Show that f is analytic if, and only if, f is infinitely differentiable on T and there exists a number R such that supt |f (n) (t)| ≤ n! Rn ,
n > 0.
4. Show that f is analytic on T if, and only if, there exist constants K > 0 and a > 0 such |fˆ(j)| ≤ Ke−a|j| . Hence show that f is analytic on T if, P ˆthat ijz and only if, f (j)e converges for |=(z)| < a for some a > 0. 5. Let f be analytic on T and let g(eit ) = f (t). What is the relation between the Laurent expansion of g about 0 (which converges in an annulus containing the circle |z| = 1) and the Fourier series of f ? 6. Let f be infinitely differentiable on T and assume that for some α > 0, and all n ≥ 0, supt |f (n) (t)| < Knαn . Show that α |fˆ(j)| ≤ K exp − |j|1/α . e
7. Assume |fˆ(j)| ≤ K exp −|j|1/α . Show that f is infinitely differentiable and
|f (n) (t)| ≤ K1 ean nan
for some constants a and P Kn1 . (n) Hint: |f (t)| ≤ 2K |j| exp(−|j|1/α ). Compare this last sum to the integral R∞ n 1/α x exp(−x )dx and change the variable of integration putting y = x1/α . 0 P∞ cos 3n t 8. Prove that if 0 < α < 1, then f (t) = belongs to Lipα (T); 3nα 1 hence corollary 4.6 cannot P be improved. sin nt 9. Show that the series ∞ converges for all t ∈ T. n=2 log n 5
FOURIER SERIES OF SQUARE SUMMABLE FUNCTIONS
In some respects the greatest success in representing functions by means of their Fourier series happens for square summable functions. The reason is that L2 (T) is a Hilbert space, its inner product being defined by Z 1 (5.1) f (t)¯ g (t)dt, hf, gi = 2π
28
A N I NTRODUCTION TO H ARMONIC A NALYSIS
and in this Hilbert space the exponentials form a complete orthogonal system. We start this section with a brief review of the basic properties of orthonormal and complete systems in abstract Hilbert space and conclude with the corresponding statements about Fourier series in L1 (T). 5.1 Let H be a complex Hilbert space. Let f, g ∈ H. We say that f is orthogonal to g if hf, gi = 0. This relation is clearly symmetric. If E is a subset of H we say that f ∈ H is orthogonal to E if f is orthogonal to every element of E . A set E ⊂ H is orthogonal if any two vectors in E are orthogonal to each other. A set E ⊂ H is an orthonormal system if it is orthogonal and the norm of each vector in E is one, that is, if, whenever f, g ∈ E , hf, gi = 0 if f 6= g and hf, f i = 1. Lemma. Let {ϕn }N n=1 be a finite orthonormal system. Let a1 , . . . , aN be complex numbers. Then N N
X
X
an ϕ n = |an |2 . 1
1
P ROOF : N N N N N X X X X
X
an ϕ n = h an ϕ n , an ϕ n i = an hϕn , am ϕ m i 1
1
1
=
1
X
an a ¯n =
1
X
|an |
2
J
Corollary. Let {ϕn }∞ in H and let {an }∞ 1 be an orthonormal system 1 P be a sequence of complex numbers such that |an |2 < ∞. Then P∞ n=1 an ϕn converges in H.
P ROOF : Since H is complete, all that we have to show is that the partial P sums SN = N 1 an ϕn form a Cauchy sequence in H. Now, for N > M , N N X
X
2 kSN − SM k2 = an ϕ n = |an |2 → 0 as M → ∞. M +1
M +1
J
5.2 Lemma. Let H be a Hilbert space. Let {ϕn } be a finite orthonormal system in H. For f ∈ H write an = hf, ϕn i. Then
(5.2)
N N X X
2
0≤ f− an ϕn = kf k2 − |an |2 . 1
1
I. F OURIER S ERIES ON T
29
P ROOF : N N N X X X
2
f − an ϕn = hf − an ϕ n , f − an ϕ n i = 1
= kf k2 −
1
N X 1
a ¯n hf, ϕn i −
1
N X 1
an hϕn , f i +
N X 1
|an |2 = kf k2 −
N X
|an |2 .
1
J
Corollary (Bessel’s inequality). Let H be a Hilbert space and {ϕα } an orthonormal system in H. For f ∈ H write aα = hf, ϕα i Then X (5.3) |aα |2 ≤ kf k2 .
The family {ϕα } in the statement of Bessel’s inequality need not be finite nor even countable. The inequality (5.3) is equivalent to saying that for every finite subset of {ϕα } we have (5.2). In particular aα = 0 P except for countably many values of α and the series |aα |2 converges. If H = L2 (T) all orthonormal systems in H are finite or countable (cf. exercise 2 at the end of this section) and we write them as sequences {ϕn }. 5.3 D EFINITION : A complete orthonormal system in H is an orthonormal system having the additional property that the only vector in H orthogonal to it is the zero vector. Lemma. Let {ϕn } be an orthonormal system in H. Then the following statements are equivalent: (a) {ϕn } is complete. (b) For every f ∈ H we have X (5.4) kf k2 = |hf, ϕn i|2 . P (c) f = hf, ϕn iϕn .
P ROOF : The equivalence of (b) and (c) follows immediately from (5.2). If f is orthogonal to {ϕn } and if (5.4) is valid, then kf k2 = 0, hence f = 0. Thus (b) ⇒ (a). We complete the proof by showing (a) ⇒ (c). P From Bessel’s inequality and corollary 5.1 it follows that hf, ϕn iϕn P converges in H. If we denote g = hf, ϕn iϕn we have hg, ϕn i = hf, ϕn i or, equivalently, g − f is orthogonal to {ϕn }. Thus if {ϕn } is complete f = g. J
30
A N I NTRODUCTION TO H ARMONIC A NALYSIS
5.4 Lemma (Parseval). Let {ϕn } be a complete orthonormal system in H. Let f, g ∈ H. Then hf, gi =
(5.5)
∞ X
hf, ϕn ihϕn , gi .
n=1
P ROOF : If f is a finite linear combination of {ϕn }, (5.5) is obvious. In the general case hf, gi = lim h N →∞
N X
hf, ϕn iϕn , gi = lim
N →∞
n=1
N X
hf, ϕn ihϕn , gi .
n=1
J
5.5 For H = L2 (T) the exponentials {eint }∞ n=−∞ form a complete orthonormal system. The orthonormality is evident: Z 1 int imt he , e i = ei(n−m)t dt = δn,m . 2π
The completeness is somewhat less evident; it follows from Theorem 2.7 since Z 1 int hf, e i = f (t)eint dt = fˆ(n) . 2π The general results about complete orthonormal systems in Hilbert space now yield Theorem. Let f ∈ L2 (T). Then
(a)
X
(b)
f = lim
|fˆ(n)|2 =
N →∞
N X
1 2π
fˆ(n)eint
Z
|f (t)|2 dt
in the L2 (T) norm.
−N
(c) For any square summable sequence {an }n∈Z of complex numbers, P that is such that |an |2 < ∞, there exists a unique f ∈ L2 (T) such that an = fˆ(n). (d) Let f, g ∈ L2 (T). Then 1 2π
Z
f (t)g(t)dt =
∞ X
n=−∞
fˆ(n)ˆ g (n) .
I. F OURIER S ERIES ON T
31
We denote by `2 the space of all square summable sequences {an }∞ −∞ , P (that is, such that |an |2 < ∞). With pointwise addition and scalar 1 P multiplication, and with the norm |an |2 2 and the inner product P∞ h{an }, {bn }i = −∞ an¯bn , `2 is a Hilbert space. Theorem 5.5 amounts to the statement that the correspondence f 7→ {fˆ(n)} is an isometry between L2 (T) and `2 . EXERCISES FOR SECTION 5 1. Let {ϕn }N n=1 be an orthogonal system in a Hilbert space H. Let f ∈ H. Show that
min f −
a1 ,...,aN
N X 1
aj ϕ j
is attained at the point aj = hf, ϕj i, j = 1, . . . , N , and only there. 2. A Hilbert space H is separable if it contains a dense countable subset. Show that an orthonormal system in a separable Hilbert space is either finite or countable. √ Hint: The distance between two orthogonal vectors of norm 1 is 2. 3. Prove that an orthonormal system {ϕn } in H is complete if, and only if, the set of finite linear combinations of {ϕn } is dense in H. 4. Let f be absolutely continuous on T and assume f 0 ∈ L2 (T); prove that
X
|fˆ(n)| ≤ kf kL1
v u ∞ u X n−2 kf 0 kL2 . + t2 1
Hint: |fˆ(0)| ≤ kf kL1 , and |nfˆ(n)|2 = kf 0 k2L2 ; apply the Cauchy-Schwarz inequality to the last identity, 5. Assume f ∈ L1 (T) and fˆ(n) = O(|n|−k ). Show that f is m-times differentiable with f (m) ∈ L2 (T) provided k − m > 21 .
P
6
ABSOLUTELY CONVERGENT FOURIER SERIES
We shall study absolutely convergent Fourier series in some detail later on: here we mention only some elementary facts. 6.1 We denote by A(T) the space of (continuous) functions on T having an absolutely convergent Fourier series, that is, the functions f for P 1 ˆ ˆ which ∞ −∞ |f (n)| < ∞. The mapping f 7→ {f (n)}n∈Z of A(T) into ` (the Banach space of absolutely convergent sequences) is clearly linP P ear and one-to-one. If ∞ an eint converges −∞ |an | < ∞ the series
32
A N I NTRODUCTION TO H ARMONIC A NALYSIS
uniformly on T and, denoting its sum by g , we have an = gˆ(n). It follows that the mapping above is an isomorphism of A(T) onto `1 . We introduce a norm to A(T) by kf kA(T) =
(6.1)
∞ X
|fˆ(n)| .
−∞
With this norm A(T) is a Banach space isometric to `1 ; we now claim it is an algebra. Lemma. Assume that f, g ∈ A(T). Then f g ∈ A(T) and kf gkA(T) ≤ kf kA(T) kgkA(T) . Pˆ P P ROOF : We have f (t) = f (n)eint , g(t) = gˆ(n)eint and since both series converge absolutely: XX f (t)g(t) = fˆ(k)ˆ g (m)ei(k+m)t . k
m
Collecting the terms for which k + m = n we obtain XX f (t)g(t) = fˆ(k)ˆ g (n − k)eint n
k
P so that fcg(n) = k fˆ(k)ˆ g (n − k); hence X XX X X |fcg(n)| ≤ |fˆ(k)||ˆ g (n − k)| = |fˆ(k)| |ˆ g (n)| . n
J
k
6.2 Not every continuous function on T has an absolutely convergent Fourier series, and those that have cannot† be characterized by smoothness conditions (see exercise 5 of this section). Some smoothness conditions are sufficient, however, to imply the absolute convergence of the Fourier series. Theorem. Let f be absolutely continuous on T and f 0 ∈ L2 (T). Then f ∈ A(T) and
(6.2)
∞ X 21 kf kA(T) ≤ kf kL1 + 2 n−2 kf 0 kL2 . 1
P ROOF : This is exercise 4 of the previous section and the hint given there is essentially the whole proof. J † See,
however, exercise 7.8.
I. F OURIER S ERIES ON T
33
?6.3 We refer to exercise 2.2 for the definitions of Lipα (T) and of its norm.
Theorem (Bernstein). If f ∈ Lipα (T) for some α > 12 , then f ∈ A(T) and kf kA(T) ≤ cα kf kLipα
(6.3)
where the constant cα depends only on α.
P ROOF : f (t − h) − f (t) ∼
X
(e−inh − 1)fˆ(n)eint .
if take h = 2π/(3·2m ) and 2m ≤ n ≤ 2m+1 we have |e−inh − 1| ≥ and consequently X X |fˆ(n)|2 ≤ |e−inh − 1|2 |fˆ(n)|2 = kfh − f k2L2 ≤ (6.4)
2m ≤n<2m+1
√ 3
n
≤ kfh − f k2∞ ≤
2π 2α kf k2Lip α . 3·2m
Noticing that the sum on the left of (6.4) consists of at most 2m+1 terms, we obtain by the Cauchy-Schwarz inequality (6.5)
X
2m ≤n<2m+1
|fˆ(n)| ≤ 2(m+1)/2
2π α kf kLip α . 3·2m
Since α > 12 , we can sum the inequalities (6.5) for m = 0, 1, . . . , and remembering that |fˆ(0)| ≤ kf kLipα we obtain (6.3). J Bernstein’s theorem is sharp; there exist functions in Lip 12 (T) whose Fourier series does not converge absolutely. A classical example is the P ein log n int Hardy-Littlewood series ∞ e (see [28], Vol. 1, p. 197). n=1 n Another example is given in exercise 6.6. ?6.4 The Lipschitz condition in Theorem 6.3 can be relaxed if f is of bounded variation.
Theorem (Zygmund). Let f be of bounded variation on T and assume f ∈ Lipα (T) for some α > 0. Then f ∈ A(T).
We refer to [28], Vol. 1, p. 241, for the proof.
34
A N I NTRODUCTION TO H ARMONIC A NALYSIS
?6.5 Remark: There is a change of scene in this section compared with the rest of the chapter. We no longer talk about functions summable on T and their Fourier series–we discuss functions summable on Z (i.e., absolutely convergent sequences) and their "Fourier transforms" which happen to be continuous functions on T. Lemma 6.1, for instance, is completely analogous to theorem 1.7 with the roles of T and Z reversed.
EXERCISES FOR SECTION 6 1. For n = 1, 2, . . . let fn ∈ A(T) and kfn kA(T) ≤ 1. Assume that fn converge to f uniformly on T. Show that f ∈ A(T) and kf k ≤ 1. 2. Show that the conditions in exercise 1 do not imply limkf −fn kA(T) = 0; however, if we add the assumption that kf kA(T) = limn→∞ kfn kA(T) then we do have kf − fn kA(T) → 0. 3. For 0 < a < π define ∆a (t) =
(
1 − a−1 |t|
for |t| ≤ a
0
for a ≤ |t| ≤ π
Show that ∆a ∈ A(T) and k∆a kA(T) = 1. Hint: ∆ˆa (n) ≥ 0 for all n. 4. Let f ∈ C(T) be even on (−π, π), decreasing on [0, π] and convex there (i.e., f (t + 2h) + f (t) > 2f (t + h) for 0 ≤ t ≤ t + 2h ≤ π ). Show that f ∈ A(T) and, if f ≥ 0, kf kA(T) = f (0). Hint: f can be approximated uniformly by positive combinations of ∆a . Compare with theorem 4.1. 5. Let ϕ be a "modulus of continuity," that is, an increasing concave function on [0, 1] with ϕ(0) = 0. Show P that if the sequence of integers {λn } increases fast enough and if f (t) = n−2 eiλn t , then ω(f, h) 6= O (ϕ(h)) as h → 0. ω(f, h) is the modulus of continuity of f (defined in 4.6). 6. (Rudin, Shapiro.) We define the trigonometric polynomials Pm and Qm inductively as follows: P0 = Q0 = 1 and m
Pm+1 (t) = Pm (t) + ei2
t
i2m t
Qm+1 (t) = Pm (t) − e
tQm (t) tQm (t).
(a) Show that |Pm+1 (t)|2 + |Qm+1 (t)|2 = 2 |Pm (t)|2 + |Qm (t)|2
hence and
|Pm (t)|2 + |Qm (t)|2 = 2m+1
kPm kC(T) ≤ 2(m+1)/2 . (b) For |n| < 2m , Pˆm+1 (n) = Pˆm (n), hence thereP exists a sequence {εn }∞ n=0 2m −1 such that εn is either 1 or -1 and such that Pm (t) = 0 εn eint .
I. F OURIER S ERIES ON T m−1
(c) Write fm = Pm − Pm+1 = ei2 that f ∈ Lip 1 (T) and f 6∈ A(T).
t
Qm−1 and f =
35
P∞ 1
2−m fm . Show
2
Hint: For 2−k ≤ h ≤ 21−k write k ∞ X X f (t + h) − f (t) = + 2−m (fm (t + h) − fm (t)) .
P∞
1
k+1
P∞
1
By part (a) the sum k+1 is bounded by 2 k+1 2−m 2m/2 < 5h 2 . Using part (a), exercise 2.12, and the fact that fm is aPtrigonometric polyomial of degree k 2m − 1, one obtains a similar estimate for 1 . 2 7. Let f, g ∈ L (T). Show that f ∗ g ∈ A(T). 7
FOURIER COEFFICIENTS OF LINEAR FUNCTIONALS
We consider a homogeneous Banach space B on T and assume, for simplicity, that eint ∈ B for all n. As usual, we denote by B ∗ the dual space of B . 7.1
(7.1)
The Fourier coefficients of a functional µ ∈ B ∗ are, by definition: µ ˆ(n) = heint , µi,
n ∈ Z;
and we call the trigonometric series S[µ] ∼
∞ X
µ ˆ(n)eint
−∞
the Fourier series† of µ. Clearly |ˆ µ(n)| ≤ kµkB ∗ keint kB .
The notation (7.1) is consistent with our definition of Fourier coefficients in case that µ is identified naturally with a summable function. For instance, if B = Lp (T), 1 < p < ∞, B ∗ is canonically identified with Lq (T) where q = p/(p − 1). To the function g ∈ Lq (T) corresponds the linear functional Z 1 f 7→ hf, gi = f ∈ Lp (T) f (t)g(t)dt, 2π Z Z and 1 1 heint , gi = eint g(t)dt = e−int g(t)dt 2π 2π thus gˆ(n) defined in (7.1) for the functional g coincides with the nth Fourier coefficient of the function g . † We keep, however, the convention of 1.3 that a Fourier series, without complements, is a Fourier series of a summable function.
36
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Theorem (Parseval’s formula). Let f ∈ B , µ ∈ B ∗ ; then N X |n| ˆ (7.2) hf, µi = lim µ(n). 1− f (n)ˆ N →∞ N +1 −N PN ˆ int P ROOF : (a) For polynomials P (t) = we clearly have −N P (n)e PN ˆ hP, µi = −N P (n)ˆ µ(n). (b) Since, by theorem 2.11, f = limN →∞ σN (f ) in the B norm, it follows from (a) and the continuity of µ that hf, µi = limhσN (f ), µi = lim
N →∞
N X
1−
−N
|n| ˆ f (n)ˆ µ(n). N +1
J
Remark: The fact that the limit in (7.2) exists is an implicit part of the theorem. It is equivalent to the C-1 summability‡ of the series Pˆ f (n)ˆ µ(n). If this last series converges then clearly hf, µi =
(7.3)
∞ X
fˆ(n)ˆ µ(n)
−∞
We shall sometimes refer to (7.3) as Parseval’s formula, keeping in mind that if the series on the right does not converge then (7.3) is simply an abbreviation for (7.2). Corollary (Uniqueness theorem). If µ ˆ(n) = 0 for all n, then µ = 0. P P 7.2 We shall write µ ∼ µ ˆ(n)eint , and may write µ = µ ˆ(n)eint if the series converges in some sense (which should be clear from the context). This is an abuse of language which, if used with caution, presents no risk of misunderstanding and obviates tedious repetitions. In accordance with our abuse of language we define, for µ ∈ B ∗ , the elements Sn (µ) and σn (µ) of B ∗ by Sn (µ) =
n X
σn (µ) =
n X
−n
(7.4)
−n
‡ Cesàro
µ ˆ(j)eijt
of order 1
1−
|j| µ ˆ(j)eijt n+1
I. F OURIER S ERIES ON T
37
We shall also write Sn (µ, t) =
(7.5) σn (µ, t) =
n X
µ ˆ(j)eijt
−n n X −n
1−
|j| µ ˆ(j)eijt n+1
The correspondence between the functionals (7.4) and the functions (7.5) is clearly Z n X 1 hf, Sn (µ)i = fˆ(j)ˆ µ(j) f (t)Sn (µ, t)dt = 2π −n for all f ∈ B ; similarly for σn (µ). The mapping Sn : f 7→ Sn (f ) on B is clearly a bounded linear operator, and so is Sn : µ 7→ Sn (µ) on B ∗ . It follows from Parseval’s formula that Sn on B ∗ is the adjoint of Sn on B and consequently has the same norm. Similarly, σ n : µ 7→ σn (µ) on B ∗ is the adjoint of ∗ σ n : f 7→ σn (f ) on B and consequently§ kσ n kB = 1. We remark that by Parseval’s formula, for every µ ∈ B ∗ , σn (µ) converges weak-star to µ. 7.3 Parseval’s formula enables us to characterize sequences of Fourier coefficients of linear functionals. Theorem. Let B be a homogeneous Banach space on T. Assume that eint ∈ B for all n. Let {an }∞ n=−∞ be a sequence of complex numbers. Then the following two conditions are equivalent: (a) There exists µ ∈ B ∗ , kµk ≤ C , such that µ ˆ(n) = an for all n. (b) For all trigonometric polynomials P X Pˆ (n)an ≤ CkP kB .
P ROOF : The implication (a) ⇒ (b) follows immediately from Parseval’s formula. If we assume (b) then X (7.6) P 7→ Pˆ (n)an is a linear functional on the space of all trigonometric polynomials, bounded in the B norm, and therefore (theorem 2.12) admits a unique extension µ of norm < C to B . Since µ extends (7.6) we have µ ˆ(n) = heint , µi = an . § kσ
B∗ nk
denotes the norm of σ n as operator on B ∗ .
J
38
A N I NTRODUCTION TO H ARMONIC A NALYSIS
P Corollary. A trigonometric series S ∼ an eint is the Fourier series of some µ ∈ B ∗ , kµk ≤ C , if, and only if, kσN (S)k ≤ C for all N . Here σN (S) denotes the element in B* the Fourier series of which is PN ijt N (1 − |j|/(N + 1))aj e .
P ROOF : The necessity follows from 7.2; the sufficiency from the current theorem and the observation that for trigonometric polynomials P X Pˆ (n)an = lim hP, σN (S)i . J N →∞ 7.4 In the case B = C(T ) the dual space B ∗ is identified R with the space M (T) of all (Borel) measures on T (we set hf, µi = f dµ) We shall refer to Fourier coefficients of measures as Fourier-Stieltjes coefficients and to Fourier series of measures as Fourier-Stieltjes series. The mapping f 7→ (1/2π)f (t)dt is an isometric embedding of L1 (T) in M (T). The Fourier coefficients of (1/2π)f (t)dt are precisely fˆ(n), hence a Fourier series is a Fourier-Stieltjes series. An example of a measure that is not obtained as (1/2π)f (t)dt is the so-called Dirac measure; it is the measure δ of mass one concentrated at t = 0. δ can also be defined by hf, δi = f (0) for all f ∈ C(T). We denote by δτ , τ ∈ T, the unit mass concentrated at τ . Thus δ = δ0 and hf, δτ i = f (τ ) for all τ ∈ T. From (7.1) it follows that δˆτ (n) = e−inτ ˆ and in particular δ(n) = 1. This shows that Fourier-Stieltjes coefficients need not tend to zero at infinity (however, by 7.1, |ˆ µ(n)| ≤ kµkM (T) ). 7.5 We recall that a measure µRis positive if µ(E) ≥ 0 for every measurable set E , or equivalently, if f dµ ≥ 0 whenever f ∈ C(T) is nonnegative. If µ is absolutely continuous, that is, if µ = (1/2π)g(t)dt with g ∈ L1 (T), then µ is positive if and only if g(t) ≥ 0 almost everywhere. P Lemma. A series S ∼ an eint is the Fourier-Stieltjes series of a positive measure if, and only if, for all n and t ∈ T, σn (S, t) =
n X −n
1 − |j|/(n + 1) aj eijt ≥ 0.
P ROOF : If S = S(µ) for a positive µ ∈ M (T) and if f ∈ C(T) is nonnegative, we have 1 2π
Z
f (t)σn (S, t)dt =
n X −n
1−
|j| ˆ µ(j) = σn (f )dµ ≥ 0 f (j)ˆ n+1
I. F OURIER S ERIES ON T
39
since µ ≥ 0 and, by 3.1, σn (f, t) > 0. Since this is true for arbitrary nonnegative f , σn (S, t) ≥ 0 on T. Assuming σn (S, t) ≥ 0 we obtain Z 1 kσn (S)kM (T) = σn (S, t)dt = a0 2π and, by Corollary 7.3, RS = S(µ) for some µ R∈ M (T). For arbitrary nonnegative f ∈ C(T), f dµ = limn→∞ (l/2π f (t)σn (S, t)dt ≥ 0 and it follows that µ is a positive measure. J Remark: The condition “σn (S, t) ≥ 0 for all n” can clearly be replaced by “σn (S, t) ≥ 0 for infinitely many n’s”. 7.6 We are now able to characterize Fourier-Stieltjes coefficients of positive measures as positive definite sequences. D EFINITION : A numerical sequence {an }n∈Z is positive definite if for any sequence {zn } having only a finite number of terms different from zero we have X (7.7) an−m zn z¯m ≥ 0. n,m
Theorem (Herglotz). A numerical sequence {an }n∈Z is positive definite if, and only if, there exists a positive measure µ ∈ M (T) such that an = µ ˆ(n) for all n.
P ROOF : Assume an = µˆ(n) with positive µ. Then Z X 2 X XZ (7.8) an−m zn z¯m = e−int eimt zn z¯m = zn e−int dµ ≥ 0. n,m
n,m
n
If, on the other hand, we assume that {an } is positive definite, we write P S∼ an eint and, for arbitrary N and t ∈ T we choose ( eint |n| ≤ N zn = 0 |n| > N P P We have n,m an−m zn z¯m = j Cj,N aj eijt where Cj,N is the number of ways to write j in the form n − m where |n| ≤ N and |m| ≤ N , that is, Cj,N = max(0, 2N + 1 − |j|). It follows that X 1 Cj,N aj eijt ≥ 0 σ2N (S, t) = 2N + 1 j and the theorem follows from 7.5.
J
40
A N I NTRODUCTION TO H ARMONIC A NALYSIS
7.7
If {an } is positive definite, then |an | ≤ a0 ,
(7.9)
n+1 )} is positive definite. This can be and the sequence {(an − an−1 +a 2 seen directly by checking condition (7.7), or deduced from Herglotz’ theorem and the observations that if µ is the positive measure such that an = µ ˆ(n), then a0 = µ ˆ(0) = kµk, ν = (1 − cos t)µ is nonnegative, and n+1 νˆ(n) = an − an−1 +a . 2 Also, since an = a−n , we have a0 −
Lemma. If {an } is positive definite, then an−1 + an+1 (7.10) ≤ a0 −
Positive definite functions can be defined over any abelian group by the same inequality (7.7). In Chapter VI we shall see that the preceding lemma implies in particular that positive definite functions on R that are continuous at 0 are in fact uniformly continuous.
7.8 The Spectral Theorem. Positive definite sequences arise naturally in the context of unitary operators on a Hilbert space. Let H be a Hilbert space, U a unitary operator on H, and f ∈ H; write an = hU −n f, f i. The sequence {an } is positive definite since for any finite sequence {zn } we have X X an−m zn z¯m = hzn U −n f, zm U −m f i
(7.11)
n,m
n,m
X
2
= zn U −n f ≥ 0. n
H
The positive measure µ = µf ∈ M (T) for which µ ˆ(n) = an is called the spectral measure of f . Comparing (7.8) and (7.11), one realizes that the correspondence (7.12)
H 3 U n f ←→ eint ∈ L2 (µf )
extends to an isometry of the closed span Hf of {U n f } in H onto L2 (µf ), which conjugates U to the operator of multiplication by eit on L2 (µf ). This is in essence¶ the spectral theorem for unitary operators on a Hilbert space. ¶ What
we omit here is the analysis of the multiplicity of U on H.
I. F OURIER S ERIES ON T
41
Corollary (The Ergodic Theorem). Let H be a Hilbert space and U a unitary operator on H. Denote by Hinv the subspace of U -invariant vectors in H, and by Pinv the orthogonal projection of H on Hinv . Then lim
N −1 1 X j U = Pinv , N 0
the limit in the strong operator topology. P −1 j P ROOF : The claim is that for every f ∈ H, lim N1 N U f = Pinv f in 0 norm. By the spectral theorem, we may assume that U is multiplication P −1 j by eit on L2 (µf ), and so N1 N U is just multiplication by 0 ϕN (t) =
N −1 1 X ijt eiN t − 1 e = . N 0 N (eit − 1)
The elements of L2 (µf ) which are invariant under multiplication by e are just the multiples of 11{0} (the indicator function of {0}), and Pinv in this context is multiplication by 11{0} . As kϕN k∞ = 1 and ϕN converge pointwise to 11{0} , we have lim ϕN ψ = ψ(0)11{0} in norm for any ψ ∈ L2 (µf ), and in particular for the constant 1, the image of f under the “spectral” isometry. J it
7.9 An important property of Fourier-Stieltjes coeffcients is that of being "universal multipliers." More precisely: Theorem. Let B be a homogeneous Banach space on T and µ ∈ M (T). There exists a unique linear operator µ on B having the following properties: (i) kµk ≤ kµkM (T) c (n) = µ (ii) µf ˆ(n)fˆ(n) for all f ∈ B . P P ROOF : If an operator µ satisfies (ii), then for f = n−N fˆ(n)eint we P have µf = N ˆ(n)fˆ(n)eint , that is, µ is completely determined on −N µ the polynomials in B . If µ is bounded it is completely determined. In order to show the existence of µ it is suffcient to show that if we define X (7.13) µf = µ ˆ(n)fˆ(n)eint
for all polynomials f then (7.14)
kµf k ≤ kµkM (T) kf kB ,
42
A N I NTRODUCTION TO H ARMONIC A NALYSIS
since µ would then have a unique extension of norm ≤ kµkM (T) to all of B . If µ = (1/2π)g(t)dt with g ∈ C(T), it is clear that µf , as defined in (7.13), is simply g ∗ f which we can write as a B -valued integral (see 2.4) Z 1 (7.15) g(τ )fτ dτ µf = g ∗ f = 2π and deduce the estimate kµf kB ≤ kf kB ·
1 2π
Z
|g(τ )|dτ = kµkM (T) kf kB .
For arbitrary µ ∈ M (T), σn (µ) has the form (1/2π)gn (t)dt, where Pn gn (t) = −n (1 − |j|/(n + 1))ˆ µ(j)eijt and 1 2π
Z
|gn (t)|dt = kσn (µ)kM (T) ≤ kµkM (T) .
By our previous remark kgn ∗f kB ≤ kµkM (T) kf kB . Since f is a trigonometric polynomial, we clearly have µf = limn→∞ gn ∗ f and (7.14) follows. J Corollary. Let f ∈ B and µ ∈ M (T). Then {ˆ µ(n)fˆ(n)} is the sequence of Fourier coefficients of some function in B .
In view of (7.15) we shall write µ ∗ f instead of µf , and refer to it as the convolution of µ and f . With this notation, our earlier condition (ii) becomes a (formal) extension of (1.10). 7.10
(7.16)
For µ ∈ M (T) we define µ# ∈ M (T) by µ# (E) = µ(−E)
for every Borel set E (recall that −E = {t : − t ∈ E}), or equivalently, by Z Z # (7.17) f (t)dµ = f (−t)dµ for all f ∈ C(T). It follows from (7.17) that (7.18)
# (n) = µ µc ˆ(n) .
I. F OURIER S ERIES ON T
43
7.11 By Parseval’s formula, the adjoint of µ is the operator which assigns to every ν ∈ B ∗ the element of B ∗ whose Fourier series is given P Pc by µ ˆ(n)ˆ ν (n)eint = µ# (n)ˆ ν (n)eint . We extend the notation of 7.7, write this element of B ∗ as µ# ∗ ν , and refer to it as the convolution of µ# and ν . We summarize: Theorem. Let B be a homogeneous Banach space on T and B ∗ its P dual. Let µ ∈ M (T), ν ∈ B ∗ ; then µ ˆ(n)ˆ ν (n)eint is the Fourier series ∗ of an element µ ∗ ν ∈ B . Moreover kµ ∗ νkB ∗ ≤ kµkM (T) kνkB ∗ .
The norm estimate follows from (7.14) and the facts that the norm of the adjoint of an operator is equal to the norm of the operator, and kµ# kM (T) = kµkM (T) . P It follows, in particular, that if µ, ν ∈ M (T), then µ ˆ(n)ˆ ν (n)eint is the Fourier-Stieltjes series of the measure µ ∗ ν . 7.12 We have introduced the convolution of µ, ν ∈ M (T) by its Fourier-Stieltjes series. It can, of course, be done directly. With µ and ν given, and for f ∈ C(T), the double integral ZZ I(f ) = f (t + τ )dµ(t)dν(τ )
is well defined, is clearly linear in f , and satisfies |I(f )| ≤ kµkM (T) kνkM (T) .
By the Riesz representation theorem, which identifies M (T) asRthe dual of C(T), there exists a measure λ ∈ M (T) such that I(f ) = f (t)dλ. ˆ Taking f (t) = e−int we obtain λ(n) =µ ˆ(n)ˆ ν (n), that is, λ = µ ∗ ν . In other words Z ZZ (7.19) f d(µ ∗ ν) = f (t + τ )dµ(t)dν(τ ) . Taking a (bounded) sequence of functions f which converge to the indicator function of an arbitrary closed set E , we see that (7.19) is equivalent to (denoting E − τ = {t : t + τ ∈ E}) Z (7.20) (µ ∗ ν)(E) = µ(E − τ )dν(τ ) . By regularity, (7.20) holds for every Borel set E .
44
A N I NTRODUCTION TO H ARMONIC A NALYSIS
P 7.13 We recall that a measure µ ∈ M (T) is discrete if µ = aj δτj P where aj are complex numbers; we then have kµkM (T) = |aj |. A measure µ is continuous if µ(t) = 0 for every t ∈ T ({t} is the set whose only R t+η member is the point t). Equivalently µ is continuous if limη→0 t−η |dµ| = 0 for all t ∈ T. Every µ ∈ M (T) can be uniquely decomposed to a sum µ = µc + µd where µc is continuous and µd is discrete. It is clear from (7.20) that if µ is a continuous measure then, for every ν ∈ M (T), µ ∗ ν is continuous. Also, since δ(τ ) ∗ δ(τ 0 ) = δ(τ + τ 0 ), P P P 0 if µ = aj δτj , and ν = bk δτk0 then µ ∗ ν = j,k aj bk δτj +τk . If µ = µc + µd is the decomposition of µ into continuous and discrete # parts, then µ# and µ# c the continuous part of µ d is its discrete part. Thus # # # µ ∗ µ# = (µc ∗ µ# c + µc ∗ µd + µd ∗ µc ) + µd ∗ µd ,
the sum of the first three terms is continuous and the last term is disP P crete. If µd = aj δτj then µ# ¯j δ−τj and consequently the mass d =P a at τ = 0 of the measure µ ∗ µ# is |aj |2 . We have proved: P Lemma. Let µ ∈ M (T). Then |µ({τ })|2 = (µ ∗ µ# )({0}). In particular: µ is continuous if, and only if, (µ ∗ µ# )({0}) = 0.
The discrete part of a measure µ can be “recovered” from its FourierStieltjes series. Theorem. Let µ ∈ M (T), τ ∈ T. Then N
X 1 µ ˆ(n)einτ . N →∞ 2N + 1
µ({τ }) = lim
−N
P −inτ int e P ROOF : The functions ϕN (t) = 2N1+1 DN (t−τ ) = 2N1+1 N −N e are bounded by 1 and tend to zero uniformly outside any neighborhood of t = τ . Remembering that Z τ +ϑ |d(µ − µ({τ })δτ )| = 0 lim ϑ→0
τ −ϑ
we obtain (7.21)
lim hϕN , µ − µ({τ })δτ i = 0
N →∞
I. F OURIER S ERIES ON T
45
Now N
hϕN , µ − µ({τ })δτ i =
X 1 µ ˆ(n)einτ − µ({τ }) 2N + 1 −N
and the theorem follows from (7.21).
J
Corollary (Wiener). Let µ ∈ M (T). Then N
(7.22)
X
X 1 |ˆ µ(n)|2 . N →∞ 2N + 1
|µ({τ })|2 = lim
−N
In particular: µ is continuous if, and only if, N
(7.23)
X 1 |ˆ µ(n)|2 = 0. lim N →∞ 2N + 1 −N
Remarks: a. The averaging that appears in the Theorem and in the corollary need not be on intervals symmetric with respect to 0. If {Mj } is an arbitrary sequence of integers, and Nj → ∞, then for all τ ∈ T (7.24)
Mj +Nj X 1 µ({τ }) = lim µ ˆ(n)einτ . j→∞ Nj + 1 Mj
The proof as above, with ϕN replaced by Φj =
1 Nj +1
PMj +Nj Mj
eint .
b. The exponent 2 in (7.22) is essential, in (7.23) it can be replaced by any positive number. What the condition really says is that µ ˆ(n) tends to zero in density, that is: given ε > 0, the proportion in all sufficiently large intervals, of the integers n such that |ˆ µ(n)| > ε, is arbitrarily small. In particular, for every ε > 0 and positive N there exist in any sufficiently large interval on Z, intervals of length N , on which |ˆ µ| < ε.
EXERCISES FOR SECTION 7 1. Let B be homogeneous on T and B ∗ its dual. Show that S ∼ an eint ∗ is the Fourier series of some µ ∈ B if and only if kσN (S)k is bounded as N → ∞. 2. Denote Kn,τ (t) = KN (t − τ ). Show that for every µ ∈ M (T)
P
σn (µ, τ ) = hKn,τ , µi .
46
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Deduce that σn (µ, τ ) ≥ 0 if µ is positive. P PN 3. Show that a trigonometric series an eint such that −N an eint ≥ 0 for all N and t ∈ T is a Fourier-Stieltjes series of a positive measure. 4. We shall prove later (see IV.2.1) that if f ∈ Lp (T) with 1 < p ≤ 2, then kfˆk`q =
X
|fˆ(n)|q
1/q
≤ kf kLp (T)
q=
p ,. p−1
Assuming this, show that if {an } ∈ `p is a numerical sequence then there exists a function g ∈ Lq (T) such that gˆ(n) = an , and kgkLq (T) ≤ k{an }k`p . 5. The elements of the dual space of C m (T) are called distributions of order m on T. We denote by Dm (T) = (C m (T))∗ the space of distributions of order m on T. Since C m+1 (T) ⊂ C m (T) we have Dm (T) ⊂ Dm+1 (T). Write D(T) = ∪m Dm (T). (a) Prove that if µ ∈ Dm then |ˆ µ(n)| ≤ const |n|m
n 6= 0.
(b) Given a numerical sequence {an } satisfying an = O (|n|m ), there exists a distribution µ ∈ Dm+1 such that an = µ ˆ(n) for all n. P Hint: If f ∈ C m+1 (T) then |nm fˆ(n)| < ∞. P Thus a trigonometric series an eint is the Fourier series of a distribution on T if and only if, for some m, an = O (|n|m ) n 6= 0. Let µ ∈ D and let O be an open subset of T. We say that µ vanishes on O if hϕ, µi = 0 for all ϕ ∈ C ∞ (T) such that the support of ϕ (i.e., the closure of the set {t : ϕ(t) 6= 0}) is contained in O. (c) Prove that if µ vanishes on the open sets O1 and O2 , then it vanishes on O1 ∪ O2 . Hint: Show that if the support of ϕ ∈ C ∞ (T) is contained in O1 ∪ O2 then there exist ϕ1 , ϕ2 ∈ C ∞ (T), with supports contained in O1 , O2 respectively, such that ϕ = ϕ1 + ϕ2 . (d) Extend the result of (c) to any finite union of open sets; hence, using the compactness of the support of the test functions ϕ, show that if µ vanishes in S the open sets Oα , α running over some index set I , then µ vanishess on Oα . α∈I Thus the union of all the open subsets of T on which µ vanishes is again such a set. This is clearly the largest open set on which µ vanishes.
D EFINITION : The support of µ is the complement in T of the largest open set O ⊂ T on which µ vanishes. (e) Show that if µ ∈ Dm and if f ∈ C m (T) vanishes on a neighborhood of the support of µ, then hf, µi = 0. The same conclusion holds if for some homogeneous Banach space B , the distribution µ belongs to B ∗ and f ∈ B (see exercise 2.11).
I. F OURIER S ERIES ON T
47
(f) We define the derivative µ0 of a distribution µ ∈ Dm by hf, µ0 i = −hf 0 , µi
for f ∈ C m+1 (T).
Show that µ0 ∈ Dm+1 and µb0 (n) = in µ ˆ(n).
(g) Show that support(µ0 ) ⊂ support(µ).
(h) Show that the map µ 7→ µ0 maps Dm onto the subspace of Dm+1 consisting of all µ ∈ Dm+1 satisfying µ ˆ(0) = 0. Hence, every µ ∈ Dm can be written in the form µ ˆ(0)dt + µ1 where µ1 is the mth derivative of a measure. (i) A distribution µ on T is positive if hf, µi ≥ 0 for every nonnegative test function f ∈ C ∞ (T). Show that a positive distribution is a measure. Hint: Positivity implies, for real-valued f , hf, µi ≤ max f (t)h1, µi. 6. The dual space of A(T) is commonly denoted by P M (T) and its elements referred to as pseudo-measures. Show that with the natural identifications M (T) ⊂ P M (T) ⊂ D1 (T), and P M (T) consists precisely of those µ for which {ˆ µ(n)} is bounded. Moreover, the correspondence µ ↔ {ˆ µ(n)} is an isometry of P M (T) onto `∞ . 7. Let α, β ∈ T, let N be an integer, and let µ be the measure carried by the arithmetic progression {α + jβ}N j=−N , which places the mass zero at α and the mass j −1 at α + jβ, 1 ≤ |j| ≤ N . Show that kµkP M (T) ≤ π + 2. Hint: See exercise 3.4. 8. Let f ∈ A(T) be real valued and monotonic in a neighborhood of t0 ∈ T. Show that |f (t) − f (t0 )| = O (log|t − t0 |−1 )−1 as t → t0 . 9. Let µ, µn ∈ M (T), n = 1, 2, . . . . Prove that µn → µ in the weak-star topology if, and only if, kµn kM (T) = O (1) and µ ˆn (j) → µ ˆ(j) for all j . 10. By definition, a sequence {ξn }∞ ⊂ T is uniformly distributed if for n=1 PN any arc I ⊂ T we have limN →∞ N −1 n=1 11I (ξn ) = (2π)−1 |I|. Prove the following statements: Pn −1 a. {ξn }∞ δ n=1 ⊂ T is uniformly distributed if, and only if, µn = n 1 ξj converge in the weak-star topology to (2π)−1 dt, i.e., if for all integers l 6= 0, Pn n−1 1 eilξj → 0. (Weyl’s criterion). b. if α is an irrational multiple of π , the sequence {nα} is uniformly distributed on T. 11. Show that a measure µ ∈ M (T) is absolutely continuous if, and only if, limτ →0 kµτ − µk = 0, where µτ is the translate of µ by τ (defined by µτ (E) = µ(E − τ )). 12. Let µ ∈ M (T). Prove: σn (µ, t) converge to zero at every t 6∈ support(µ), the convergence uniform on every closed set disjoint from support(µ). 13. Let µ ∈ M (T) be singular with respect to dt (that is, there exists a Borel set E0 of Lebesgue measure zero, such that µ(E) = µ(E ∩ E0 ) for every Borel set E ). Show that σn (µ, t) → 0 almost everywhere (dt).
48
A N I NTRODUCTION TO H ARMONIC A NALYSIS
14. Show that the conclusion of exercise 12 is false if we assume µ ∈ D1 instead of µ ∈ M (T); however, if we replace Fejér’s kernel by Poisson’s, the conclusion is valid for every µ ∈ D. m = 0 uniformly Hint: For 0 < δ < π , and positive integers m, limr→1 ∂ ∂tP(r,t) m in (δ, 2π − δ). 15. (Bernstein’s inequality) Let tj,n = (2j+1)π , and δj,n = δtj,n . Write 4n 2n−1 1 X δj,n , 2n
µn =
νn = Kn (t)µn .
0
(a) Check that kνn k = νˆn (0) = 1. (b) Write νn∗ = neint νn , then kνn∗ k = n, and νbn∗ (j) is periodic of period 4n and νn∗ (j)
b
=
(
j
for |j| ≤ n,
2n − j
for n ≤ j ≤ 3n.
(c) Prove Bernstein’s inequality: if P =
Pn
−n
aj eijt , then
kP 0 k∞ ≤ n kP k∞ .
(7.25) Hint: P 0 = νn∗ ∗ P . (d) Prove that if P =
Pn
−n
aj eijt , then kPe0 k∞ ≤ n kP k∞ .
Hint: Find a measure µn of norm n such that µ ˆn (j) = |j| for |j| ≤ n. (e) Let B be a homogeneous Banach space on T, and P = Prove that kP 0 kB ≤ nkP kB , and kPe0 kB ≤ n kP kB . 8
Pn
−n
aj eijt ∈ B .
ADDITIONAL COMMENTS AND APPLICATIONS
8.1 Approximation by trigonometric polynomials. The order of magnitude of the Fourier coefficients of a function f gives some indication of the smoothenss of the function. We get more precise information from the rapidity of the approximation of f by trigonometric polynomials (as a function of their degree), or from the decomposition of f into a series of polynomials given by (8.8) below. For ϕ ∈ C(T) denote En (ϕ) = infkϕ − P k∞ , the infimum for all trigonometric polynomials P of degree ≤ n. If m is a positive integer and 0 < η < 1, C m+η (T) denotes the space {f ∈ C m (T) : f (m) ∈ Lipη }, endowed with the norm kf kC m+η = kf kC m (T) + kf (m) kLipη .
I. F OURIER S ERIES ON T
49
Theorem (Jackson). Let m be a non-negative integer, and 0 ≤ η < 1. If f ∈ C m+η (T), then: (8.1) En (f ) = O n−m−η .
The converse of the statement is true provided η > 0. See 8.3 below. The proof will use the information we have in the exercises for Section 3, Bernstein’s inequality for derivatives of polynomials (exercise 7.15 above), and the “reverse inequality” which is discussed in the following subsection. 8.2
The “reverse Bernstein inequality”.
Theorem. Let m be a positive integer. There exist a constant Cm such P that if f = |j|≥n aj eijt ∈ C m (T), then kf k∞ ≤ Cm |n|−m kf (m) k∞ .
(8.2)
P ROOF : We prove the following statement: given positive integers m and n, there exist measures µm,n such that −m (8.3) µd m,n (j) = j
for
|j| ≥ n,
and
kµm,n kM (T) ≤ Cm n−m .
Since f = im µm,n ∗ f (m) , this clearly implies (8.2). Denote by φm,n the positive function in L1 (T) whose Fourier coefficients are given by ( j −m for |j| ≥ n d φm,n (j) = −m −m −m n + (n − |j|)(n − (n + 1) ) for |j| < n.
The coefficients in the range |j| < n are chosen so as to fulfill the conditions of Theorem 4.1: they are symmetric, linear in [0, n + 1] with slope matching that of {j −m } on [n, n + 1], so that φd m,n (j) is convex on [0, ∞). It follows that −m kφm,n kL1 = φd . m,n (0) < (m + 1)n
For even m set µm,n = φm,n dt and obtain Cm = m + 1. For m = 1, we use the polynomials Ψn,k = ei2
k
nt
1 k+1 K2k (n−1) + ei2 nt K2k (n−1) , 2
50
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Clearly kΨn,k kL1 (T) ≤ 3/2, Ψd n,k (j) = 0 for negative j , while for j ≥ n P∞ d Ψ (j) = 1 (with one or two non-zero summands for each j ). It k=0 n,k follows that the function Φ∗n (t) =
∞ X
Ψn,k ∗ φ1,n2k
k=0
c∗n (j) = 0 for j ≤ 0, Φ c∗n (j) = 1/j for all j ≥ n, and satisfies: Φ
X
∗ (8.4) kφ1,n2k k ≤ 6n−1 .
Φn 1 ≤ 3/2 L (T)
We set µ1,n = Φ∗n (t) − Φ∗n (−t) dt, and (8.2) holds with C1 = 12. Finally, for m = 2l + 1 we set µm,n = µ1,n ∗ µ2l,n and Cm = 12m.
For polynomials of the form P =
P
n≤|j|≤4n
J
aj eijt we have
−1 m Cm n kP k∞ ≤ kP (m) k∞ ≤ (4n)m kP k∞ .
(8.5)
Moreover, the same holds if we replace k k∞ by the norm of any homogeneous Banach space on T. 8.3 Lemma. Let Pk be trigonometric polynomials of degrees bounded P by 2k and kPk k∞ = O 2−(m+η)k . Then f = Pk ∈ C m+η (T). P ROOF : By Bernstein’s inequality, we have kPk kC m (T) = O 2−ηk so the series converges in C m (T), and f ∈ C m . Focusing on Pk(m) we have (m) (m+1) (8.6) k∞ = O 2(1−η)k , kPk k∞ = O 2−ηk , and kPk
which imply (8.7)
(m) |Pk (t
+ h) −
(m) Pk (t)|
≤
(
C|h|2k(1−η) ) C2
−kη
for |h| ≤ 2−kη for |h| ≥ 2−kη
the constant C coming from the O bound. For any h and any t ∈ T, X X (m) f (t+h)−f (m) (t) ≤ C |h|2k(1−η) + 2−kη ≤ C1 |h|η , |h|≤2−kη
and f ∈ C m+η (T).
|h|≥2−kη
J
I. F OURIER S ERIES ON T
51
If f ∈ C(T), n ≥ 2, the polynomial Wn (f ) = (V2n − Vn ) ∗ f is of the P form n≤|j|≤4n aj eijt . We set W1 (f ) = V2 ∗ f , and have X (8.8) f = lim V2k ∗ f = W2k (f ). k≥1
Notice that, since kV2n − Vn kL1 (T) < 6, we have, for any homogenous Banach space B on T, (8.9)
kWn (f )kB ≤ 6 kf kB .
Theorem. Let m ≥ 0 be an integer and 0 < η < 1. A necessary and sufficient condition for f to be in C m+η (T) is (8.10) kWn (f )k∞ = O n−m−η .
For η = 0, the condition (8.10) is necessary, but not sufficient.
P ROOF : For any g , Wn (g) = 2(K4n ∗ g − g) − 3(K2n ∗ g − g) + (Kn ∗ g − g), and hence (8.11)
kWn (g)k∞ ≤ 6
max kσk (g) − gk∞ .
k=n,2n,4n
Combine this (for g = f (m) , where f ∈ C m+η , and 0 < η < 1,) with exercise 2 at the end of Section 3, and obtain (8.12)
kWn (f (m) )k∞ ≤ Ckf (m) kLipη n−η ,
where C is a universal constant. By (8.5), and the fact that convolution commutes with differentiation, thus kWn (f )k∞ ≤ Ckf kC m+η n−(m+η) , and we proved the “necessary” part of the theorem. For the proof that condition (8.10) is sufficient, write Pk = W2k (f ) and apply the lemma. J This is essentially Jackson’s theorem. Our estimate of Wn (f ) was based on the estimate kσn (f (m) ) − f (m) k∞ ≤ Ckf kC m+η n−η , which implies the same (with a different constant) for kVn ∗ f (m) − f (m) k∞ , and the “reverse Bernstein inequality” gives† En (f ) ≤ kVn ∗ f − f k∞ ≤ Ckf kC m+η n−(m+η) .
This is the “direct” side of Jackson’s theorem. The “converse” follows from the current theorem combined with the observation that for any polynomial P of degree less than 2k we have W2k (f ) = W2k (f − P ), hence kW2k (f )k∞ ≤ E2k−1 (f ). † This
is the reason we use Vn rather than σn : for f = cos t, σn (f ) − f = n−1 f .
52
A N I NTRODUCTION TO H ARMONIC A NALYSIS
8.4 One application of Theorem 8.2 is the fact that if f ∈ C m+η , e ], the conjugate where m ≥ 0 is an integer, and 0 < η < 1, then S[f Fourier series of f , is also the Fourier series of a function in C m+η . In the terminology of the next chapter, C m+η admits conjugation. This follows from P Lemma. Let P be a polynomial of the form P = n≤|j|≤4n aj eijt , and P sgn (j)aj eijt . Then Pe its conjugate, Pe = n≤|j|≤4n
kPek∞ ≤ 7kP k∞ .
P ROOF : Pe = P − 2(e−i 3nt V2n ∗ P ).
J
Theorem. C m+η admits conjugation. P P ROOF : With some abuse of notation we may write f˜ = n≥1 W^ 2n (f ), use the lemma, and invoke Theorem 8.2. J
8.5 Multipliers on Fourier coefficients. Let B and B1 be homogeneous Banach spaces on T and let T be an operator from B into B1 which commutes with translations. Then, for all n, T eint = t(n)eint P and for f ∈ B the Fourier series of T f is t(n)fˆ(n)eint . In other words, T is expressed as a multiplier on the Fourier coefficients of f . We have seen concrete examples of this when T was differentiation, or convolution by a fixed measure, and just in the previous subsection— conjugation, for which the multiplier is t(n) = sgn (n). The proof of Theorem 8.4 can be imitated for other multipliers. ForP mally, if {t(n)} is given, the operator T : f 7→ t(n)fˆ(n)eint is well defined for polynomials f . If we denote kT kn the norm of the multiplier restricted to the sup-normed space of trigonometric polynomials of the P form 2n ≤|j|≤2n+2 aj eijt , then the proof of Theorem 8.4 consisted in the observation that kT kn is uniformly bounded when t(n) = sgn (n). The same argument, using Theorem 8.2, proves r1 r2 Theorem. A sequence {t(n)} is a multiplier C 7→ C , r2 6∈ Z, if and ∗ n(r2 −r1 ) only if kT kn = O 2 . In particular, this is true if
(8.13)
X
2n ≤|j|≤2n+2
|t(n)|2 = O 22n(r2 −r1 ) .
I. F OURIER S ERIES ON T
53
P ROOF : We check that (8.13) implies the estimate kT kn = O 2n(r2 −r1 ) . P For polynomials of the form 2n ≤|j|≤2n+2 aj eijt the operator T is the P convolution with the kernel Tn (t) = 2n ≤|j|≤2n+2 t(j)eijt , and its norm is bounded by kTn kL1 (T) ≤ kTn kL2 (T) . J
8.6 The difference equation. Given a function f ∈ L1 (T) and α ∈ T, we are asked to find g such that
(8.14)
g(t + α) − g(t) = f (f ).
Under what condition can this be done and what can be said about the “solution” g ? Formally the solution is obvious, at least if g ∈ L1 (T): (8.14) is satisfied if, and only if, (8.15)
for all n ∈ Z
gˆ(n)(einα − 1) = fˆ(n),
in other words, we need to set gˆ(0) = 0 and (8.16)
gˆ(n) = (einα − 1)−1 fˆ(n),
and the question becomes that of identifying (pairs of) spaces on which the sequence (einα − 1)−1 is a multiplier. The answer depends on the diophantine properties of α, i.e., on the rate of growth of (einα − 1)−1 . Theorem. If |einα − 1| ≥ C|n|−γ then the sequence {(einα − 1)−1 } is a multiplier C r1 (T) 7→ C r2 (T) whenever r1 − r2 > γ . If r2 is not an integer, the same holds for r1 − r2 = γ . Lemma. Let {zj }M −M ⊂ T be such that for j 6= k , |zj − zk | ≥ a, and P |zj − 1| ≥ a. Then |zj − 1|−2 ≤ 4a−2 .
P ROOF : The worst estimate is obtained when the points are packed as close to 1 as the condition permits, that is, for zj = eija , j 6= 0, and z0 = ei(M +1)a . J P ROOF OF THE THEOREM . The lemma, with M = 2n+2 and a = C2−nγ , implies X |(einα − 1)|−2 = O 22nγ . 2n ≤|j|≤2n+2
Now apply theorem 8.5.
J
54
A N I NTRODUCTION TO H ARMONIC A NALYSIS
EXERCISES FOR SECTION 8 1. Show that if m is an integer, the condition En (f ) = o n−m log n is necessary for f ∈ C m (T) but is not sufficient. Show also that the condition P 2km E2k (f ) < ∞ is sufficient; is it necessary? k 2. Let B be a homogenoeous Banach space on T. For f ∈ B consider the B -valued function ϕ(τ ) = fτ . Prove that if ϕ is differentiable at some τ0 ∈ T, it is uniformly differentiable on T, and that this happens if, and only if, f 0 ∈ B . 3. Let B be a homogeneous Banach space on T and assume that, for some 1 ≤ p < ∞, k · kB is equivalent to k{kW2n ( · )kB }k`p . Prove that B admits conjugation
Chapter II
The Convergence of Fourier Series
We have mentioned already that the problems of convergence of Fourier series, that is, the convergence of the (symmetric) partial sums, Sn (f ), are far more delicate than the corresponding problems of summability with respect to "good" summability kernels such as Fejér’s or Poisson’s. As in the case of summability, problems of convergence "in norm" are usually easier than those of pointwise convergence. Many problems, concerning pointwise convergence for various spaces, are still unsolved and the convergence almost everywhere of the Fourier series of square summable functions was proved only recently (L. Carleson 1965). Convergence is closely related to the existence and properties of the conjugate function. In this chapter we give only a temporary incomplete definition of the conjugate function. A proper definition and the study of the basic properties of conjugation are to be found in chapter III. 1
CONVERGENCE IN NORM
1.1
(1.1)
Let B be a homogeneous Banach space on T. As usual we write Sn (f ) = Sn (f, t) =
n X
fˆ(j)eijt .
−n
We say that B admits convergence in norm if (1.2)
lim kSn (f ) − f kB = 0.
n→∞
Our purpose in this section is to characterize the spaces B which have this property. We have introduced the operators Sn : f 7→ Sn (f ) in chapter I. Sn is well defined in every homogeneous Banach space B ; we denote its norm, as an operator on B , by kSn kB . 55
56
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Theorem. A homogeneous Banach space B admits convergence in norm if, and only if, kSn kB are bounded (as n → ∞), that is, if there exist a constant K such that kSn (f )kB ≤ Kkf kB
(1.3) for all f ∈ B and n > 0.
If Sn (f ) converge to f for all f ∈ B , then Sn (f ) are bounded for every f ∈ B . By the uniform boundedness theorem, it follows that kSn kB = O(1). On the other hand, if we assume (1.3), let f ∈ B, ε > 0, and let P be a trigonometric polynomial satisfying kf − P kB ≤ ε/2K . For n greater than the degree of P , we have Sn (P ) = P and hence PROOF :
kSn (f ) − f kB =kSn (f ) − Sn (P ) + P − f kB ≤kSn (f − P )kB + kP − f kB ≤ K
1.2
ε ε + ≤ ε. 2K 2K
J
The fact that Sn (f ) = Dn ∗ f , where Dn , is the Dirichlet kernel
(1.4)
Dn (t) =
n X −n
eijt =
sin(n + 1/2)t sin t/2
yields a simple bound for kSn kB . In fact, kDn ∗ f kB ≤ kDn kL1 kf kB , so that kSn kB ≤ kDn kL1 .
(1.5)
The numbers Ln = kDn kL1 are called the Lebesgue constants; they tend to infinity like a constant multiple of log n (see exercise 1 at the end of this section). In the case B = L1 (T) the inequality (1.5) becomes an equality. This can be seen as follows: denote by KN the Fejér kernel and remember 1 that kKN kL1 = 1. We have kSn kL ≥ kSn (KN )kL1 = kσN (Dn )kL1 and since σN (Dn ) → Dn , as N → ∞, we obtain kSn kL
1
(T)
≥ kDn kL1 ;
hence kSn kL
1
(T)
= kDn kL1 .
It follows that L1 (T) does not admit convergence in norm.
II. T HE C ONVERGENCE OF F OURIER S ERIES
57
1.3 In the case B = C(T) convergence in norm is simply uniform convergence. We show that Fourier series of continuous functions need not converge uniformly by showing that kSn kC(T) are unbounded; more precisely we show that kSn kC(T) = Ln . For this, we consider continuous functions ψn satisfying kψn k∞ = supt |ψn (t)| ≤ 1
and such that ψn (t) = sgn (Dn (t)) except in small intervals around the points of discontinuity of sgn (Dn (t)). If the sum of the lengths of these intervals is smaller than ε/2n, we have Z 1 kSn kC(T) ≥ |Sn (ψn , 0)| = Dn (t)ψn (t) dt > Ln − ε 2π which, together with (1.5), proves our statement. 1.4 For a class of homogeneous Banach spaces on T, the problem of convergence in norm can be related to invariance under conjugation. In chapter I we defined the conjugate series of a trigonometric series P P an eint to be the series −i sgn (n)an eint . If f ∈ L1 (T) and if the Pˆ series conjugate to f (n)eint is the Fourier series of some function 1 g ∈ L (T), we call g the conjugate function of f and denote it by f˜. This definition is adequate for the purposes of this section; however, it does not define f˜ for all f ∈ L1 (T) and we shall extend it later. D EFINITION : A space of functions B ⊆ L1 (T) admits conjugation if for every f ∈ B, f˜ is defined and belongs to B . If B is a homogeneous Banach space which admits conjugation, then the mapping f 7→ f˜ is a bounded linear operator on B . The linearity is evident from the definition and in order to prove the boundedness we apply the closed graph theorem. All that we have to do is show that the operator f 7→ f˜ is closed, that is, that if lim fn = f and lim f˜n = g in B , then g = f˜. This follows from the fact that for every integer j ˆ gˆ(j) = lim f˜n (j) = lim −i sgn (j)fˆn (j) = −i sgn (j) lim fˆn (j) n→∞
n→∞
n→∞
ˆ = −i sgn (j)fˆ(j) = f˜(j).
If B admits conjugation then the mapping ∞
(1.6)
f 7→ f [ =
X 1ˆ 1 f (0) + (f + if˜) ∼ fˆ(j)eijt 2 2 0
58
A N I NTRODUCTION TO H ARMONIC A NALYSIS
is a well-defined, bounded linear operator on B . Conversely, if the mapping f 7→ f [ is well-defined in a space B , then B admits conjugation since f˜ = −i(2f [ − f − f (0)). Theorem. Let B be a homogeneous Banach space on T and assume that for f ∈ B and for all n, eint f ∈ B and keint f kB = kf kB .
(1.7)
Then B admits conjugation if, and only if, B admits convergence in norm.
P ROOF : By Theorem 1.1 and the foregoing remarks, it is clearly sufficient to prove that the mapping f 7→ f [ is well defined in B if, and only if, the operators Sn are uniformly bounded on B . Assume first that there exists a constant K such that kSn kB ≤ K . Define (1.8)
Sn[ (f ) =
2n X
fˆ(j)eijt = eint Sn (e−int f );
0
by (1.7) we have kS[ kB ≤ K . let f ∈ B and ε > 0; let P ∈ B be a trigonometric polynomial satisfying kf − P kB ≤ ε/2K . We have (1.9)
kSn[ (f ) − Sn[ (P )kB = kSn[ (f − P )kB ≤
ε . 2
[ If n and m are both greater than the degree of P , Sn[ (P ) = Sm (P ) and it follows from (1.9) that [ kSn[ (f ) − Sm (f )kB ≤ ε.
The sequence {Sn[ (f )} is thus a Cauchy sequence in B ; it converges and P ˆ ijt [ [ its limit has the Fourier series ∞ 0 f (j)e . So f = lim Sn (f ) ∈ B . [ Assume conversely that f 7→ f is well defined, hence bounded, in B . Then Sn[ f = f [ − ei(2n+1)t (e−i(2n+1)t f )[ which means that kS[n kB is bounded by twice the norm over B of the mapping f 7→ f [ . Since, by (1.7) and (1.8), kSn kB = kS[n kB , the theorem follows. J
II. T HE C ONVERGENCE OF F OURIER S ERIES
59
1.5 We shall see in chapter III that, for 1 < p < ∞, Lp (T) admits conjugation, hence: Theorem. For 1 < p < ∞, the Fourier series of every f ∈ Lp (T) converges to f in the Lp (T) norm.
EXERCISES FOR SECTION 1 1. Show that the Lebesgue constants Ln = kDn kL1 (T) , satisfy Ln = 4/π 2 log n + O (1). Hint:† Z π n−1 Z (j+1)π X sin(n + 21 )t n+1/2 |sin(n + 1 )t| 1 2 dt = 2 Ln = dt + O (1) ; π 0 sin t/2 π t jπ j=1
remember that
Z
n+1/2
(j+1)π n+1/2
|sin(n + 1/2)t|dt = jπ n+1/2
2 . n+1
2. Show that if the sequence {Nj } tends to infinity fast enough, then the Fourier series of the function f (t) =
∞ X
2−j KNj (t)
1
does not converge in L1 (T). 3. Let {an } be an even sequence of positive numbers, convex on (0, ∞) and at infinity (cf. I.4.1). Prove that the partial sums of the series P vanishing an eint are bounded in L1 (T) if, and only if, an log n = O (1) and the series converges in L1 (T) if, and only if, lim an log n = 0. 4. Show that B = C m (T) does not admit convergence in norm. Hint: Sn commute with derivation. 5. Let ϕ be a continuous, concave (i.e., ϕ(h) + ϕ(h + 2δ) ≤ 2ϕ(h + δ)), and increasing function on [0, 1], satisfying ϕ(0) = 0. Denote by Λϕ the subspace of C(T) consisting of the functions f for which, as h → 0, ω(f, h) = O (ϕ(h)). Denote by λϕ the subspace of Λϕ consisting of the functions f for which ω(f, h) = o(ϕ(h)) as h → 0. (ω(f, h) is the modulus of continuity of f ; see I.4.6.) Consider the followingstatements: (a) ϕ(h) = O −(log h)−1 as h → 0. (b) For every f ∈ λϕ S[f ] is uniformly convergent. (c) ϕ(h) = o(−(log h)−1 ) as h → 0. (d) For every f ∈ Λϕ , S[f ] is uniformly convergent. Show that (a) is equivalent to (b) and that (c) is equivalent to (d). † For
another way, see [16].
60 2
A N I NTRODUCTION TO H ARMONIC A NALYSIS CONVERGENCE AND DIVERGENCE AT A POINT
We have seen in the previous section that the Fourier series of a continuous function need not converge uniformly. In this section we show that it may even fail to converge pointwise, and then give two criteria for the convergence of Fourier series at a point. 2.1 Theorem. There exists a continuous function whose Fourier series diverges at a point.
We give two proofs which are in fact one; the first is "abstract" based on the Uniform Boundedness Principle, and is very short. The second is a construction of a concrete example in essentially the way one proves the Uniform Boundedness Principle.
P ROOF A: The mappings f 7→ Sn (f, 0) are continuous linear functionals on C(T), We saw in the previous section that these functionals are not uniformly bounded and consequently, by the Uniform Boundedness theorem, there exists an f ∈ C(T) such that {Sn (f, 0)} is not bounded. In other words, the Fourier series of f diverges unboundedly at t = 0. J P ROOF B: As we have seen in section 1, there exists a sequence of functions ψn ∈ C(T) satisfying: kψn k∞ ≤ 1,
(2.1)
|Sn (ψn , 0)| >
(2.2)
1 1 kDn kL1 > log n. 2 10
We put ϕn (t) = σn2 (ψn , t) and notice that ϕn is a trigonometric polynomial of degree n2 satisfying kϕn k∞ ≤ 1,
(2.1’)
|Sn(ϕn ,t) − Sn(ψn ,t) | < 2
and hence
|Sn (ϕn , 0)| >
(2.2’)
1 log n − 2. 10
n
With λn = 23 we define (2.3)
f (t) =
X 1 ϕλ (λn t) n2 n
II. T HE C ONVERGENCE OF F OURIER S ERIES
61
and claim that f is a continuous function whose Fourier series diverges at t = 0. The continuity of f follows immediately from the uniform convergence of the series in (2.3); to show the divergence of the Fourier P iλj t series of f at zero, we notice that ϕλj (λj t) = m ϕ d ; hence λj (m)e |S λ2n (f, 0)| = |Sλ2n
(2.4)
∞ n X X 1 1 ϕ (λ t), 0 + ϕ d (0)| j 2 λj 2 λj j j n+1 1
∞ n−1 X 1 1 X 1 = ϕ (0) + S (ϕ , 0) + ϕ d (0) λ λ λ λ j n n j 2 2 2 j n j 1 n+1
≥
K log λn − 3, n2
which tends to ∞, and the theorem follows. Remark: f (t) =
m−1 X 1
J
∞
X 1 1 ϕ (λ t) + ϕλ (λn t). λ n n n2 n2 n n
The first sum is a trigonometric polynomial and so does not affect the convergence of the Fourier series of f . The second sum is periodic with period 2π/λm (since λm divides λk for k ≥ m); consequently the partial sums of the Fourier series of f are unbounded at every point of the form 2πj/λm for any positive integers j and m. If we want to obtain divergence at every rational multiple of 2π , all that we have to do is put n λn = n!23 . 2.2 Our first convergence criterion is really a simple Tauberian theorem due to Hardy. Theorem. Let f ∈ L1 (T) and assume 1 fˆ(n) = O (2.5) as |n| → ∞. n
Then Sn (f, t) and σn (f, t) converge for the same values of t and to the same limit. Also, if σn (f, t) converges uniformly on some set, so does Sn (f, t).
P ROOF : The condition (2.5) implies the following weaker condition which is really all that we need: for every ε > 0 there exists a λ > 1 such that X (2.5’) |fˆ(j)| < ε. lim sup n→∞
n≤|j|≤λn
62
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Let ε > 0 and let λ > 1 be such that (2.5’) is valid. We have Sn (f, t) =
(2.6)
[λn] + 1 n+1 σ[λn] (f, t) − σn (f.t) [λn] − n [λn] − n |j| ˆ [λn] + 1 X 1− − f (j)eijt . [λn] − n [λ] + 1 n≤|j|≤λn
(where [λn] denotes the integral part of λn). By (2.5’) there exists an n0 such that if n > n0 , the last term in (2.6) is bounded by ε. If σn (f, t0 ) converge to a limit σ(f, t0 ), it follows from (2.6) that for n1 sufficiently large, n > n1 implies |Sn (f, t0 ) − σ(f, t0 )| < 2ε,
(2.7) in other words, (2.8)
lim Sn (f, t0 ) = σ(f, t0 ).
The choice of n1 depends only on the rate of convergence of σn (f, t0 ) to σ(f, t0 ) so that if this convergence is uniform on some set, so is (2.8). J Corollary. Let f be of bounded variation on T; then the partial sums Sn (f, t) converge to 12 (f (t + 0) + f (t − 0)) and in particular to f (t) at every point of continuity. The convergence is uniform on closed intervals of continuity of f .
P ROOF : By Fejér’s theorem the foregoing holds true for σn (f, t), and the statement follows from the fact that for functions of bounded variation, (2.5) is valid (cf. Theorem I.4.5). J R1 2.3 Lemma. Let f ∈ L1 (T) and assume −1 f (t) t dt < ∞. Then lim Sn (f, 0) = 0.
P ROOF : Sn (f, 0) =
(2.9)
Z
f (t) sin(n + 1/2)t dt = sin 2t Z Z 1 1 f (t) cos t/2 f (t) cos ntdt + sin tdt 2π 2π sin t/2 1 2π
cos t/2 By our assumption f (t) ∈ L1 (T); hence, by the Riemann-Lebesgue sin t/2 lemma, all the integrals in (2.9) tend to zero. J
II. T HE C ONVERGENCE OF F OURIER S ERIES
63
2.4 Theorem (Principle of localization). Let f ∈ L1 (T) and assume that f vanishes in an open interval I . Then Sn (f, t) converge to zero for t ∈ I , and the convergence is uniform on closed subsets of I .
P ROOF : The convergence to zero at every t ∈ I is an immediate consequence of Lemma 2.3. If I0 is a closed subinterval of I , the functions f (t − t0 ) cos t/2 ϕt0 (t) = , t0 ∈ I0 , form a compact family in L1 (T), sin t/2 hence by Remark I.2.8, the integrals in (2.9) corresponding to f (t − t0 ), t0 ∈ I0 , tend to zero uniformly. J The principle of localization is often stated as follows: let f, g ∈ L1 (T) and assume that f (t) = g(t) in some neighborhood of a point t0 . Then the Fourier series of f and g at t0 are either both convergent and to the same limit or both divergent and in the same manner. 2.5
Another immediate application of Lemma 2.3 yields
Theorem (Dini’s test). Let f ∈ L1 (T). If 1
f (t + t ) − f (t ) 0 0 dt < ∞ t −1
Z
then Sn (f, t0 ) → f (t0 ).
EXERCISES FOR SECTION 2 1. Show that if a sequence of continuous functions on some interval is unbounded on a dense subset of the interval, then it is bounded only on a set of the first category. Use that to show that the Fourier series of f (defined in (2.3)) converges only on a set of the first category. 2. Show that for every given (countable) sequence {tn } there exists a continuous function whose Fourier series diverges at every tn . 3. Let g be the 2π -periodic function defined by: g(0) = 0, g(t) = t − π for 0 < t < 2π . (a) Discuss the convergence of the Fourier series of g . (b) Show that |Sn (g, t)| ≤ π + 2 for all n and t. (c) Put ϕn (t) = (π+2)−1 eint Sn (g, t); show that kϕn k∞ ≤ 1 and |Sn (ϕn , 0)| > K log n for some constant K > 0. (d) Show that for |t| < π/2, some constant K1 , and all n and m, |Sm (ϕn , t)| ≤
K1 |t|
64
A N I NTRODUCTION TO H ARMONIC A NALYSIS
(e) Show that for a proper choice of the integers nj and λj , the Fourier series of the continuous function f (t) =
∞ X 1 j=1
j2
eiλj t ϕnj (t)
diverges for t = 0 and converges for all other t ∈ T. ?3
SETS OF DIVERGENCE
We consider a homogeneous Banach space B on T.
3.1
D EFINITION : A set E ⊂ T is a set of divergence for B if there exists an f ∈ B whose Fourier series diverges at every point of E . D EFINITION :
3.2
For f ∈ L1 (T) we put Sn∗ (f, t) = supm≤n |Sm (f, t)|
(3.1)
S ∗ (f, t) = supn |Sn (f, t)|.
Theorem. E is a set of divergence for B if, and only if, there exists an element f ∈ B such that S ∗ (f, t) = ∞
(3.2)
for t ∈ E.
The theorem is an easy consequence of the following: Lemma. Let g ∈ B . There exist an element f ∈ B , and a positive even sequence {Ωj } such that limj→∞ Ωj = ∞ monotonically, and such that fˆ(j) = Ωj gˆ(j) for all j ∈ Z.
Let λ(n) be such that kσλ(n) (g) − gkB < 2−n . We write f = g + (g − σλn (g)). The series converges in norm; hence P∞ f ∈ B . Also fˆ(j) = Ωj gˆ(j) where Ωj = 1 + n=1 min(1, |j|/(λn + 1)). J PROOF OF THE LEMMA :
P
PROOF OF THE THEOREM : Condition (3.2) is clearly sufficient for the P divergence of fˆ(j)eijt for all t ∈ E . Assume, on the other hand, that P for some g ∈ B , gˆ(j)eijt diverges at every point of E . Let f ∈ B and {Ωj } be the function and the sequence corresponding to g by the lemma. We claim that (3.2) holds for f .
II. T HE C ONVERGENCE OF F OURIER S ERIES
65
This follows from: for n > m, Sn (g, t) − Sm (g, t) =
n X
m+1
Sj (f, t) − Sj−1 (f, t) Ω−1 j
−1 =Sn (f, t)Ω−1 n − Sm (f, t)Ωm+1
(3.3)
+
n−1 X
−1 (Ω−1 j − Ωj+1 )Sj (f, t),
m+1
hence Sn (f, t) − Sm (f, t) ≤ 2S ∗ (f, t)Ω−1 . m+1
It follows that if S ∗ (f, t) < ∞, the Fourier series of g converges and t 6∈ E . J Remark: Let ωn , n ≥ 1, be positive numbers such that ωj = O (Ωj ), P −1 −1 and ∞ 1 (Ωj − Ωj+1 )ωj < ∞. Then, for all t ∈ E , Sj (f, t) 6= o(ωj ). This follows immediately from (3.3). 3.3 For the sake of simplicity we assume throughout the rest of this section that
(3.4)
If f ∈ B and n ∈ Z then eint f ∈ B and keint f kB = kf kB .
Lemma. Assume (3.4); then E is a set of divergence for B if, and only if, there exists a sequence of trigonometric polynomials Pj ∈ B such that X kPj kB < ∞ and sup S ∗ (Pj , t) = ∞ on E. (3.5)
P ROOF : Assume the existence of a sequence {Pj } satisfying (3.5). Denote by mj the degree of Pj and let νj be integers satisfying νj > νj−1 + mj−1 + mj .
Put f (t) =
P
eiνj t Pj (t). For n ≤ mj we have Sνj +n (f, t) − Sνj −n−1 (f, t) = eiνj t Sn (Pj , t);
P hence fˆ(j)eijt diverges on E . Conversely, assume that E is a set of divergence for B . By Remark 3.2 there exists a monotone sequence ωn → ∞ and a function f ∈ B
66
A N I NTRODUCTION TO H ARMONIC A NALYSIS
such that |Sn (f, t)| > ωn infinitely often for every t ∈ E . We now pick a sequence of integers {λj } such that (3.6)
kf − σλj (f )kB < 2−j
and then integers µj such that (3.7)
ωµj > 2 supt S ∗ (σλj (f ), t)
and write Pj = Vµj+1 ∗ (f − σλj (f )) where as usual Vµ denotes de la Vallée Poussin’s kernel (see 1.2.13). It follows immediately from (3.6) P that kPj kB < ∞. If t ∈ E and n is an integer such that |Sn (f, t)| > ωn , then for some j , µj < n ≤ µj+1 and Sn (Pj , t) = Sn (f − σλj (f ), t) = Sn (f, t) − Sn (σλj (f ), t).
Hence, by (3.7), |Sn (Pj , t)| > 12 ωn , and (3.5) follows.
J
Theorem. Assume (3.4). Let Ej , j = 1, 2, . . . , be sets of divergence for B . Then E = ∪Ej is a set of divergence for B .
P ROOF : Let {Pnj } be the sequence of polynomials corresponding to Ej . Omitting a finite number of terms for each j does not change (3.5), but P permits us to assume j,n kPnj k < ∞ which shows, by the lemma, that E is a set of divergence for B . J 3.4
We turn now to examine the sets of divergence for B = C(T).
Lemma. Let E be a union of a finite number of intervals on T; denote the measure of E by δ . There exists a trigonometric polynomial ϕ such that 1 1 S ∗ (ϕ, t) > on E log 2π 3δ (3.8) kϕk∞ ≤ 1 .
P ROOF : It will be convenient to identify T with the unit circumference {z : |z| = 1}. Let I be a (small) interval on T, I = {eit |t − t0 | ≤ ε : }; the function ψI = (1 + ε − ze−it0 )−1 has a positive real part throughout the unit disc, its real part is larger than 1/3ε on I , and its value at the origin (z = 0) is (1 + ε)−1 . We now write E ⊂ ∪N 1 Ij , the lj being small intervals of equal length 2ε such that N ε < δ , and consider the function ψ(z) =
1+εX ψtj (z). N
II. T HE C ONVERGENCE OF F OURIER S ERIES
67
ψ has the following properties: <(ψ(z)) >0
|z| ≤ 1
for
ψ(0) =1
(3.9)
|ψ(z)| ≥ <(ψ(z)) >
1 1 > 3N ε 3δ
on E .
The function log ψ which takes the value zero at z = 0 is holomorphic in a neighborhood of {z : |z| ≤ 1} and has the properties |=(log ψ(z))| < π
(3.10)
on T −1
|log ψ(z)| > log(3δ)
on E
Since the Taylor series of log ψ converges uniformly on T, we can take P n a partial sum Φ(z) = M 1 an z of that series such that (3.10) is valid for Φ in place of log ψ . We can now put M
ϕ(t) =
M
X X 1 −iM t 1 e =(Φ(eit )) = e−iM t an eint − a ¯n e−int π πi 1 1
and notice that |SM (ϕ, t)| =
1 |Φ(eit )|. 2π
J
Theorem. Every set of measure zero is a set of divergence for C(T).
P ROOF : If E is a set of measure zero, it can be covered by a union P ∪In , the In being intervals of length |In | such that |In | < 1 and such that every t ∈ E belongs to infinitely many ln ’s. Grouping finite sets of intervals we can cover E infinitely often by ∪En such that every n En is a finite union of intervals and such that |En | <−2 . Let ϕn be a polynomial satisfying (3.8) for E = En and put Pn = n−2 ϕn We P clearly have kPn k∞ < ∞ and S ∗ (Pn , t) > 2n−1 /2πn2 on En . Since every t ∈ E belongs to infinitely many En ’s, our theorem follows from Lemma 3.3. J 3.5 Theorem. Let B be a homogeneous Banach space on T satisfying the condition (3.4). Assume B ⊃ C(T); then either T is a set of divergence for B or the sets of divergence for B are precisely the sets of measure zero.
68
A N I NTRODUCTION TO H ARMONIC A NALYSIS
P ROOF : By Theorem 3.4 it is clear that every set of measure zero is a set of divergence for B . All that we have to show in order to complete the proof is that, if some set of positive measure is a set of divergence for B , then T is a set of divergence for B . Assume that E is a set of divergence of positive measure. For α ∈ T denote by Eα the translate of E by α; Eα is clearly a set of divergence for B . Let {αn } be the sequence of all rational multiples of 2π and put ˜ = ∪Eα . By Theorem 3.2 E ˜ is a set of divergence, and we claim that E ˜ is a set of measure zero. In order to prove that, we denote by χ T\E the indicator function of E˜ and notice that χ(t − α) = χ(t)
for all t and αn .
This means X
−iαn j ijt χ(j)e ˆ e =
j
X
ijt χ(j)e ˆ
j
or −iαn j χ(j)e ˆ = χ(j) ˆ
(all αn )
If j 6= 0, this implies χ(j) ˆ = 0; hence χ(t) =constant almost everywhere and, since χ is an indicator function, this implies that the measure of E˜ is either zero or 2π . Since E˜ ⊃ E , E˜ is almost all of T. Now T \ E˜ is a set of divergence (being of measure zero) and E˜ is a set of divergence, hence T is a set of divergence. J 3.6 Thus, for spaces B satisfying the conditions of Theorem 3.5, and in particular for B = Lp (T), 1 < p < ∞, or B = C(T), either there exists a function f ∈ B whose Fourier series diverges everywhere, or the Fourier series of every f ∈ B converges almost everywhere. In the case B = L1 (T) it was shown by Kolmogorov that the first possibility holds. The case of B = L2 (T) was settled only recently by L. Carleson [4], who proved the famous "Lusin conjecture"; namely that the Fourier series of functions in L2 (T) converge almost everywhere. This result was extended by Hunt [12] to all Lp (T) with p > 1. The proof of these results is still rather complicated and we do not include it. We finish this section with Kolmogorov’s theorem. Theorem. There exists a Fourier series diverging everywhere.
P ROOF : For arbitrary κ > 0 we shall describe a positive measure µκ , of total mass one having the property that for almost all t ∈ T (3.11)
S ∗ (µκ , t) = supn |Sn (µκ , t)| > κ.
II. T HE C ONVERGENCE OF F OURIER S ERIES
69
Assume for the moment that such µκ exist; it follows from (3.11) that there exists an integer Nκ and a set Eκ of (normalized Lebesgue) measure greater than 1 − 1/κ, such that for t ∈ Eκ supn κ
(3.12)
If we write now ϕκ = µκ ∗ VNκ , (VNκ being de la Vallée Poussin’s kernel), then ϕκ is a trigonometric polynomial, kϕκ kL1 (T) < 3 and S ∗ (ϕκ , t) ≥ supn κ
on Eκ . Applying Lemma 3.3 with Pj = j −2 ϕ2j we obtain that the set E = ∩m ∪m≤j E2j is a set of divergence for L1 (T). Since E is almost all T, Kolmogorov’s theorem would follow from Theorem 3.5. The description of the measures µκ is very simple; however, for the proof that (3.11) holds for almost all t ∈ T, we shall need the following very important theorem of Kronecker (see VI.9). Theorem (Kronecker). Let {xj }N j=1 , N ≥ 1, be real numbers such that x1 , . . . , xN , π are linearly independent over the field of rational numbers. Let ε > 0 and α1 , . . . , αN be real numbers, then there exists an integer n such that |einxj − eiαj | < ε
j = 1, . . . , N.
We construct now the measures µκ as follows: let N be an integer, let x1 , . . . , xN be real numbers such that x1 , . . . , xN , π are linearly independent over the rationals and such that |xj − (2πj/N )| < 1/N 2 , and let P µ = 1/N δxj . For t ∈ T we have Sn (µ, t) =
Z
Dn (t − x)dµ(x) =
N 1 X Dn (t − xj ) = N 1
N 1 X sin(n + 12 )(t − xj ) = . N 1 sin(t − xj )
For almost all t ∈ T, the numbers t − x1 , . . . , t − xN , π are linearly independent over the rationals. By Kronecker’s theorem there exist, for each such t, integers n such that t − xj 1 i(n+ 12 )(t−xj ) − i sgn sin j = 1, . . . , N : < e 2 2
70
A N I NTRODUCTION TO H ARMONIC A NALYSIS
hence sin(n + 21 )(t − xj ) 1 t − xj −1 > sin 2 2 sin 12 (t − xj )
for all j .
It follows that (3.13)
Sn (µ, t) >
N 1 X t − xj −1 sin 2N j=1 2
and since the xj ’s are so close to the Rroots of unity of order N , the π sum in (3.13) is bounded below by 12 1/N |sin t/2|−1 dt > log N > κ, provided we take N large enough. J
EXERCISE FOR SECTION 3 1. Let B be a homogeneous Banach space on T. Show that for every f ∈ B there exist g ∈ B and h ∈ L1 (T) such that f = g ∗ h. Hint: Use Lemma 3.2 and Theorem I.4.1.
Chapter III
The Conjugate Function and Functions Analytic in the Unit Disc
We defined the conjugate function for some summable functions by means of their conjugate Fourier series. Our first purpose in this chapter is to extend the notion to all summable functions and to study the basic properties of the conjugate function for various classes of functions. This is done mainly in the first two sections. In section 1 we use the "complex variable" approach to define the conjugate function and obtain some basic results about the distribution functions of conjugates to functions belonging to various classes. In section 2 we introduce the Hardy-Littlewood maximal functions and use them to obtain results about the so-called maximal conjugate function. We show that the conjugate function can also be defined by a singular integral and use this to obtain some of its local properties. In section 3 we discuss the Hardy spaces H p . As further reading we mention [11]. 1
THE CONJUGATE FUNCTION
1.1 We identify T with the unit circumference {z : z = eit } in the complex plane. The unit disc {z : |z| < 1} is denoted by D and the ¯ . For f ∈ L1 (T) we denote by closed unit disc, {z : |z| ≤ 1}, by D it f (re ), r < 1, the Poisson integral of f ,
(1.1)
f (reit ) = (P(r, ·) ∗ f )(t) =
∞ X
r|n| fˆ(n)eint .
−∞
In chapter I we have considered P(r, ·) ∗ f as a family of functions on T, depending on the parameter r, 0 ≤ r < 1. The main idea in this section is to consider it as a function of the complex variable z = reit in D. 71
72
A N I NTRODUCTION TO H ARMONIC A NALYSIS
The functions r|n| eint , −∞ < n < ∞, are harmonic in D, and, since the series in (1.1) converges uniformly on compact subsets of D, it follows that f (reit ) is harmonic in D. We saw in I.3.3 that at every point t where f is the derivative of its integral (hence almost everywhere) f (eit ) = limr→1 f (reit ). Actually it is not very hard to see that for almost all t, f (z) → f (eit ) as z → eit nontangentially (i.e., if z → eit , remaining in a sector of the form {ζ : |arg(1 − ζe−it )| ≤ α < π}. (See [28], Vol. 1, p. 101.) The harmonic conjugate to (1.1) is the function (1.2)
f˜(reit ) = −i
∞ X
sgn (n)(n)r|n| fˆ(n)eint = (Q(r,·) ∗ f )(t)
−∞
where (1.2’)
Q(r, t) = −i
∞ X −∞
sgn (n)(n)r|n| )eint =
2r sin t 1 − 2r cos t + r2
is the harmonic conjugate of Poisson’s kernel P (r, t) (normalized by the condition Q(0, t) = sgn (0) = 0). We shall show that f˜(reit ) has a radial limit for almost all t. Denoting this radial limit by f˜(eit ) we shall show that if f has a conjugate in the sense of section II.1, then this conjugate is f˜(eit ). We may therefore call f˜ the conjugate function of f . 1.2 Lemma. Every function harmonic and bounded in D is the Poisson integral of some bounded function on T.
P ROOF : Let F be harmonic and bounded in D. Let rn ↑ 1 and write fn (eit ) = F (rn eit ). The sequence {fn } is a bounded sequence in L∞ (T); hence for some sequence nj → ∞, fnj converges in the weak-star topology (L∞ (T) being the dual of L1 (T)) to some function F (eit ). Let ρeiτ ∈ D, then Z Z 1 1 it P(ρ, t − τ )F (e )dt = lim P(ρ, t − τ )fnj (eit )dt j→∞ 2π 2π = lim F (rnj ρeiτ ) = F (ρeiτ ). J j→∞ 1.3 Lemma. Assume f ∈ L1 (T) and let f˜(reit ) be defined by (1.2) . Then, for almost all t, f (reit ) tends to a limit as r → 1.
P ROOF : Since the mapping f 7→ f˜(reit ) is clearly linear and since any f in L1 (T) can be written as f1 − f2 + if3 − if4 with fj ≥ 0 in L1 (T),
III. T HE C ONJUGATE F UNCTION
73
there is no loss of generality in assuming f > 0. The function F (z) = ˜ e−f (z)−if (z) is holomorphic (hence harmonic) in D. Since the Poisson integral of a nonnegative function is nonnegative f (z) > 0, and since f˜ is real valued (being the harmonic conjugate of the real valued f ), it follows that |F (z)| ≤ 1 in D. By Lemma 1.2 (and I.3.3) F has a radial limit of modulus e−f (t) almost everywhere. Since f ∈ L1 (T), f (eit ) < ∞, hence limr→1 F (reit ) 6= 0 almost everywhere; and at every point where F (eit ) exists and is nonzero, f˜(reit ) has a finite radial limit. J 1.4 D EFINITION : The conjugate function of a function f ∈ L1 (T) is the function f˜(eit ) = limr→1 f˜(reit ). If the series conjugate to the Fourier series of f is the Fourier series of some g ∈ L1 (T), then the Poisson integral of g is clearly f˜(reit ), which converges radially to g(eit ) for almost all t (theorem I.3.3). It follows that in this case f˜ = g and our new definition of the conjugate function extends that of II.1. P cos nt We have seen in I.4.2 that ∞ n=2 log n is a Fourier series while P P∞ sin nt sin nt the conjugate series, ∞ n=2 log n , is not. Since n=2 log n converges P cos nt everywhere, its sum is the conjugate function of f = ∞ n=2 log n and P sin nt 1 we can check that ∞ n=2 log n 6∈ L (T). Thus the conjugate function of a summable function need not be summable. P sin nt 1 Remark: At this point we cannot deduce that ∞ n=2 log n 6∈ L (T) from the mere fact that the series is not a Fourier series. However, we shall prove in section 3 that if f˜ ∈ L1 (T), for some f ∈ L1 (T), then f˜(reit ) is the Poisson integral of f˜. From that we can deduce that if ˜ ] so that if S[f ˜ ] is not a Fourier f˜ ∈ L1 (T) then its Fourier series is S[f 1 ˜ series then f 6∈ L (T). The difficulty in asserting immediately that f˜(reit ) is the Poisson integral of f˜ stems from the fact that we have only established pointwise convergence almost everywhere of f˜(reit ) to f˜(eit ) and this type of convergence is not sufficient to imply convergence of integrals. 1.5 We denote the (Lebesgue) measure of a measurable set E ⊂ T by |E|. D EFINITION : The distribution function of a measurable, real-valued function f on T is the function m(x) = mf (x) = |{t : f (t) ≤ x}|,
−∞ < x < ∞.
74
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Distribution functions are clearly continuous to the right and monotone, increasing from zero at x = −∞ to 2π as x → ∞. The basic property of distribution functions is: for every continuous function F on R Z Z (1.3) F (f (t))dt = F (x)dmf (x). T
D EFINITION : A measurable function f is of weak Lp type, 0 < p < ∞, if there exists a constant C such that for all λ > 0 mf (λ) ≥ 2π − Cλ−p
(1.4)
(or equivalently, |{t : |f (t)| ≥ λ}| ≤ Cλ−p ). Every f ∈ Lp (T) is clearly of weak Lp type. In fact, for all λ > 0 Z ∞ Z ∞ 1 1 p p kf kLp = x dm|f | (x) ≥ xp dm|f | (x) 2π 0 2π λ Z 1 p ∞ λp ≥ dm|f | (x) = λ (2π − m|f | (λ)) 2π 2π λ hence (1.4) is satisfied with C = 2πkf kpLp . It is equally clear that there are functions of weak Lp type which are not in Lp (T); |sin t|−1/p is a simple example. 0
Lemma. lf f is of weak Lp type then f ∈ Lp (T) for every p0 < p.
P ROOF : Z Z 0 |f |p dt =
∞
0
Z
∞
xp dm|f | (x) = 1 0 Z ∞ 0 p0 ∞ = m|f | (1) − [x (2π − m|f | (x))]1 + (2π − m|f | (x))d(xp ) 1 Z ∞ Z ∞ 0 −p p0 xp −p−1 dx < ∞. x d(x ) = 2π + C ≤ 2π + C J 1 1 xp dm|f | (x) ≤ m|f | (1) +
1.6 Theorem. lf f ∈ L1 (T) then f˜ is of weak L1 type.
P ROOF : We assume first that f > 0; also, we normalize f by assuming kf kL1 = 1. We want to evaluate the measure of the set of points where z−iλ 1 1 ˜ |f | > λ. The function Hλ (z) = 1 + π arg z+iλ = 1 + π = log z−iλ is z+iλ clearly harmonic and nonnegative in the half plane <(z) > 0, and its level lines are circular arcs passing through the points iλ and −iλ. The
III. T HE C ONJUGATE F UNCTION
75
level line Hλ (z) = 12 is the half circle z = λeiϑ , −π/2 < ϑ < π/2, hence if |z| > λ then Hλ (z) > 12 . Also it is clear that Hλ (1) = 1 − (2π) arctan λ < 2/πλ.
Now Hλ (f (z) + if˜(z)) is a well-defined positive harmonic function in D, hence Z 1 2 (1.5) Hλ f (reit ) + if˜(reit ) dt = Hλ (f (0)) = Hλ (1) < , 2π πλ and remembering that Hλ (f + if˜) ≥
1 2
if |f + if˜| > λ, we obtain,
|{t : |f˜(reit )| > λ}| ≤
8 . λ
Since the mapping f 7→ f˜ is linear it is clear that if we omit the normalization kf kL1 = 1 we obtain, letting r → 1, that for f ≥ 0 in L1 (T) |{t : |f˜(eit )| > λ}| ≤ 8kf kL1 λ−1 .
Every f ∈ L1 (T) can be written as f = f1 − f2 + if3 − if4 where fj ≥ 0 and kfj kL1 ≤ kf kL1 . We have f˜ = f˜1 − f˜2 + if˜3 − if˜4 and consequently {t : |f˜(eit )| > λ} ⊂
4 [
{t : |f˜j (eit )| > λ/4}.
j=1
It follows that for c = 128 and every f ∈ L1 (T) (1.6)
|{t : |f˜(reit )| > λ}| ≤ ckf kL1 λ−1 .
J
Corollary. If f ∈ L1 (T) then f ∈ Lα (T) for all α < 1.
P ROOF : Lemma 1.5.
J
1.7 The method of proof of Theorem 1.6 can be used for bounded functions as well. Theorem. lf f is real valued and |f | ≤ 1, then for 0 ≤ α < π/2 Z 1 2 ˜ it (1.7) eα|f (e )| dt ≤ . 2π cos α
76
A N I NTRODUCTION TO H ARMONIC A NALYSIS
P ROOF : Put F (z) = f˜(z) − if (z). Since cos(αf (z)) ≥ cos α, we have ˜
<(eαf (z) ) ≥ cos α |eαF (z) | = cos α eαf (z) , R it 1 <(eαF (re ) )dt = <(eαF (0) ) = cos αf (0) ≤ 1, it follows and since 2π that Z Z 1 1 1 1 ˜ it ˜ it eαf (re ) dt ≤ . Similarly, e−αf (re ) dt ≤ . 2π cos α 2π cos α
Adding and letting r → 1 we obtain (1.7).
J
Corollary. If |f | ≤ 1, then m|f˜| (λ) > 2π 1 −
(1.8)
4 √ e−λ cos 2
P ROOF : Write f = f1 + if2 where f1 , f2 are real valued. We have f˜ = f˜1 + if˜2 and consequently |f˜(eit )| > λ happens only if either 1
|f˜1 (eit )| > 2− 2 λ
Now, by (1.7) with α =
√
or
2,
1 {t : |f˜j | > 2− 2 λ} <
and (1.8) follows.
1
|f˜2 (eit )| > 2− 2 λ
4π −λ √ e , cos 2
j = 1, 2 J
?1.8 We shall see in chapter VI that a finite Borel measure on R is completely determined by its Fourier-Stieltjes transform (just as measures on T are determined by their Fourier-Stieltjes coefficients). This means that two distribution functions, 2 (x), of real-valued funcR iξx m1 (x) andRmiξx tions on T are equal if e dm1 (x) = e dm2 (x) for all ξ ∈ R. Using this remark we shall show now that if f is the indicator function of some set U ⊂ T, then mf˜(λ) depends only on the measure of U and not on the particular structure of U . Thus we can compute mf˜(λ) explicitly by replacing U by an interval of the same measure.
Theorem. Let U ⊂ T be a set of measure 2α. Let f be the indicator function of U and let χα be the indicator function of (−α, α). Write mα (λ) = mχ˜α (λ). Then mf˜(λ) = mα (λ).
III. T HE C ONJUGATE F UNCTION
77
P ROOF : Apply Cauchy’s formula on z = reit to the analytic functions ˜ F ξ (z) = eξ(f (z)+if (z)) , let r → 1 and remember that f = 0 on T \ U and f = 1 on U ; this gives Z Z ˜ it iξ f˜(eit ) ξ (1.9) e dt + e eiξf (e ) dt = 2πF ξ (0) = 2πeξα/π . U
T\U
Rewriting (1.9) for −ξ instead of ξ and then taking complex conjugates, we obtain Z Z ˜ it iξ f˜(eit ) −ξ (1.10) e dt + e eiξf (e ) dt = 2πe−ξα/π . U
T\U
From (1.9) and (1.10) we obtain Z
˜
it
eiξf (e ) dt = 2π
U
(1.11) Z
iξ f˜(eit )
e
T\U
sinh ξα π sinh ξ
sinh ξ 1 − dt = 2π sinh ξ
α π
.
We write now mf˜(λ) = n1 (λ) + n2 (λ) where n1 (λ) = |U ∩ {t : f˜(eit ) ≤ λ}|
and
n2 (λ) = |(T \ U ) ∩ {t : f˜(eit ) ≤ λ}|
and we can rewrite (1.11) as Z
eiξx dn1 (x) = 2π
sinh ξα π sinh ξ
Z
eiξx dn2 (x) = 2π
sinh ξ 1 − sinh ξ
(1.12)
α π
.
We see that n1 (x) and n2 (x) are uniquely determined by α and so they are the same for f˜ and χ˜α We thus obtain that f˜ and χ˜α have the same distribution of values not only on T but also on U for f˜ and (−α, α) for χ ˜α . J The Fourier series of χa is ∞ X sin nα −∞
πn
∞
eint =
X sin nα α +2 cos nt π πn 1
78
A N I NTRODUCTION TO H ARMONIC A NALYSIS
hence χ ˜α (reit ) =2
∞ X
∞
rn
1
X cos n(t − α) − cos n(t + α) sin nα sin nt = rn πn πn 1
∞
∞
1 X 1 n in(t−α) X 1 n in(t+α) = < r e − r e π n n 1 1 reit − eiα 1 = log it π re − e−iα
and finally χ ˜α (eit ) =
(1.13)
eit − eiα 1 1 1 − cos(t − α) log it log . = −iα π e −e 2π 1 − cos(t + α)
It follows from (1.13) that for λ > 1 the set {t : χ˜α (eit ) > λ} is an interval containing t = −α and contained in (−α − β1 , −α + β2 ) where β2 β1 = = e−πα , hence 2α + β 2α − β 1
(1.14)
2
mα (λ) ≥ 2π − 5αe−πλ .
Corollary. Let f be the indicator function of a set U of measure 2α on T. Then, for λ > 1 {t : |f˜(eit )| > λ} < 10αe−πλ . (1.15)
1.9 Returning to L1 (T), we use Theorem 1.6 and the fact that conjugation is an operator of norm 1 on L2 (T) to obtain the following theorem. The method applies in a general context which we discuss briefly in the following subsection. Theorem. If † f log+ |f | ∈ L1 (T), then f˜ ∈ L1 (T).
P ROOF : We shall use the fact that for g ∈ L2 (T) we have g˜ ∈ L2 (T) and k˜ g kL2 ≤ kgkL2 . This is an immediate corollary of Theorem I.5.5. As we have seen in 1.5, this implies m|˜g| (λ) ≥ 2π(1 − kgk2L2 λ−1 ). R∞ We have to prove that 1 λdm|f˜| (λ) < ∞ which is the same thing as RR λdm|f˜| (λ) = O (1) as R → ∞. Integrating by parts and remembering 1
(1.16)
† log+
x = sup(log x, 0) for x ≥ 0.
III. T HE C ONJUGATE F UNCTION
79
(1.6) we see that the theorem is equivalent to R
Z
(1.17)
2π − m|f˜| (λ) dλ = O (1)
1
as R → ∞.
In order to estimate 2π − m|f˜| (λ) we write f = g + h, where g = f when ˜ and consequently |f | ≤ λ and h = f when |f | > λ. We have f˜ = g˜ + h ˜ {t : |f˜(t)| > λ} ⊂ {t : |˜ g (t)| > λ/2} ∪ {t : |h(t)| > λ/2}.
(1.18) By (1.16) (1.19)
|{t : |˜ g (t)| > λ/2}| ≤ 8πλ−2 kgk2L2 = 8πλ−2
Z 0
λ
x2 dm|f˜|
and by (1.6) Z
˜ |{t : |h(t)| > λ/2}| ≤ 2cλ−1 khkL1 = 2cλ−1
∞
λ
xdm|f˜| ;
1
1
for x ≥ λ, (log x) 2 ≥ (log λ) 2 and we obtain 2c ˜ |{t : |h(t)| > λ/2}| ≤ √ λ log λ
(1.20)
Z
∞
λ
p x log xdm|f˜|
By (1.18), (1.19), and (1.20) we have 2π − m|f˜| (λ) ≤ 8πλ−2
Z
λ
0
2c x2 dm|f˜| + √ λ log λ
Z
∞
λ
p x log xdm|f˜| .
Thus (1.17), and hence the theorem, will follow if we show that as R → ∞, Z R Z λ −2 x2 dm|f˜| dλ = O (1) λ 0
1
(1.21)
Z 1
R
1 λ log λ √
Z
∞
λ
p x log xdm|f˜| dλ = O (1)
The information that we have concerning m|f˜| is that it is a monotonic function tending to 2π at infinity and such that Z ∞ (1.22) x log xdm|f˜| < ∞ 1
80
A N I NTRODUCTION TO H ARMONIC A NALYSIS
In order to derive (1.21) from (1.22) we apply Fubini’s theorem. The domain for the first integral is the trapezoid {(x, λ) : 1 < λ < R, 0 < x < λ}
and integrating first with respect to λ we obtain Z 1 Z R Z R Z λ 1 2 1 1 2 2 −2 1− x dm|f˜| dλ = λ x dm|f˜| + − x dm|f˜| R x R 0 0 1 1 Z R xdm|f˜| = O (1) ≤2π + 1
The domain for the second integral is the strip {(x, λ) : 1 < λ < R, λ < x}.
Integrating first with respect to λ we obtain Z
R
1
Z ∞ p 1 x log xdm|f˜| dλ = λ log λ λ Z Z R p x log xdm|f˜| + 2 log R 2 √
∞
R
1
p x log xdm|f˜| = O (1)
and the proof is complete.
J
1.10 When the underlying measure space is infinite, e.g. the line R rather than T, we can use µ({x : f (x)} > λ) instead of the distribution function. For postive integrable functions it gives the complete information about the distribution of f . A slightly coarser gauge, which is often more transparent and easier than the distribution function to work with, even when the underlying measure is finite, is the “lumping” of dmf , defined (for arbitrary measure space {X, B, µ}, finite or infinite), as follows:
For a measurable real-valued f and n ∈ Z set
D EFINITION :
mn = mn (f ) = µ({x : 2n−1 < |f (x)| ≤ 2n }).
Observe that:
(1.23)
a) f is of weak type p if, and only if, mn (f ) = O (2−np ), P∞ np b) f ∈ Lp if and only if −∞ 2 mn (f ) < ∞, in fact kf kpLp ≤
∞ X −∞
2np mn (f ) ≤ 2p kf kpLp .
III. T HE C ONJUGATE F UNCTION
81
1.11 What we have done in 1.9 is interpolate, using what we know about the properties of an operator (the conjugation operator f 7→ f˜) on L1 (T) and on L2 (T), to prove that it maps the intermediate space L log L(T) into L1 (T). The same method can be used to prove M. Riesz’ theorem below. We use the parameters mn rather than the distribution functions, and the reader should compare the first proof below to that of 1.9. Riesz’ original proof is given as second proof. Theorem (M. Riesz). For 1 < p < ∞, the mapping f 7→ f˜ is a bounded linear operator on Lp (T).
We have mentioned already that for p = 2 the theorem is obvious (from Theorem I.5.5). From Parseval’s formula (I.7.1) it follows that if p and q are conjugate exponents, the mappings f 7→ f˜ in Lp (T) and in Lq (T) are, except for a sign, each other’s adjoints and consequently if one is bounded, so is the other and by the same bound. Thus it is enough to prove the theorem for 1 < p < 2.
F IRST P ROOF : Assume 1 < p < 2. We need to show that there exists a constant Cp such that if f ∈ Lp (T) then f˜ ∈ Lp (T), and kf˜kp ≤ Cp kf kp . P np ˜ ˜ Since kf˜kpLp ≤ ∞ −∞ 2 mn (f ), we estimate mn (f ). Given n, we write f = f0,n + f1,n where f0,n (t) = f (t) if |f (t)| ≥ 2n (and is zero elsewhere) and f1,n (t) = f (t) if |f (t)| < 2n , (and is zero elsewhere). Since 1 < p < 2, f0,n ∈ L1 and f1,n ∈ L2 . We have (1.24)
kf0,n kL1 ≤
∞ X
2n mn (f ),
kf1.n kL2 ≤
n+1
n X
22n mn (f ).
As f˜ = f˜0,n + f˜1,n , the inequality |f˜(t)| > 2n implies at least one of the inequlities |f˜0,n (t)| > 2n−1 or |f˜1,n (t)| > 2n−1 , so that (1.25) mn+1 (f˜) ≤ µ({t : |f˜0,n (t)| > 2n−1 }) + µ({t : |f˜1,n (t)| > 2n−1 }) By 1.6 we have (1.26)
µ({t : |f˜0,n (t)| > 2n−1 }) ≤
∞ X kf0,n kL1 −n ≤ c 2 mj (f )2j , 1 2n−1 n+1
and since conjugation has norm 1 on L2 (T), n
(1.27)
µ({t : |f˜1,n (t)| > 2n−1 }) ≤
X kf1,n k2L2 ≤ c2 2−2n mj (f )22j . 2n−2 2
82
A N I NTRODUCTION TO H ARMONIC A NALYSIS
It follows that mn (f˜) ≤ c1 2−n
∞ X
mj (f )2j + c2 2−2n
n
and
kf˜kpLp ≤
∞ X
n X
mj (f )22j
2np mn (f˜)
−∞
∞ n X X 2pn 2−n mj (f )2j + 2−2n mj (f )22j
≤c3
X
=c3
X
n+1
(n−j)(p−1)
2
mj (f )2jp +
n≤j
X
2(p−2)(n−j) mj (f )2jp
n≥j
the sums with respect to both n and j . Summing first with respect to n produces constants which depend only on p and we have X kf˜kpLp ≤ cp mj (f )2jp ≤ C(p)kf kpLp . j J
S ECOND P ROOF : Let f ∈ Lp (T), f ≥ 0. Let f (reit ) be its Poisson integral, f˜(reit ) the harmonic conjugate, and H(reit ) = f (reit ) + if˜(reit ). We may clearly assume that f does not vanish identically, and, since f ≥ 0, it follows that f (reit ) > 0, hence H(reit ) 6= 0 in D. Let G(reit ) be the branch of (H(reit ))p which is real at r = 0. Let γ be a real number satisfying (1.28)
γ<
π , 2
pγ >
π , 2
For 0 < r < 1 we have Z Z Z 1 1 1 |G(reit )|dt = |G(reit )|dt + |G(reit )|dt, 2π 2π I 2π II R R where I is taken over the set where |arg(H(z))| < γ and II is taken over the complementary setR (defined by the condition γ ≤ |arg(H(z))| < π/2, where z = reit ). In I we have |H(z)| < f (z)(cos γ)−1 ,
hence (1.29)
1 2π
Z I
|G(reit )|dt ≤ (cos γ)−p kf kplp
III. T HE C ONJUGATE F UNCTION
83
and, in particular, (1.30)
1 2π
Z
On the other hand, we have in (1.31)
R
II
|G(z)| ≤ <(G(z))(cos pγ)−1
(both factors being negative). Now, since Z 1 <(G(reit ))dt = G(0) = (fˆ(0))p , 2π it follows from (1.30) that Z 1 |<(G(reit ))|dt ≤ (fˆ(0))p + (cos γ)−p kf kpLp (T) 2π II and this, combined with (1.31) and (1.29), implies Z 1 (1.32) |G(reit )|dt ≤ cp kf kpLp 2π where cp is a constant depending only on p. Since |f˜(reit )|p ≤ |H(reit )|p = |G(reit )|, it follows from (1.32), letting r → 1, that f˜ ∈ Lp (T) and kf˜kLp ≤ c1/p p kf kLp .
The theorem now follows from the case f > 0 and the linearity of the mapping f 7→ f˜. J EXERCISES FOR SECTION 1 1. Show that there exists a constant A such that for all n, λ and f ∈ C(T), such that kf k∞ ≤ 1, {t : Sn (f, t) > λ} < Ae−λ
2. Show that for 1 ≤ p < ∞ there exist constants Ap such that for all n, λ and f ∈ Lp (T), such that kf kLp ≤ 1
{t : Sn (f, t) > λ} < Ap . p λ
3. Prove that if f ∈ Lp (T), 1 < p < ∞, then
lim kf˜(reit ) − f˜(eit )kLp = 0.
r→1
84
A N I NTRODUCTION TO H ARMONIC A NALYSIS
4.PProve that if f ∈ Lp (T), g ∈ Lq (T), where p−1 + q −1 = 1, 1 < p < ∞ ∞ then −∞ fˆ(n)ˆ g (n) converges. 5. Show that Theorem 1.7 is sharp in the sense that there exist real valued R ˜ functions f such that |f | ≤ 1 and eπ|f |/2 dt = ∞. Hint: Take f = 2χα − 1. ˜ 6. Prove that if f ∈ C(T) then ef ∈ L1 (T) no matter how large kf k∞ is. Hint: Write f = P + f1 where P is a polynomial kf1 k < 1 it and iα eit − eiα e − e 7. Show that log it is a constant multi = < log it e − eiβ e − eiβ ple function of the indicator function of (α, β) by examining of theitconjugate iα e − e = log it . e − eiβ 8. Let 1 < p < ∞. Show that there exists a constant cp such that for f in Lp (T), and λ > 0,
{t : |f˜(eit )| > λ} < cp kf kpLp λ−p .
Remark: This is an immediate consequence of 1.11; try, however, to prove it by using 1.8. Hint: Assume that f is real valued. Denote Uλ = {t : f˜(eit ) > λ} and Vλ = {t : f˜(eit ) < −λ}. Denote by gλ the indicator function of Uλ ; deduce from Parseval’s formula that (with q = p/(p − 1)) λ|Uλ | ≤
Z
f˜(eit )gλ (eit )dt = −
Z
f (eit )geλ (eit )dt ≤ 2πkf kLp kgeλ kLq
and use (1.15) to evaluate kgeλ kLq . Repeat for Vλ .
2 THE MAXIMAL FUNCTION OF HARDY AND LITTLEWOOD
2.1 D EFINITION : the function
(2.1)
The maximal function of a function f ∈ L1 (T) is
1 Z t+h f (τ )dτ . Mf (t) = sup0
If we allow the value +∞ then Mf (t) is well defined for all t ∈ T. We shall see presently that Mf (t) is finite for almost all t ∈ T and that Mf is of weak L1 -type. This will follow from the following simple Lemma (Vitali). From any family Ω = {Iα } of intervals on T one can extract a sequence {In } of pairwise disjoint intervals, such that
(2.2)
∞ [ 1 [ In > Iα . 4 α n=1
III. T HE C ONJUGATE F UNCTION
85
P ROOF : Denote a1 = supI∈Ω |I| and let I1 be any interval of Ω satisfying |I1 | > 34 a1 ; let Ω2 be the subfamily of all the intervals in Ω which do not intersect I1 . Denote a2 = supI∈Ω2 |I| and let I2 ∈ Ω2 be such that |I2 | > 34 a2 . We continue by induction; having picked I1 , . . . , Ik we consider the family Ωk+1 of the intervals of Ω which intersect none of Ij , j ≤ k, and pick Ik+1 ∈ Ωk+1 such that |Ik+1 | > 43 ak+1 where ak+1 = supI∈Ωk+1 |I|. We claim that the sequence {In } so obtained satisfies (2.2). In fact, denoting by Jn the interval of length 4|In | of which S S In is the center part, we claim that Jn ⊃ Iα which clearly implies (2.2). We notice first that ak → 0 and consequently ∩Ωk = ∅. For I ∈ Ω let k denote the first index such that I 6∈ Ωk ; then I ∩ Ik−1 6= ∅ and, since |Ik−1 | ≥ 43 |I|, I ⊂ Jk−1 and the lemma is proved. J 2.2 Theorem. For f ∈ L1 (T), Mf is of weak L1 type.
P ROOF : Since Mf (t) ≤ M|f | (t), we may assume that f ≥ 0. Let λ > 0; if Mf (t) > λ let It be an interval centered at t such that Z (2.3) f (t)dt > λ|It |. It
Thus we cover the set {t : Mf (t) > λ} by a family of intervals {It }. Let {In } be a pairwise disjoint subsequence of {It } satisfying (2.2). Then, by (2.2) and (2.3), R R S S (2.4) |{t : Mf (t) > λ}| ≤ | It | ≤ 4| In | ≤ λ4 ∪In f (t)dt ≤ λ4 T f (t)dt. J 2.3 The maximal function of a bounded function is clearly bounded by the same bound so that the map f 7→ Mf has norm 1 in L∞ (T). The map is subliniear† rather then linear, but we can still interpolate between L1 (T) and L∞ (T). Lemma. Let f ∈ L1 (T) and let m(λ) = m|f | (λ) be the distribution function of |f |. Then Z 4 ∞ (2.5) |{t : Mf (t) > 2λ}| ≤ ydm(y). λ λ † An operator S is sublinear if S(f + f ) is defined whenever Sf and Sf are both 1 2 1 2 defined, and if |S(f1 + f2 )| ≤ |Sf1 | + |Sf2 | a.e.
86
A N I NTRODUCTION TO H ARMONIC A NALYSIS
P ROOF : Write f = g + h where g = f when |f | ≤ λ and h = f when |f | > λ. We have Mf (t) ≤ Mg (t) + Mh (t) ≤ λ + Mh (t); hence, by (2.4), |{t : Mf (t) > 2λ}| ≤ |{t : Mh (t) > λ}| ≤
Z
4 λ
|h(τ )|dτ ≤
4 λ
Z
∞
ydm(y).
λ
J
In terms of the “lumped” distribution this says, (with n shifted to n − 2), X X (2.6) mn (Mf ) ≤ 4·22−n 2j mj (f ) = 16 2(j−n) mj (f ) j≥n−1
j≥n−1
Theorem. (a) For 1 < p < ∞ there exists a constant cp such that if f ∈ Lp (T), then Mf ∈ Lp (T) and kMf kLp ≤ cp kf kLp . (b) If f log+ |f | ∈ L1 (T) then Mf ∈ L1 (T) and Z kMf kL1 ≤ 2 + 4 |f | log+ |f |dt. T
P ROOF : (a) If f ∈ Lp (T) then kMf kpLp ≤ = 16
X
X 2
P
j
2jp mj (f ) ≤ 2p kf kpLp . By (2.6),
2np mn (Mf ) ≤ 16
X
2np+(j−n) mj (f )
j+1≥n
(n−j)(p−1)
jp
·2 mj (f ) = 16
j+1≥n
X
2(p−1)n
≤ 16
2jp mj (f )
j
n≤1
X
X
(p−1)n
2
·kf kpLp
= cpp kf kpLp .
n≤1
(b) If f log+ |f | ∈ L1 (T) then kMf kL1 ≤ 1 +
X
= 1 + 16
X
j>0 1≤n≤j+1
by (2.6).
j>0
R 1 jmj (f ) ≤ log 2· 2π |f | log+ |f |.
2n mn (Mf ) ≤ 1 + 16
n≥1
X
P
X
2n+(j−n) mj (f )
j+1≥n≥1 j
2 mj (f ) = 1 + 16
X
(j + 1)2j mj (f ).
j>0
J
The use of the “lumped distribution” necessarily gives somewhat worse constants than the same proof done with the distribution functions. Here is the proof done “properly”.
III. T HE C ONJUGATE F UNCTION
87
P ROOF : Denote by m(λ) and n(λ) the distribution functions of |f | and Mf respectively. We can rewrite (2.5) in the form (2.7)
2π − n(2λ) ≤
4 λ
Z
∞
y dm(y) ≤
λ
4 λp
Z
∞
y p dm(y);
λ
hence if f ∈ Lp (T), 1 ≤ Rp < ∞, we have λRp (2π − n(λ)) → 0 as λ → ∞. ∞ p 2p ∞ p 1 We have kMf kpLp = 2π λ dn(λ) = 2π λ dn(2λ); integrating by 0 0 parts we obtain (1 ≤ p < ∞) Z ∞ Z ∞ λp dn(2λ) = [λp (2π − n(2λ))]∞ (2π − n(2λ))pλp−1 dλ + 0 0 0 ( R∞ R∞ 8p 0 λp−2 λ ydm(y)dλ if p > 1 ≤ R ∞ −1 R ∞ ydm(y)dλ if p = 1 2π + 8 1 λ λ and integrating by parts again we finally obtain: Z ∞ Z ∞ 8p 8p (for p>1) λp dn(2λ) ≤ λp dm(λ) = 2πkf kpLp ; p−1 0 p−1 0 Z
(for p=1)
0
∞
λdn(2λ) ≤ 2π + 8
Z
∞
λ log λdm(λ) Z = 2π + 8 |f | log+ |f |dt. 1
T
J
2.4 Lemma. Let k be a nonnegative even R π function on (−π, π), monotone nonincreasing on (0, π), such that −π k(t)dt = 1. Then for all f ∈ L1 (T) Z (2.8) k(t − τ )f (τ )dτ ≤ Mf (t).
P ROOF : The definition (2.1) is equivalent to Z Mf (t) = sup0
88
A N I NTRODUCTION TO H ARMONIC A NALYSIS
2.5 Let f ∈ L1 (T), let f (reit ) be its Poisson integral and let f˜(reit ) be the harmonic conjugate,
D EFINITION : The maximal conjugate function of f is the function ˜ f˜(eit ) = sup0
Theorem. Let f ∈ Lp (T), 1 < p < ∞; then f˜˜ ∈ Lp (T) and ˜ kf˜kLp ≤ Cp kf kLp
P ROOF : Since f˜(reit ) is the Poisson integral of f˜(eit ) and the Poisson kernel satisfies the condition of Lemma 2.4, we obtain |f˜(reit )| ≤ ˜ Mf˜(t). Hence f˜(eit ) < Mf˜(t) and the theorem follows from 2.3 and 1.11. J 2.6 We have defined the conjugate f˜ of a function f ∈ L1 (T) as the boundary value of the harmonic function f˜(reit ) = (Q(r,·) ∗ f )(t) where
(2.9)
Q(r, t) =
2r sin t 1 − 2r cos t + r2
is the conjugate Poisson kernel. Since the limit (2.10)
Q(1, t) = lim Q(r, t) = r→1
sin t cos t/2 t = = cot 1 − cos t sin t/2 2
is so obvious and so explicit, we are tempted to reverse the order of the operations and write (2.11)
f˜ = Q(1, t) ∗ f
The difficulty, however, is that Q(1, t) is not Lebesgue integrable so that the convolution (2.11) is, as yet, undefined. We propose to show next that, the convolution appearing in (2.11) can be defined as an improper integral and that, with this definition, (2.11) is valid almost everywhere. Lemma. For f ∈ L1 (T) and ϑ = 1 − r, we have 1 Z 2π−ϑ Q(1, τ )f (t − τ )dτ − f˜(reit ) ≤ 4M|f | (t). E(r, t) = 2π ϑ
III. T HE C ONJUGATE F UNCTION
89
P ROOF : Write
(2.12)
1 Z 2π−ϑ Q(1, τ ) − Q(r, τ ) f (t − τ )dτ + E(r, t) ≤ 2π ϑ 1 Z ϑ + Q(r, τ )f (t − τ )dτ = E1 (r, t) + E2 (r, t). 2π −ϑ
We notice that the function (1 − r)2 sin t (1 − cos t)(1 − 2r cos t + r2 ) 1−r Q(1, t)P(r, t) = 1+r
Q(1, t) − Q(r, t) =
(2.13)
is odd, and is monotone decreasing on (0, π). For ϑ < t < π −1 1−r 1−r Q(1, t) ≤ sin ϑ/2 <π 1+r 1+r
so that Q(1, t) − Q(r, t) < πP(r, t).
(2.14) It follows that E1 (r, t) ≤
(2.15)
1 2π
Z
2π−ϑ ϑ
|Q(1, t) − Q(r, t)||f (t − τ )|dτ Z 1 ≤ P(r, τ )|f (t − τ )|dτ ≤ πM|f | (t). 2
In order to estimate E2 (r, t) it is sufficient to notice that in (−ϑ, ϑ) we 2 have |Q(r, t)| < 1−r and consequently E2 (r, t) ≤
(2.16)
1 π(1 − r)
Z
ϑ
−ϑ
|f (t − τ )|dτ ≤
2 M|f | (t). π
Corollary. Z supo<ϑ<π
2π−ϑ ϑ
˜ Q(1, τ )f (t − τ )dτ ≤ f˜(eit ) + 4M|f | (t).
J
90
A N I NTRODUCTION TO H ARMONIC A NALYSIS
2.7 The estimates (2.15) and (2.16) are clearly very wasteful. They do not take into account the fact that Q(r, t) is odd and we can improve them by writing 1 Z π (2.17) E1 (r, t) = Q(1, τ ) − Q(r, τ ) f (t − τ ) − f (t + τ ) dτ 2π ϑ
and 1 Z ϑ Q(r, τ ) f (t − τ ) − f (t + τ ) dτ E2 (r, t) = 2π 0 Z ϑ1 1 ≤ f (t − τ ) − f (t + τ ) dτ π(1 − r) 0
(2.18)
where 0 < ϑ1 < ϑ (the mean value theorem). At every point t of continuity of f , and more generally, at every point in which the primitive of f is differentiable, we have: Z
(2.19)
ϑ1
f (t − τ ) − f (t + τ ) dτ = o(ϑ1 ).
0
By (2.18) it is clear that if (2.19) holds, E2 (r, t) → 0. Theorem. Let f ∈ L1 (T); at every t ∈ T for which (2.19) is valid we have, (ϑ = 1 − r), 1 Z 2π−ϑ Q(1, τ )f (t − τ )dτ − f˜(reit ) → 0 E(r, t) = 2π ϑ
as r → 1.
P ROOF : As in (2.12), E(r, t) ≤ E1 (r, t) + E2 (r, t). We have already remarked that under the assumption (2.19), limr→1 E2 (r, t) = 0 so that we can confine our attention to E1 (r, t). For ε > 0, let η > 0 be such that for 0 < ϑ1 ≤ η Z
(2.20)
ϑ1
0
f (t − τ ) − f (t + τ ) dτ ≤ εϑ1
and write Z 2πE1 (reit ) =
η
ϑ
+
Z π η
Q(1, τ ) − Q(r, τ ) f (t − τ ) − f (t + τ ) dτ .
III. T HE C ONJUGATE F UNCTION
91
The second integral tends to zero by virtue of the fact that on (η, π), Q(r, τ ) → Q(1, τ ) uniformly. The first integral is integrated by parts. Writing Z ϑ1 Φ(ϑ1 ) = f (t − τ ) − f (t + τ ) dτ, 0
we see that it is bounded by Z η [Φ(ϑ1 ) Q(1, ϑ1 ) − Q(r, ϑ1 ) ]ϑ + ε
η
ϑ1 d Q(1, ϑ1 ) − Q(r, ϑ1 ) ;
ϑ
integrating by parts once more and remembering that Q(1, ϑ1 ) < π/ϑ1 , it follows from (2.14) and (2.20) that E1 (r, t) < 10ε + o(1) and the theorem is proved. J 2.8 Let F be defined on T and assume that for all ϑ > 0, F is integrable on T \ (−ϑ, ϑ). R D EFINITION : The principal value of T F (t)dt is PV
Z T
F (t)dt = lim
ϑ→0
Z
2π−ϑ
F (t)dt. ϑ
For f ∈ L1 (T) condition (2.19) is satisfied for almost all t ∈ T; since f (reit ) → f (eit ) almost everywhere, we obtain, R 1 Theorem. Let f ∈ L1 (T). The principal value of 2π f (t − τ ) cot τ2 dτ exists for almost all t ∈ T, and, almost everywhere, Z 1 τ f˜(eit ) = P V f (t − τ ) cot dτ. 2π 2 2.9 Theorem 2.7 can be used both ways. R We can use it to show the existence of the principal value of P V f (t − τ ) cot τ2 dτ if we know that f (eit ) exists or to obtain the existence of f˜(eit ) at points where Z τ PV f (t − τ ) cot dτ 2
clearly exists. For instance, if f satisfies a Lipschitz condition at t, α that R π is, if |f (t + h) − f (t)|τ < K|h| for some K > 0 anditα > 0, then |f (t − τ ) − f (t + τ )| cot 2 dτ < ∞ and it follows that f˜(e ) exists and 0 Z π τ 1 it ˜ (2.21) f (t − τ ) − f (t + τ ) cot dτ f (e ) = 2π 0 2
92
A N I NTRODUCTION TO H ARMONIC A NALYSIS
If f satisfies a Lipschitz condition uniformly on a set E ⊂ T, that is, if for some K > 0 and α > 0 |f (t + h) − f (t)| ≤ K|h|α
for all t ∈ E ,
then the integrals (2.21) are uniformly bounded and 1 2π
Z ε
π
τ f (t − τ ) − f (t + τ ) cot dτ → f˜(eit ) 2
uniformly in t ∈ E as ε → 0. It follows, reexamining the proof of 2.7, that f˜(reit ) → f˜(eit ) uniformly for t ∈ E as r → 1. In particular, if E is an interval, it follows that f˜(eit ) is continuous on E . 2.10 Conjugation is not a local operation; that is, it is not true that if f (t) = g(t) in some interval I , then f˜(t) = g˜(t) on I , or equivalently, that if f (t) = 0 on I , then f˜(t) = 0 on I . However, Theorem. lf f (t) = 0 on an interval I , then f˜(t) is analytic on I .
P ROOF : By the previous remarks f is continuous on I . Thus the function F = f + if˜ is analytic in D and is continuous and purely imaginary on I . By Schwarz’s reflection principle F admits an analytic extension through I , and since F (eit ) = if˜(eit ) on I , the theorem follows. J
Remark: Using (2.21) we can estimate the successive derivatives of f at points t ∈ I and show that f is analytic on I without the use of the "complex" reflection principle.
EXERCISES FOR SECTION 2 The first three exercises were covered already in Theorem I.8.4. The main point here is the localization (exercise 4). 1. Assume f ∈ Lipα (T), 0 < α ≤ 1. Show that f˜ ∈ Lipα0 (T) for all α0 < α. 2. Assume f ∈ C n (T), n ≥ 1. Show that f˜ ∈ C n−1 (T) and f˜(n−1) ∈ Lipα (T) for all α < 1. 3. Assume f ∈ Lipα (T), 0 < α < 1. Show that f˜ ∈ Lipα (T)
III. T HE C ONJUGATE F UNCTION
93
Hint: 1 f˜(t + h) − f˜(t) = 2π
Z
f (t + h − τ ) − f (t + h) cot
1 − 2π
Z
α
=O (h ) + −
Z
f (t − τ ) − f (t) cot
Z
τ dτ 2
2π−2h
f (t − τ ) − f (t + h) cot
2h 2π−2h
f (t − τ ) − f (t) cot
2h α
=O (h ) +
Z
τ dτ 2
τ dτ 2
2π−2h
f (t − τ ) − f (t)
2h
− f (t + h) − f (t)
Z
2π−2h
2h
cot
τ +h dτ − 2
cot
τ +h τ − cot dτ 2 2
τ +h dτ. 2
4. Localize exercises 1-3, that is, assume that f satisfies the respective conditions on an an interval I ⊂ T and show that the conclusions hold in I . 3 THE HARDY SPACES
In this section we study some spaces of functions holomorphic in the unit disc D. These spaces are closely related to spaces of functions on T and we obtain, for example, a characterization of Lp functions and of measures whose Fourier coefficients vanish for negative values of n. We also prove that if for some f ∈ L1 (T), f˜(eit ) is summahie ˜ ], and, finally, we obtain results concerning the absolute then S[f˜] = S[f convergence of some classes of Fourier series. We start with some preliminary remarks about products of Moebius functions. ¯
ζ(ζ−z) 3.1 Let 0 < |ζ| < 1; the function b(z, ζ) = |ζ|(1−z ¯ defines, as is ζ) well known, a conformal representation of D onto itself, taking ζ into zero and zero into |ζ|. The important thing for us now is that b(z, ζ) vanishes only at z = ζ and |b(z, ζ)| = 1 on |z| = 1. If 0 < |ζ| < r, then ¯ ζ(ζ−z) b zr , ζr = r |ζ|(r 2 ¯ is holomorphic in |z| < r , vanishes only at z = ζ , z ζ −zζ) and b , = 1 on |z| = r. For ζ = 0 we define b(z, 0) = z . r
r
Let f be holomorphic in |z| < r and denote its zeros there by ζ1 , . . . , ζk (counting each zero as many times as its multiplicity). The Q −1 function f1 (z) = f (z) b zr , ζrn is holomorphic in |z| < r, is zero-free and satisfies |f1 (z)| = |f (z)| for |z| = r. Since log|f1 (z)| is
94
A N I NTRODUCTION TO H ARMONIC A NALYSIS
harmonic in |z| < r we have log|f1 (0)| =
1 2π
Z
log|f1 (reit )|dt
and if we assume, for simplicity, that f (0) 6= 0, the formula above is equivalent to Poisson-Jensen’s formula: (3.1)
log|f (0)| + log
k Y
r|ζn |−1 =
n=1
1 2π
Z
log|f (reit )|dt.
We implicitly assumed that f has no zeros of modulus r; however, since both sides of the formula depend continuously on r, the above is valid even if f vanishes on |z| = r. The reader should check the form that Poisson-Jensen’s formula takes when f vanishes at z = 0. Q The term log kn=1 r|ζn |−1 is positive, and removing it from (3.1) we obtain Jensen’s inequality Z 1 (3.2) log|f (0)| ≤ log|f (reit )|dt. 2π or, if f has a zero of order s at z = 0, log| lim z z→0
−s
1 f (z)| + log(r ) ≤ 2π s
Z
log|f (reit )|dt.
Another form of Jensen’s inequality is: let f be holomorphic in 0 |z| < r and let ζ10 , . . . , ζm , be (some) zeros of f in |z| < r, counted each one at most as many times as its multiplicity. Then Z m X 1 (3.3) log|f (0)| + log|f (reit )|dt. log(r|ζn0 |−1 ) ≤ 2π 1 Inequality (3.3) is obtained from (3.1) by deleting some (positive) terms of the form log(r|ζn |−1 ) from the left-hand side. 3.2 Let p > 0 and let f be holomorphic in D. We introduce the notation Z 1 (3.4) hp (f, r) = |f (reit )|p dt. 2π
If 0 < r < I and ρ < 1 we have f (rρeit ) = f (reit ) ∗ P(ρ, t) and consequently for p > 1 we have hp (f, rρ) = kf (rρeit )kpLp ≤ kf (reit )kpLp = hp (f, r)
III. T HE C ONJUGATE F UNCTION
95
or, in other words, hp (f, r) is a monotone nondecreasing function of r. P The case p = 2 is particularly obvious since for f (z) = an z n we have P h2 (f, r) = |an |2 r2n . We show now that the same is true for all p > 0. Lemma. Let f be holomorphic in D and p > 0. Then hp (f, r) is a monotone nondecreasing function of r.
P ROOF : We reduce the case of an arbitrary positive p to the case p = 2. Let r1 < r < 1. Assume first that f has no zeros on |z| ≤ r and consider the function† g(z) = (f (z))p/2 ; then Z Z Z 1 1 1 |f (r1 eit )|p dt = |g(r1 eit )|2 dt ≤ |g(reit )|2 dt 2π 2π 2π Z 1 = |f (reit )|p dt 2π or hp (f, r1 ) ≤ hp (f, r). If f has zeros inside |z| < r but not on |z| = r, we denote the zeros, repeating each according to its multiplicity, by ζ1 , . . . , ζk , and write k Y z ζn −1 f1 (z) = f (z) b , r r 1
For |z| < r we have |f (z)| < |f1 (z)|, for |z| = r we have |f (z)| = |f1 (z)| and f1 is zero-free in |z| ≤ r. It follows that hp (f, r1 ) < hp (f1 , r1 ) ≤ hp (f1 , r) = hp (f, r).
Since hp (f, r) is a continuous function of r, the same is true even if f does have zeros on |z| = r, and the lemma is proved, J 3.3 Lemma. Let {ζn } be a sequence of complex numbers satisfying P |ζn | < 1 and (1 − |ζn |) < ∞. Then the product
(3.5)
B(z) =
∞ Y 1
b(z, ζn ) = z m
ζ¯n (ζn − z) |ζ |(1 − z ζ¯n ) 6 0 n =
Y
ζn
converges absolutely and uniformly in every disc Dr = {z : |z| ≤ r}, r < 1. † Any
branch of (f (z))p/2 .
96
A N I NTRODUCTION TO H ARMONIC A NALYSIS
P ROOF : It is sufficient to show that formly in |z| ≤ r < 1. But
P
1−
ζ¯n (ζn −z) |ζn |(1−z ζ¯n )
converges uni-
ζ¯n (ζn − z) |ζn | + zζn 1 − |ζn | 1 + r (1 − |ζn |) 1 − = ≤ 1−r |ζn |(1 − z ζ¯n ) |ζn |(1 − zζn ) P and the series converges (1 − |ζn |) < ∞. J
The product (3.5), often called the Blaschke product corresponding to {ζn }, is clearly holomorphic in D and it vanishes precisely at the points ζn . Nothing prevents, of course, repeating the same complex number a (finite) number of times in {ζn }, so that we can prescribe not only the zeros but their multiplicities as well. Since all the terms in (3.5) are bounded by 1 in modulus, we have |B(z)| < 1 in D. 3.4 We now introduce the spaces H p (H for Hardy) and N (N for Nevanlinna).
D EFINITION : The space H p , p > 0, is the (linear) space of all functions f holomorphic in D, such that (3.6)
kf kpH p = lim hp (f, r) = sup0
The space N is thc space of all functions f holomorphic in D, such that Z 1 (3.7) kf kN = sup0
III. T HE C ONJUGATE F UNCTION
97
An immediate consequence is that in this case f is the Poisson integral P int of f (eit ) ∼ ∞ . 0 an e 3.5 Lemma. Let f ∈ N and denote its zeros in D by ζ1 , ζ2 , . . . , each P repeated according to its multiplicity. Then (1 − |ζn |) < ∞. P Remark: The convergence of the series (1 − |ζn |) is equivalent to the Q convergence of the product |ζn | hence to the boundedhess (below) of P the series log|ζn | (not counting the zeros at the origin, if any).
P ROOF : We may assume f (0) 6= 0. By Jensen’s inequality (3.3), if M is fixed and r sufficiently close to 1 log|f (0)| − kf kN ≤
M X
log|ζn | − M log r.
1
Letting r → 1 we obtain log|f (0)| − kf kN ≤
M X
log|ζn |
1
and since M is arbitrary the lemma follows
J
3.6 If we combine Lemma 3.3 with 3.5 we see that if f ∈ N , the Blaschke product corresponding to the sequence of zeros of f is a welldefined holomorphic function in D, having the same zeros (with the same multiplicities) as f and satisfying |B(z)| < 1 in D. If we write F (z) = f (z)(B(z))−1 then F is holomorphic and satisfies |F (z)| > |f (z)| in D. We shall refer to f = BF as the canonical factorization of f . Theorem. Let f ∈ H p , p > 0, and let f = BF be its canonical factorization. Then F ∈ H p and kF kH p = kf kH p .
P ROOF : The Blaschke product B has the form B(z) = lim z N →∞
m
N Y
b(z, ζn ).
1
−1 Q If we write FN (z) = f (z) z m N , then FN converges to F 1 b(z, ζn ) uniformly on every disc of the form |z| < r < 1. Since the absolute value of the finite product appearing in the definition of FN tends to
98
A N I NTRODUCTION TO H ARMONIC A NALYSIS
one uniformly as |z| → 1, it follows from Lemma 3.2 that FN ∈ H p and kFN kH p = kf kH p . Let r < 1, then hp (F, r) = lim hp (FN , r) ≤ lim kFN kpH p = kf kpH p . N →∞
N →∞
Now hp (F, r) ≤ kf kpH p for all r < 1 is equivalent to kF kH p = kf kH p , and since the reverse inequality is obvious, the theorem is proved. J Theorem 3.6 is a key theorem in the theory of H p spaces. It allows us to operate mainly with zero-free functions which, by the fact of being zero-free, can be raised to arbitrary powers and thereby move from one H p to a more convenient one. This idea was already used in the proof of Lemma 3.2. Our first corollary to Theorem 3.6 deals with Blaschke products. 3.7 Corollary. Let B be a Blaschke product. Then |(eit )| = 1 almost everywhere.
P ROOF : Since |B(z)| < 1 in D it follows from Lemma 1.2 that B(eit ) exists as a radial (actually: nontangential), limit for almost all t ∈ T. The canonical factorization of f = B is trivial, the function F is identically one, and consequently Z 1 kBk2H 2 = |B(eit )|2 dt. 2π Since |B(eit )| ≤ 1, the equality above can hold only if |B(eit )| = 1 almost everywhere. J 3.8 Theorem. Assume f ∈ H p , p > 0. Then the limit limr→1 f (reit ) exists for almost all t ∈ T and, denoting it by f (eit ), we have Z 1 p kf kH p = |f (eit )|p dt. 2π
P ROOF : The case p = 2 follows from 3.4. For arbitrary p > 0, let f = BF be the canonical factorization of f , and write G(z) = (F (z))p/2 . Then G belongs to H 2 and consequently G(reit ) → G(eit ) for almost all t ∈ T; at every such t, F (reit ) converges to some F (eit ) such that |F (eit )|p/2 = |G(eit )|. Since B has radial limit of absolute value one almost everywhere we see that it f (eit ) = lim f (reit ) exists and |f (eit )|p/2 )| almostR everywhere. R = |G(e p p 1 1 2 it 2 Now kf kH p = kF kH p = kGkH 2 = 2π |G(e )| dt = 2π |f (eit )|p and the proof is complete. J
III. T HE C ONJUGATE F UNCTION
99
3.9 The convergence assured by Theorem 3.8 is pointwise convergence almost everywhere. For p ≥ 2 we know that f is the Poisson integral of f (eit ) and consequently f (reit ) converges to f (eit ) in the Lp (T) norm. We shall show that the same holds for p = 1 (hence for p ≥ 1); first, however, we use the case p ≥ 2 to prove: 0
Theorem. Let 0 < p < p0 and suppose f ∈ H p and f (eit ) ∈ Lp (T). 0 Then f ∈ H p .
P ROOF : As before, if we write f = BF , G(z) = (F (z))p/2 , then G ∈ 0 H 2 and G(eit ) ∈ L2p /p (T). G is the Poisson integral of G(eit ) and 0 0 0 consequently G ∈ H 2p /p which means F ∈ H p , hence f ∈ H p . J Corollary. Let f ∈ L1 (T) and assume f˜ ∈ L1 (T): then (f + if˜) ∈ H 1 .
P ROOF : We know (Corollary 1.6) that (f + if˜) ∈ H p for all p < 1 and by the assumption (f + if˜)(eit ) ∈ L1 (T). J 3.10 Theorem. Every function f in H 1 can be factored as f = f1 f2 with f1 , f2 ∈ H 2 .
P ROOF : Let f = BF be the canonical factorization of f . We can take f1 = F 1/2 , f2 = BF 1/2 . J 3.11 We can now prove: Theorem. Let f ∈ H 1 and let f (eit ) be its boundary value. Then f is the Poisson integral of f (eit ).
P ROOF : We prove the theorem by showing that f (reit ) converges to P f (eit ) in the L1 norm. This implies that if f (z) = an z n , then an are the Fourier coefficients of f (eit ) which is clearly equivalent to f being the Poisson integral of f (eit ). Write f = f1 f2 with fj ∈ H 2 , j = 1, 2. f (reit ) − f (eit ) = f1 (reit )f2 (reit ) − f1 (eit )f2 (eit );
adding and subtracting f1 (eit )f2 (reit ) and using the Cauchy-Schwarz inequality, we obtain kf (reit ) − f (eit )kL1 ≤ kf2 kL2 kf1 (reit ) − f1 (eit )kL2 + kf1 kL2 kf2 (reit ) − f2 (eit )kL2
As r → 1, kfj (reit ) − fj (eit )kL2 → 0, and the proof is complete.
J
100
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Remark: See exercise 2 at the end of the section for an extension of the theorem to the case 0 < p < 1. ˜ ]. Corollary. Let f ∈ L1 (T) and f˜ ∈ L1 (T). Then S[f˜] = S[f
P ROOF : From 3.9 and the theorem above follows that f˜(reit ) is the Poisson integral of f˜(eit ) (see Remark 1.4). J 3.12 Theorem. Assume p ≥ 1. A function f belongs to H p if, and only if, it is the Poisson integral of some f (eit ) ∈ Lp (T) satisfying
(3.8)
fˆ(n) = 0
for all n < 0.
P ROOF : Let f ∈ H p ; by Theorem 3.11, f is the Poisson integral of f (eit ) and (3.8) is clearly satisfied. On the other hand, let f ∈ Lp (T) and assume (3.8); the Poisson integral of f , f (reit ) =
∞ X
fˆ(n)rn eint =
0
∞ X
fˆ(n)z n
0
it
is holomorphic in D, and since kf (re )kLp ≤ kf (eit )kLp , it follows that f (z) ∈ H p . J 3.13 For p > 1, we can prove that every f ∈ H p is the Poisson integral of f (eit ) without appeal to Theorem 3.11 or any other result obtained in this section. We just repeat the proof of Lemma 1.2 (which is the case p = ∞ of 3.12): if f ∈ Lp (R), kf (reit )kp is bounded as r → 1; we can pick a sequence rn → 1 such that fn (eit ) = f (rn eit ) converge weakly in Lp (T) to some f (eit ). Since weak convergence in Lp (T) implies convergenee of Fourier coefficients, it is clear that (3.8) is satisfied and that the function f with which we started is the Poisson integral of f (eit ). For p = 1 the proof as given above is insufficient. L1 (T) is a subspace of M (T), the space of Borel measures on T, which is the dual of C(T), and the argument above can be used to show that every f ∈ H 1 is the Poisson integral of some measure µ on T. This measure has the property
(3.9)
µ ˆ(n) = 0,
for all n < 0.
All that we have to do in order to complete the (alternative) proof of Theorem 3.12 in the case p = 1 is to prove that the measures satisfying (3.9), often called analytic measures, are absolutely continuous with respect to the Lebesgue measure on T.
III. T HE C ONJUGATE F UNCTION
101
Theorem (F. and M. Riesz). Let µ be a Borel measure on T satisfying
(3.9)
µ ˆ(n) = 0,
for all n < 0.
Then µ is absolutely continuous with respect to Lebesgue measure. We first prove: Lemma. Let E ⊂ T be a closed set of measure zero. There exists a ¯ such that: function ϕ holomorphic in D and continuous in D
(3.10)
(i) ϕ(eit ) = 1
on E , ¯ \ E. (ii) |ϕ(e )| < 1 on D it
P ROOF : Since E is closed and of measure zero we can construct a function ψ on T such that ψ(eit ) > 0 everywhere, ψ(eit ) is continuously differentiable in each component of T \ E , ψ(eit ) → ∞ as t approaches E , and ψ(eit ) ∈ L2 (T). The Poisson integral ψ(z) of ψ(eit ) is positive on D and ψ(z) → ∞ as z approaches E . The conjugate function is ¯ \ E (see the end of section 2) and consequently, if we continuous in D ˜ ψ(z)+iψ(z) put ϕ(z) = ψ(z)+iψ(z)+1 then ϕ is holomorphic in D and continuous in ˜ ¯ D \ E . At every point where ψ(z) < ∞ we have |ϕ(z)| < 1, and as ψ(z) → ∞, ϕ(z) → 1. If we define ϕ(z) = 1 on E then ϕ satisfies (3.10). J P ROOF OF THE THEOREM : Assume that µ satisfies the condition (3.9). We can assume µ ˆ(0) = 0 as well (otherwise consider µ − µ ˆ(0)dt) and it then follows from Parseval’s formula that Z ¯ (3.11) hf , µi = f dµ = 0 for every f ∈ C(T) which is the boundary value of a holomorphic function in D or, equivalently, such that fˆ(n) = 0 for all negative n. Let E ⊂ T be closed and of (Lebesgue) measure zero. Let ϕ be a function satisfying (3.10). Then, by (3.11) Z ϕm dµ = 0 for all m > 0 and by (3.10) lim
m→∞
Z
ϕm dµ = µ(E).
Thus µ(E) = 0 for every closed set E of Lebesgue measure zero and, since µ is regular, the theorem follows. J
102
A N I NTRODUCTION TO H ARMONIC A NALYSIS
3.14 Theorem 3.13 can be given a more complete form in view of the following important Theorem. Let f ∈ H p , p > 0; then log|f (eit )| ∈ L1 (T)
Remarks: The same conclusion holds under the weaker assumption f ∈ N . We state it for H p since we did not prove the existence of f (eit ) for f ∈ N (cf. [28], Vol. 1, p. 276). Since p log+ |f | < |f |p we already know that log+ |f (eit )| ∈ L1 (T). Thus the content of the theorem is that f (eit ) cannot be too small on a large set.
P ROOF : Replacing f by z −m f , if f has a zero of order m at z = 0, we may assume f (0) 6= 0. Let r < 1; then, by Jensen’s inequality Z 1 log|f (0)| − kf kN ≤ − log− |f (reit )|dt ≤ 0 2π (where log− x = − log x if x < 1 and zero otherwise). It follows that R |log|f (reit )||dt is bounded as r → 1 and the theorem follows from Fatou’s lemma. J Corollary. If f 6= 0 is in H p , f (eit ) can vanish only on a set of measure zero.
Combining Theorem 3.13 with our last corollary we obtain that analytic measures are equivalent to Lebesgue’s measure (i.e., they all have the same null sets). 3.15 Theorem. Let E be a closed proper subset of T. Any continuous function on E can be approximated uniformly by Taylor polynomials‡ .
P ROOF : We denote by C(E) the algebra of all continuous functions on E endowed with the supremum norm. The theorem claims that the restrictions to E of Taylor polynomials are dense in C(E). If a measure µ carried by E is orthogonal to all z n , n = 0, 1, . . . , it is analytic: hz n , µi = µ ˆ(n) = 0, and hence µ = f dt with f ∈ H 1 , f carried by E . By Theorem 3.14, f = 0. Hence there is no nontrivial functional on C(E), which is orthogonal to all Taylor polynomials, and the theorem follows from the Hahn-Banach theorem. J ‡ We
form
the term "Taylor polynomial" to designate trigonometric polynomials of the Puse N int 0
an e
.
III. T HE C ONJUGATE F UNCTION
103
3.16 We finish this section with another application of 3.10. P P∞ n 1 −1 Theorem (Hardy). Let f (z) = ∞ < ∞. 0 an z ∈ H . Then 1 |an |n
Remark: The theorem can also be stated: Let f ∈ L1 (T) satisfy (3.8), P ˆ −1 then ∞ ≤ kf kL1 . 1 |f (n)|n
P ROOF : If F (eit ) is a primitive of f (eit ) then F is continuous on T and consequently its Fourier series is Abel summable to F at every t ∈ T. P n In particular ∞ tends to a finite limit as r → 1. If we assume 1 (an /n)r P∞ an ≥ 0 for all n then 1 an /n is clearly convergent (compare with I.4.2). P In the general case we write f = f1 f2 with fj = Aj,n z n ∈ H 2 , P P ∗ N ∗ n ∗ ∗ ∗ j = 1, 2. Write fj (z) = |Aj,n |z , and f (z) = f1 (z)f2 (z) = an z . ∗ 2 ∗ 1 The functions fj are clearly in H , hence f ∈ H and, since a∗n ≥ 0, P it follows from the first part of the proof that (a∗n /n) < ∞. But n n X X |an | = A1,k A2,n−k ≤ |A1,k ||A2,n−k | = a∗n k=0
k=0
and the theorem follows.
J
3.17 Let f ∈ H 1 and assume that f (eit ) is of bounded variation on P∞ P∞ T. If f ∼ 0 an eint then 1 inan eint is the Fourier-Stieltjes series of df . Thus the measure df satisfies the condition of Theorem 3.13 and consequently df = f 0 dt and f 0 (z) is in H 1 . Combining this with 3.16 we obtain: Theorem. Let f ∈ H 1 and assume that f (eit ) is of bounded variation P ˆ on T. Then f (eit ) is absolutely continuous and ∞ −∞ |f (n)| < ∞.
An equivalent form of the theorem is (see 3.9): Theorem. Let f, f˜ ∈ L1 (T) and assume that both f and f˜ are of bounded variation. Then both f and f˜ are absolutely continuous. and P∞ ˆ −∞ |f (n)| < ∞.
EXERCISES FOR SECTION 3 1. Deduce Theorem 3.13 (F. and M. Riesz) from R Theorem 3.11. 2. Show that for all p > 0, if f ∈ H p , then |f (eit ) − f (reit )|p dt → 0 as r → 1.
104
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Hint: Reduce the general case to the case in which f is zero-free. In the case 1 that f is zero-free, write f1 = f 2 ; then f1 ∈ H 2p and f (eit ) − f (reit ) = (f1 (eit ) − f1 (reit ))(f1 (eit ) + f1 (reit ));
hence show that if the statement is valid for 2p is also valid for p. Use the fact that it is valid for p ≥ 2. 3. Let E be a closed set of measure zero on T. Let ϕ be a continuous function on E . (a) Show that there exists a function Φ, holomorphic in D and continuous ¯ such that Φ(eit ) = ϕ(eit ) on E . on D (b) Show that Φ can be chosen satisfying the additional condition supz∈D¯ |Φ(z)| = supeit ∈E |ϕ(eit )|. Hint: Construct Φ by successive approximation using 3.15 and Lemma 3.13. 4. Let f ∈ L1 (T) be absolutely continuous and assume f 0 log+ |f 0 | ∈ L1 (T). P Prove that |fˆ(n)| < ∞.
Chapter IV
Interpolation of Linear Operators and the Theorem of Hausdorff-Young
Interpolation of norms and of linear operators is really a topic in functional analysis rather than harmonic analysis proper; but, though less so than ten years ago, it still seems esoteric among authors in functional analysis and we include a brief account. The interpolation theorems that are the most useful in Fourier analysis are the Riesz-Thorin theorem and the Marcinkiewicz theorem. We give a general description of the complex interpolation method and prove the Riesz-Thorin theorem in section 1. In the second section we use Riesz-Thorin to prove the Hausdorff-Young theorem. We do not discuss the Marcinkiewicz theorem although it appeared implicitly in the proof of theorem III.1.9. We refer the reader to Zygmund ([28] chap. XII) for a complete account of Marcinkiewicz’s theorem. 1 INTERPOLATION OF NORMS AND OF LINEAR OPERATORS
1.1 Let B be a normed linear space and let F be defined in some domain Ω in the complex plane, taking values in B . We say that F is holomorphic in Ω if, for every continuous linear functional µ on B , the numerical function h(z) = hF (z), µi is holomorphic in Ω. Assume now that B is a linear space with two norms k k0 and k k1 defined on it. We consider the family B of all B -valued functions which are holomorphic and bounded, with respect to both norms, in a neighborhood of the strip Ω = {z : 0 ≤ <(z) ≤ 1}. B is a linear space which we norm as follows: for F ∈ B put
(1.1)
kF k = supy {kF (iy)k0 , kF (1 + iy)k1 }.
For 0 < α < 1, the set Bα = {F ∈ B : F (α) = 0} a linear subspace of B. We shall say that k k0 and k k1 are consistent if Bα is closed in B for 105
106
A N I NTRODUCTION TO H ARMONIC A NALYSIS
all 0 < α < 1. A convenient criterion for consistency is the following lemma: Lemma. Assume that for every f ∈ B, f 6= 0, there exists a functional µ continuous with respect to both k k0 and k k1 , such that hf, µi 6= 0. Then k k0 and k k1 are consistent. PROOF : Let 0 < α < 1 and let Fn ∈ B, Fn → F in B . Let µ be an arbitrary linear functional continuous with respect to both norms. The functions hF n(z), µi are bounded on the strip Ω and tend to hF (z), µi uniformly on the lines z = iy and z = 1 + iy . By the theorem of Phragmèn-Lindelöf the convergence is uniform throughout Ω and in particular hF (α), µi = limn→∞ hFn (α), µ = 0. Since this is true for every functional It it follows that F (α) = 0, that is, F ∈ Bα and the lemma is proved. J
Remark: The condition of the lemma is satisfied if k k0 and k k1 both majorize a third norm k k2 . This follows from the Hahn-Banach theorem: if f 6= 0, there exists a functional µ continuous with respect to k k2 such that hf, µi = 6 0. It is clear that if , k kj ≥ k k2 then µ is continuous with respect to k kj , j = 0, 1. 1.2 We interpolate consistent norms on B as follows: for 0 < α < 1, the quotient space B/Bα is algebraically isomorphic to B (through the mapping F 7→ F (α)). Since Bα is closed in B, B/Bα has a canonical quotient norm which we can transfer to B through the aforementioned isomorphism; we denote this new norm on B by k kα . The usefulness of this method of interpolating norms comes from the fact that it permits us to interpolate linear operators in the following sense: Theorem. Let B (resp. B 0 ) be a normed linear space with two consistent norms k k0 and k k1 (resp. k k00 and k k01 . Denote the interpolating norms by k kα (resp. k k0α ), 0 < α < 1. Let S be a linear transformation from B to B 0 which is bounded as
(1.2)
S
(B, k kj − → (B 0 , k k0j )
j = 0, 1.
Then S is bounded as (1.3)
S
(B, k kα ) − → (B 0 , k k0α ),
and its norm kSkα satisfies (1.4)
kSkα ≤ kSk1−α kSkα 1. 0
IV. I NTERPOLATION OF L INEAR O PERATORS
107
We denote by B0 the space of holomorphic B 0 -valued functions S which is used in defining k k0α . The map B − → B 0 can be extended to a S map B − → B 0 by writing SF (z) = S(F (z)). To show that SF so defined is holomorphic, we consider an arbitrary functional µ continuous with respect to k k00 or k k01 and notice that hSF (z), µi = hF (z), S∗ µi. Since SF (z) is clearly bounded it follows that SF ∈ B 0 . Let f ∈ B , kf kα = 1; then there exists an F ∈ B such that F (α) = f and such that kF k < 1 + ε. Applying S to F , we obtain PROOF :
0
0
kSf kα ≤ kSF k ≤ (1 + ε) max(kSk0 , kSk1 );
hence kSkα ≤ max(kSk0 , kSk1 )
which proves the continuity of (1.3). To prove the better estimate (1.4), we consider the function ea(z−α) F (z), where ea = kSk0 , kSk−1 1 . We have 0
0
kSf kα ≤ kS(ea(z−α) F (z))k
0
0
= supt {e−aα kSF (it)k0 , ea(1−α) kSF (1 + it)k1 } ≤ (1 + ε) sup{e−aα kSk0 , ea(1−α) kSk1 } = (1 + ε)kSk1−α kSkα 1 . 0
J
Remark: The idea of using the function ea(z−α) goes back to Hadamard (the "three-circles theorem"); it can be used to show that, for every f ∈ B, (1.5)
kf kα ≤ kf k1−α kf kα 1 . 0
1.3 A very important example of interpolation of norms is the following: let (X, dx) be a measure space, let 1 ≤ p0 < p1 ≤ ∞, and let B be a subspace of Lp0 ∩ Lp1 (dx). We claim that the norms k k0 and k k1 induced on B by Lp0 (dx) and Lp1 (dx), respectively, are consistent. By Lemma 1.1, all we have to show is that, given f ∈ B , f 6= 0, there exists a linear functional µ, continuous with respect to both norms, such R that hf, µi 6= 0; we can take as µ the functional defined by hf, µi = f g¯dx where g ∈ L1 ∩ L∞ (dx) has the property† that f g > 0 whenever |f | > 0. † If
we write f = |f |eiϕ with real-valued ϕ, we may take g = min(1, |f |p0 )eiϕ .
108
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Theorem. Let (X, dx) be a measure space, B = Lp0 ∩ Lp1 (dx) (with 1 ≤ p0 < p1 ≤ ∞). Denote by k kj , the norms induced by Lpj (dx), and by k kα the interpolating norms. Then k kα coincides with the norm induced on B by Lpα (dx) where p0 p1 p0 (1.6) pα = = if p1 = ∞ . p0 α + p1 (1 − α) 1−α
P ROOF : Let f ∈ B and kf kpα ≤ 1. Consider F (z) = |f |a(z+α)+1 eiϕ where f = |f |eiϕ and a=
p0 − p1 p0 α + p1 (1 − α)
=
−1 if p1 = ∞ . 1−α
We have F (α) = f and consequently kf kα ≤ kF k. Notice now that |F (iy)| = |f |1−aα = |f pα /p0 | so that Z 1/pα kF (it)k0 = |f |pα dx ≤ 1; similarly kF (1 + it)k1 ≤ 1 (use the same argument if p1 < ∞ and check directly if p1 = ∞); hence kf kα ≤ 1. This proves k kα ≤ k kLpα . In order to prove the reverse inequality, we denote by q0 , q1 the conjugate exponents of p0 and p1 and notice that the exponent conjugate to pα is q q0 q1 1 (1.6’) qα = = if q0 = ∞ q0 α + q1 (1 − α) α We now set B 0 = Lq0 ∩ Lq1 (dx) and denote by B0 the corresponding space of holomorphic B 0 -valued functions. Let f B and assume kf kLpα > 1; then, since B 0 Ris dense in Lqα , there exists a g ∈ B 0 such that kgkLqα ≤ 1 and such that f gdx > 1. As in the first part of this proof, there exists a function G ∈ B0 such that G(α) = g and kGk (with respect to q0 , q1 ) is bounded by 1. Let F ∈ B such that F (α) = f . The function h(z) = f F (z)G(z)dx (remember that for each z ∈ Ω, F (z) ∈ B and G(z) ∈ B 0 ) is holomorphic and bounded in Ω (see Appendix A). Now h(α) > 1, hence, by the Phragmèn-Lindelöff theorem, |h(z)| must exceed 1 on the boundary. However, on the boundary |h(z)| ≤ kF kkGk ≤ kF k so that kF k > 1. This proves kf kα ≥ 1 and it follows that k kα and k kLpα are identical. J 1.4 As a corollary to Theorems 1.2 and 1.3, we obtain the RieszThorin theorem.
IV. I NTERPOLATION OF L INEAR O PERATORS
109
Theorem. Let (X, x) and (Y, y) be measure spaces. Let B = Lp0 ∩ 0 0 Lp1 (dx) and B 0 = Lp0 ∩ Lp1 (dy), and let S be a linear transformation from B to B 0 , continuous as S : (B, k kj ) 7→ (B 0 , k k0j ), j = 0, 1, where 0 k kj (resp. k k0j ) is the norm induced by Lpj (dx) (resp. Lpj (dy)). Then S is continuous as S : (B, k kα ) 7→ (B 0 , k k0α ) 0
where k kα , (resp. k k0α ) is the norm induced by Lpα (dx) (resp. Lpα (dy)), pα and p0α are defined in (1.6)). A bounded linear transformation S from one normed space B to another can be completed in one and only one way, to a transformation having the same norm, from the completion of B into the completion of the range space of S. Thus, under the assumption of 1.4, S can 0 be extended as a transformation from Lpα (x) into Lpα (y) with norm satisfying (1.4). The same remark is clearly valid for Theorem 1.2. 1.5 Our first application of the Riesz-Thorin theorem is Bochner’s proof of M. Riesz’ Theorem III.1.11. We show that Lp (T) admits conjugation if p is an even integer. It then follows by interpolation that the same is true for all p > 2, and by duality, for all p > 1. Let f be a real-valued trigonometric polynomial and assume, for simplicity, f (0) = 0. As usual we denote the conjugate by f˜ and put f [ = 12 (f + if˜). f [ is a Taylor polynomial‡ and its constant term is zero; the same is clearly true for (f [ )p , p being any positive integer. Consequently Z 1 (f [ (t))p dt = 0 . 2π
Assume now that p is even, p = 2k, and consider the real part of the identity above; we obtain: Z Z Z 1 2k 1 2k 1 (f˜)2k dt − (f˜)2k−2 f 2 dt + (f˜)2k−4 f 4 dt 2π 2 2π 4 2π − · · · = 0.
By Hölder’s inequality Z 1 (f˜)2k−2m f 2m dt ≤ kf˜k2k−2m kf k2m L2k ; L2k 2π ‡ We
form
the term "Taylor polynomial" to designate trigonometric polynomials of the Puse N int 0
e
.
110
A N I NTRODUCTION TO H ARMONIC A NALYSIS
hence kf˜k2k L2k ≤
2k ˜ 2k−2 2k ˜ 2k−4 kf kL2k kf k2L2k + kf kL2k kf k4L2k + . . . , 2 4
or, denoting Y = kf˜kL2k kf k−1 L2k
we have Y
2k
2k 2k 2k−2 ≤ Y + Y 2k−4 Y 2k−4 + · · · + 1 2 4
which implies that Y is bounded by a constant depending on k (i.e., on p). Thus the mapping f 7→ f˜ is bounded in the Lp (T) norm for all polynomials f , and, since polynomials are dense in Lp (T), the theorem follows. EXERCISES FOR SECTION 1 1. Prove inequality (1.5). P 2. Let sequence of numbers. Find min( |an |) under the conP {an2} be a P ditions |an | = 1, |an |4 = a. 3. Let B be a vector space with consistent e a space of linear functionals on B which are continunorms k k0 , k k1 , and B e induced by ous with respect to both k k0 and k k1 . Let k k∗j be the norm on B ∗ the duality with (B, k kj ), j = 0, 1, and k kα the interpolating norms. Let k kα∗ e, e induced by the dual of (B, k kα ). Prove that for f ∈ B be the norm on B kf kα∗ ≤ kf k∗α .
4. Let X, B be a measurable space, and let µ and ν be positive measures on it. Let B = L2 X, B, µ ∩ L2 X, B, ν . i. What are necessary and sufficient conditions for the consistency of the norms (on B ): k k0 = k kL2 (µ) , and k k1 = k kL2 (ν) .
ii. When the norms above are consistent, what are the interpolating norms k kα ? 5. Let 0 < a < b. For f ∈ C ∞ (T), define kf k0 = kf k1 = ∞
P
|fˆ(n)|2 |n|2b
12
P
|fˆ(n)|2 |n|2a
21
, and
. Show that the norms so defined are consistent on
C (T) and find the interpolating norms k kα . 6. Assume 0 < a < b. What are the interpolating norms between the ones induced on C ∞ (T) by C a (T) and by C b (T)? Hint: For f ∈ L1 (T) define kf kW,k = kW2k (f )k∞ ; the notation is that of I.8.2. For 0 < a < b, and for f ∈ C ∞ (T), define kf k0 = supk kf kW,k 2ak and kf k1 = supk kf kW,k 2bk .
IV. I NTERPOLATION OF L INEAR O PERATORS
111
2 THE THEOREM OF HAUSDORFF-YOUNG
The theorem of Riesz-Thorin enables us to prove now a theorem that we stated without proof at the end of 1.4 (Theorem I.4.7); it is known as the Hausdorff-Young theorem: 2.1 Theorem. Let 1 ≤ p ≤ 2 and let q be the conjugate exponent, P that is, q = p/(p − 1). If f ∈ Lp (T) then |fˆ(n)|q < ∞. More precisely P ˆ 1/q |f (n)|q ≤ kf kLp
P ROOF : The mapping F : f 7→ {fˆ(n)} is a transformation of functions on the measure space (T, dt) into functions on (Z, dn), Z being the group of integers and dn the so-called counting measure, that is, the measure that places a unit mass at each integer. We know that the norm of the mapping as L1 (T) 7→ L∞ (Z) = `∞ is 1 (I.1.4) and we know that it is an isometry of L2 (T) onto L2 (Z) = `2 (I.5.5). It follows from the RieszThorin theorem that F is a transformation of norm ≤ 1 from Lp (T) into Lq (Z) = `q , which is precisely the statement of our theorem. We can add that since the exponentials are mapped with no loss in norm, the norm of F on Lp (T) into `q is exactly 1. J 2.2 Theorem. Let 1 ≤ p ≤ 2 and let q be the conjugate exponent. If {an } ∈ `p then there exists a function f ∈ Lq (T) such that an = fˆ(n). P Moreover, kf kLq ≤ ( |an |p )1/p .
P ROOF : Theorem 2.2 is the exact analog to 2.1 with the roles of the groups T and Z reversed. The proof is identical: if {an } ∈ `1 then P f (t) = an eint is continuous on T and fˆ(n) = an . The case p = 2 is again given by Theorem I.5.5 and the case 1 < p < 2 is obtained by interpolation. J 2.3 We have already made the remark (end of 1.4) that Theorem 2.1 cannot be extended to the case p > 2 since there exist continuous funcP tions f such that |fˆ(n)|2−ε = ∞ for all ε > 0. An example of such P ein log n int a function is f (t) = ∞ (see [28], vol. I, p. 199); n=2 n1/2 (log n)2 e P −2 −m/2 another example is g(t) = m 2 fm (t) where fm are the RudinShapiro polynomials (see exercise 6, part c of I.6). We can try to explain the phenomenon by a less explicit but more elementary construction. The first remark is that this, like many problems in analysis, is a problem of comparison of norms. It is sufficient, we claim, to show
112
A N I NTRODUCTION TO H ARMONIC A NALYSIS
that, given p < 2, there exist functions g such that kgk∞ ≤ 1 and P |ˆ g (n)|p is arbitrarily big. If we assume that, we may assume that our functions g are polynomials (replace g by σn (g) with sufficiently big n) and then, taking a sequence pj → 2, gj satisfying kgj k∞ ≤< 1 and P −1 imj t P |ˆ gj (n)|pj > 2j we can write f = j e gj (t) where the integers imj t mj increase fast enough to ensure that e gj (t) and eimk t gk (t) have no frequencies in common if j 6= k. The series defining f converges uniformly and for any p < 2 we have X 1 X XX 1 |ˆ gj (n)|p ≥ |ˆ g (n)|p = ∞ . |fˆ(n)|p = 2 2 j j j p >p n j j
One way to show the existence of the functions g above is to show that, given ε > 0, there exist functions g satisfying (2.1)
kgk∞ ≤ 1,
kgkL2 ≥
1 , 2
supn |ˆ g (n)| ≤ ε .
In fact, if (2.1) is valid then X X 1 |ˆ g (n)|p ≥ εp−2 |ˆ g (n)|2 ≥ εp−2 , 4 and if ε can be chosen arbitrarily small, the corresponding g will have P |ˆ g (n)|p arbitrarily large. Functions satisfying (2.1) are not hard to find; however, it is important to realize that when we need a function satisfying certain conditions, it may be easier to construct an example rather than look for one in our inventory. We therefore include a construction of functions satisfying (2.1). The key remark in the construction is simple yet very useful: if P is a trigonometric polynomial of degree N , f ∈ L1 (T) and λ > 2N is an integer, then the Fourier coefficients of ϕ(t) = f (λt)P (t) are either zero or have the form fˆ(m)Pˆ (k). This follows from the idenP tity ϕ(n) ˆ = λm+k=n fˆ(m)Pˆ (k) and the fact that there is at most one way to write n = λm + k with integers m, k such that |k| < N < λ/2. Consider now any continuous function of modulus 1 on T, which is not an exponential (of the form eint ); for example the function ψ(t) = P ˆ2 ei cos t . Since |ψ| = kψk2L2 = 1 and the sum contains more than one ˆ term, it follows that sup|ψ(n)| = ρ < 1. Let M be an integer such that M ρ < ε. Let η < 1 be such that η M > 21 . Let ϕ = σN (ψ), where the order N is high enough to ensure η < |ϕ(t)| < 1. It follows from the Q j preceding remark that if we set λ = 3N and g(t) = M j=1 ϕ(λ t), the Fourier coefficients of g are products of M Fourier coefficients of ϕ;
IV. I NTERPOLATION OF L INEAR O PERATORS
hence |ˆ g (n)| ≤ ρM < ε. On the other hand (2.1) is valid.
1 2
113
< η M < |g(t)| < 1 and
2.4 We can use the polynomials satisfying (2.1) to show also that Theorem 2.2 does not admit an extension to the case p > 2. In fact, we P can construct a trigonometric series an eint which is not a FourierP p Stieltjes series, and such that |an | < ∞ for all p > 2. Let gj be a trigonometric polynomial satisfying (2.1) with ε = 2−j . Since now p > 2 we have X X |ˆ gj (n)|p ≤ εp−2 |ˆ gj (n)|2 ≤ 2−j(p−2) P imj t je gj (t) = and consequently, for any choice of the integers mj , P P an eint does satisfy |an |p < ∞ for all p > 2. We now choose the integers mj increasing very rapidly in order to well separate the blocks corresponding to jeimj t gj (t) in the series above. If we denote by Nj the degree of the polynomial gj , we can take mj so that mj − 3Nj > P mj−1 + 3Nj−1 . If an eint is the Fourier-Stieltjes series of a measure µ then µ ∗ eimj t VNj = jeimj t gj
(VNj being de la Vallée Poussin’s kernel)
and consequently 3kµkM (T) > jkgj kL1 >
j 4
which is impossible. We have thus proved Theorem. (a) There exists a continuous function f such that for all P p < 2, |fˆ(n)|p = ∞. P (b) There exists a trigonometric series, an eint , which is not a FourierP Stieltjes series, such that |fˆ(n)|p < ∞ for all p > 2.
Both statements can be improved. See Appendix B. 2.5 We finish this section with another construction: that of a set E of positive measure on T which carries no function with Fourier coefficients in `p for any p < 2. Such a set clearly must be totally disconnected and therefore carries no continuous functions. Its indicator function, however, is a bounded function whose Fourier coefficients belong to no `p , p < 2. Theorem. There exists a compact set E on T such that E has positive measure and such that, the only function f carried by E with P ˆ p |f (j)| < ∞ for some p < 2, is f = 0.
114
A N I NTRODUCTION TO H ARMONIC A NALYSIS
First, we introduce the notation† kf kF `∞ = sup|fˆ(j)|
(2.2)
kf kF `p =
X
|fˆ(j)|p
1/p
;
and prove: Lemma. Let ε > 0, 1 ≤ p < 2. There exists a closed set Eε,p ⊂ T having the following properties: (1) The measure of Eε,p is > 2π − ε. (2) If f is carried by Eε,p then kf kF `∞ ≤ εkf kF `p .
P ROOF : Let γ > 0. Put ( ϕγ (t) =
γ−2π γ
for 0 < t < γ
1
for γ ≤ t ≤ 2π mod 2π.
mod 2π
Then, by Theorem 2.1 (2.3)
1
kϕγ kF `q ≤ kϕγ kLp ≤ 2πγ p −1 ,
where
1 1 + = 1. p q
We notice that ϕˆγ (0) = 0 so that, if we choose the integers λ1 , λ2 , . . . , λN P increasing fast enough, every Fourier coefficient of N 1 ϕγ (λj t) is essentially a Fourier coefficient of one of the summands. It then follows that (2.4)
N
1 X
1
ϕγ (λj t) ≤ N q −1 kϕγ kF `q .
q N 1 F`
We take a large value for N and put γ = ε/N and Φ(t) =
N 1 X ϕγ (λj t). N 1
Then, by (2.3) and (2.4), it follows that 1
1
1
1
1
kΦkF `q ≤ 4πγ p −1 N q −1 = 4πε p −1 N q − p
so that if N is large enough kΦkF `q ≤ ε. We can take Eε,p = {t : Φ(t) = 1} =
N \ 1
† Notice
that k kF `1 is the same as k kA(T) .
{t : ϕγ (λj t) = 1}.
IV. I NTERPOLATION OF L INEAR O PERATORS
115
Since ϕγ (λj t) 6= 1 on a set of measure γ , it follows that |Eε,p | ≥ 2π − N γ = 2π − ε.
Now if f is carried by Eε,p , then for arbitrary n, Z Z 1 1 e−int f (t)dt = e−int f (t)Φ(t)dt. fˆ(n) = 2π 2π It follows from Parseval’s formula that X ˆ |fˆ(n)| = | fˆ(n − m)Φ(m)| ≤ kΦkF `q kf kF `p ≤ εkf kF `p ; and the proof of the lemma is complete.
J
−n P ROOF OF THE THEOREM : Take E = ∩∞ , and n=1 Eεn ,pn where εn = 3 pn = 2 − εn . The measure of E is clearly positive, and if f is carried by E and kf kF `q < ∞, it follows that for all n large enough
kf kF `∞ ≤ εn kf kF `pn ≤ εn kf kF `p ,
hence fˆ = 0 and so f = 0.
J
EXERCISES FOR SECTION 2 1. Verify that 2−(m+1)/2 fm (fm , as defined in exercise 6 part c) of I.6, satisfy (2.1) when 2−(m+1)/2 < ε. 2. Show that ifN > ε−1 and if mn increases fast enough, then g , defined by: g(t) = eiN mn t for 2πn/N ≤ t ≤ 2π(n + 1)/N, n = 0, . . . , N , satisfies (2.1). 3. Let {an } be an even sequence of positive numbers. A closed set E ⊂ T is a set of type U (an ) if the only distribution µ carried by E and satisfying µ ˆ(n) = o(an ) as |n| → ∞, is µ = 0. Show that if an → 0 there exist sets E of positive measure which are of type U (an ). Hint: For 0 < a < π we write (see exercise 3 of I.6): ∆a (t) =
(
1 − a−1 |t|
|t| ≤ a
0
a ≤ |t| ≤ π .
ˆ a (0) = a/2π . Choose nj so that We have ∆a ∈ A(T), k∆a kA(T) = 1, and ∆ −j |n| > nj implies an < 10 ; put Ej = {t : ∆2−j (2nj t) = 0} and E = ∩∞ j=1 Ej . P Notice that |E| ≥ 2π − 21−j > 0. If µ is carried by E we have, for all m and j , heimt ∆3−j (2nj t) , µi = 0 since ∆3−j (2nj t) vanishes in a neighborhood of E . By Parseval’s formula 0 = heimt ∆3−j (2nj t) , µi =
X 3−j \ µ ˆ(m) + ∆ µ(m + 2nj k). 3−j (k)ˆ 2π k6=0
116
A N I NTRODUCTION TO H ARMONIC A NALYSIS
If nj > |m| and if |ˆ µ(n)| ≤ an we have for k ≥ 0, |ˆ µ(m + 2nj k)| < 10−j , hence −j −j (3 /2π)|ˆ µ(m)| < 10 . Letting j → ∞ we obtain µ ˆ(m) = 0, and, m being arbitrary, µ = 0.
Chapter V
Lacunary Series and Quasi-analytic Classes
The theme of this chapter is that of I.4, namely, the study of the ways in which properties of functions or of classes of functions are reflected by their Fourier series. We consider important special cases of the following general problem: let Λ be a sequence of integers and B a homogeneous Banach space on T; denote by BΛ the closed subspace of B spanned by {eiλt }λ∈Λ or, equivalently, the space of all f ∈ B with Fourier series of the form P iλt . Describe the properties of functions in BΛ in terms of λ∈Λ aλ e their Fourier series (and Λ). An obvious example of the above is the case of a finite Λ in which all the functions in BΛ are polynomials. If Λ is the sequence of nonnegative integers and B = Lp (T), 1 < p < ∞, then BΛ is the space of boundary values of functions in the corresponding H p . In the first section we consider lacunary sequences Λ and show, for instance, that if Λ is lacunary à la Hadamard then (L1 (T))Λ = (L1 (T))Λ and every bounded function in (L1 (T))Λ has an absolutely convergent Fourier series. In the second section we prove the Denjoy-Carleman theorem on the quasi-analyticity of classes of infinitely differentiable functions and discuss briefly some related problems. 1 LACUNARY SERIES
1.1 A sequence of positive integers {λn } is said to be Hadamard lacunary, or simply lacunary, if there exists a constant q > 1 such that P an z λn is lacunary if the seλn+1 > qλn for all n. A power series quence {λn } is, and a trigonometric series is lacunary if all the frequencies appearing in it have the form ±λn where {λn } is lacunary. The reason for mentioning Hadamard’s name is his classical theo-
117
118
A N I NTRODUCTION TO H ARMONIC A NALYSIS
rem stating that the circle of convergence of a lacunary power series is a natural boundary for the function given by the sum of the series within its domain of convergence. The general idea behind Hadamard’s theorem and behind most of the results concerning lacunary series is that the sparsity of the exponents appearing in the series forces on it a certain homogeneity of behavior. 1.2 Lacunarity can be used technically in a number of ways. Our first example is "local"; it illustrates how a Fourier coefficient that stands apart from the others is affected by the behavior of the function in a neighborhood of a point. Lemma. Let f ∈ L1 (T) and assume that fˆ(j) = 0 for all j satisfying 1 ≤ |n0 − j| ≤ 2N . Assume that f (t) = O (t) as t → 0. Then (1.1) |fˆ(n0 )| ≤ 2π 4 N −1 sup|t|
We use the condition fˆ(j) = 0 for 1 < |n0 −j| < 2N as follows: if gN be any polynomial of degree 2N satisfying gˆN (0) = 1, then Z 1 ˆ f (n0 ) = e−in0 t f (t)gN (t)dt. 2π PROOF :
2 As gN we take the Jackson kernel, JN = kKN k−2 L2 KN . By I.(3.10), and 2 P |j| the estimate kKN k2L2 = N > N2 , we obtain −N 1 − N +1
JN (t) < 2π 4 N −3 t−4 .
We now write 1 2π
|fˆ(n0 )| ≤ =
Z
Z
|f (t)|JN (t)dt = +
|t|
Z
+
N −1 <|t|
Z
N −1/4 <|t|<π
!
1 |f (t)|JN (t)dt. 2π
The first integral is bounded by Z 1 N −1 sup|t|
π N
−3
sup|t|
−1
f (t)|
Z
N −1/4 N −1
t−3 dt ≤ π 3 N −1 sup|t|
V. L ACUNARY S ERIES AND Q UASI - ANALYTIC C LASSES
119
The third integral is bounded by Z π 3 N −2 |f (t)|dt = 2π 4 N −2 kf kL1 . Adding up the three estimates we obtain (1.1).
J P
Corollary. Let {λn } be a lacunary sequence and f ∼ an cos λn t 1 be in L (T). Assume that f is differentiable at one point. Then an = o(λ−1 n ). PROOF : Assume that f is differentiable at t = 0. Replacing it, if necessary, by f − f (0) cos t − f 0 (0) sin t we can assume f (0) = f 0 (0) = 0. It follows that f (t) = o(t) as t → 0. The lacunarity condition on {λn } is equivalent to saying that there exists a positive constant c such that, for all n, none of the numbers j satisfying 1 ≤ |λn − j| ≤ cλn , is in the sequence; hence fˆ(j) = 0 for all such j . Applying the lemma with n0 = λn and 2N = cλn , we obtain an = 2fˆ(λn ) = o(λ−1 J n ). P Corollary. The Weierstrass function 2−n cos 2n t is nowhere differentiable.
P The condition an = o(λn−1 ) clearly implies that |an | < ∞. It is not P hard to see (see Zygmund [28], chap. 2, §3, 4) that f (t) = an cos λn t is then in Lipα (T) for all α < 1 and that it is differentiable on a set having the power of the continuum in every interval. Thus, for a lacunary series, differentiability at one point implies differentiability on an everywhere dense set. This is one example of the "certain homogeneity of behavior" mentioned earlier. We can obtain a more striking result if instead of differentiability we consider Lipschitz conditions. For instant, if 0 < α < 1, a lacunary series that satisfies a Lipα condition at a point satisfies the same condition everywhere (see exercise 1 at the end of the section).
1.3 Another typical use of the condition of lacunarity is through its arithmetical consequences. A useful remark is that if λj+1 ≥ qλj with q ≥ 3, then every integer n has at most one representation of the form P n= ηj λj where ηj = −1, 0, 1. With this remark in mind we consider products of the form
(1.2)
PN (t) =
N Y 1
1 + aj cos(λj t + ϕj )
120
A N I NTRODUCTION TO H ARMONIC A NALYSIS
the aj ’s being arbitrary complex numbers and ϕj ∈ T. The Fourier coefficients of a factor 1 + aj cos(λj t + ϕj ) are: 1 for n = 0, 12 aj ieiϕj for n = λj ), 12 aj ie−iϕj n = −λj ), and zero elsewhere. If we assume the lacunarity condition with q ≥ 3, it follows P that PˆN (n) = 0 unless n = ηj λj , with ηj = −1, 0, 1, in which case Q PˆN (n) = ηj 6=0 12 aj ieiηj ϕj ; in particular PˆN (0) = 1. If we compare the Fourier series of PN +1 to that of PN we see that PN +1 contains PN as a partial sum, and contains two more blocks: 12 aN +1 ieiϕN +1 eiλN +1 t PN and 12 aN +1 ie−iϕN +1 e−iλN +1 t PN . The frequencies appearing in the first P PN block lie within the interval (λN +1 − N 1 λj , λN +1 + 1 λj ) ⊂ (λN +1 (q− 2)/(q − 1), λN +1 q/(q − 1)) and the second block is symmetric to the first with respect to the origin. No matter what coefficients aj we take, the (formal) infinite product P (t) =
∞ Y 1
1 + aj cos(λj t + ϕj )
can be expanded as a well-defined trigonometric series, and if the product converges in the weak-star topology of M (T) to a function f or a measure µ, then the corresponding trigonometric series is the Fourier series of f (resp. µ). We shall refer to the finite or infinite products described above as Riesz products. Two classes of Riesz products will be of special interest. 1. The coefficients aj are all real and |aj | ≤ 1. In this case 1 + aj cos(λj t+ϕj ) ≥ 0 hence PN (t) ≥ 0 for all N . It follows that kPN kL1 = 1 and, taking a weak-star limit point, it follows that P is a positive measure of total mass 1 (i.e., that the trigonometric series formally corresponding to P is ’the Fourier-Stieltjes series of a positive measure of mass 1). 2. The coefficients aj are purelyimaginary (in which case we shall Q P write P (t) = 1 + iaj cos(λj t + ϕj ) with aj real) and satisfy |aj |2 < ∞. In this case 1 < |1 + iaj cos(λj t + ϕj )|2 ≤ 1 + a2j 1 ≤ |PN (t)|2 ≤ Q∞ 2 1 (1 + aj ) < ∞. Since the PN are uniformly bounded we can pick a sequence Nj such that PNj converge weakly to a bounded function P whose Fourier series is the formal expansion of P . 1.4 The usefulness of the Riesz products can be seen in the proof of Lemma. Let f (t) =
PN
−N
cj eiλj t with λ−j = −λj , λ1 > 0 and, for
V. L ACUNARY S ERIES AND Q UASI - ANALYTIC C LASSES
121
some q > 1, λj+1 > qλj , j = 1, 2, . . . , N . Then X (1.3) |cj | ≤ Aq kf k∞ and kf kL2 ≤ Bq kf kL1
(1.4)
where Aq and Bq are constants depending only on q . PROOF : We remark first that it is sufficient to prove (1.3) and (1.4) in the case that f is real valued (i.e., cj = c¯−j ) since we can then apply them separately to the real and imaginary parts of arbitrary f , thereby at most doubling the constants Aq and Bq . Assume first that q > 3. In order to prove (1.3) we consider the Q Riesz product P (t) = N 1 + cos(λ t + ϕ ) where ϕj is defined by j j 1 iϕj 1 the condition c ¯ e = |c | . We have kP k j j L = 1 and consequently R |1/2π P (t)f (t)dt| ≤ kf k∞ . Since Pˆ (λj ) = 12 eiϕj we obtain from ParP P seval’s formula: 12 c¯j eiϕj = 21 |cj | ≤ kf k∞ , and (1.3) follows with Aq = 2 for real-valued f and Aq = 4 in the general case. For the proof of (1.4) we consider a Riesz product of the second P type. We remark that kf k2L2 = |cj |2 and if we take aj = |cj |·kf k−1 L2 Q and ϕj such that icj eiϕj = |cj | then P (t) =P 1 + iaj cos(λj t + ϕj ) Q 2 1 1 1 is uniformly bounded by (1 + a2j ) 2 ≤ e 2 aj ≤ e 2 . By Parseval’s formula Z 1 1 1X 2 |cj |aj = kf kL = P (t)f (t)dt ≤ e 2 kf kL1 2 2π 1
1
which is (1.4) with Bq = 2e 2 . Again if we put Bq = 4e 2 then (1.4) is valid for complex-valued functions as well. If 1 < q < 3 and we try to repeat the proofs above, we face the difficulty that, having set the product P the way we did, we cannot assert that Pˆ (λj ) is 12 eiϕj (or 12 iaj eiϕj in case 2) since λj may happen to satP isfy nontrivial relations of the form λj = ηk λk with ηk = 0, 1, −1. We can, however, construct the Riesz products for subsequences of {λj }. Let M = Mq be an integer large enough so that (1.5)
q M > 3,
1−
1 1 > qM − 1 q
and 1 +
1 < q. qM − 1
(m) (m) = λm+jM and notice that λj+1 > q M λj . For k ≤ m < M write λ(m) j By the remark concerning the frequencies appearing in a Riesz product
122
A N I NTRODUCTION TO H ARMONIC A NALYSIS
it follows that all the frequencies n appearing in any product correλ
(m)
(m) sponding to {λ(m) } satisfy ||n| − λj | < qMj −1 for some j , hence by j (1.5) if k > 0, k 6≡ m mod M , ±λk does not appear as a frequency in a Riesz product constructed on {λ(m) }. It follows that if j
P (t) =
N Y 1
1 + am+jM cos(λm+jM t + ϕm+jM )
then Z X1 1 P (t)f (t)dt = am+jM eiϕm+jM cm+jM + e−iϕm+jM c−m−jM 2π 2 and repeating the two constructions used above we obtain X (1.3’) |cm+jM | ≤ 4kf k∞ X
(1.4’)
|cm+jM |2
21
1
≤ 4e 2 kf k1
Adding (1.3’) and (1.4’) for m = 1, . . . , M we obtain (1.3) and (1.4) 1 with Aq = 4Mq and Bq = 4e 2 Mq . J P iλj t Theorem. Let {λj } be lacunary. (a) If f = cj e is the Fourier P series of a bounded function, then |cj | < ∞. P P (b) If cj eiλj t is a Fourier series, then |cj |2 < ∞. PROOF :
Write f ∼
P
cj eiλj t and apply (1.3) resp.(1.4) to σn (f, t).
J
1.5 The role of the Riesz products in the proof of Lemma 1.4 may become clearer if we consider the statements obtained from 1.4 by duality. For an arbitrary sequence of integers Λ, we denote by CΛ the space of all continuous functions f on T such that fˆ(n) = 0 if n 6∈ Λ. CΛ is clearly a closed subspace of C(T).
D EFINITION : A set of integers Λ is a Sidon set if every f ∈ CΛ has an absolutely convergent Fourier series. It follows from the closed-graph theorem that Λ is a Sidon set if, and only if, there exists a constant K such that X (1.6) |fˆ(n)| ≤ Kkf k∞ for every polynomial f ∈ CΛ .
V. L ACUNARY S ERIES AND Q UASI - ANALYTIC C LASSES
123
Lemma. A set (of integers) Λ is a Sidon set if, and only if, for every bounded sequence {dλ }λ∈Λ there exists a measure µ ∈ M (T) such that µ ˆ(λ) = dλ for λ ∈ Λ.
P ROOF : Let Λ be a Sidon set and {dλ }λ∈Λ a bounded sequence on Λ. P The mapping f 7→ λ∈Λ fˆ(λ)d¯λ is a well-defined linear functional on CΛ . By the Hahn-Banach theorem it can be extended to a functional on C(T), that is, a measure µ. For this measure µ we have Z (1.7) µ ˆ(λ) = eiλt dµ = dλ for all λ ∈ Λ. Assume, on the other hand, that the interpolation (1.7) is always possible. Let f ∈ CΛ and write dλ = sgn (fˆ(λ)). Then, by Parseval’s forP P mula, |fˆ(λ)| = fˆ(λ)dλ is summable to hf, µi where µ is a measure which satisfies (1.7). Since for series with positive terms summability P is equivalent to convergence, |fˆ(λ)| < ∞ and the proof is complete. J The statement of part (a) of Theorem 1.4 is that lacunary sequences are Sidon sets, and the Riesz product is simply an explicit construction of corresponding interpolating measures. 1.6 The statement of part (b) of Theorem 1.4 is that for lacunary Λ, P (L1 T))Λ = (L2 (T))Λ . Every sequence {dλ } such that |dλ |2 < ∞ defines, as above, a linear functional on (L2 (T))Λ which, by 1.4, is a closed subspace of L1 (T). Remembering that the dual space of L1 (T) is L∞ (T), we obtain, using the Hahn-Banach theorem, that there exists a bounded measurable function g such that
(1.8)
gˆ(λ) = dλ
λ ∈ Λ.
Here, again, Riesz products (of type 2) provide explicit construction of such functions g . One can actually prove the somewhat finer result: P Theorem. Let Λ be lacunary and assume that |dλ |2 < ∞. Then there exists a continuous function g such that (1.8) is valid. We refer the reader to exercise 6 for the proof. EXERCISES FOR SECTION 1 P
1. Let {λn } be lacunary and let f ∼ an cos λn t. Assume that f satisfies a Lipα condition with 0 < α < 1 at t = t0 . Show that an = O λ−α as n → ∞. n Deduce that f ∈ Lipα (T).
124
A N I NTRODUCTION TO H ARMONIC A NALYSIS
2. Let {λn } be a sequence of integers Pand assume that for some 0 < α < 1 the following statement is true: if f ∼ an cos λn t satisfies a Lipα condition at one point, then f ∈ Lipα (T). Show that {λn } is lacunary. Hint: If the sequence {λn } is not lacunary it has a subsequence {µk } such that lim µ2k−1 /µ2k = 1 and lim µ2k+1 /µ2k = ∞. For an appropriate sequence {ak }, P the function f (t) = ak (cos µ2k t − cos µ2k−1 t) satisfies a Lipα condition at t = 0 but f 6∈ Lipα (T). P 3. Let f ∈ L1 (T), f ∼ an cos λn t with {λn } lacunary. Assume f (t) = 0 for |t| < η , η being a positive number. Show that f is infinitely differentiable. 4. Show PN directly, without the use of Riesz products, that if λn+1 > 4λn and f (t) = 1 an cos λn t is real-valued, then 1X |an |. 2 Hint: Consider the sets {t : an cos λn t > |an /2|}. 5. If dn → 0 as n → ∞ we can write dn = δn ψn where {δn } is bounded ˆ and ψn = ψ(n) for some ψ ∈ L1 (T). (See theorem 1.4.1 and exercise 1.4.1.) Deduce that if Λ is a lacunary sequence and dλ → 0 as |λ| → ∞, there exists a function g ∈ L1 (T) such that
sup|f (t)| ≥
dλ = gˆ(λ) for λ ∈ Λ
6. Use Theorem I.4.1 to show thatPif |dn |2 < ∞, there exist sequences ˆ {δn } and {ψn } such that dn = δn ψn , |δn |2 < ∞, and ψn = ψ(n) for some 1 ψ ∈ L (T). Remembering that the convolution of a summable function with a bounded function is continuous, prove Theorem 1.6. 7. Assume λj+1 /λj > q > 1. There exists a number M = Mq such that P every integer n has at most one representation of the form n = ηj λmj +jM where ηj = −1, 0, 1, and 1 ≤ mj ≤ M . Use this to show that the product Q∞ PM (1 + m=1 dm+jM cos(λm+jM t + ϕm+jM )) has (formally) the Fourier co1 efficient 12 dk eiϕk at the point λk ). Show that if 0 < dk < I/Mq for all k, then the product above is the Fourier Stieltjes series of a positive measure which interpolates { 12 dk eiϕk } on {λk }. P 8. Assume λj+1 /λj > q > 1 and |dj |2 < ∞. Find a product analogous to that of exercise 7), which is the Fourier series of a bounded function, and which interpolates {dj } on {λj }. *9. Show that the following condition is sufficient to imply that the sequence Λ is a Sidon set: to every sequence {dλ } such that |dλ | ≤ 1 there exists a measure µ ∈ M (T) such that |ˆ µ(λ) − dλ | < 12 . 10. Show that a finite union of lacunary sequences is a Sidon set. *11. Let λn be positive integers such that λn+1 /λn ≥ 3. Show that for every P 2U > 0 and ε > 0 there exists a > 0 such that if bn are real numbers, |bn | = 2 and sup |bn | ≤ a, then, if |u| < U , we have
P
(1.9)
Z P u2 1 eiu bn cos λn t − e− 2 < ε. 2π
V. L ACUNARY S ERIES AND Q UASI - ANALYTIC C LASSES
125
eiubn cos λn t = 1 + iubn cos λn t − 21 u2 b2n cos2 λn t (1 + cn ) Hint: Write Q 3 3 3 << ε, and the factor with Q |cn | ≤ U |bn | . If aU << ε, we have (1+cn )−1 2 (1+cn ) can be ignored. In the main factor replace cos λn t by 12 (1+cos 2λn t), and check that the constant term of the product is the product of the constant terms of the factors.
Q
Q
?2 QUASI-ANALYTIC CLASSES
2.1 We consider classes of infinitely differentiable functions on T. Let {Mn } be a sequence of positive numbers; we denote by C ∗ {Mn } the class of all infinitely differentiable functions f on T such that for an appropriate R > 0
(2.1)
kf (n) k∞ ≤ Rn Mn
n = 1, 2, . . .
We shall denote by C # {Mn } the class of infinitely differentiable functions on T satisfying: (2.2)
kf (n) kL2 ≤ Rn Mn
n = 1, 2, . . .
for some R (depending on f ). The inclusion C ∗ {Mn } ⊂ C # {Mn } is obvious; on the other hand, since the mean value of derivatives on T is zero, we obtain kf (n) (t)k∞ ≤ kf (n+1) kL2 and consequently C # {Mn } ⊂ C ∗ {Mn+1 }. Thus the two classes are fairly close to each other. Examples: If Mn = 1 for all n, then C # {Mn } is precisely the class of all trigonometric polynomials on T. If Mn = n!, C # {Mn } is precisely the class of all functions analytic on T. (See exercise I.4.3) We recall that a sequence {cn }, cn > 0, is log-convex if the sequence {log cn } is a convex function of n. This amounts to saying that, given k < l < m in the range of n, we have (2.3)
log cl ≤
m−l l−k log ck + log cm m−k m−k
or equivalently (2.4)
(m−l)/(m−k) (l−k)/(m−k) cm
cl ≤ ck
P 1 2.2 The identity kf (n) kL2 = ( fˆ(j)2 j 2n ) 2 allows an expression of condition (2.2) directly in terms of the Fourier coefficients of f . Also it implies
126
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Lemma. Let f be N times differentiable on T. Then the sequence {kf (n) kL2 } is monotone increasing and log-convex for 1 ≤ n ≤ N . P 1 P ROOF : The fact that kf (n) kL2 = ( fˆ(j)2 j 2n ) 2 is monotone increasing is obvious. In order to prove (2.4) we write p = (m − k)/(m − l), and q = (m − k)/(l − k); then 1/p + l/q = 1 and by Hölder’s inequality P ˆ 2 2l P 2/p 2/q |f (j)| j = (|fˆ(j)|2/p j 2k/p )(|fˆ(j)|2/q j 2m/q ) ≤ kf (k) kL2 kf (m) kL2
which is exactly (2.4).
J
It follows from lemma 2.2 (cf. exercise 2 at the end of this section) that for every sequence {Mn0 } there exists a sequence {Mn } which is monotone increasing and log-convex such that C # {Mn } = C # {Mn0 }. Thus, when studying classes C # {Mn } we may assume without loss of generality that {Mn } is monotone increasing and log-convex; throughout the rest of this section we always assume that, for k < l < m, (2.5)
(m−l)/(m−k)
Ml ≤ Mk
(l−k)/(m−k) Mm
2.3 For a (monotone increasing and log-convex) sequence we define the associated function τ (r) by
(2.6)
τ (r) = inf Mn r−n . n≥0
We consider sequences Mn which increase faster that Rn for all R > 0; the infimum in (2.6) is attained and we can write τ (r) = minn≥0 Mn r−n . If we write µ1 = M1−1 , and µn = Mn−1 /Mn for n > 1; then µn is monotone-decreasing since by (2.5), µn+1 /µn = Mn2 /Mn−1 Mn+1 < 1; Q we have Mn r−n = n1 (µj r)−1 and consequently (2.6’)
τ (r) =
Y
(µj r)−1 .
µj r>1
The function τ (r) was implicitly introduced in 1.4; thus it follows from I.4.4 that if f ∈ C # {Mn } then, for the appropriate R > 0 |fˆ(j)| ≤ τ (jR−1 ),
and exercise 1.4.6 is essentially an estimate for τ (r) in the case Mn = nαn .
V. L ACUNARY S ERIES AND Q UASI - ANALYTIC C LASSES
127
2.4 An analytic function on T is completely determined by its Taylor expansion around any point to t0 ∈ T, that is, by the sequence (n) {f (n) (t0 )}∞ (t0 ) = 0, n = 0, 1, 2, . . . , it follows n=0 . In particular if f that f = 0 identically. D EFINITION : A class of infinitely differentiable functions on T is quasi-analytic if the only function in the class, which vanishes with all its derivatives at some t0 ∈ T, is the function which vanishes identically. The main result of this section is the so-called Denjoy-Carleman theorem which gives a necessary and sufficient conditions for the quasianalyticity of classes C # {Mn }. Theorem. Let {Mn } be monotone increasing and log-convex. Let τ (r) be the associated function (2.6). The following three conditions are equivalent: (i) (ii) (iii)
C # {Mn } is quasi-analytic Z ∞ log τ (r) dr = −∞ 1 + r2 1 X Mn =∞ Mn+1
The proof will consist in establishing the three implications (ii) ⇒ (i) (Theorem 2.4 below), (i) ⇒ (iii) (Theorem 2.8), and (iii) ⇒ (ii) (Lemma 2.9). We begin with: 2.5 Lemma. Let ϕ(z) 6≡ 0 be holomorphic and bounded in the half plane <(z) > 0 and continuous on <(z) ≥ 0. Then Z ∞ dy log|ϕ(±iy)| > −∞ 1 + y2 0 1+ζ P ROOF : The function F (ζ) = ϕ 1−ζ is holomorphic and bounded in ¯ the unit disc D (and R π is continuous on D except possibly at ζ = 1). By III.3.14 we have 0 log|F (eit )|dt > −∞. The change of variables that we have introduced gives for the boundaries eit = (iy − 1)/(iy + 1), or t = 2 arc cot y . Consequently dt = −2dy 1+y 2 and Z ∞ Z 1 π dy log|ϕ(iy)| = log|F (eit )|dt > −∞; 1 + y2 2 0 0
128
similarly
A N I NTRODUCTION TO H ARMONIC A NALYSIS
R∞ 0
dy log|ϕ(−iy)| 1+y 2 > −∞ and the lemma is proved.
J
2.6 Theorem. A sufficient for the quasi-analyticity of the R ∞ condition τ (r) class C # {Mn } is that 1 log 1+r 2 dr = −∞ where τ (r) is defined by (2.6).
P ROOF : Let f ∈ C # {Mn } and assume that f (n) (0) = 0 n = 0, 1, . . . . Define Z 2π 1 e−zt f (t)dt. ϕ(z) = 2π 0 Integrating by parts we obtain, z 6= 0, ϕ(z) =
2π 1 −1 −zt 1 e f (t) 0 + 2π z 2πz
Z
2π
e−zt f 0 (t)dt
0
and since f (0) = f (2π) = 0 the first term vanishes for all z 6= 0 (we have used the same integration by parts in I.4.5; there we did not assume f (0) = 0 but considered only the case z = im, that is, e−zt f is 2π periodic.) Repeating the integration by parts n times (using f (j) (0) = f (j) (2π) = 0 for j ≤ n), we obtain ϕ(z) =
1 2πz n
Z
2π
e−zt f (n) (t)dt.
0
For <(z) ≥ 0, |e−zt | ≤ 1 on (0, 2π) and consequently |ϕ(z)| ≤
Mn |z|n
for n = 0, 1. . . .
hence |ϕ(z)| ≤ τ (|z|)
or log|ϕ(z)| ≤ log τ (|z|). R∞
dy It follows that 1 log|ϕ(iy)| 1+y 2 = −∞ and by lemma 2.4 ϕ(z) = 0. ˆ Since ϕ(in) = f (n) it follows that f = 0. J
P Q∞ sin µj k 2.7 Lemma. Assume µj > 0, ∞ 0 µj ≤ 1. Write ϕ(k) = 0 µj k . P∞ ikt Then f (t) = −∞ ϕ(k)e is carried by [−1, 1] ( mod 2π ), it is inQ finitely differentiable and kf (n) k ≤ 2 n0 µ−1 j .
V. L ACUNARY S ERIES AND Q UASI - ANALYTIC C LASSES
129
PROOF : All the factors in the product defining ϕ(k) are bounded by 1 so that the product either converges or diverges to zero (actually it converges for all k) and ϕ(k) is well defined. ϕ(k) clearly tends to zero faster than any power of k so that the series defining f converges uniformly and f isninfinitely o∞differentiable. We have ϕ(0) = 1 so that f 6≡ 0. sin µj k The sequence is the sequence of Fourier coefficients of µj k k=−∞ QN sin µj k the function Γj (t) = πµ−1 j 11[−µj ,µj ] . If we write ϕN (k) = 0 µj k , we have ∞ X fN (t) = ϕN (k)eikt = Γ0 ∗ Γ1 ∗ . . . ΓN −∞
P PN and the support of fN is equal to [− N 2π . Since fN 0 µj , 0 µj ] mod P P∞ converges uniformly to f , the support of f is equal to [− ∞ µj , 0 µj ] 0 P mod 2π . Finally, since kf (n) k2L2 = |ϕ(k)|2 k 2n and |ϕ(k)| ≤
n Y 0
we obtain kf (n) kL2 plete.
n Y (µj k)−1 = ( µj )−1 k −n−1 , 0
Qn P ≤ ( 0 µj )−1 ( k6=0 k −2 )1/2 and the proof is comJ
2.8 Theorem. A necessary condition for the quasi-analyticity of the P Mn class C # {Mn } is that Mn+1 = ∞. P Mn P ROOF : Assume that Mn+1 < ∞. Without loss of generality we may P Mn 1 assume (replacing Mn by Mn0 = Mn Rn does not change < Mn+1 2 P Mn P Mn0 the class C # {Mn } while = R−1 0 Mn+1 Mn+1 ). Write µ0 = µ1 = 1/4, µj = Mj−1 /Mj , j ≥ 2. Then the function f defined by Lemma 2.7 has a zero of infinite order (actually vanishes outside of [−1, 1]), is not identically zero, and f ∈ C # {Mn }. J 2.9 Lemma. Under the assumption of theorem 2.4 we have Z ∞ X Mn log τ (r) 4 ≤ 2e dr. Mn+1 1 + r2 2 e PROOF :
As before we write µn = tion M(r) of {µn } by:
Mn−1 Mn .
We define the counting func-
M(r) = the number of elements µj such that µj r > e,
130
A N I NTRODUCTION TO H ARMONIC A NALYSIS
and recall that τ (r) = − log τ (r) =
Q
−1 ; µj r>1 (µj r)
X
log(µj r) ≥
hence X
log(µj r) ≥ M(r).
µj r>e
µj r>1
Thus for k = 2, 3, . . . (2.7)
Z
ek+1 ek
M(ek ) − log τ (r) dr ≥ 2k+2 2 1+r 2e
Z
ek+1
dr > ek
1 M(ek ) ; 2e2 ek
on the other hand, (2.8)
X
e1−k <µj <e
M(ek ) µj ≤ M(ek ) − M(ek−1 ) e2−k ≤ e2 ek 2−k
and the theorem follows by summing (2.7) and (2.8) with respect to k, k = 2, 3, . . . . J Remark: Theorems 2.4, 2.8, and lemma 2.9 together prove Theorem 2.4. We see in particular that if C # {Mn } is not quasi-analytic, it contains functions (which are not identically zero) having arbitrarily small supports. For further reading, generalizations, and related topics we mention [17]]. EXERCISES FOR SECTION 2 1. Show that {cn } is log-convex if, and only if, c2n ≤ cn−1 cn+1 for all n. ∞ 2. (a) Let {cα n }n=1 be a log-convex sequence for all α belonging to some index set I . Assume that Mn = supα∈I cα n < ∞ for all n. Prove that {Mn } is log-convex. (b) Let {Mn0 } be a sequence of positive numbers. Let {cα n } be the family 0 α of all log-convex sequences satisfying cα n ≤ Mn for all n. Put Mn = supα cn . # # 0 Then C {Mn } = C {Mn }. 3. Let Mj ≤ j! for infinitely many values of j . Show that C ∗ {Mn } and C # {Mn } are quasi-analytic. Hint: Assuming f ∈ C ∗ {Mn } and f (k) (0) = 0 for all k, use Taylor’s expansion with remainder to show f ≡ 0. 4. We say that a function ϕ ∈ C ∞ (T) is quasi-analytic if C # {kϕ(n) kL2 } is quasi-analytic. Let f ∈ C ∞ (T); show that if the sequence {λj } increases fast enough and if we set f1 (t) =
XX j
λ2j < k ≤ λ2j+1 fˆ(k)eikt ,
V. L ACUNARY S ERIES AND Q UASI - ANALYTIC C LASSES
131
then both f1 and f2 = f − f1 are quasi-analytic. Thus, every infinitely differentiable function is the sum of two quasi-analytic functions. 5. Show that C # {n!(log n)αn } is quasi-analytic if 0 ≤ α ≤ 1, and is nonquasi-analytic if α > 1. 6. Let τ (r) be the function associated with a sequence {Mn }. (a) Show that (τ (r))−1 is log-convex function of r. (b) Show that Mn = maxr rn τ (r). 7. Let {ωn } be a log-convex sequence, n = 0, 1, .P . . , ωn ≥ 1, and let A{ωn } be the space of all f ∈ C(T) such that kf k{ωn } = |fˆ(n)|ω|n| < ∞. Show that with the norm k k{ωn } , A{ωn } is a Banach space. Show that a necessary and sufficient P∞condition for A{ωn } to contain functions with arbitrarily small support is 1 logn2ωn < ∞. 8. Let {ωn } be log-convex, ωn ≥ 1, and assume that ωn → ∞ faster than k ∞ any power of n. The sequences σn = ωn n=−∞ tend to zero as |n| → ∞. |n| Show that the subspace that σn , k = 0, 1, . . . generate in c0 (the space of sequences tending to zero at ∞) is uniformly dense in c0 if, and only if, σ logn2ωn = ∞ Hint: The dual space is `1 . If {an } ∈ `1 is orthogonal to σk , k = 0, . . . , Pofanc0int the function f (t) = , which clearly belongs to A{ωn }, has a zero of e ωn infinite order. 9. Let f be as in exercise 1.3. Show that f = 0 identically.
Chapter VI
Fourier Transforms on the Line
In the preceding chapters we studied objects (functions, measures, and so on) defined on T. Our aim in this chapter is to extend the study to objects defined on the real line R. Much of the theory, especially the L1 theory, extends almost verbatim and with only trivial modifications of the proofs; such results, analogous in statement and in proof to theorems that we have proved for T, often are stated without a proof. The difference between the circle and the line becomes more obvious when we try to see what happens for Lp with p > 1. The (Lebesgue) measure of Rbeing infinite entails that, unlike L1 (T) which contains most of the "natural" function spaces on T, L1 (R) is relatively small; in particular Lp (R) 6⊂ L1 (R) for p > 1. The definition of Fourier transforms in L1 (R) has now a much more special character and a new definition (i.e., an extension of the definition) is needed for Lp (R), p > 1. The situation turns out to be quite different for p ≤ 2 and for p > 2. If p < 2, Fourier transforms of functions in Lp (R) can be defined by continuity as functions in Lq (R), q = p/(p − 1); however, if p > 2, the only reasonable way to define the Fourier transform on Lp (R) is through duality and Fourier transforms are now defined as distributions. The plan of this chapter is as follows: in section 1 we define the Fourier transform in L1 (R) and discuss its elementary properties. We also mention the connection between Fourier transforms and Fourier coefficients and prove Poisson’s formula. In section 2 we define Fourier-Stieltjes transforms and obtain various characterizations of Fourier-Stieltjes transforms of arbitrary and positive measures. In section 3 we prove Plancherel’s theorem and the Hausdorff-Young inequality, thereby defining Fourier transforms in Lp (R), 1 < p < 2. In section 4 we use Parseval’s formula, that is duality, to define the Fourier transforms of tempered distributions, and study some of the properties of Fourier transforms of functions in Lp (R), p ≤ ∞. Sections 5 and 6 deal with spectral anal132
VI. F OURIER T RANSFORMS ON THE L INE
133
ysis and synthesis in L∞ (R). In section 5 we consider the problems relative to the norm topology and show that the class of functions for which we have satisfactory theory is precisely that of Bohr’s almost periodic functions. In section 6 we study the analogous problems for the weak-star topology. Sections 7 and 8 are devoted to relations between Fourier transforms and analytic functions. Finally, section 9 contains Kronecker’s theorem (which we have already used in chapter II) and some variations on the same theme. 1 FOURIER TRANSFORMS FOR L1 (R)
1.1 We denote by L1 (R) the space of Lebesgue integrable functions on the real line. For f ∈ L1 (R) we write Z ∞ |f (x)|dx, kf kL1 (R) = −∞
and when there is no risk of confusion, we write kf kL1 or simply kf k instead of kf kL1 (R) . The Fourier transform fˆ of f is defined by Z (1.1) fˆ(ξ) = f (x)e−iξx dx for all real ξ † This definition is analogous to I.(1.5), and the disappearance of the factor 1/2π is due to none other than our (arbitrary) choice to remove it. It was a natural normalizing factor for the Lebesgue measure on T; but, at this point, it seems arbitrary for R. The factor 1/2π will reappear in the inversion formula and p some authors, seeking more symmetry for the inversion formula, write 1/2π in front of the integral (1.1) so that the same factor appear in the Fourier transform and its inverse. The added symmetry, however, may increase the possibility of confusion between the domains of definition of a function and its transform. In L1 (T) the functions are defined on T whereas the Fourier transforms are defined on the integers; in L1 (R) the functions are defined on R and the domain of definition of the Fourier is again the real line. It may be helpful to consider two copies of the real line: one is R and the other, which will serve as the domain of definition of Fourier transforms of ˆ . This notation is in accordance with functions in L1 (R), we denote by R that of chapter VII. † Throughout this chapter, integrals with unspecified limits of integration are always to be taken over the entire real line.
134
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Most of the elementary properties of Fourier coefficients are valid for Fourier transforms. Theorem. Let f, g ∈ L1 (R). Then (f[ + g)(ξ) = fˆ(ξ) + gˆ(ξ)
(a)
(b) For any complex number α d)(ξ) = αfˆ(ξ) (αf
(c) If f¯ is the complex conjugate of f , then
¯(ξ) = fˆ(−ξ) fˆ
(d) Denote fy (x) = f (x − y), y ∈ R. Then fˆy (ξ) = fˆ(ξ)e−iξy R |fˆ(ξ)| ≤ |f (x)|dx = kf k
(e)
(f) For positive λ denote ϕ(x) = λf (λx);
then
ξ ϕ(ξ) ˆ = fˆ( ). λ
P ROOF : The theorem follows immediately from (1.1). Parts (a) through (e) are analogous to the corresponding parts of I.1.4. Part (f) is obtained by a change of variable y = λx: Z Z ξ −i(ξ/λ)λx ϕ(ξ) ˆ = f (λx)e dλx = f (y)e−i(ξ/λy) dy = fˆ( ). J λ ˆ. 1.2 Theorem. Let f ∈ L1 (R). Then fˆ is uniformly continuous on R
P ROOF : fˆ(ξ + η) − fˆ(ξ) =
Z
f (x) e−i(ξ+η)x − e−iξx dx,
hence (1.2)
|fˆ(ξ + η) − fˆ(ξ)| ≤
Z
|f (x)||e−iηx − 1|dx.
The integral on the right of (1.2) is independent of ξ , the integrand is bounded by 2|f (x)| and tends to zero everywhere as η → 0. J
VI. F OURIER T RANSFORMS ON THE L INE
135
1.3 The following are immediate adaptations of the corresponding theorems in chapter I. Theorem. Let f, g ∈ L1 (R). For almost all x, f (x−y)g(y) is integrable (as a function of y ) and, if we write Z h(x) = f (x − y)g(y)dy,
then h ∈ L1 (R) and khk ≤ kf k kgk;
moreover, ˆ h(ξ) = fˆ(ξ)ˆ g (ξ)
for all ξ .
As in chapter I we denote h = f ∗g , call h the convolution of f and g , and notice that the convolution operation is commutative, associative, and distributive. 1.4 Theorem. Let f, h ∈ L1 (R) and Z 1 h(x) = H(ξ)eiξx dξ 2π
with integrable H(ξ). Then (h ∗ f )(x) =
(1.3)
1 2π
Z
H(ξ)fˆ(ξ)eiξx dξ.
P ROOF : The function H(ξ)f (y) is integrable in (ξ, y), hence, by Fubini’s theorem, Z ZZ 1 (h ∗ f )(x) = h(x − y)f (y)dy = H(ξ)eiξx e−iξy f (y)dξdy 2π Z Z Z 1 1 iξx −iξy = H(ξ)e e f (y)dydξ = H(ξ)fˆ(ξ)eiξx dξ. 2π 2π J 1.5 Theorem. Let f ∈ L1 (R) and define Z x f (y)dy. F (x) = −∞
1
Then, if F ∈ L (R) we have (1.4)
1 Fˆ (ξ) = fˆ(ξ) iξ
all real ξ 6= 0.
136
A N I NTRODUCTION TO H ARMONIC A NALYSIS
An equivalent statement of the theorem is: if F, F 0 ∈ L1 (R), then c0 (ξ) = iξ Fˆ (ξ). F
1.6 Theorem. Let f ∈ L1 (R) and xf (x) ∈ L1 (R). Then fˆ is differentiable and
(1.5)
d ˆ \)(ξ). f (ξ) = (−ixf dξ
P ROOF : (1.6)
Z e−ihx − 1 fˆ(ξ + h) − fˆ(ξ) = f (x)e−iξx dx. h h
The integrand in (1.6) is bounded by |xf (x)| (which is in L1 (R) by assumption) and tends to −ixf (x)e−iξx pointwise, hence (Lebesgue) it converges to −ixf (x)e−iξx in the L1 (R) norm. This implies that, as \)(ξ) and the h → 0, the right-hand side of (1.6) converges to (−ixf theorem follows. J 1.7 Theorem (Riemann-Lebesgue lemma). For f ∈ L1 (R) lim fˆ(ξ) = 0.
|ξ|→0
P ROOF : If g is continuously differentiable and with compact support we have, by 1.5 and 1.1, |ξˆ g (ξ)| ≤ kg 0 kL1 (R) hence lim|ξ|→∞ |ˆ g (ξ)| = 0. 1 For arbitrary f ∈ L (R), let ε > 0 and g be a continuously differentiable, compactly supported function such that kf − gkL1 (R) . We have both |fˆ(ξ) − gˆ(ξ)| < ε and limξ→∞ |ˆ g (ξ)| = 0; hence lim sup|ξ|→∞ ||fˆ(ξ)|| < ε. This being true for all ε > 0, we obtain limξ→∞ fˆ(ξ) = 0. J ˆ the space of all functions ϕ on R ˆ , which are 1.8 We denote by A(R) 1 the Fourier transforms of functions in L (R). By the results above, A(R) is an algebra of continuous functions vanishing at infinity, that ˆ is, a subalgebra of C0 (R), the algebra of all continuous functions on R ˆ which vanish at infinity. We introduce a norm to A(R) by transferring to it the norm of L1 (R), that is, we write kfˆkA(R) ˆ = kf kL1 (R) .
It follows from 1.3 that the norm k kA(R) ˆ , is multiplicative, that is, satisfies the inequality: kϕ1 ϕ2 kA(R) ˆ kϕ1 kA(R) ˆ kϕ2 kA(R) ˆ
VI. F OURIER T RANSFORMS ON THE L INE
137
The norm k kA(R) ˆ is not equivalent to the supremum norm; conseˆ is a proper subalgebra of C0 (R) ˆ . quently, A(R) 1.9 A summability kernel on the real line is a family of continuous functions {kλ } on R, with either discrete or continuous parameter‡ satisfying the following: Z kλ (x)dx = 1 kkλ k = O∗ (1) as λ → ∞ Z lim |kλ (x)|dx = 0, for all a > 0.
(1.7)
λ→∞
|x|>δ
A common way to produceR summability kernels on R is to take a function f ∈ L1 (R) such that f (x)dx = 1 and to write kλ (x) = λf (λx) for λ > 0. Condition (1.7) is satisfied since, introducing the change of variable y = λx, we obtain Z Z kλ (x)dx = f (y)dy = 1 kkλ k =
and
Z
Z
|kλ (x)|dx =
|kλ (x)|dx =
|x|>δ
Z
Z
|f (y)|dy = kf k
|f (y)|dy → 0 as λ → ∞.
|y|>λδ
The Fejér kernel on R is defined by Kλ (x) = λK(λx),
λ > 0,
where (1.8)
1 K(x) = 2π
sin x/2 x/2
2
1 = 2π
Z
1
−1
1 − |ξ| eiξx dξ .
The second equality in (1.8) is obtained directly by integration. By the previous remark it is clear that the only thing we need to Rcheck, in order to establish that {Kλ } is a summability kernel, is that K(x)dx = 1. This can be done directly, for example, by contour integration, or using ‡ The indexing parameter λ is often real valued; however, it should not be considered as an element of R so that no confusion with the notation of 1.1.d should arise.
138
A N I NTRODUCTION TO H ARMONIC A NALYSIS
the information that we have about the Fejér kernel of the circle, that is, that for all 0 < δ < π 1 lim n→∞ 2π
(1.9)
Z
δ
−δ
1 n+1
sin(n + 1)x/2 sin x/2
2
dx = 1.
R K(x)dx = Kλ (x)dx, we may take λ = n + 1, in which case 2 sin(n+1)x/2 1 Kλ (x) = 2π(n+1) , and notice that if δ > 0 is small enough, x/2 the ratio of 2πKλ (x) to the integrand in (1.9) is arbitrarily close to one in |x| < δ . More precisely, we obtain (λ = n + 1):
Since
R
sin δ δ
2
1 2π
2 Z δ 1 1 sin(n + 1)x/2 dx < Kλ (x) x/2 2π −δ −δ n + 1 2 Z π 1 1 sin(n + 1)x/2 dx < 2π −π n + 1 sin x/2
Z
δ
R Rδ Letting n → ∞ we see that K(x)dx = limλ→∞ −δ Kλ (x)dx is a numR ber between sin2 δ/δ 2 and 1; since δ > 0 is arbitrary K(x)dx = 1.
1.10 Theorem. Let f ∈ L1 (R) and let {kλ } be a summability kernel on R, then lim kf − kλ ∗ f kL1 (R) = 0.
λ→∞
P ROOF : Repeat the proof of theorem I.2.3 and lemma I.2.4.
J
1.11 Specifying theorem 1.10 to the Fejér kernel and using theorem 1.4, we obtain Theorem. Let f ∈ L1 (R), then
(1.10)
1 λ→∞ 2π
f = lim
λ
|ξ| ˆ 1− f (ξ)eiξx dξ λ −λ
Z
in the L1 (R) norm. Corollary (The uniqueness theorem). Let f ∈ L1 (R) and assume ˆ then f = 0. that fˆ(ξ) = 0 for all ξ ∈ R
VI. F OURIER T RANSFORMS ON THE L INE
139
1.12 If it happens that f is Lebesgue integrable, the integral on the R 1 right-hand side of (1.10) converges, uniformly in x, to 2π fˆ(ξ)eiξx dξ . We see that f is equivalent to a uniformly continuous function and obtain the so-called "inversion formula": Z 1 (1.11) f (x) = fˆ(ξ)eiξx dξ . 2π
An immediate consequence of (1.11) is cλ (ξ) = max 1 − |ξ| , 0 (1.12) K λ and, by theorem 1.3, (1.13)
\ (K λ ∗ f )(ξ) =
1−
|ξ| λ
fˆ(ξ)
|ξ| ≤ λ |ξ| ≥ λ.
0,
Combining this with theorem 1.10, we obtain Theorem. The functions with compactly carried Fourier transforms form a dense subspace of L1 (R).
This theorem is analogous to the statement that trigonometric polynomials form a dense subspace of L1 (T). 1.13 Besides the Fejér kernel we mention the following: De la Vallée Poussin’s kernel
(1.14)
Vλ (x) = 2K2λ (x) − Kλ (x),
whose Fourier transform is given by 1, ˆ (1.15) Vλ (ξ) = 2 − |ξ| λ , 0,
|ξ| ≤ 1 λ ≤ |ξ| ≤ 2λ 2λ ≤ |ξ|.
Poisson’s kernel Pλ (x) = λP(λx),
where (1.16)
P(x) =
1 π(1 + x2 )
140
A N I NTRODUCTION TO H ARMONIC A NALYSIS
and (1.17)
ˆ P(ξ) = e−|ξ| ,
and finally Gauss’ kernel Gλ (x) = λG(λx),
where (1.18)
1
G(x) = (2π)− 2 e−
x2 2
and 2
(1.19)
ξ ˆ G(ξ) = e− 2 .
To the inversion formula (1.11) and the summability in norm (theorems 1.10 and 1.11, one should add results about pointwise summability. Both the statements and the proofs of section I.3 can be adapted to L1 (R) almost verbatim and we avoid the repetition. 1.14 As in chapter I, we can replace the L1 (R) norm, in the statement of theorems 1.10 and 1.11, by the norm of any homogeneous Banach space B ⊂ L1 (R). As in chapter I, a homogeneous Banach space is a space of functions which is invariant under translation and such that for every f ∈ B, fy (defined by fy (x) = f (x − y)) depends continuously on y . The assumption B ⊂ L1 (R) is more restrictive than was the assumption B ⊂ L1 (T) in chapter I; it excludes such natural spaces as Lp (R), p > 1. We can obtain a reasonably general theory by considering homogeneous Banach space of locally summable functions, that is, functions which are Lebesgue integrable on every finite interval. We denote by L the space of all measurable functions f on R such that Z y+1 kf kL = supy |f (x)|dx < ∞ y
and by Lc the subspace of L consisting of all the functions f which satisfy kfy − f kL → 0 as y → 0. Theorem. If B is a homogeneous Banach space of locally summable functions on R and if convergence in B implies convergence in measure, then the L norm is majorized by the B norm and, in particular, B ⊂ Lc .
VI. F OURIER T RANSFORMS ON THE L INE
141
P ROOF : If the L norm is not majorized by k kB , we can choose a sequence fn ∈ B such that kfn kB < 2−n and kfnRkL > 3n . Replacing fn by fn (x − yn ) (if necessary) we may assume |fn (x)|dx > 3n Since kfn kB → 0, fn converges to zero in measure and it follows that if P nj → ∞ fast enough fnj , which belongs to B , is not integrable on (0, 1). J We can now extend Theorem 1.10 to homogeneous Banach spaces of locally summable functions (see exercises 11-14 at the end of this section); Theorem 1.11 can be generalized only after we extend the definition of the Fourier transformation. 1.15 We finish this section with a remark concerning the relation between Fourier coefficients and Fourier transforms. Let f ∈ L1 (R) and define ϕ by ϕ(t) = 2π
∞ X
f (t + 2πj).
j=−∞
t is a real number, but it is clear that ϕ(t) depends only on t (mod 2π) so that we can consider ϕ as defined on T. We clearly have ϕ ∈ L1 (T) and kϕkL1 (T) ≤ kf kL1 (R) .
For n ∈ Z, we have Z ∞ Z 2π X 1 −int ϕ(n) ˆ = ϕ(t)e dt = f (t + 2πj)e−int dt 2π 0 j=−∞ Z = f (x)e−inx dx = fˆ(n). so that ϕˆ is simply the restriction to the integers of fˆ. Similarly, if we write fλ (x) = λf (λx) and: (1.20)
ϕλ (t) = 2π
∞ X
fλ (t + 2πj),
j=−∞
we obtain, using 1.1, (1.21)
n ϕˆλ (n) = fˆ( ). λ
The preceding remarks, as simple as they sound, link the theory of Fourier integrals to that of Fourier series, and we can obtain a great
142
A N I NTRODUCTION TO H ARMONIC A NALYSIS
many facts about Fourier integrals from the corresponding facts about Fourier series. (For examples, see exercises 5 and 6 at the end of this section.) An application to the procedure above is the very important formula of Poisson: (1.22)
2πλ
∞ X
f (2πλn) =
n−=∞
∞ X
n fˆ( ). λ n=−∞
In order to establish Poisson’s formula, to understand its meaning and its domain of validity, all that we need to do is simply rewrite it as (1.23)
ϕλ (0) =
∞ X
ϕˆλ (n).
n=−∞
If ϕλ (0), as defined by (1.20), is well defined and if the Fourier series of ϕλ converges to ϕλ (0) for t = 0, then (1.23) and (1.22) are valid. One enhances the generality of (1.22) considerably by interpreting the sum on the right as N X |n| ˆ n lim 1− f ( ), N →∞ N λ −N that is, using C-1 summability instead of summation. Using Fejér’s theorem, for instance, one obtains that, with this interpretation, (1.22) is valid if t = 0 is a point of continuity of ϕλ . We remark that the continuity of f and f¯ is not sufficient to imply (1.22) even if both sides of (1.22) converge absolutely (see exercise 15). EXERCISES FOR SECTION I 1. Perform the integration R sin x/2 in (1.8). 1 2. Prove that 2π dx = 1 by contour integration. x/2 3. Prove (1.17). Hint: Use contour integration. 4. Prove (1.19). ˆ ˆ ˆ , (use 1.5 and Hint: Show that G(ξ) satisfies the equation d/dξ G(ξ) = −ξ G(ξ) 1.6). 5. Let f ∈ L1 (R) and ϕλ (t) defined by (1.20). Show that limλ→∞ kϕλ kL1 (T) = kf kL1 (R) ; hence deduce the uniqueness theorem from (1.21). 6. Prove Theorem 1.7 using (1.21), the uniform continuity of Fourier transforms and the Riemann-Lebesgue lemma for Fourier coefficients.
VI. F OURIER T RANSFORMS ON THE L INE
143
ˆ contains every twice continuously differentiable func7. Show that A(R) ˆ is uniformly dense in C0 (R) ˆ ; tion with compact support on R. Deduce that A(R) ˆ 6= C0 (R) ˆ . however, show that A(R) ˆ. 8. Let f ∈ L1 (R) be continuous Rat x = 0 and assume that fˆ(ξ) ≥ 0, ξ ∈ R 1 ˆ 1 ˆ ˆ Show that f ∈ L (R) and f (0) = 2π f (ξ)dξ . Hint: Use the analog to Fejér’s theorem and the fact that for positive functions C-1 summability is equivalent to convergence. 9. Show that C0 ∩ L1 (R), with the norm khk = supx |f (x)| + kf kL1 (R) is 1 a homogeneous Banach R λ space onR and conclude that if f ∈ C0 ∩ L (R) then 1 ˆ f (x) = limλ→∞ 2π −λ 1 − |ξ|/λ f (ξ)dξ uniformly. 10. Let f be bounded andRcontinuous on R and let {kλ } be a summability kernel. Show that kλ ∗ f = kλ (x − y)f (y)dy converges to f uniformly on compact sets on R. 11. Let f ∈ Lc and let ϕ be continuous with compact support; write ϕ∗f =
Z
ϕ(y)f (x − y)dy.
Interpreting the integral above as an Lc -valued integral, show that ϕ ∗ f ∈ Lc and kϕ ∗ f kL ≤ kϕkL1 (R) kf kL . Use this to define g ∗ f for g ∈ L1 (R) and f ∈ Lc . 12. Show that if f ∈ Lc then |f | ∈ Lc (notice, however, that eix log|x| 6∈ Lc ) and, using exercise 11, prove that if f ∈ Lc and g ∈ L1 (R) then for almost all 1 x R ∈ R, g(y)f (x − y) ∈ L (R) and g ∗ f , as defined in exercise 11, is equal to g(y)f (x − y)dy . 13. Let f ∈ L and let g R∈ L1 (R). Prove that g(y)f (x − y) ∈ L1 (R) for almost all x, and that h(x) = g(y)f (x − y)dy satisfies khkL ≤ kgkL1 (R) kf kL . 14. Let {kλ } be a summability kernel in L1 (R) and let B ⊂ Lc be a homogeneous Banach space. Show that for every R λ f eB , kkλ ∗ f − f kB → O, and conclude that if f ∈ B ∩ L1 (R), f = limλ→∞ −λ (1 − |ξ|/λ)fˆ(ξ)eiξx dξ in the B norm. ˆ , 15. Construct a continuous function f ∈ L1 (R) such that fˆ ∈ L1 (R) ˆ ˆ f (2πn) = 0 for all integers n, f (0) = 1 and f (n) = 0 for all integers n 6= 0. Hints: R 1 (a) We denote kf kA(R) = 2π |fˆ(ξ)|dξ . Let g be continuous with support in [0, 2π] and such that gˆ ∈ L1 (R). Write
gN (x) =
N |j| 1 X 1− N +1 N +1
g(x − 2πj).
N
Show that gˆN (ξ) = (N + 1)−1 KN (ξ)ˆ g (ξ) where KN is the 2π -periodic Fejér kernel, and deduce that kgN kA(R) → 0 as N → ∞.
144
A N I NTRODUCTION TO H ARMONIC A NALYSIS
1 ˆ c (j) (b) Let g (j) be nonnegative ( continuous functions such that g ∈ L (R) P∞ 1 0 < x < 1, and such that 1 g (j) (x) = Then, if Nj → ∞ fast 0 otherwise. (j) enough, kgN k ≤ 2−j and f = j A(R)
P∞
(j)
j=1
gNj has the desired properties.
2 FOURIER-STIELTJES TRANSFORMS.
2.1 We denote by M (R) the space of all finite Borel measures on R. M (R) is identified with the dual space of C0 (R)—the (sup-normed) space of all continuous functions on R which vanish at infinity—by means of the coupling Z (2.1) hf, µi = f dµ f ∈ C0 (R), µ ∈ M (R), R The total mass norm on M (R) is defined by kµkM (R) = |dµ| and is identical to the "dual space" norm defined by means of (2.1). The mapping f 7→ f (x)dx identifies L1 (R) with a closed subspace of M (R). The convolution of a measure µ ∈ M (R) and a function ϕ ∈ C0 (R) is defined by the integral Z (2.2) (µ ∗ f )(x) = ϕ(x − y)dµ(y).
and it is clear that µ∗ϕ ∈ C0 (R) and that kµ∗ϕk∞ ≤ kµkM (R) kϕk∞ . The convolution of two measures, µ, ν ∈ M (R), can be defined by means of duality and (2.2), analogously to what we have done in 1.7, or directly by defining Z (µ ∗ ν)(E) =
µ(E − y)dν(y)
for every Borel set E . Whichever way we do it, we obtain easily that kµ ∗ νkM (R) ≤ kµkM (R) kνkM (R) . 2.2 The Fourier-Stieltjes transform of a measure µ ∈ M (R) is defined by: Z Z ˆ (2.3) µ ˆ(ξ) = eiξx dµ(x) = e−iξx dµ(x) ξ ∈ R.
It is clear that if µ is absolutely continuous with respect to Lebesgue measure, say dµ = f (x)dx, then µ ˆ(ξ) = fˆ(ξ). Many of the properties 1 of L Fourier transforms are shared by Fourier-Stieltjes transforms: if µ, ν ∈ M (R) then |ˆ µ(ξ)| ≤ kµkM (R) , µ ˆ(ξ) is uniformly continuous, and
VI. F OURIER T RANSFORMS ON THE L INE
145
µd ∗ ν(ξ) = µ ˆ(ξ)ˆ ν (ξ). A departure from the theory of L1 Fourier transforms is the failing of the Riemann-Lebesgue lemma (the same way it fails for M (T)); the Fourier-Stieltjes transform of a measure µ need not vanish at infinity.
Theorem (Parseval’s formula). Let µ ∈ M (R) and let f be a conˆ . Then† tinuous function in L1 (R) such that fˆ ∈ L1 (R) Z Z 1 (2.4) f (x)dµ(x) = fˆ(ξ)ˆ µ(−ξ). 2π
P ROOF : By (1.11) f (x) =
hence Z
1 f (x)dµ(x) = 2π
ZZ
1 2π
Z
fˆ(ξ)eiξx dξ;
1 fˆ(ξ)eiξx dµ(x) dξ = 2π
Z
fˆ(ξ)ˆ µ(−ξ).
J
Corollary (uniqueness theorem). If µ ˆ(ξ) = 0 for all ξ , then µ = 0. ˆ justifies the change of order of integraThe assumption fˆ(ξ) ∈ L1 (R) tion (by Fubini’s theorem); however, it is not really needed. Formula ˆ , and is (2.4) is valid under the weaker assumption fˆ(ξ)ˆ µ(−ξ) ∈ L1 (R) 1 valid for all bounded continuous f ∈L (R) if we replace the integral on Rλ |ξ| 1 the right by limλ→∞ 2π 1 − fˆ(ξ)ˆ µ(−ξ)dξ (cf. exercise 1.10). λ −λ
2.3 The problem of characterizing Fourier-Stieltjes transforms among ˆ is very hard. As bounded and uniformly continuous functions on R far as local behavior is concerned this is equivalent to characterizing ˆ : every f ∈ A(R) ˆ is a Fourier-Stieltjes transform, and on the other A(R) hand, if µ ∈ M (R) and Vλ is de la Vallée Poussin’s kernel (1.14), then ∗ Vλ (ξ) = µ ˆ(ξ) for |ξ| ≤ λ. µ ∗ Vλ ∈ L1 (T) and µ\ The following theorem is analogous to I.7.3: ˆ , define Φλ by: Theorem. Let ϕ be continuous on R Z λ 1 |ξ| Φλ (x) = 1− ϕ(ξ)eiξx dξ . 2π −λ λ
Then ϕ is a Fourier-Stieltjes transform if, and only if, Φλ ∈ L1 (R) for all λ > 0, and kΦλ kL1 (R) is bounded as λ → ∞. R R † Notice that (2.4) is equivalent to
f (x)dµ(x) = 1/2π
fˆ(ξ)ˆ µ(ξ)dξ
146
A N I NTRODUCTION TO H ARMONIC A NALYSIS
P ROOF : If ϕ = µˆ with µ ∈ M (R), then Φλ = µ ∗ Kλ . It follows that for all λ > 0, Φλ ∈ L1 (R) and kΦλ kL1 (R) ≤ kµkM (R) . If we assume that Φλ ∈ L1 (R) with uniformly bounded norms, we consider the measures Φλ (x)dx and denote by µ a weak-star limit point of Φλ (x)dx as λ → ∞. We claim that ϕ = µ ˆ and since both functions are continuous, this will follow if we show that Z Z (2.5) ϕ(−ξ)g(ξ)dξ = µ ˆ(−ξ)g(ξ)dξ for every twice continuously differentiable g with compact support. For ˆ with G ∈ L1 ∩ C0 (R); by Parseval’s formula such g we have g = G Z Z λ |ξ| g(ξ)ϕ(−ξ) 1 − g(ξ)ϕ(−ξ)dξ = lim dξ λ→∞ −λ λ Z Z = lim 2π G(x)Φλ (x)dx = 2π G(x)dµ(x) λ→∞ Z = g(ξ)ˆ µ(−ξ)dξ and the proof is complete.
J
Remark: The application of Parseval’s formula above is typical and is the, more or less, standard way to check that weak-star limits in M (R) are what we expect them to be. Nothing like that was needed in the case of M (T) since weak-star convergence in M (T) implies pointwise convergence of the Fourier-Stieltjes coefficients (the exponentials be1ng to C(T) of which M (T) is the dual). The exponentials on R do not be1ong to C0 (R) and it is false that weak-star convergence in M (R) implies pointwise convergence of the Fourier-Stieltjes transforms (cf. exercise 1 at the end of this section.) However, the argument above gives: Lemma. Let µn ∈ M (R) and assume that µn → µ in the weak-star topology. Assume also that µ ˆn (ξ) → ϕ(ξ) pointwise, ϕ being continuous ˆ . Then µ on R ˆ = ϕ. 2.4 A similar application of Parseval’s formula gives the following useful criterion: ˆ , is a FourierTheorem. A function ϕ defined and continuous on R Stieltjes transform if, and only if, there exists a constant C such that Z 1 fˆ(ξ)ϕ(−ξ)dξ| ≤ C supx |f (x)| (2.6) | 2π
VI. F OURIER T RANSFORMS ON THE L INE
147
for every continuous f ∈ L1 (R) such that fˆ has compact support.
P ROOF : If ϕ = µˆ, (2.6) follows from (2.4) with C = kµkM (R) . if (2.6) R 1 holds, f 7→ 2π fˆ(ξ)ϕ(−ξ)dξ defines a bounded linear functional on a dense subspace of C0 (R), namely on the space of all the functions f ∈ C0 ∩L1 (R) such that fˆ has a compact support. This functional has a unique bounded extension to CR0 (R), which, by the Riesz representation theorem, has the form f 7→ f (x)dµ(x). Moreover, kµkM (R) ≤ C . Using (2.4) again we see that µ ˆ − ϕ is orthogonal to all the continuous, compactly supported functions fˆ with f ∈ L1 (R), and consequently ϕ=µ ˆ. J Remark: The family {f } of test functions for which (2.6) should be valid can be taken in many ways. The only properties that have been ˆ . Thus we used are that {f } is dense in C0 (R) and {fˆ} is dense in C0 (R) could require the validity of (2.6) only for (a) functions f such that fˆ is infinitely differentiable with compact support; or (b) functions f which are themselves infinitely differentiable with compact support, and so on. 2.5 With measures on R we can associate measures on T simply by integrating 2π -periodic functions. Formally: if E is a Borel set on T (T being identified with (−π, π]) we denote by En the set E + 2πn and write E˜ = ∪En ; if µ ∈ M (R) we define ˜ . µT (E) = µ(E)
It is clear that µT is a measure on T and that, identifying continuous functions on T with 2π -periodic functions on R Z Z (2.7) f (x)dx = f (t)dt. R
T
The mapping µ 7→ µT is an operator of norm one from M (R) onto M (T), and its restriction to L1 (R) is the mapping that we have discussed in section 1.15. It follows from (2.7) that µ ˆ(n) = µ ˆT (n) for all n; thus the restriction of a Fourier-Stieltjes transform to the integers gives a sequence of Fourier-Stieltjes coefficients. ˆ , is a FourierTheorem. A function ϕ defined and continuous on R Stieltjes transform if, and only if, there exists a constant C > 0, such that for all λ > 0, {ϕ(λn)}∞ n=−∞ are the Fourier-Stieltjes coefficients of a measure of norm ≤ C on T.
148
A N I NTRODUCTION TO H ARMONIC A NALYSIS
P ROOF : If ϕ = µˆ with µ ∈ M (R) we have ϕ(n) = µˆ(n) = µˆT (n) with kµT k ≤ kµk. Writing dµ(x/λ) for the measure satisfying Z x Z f (x) dµ = f (λx) dµx λ \ we have kµ(x/λ)kM (R) = kµkM (R) and µ(x/λ)(ξ) =µ ˆ(ξλ). This implies \ T (n) and the "only if" part is established. ϕ(λn) = µ(x/λ)
For the converse we use 2.4. Let f be continuous and integrable on R and assume that fˆ is infinitely differentiable and compactly supR 1 ported. We want to estimate the integral 2π fˆ(ξ)ϕ(−ξ)dξ and, since the integrand is continuous and compactly supported, we can approximate the integral by its Riemann sums. Thus, for arbitrary ε > 0, if λ is small enough: 1 Z λ X (2.8) fˆ(ξ)ϕ(−ξ)dξ < fˆ(λn)ϕ(−λn) + ε . 2π 2π Now, (λ/2π)fˆ(λn) are the Fourier coefficients of the function ψλ (t) = P∞ m=−∞ f ((t + 2πm)/λ) on T, and since the infinite differentiability of fˆ implies a very fast decrease of f (x) as |x| → ∞, we see that if λ is sufficiently small (2.9)
sup|ψλ (t)| ≤ sup|f (x)| + ε .
Assuming that ϕ(λn) = µˆλ (n), µλ ∈ M (T) and kµλ kM (T) ≤ C , we obtain from Parseval’s formula λ X X ˆ ˆλ (n)ˆ = f (λn)ϕ(−λn) ψ µ (−n) ≤ C sup|ψλ (t)|; λ 2π by (2.8) and (2.9) Z 1 ˆ(ξ)ϕ(−ξ) dξ ≤ C sup|f (x)| + (C + 1)ε f 2π and since ε > 0 is arbitrary, (2.6) is satisfied and the theorem follows from theorem 2.4. J 2.6 Parseval’s formula also offers an obvious criterion for determining when a function ϕ is the Fourier-Stieltjes transform of a positive measure. The analog to 2.4 is
VI. F OURIER T RANSFORMS ON THE L INE
149
ˆ , is the FourierTheorem. A function ϕ, bounded and continuous on R Stieltjes transform of a positive measure on R if, and only if, Z (2.10) fˆ(ξ)ϕ(−ξ) ≥ 0
for every nonnegative function f which is infinitely differentiable and compactly supported. PROOF : Parseval’s formula clearly implies the "only if" part and also the fact that if we assume ϕ = µ ˆ with µ ∈ M (R), then µ is a positive measure. To complete the proof we show that (2.10) implies (2.6), with C = ϕ(0), for every real-valued, compactly supported infinitely differentiable f (hence with C = 2ϕ(0) for complex-valued f ). As usual, we denote by Kλ (x) the Fejér kernel (1.8) and notice that 2 sin λx/2 1 λ−1 Kλ (x) = K(λx) = 2π is nonnegative and tends to 1/2π , λx/2 as λ → 0, uniformly on compact subsets of R. By (1.12) the Fourier transform of K(λx) is λ−1 max(1 − |ξ|/λ, 0) and, as ϕ(ξ) is continuous at ξ = 0, Z 1ˆ (2.11) lim Kλ (ξ)ϕ(−ξ) dξ = ϕ(0). λ→0 λ
If f is real-valued and compactly supported and ε > 0, then, for sufficiently small λ and all x, 2π(ε + sup|f |)K(λx) − f (x) ≥ 0; ˆ hence, by (2.10) and (2.11), if fˆ ∈ L1 (R) Z 1 (2.12) fˆ(ξ)ϕ(−ξ) dξ ≤ ϕ(0)(2ε + sup|f |), 2π
rewriting (2.12) for −f and letting ε → 0 we obtain: Z 1 ˆ(ξ)ϕ(−ξ) dξ ≤ ϕ(0) sup|f |. f 2π
J
2.7 The analog to 2.5 is: ˆ , is the FourierTheorem. A function ϕ, defined and continuous on R Stieltjes transform of a positive measure, if and only if, for all λ > 0, {ϕ(λn)}∞ n=−∞ are the Fourier-Stieltjes coefficients of a positive measure on T.
150
A N I NTRODUCTION TO H ARMONIC A NALYSIS
P ROOF : The "only if" part follows as in 2.5. For the "if" part we notice first that if ϕ(λn) = µ ˆλ (n) with µλ > 0 on T, then kµλ k = ϕ(0) and consequently, by 2.5, ϕ is a Fourier-Stieltjes transform. Using the continuity of ϕ we can now establish (2.10) by approximating the integral by its Riemann sums as in the proof of 2.5. J ˆ is said to be positive definite 2.8 Definition: A function ϕ defined on R ˆ and complex numbers z1 , . . . , zN , if, for every choice of ξ1 , . . . , ξN ∈ R we have N X
(2.13)
ϕ(ξj − ξk )zj zk ≥ 0 .
j,k=1
Immediate consequences of (2.13) are: (2.14)
ϕ(−ξ) = ϕ(ξ)
and |ϕ(ξ)| ≤ ϕ(0) .
(2.15)
In order to prove (2.14) and (2.15), we take N = 2, z1 = 1, z2 = z ; then (2.13) reads ϕ(0)(1 + |z|2 ) + ϕ(ξ)z + ϕ(−ξ)¯ z ≥ 0;
set z = 1, we get ϕ(ξ) + ϕ(−ξ) real; set z = i, we get i(ϕ(ξ) − ϕ(−ξ) real, hence (2.14). If we take z such that zϕ(ξ) = −|ϕ(ξ)| we obtain: 2ϕ(0) − 2|ϕ(ξ)| ≥ 0
which establishes (2.15). ˆ , is a Fourier-Stieltjes Theorem (Bochner). A function ϕ defined on R transform of a positive measure if, and only if, it is positive definite and continuous.
P ROOF : Assume first ϕ = µˆ with µ ≥ 0. Let ξ1 , . . . , ξN ∈ N and z1 , . . . , zN be complex numbers; then Z X X e−iξj x zj eiξk x zk dµ(x) ϕ(ξj − ξk )zj zk = (2.16)
j,k
Z X N 2 = zj e−iξj x dµ(x) ≥ 0 1
VI. F OURIER T RANSFORMS ON THE L INE
151
so that Fourier-Stieltjes transforms of positive measures are positive definite. If, on the other hand, we assume that ϕ is positive definite, it follows that for all λ > 0, {ϕ(λn)} is a positive definite sequence (cf. I.7.6). By Herglotz’ theorem I.7.6, ϕ(λn) = µ ˆλ (n) for some positive measure µλ on T, and by theorem 2.7, ϕ = µ ˆ for some positive µ ∈ M (R). J ?2.9 Some assumption of continuity of ϕ in Bochner’s theorem is essential, but one may assume only that it is continuous at ξ = 0 since a positive definite function which is continuous at ξ = 0 is uniformly continuous on the line. This can be obtained directly from condition (2.13) or as a consequence of Lemma I.7.7 applied to ϕ(λn), and letting λ → 0 (see exercise 9).
Lemma. Let ϕ = µ ˆ for some positive µ ∈ M (R). Assume that ϕ is twice Rdifferentiable at ξ = 0 or just that 2ϕ(0) − ϕ(h) − ϕ(−h) = O h2 . Then x2 dµ < ∞, and ϕ has a uniformly continuous second derivative ˆ. on R
P ROOF : The assumption is that for some constant C , Z −2 2h (ϕ(0) − ϕ(h) − ϕ(−h)) = 2h−2 (1 − cos hx)dµ(x) ≤ C. Since the integrand is nonnegative, for every a > o, Z Z a x2 dµ(x) ≤ lim inf 2h−2 (1 − cos hx)dµ(x) ≤ C. −a
h→0
Now, ν = x2 µ ∈ M (R), and ϕ00 = −ˆ ν.
J
Notice that if 2ϕ(0) − ϕ(h) − ϕ(−h) = o(h2 ), we have µ = ϕ(0)δ0 . By induction on m we obtain Proposition. Let ϕ = µ ˆ for some positiveRµ ∈ M (R). Assume that ϕ is 2m-times differentiable at ξ = 0, then x2m dµ < ∞, and ϕ has ˆ . If ϕ(2m) (0) = 0, a uniformly continuous derivative of order 2m on R then µ = ϕ(0)δ0 . ?2.10 Positive definite functions which are analytic at ξ = 0 are automatically analytic in a strip {ζ : ζ = ξ + iη, |η| < a}, with a > 0. By Bochner’s theorem (and the previous remark) such functions are Fourier-Stieltjes transforms of positive measures.
152
A N I NTRODUCTION TO H ARMONIC A NALYSIS
Lemma. Let µ be a positive measure on R. AssumeR that F (ξ) = µ ˆ(ξ) is analytic at ξ = 0. Then there exists b > 0 such that eb|x| dµ < ∞ and ˆ of the function µ ˆ is the restriction to R Z (2.17) F (ζ) = e−iζx dµ(x). P F (n) (0) n P ROOF : The assumption is: for some a > 0, F (ξ) = ∞ ξ 0 n! (n) −n in |ξ| ≤ a . This implies |F (0)| ≤ Cn!a , and in particular that R 2m x dµ ≤ C(2m)!a−2m . Since |x|2m+1 ≤ x2m + x2m+2 , we have Z |x|2m+1 dµ ≤ (2 + a2 )C(2m + 2)!a−2m+2
and (2.18)
Z
η|x|
e
R n X Z η n |x|n X n |x| dµ dµ = dµ = η <∞ n! n!
for all η < a.
J
An immediate corollary of (2.17) is the fact that F (ξ + iη) is positive definite in ξ , and (with ζ = ξ + iη ), (2.19)
|F (ζ)| ≤ F (iη).
R Also, since F (k) (ζ) = (−ix)k e−iζx dµ, we have
(2.20)
|F (k) (ζ)| ≤ |F (k) (iη)| + O (1) .
It follows that if {ζ = ξ + iη : a0 < η < a1 } is a maximal strip in which F (ζ) is holomorphic, then the points ia0 and ia1 are both singular points of F . If F is holomorphic on the entire imaginary axis, it is entire and we obtain the following special case of a theorem of Marcinkiewicz: Theorem. Assume that eP (ξ) is the Fourier-Stieltjes transform of a positive measure, with P a polynomial, then deg P ≤ 2. R P P ROOF : We must have eP (ζ) = e−iζx dµ. If P (ξ) = k0 aj ξ j , ak 6= 0, k k−1 there are k directions ϑj such that F (reiϑj ) ≈ e|ak r |+O(r ) . By (2.19) ϑj = ± π2 and k ≤ 2. J
VI. F OURIER T RANSFORMS ON THE L INE
153
?2.11 Positive measures and positive definite functions are the bread and butter of Probability theory, which uses its own terminology. A real-valued random variable is, by definition, a measurable realvalued function X on some probability measure space Ω, B, P . The expectation of an integrable random variable X is its integral with respect to P . It is denoted E (X). The distribution of a (real-valued) random variable X is the image of P under X ; it is a probability measure on R. The (cumulative) distribution function of X is the function FX (λ) = P (X ≤ λ) ;
(2.21)
(so that the distribution of X is simply the measure dFX ). If Φ is continuous on R then Φ ◦ X is integrable on Ω, B, P if, and only if Φ is integrable dFX , and Z (2.22) E (Φ ◦ X) = Φ(λ)dFX (λ). The characteristic function of a random variable X is, by definition, the Fourier-Stieltjes transform of its distribution. Taking Φ(X) = eiξX in equation (2.22), we have Z iξX (2.23) χX (ξ) = E e = eiξλ dFX (λ). The term is justified by the uniqueness theorem 2.2 A normal (real-valued) variable is one whose distribution dFX is G(x)dx; X is Gaussian if it is a constant multiple of a normal variable. ξ2 ˆ Notice that X is normal if, and only if, χX (ξ) = G(ξ) = e− 2 . A sequence Xn of real-valued random variables converge in distribution to X0 means: dFXn → dFX0 in the weak-star topology. 2.12 For the convenience of future reference we state here the analog to Wiener’s theorem I.7.13. The theorem can be proved either by essentially repeating the proof of I.7.13 or by reducing it to I.7.13. We leave the proof as an exercise (exercise 7 at the end of this section) to the reader. Theorem. Let µ ∈ M (R). Then X
1 |µ({x})| = lim λ→∞ 2λ 2
Z
λ
−λ
|ˆ µ(ξ)|2 dξ .
154
A N I NTRODUCTION TO H ARMONIC A NALYSIS
In particular, a necessary and sufficient condition for the continuity of µ is Z λ 1 |ˆ µ(ξ)|2 dξ = 0 . lim λ→∞ 2λ −λ EXERCISES FOR SECTION 2 1. Denote by δn , the measure of mass one on R concentrated at x = n. Show that limn→∞ δn = 0 in the weak-star topology of M (R) and conclude that weak-star convergence of a sequence of measures does not imply pointwise convergence of the Fourier-Stieltjes transforms. 2. Let µn = n−1 (δ1 + δ2 + · · · + δn ). Show that µn → 0 in the weakˆ ; however, lim µ star topology and µ ˆn (ξ) converges for every ξ ∈ R ˆn (ξ) is not identically zero. 3. A set B ⊂ M (R) is uniformly-boundedly-spread (B ∈ U BS for short), R if it is bounded and limλ→∞ supµ∈B |x|>λ |dµ| = 0. a. Prove that B ∈ U BS implies equi-continuity of {ˆ µ : µ ∈ B}. b. If µn are probability measures, and {ˆ µn } is equi-continuous at ξ = 0 then {µn } ∈ U BS . c. If {µn } ∈ U BS , and µn → µ in the weak-star topology, then µ ˆn (ξ) → µ ˆ(ξ) ˆ. uniformly on compact subsets of R 4. Let µn ∈ M (R) such that kµn k ≤ 1. Assume that µ ˆn converges pointwise to a continuous function ϕ. Show that ϕ = µ ˆ for some µ ∈ M (R) such that kµk ≤ 1; moreover, µn → µ weak-star. p Pn 5. Let λn be integers such that λn+1 /λn > 3. Write Xn = n2 1 cos λj t. (Xn are real-valued random variables on the probability space T endowed with the normalized Lebesgue measure). Prove that Xn converge in distribution to a normal variable. Hint: Exercise V.1.11. ˆ and (2.10) is valid, then ϕ is posi6. Show that if ϕ is continuous on R tive definite. Conclude from (2.15) that the boundedness assumption of 2.6 is superfluous. 7. Prove Theorem 2.12. 8. Express µ{[a, b]} and µ{(a, b)} in terms of µ ˆ. ([a, b] is the closed interval with endpoints a and b, and (a, b) is the open one.) 9. Let an be complex numbers, |an | ≤ 1. Set bn = an+1 − an and cn = √ bn − bn−1 = an+1 + an−1 − 2an . Prove that if |cn | ≤ ε, then |bn | ≤ 2 ε. a. How does this imply that a positive definite function which is continuous at ˆ? ξ = 0 is uniformly continuous on R b. Prove that if ϕ is positive definite and ϕ(0) − <ϕ(h) = o(h2 ), as h → 0, then ϕ is a constant.
VI. F OURIER T RANSFORMS ON THE L INE
155
10. Show that there exists a uniformly continuous bounded function ϕ which is not a Fourier-Stieltjes transform, and such that {ϕ(λn)} is a sequence of Fourier-Stieltjes coefficients for every λ > 0. Hint: Construct a continuous function with compact support which is not a Fourier transform of a summable function. 3 FOURIER TRANSFORMS IN Lp (R); 1 < p ≤ 2.
The definition of the Fourier transform (i.e., Fourier coefficients) for functions in various function spaces on T, was largely simplified by the fact that all these spaces were contained in L1 (T). The fact that the Lebesgue measure of R is infinite changes the situation radically. If p > 1 we no longer have Lp ⊂ L1 , and, if we want to have Fourier transforms for functions in Lp (R) (or other function spaces on R), we have to find a new way to define them. In this section we consider the case 1 < p ≤ 2 and obtain a reasonably satisfactory extension of the Fourier transformation for this case. 3.1 We start with L2 (R). Lemma. Let f be continuous and with compact support on R; then Z Z 1 |fˆ(ξ)|2 dξ = |f (x)|2 dx . 2π
We give two proofs.
P ROOF I: Assume first that the support of f is included in (−π, π). By theorem I.5.5, 1 2π
Z
|f (x)|2 dx =
∞ X 1 ˆ 2 f (n) 2π n=−∞
and replacing f by e−iαx f we have (3.1)
Z
∞ 1 X ˆ |f (x)| dx = |f (n + α)|2 ; 2π n=−∞ 2
integrating both sides of (3.1) with respect to α on 0 ≤ α ≤ 1, we obtain Z Z 1 2 |f (x)| dx = |fˆ(ξ)|2 dξ. 2π
156
A N I NTRODUCTION TO H ARMONIC A NALYSIS
If the support of f is not in (−π, π), we consider g(x) = λ1/2 f (λx). If λ is sufficiently big, the support of g is included in (−π, π) and, since gˆ(ξ) = λ−1/2 fˆ(ξ/λ), we obtain Z Z Z Z 1 1 2 2 2 |f (x)| dx = |g(x)| dx = |ˆ g (ξ)| dξ = |fˆ(ξ)|2 dξ. 2π 2π J R = f (x)f (x)dx = R RP ROOF 2II: Write g = f ∗ f2 (−x); we have g(0) |f (x)| dx and gˆ(ξ) = |fˆ(ξ)| . If we know that |fˆ(ξ)|2 dξ < ∞ (e.g., we assume that f is differentiable), it follows from the inversion formula (1.11) that Z Z 1 |fˆ(ξ)|2 dξ = g(0) = |f (x)|2 dx . 2π
In the general case we may apply Fejér’s theorem and obtain Z 1 |ξ| lim 1− |fˆ(ξ)|2 dξ = g(0) λ→∞ 2π λ and, since the integrand is nonnegative, its C-1 summability is equivalent to its convergence and the proof is complete. J ˆ we write D EFINITION : For g ∈ L2 (R) kgkL2 (R) ˆ =
1 2π
Z
|g