0% found this document useful (0 votes)
59 views

A Course in Functional Analysis John B C

Uploaded by

Aamir Yousuf
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
59 views

A Course in Functional Analysis John B C

Uploaded by

Aamir Yousuf
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 418
Graduate Texts in Mathematics 96 Editorial Board F, W. Gehring P. R. Halmos (Managing Editor) C. C. Moore Graduate Texts in Mathematics TAKEUTUZAaRING, Introduction to Axiomatic Set Theory. 2nd ed. Oxtosy. Measure and Category. 2nd ed. SCHAEFFER. Topological Vector Spaces. HiLToN/STAMMBACH. A Course in Homological Algebra. Mactane. Categories for the Working Mathematician. HuGues/PiPER. Projective Planes. SERRE. A Course in Arithmetic. TakevTy/ZaRING. Axiometic Set Theory. Humpnreys. Introduction to Lie Algebras and Representation Theory. Coney. A Course in Simple Homotopy Theory. Conway. Functions of One Complex Variable. 2nd ed. at BEALS. Advanced Mathematical Analysis. ANDERSON/FULLER. Rings and Categories of Modules. Govusitsky/GUILLEMIN. Stable Mappings and Their Singularities. BERBERIAN. Lectures in Functional Analysis and Operator Theory. Winter. The Structure of Fields. ROSENBLATT. Random Processes. 2nd ed. Hatos. Measure Theory. Hatmos. A Hilbert Space Problem Book. 2nd ed., revised. HUSEMOLLER. Fibre Bundles. 2nd cd. Humpnreys. Linear Algebraic Groups. Barnes/Mack. An Algebraic Introduction to Mathematical Logic. Grev. Linear Algebra. 4th ed. Hoimes. Geometric Functional Analysis and its Applications. HeEwitt/STROMBERG. Real and Abstract Analysis? Manes. Algebraic ‘Theories. Kettey. General Topology. Zanisk/SAmUEL. Commutative Algebra. Vol. 1. Zarisk/SAMUEL. Commutative Algebra, Vol. IL. Jacosson. Lectures in Abstract Algebra I: Basic Concepts. Jacosson. Lectures in Abstract Algebra II: Linear Algebra. Jacopson. Lectures in Abstract Algebra II: Theory of Fields and Galois Theory Hirscu. Differential Topology. Sprrzer. Principles of Random Walk. 2nd ed. Werner. Banach Algebras and Several Complex Variables. 2nd ed. KELLEY/NAMIOKA et al. Linear Topological Spaces. Monk. Mathematical Logic. GRAUERT/FRITZSCHE. Several Complex Variables. ARVESON. An Invitation to C*-Algebras. Kemeny/SNneLt/KNApp. Denumerable Markov Chains. 2nd ed. Apostot.. Modular Functions and Dirichlet Series in Number Theory. Serre. Linear Representations of Finite Groups. GILLMAN/JERISON. Rings of @ontinuous Functions.’ KENDIG. Elementary Algebraic Geometry.+ Loéve. Probability Theory I. 4th etl. Loéve. Probability Theory IL. 4thed, °° Moise. Geometric Topology in Dimensions 2 and 3. continued after Index John B. Conway A Course in Functional Analysis 5 Springer-Verlag New York Berlin Heidelberg Tokyo John B. Conway Department of Mathematics Indiana University Bloomington, IN 47405 USA. Editorial Board P. R. Halmos F, W. Gehring C. C. Moore Managing Editor Department of Department of Department of Mathematics Mathematics Mathematics University of Michigan University of California Indiana University Ann Arbor, MI 48109 at Berkeley Bloomington, IN 47405 U.S.A. Berkeley, CA 94720 U.S.A USA. AMS Classifications: 46-01, 45B05 Library of Congress Cataloging in Publication Data Conway, John B. A course in functional analysis. (Graduate texts in mathematics: 96) Bibliography: p. Includes index. 1. Functional analysis. 1. Title. II. Series. QA320,C658 1985 515.7 84-10568 With 1 illustration ©1985 by Springer-Verlag New York Inc. All rights reserved. No part of this book may be translated or reproduced in any form without written permission from Springer-Verlag, 175 Fifth Avenue, New York, New York 10010, U.S.A. Typeset by Science ‘Typographers, Medford, New York. Printed and bound by R. R. Donnelley & Sons, Harrisonburg, Virginia. Printed in the United States of America. 987654321 ISBN 0-387-96042-2 Springer-Verlag New York Berlin Heidelberg Tokyo ISBN 3-540-96042-2 Springer-Verlag Berlin Heidelberg New York Tokyo For Ann (of course) Preface Functional analysis has become a sufficiently large area of mathematics that it is possible to find two research mathematicians, both of whom call themselves functional analysts, who have great difficulty understanding the work of the other. The common thread is the existence of a linear space with a topology or two (or more). Here the paths diverge in the choice of how that topology is defined and in whether to study the geometry of the linear space, or the linear operators on the space, or both, In this book I have tried to follow the common thread rather than any special topic. I have included some topics that a few years ago might have been thought of as specialized but which impress me as interesting and basic. Near the end of this work I gave into my natural temptation and included some operator theory that, though basic for operator theory, might be considered specialized by some functional analysts. -The word Course in the title of this book has two meanings. The first is obvious. This book was meant as a text for a graduate course in functional analysis. The second meaning is that the book attempts to take an excursion through many of the territories that comprise functional analysis. For this purpose, a choice of several tours is offered the reader-whether he is a tourist or a student looking for a place of residence. The sections marked with an asterisk are not (strictly speaking) necessary for the rest of the book, but will offer the reader an opportunity to get more deeply involved in the subject at hand, or to see some applications to other parts of mathematics, or, perhaps, just to see some local color, Unlike many tours, it is possible to retrace your steps and cover a starred section after the chapter has been left. There are some parts of functional analysis that are not on the tour. Most authors have to make choices due to time and space limitations, to say nothing of the financial resources of our graduate students. Two areas that are only briefly touched here, but which constitute entire areas by them- selves, are topological vector spaces and ordered linear spaces. Both are beautiful theories and both have books which do them justice. The prerequisites for this book are a thoroughly good course in measure and integration-together with some knowledge of point set topology. The appendices contain some of this material, including a discussion of nets in Appendix A. In addition, the reader should at least be taking a course in analytic function theory at the same time that he is reading this book. From the beginning, analytic functions are used to furnish some examples, but it is only in the last half of this text that analytic functions are used in the proofs of the results. It has been traditional that a mathematics book begin with the most general set of axioms and develop the theory, with additional axioms added as the exposition progresses. To a large extent I have abandoned tradition. Thus the first two chapters are on Hilbert space, the third is on Banach spaces, and the fourth is on locally convex spaces. To be sure, this causes some repetition (though not as much as I first thought it would) and the phrase the proof is just like the proof of ...” appears several times. But I firmly believe that this order of things develops a better intuition in the student. Historically, mathematics has gone from the particular to the general-not the reverse. There are many reasons for this, but certainly one reason is that the human mind resists abstraction unless it first sees the need to abstract. I have tried to include as many examples as possible, even if this means introducing without explanation some other branches of mathematics (like analytic functions, Fourier series, or topological groups). There are, at the end of every section, several exercises of varying degrees of difficulty with different purposes in mind. Some exercises just remind the reader that he is to supply a proof of a result in the text; others are routine, and seek to fix some of the ideas in the reader $ mind; yet others develop more examples; and some extend the theory. Examples emphasize my idea about the nature of mathematics and exercises stress my belief that doing mathematics is the way to learn mathematics. Chapter I discusses the geometry of Hilbert spaces and Chapter II begins the theory of operators on a Hilbert space. In Sections 5-8 of Chapter II, the complete spectral theory of normal compact operators, together with a discussion of multiplicity, is worked out. This material is presented again in Chapter IX, when the Spectral Theorem for bounded normal operators is proved. The reason for this repetition is twofold. First, I wanted to design the book to be usable as a text for a one-semester course. Second, if the reader understands the Spectral Theorem for compact operators, there will be less difficulty in understanding the general case and, perhaps, this will lead to a greater appreciation of the complete theorem. Chapter III is on Banach spaces. It has become standard to do some of this material in courses on Real Variables. In particular, the three basic principles, the Hahn-Banach Theorem, the Open Mapping Theorem, and the Principle of Uniform Boundedness, are proved. For this reason I contemplated not proving these results here, but in the end decided that they should be proved. I did bring myself to relegate to the appendices the proofs of the representation of the dual of L? (Appendix B) and the dual of C,(X) (Appendix C). Chapter IV hits the bare essentials of the theory of locally convex spaces -enough to rationally discuss weak topologies. It is shown in Section 5 that the distributions are the dual of a locally convex space. Chapter V treats the weak and weak-star topologies. This is one of my favorite topics because of the numerous uses these ideas have. Chapter VI looks at bounded linear operators on a Banach space. Chapter VII introduces the reader to Banach algebras and spectral theory and applies this to the study of operators on a Banach space. It is in Chapter VII that the reader needs to know the elements of analytic function theory, including Liouville $ Theorem and Runge $ Theorem. (The latter is proved using the Hahn-Banach Theorem in Section 111.8.) When in Chapter VIII the notion of a C*-algebra is explored, the emphasis of the book becomes the theory of operators on a Hilbert space. Chapter IX presents the Spectral Theorem and its ramifications. This is done in the framework of a C*-algebra. Classically, the Spectral Theorem has been thought of as a theorem about a single normal operator. This it is, but it is more. This theorem really tells us about the functional calculus for a normal operator and, hence, about the weakly closed C*-algebra gener- ated by the normal operator. In Section IX.8 this approach culminates in the complete description of the functional calculus for a normal operator. In Section IX.10 the multiplicity theory (a complete set of unitary invariants) for normal operators is worked out. This topic is too often ignored in books on operator theory. The ultimate goal of any branch of mathematics is to classify and characterize, and multiplicity theory achieves this goal for normal operators. In Chapter X unbounded operators on Hilbert space are examined. The distinction between symmetric and self-adjoint operators is carefully delin- eated and the Spectral Theorem for unbounded normal operators is ob- tained as a consequence of the bounded case. Stone § Theorem on one parameter unitary groups is proved and the role of the Fourier transform in relating differentiation and multiplication is exhibited. Chapter XI, which does not depend on Chapter X, proves the basic properties of the Fredholm index. Though it is possible to do this in the context of unbounded operators between two Banach spaces, this material is presented for bounded operators on a Hilbert space. There are a few notational oddities. The empty set is denoted by 0. A reference number such as (8.10) means item number 10 in Section 8 of the present chapter. The reference (1X.8.10) is to (8.10) in Chapter IX. The reference (All) is to the first item in the first section of Appendix A. There are many people who deserve my gratitude in connection with writing this book. In three separate years I gave a course based on an evolving set of notes that eventually became transfigured into this book. The students in those courses were a big help. My colleague Grahame Bennett gave me several pointers in Banach spaces. My ex-student Mare Raphael read final versions of the manuscript, pointing out mistakes and making suggestions for improvement. Two current students, Alp Eden and Paul McGuire, read the galley proofs and were extremely helpful. Elena Fraboschi typed the final manuscript. John B, Conway Contents Preface CHAPTER I Hilbert Spaces §1. Elementary Properties and Examples §2. Orthogonality §3. The Riesz Representation Theorem $4, Orthonormal Sets of Vectors and Bases §5. Isomorphic Hilbert Spaces and the Fourier ‘Transform for the Circle 96. The Direct Sum of Hilbert Spaces CHAPTER II Operators on Hilbert Space §1. Elementary Properties and Examples 92. The Adjoint of an Operator §3. Projections and Idempotents; Invariant and Reducing Subspaces §4. Compact Operators §5.* The Diagonalization of Compact Self-Adjoint Operators §6.* An Application: Sturrr-Liouville Systems §7.* The Spectral Theorem and Functional Calculus for Compact Normal Operators §8.* Unitary Equivalence for Compact Normal Operators CHAPTER III Banach Spaces §1. Elementary Properties and Examples $2. Linear Operators on Normed Spaces IL 14 19 24 26 31 37 41 47 50 35 61 65 70 §5. Stone § Theorem $6. The Fourier Transform and Differentiation $7. Moments CHAPTER XI Fredholm Theory $1. The Spectrum Revisited §2. The Essential Spectrum and Semi-Fredholm Operators §3. The Fredholm Index §4. The Components of “F §5. A Finer Analysis of the Spectrum APPENDIX A Preliminaries §1. Linear Algebra §2. Topology APPENDIX B The Dual of L?(n) APPENDIX C The Dual of Cy(X) Bibliography List of Symbols Index 334 341 349 353 355 361 370 372 375 377 381 384 390 395 399 §3. Finite-Dimensional Normed Spaces $4. Quotients and Products of Normed Spaces $5. Linear Functionals §6. The Hahn-Banach Theorem §7.* An Application: Banach Limits §8.* An Application: Runge $ Theorem §9.* An Application: Ordered Vector Spaces $10. The Dual of a Quotient Space and a Subspace $11. Reflexive Spaces $12. The Open Mapping and Closed Graph Theorems §13. Complemented Subspaces of a Banach Space $14. The Principle of Uniform Boundedness CHAPTER IV Locally Convex Spaces §1. Elementary Properties and Examples §2. Metrizable and Normable Locally Convex Spaces §3. Some Geometric Consequences of the Hahn-Banach Theorem §4.* Some Examples of the Dual Space of a Locally Convex Space §5.* Inductive Limits and the Space of Distributions CHAPTER V Weak Topologies §1. Duality §2. The Dual of a Subspace and a Quotient Space §3. Alaoglu § Theorem $4. Reflexivity Revisited §5. Separability and Metrizability §6.* An Application: The Stone-Tech Compactification §7. The Krein-Milman Theorem $8. An Application: The Stone-Weierstrass Theorem §9.* The Schauder Fixed-Point Theorem §10.* The Ryll-Nardzewski Fixed-Point Theorem §11.* An Application: Haar Measure on a Compact Group §12.* The Krein-Smulian Theorem §13.* Weak Compactness CHAPTER VI Linear Operators on a Banach Space §1. The Adjoint of a Linear Operator §2.* The Banach-Stone Theorem §3. Compact Operators §4. Invariant Subspaces §5. Weakly Compact Operators 7 73 16 80 84 86 88 OL 92 93 97 98 102 108 I U7 119 127 131 134 135 138 140 145 149 153 155 158 163 167 170 175 177 182 187 CHAPTER VIL Banach Algebras and Spectral Theory for Operators on a Banach Space §1. Elementary Properties and Examples $2. Ideals and Quotients §3.Tne Spectrum §4. The Riesz Functional Calculus §5. Dependence of the Spectrum on the Algebra §6. The Spectrum of a Linear Operator §7. The Spectral Theory of a Compact Operator §8. Abelian Banach Algebras §9.* The Group Algebra of a Locally Compact Abelian Group CHAPTER VIII C*-Algebras §1. Elementary Properties and Examples §2. Abelian C*Algebras and the Functional Calculus in C*-Algebras §3. The Positive Elements in a C#-Algebra §4.* Ideals and Quotients for C*-Algebras §5.* Representations of C*-Algebras and the Gelfand-Naimark-Segal Construction CHAPTER IX Normal Operators on Hilbert Space §1. Spectral Measures and Representations of Abelian C*-Algebras §2. The Spectral Theorem §3. Star-Cyclic Normal Operators §4. Some Applications of the Spectral Theorem §5. Topologies on @(H#) §6. Commuting Operators §7. Abelian von Neumann Algebras §8. The Functional Calculus for Normal Operators: The Conclusion of the Saga 99. Invariant Subspaces for Normal Operators §10. Multiplicity Theory for Normal Operators: A Complete Set of Unitary Invariants CHAPTER X Unbounded Operators §1. Basic Properties and Examples §2. Symmetric and Self-Adjoint Operators §3. The Cayley Transform §4. Unbounded Normal Operators and the Spectral Theorem 191 195 199 203 210 213 219 222 228 292 297 310 316 323 326 CHAPTER I Hilbert Spaces A Hilbert space is the abstraction of the finite-dimensional Euclidean spaces of geometry. Its properties are very regular and contain few surprises, though the presence of an infinity of dimensions guarantees a certain amount of surprise. Historically, it was the properties of Hilbert spaces that guided mathematicians when they began to generalize. Some of the proper- ties and results seen in this chapter and the next will be encountered in more general settings later in this book, or we shall see results that come close to these but fail to achieve the full power possible in the setting of Hilbert space. §1. Elementary Properties and Examples Throughout this book F will denote either the real field, R, or the complex field, C. 1.1. Definition. If X is a vector space over F, a semi-innerproduct on X is a function u: Xx X >F such that for all a, 8 in F and x, y, z in %, the following are satisfied: (a) u(ax + By, z) = au(x, z)+ Bu(y,z), (b) u(x, ay + Bz) = Gu(x, y) + Bux, 2), (c) u(x, x) = _ 0. (d) u(x, y) = u(y, x). Here, for a in F,%=a if F =R and @ is the complex conjugate of a if F=C. If aC, the statement that a> 0 means that aR and a is non-negative. 2 I. Hilbert Spaces Note that if a = 0, then property (a) implies that u(0, y) = u(a . 0, y) = au(0, y) = 0 for all y in @. This and similar reasoning shows that for a semi-inner product u, (e) u(x,0) = u(0, y) = 0 for all x, yin &. In particular, u(0,0) = 0. An inner product on 2 is a semi-inner product that also satisfies the following: (f) If u(x, x) = 0, then x = 0. An inner product in this book will be denoted by (x.y) = u(x, ¥). There is no universally accepted notation for an inner product and the reader will often see (x, y) and (x|y) used in the literature. 1.2. Example. Let 2 be the collection of all sequences {a,:n 21} of scalars a, from F such that «, = 0 for all but a finite number of values of n. If addition and scalar multiplication are defined on 2% by fa,}+ {Bi} = {on + Br}, afa,} = (aa, }, then 2 is a vector space over F. If U(( a, }, (By }) = L% 142,82, then wu is a semi-inner product that is not an inner product. On the other hand, (a4), (B}) = Lobe (4) (Bu) = Be FB co {4}, (Bib) = 2 n%,B,, nol all define inner products on 2. 1.3. Example. Let (X, 2,») be a measure space consisting of a set X,a u-algebra Q of subsets of X, and a countably additive RU {co} valued measure # defined on Q.If f and g ©L°(p)=L7(X,2,"), then Holder s inequality implies fg €L'(p). If (fa) = ffean, then this defines an inner product on L?(p). Note that Holder $ inequality also states that ({f@4@u| 0, and let a= et, tin R. The above inequality becomes 0 < (xx) —e7 tbe! — e' tbe“? + 1% y, y) (x, x) — 2bt + Py, y) = c — 2bt + at?= q(t), where c = (x, x) and a = (y, y). Thus g(t) is a quadratic polynomial in the real variable ¢ and q(t) = 0 for all ¢. This implies that the equation q(t) = 0 has at most one real solution ¢. From the quadratic formula we find that the discriminant is not positive; that is, 0 =4b?—4ac. Hence 0 2b? —ae = |\(x, y)/? — (x, x)(», ¥), proving the inequality. . The inequality in (1.4) will be referred to as the CBS inequality. 1.5. Corollary. If(+,+) is a semi-innerproduct on £ and \|x\|= (x, x)'7? for all x in &, then (a) IIx + il S[lxll + Ill for x. y in % (b) |Jax|| = |a|||xl| for a in F and x in &. If (+, +) is an inner product, then (c) ||x|| = 0 implies x = 0. Proor. The proofs of (b) and (c) are left as an exercise. To see (a), note that for x and y in X, Ux + yl? = (x+y, x 4 ¥) = xl? + (x) + Oy) + DIP = {xI? + 2Re(x, y) + Ibvll. By the CBS inequality, Re(x, y) <|(x, »)|F such that (0) = 0 and f’eL(O, 1). If (f, g) = fof (g(t) dt for f and g in 3%, then # is a Hilbert space (Exercise 3). Suppose 2 is a vector space with an inner product ( -,-) and the norm is defined by the inner product. What happens if (2, d) (d(x, y) =||x— yl) is not complete? 1.9. Proposition. If X is a vector space and ( -,*) is an inner product on X and if # is the completion of X with respect to the metric induced by the norm on £, then there is an inner product (-,+)y on H€ such that (x. Ye= (x, Ye porx and y in X and the metric on H is induced by this inner product. That is, the completion of X is a Hilbert space. The preceding result says that an incomplete inner product space can be completed to a Hilbert space. It is also true that a Hilbert space over R can be imbedded in a complex Hilbert space (see Exercise 7). This section closes with an example of a Hilbert space from analytic function theory. 1.10. Definition. If G is an open subset of the complex plane C, then L2(G) denotes the collection of all analytic functions ff G—C such that Sfye + iy)Pdxedy g(z) uniformly on compact subsets of G. But since flf,— f? du > 0, a result of Riesz implies there is a subse- quenee { fn, } such that f,,(z) > f( ae. [#]. Thus f= Q ac. [p] and so FeLi). a EXERCISES 1. Verify the statements made in Example 1.2. 2. Verify that ?(1) (Example 1.7) is a Hilbert space. 3. Show that the space # in Example 1.8 is a Hilbert space. 4. . Describe the Hilbert spaces obtained by completing the space 2 in Example 1.2 with respect to the norm defined by each of the inner products given there. 5. (A variation on Example 1.8) Let n> 2 and let #= the collection of all functions f: [0, 1]>F such that (a) £@) = 0; (b) for 1 0, choose N such that for n =N, ||k,l|? N, then 2 An ml < (2d? + he2)-d? = ke’. i Thus, \|k,—k,,|| Nand {k,} is a Cauchy sequence. Since 3 is complete and K is closed, there is a kg in K such that ||k,—kgl|> 0. Also for all k,,, 4 |[koll = llKo — ky + Anll Sllko ~ Kull + Wall > 4. Thus |jkoll = d. To prove that ko is unique, suppose hg©K such that |lAol|/=d By convexity, 3(ky + h,) © K. Hence, dS [iho + Koll < H(lAoll + lIkoll) <4. So ||}(o + Ko)|| = d. The Parallelogram Law implies hy + ko hy ~ ko 2 2 2 2 a= =q?- hence hy=k,. . If the convex set in the preceding theorem is in fact a closed linear subspace of 3, more can be said. 2.6. Theorem. If M is a closed linear subspace of #,h © #, and fy is the unique element of M such that ||h— fol| = dist(h, #), then h — fol M. Conversely, if fy M such that h — fol M, then \|h— foll = dist(h, 4). Proor. Suppose fy€ and ||h— folj = dist(h, #). If FEM, then fo +f € Mand so ||k — full? < [Ik — (fo + pI? = MA fo)- AP = Wa fall? — 2 Re A ~ fo, f + If’. Thus 2Re(A— for f) < MAP for any fin M. Fix fin M and substitute tef for fin the preceding inequality, where (h — fy, = re'®,r>0. This yields 2 Ref tere} < PIAL, or 2tr <1 I[fl|. Letting t> 0, we see that r = 0; that is, h— fol f. For the converse, suppose fy such that h — fol A. If fem, then h-folfo-f so that We fl? = ICA = fo) + fo~ pI? = WA fl? + Wo AP 2 NIA fall”. Thus ||A— foll = dist(h, #). If AC #, let At+={feH#: fig forall g in A}. It is easy to see that A + is a closed linear subspace of 3. Note that Theorem 2.6, together with the uniqueness statement in Theo- rem 2.5, shows that if is a closed linear subspace of Jf and h € #, then there is a unique element f, in. such that h — fy¢.M@+. Thus a function P: > M can be defined by Ph = fo. 2.7. Theorem. If M is a closed linear subspace of # and h & H#, let Ph be the unique point in M such that h — Ph 1M. Then (a) P is a linear transformation on #, (b) ||PAl| SAI] for every h in 3#, (c) P? = P (here P? means the composition of P with itself ), (d) kerP= M+ and ranP=AM. Proor. Keep in mind that for every A in 3?,h ~ Ph © M~* and ||h— PAj| = dist(h, #). (a) Let Ay, Ay € # and a,a,€F. If fEM, then ([ayh, + ah] — [a,Ph, + @,Phy],f) = ah, — Phy, f) + a,¢h,- Ph, f) = 0. By the uniqueness statement of (2.6), P(ah, + a,h2) = a,Ph,+aPh. (b) If hE, then h=(h— Ph) + Ph, Phe M, and h—- Phe M+. Thus [[A[|? = a — Pall? + || Pl}? > |LPAll?. (c) If f €M, then Pf = f. For any h in 3, Ph © M; hence P?h = P( Ph) = Ph, That is, P? = P. (d) If Ph = 0, then h =h — PhEM*. Conversely, if hE M*, then 0 is the unique vector in such that h—0=h 1M. Therefore Ph = 0. That ran P = M is clear. s 2.8. Definition. If is a closed linear subspace of # and P is the linear map defined in the preceding theorem, then P is called the orthogonal projection of 3 onto . If we wish to show this dependence of P on #, we will denote the orthogonal projection of 3# onto M by Py. It also seems appropriate to introduce the notation M <# to signify that @ is a closed linear subspace of #. We will use the term linear manifold to designate a linear subspace of # that is not necessarily closed. A linear subspace of # will always mean a closed linear subspace. 2.9. Corollary. If MF a linear functional. The following statements are equivalent. (a) L is continuous. (b) L is continuous at 0. (c) L is continuous at some point. (d) There is a constant c > 0 such that \L(h)| < cljh\\ for every hin 3. PRooF. It is clear that (a) = (b) = (c) and (d) = (b). Let § show that (c) = (a) and (b) = (d). (c) = (a): Suppose L is continuous at Ay and h is any point in #. If h,> hin #, then h,—h+ hy >h,. By assumption, L(ho) = lim[L(h, —h + hj] = lim[L(h,)— L(h) + L(ho)] = lim L(h,)— L(h) + L(ho). Hence L(h) = lim L(h,). (b) = (d): The definition of continuity at O implies that L~'({ a IF: la|< 1)) contains an open ball about 0. So there is a 68> 0 such that BQO; 8) C L-({a€F:Ja|<1}). That is, \Al]<8 implies |L(A)|< 1. If A is an arbitrary clement of 3 and e> 0, then |[8({|A|| + 2) ‘Al|<8. Hence +e l|- La: 1 IL(A) < 5 (All + ©)- Letting ¢-> 0 we see that (d) holds with c = 1/6. a 1> Wr ¥el thus, 3.2. Definition. A bounded linear functional L on # is a linear functional for which there is a constant ¢ >0 such that |L(A)|F, define WLI = sup{|L(h)|: |All <1}. Note that by definition, ||L|]|<00;||L|| is called the norm of L. 3.3. Proposition. IfL is a linear functional, then WLI = sup{iL(%)|= |All = 1} sup{|L(A)|/||Allh € 2, h + 0} inf{c > 0:|L(A)| 0: |[L(A)|| < e|iAl], kh in 9}. It will be shown that \|L|| = a; the remaining equalities are left as an exercise. If e> 0, then the definition of Ll] shows that |L(|Al| +2) 'A)| <|iLI|. Hence |L(A)| < ILIA + 2). Letting e-> 0 shows that |L(A)|<(||L||||Al| for all h. So the definition of a shows that a<||L\l. On the other hand, if |L(A)| = WAoll, SO that LI] = |Aol]- The main result of this section provides a converse to these observations. 3.4. The Riesz Representation Theorem. Zf L: #->F is a bounded linear functional, then there is a unique vector hg in # such that L(h) = (h, h 9) for every h in 3. Moreouer, \\L\| = |\Aoll- Proor. Let M =kerL, Because L is continuous, # is a closed linear subspace of #. Since we may assume that 4 #9, M+# (0). Hence there is a vector fy in. M+ such that L( fy) = 1. Now if hE # and a= L(h), then L(A—afy) = L(h) —a = 0; so h -L(h) foe M. Thus 0 = (h-L(h) fos fo) = h, fo) — LAMA? So if Ay = (Voll ~2f. L(h) = (h, hy) for all h in 0. If hg © # such that (A, ho) = (h, AG) for all A, then hy— hot #. In particular, hg— ho Lhy—ho and so hy = ho. The fact that ||L\} = \\Aoll was shown in the discussion preceding the theorem. . 3.5. Corollary. If (X, 2,) is a measure space and F:L?(u)—>F isa bounded linear functional, then there is a unique hg in L?(m) such that F(h) = f hh, dp for every h in L?(p). Of course the preceding corollary is a special case of the theorem on representing bounded linear functionals on L ?(1), 1

1 and L:9¢-+F is defined by L({a,})=ay, find the vector fg in 3 such that L(h) = (h, ho) for every h in #. 3. Let 9=—(N u (O}). (a) Show that if {a,}€/°, then the power series E%_a, 2” has radius of convergence > 1. (b) If |AJ< 1 and L:#C is defined by L({a,}) = L%-oa,X", find the vector hg in ¥@ such that L(h) = (h,ho) for every h in 2. (c) What is the norm of the linear functional L defined in (b)? 4, With the notation as in Exercise 3, define L: > € by L({a,})=E2 na y"!, where |A|< 1. Find a vector ho in #% such that L(h) = (h,ho) for every h in 3. 5, Let J be the Hilbert space described in Example 1.8. If 0 <1 < 1, define L: 9+ F by Lth) = A(z), Show that L is a bounded linear functional, find ||LI}, and find the vector hg in 3% such that L(h) = (h, fo) for all A in 3, 6 Let #=L7(0, 1) and let C™ be the set of all continuous functions on [0, 1] that have a continuous derivative. Let t€ [0,1] and define L:C”—F by L(h) = A(t). Show that there is no bounded linear functional on 3% that agrees with L on C), §4. Orthonormal Sets of Vectors and Bases It will be shown in this section that, as in Euclidean space, each Hilbert space can be coordinatized. The vehicle for introducing the coordinates is an orthonormal basis. The corresponding vectors in F4 are the vectors {€1,€5,-.., a}, where e, is the d-tuple having a 1 in the & th place and zeros elsewhere. 4.1. Definition. An orthonormal subset of a Hilbert space # is a subset & having the properties: (a) for e in &,|lel| = 1; (b) if e;,e) € 6 and e, #e3, then e; Le. A basis for # is a maximal orthonormal set. Every vector space has a Hamel basis (a maximal linearly independent set). The term basis for a Hilbert space is defined as above and it relates to the inner product on #. For an infinite-dimensional Hilbert space, a basis is never a Hamel basis. This is not obvious, but the reader will be able to see this after understanding several facts about bases. 4.2. Proposition. If € is an orthonormal set in #, then there is a basis for # that contains &. The proof of this proposition is a straightforward application of Zorn $ Lemma and is left to the reader. 4.3. Example. Let #= [0,27] and for n in Z define e, in # by e(t) = 7) exp(int). Then {e,: 2 ©Z} is an orthonormal set in #. (Here L2[0,22] is the space of complex-valued square integrable functions.) It is also true that the set in (4.3) is a basis, but this is best proved after a bit of theory. 4.4, Example. If #?=F4 and for 1 | let &, = {e € I: |(h,e)|2 I/n}. By Bessel $ Inequality, &, is finite. But U%_,é, = {e © &: (h, e,) # O}. . 4.10. Corollary. Zf€ is an orthonormal set and h © #, then Likh,ey? s tal? eed This last corollary is just Bessel $ Inequality together with the fact (4.9) that at most a countable number of the terms in the sum differ from zero. Actually, the sum that appears in (4.10) can be given a better interpreta- tion- a mathematically precise one that will be useful later. The question is, what is meant by D{h;: i€ 1} if h, © # and J is an infinite, possibly uncountable, set? Let ¥ be the collection of all finite subsets of J and order F by inclusion, so ¥ becomes a directed set. For each F in ¥, define =D {aie F}. Since this is a finite sum, h, is a well-defined element of #. Now {hy: “FeEF¥)isanetin #. 4.11. Definition. With the notation above, the sum L{h,: i € J} converges if the aet {4,: F € F} converges; the value of the sum is the limit of the net. If #?= F, the definition above gives meaning to an uncountable sum of scalars. Now Corollary 4.10 can be given its precise meaning; namely, L{| 0, there is an N such that D> y\(h,e, yi < ee. Let R= {€,---,@y-1} and let #= all the finite subsets of &. For F in F define hp= Eh, eye: e€ F}. If F and G © and both contain Fy, then Wap = hel? = L {Ich e)P: e € (F\G) U(G\ F)} s r KCA,enyP? n=N (b): Suppose h L@ and h ¥ 0; then €U{A/|All} is an orthonormal set that properly contains @, contradicting maximality. (b) = (c): By Corollary 2.11, V8=# if and only if &+ = (0). (b) = @): If A EH, then f =h-LX{ (h, e)e:e SF} is a well-defined vector by Lemma 4.12. If e, ©@, then (f, e;) = (h, e))— L{(h,e){e, e,): e€&} = (h, e,)— (h, e)) = O. That is, f€&+. Hence f = 0. (Is every- thing legitimate in that string of equalities? We dont want any illegitimate equalities.) (d) = (e): This is left as an exercise for the reader. (e) =(f): Since Wall? = (h, h), this is immediate. (f)= (a): If & is not a basis, then there is a unit vector eo ({leol| = 1) in 9% such that eg 1 &. Hence, 0 = L{|(e,e)|:e€@}, contradicting (A. . Just as in finite-dimensional spaces, a basis in Hilbert space can be used to define a concept of dimension. For this purpose the next result is pivotal. 4.14. Proposition. Zf # is a Hilbert space, any two bases have the same cardinality. Proor. Let 6 and F¥ be two bases for # and put e = the cardinality of &, 74 = the cardinality of #. If e or q is finite, then e = q (Exercise 15). Suppose both e and q are infinite. For e in @, let A={ feF:(e p # O}; so , is countable. By (4.13b), each fin F belongs to at least one set F,,e in &. That is, F=ULF:e€}. Hence n yn =—(=+ -1)". Pax) aril ae) (>) The functions P,(x) are called Legendre polynomials. 7. Ifthe sequence exe", We" /?, is orthogonalized in L2(—00, 00), the sequence e,,(x) = (2"nlVa}/7H,(x)e-* ” is obtained, where ° nf 2)" A(x) = (-1)"e"(Z) The functions H, are Hermite polynomials and satisfy H;(x) =2 nH, ( x) « 8. If the sequence e~*/?, xe~*/?, x?e~*/?,.. is orthogonalized in L? (0,00), the sequence e,(x) = e~*/7L, (x)! is obtained, where L(x) = e(s) (x"e"*). ‘The functions L,, are called Laguerre polynomials. 9, Prove Corollary 4,10 using Definition 4.11. 10. If {h,} is a sequence in Hilbert space and L{h,:2€N)} converges to h (Definition 4.11), then lim,Dj_ ,h, = h. Show that the converse is false. LL. If {A,} is a sequence in a Hilbert space and £%.,||h,|]<00, show that (h,: n&N} converges in the sense of Definition 4.11. 12. Let {a,,} be a sequence in F and prove that the following statements are equivalent: (a) L{ a.: nN} converges in the sense of Definition 4.11. (b) If is any permutation of N, then L%_,a,,,) converges (unconditional convergence). (6) Dilan] < 00. 13, Let & be an orthonormal subset of # and let M = Vé.If P is the orthogonal projection of #% onto M, show that Ph = L{ (h, ee: e €&} for every h in #, 14, Let A = Area measure on D and show that 1, z, z?, . . . are orthogonal vectors in L*(A). Find |[z"|,n> 0. If e, = |Iz"I|-'z", n> 0, is {e., e,.} a basis for L?(A)? 15. In the proof of (4.14), show that if either e or 7 is finite, then e= 9 16. If # is an infinite-dimensional Hilbert space, show that no orthonormal basis for # is a Hamel basis. Show that a Hamel basis is uncountable. 17. Let d> | and let p be a regular Borel measure on R4. Show that L?(p) is separable. 18. Suppose L?(X,2,q) is separable and { EB: i € J} is a collection of pairwise disjoint subsets of X,£,€, and 0 X such that (Uh, Ug) = ¢h, 8) for all h, g in J@. In this case # and X are said to be isomorphic. It is easy to see that if U: 9? # is an isomorphism, then so is U~?: X— #. Similar such arguments show that the concept of isomorphic is an equivalence relation on Hilbert spaces. It is also certain that this is the correct equivalence relation since an inner product is the essential ingredient for a Hilbert space and isomorphic Hilbert spaces have the Same inner product. One might object that completeness is another essential ingredient in the definition of a Hilbert space. So it is! However, this too is preserved by an isomorphism. An isometry between metric spaces is a map that preserves distance. 5. Proposition. [f V: 3°— X is a linear map between Hilbert spaces, then V is an isometry if and only if (Vh, Vg) = (h, g) for all h, g in #. Proor. Assume (Vh, Vg) = (h, g) for all h, g in 4. Then Val)? = #¢ that is a surjective isometry. That is, a unitary operator is an isomorphism whose range coincides with its domain, This may seem to be a minor distinction, and in many ways it But experience has taught me that there is some benefit in making such a distinction, or at least in being aware of it. 5.4. Theorem. Two Hilbert spaces are isomorphic if and only if they have the same dimension. Proor. If U:#— & is an isomorphism and @ is a basis for #, then it is easy to see that UP ={Ue:e €@} is a basis for #. Hence, dim #= dim %. Let # be a Hilbert space and let & be a basis for #. Consider the Hilbert space 1°(&). If he #, define h:@>F by h(e) = (h,e). By Parseval’s Identity he/?(&) and |jAl| = |||]. Define U: > 12(&) by Uh =k. Thus U is linear and an isometry. It is easy to see that ranU contains all the functions f in /2(&) such that f(e) = 0 for all but a finite number of e; that is, ranU is dense. But U, being an isometry, must have closed range. Hence U: #17(&) is an isomorphism. If X is a Hilbert space with a basis #,X is isomorphic to /7(F). If dim #= dim #,& and ¥ have the same cardinality; it is easy to see that P(@)and 1?(.F) must be isomorphic. Therefore # and X are isomorphic. . 5.5. Corollary. All separable infinite dimensional Hilbert spaces are isomor- phic. This section concludes with a rather important example of an isomor- phism, the Fourier transform on the circle. The proof of the next result can be found as an Exercise on p. 263 of Conway [1978]. Another proof will be given later in this book after the Stone-Weierstrass Theorem is proved. So the reader can choose to assume this for the moment. Let D = {z €C:|z|<1}. 5.6. Theorem. Zf f:@D—C is a continuous function, then there is a sequence { p,( 2, Z)} of polynomials in z and Z such that p,(2,2)— flz) uniformly on dD. Note that if z €9D,2= 27". Thus a polynomial in z and Z on 0D becomes a function of the form YL a2*. k= —m If we put z = e”, this becomes a function of the form n Y ae, m k: Such functions are called trigonometric polynomials, We can now show that the orthonormal set in Example 4.3 is a basis for L@[0, 27]. This is a rather important result. 5.7. Theorem. Zf for each n in Z, e(t) =(27) \/exp(int), then fe,: n€Z} is a basis for L2[0,27]. Proor, Let 7={LZ__,,e,: & EC, n> O}. Then FJ is a subalgebra of C,[0, 27], the algebra of all continuous C-valued functions on [0,27]. Note that if (ET, fO) = f(27). We want to show that the uniform closure of 7 is @={ f EC. [0, 27]: (0) = f(27)}. To do this, let fE@ and define F: 8D >C by Fle’) = ft). F is continuous. (Why?) By (5.6) there is a sequence of polynomials in z and 2,{ p,(z,Z)}, such that p,(z,Z)—> F(z) uniformly on D. Thus p,(e",e~") > f(t) uniformly on [0.2m]. But DAee "ETF. Now the closure of @ in L2[0,27] is all of L2[0,27] (Exercise 6). Hence V{ e: nEZ}=L2[0,27] and {e,} is thus a basis (4.13). . Actually, it is usually preferred to normalize the measure on [0,22]. That is, replace dt by (27)~' dt, so that the total measure of [0,27] is 1. Now define e,(t) = exp(int). Hence {e,: n€Z} is a basis for #= L&((0, 27], (27) 1 dt). If f EH, then /(n) = = p(y 58 Fn) = (Seen) = a5 [Pde ae is called the nth Fourier coefficient of f,n in Z. By (5.7) and (4.134), « 59 f= YL flaje a where this infinite series converges to f in the metric defined by the norm of 3. This is called the Fourier series of f. This terminology is classical and has been adopted for a general Hilbert space. If # is any Hilbert space and @ is a basis, the scalars {¢h, e); e © &} are called the Fourier coefficients of h (relative to &) and the series in (4.13d) is called the Fourier expansion of h (relative to 8). . Note that Parseval $ Identity applied to (5.9) gives that D%_ ,If(n)/?< infinity. This proves a classical result. 5.10. The Riemann-Lebesgue Lemma. If f€L7[0,27], then {oF (the ™ dt > 0 as n > 400. If f © L2[0, 27], then the Fourier series of f converges to f in L?-norm. It was conjectured by Lusin that the series converges to f almost every- where. This was proved in Carleson [1966]. Hunt [1967] showed that if f €L€[0, 27], 1

C is called the Fourier transform of f the map U:L2[0,22]—> 1°(Z) defined by Uf = f is the Fourier transform. The results obtained so far can be applied to this situation to yield the following. 5.11. Theorem. The Fourier transform is a linear isometry from L2(0,27] onto 1?(Z). Proor. Let U: L2[0,27]->/°(Z) be the Fourier transform. That U maps L? = 12{0,27] into /2(Z) and satisfies ||Uf|| =|[fl| is a consequence of Parseval § Identity. That U is linear is an exercise. If {a,}€/?(Z) and a, = 0 for all but a finite number of n, then f = D%_ ,a,e,€ L?. It is n= ~ ook easy to check that f(n) = a, for all n, so Uf = {a, }. Thus ranU is dense in P. But U is an isometry, so ranU is closed; hence U is surjective. = Note that functions in L@[0,27] can be defined on AD by letting f(ei®) = f(8). The ambiguity for 8 = 0 and 2a (or e” = 1) might cause us to pause, but remember that clements of L& [0,27] are equivalence classes of functions-not really functions. Since {0,27} has zero measure, there is really no ambiguity. In this way L2[0,27] can be identified with L&( dD), where the measure on @D is normalized arc-length measure (normalized so that the total measure of AD is 1). So L2[0,27] and L2 ( AD) are (naturally) isomorphic). Thus, Theorem 5.11 is a theorem about the Fourier transform of the circle. The importance of Theorem 5.11 is not the fact that L?[0,27] and /?(Z) are isomorphic, but that the Fourier transform is an isomorphism. The fact that these two spaces are isomorphic follows from the abstract result that all separable infinite dimensional Hilbert spaces are isomorphic (5.5). EXERCISES 1. Verify the statements in Example 5.3. 2. Define V: L?(0, 00) > L?(0, 00) by (Vf\(t) = f(r + 1). Show that V is an isometry that is not sujective. . Define V: L?(R) > L?(R) by (Vf)(t) = f(t + L) and show that V is an isomor- phism (a unitary operator). 4. Let # be the Hilbert space of Example 1.8 and define U: 9 L?(0, 1) by uf = f’. Show that U is an isomorphism and find a formula for U7}. 5. Let (X, @,p) be a w-finite measure space and let u:X > IF be an ~measurable function such that sup{ |u(x)|: « € X) < co, Show that U:L?(X,2,p)> L?(X,Q, w) defined by Uf = uf is an isometry if and only if |u(x)|= 1 ae. (#4) in which case U is sujective. 6, Let @= {f ©C[0,27}: f(O) = fQm)} and show that € is dense in L?(0,27]. 7. Show that ((1/ V2), (1/ Var)cos nt,(1/ Vm )sin nt: | L?(n) by Vf = Yof. Show that V is a well-defined linear isometry and V is an isomorphism if and only if p< v (that is, p and v are mutually absolutely continuous). 24 §6. The Direct Sum of Hilbert Spaces Suppose 9 and ¥ are Hilbert spaces. We want to define #@ X s0 that it becomes a Hilbert space. This is not a difficult assignment. For any vector spaces # and Y,%@® Y is defined as the Cartesian product 2 x Y where the operations are defined on 2X Y coordinatewise. That is, if elements of 2 Y are defined as {x ®@y:x EX, ye Y}, then (x, @ y,) +(x, @ yy) = (x, + X,)@(¥, + 2), and so on. 6.1. Definition. If and & are Hilbert spaces, #® H={h@k: hE H#H, kX} and (hy ® ky, hy ® ky) = (hy, ha) + Chis ka). It must be shown that this defines an inner product on #@ % and that #8 HX is complete (Exercise). Now what happens if we want to define #,®#,@--+ for a sequence of Hilbert spaces #,, %,...? There is a problem about the completeness of this infinite direct sum, but this can be overcome as follows. 6.2. Proposition. If 3, %,... are Hilbert spaces, let H= {(h ,)% h, € #, for all n and L2.,\\h,\\? < 00}. For h = (h,) and g = (g,) in #, dejine 6.3 (h, 8) = ¥ Chas &)- n=l Then <-,+) is an inner product on 3 and the norm relative to this inner product is \Al| = (2% ,\t,t(7.With this inner product # is a Hilbert space. Proor. If h = (h,) and g = (g,.) © #, then the CBS inequality implies LAs Bu 1S LU Mall Mall $ LUA gll?)'/7 (Lig all?)'/? < 00. Hence the series in (6.3) converges absolutely. The remainder of the proof is left to the reader. . 64. Definition. If #,,#%4,... are Hilbert spaces, the space # of Proposi- tion 6.2 is called the direct sum of #,,96,,... and is denoted by #= #, OH,O---. This is part of a more general process. If {#:i€ J} is a collection of Hilbert spaces, #=@{ #f:i€/} is defined as the collection of function: h: 1>U{ #@:i€ I} such that A(i) © % for all i and L{A(i)I)? i€ I} <0. Ih, g €H#, (h, 9) =L{(ACi), Qi): i EI}; H is a Hilber space. The main reason for considering direct sums is that they provide a way of manufacturing operators on Hilbert space. In fact, Hilbert space is a rather dull subject, except for the fact that there are numerous interesting ques- tions about the linear operators on them that are as yet unresolved. This subject is introduced in the next chapter. EXERCISES _ 1, Let {(X,,@,,p,):i 1) be a collection of measure spaces and define X, 2, and p as follows. Let X = the disjoint union of {X;:i€ 1) and let Q= {A Cc X: An X,€Q, for all ij. For A in @ put p(A)=,,(A n X,). Show that (X, &, p) is a measure space and L?( X, @, 1) is isomorphic to { L?(X,, 2, u,): ie I). 2. Let (X, 2) be a measurable space, let #;, #. be measures defined on (X, 2), and put #=p,+p,. Show that the map V:L7(X,2,p)>L?( X, 2,4) ® L?(X,Q,p5) defined by Vf = f;®@f,, where f, is the equivalence class of L?(X, 2,,) corresponding to f, is well defined, linear, and injective. Show that U is an isomorphism iff p, and p, are mutually singular. CHAPTER II Operators on Hilbert Space A large area of current research interest is centered around the theory of operators on Hilbert space. Several other chapters in this book will be devoted to this topic. There is a marked contrast here between Hilbert spaces and the Banach spaces that are studied in the next chapter. Essentially all of the information about the geometry of Hilbert space is contained in the preceding chapter. The geometry of Banach space lies in darkness and has attracted the attention of many talented research mathematicians. However, the theory of linear operators (linear transformations) on a Banach space has very few general results, whereas Hilbert space operators have an elegant and well- developed general theory. Indeed, the reason for this dichotomy is related to the opposite status of the geometric considerations. Questions concerning operators on Hilbert space dont necessitate or imply any geometric difficul- ties. In addition to the fundamentals of operators, this chapter will also present an interesting application to differential equations in Section 6. §1. Elementary Properties and Examples The proof of the next proposition is similar to that of Proposition 1.3.1 and is left to the reader. Ll. Proposition. Let # and X be Hilbert spaces and A: #—> X a linear transformation. The following statements are equivalent. (a) A is continuous. (b) A is continuous at 0. (c) A is continuous at some point. (d) There is a constant c > 0 such that ||AA|| 0: ||AA|| L*(u) by Myf = of. Then My B(L"(u)) and |Mgll = ll9llo- Proor. Here ||$l|,,. is the ~-essential supremum norm. That is, lIéllae = inf{sup{lo(x)|: x € NJ: N © @, p(N) = 0} = inf{c > 0: w({x © X: |(x)|> c}) = O}. Thus Il9ll . is the infimum of all c > 0 such that |p(x)j 0, the u-finiteness of the measure space implies that there is a set A in 2,0 0, we get that |IM,|| > lisll..» a The operator M, is called a multiplication operator. The function ¢ is its symbol. If the measure space (X, 92,) is not a-finite, then the conclusion of Theorem 1.5 is not necessarily valid. Indeed, let @ = the Borel subsets of [0, 1] and define » on 2 by p(4) =the Lebesgue measure of A if 0 ¢ A and p(4) =00 if0 € A. This measure has an infinite atom at 0 and, therefore, is not u-finite. Let @=x,o). Then ¢€ L*(u) and |l9ll,, = 1. If FE L*(n), then o> /If]? du =|f()I?u({0}). Hence every function in L?(#) vanishes at 0. Therefore M, =0 and ||M,J|<|ldll,.- There are more general measure spaces for which (1.5) is valid-the decomposable measure spaces (see Kelley [1966]). 1.6. Theorem. Let ( X, 9,4) be a measure space and suppose k: X x X>F isan Q X Q-measurable function for which there are constants cand c, such that fies, vildu(y)se, ae.[n], {ks ri du(x) ser ae. [a]. If K: L(w) > L*(u) is defined by (KF )(x) = fee »)F(0) del), then K is a bounded linear operator and ||K||<(¢\C2)'”?. Proor. Actually it must be shown that Kf €L?(), but this will follow from the argument that demonstrates the boundedness of K. If FE L7(p), IK s fle, YIVOV dey) = flex, A(x, 970) der) 1/2| 1/2 «| fies an6o9] [fees rar) <6? [ fies mvorran(oy] ”. Hence SKF u(x) < ef flex, VOIP du(y) d(x) = flO? fies vide) du(y) < eel’. Now this shows that the formula used to define Kf is finite ac. [p], Kf © L(y), and KAP seycalfl’. The operator described above is called an integral operator and the function & is called its kernel. There are conditions on the kernel other than the one in (1.6) that will imply that Kis bounded. A particular example of an integral operator is the Volterra operator defined below. 1.7. Example. Let &: f0, 1] x [0,1] >R be the characteristic function of {(x, y): y < x}. The corresponding operator V:L?(0, 1) > L?(0, 1) defined by Vf (@) = fdk(x, fl y) dy is called the Volterra operator. Note that 4x) = L104. Another example of an operator was defined in Example 1.5.3. The nonsurjective isometry defined there is called the unilateral shift. It will be studied in more detail later in this book. Note that any isometry is a bounded operator with norm 1. EXERCISES 1. Prove Proposition 1.1. 2. Prove Proposition 1.2. 3. Suppose {e, } is an orthonormal basis for #% and A: 3% 2X is a linear transformation such that E|[Ae,||<00. Show that A is bounded. 4, Proposition 1.2 says that d(A, B) = ||A— Bll is a metric on B(#, X). Show that @(3, X) is complete relative to this metric. 5. Show that a multiplication operator M, (1.5) satisfies M2 = M, if and only if g is a characteristic function. 6. Let (X, @,q) be a measure space and let ky,k> be two kernels satisfying the hypothesis of (1.6). Define ki XX XE byk(x.y) = fhi(x,2)ka(z,¥) du(z). (a) Show that k also satisfies the hypothesis of (1.6). (b) If K, K,,K are the integral operators with kernels k, k,, kz, show that K = K, K,. What does this remind you of? Is more going on than an analogy? 7. If (X, @,p) is a measure space and k © L7(u X w), show that k defines a bounded integral operator. 8. Let (e,} be the usual basis for /? and let {a, } be a sequence of scalars, Show that there is a bounded operator A on /? such that Ae, = a@,e, for all n if and only if {a, } is uniformly bounded, in which case ||A|] = sup{ |a,|:n> 1). This type of operator is called a diagonal operator or is said to be diagonalizahle. 9. (Schur test) Let (@,,}%j.1 be an infinite matrix such that a, 2 0 for all i, j and such that there are scalars p, > 0 and B,y> 0 with we LY a,,p, < Bp,» i=l LX ap, <1, jr for all i, j = 1. Show that there is an operator A on P(N) with (Ae,,e, )= a), and |\A||° < By. 10. (Hilbert matrix) Show that (Ae,, @) = (i + j +1) 7! for 0

You might also like