ROBERT B. BURCKEL AN INTRODUCTION TO CLASSICAL COMPLEX ANALYSIS Vol. 1
Pure and Applied Mathematics A Series of Monog...
180 downloads
5189 Views
9MB Size
Report
This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form
ROBERT B. BURCKEL AN INTRODUCTION TO CLASSICAL COMPLEX ANALYSIS Vol. 1
Pure and Applied Mathematics A Series of Monographs and Textbooks Editors
Samuel Ellenberg and Hyman Barns
Columbia University, New York
RECENT TITLES
ROBERT A. ADAMS.Sobolev Spaces J. B E N E D ESpectral ~. Synthesis D. V. WIDDER. The Heat Equation IRVING E z u SEAL.Mathematical Cosmology and Extragalactic Astronomy J. DIEUWNNBTreatise on Analysis : Volume 11, enlarged and corrected printing ; Volume I V ; Volume V ; Volume V I HALPERIN, AND RAYVANSTONE. Connections, Curvature, and WERNER GREUB,STEPHEN Cohomology : Volume 111, Cohoniology of Principal Bundles and Homogeneous Spaces I. MARTIN ISAACS. Character Theory of Finite Groups JAMES R. BROWN. Ergodic Theory and Topological Dynamics C. TRUESDELL. A First Course in Rational Continuum Mechanics: Volume 1, General Concepts GEORGE GRATZER. General Lattice Theory K. D. STROYAN A N D W. A. J. LUXEMBURG. Introduction to the Theory of Infinitesimals B. M. PUTTASWAMAIAH AND JOHN D. DIXON. Modular Representations of Finite Groups MELVYN BERGER. Nonlinearity and Functional Analysis : Lectures on Nonlinear Problems in Mathematical Analysis A N D OWENBURKINSHAW. Locally Solid Riesz Spaces CHARALAMBOS D. ALIPRANTIS J A N MIKUSINSKI. The Bochner Integral THOMAS JECH. Set Theory CARLL. DEVITO.Functional Analysis MICHIELHAZEWINKEL. Formal Groups and Applications SIGURDUR HELGASON. Differential Geometry, Lie Groups, and Symmetric Spaces ROBERT B. BURCKEL. An Introduction To Classical Complex Analysis : Volume 1 C. TRUESUELL A N D R. G. MUNCASTER. Fundamentals of Maxwell’s Kinetic Theory of a Simple Monatomic Gas : Treated as a Branch of Rational Mechanics JOSEPH J. ROTMAN. An Introduction to Homological Algebra LOUISHALLE ROWEN. Polynominal Identities in Ring Theory B. BURCKEL. An Introduction T o Classical Complex Analysis : Volume 2 ROBERT BARRY SIMON. Functional Integration and Quantum Physics A N D HOST SACHS.Spectra of Graphs DRAGOS M. CVETLOVIC, MICHAEL DOOB, JOHN
An Introduction to Classical Complex Analysis VOl. 1 by Robert B. Burckel Kansas State University
ACADEMIC PRESS NEW YOPK SAN FRANCISCO 1979 A Subsidiary of Harcourt Brace Jovanovich, Publishers
CIP-Kurztitelaufnahme der Deutschen Bibliothek
Burckel, Robert B.: An introduction to classical complex analysis / by Robert B. Burckel. - Basel, Stuttgart: Birkhauser. VOI. 1. - 1979. (Lehrbucher und Monographien aus dem Gebiete der exakten Wissenschaften: Math. Reihe; Bd. 64) ISBN 3-7643-0989-X All Rights Reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without the prior permission of the Copyright owner. 0 Birkhauser Verlag Basel, 1979 ISBN 3-7643-0989-X North and South America Edition published by ACADEMIC PRESS, INC. 111 Fifth Avenue, New York, New York 10003 (Pure and Applied Mathematics, A Series of Monographs and Textbooks, Volume 82) ISBN 0-12-141701-8 (Academic Press) Library of Congress Catalog Card Number 78-67403
5
Contents Volume I PREFACE
9
Chapter 0 PREREQUISITES AND PRELIMINARIES $ 1 Set Theory $ 2 Algebra $ 3 The Battlefield Q 4 Metric Spaces $ 5 Limsup and All That Q 6 Continuous Functions $ 7 Calculus
13 13 14 14 15 18 20 21
Chapter I CURVES, CONNECTEDNESS AND CONVEXITY $ 1 Elementary Results on Connectedness $ 2 Connectedness of Intervals, Curves and Convex Sets $ 3 The Basic Connectedness Lemma Q 4 Components and Compact Exhaustions Q 5 Connectivity of a Set $ 6 Extension Theorems Notes to Chapter I
22 22 23 28 29 33 37 39
Chapter I1 (COMPLEX) DERIVATIVE AND (CURVILINEAR) INTEGRALS $ 1 Holomorphic and Harmonic Functions Q 2 Integrals along Curves $ 3 Differentiating under the Integral Q 4 A Useful Sufficient Condition for Differentiability Notes to Chapter I1
41 41 44 47 49 50
Chapter 111 POWER SERIES AND THE EXPONENTIAL FUNCTION Q 1 Introduction $ 2 Power Series (j 3 The Complex Exponential Function Q 4 Bernoulli Polynomials, Numbers and Functions Q 5 Cauchy’s Theorem Adumbrated Q 6 Holomorphic Logarithms Previewed Notes to Chapter 111
53 53 53 60 73 77 78 80
Chapter IV THEINDEX AND SOME PLANE TOPOLOGY 5 1 Introduction
83 83
6
Contents
$ 2 Curves Winding around Points $ 3 Homotopy and the Index $ 4 Existence of Continuous Logarithms 0 5 The Jordan Curve Theorem $ 6 Applications of the Foregoing Technology $ 7 Continuous and Holomorphic Logarithms in Open Sets $ 8 Simple Connectivity for Open Sets Notes to Chapter IV
83 90 92 102 106 111 113 115
Chapter V CONSEQUENCES OF THE CAUCHY-GOURSAT THEOREM-MAXIMUM 120 PRINCIPLES AND THE LOCALTHEORY $ 1 Goursat’s Lemma and Cauchy’s Theorem for Starlike Regions 120 127 $ 2 Maximum Principles 134 $ 3 The Dirichlet Problem for Disks 144 $ 4 Existence of Power Series Expansions 151 $ 5 Harmonic Majorization 165 $ 6 Uniqueness Theorems 172 $ 7 Local Theory 183 Notes to Chapter V Chapter VI SCHWARZ’ LEMMA AND ITS MANY APPLICATIONS $ 1 Schwarz’ Lemma and the Conformal Automorphisms of Disks $ 2 Many-to-one Maps of Disks onto Disks $ 3 Applications to Half-planes, Strips and Annuli $ 4 The Theorem of CarathCodory, Julia, Wolff, et al. $ 5 Subordination Notes to Chapter VI Chapter VII CONVERGENT SEQUENCES OF HOLOMORPHIC FUNCTIONS $ 1 Convergence in H ( U ) $ 2 Applications of the Convergence Theorems; Boundedness Criteria $ 3 Prescribing Zeros Q 4 Elementary Iteration Theory Notes to Chapter VII Chapter VIII POLYNOMIAL AND RATIONAL APPROXIMATION-RUNGE THEORY $ I The Basic Integral Representation Theorem $ 2 Applications to Approximation $ 3 Other Applications of the Integral Representation $ 4 Some Special Kinds of Approximation $ 5 Carleman’s Approximation Theorem 5 6 Harmonic Functions in a Half-plane Notes to Chapter VlII
191 191 197 198 203 207 215 218 218 228 237 242 25 1 256 256 260 265 268 273 276 289
Contents
Chapter IX THERIEMANN MAPPINGTHEOREM Q 1 Introduction Q 2 The Proof of CarathCodory and Koebe Q 3 FejCr and Riesz’ Proof Q 4 Boundary Behavior for Jordan Regions Q 5 A Few Applications of the Osgood-Taylor-Carathtodory Theorem Q 6 More on Jordan Regions and Boundary Behavior Q 7 Harmonic Functions and the General Dirichlet Problem Q 8 The Dirichlet Problem and the Riemann Mapping Theorem Notes to Chapter IX Chapter X SIMPLE AND DOUBLE CONNECTIVITY Q 1 Simple Connectivity Q 2 Double Connectivity Notes to Chapter X Chapter XI ISOLATED SINGULARITIES Q 1 Laurent Series and Classification of Singularities Q 2 Rational Functions Q 3 Isolated Singularities on the Circle of Convergence Q 4 The Residue Theorem and Some Applications Q 5 Specifying Principal Parts-Mittag-Leffler’s Theorem Q 6 Meromorphic Functions $ 7 Poisson’s Formula in an Annulus and Isolated Singularities of Harmonic Functions Notes to Chapter XI
7
293 293 298 303 303 310 315 322 333 337 344 344 348 355 359 359 366 375 377 390 395 398 406
Chapter XI1 41 1 OMITTED VALUESAND NORMAL FAMILIES 41 1 Q I Logarithmic Means and Jensen’s Inequality 41 7 Q 2 Miranda’s Theorem 432 Q 3 Immediate Applications of Miranda $ 4 Normal Families and Julia’s Extension of Picard’s Great 436 Theorem 441 Q 5 Sectorial Limit Theorems 450 Q 6 Applications to Iteration Theory 45 1 Q 7 Ostrowski’s Proof of Schottky’s Theorem 456 Notes to Chapter XI1 BIBLIOGRAPHY NAMEINDEX SUBJECT INDEX SYMBOL INDEX SERIES SUMMED INTEGRALSEVALUATED
462 544 554 568 569 570
8
Contents Volume I1 Chapter XI11 AND ITS COROLLARIES WERMER’S MAXIMALITY THEOREM Chapter XIV PHRAGMDN-LINDEL~F THEORY Chapter XV TERATOLOGY Chapter XVI OVERCONVERGENCE AND NATURAL BOUNDARIES Chapter XVII THEGAPTHEOREMS Chapter XVIII UNIVALENT FUNCTIONS-GEOMETRIC METHODS Chapter XIX APPLICATIONS TO BANACHALGEBRA BIBLIOGRAPHY
9
Preface This book evolved from lectures at the University of Oregon and at Kansas State University. The subject matter is analytic functions of a single complex variable, a truly glorious area of mathematics, abounding in deep and beautiful theorems. It is written, for better or for worse, in a modified Landau “SatzBeweis” style. Thus the book is almost wholly self-contained logically, but the role of the instructor in providing heuristics and motivation has not been usurped. I undertook the task partly, to quote Leo Rosten, in order that I might have the book; certainly there are many who could have done a far better job but who, deeply committed to research, have not found the time and energy to do so. On the other hand, a certain evangelical zeal motivates every author and I wanted to communicate some of these beautiful results to as large an audience as possible. To this end, the prerequisites are rather modest; they are detailed in Chapter 0 but consist mainly of an E - 6 familiarity with (and attitude toward) analysis, at about the level of Walter Rudin’s classic Principles of Mathematical Analysis. (However, complete mastery of that book is by no means necessary for the prospective reader of this one.) The material is divided into two volumes. Volume I, consisting of twelve chapters, covers basics, while Volume I1 is topical and its seven chapters are largely independent of one another. There is a large bibliography and chapter notes which are keyed to it. It is hoped that this will bring the novice into contact with the journal literature. Cauchy’s integral formula and the power series that flows from it are of course the basic first step in the study of complex analysis. The reader will not encounter them, however, until Chapter V. There are few geodesics in this book and subordinate themes are usually followed up where they are broached, which is as soon as they are relevant and the machinery needed to treat them is available. Often, however, special cases of major later themes are anticipated in exercises. But the main reason Cauchy’s theorem is deferred is to allow an examination of the topology of the plane. In Chapters 1 and IV most of the deeper results like the lnvariance of Domain and the Jordan Curve Theorem are proved. Thus, in particular, all the purely topological support material for the most general Cauchy theorem is disposed of at this point. 1 believe the reader will find Chapter IV gratifyingly elegant. Following Borsuk, Eilenberg and tech, everything is based on the existence of continuous logarithms (i.e., for cognoscenti, on cohomology) and Jordan’s theorem emerges surprisingly painlessly. No knowledge of algebraic topology is supposed nor is a long machinery-building prologue needed. I n fact, the efficiency and elegance of the techniques here might even serve as a motivation to the student to explore algebraic topology per se. In Chapter IX Jordan’s theorem is completed with Schonflies’. This is a by-product of an analysis of the boundary behavior of conformal maps on Jordan regions;
10
Preface
this deduction of Schonflies’ theorem, even though it yields so much more, is still the most economical. In Chapter X a climax is reached when all the topological and analytic features of simple connectivity are shown to be equivalent for plane regions. There too the fundamental form of the most general doubly connected region is established. In the meantime, harmonic and subharmonic functions, harmonic majorization, various maximum principles and the theory of convergence (including the results on induced convergence and the elementary theory of iteration) are developed. The polynomial approximation theorems of Weierstrass, Runge and Carleman are presented in Chapter VIII. Chapter IX also contains the Wiener-PerronKellogg solution of the Dirichlet problem for (bounded) simply-connected regions. The treatment of the mapping theorem there follows the beautiful “snuggling up” (to the boundary) method of Koebe and Carathtodory and the boundary treatment borrows ideas from several sources, mainly Lindelof and Caratheodory. Chapter XI is devoted to isolated singularities of holomorphic and harmonic functions, including Mittag-Leffler’s theorems, the Residue Theorem and its applications (e.g., Gauss sums and a Theta formula), rationality criteria, singularities on the circle of convergence, and the ideal theory of the ring of holomorphic functions. In Chapter XI1 Ostrowski’s beautiful proof, with explicit constants, of Schottky’s remarkable theorem is presented. In fact, I go all out and give Miranda’s extension of Schottky’s theorem, following Valiron; the reader thereby experiences an introduction to the methods of Nevanlinna theory. From this height we rappel through the Polya-SaxerCsillag theorem, normal families, Julia’s extension of Picard’s Great Theorem and the sectorial limit theorems of Monte], Lindelof, Hardy, lngham and Polya. In Volume I1 gap theorems, including several proofs of Fabry’s, Carison’s theorem on power series with integer coefficients and Duffin and Schaeffer’s generalization of Szego’s theorem on power series with only finitely many different coefficients are presented. Chapter XV is devoted to Bohr’s construction of a non-zero entire function convergent to 0 along every algebraic curve to infinity, a power series absolutely convergent in the unit disk which maps {lzl = 1) onto [0, I ] x [0, I], and other exotica. Included are some startling Baire Category results on overconvergence and natural boundaries. In Chapter XVIIl a little more background is expected of the reader: Double integrals (but only over open or compact sets with continuous integrands), Fubini’s theorem and the Jacobian change-of-variable formula are used as the fruitful area method of Bieberbach is exploited. Among the other highlights there are the various coefficient estimates of Bieberbach, Littlewood, Nevanlinna and Privalov, a careful treatment of the equivalence of the geometric and analytic notions of convex and starlike functions and the extension of the Riemann mapping theorem by de Posse1 and Grotzsch affirming that any region is conformal to a plane with parallel slits removed. Chapter XIX is addressed to the
Preface
11
reader who has some knowledge of Banach algebra and functional analysis (albeit the actual knowledge presupposed is minimal). There myriad applications of complex analysis to those subjects are explored, including a careful treatment of the holomorphic functional calculus, criteria for commutativity (of an algebra) and multiplicativity (of a linear functional), the Muntz-Szdsz closure theorem and the metric definition of hermiticity, as well as several applications to operators on Hilbert space. Because a prerequisite knowledge of measure theory is being eschewed, one rich and beautiful analytic topic is regrettably absent: the theory of the Hardy spaces on the unit disk or the upper half-plane. However, this matter is already extremely well exposed in the extant literature (cf. HOFFMAN [19621, chapter 17 of RUDIN[ 19741 and chapter 19 of HILLE[ 19621). I have borrowed freely from many of the great treatises and texts, but four especially have influenced me: my debt, in content, spirit, and method, to the books of SAKSand ZYGMUND [1971], RUDIN[I9741 and LANDAU[1929a] is enormous (and obvious to the knowledgeable reader) and I have made frequent forays into what is perhaps the greatest classic of all, P ~ L Yand A SZEG~) [ 19641.
The Bibliography is fairly extensive, certainly not exhaustive. Not every item in it is mentioned in the notes and comments, but most are related to material discussed in the text and could be profitably looked at, even by the beginner; especially this applies to papers from the American Mathematical Monthly, the Mathematics Magazine, Elemente der Mathematik and I’Enseignement Math&matique. On the other hand, not every paper I looked at and perhaps not every paper I borrowed an idea from appears in the bibliography-ars longa, vita brevis. The instructor using this book as a text or the reader pursuing it on his own should be alerted that most of its “exercises” are really just continuations of the text, with slightly less fulsome proofs. Sometimes calculations are relegated there, as are special results which will be needed as mortar later in the structure; in any case, most are teleological and there are no Fingeriibungen. The serious reader will therefore want to supplement his study here with one of the many available problem collections listed in the bibliography, e.g., P ~ L Yand A SZEGO [1972], 119761, KNOPP[1948], [1953], KRZYZ[1971], VOLKOVYSKII et al. [1965], FEYELand PRADELLE [ 19731 or EVGRAFOV et al. [ 19741. In researching the literature for this book, I was of course constantly encountering the giants (Landau, Pblya, Nevanlinna, Lindelof, Bieberbach, Ostrowski, CarathCodory, to mention only a few at random) and was left with a permanent sense of awe of them. I hope that this exposition of their work conveys that fact and even induces a similar awe in the reader. It is a pleasure to thank the several ladies who worked on typing this monstrosity, in various stages of its evolution: Judy Bernhart, Lynn Caldwell, Phyllis
12
Preface
Pickel, Judy Toburen, Marie Davis, Lorraine Douglas, Gail Buckner, Marlyn Logan and Elisabeth Quitsch. I thank my wife for help with some of the foreign language literature and the staff of William Clowes and Sons for their careful type-setting of a difficult manuscript. Special thanks go to Mrs. Ellyn Taylor and her staff at the Kansas State University library who secured for me a steady flow of interlibrary loans, principally from the non-pareil Linda Hall Science Library in Kansas City; and I express deep gratitude to that institution for its generous lending policy. The hospitality and good working conditions extended to me during the last phase of writing by the mathematics department of the University of the Saarland, particularly by my host Prof, Dr. Heinz Konig, are also gratefully and happily acknowledged. The extraordinary patience and accommodations of Mr. C. Einsele and his staff at Birkhiiuser in the face of my numerous late corrections cannot go unacknowledged. Finally I want to thank Prof. Dr. Alexander Ostrowski for valuable criticisms of the text and for his kind help in placing my book with Birkhauser Verlag and Prof. Edwin Hewitt for encouragement early in the project. The author welcomes correspondence from readers with criticisms and suggestions, especially in regard to errors (mathematical, historical or typographical) and obscurities, but also concerning better proofs, overlooked references, gems that could be profitably inserted here or there, and even a better ordering or presentation of the material (consistent with the obvious overall philosophy of the work). In the event of a second edition I will incorporate and acknowledge as many of these improvements as possible.
R. B. B.
13
Chapter 0 Prerequisites and Preliminaries As indicated in the Preface, only very modest specific knowledge is required of
the prospective reader. Those (salient) facts that will be used in the text without proof I will attempt to state fully below with references. What is really expected of the reader is a level of mathematical maturity comparable to that fostered by books like STROMBERG [1980], RUDIN [I9761 and LANDAU[1950], but by no means a mastery of the contents of these books. A junior or senior mathematics major at any good college or university nowadays should therefore be adequately equipped. Caveat: No one should read this chapter linearly (who could survive it ?), but only refer to it as the need arises.
01
Set Theory
We’ll be using the usual language and notation of set theory: E, V, 3, U, A, c ,etc. When P ( x ) is a proposition about x and S is a set, the set of all x in S for which P ( x ) is true is denoted by {x E S: P(x)}. When P ( x ) is the statement “x does not belong to A,” then {x E S: P ( x ) } is denoted by S\A. As usual, the empty set is denoted by 0 . The reader is assumed to have a modest acquaintance with naive (i.e., couched in a language and logic which have not been fully formalized), axiomatic set theory. Primarily he should know the bare rudiments of cardinal arithmetic. For over a decade the standard testament at this level has been HALMOS [1960]. This pretty little basic book is warmly recommended to the reader, even though in the present work only a small fraction of its contents will be utilized. Consult that work in particular for the standard terminology like map, function, injective, bijective, surjective, one-to-one, onto, countable, etc. The rubric8 S + Tor S Tmeans thatf is a function with domain Sand range a part of T. If A = S, then f ( A ) = { f ( x ) :x E A} is called the image of A underf and f IA or f I A traditionally denotes the restriction o f f to A . If B = T(and not necessarily B = f ( S ) or even B nf ( S ) # 0),then f - l ( B ) = {x E S : f ( x )E B } . This is called the inverse image of B underf; it may be void. When B is a singleton, B = { t } ,we write simply f - l ( f ) . Whenfis one-to-one, we use f - to denote the inverse function off (and the above notations are consistent). In case of zero1
free complex-valued functionsf, we write - or 1 / f for the function whose value
f
at each x is 1/f(x). We will never use f - l for the latter. The composition of two functionsfand g whose domains and images are properly related is denoted by f g. The Cartesian product of the sets A and B is denoted by A x B. The cross 0
14
Prerequisites and Preliminaries
is never used to signify multiplication, which is usually indicated by juxtaposition. Occasionally in long formulas dots are used to indicate multiplication and dots are used with the inner product in euclidean spaces. (See below.)
n
If 9 is a family of sets, we write U 9’(or 9’)for the union (or intersection) of all the sets in Z !. If Y = {S,: a E I},we write Use, S, (or Sa).When I is the integers or the natural numbers, we write Un“p S,, or U:=l S,,, etc. Other obvious variations on this notation are also employed. E.g., Up(,)S, = U {S,: P(a)} for the union of all the S, such that the statement P(a) is true. We follow the convention that the union of a void family of subsets of a set S is 0 and the intersection of a void family of subsets of S is all of S.
nao,
52
Algebra I use freely the basic language of algebra, like semigroup, group, ring, algebra, field, ideal, integral domain (for which consult any contemporary algebra text) but almost no facts from algebra. The third isomorphism theorem for (commutative) groups is used implicitly once (Chapter IV), as is the fact that a permutation is a product of disjoint cycles (Chapter VIII). I assume that the reader has a passing acquaintance with vector spaces and their linear transformations (matrices). Once (Chapter XI) I invoke the row-rank equals column-rank theorem and from time to time a dimension argument intervenes, often implicitly. A few elementary properties of determinants are used in 0 3 of Chapter XI.
03
The Battlefield N shall denote the natural numbers: 1,2,3,. . ., Z (for Zahl) the integers: N u {0} u - N, Q (for quotient) the rational numbers: {rn/n: m, n E Z, n # O}. We use R to denote the real numbers and C to denote the complex numbers. The latter is just the Cartesian product R x R with coordinate-wise addition and the multiplication (a, b)(c, d ) = (ac - bd, ad bc). That is, the multiplication is the one determined by the decree that (0, 1) have square equal to (- 1, 0), that the subset { ( x , 0): x E R} of C multiply in the usual way, and that the multiplication throughout C obey the field axioms (commutativity, associativity, distributivity). C is thus constructed from R, which in turn is constructed from Q via the Dedekind cut (see R U D ~ N[1976],chapter I). Of course, Q is manufactured from Z, which comes from N and the latter can be brought into being from set theory and a “successor” function. For the (consummate) details of the whole Aufbau see LANDAU[1951]. The order relation in N is transmitted up through Z,Q and into R (LANDAU, loc. cir.) We write Z t, Q t, R + for the non-negative elements of Z, Q, R, respectively. For a, b E R we write a I b and b 1 u if b - a E R’, a < b and b > a if b - a E R+\{O},i.e., if b - a is posiriue. When a I b we write
+
[a, b] = {x E R: a I x I b}, called a closed interval, (a, b) = { x E R: a < x < b}, called an open interval,
0 4. Metric Spaces
15
[a,b) = { x E 88: a I x < b}, called a half-open (on the right) interval, (a, b ] = { x E R: a < x 5 b}, called a half-open (on the left) interval. In each case a is called the left endpoint, b the right endpoint of the interval. There is no order in C but an interval notation is handy there too and will be introduced in Chapter I. We rely on context to resolve the ambiguity in the notation (a, b)-is it an interval or an ordered pair of real numbers ? The problem seldom (never?) arises because we don’t often use ordered pair notation for complex numbers and then not in the presence of intervals.
For any a, b E R we also write [a, a)= { x E R: a I x } @,a)= { x E R : a < x } (-a, b] = { X E R: x Ib} (-a,b)={xER:x
For any z = ( x , y ) E C we write f for (x, -y ) and call it the complex conjugate of z. Also IzI is the non-negatiue square root of zf = x2 + y 2 . (See RUDIN loc. cit. for existence.) This number is called the modulus or the absolute value of z. x is called the real part or abscissa of z, y the imaginary part or ordinate of z and we write x = Re z , y = Im z. The number (0, 1) is called the imaginary unit and is universally denoted (following Euler) by i. I have striven to avoid ever using i as an index of summation, but once or twice it was ineluctable; no confusion should arise there however. [The terms “real” and “imaginary” as well as “complex” and “rational” are relics from the days when these concepts had not yet been formalized, were imperfectly understood, especially their ontological status, and were generally rather mysterious. They have been quietly de-mythologized over the years so there is now neither any need nor any zeal to eradicate these so characteristically unmathematical terms from the official lexicon. Of course, no scintilla of their common parlance meaning still attaches to them.]
2/z,
Q4
Metric Spaces
Recall that a merric space is a (non-empty) set X together with a distancefunction or metric d : X x X + [0, co) which satisfies for all x l , x2, x , E X (1)
4 x 1 , x2)
=
4x2, X l )
(symmetry)
(2)
d ( x l ,x,)
=
0 c3- x1 = x2
(reflexivity)
(3)
d(x,, x,) Id(x,, x 2 )
+ d(x2,x,)
(triangle inequality).
Formally, a metric space is a pair (X, d) as above but one speaks loosely of “the metric space X.” If xo E X and r E [0, co), the set {x E X : d(x, x,) < r } is
Prerequisites and Preliminaries
16
called the (open) ball of radius r and center xo. It is denoted by B(x,, r ) . A set in a metric space is bounded if it lies wholly in some ball, open if it is a union of open balls and closed if its complement is open. The closure (or adherence) of a set S is the intersection of all the closed supersets. It is evidently closed. We denote it by 3. The union of all the open subsets of S is called the interior of S and is denoted 9; it is obviously an open set but may -well be empty (see the convention at the end of 5 1). Notice that = X\(X\S). A neighborhood of a point x E X is any set which contains some B(x, r ) , r > 0. Generally N (neighborhood), Y (voisinage) or U (Umgebung) are used to designate such sets. Most often they are open but this is not part of the definition here (though it is in some books). The function d(z, w) = ( z - wl, z, w E C satisfies properties (I)-(3) above and is the standard (euclidean) metric in C. Here balls are called disks (to be more suggestive) and we use D(zo,r ) instead of B(zo, r ) , calling this set the (open) disk of radius r and center z,. Notice that B(z,, r ) = { z E C : ( z - zo( I r } (called the closed disk of radius r and center 2,). In a general metric space however B(x,, r ) lies in, but need not coincide with, { x E X : d(x, x,) s r } . (E.g., X = N, r a positive integer.) The set C(z,, r ) = {z E C: ( z - zo( = r } is called the circle of center z,, radius r. For C(0, 1) the notation U (for torus) is also occasionally used. The set { z E C : r < ( z - < R} is called the annulus of center c, inner radius r and outer radius R . It is defined for every c E C and 0 I r < R . The notation A ( c ; r, R ) is used for this set, or simply A(r, R) if c = 0.
CI
For each positive integer n we let Cn = C x . - x C, the Cartesian product of n copies of C. This is a vector space over C (coordinate-wise operations). A conjugate bilinear form is defined in C" by
This is called the scalar or inner or dot product in C" and together with its obvious linearity properties it satisfies the so-called Cauchy-Schwarz Inequality n
n
(4)
~(zl,. . ., Zn).(wl,. . .* wn)12 5
2
f=l
Izj12
2
k=l
This product defines a norm or length function by means of llzll =
/I
G.
In this language (4) reads simply (5)
IZ-WI
I llzl( llwll vz, W E C " .
[There is another potential notational conflict here when it = I : z - z means z f according to the above, yet dot sometimes denotes ordinary field multiplication
8 4. Metric Spaces
17
in C. The problem really never arises because the inner product is used so seldom in this book.] The usual euclidean metric in C" is that defined by the above norm: d(z, W ) =
I ~ Z - wII
V Z , w E C".
It is, of course, via (5) that we verify property (3) [(I) and (2) being obviously true for this d ] . A sequence in a metric space X is (formally) a function x from N or Z into X, with x(n) usually written as x,. [Functions from Z to X are called bilateral sequences.] We denote the sequence x variously by {x,};~ {x,}:= (as the case may be) or simply {x,}. A sequence {x,} is Cauchy or fundamental if for each e > 0 there exists an N ( E )E N such that d(x,, x,) < e whenever n, m 2 N(E). The sequence {x,} converges to x E X if for each e > 0 there exists an N(E)such that d(x,, x) < E for all n 2 N(E).We write x, = x and sometimes x, +- x as n -+ a,or simply x, --f x. The sequence {x,} is called convergent if such an x exists, divergent otherwise. (Notice that a convergent sequence is necessarily Cauchy and a Cauchy sequence is necessarily bounded.) A metric space (X, d ) is called complete if every Cauchy sequence in it is convergent. +
If k: N -+ N (or Z + +- Z') is any unbounded, order preserving (see 0 5) function and x is a sequence, then the composite x k is called a subsequence of x. With the above conventions we write k, for k(n) and xk, for x(k,) = x(k(n)). 0
An isolated point of a set S in a metric space X is a point x E X such that B(x, r ) n S = {x} for some r > 0. A cluster point of S is a point x such that every ball centered at x meets S. Synonyms for cluster point are limit point and
accumulation point. (Sometimes, though not in this work, it is necessary to distinguish those cluster points of S which are not isolated points of S. One of the above synonyms is then charged with this assignment.) The cluster points of S are just the limits of sequences in S; the set of all of them coincides with S. The -boundary or frontier of S, denoted as or bdry(S), is the set S\8= S n (X\S). It consists of those X E X every neighborhood of which meets both S a n d X\S. A metric space X is compact if whenever a class 0 of open subsets of X satisfies X c U 6 (we say P couers X), then X c U 8 for some finite 3 c 0 (we say X admits ajiriite subcouer from P). This is equivalent to the condition that every sequence in X possess a convergent subsequence. (See RUDIN[ 19761, pp. 36-40.) If we take complements of open sets, the definition of compactness is that the space have thefinitc intersection property: Whenever % is a set of closed subsets 3 # 17 for each finite 3 = V, then V? # I?. of X such that
n
n
If ( X , d) is a metric space and Y c X, then (Y, dl Y x Y) is a metric space. Notice that for yo E Y the ball of center yo and radius r in Y is the intersection with Y of the corresponding ball in X. S c Y is called relatively open (or closed)
18
Prerequisites and Preliminaries
if it is open (or closed) in the metric space (Y, dl Y x Y ) . This is equivalent to S = T n Y where T is open (or closed) in (X,d ) . Y is called a subspace of X. It follows that the metric space (Y, dl Y x Y ) is compact if and only if every cover of Y by open subsets of Xadmits a finite subcover and from this it follows that Y must be closed if it is compact. A subset Y of Xis called pre-compact or conditionally compact or relatively compact if Y is compact. The two most important features of C" are that it is a complete metric space and a subset of it is compact if and only if closed and bounded (Heine-Bore1 theorem).
Though the terminology is paradoxical, there is nothing logically wrong with a subset Y of a metric space being both closed and open. (Every subset of the metric space H has this property, for example.) For such a set the neologism clopen is employed, though many linguistic purists prefer the less colorful term closed-and-open (or open-and-closed).
A metric space ( X , d ) is called connected if the only clopen subsets of X are 0 and X . A disconnection of a metric space Xis a pair of disjoint sets XI, X, which cover X and are each non-empty and open (equivalently, by looking at complements, each closed). Then, evidently, X is connected if and only if it possesses no disconnection.This important concept is explored in some depth in Chapter I and together with compactness is of fundamental importance for all that follows. The most importantfact about metric spaces which we will use in this book is the Baire Category Theorem: a complete metric space cannot be a countable union of closed subsets which each have empty interior. The profundity of this theorem lies not in the proof (which is exceedingly simple: see, e.g., RUDIN [1976], p. 82) but in the viewpoint that it engenders. It is a powerful tool for proving existence theorems, plenty of examples of which will occur in the sequel (see esp. Chapters XV and XVI). The name derives from the fact that a countable union of closed subsets of a metric space X, each having empty interior, is called a set of thefirst (Baire) category (in X ) . The complement of such a set is called residual, while a set whose closure has empty interior is called nowhere dense and a set whose closure is all of X is called dense. These notions are all relative to X . In this jargon the theorem says that a complete metric space is not of the first category in itself. As a corollary to the theorem itself or as a scholium to the canonical proof, we have the version which we shall use most often: In a complete metric space a countable intersection of open, dense subsets is a dense subset.
Limsup and All That In the Dedekind construction of R (i.e., that i n LANDAU[1951]) the order relation is absolutely primal and one of the first things proved about Iw so constructed is its order-completeness:for every non-empty subset of R which is bounded above (i.e., lies in (-co,b] for some b E R) there is a Imst uppm hound (i.e., there is a least such b). When R is not manufactured but only axiomatically
95
19
$ 5 . Limsup and All That
summoned, this property must be postulated: R is a (the unique, in some sense) field with an order relation that behaves in the expected way with respect to addition and multiplication and is complete in the above sense (so-called Least Upper Bound Axiom). In any case, it is from this fundamental property that the metric completeness of R and the compactness of closed-and-bounded sets (as well as the connectedness of intervals, to be proved in Chapter I) is derived. [The extension of these properties to @, thence to Cn,is then routine.] The order relation in R can be rendered unconditionally complete by adjoining a least element --a) and a greatest element +co (often written just m). These are - two (distinct) points not in the set R. The order relation in R is extended to R = R u {+a} by the decree -m < x < +m
for all X E R. The algebraic structure of R is not extended (or sometimes only partially extended) to R. In R the above axiom reads: every subset of has a least upper bound. The abbreviation I.u.b.(S) for the least upper bound of a set S is common. The usual convention about vacuous hypotheses leads to 1.u.b. 0 = -m. Another synonym for least upper bound is supremum and the supremum of S is noted sup(S). Greatest lower bound, g.l.b.(S), infimum and inf(S) are defined in the obvious way. A few self-explanatory notational variants prove quite convenient. E.g., sup,,,{x,} for sup{x,: a E I}or SUPnrk{xn} for sup{x,: n 2 k}. For a subset S of a metric space (A', d) the element sup{d(x, y): x, y E S} of [0, +a]is called the diameter of S, sometimes noted diam(S). For any point x E X the distance from x to S is denoted d(x, S) and is defined as inf{d(x, y ) : y E S } .
w
(See 1.32.)
-
For a sequence {x,,}:=~ c R we define limn-, x, = lirn sup,,, x, (called the limit superior or upper limit of the sequence {x,}) as infn.,[sup,.,{xk}]. Analogously limndmx, = lirn inf,,, x, (called the limit inferior or lower limit) is defined a~sup,,,[infk,,{xk}]. If all x, E R, we have (*)
lim x, n- m
-
I x I lirn
x,
n-m
for every subsequential limit x of the sequence {x,} and the sequence {x,} itself converges to a number x E Iw ifand only ifequality holds in (*). With the obvious (based on order rather than distance) notions of sequential convergence in R, it follows easily from the definition that limn.+ - ,x, is the smallest subsequential x, is the largest. limit of {x,} in R and lz,,.+m For a sequence {x,} c C N we write IIx,II -+ co if the sequence {IIxnII}converges to +co in R. If S c k!, f : S + @ is called non-decreasing or order-preserving [increasing] if f ( x ) ~ f ( y ) [ f ( x
Prerequisites and Preliminaries
20
creasing is used for increasing. Non-increasing, decreasing, etc. have then the obvious meanings. The term monotonic is generic for all these properties.
06
Continuous Functions If (XI, dl), (X2,d2) are metric spaces, S c XI,$S X2, a E S, and b E X 2 , we say that f(x) converges to b as x converges to a or that the limit off at a is b, written limx+4f(x) = b, if for every e > 0 there exists a S = a, e) > 0 such that d2(f(x), 6 ) < e whenever x E S and dl(x, a) < 8. We say that f is continuous at a if limx+4f(x) = f(a). Notice that limx+4f(x) = b is equivalent to the implication {x,} c S & lirn x, = a * lirn f(x,) = 6.
Su,
n+
n-. m
m
For a subset T of S, we say f is continuous on Tiff is continuous at each point of T. That f be continuous on S is equivalent to the requirement that f -'(V) n S be a relatively open subset of S whenever U is an open subset of X2. Iffis continuous on S and for each e > 0 the S(S, a, e) can be chosen the same (say, S(A 8)) for each a E S, then f is called uniformly continuous on S. A family 5 of continuous functions on S is called uniformly equicontinuous on S if in addition, for each e > 0 and all f E 5 a common value S(e) can be selected for the S(f, 6). If (X,d) is a metric space, S c X,$ S -+ and a E S, we define l%?ix-.4 f(x) = lim up^-.^ f(x) as inf,,,[sup f(B(a, r ) n S)] with a similar definition for limx-4 f(x) = lim inf,+,f(x). elements limn+ f ( x , ) E
-
Evidently
Gx+4 f(x) is the maximum of the
w over all possible sequences {x,} c S which converge -
to a. When Xis 88, limx-.m,limx.+- m , etc. have the obvious meanings.
Well-known elementary facts about continuous functions which we shall use: the composite of two continuous functions is continuous. The functions x -+ IIxII, x --f Ax ( A E C) are continuous from C" to [w and @", respectively; the functions ( x , y ) -+ x . y and ( x , y ) -+ x y are continuous from @" x C" to C and C",respectively. The function (x, y) -+ xy is continuous from @ x C to C and z - + l/z = 2-l is continuous from C\{O} into C\{O}. With the composition law the continuity of all the elementary real- and complex-valued functions is thus assured. The inverse of a continuous, one-to-one function need not be continuous (those functions for which the inverse is continuous are said to be biconfinuous and are called homeomorphisms), but when the domain and range are each open subsets of R, or of C, continuity of the inverse follows. (These non-trivial facts are proved in Chapter IV.)
+
The restriction of a continuous function to a subspace is continuous. However, if Y is a subspace of X andfis defined on X,thenfl, may be continuous at a point y of Y without f being continuous at y. On the other hand, if A and B are two closed subsets of X andf(A,flB are each continuous functions, then
9 7. Calculus
21
f l A u B is a continuous function. This elementary fact is used repeatedly in the sequel to build up a continuous function from continuous pieces. On the line R there are the notions of left- and right-hand continuity. We use the a), i.e., from the notation x f a or x --f a - to indicate x approaching a in (-a, left. Similarly for x J. a or x --f a + .Generally to indicate x approaching a from inside some set S (in any metric space) we write limx-,a,xea. The continuous image of a compact space is compact and the continuous image of a connected space is connected. (For a proof of the latter, see Chapter I.) When X = [a, b] andf(X) c R, this latter result amounts to the Intermediate Value Theorem for continuous functions: if c is a number betweenf(a) andf(b), then c = f ( x ) for some x between a and 6. A function which is continuous on a metric space is uniformly continuous on any compact subset.
If (X, d) is a metric space, we denote by C ( X )the set of all bounded continuous complex-valued functions on X, by C,(X) the real-valued functions in C ( X ) . C ( X ) is an algebra over C and C,(X) is an algebra over R, both with “pointwise” operations, e.g., f g is the function ( f g ) ( x ) = f ( x ) g ( x ) (Vx E X ) . The sets C ( X ) , C,(X) are usually made into metric spaces by introducing the supremum or uniform norm
~ J ~ =I IIIJII~(~, ’d ~UPI~(X)I m
and the accompanying uniform metric dm(L g )
=
Ilf - g II
ma
It is a fundamental and elementary fact that C ( X ) is then complete and C,(X) is a closed subset (hence also complete) of C ( X ) . $7
Calculus The elements of differential and integral calculus of real- and complex-valued functions on Iw as presented in chapters 5 and 6 of RUDIN[I9761 will be taken for granted. However, only (piecewise) continuous functions are ever integrated and neither Lebesgue nor Riemann-Stieltjes integrals are employed. We often cite the Mean Value Theorem for differentiable real-valued functions on a subinterval of R, and the corollary thereof which says that a function with a positive derivative is increasing, as well as the Chain Rule for differentiating composites. (See 2.3 for the canonical proof of the latter.) Integration-by-parts, the integral analog of the Chain Rule, is used, as are the Cauchy-Sckwarz inequality for integrals and the most elementary facts about the relation of uniform convergence to integration. Partial differentiation with respect to the kth coordinate variable is denoted by Dk and the ir notation is never used for differentiation. Ordinary differentiation on the line is usually denoted by ‘, rarely is d/d.u used.
22
Chapter I Curves, Connectedness and Convexity We want to develop here as expeditiously as possible some routine facts about the topology of the plane centering on connectedness; these are essential in all that follows. A deeper exploration of the topology of the plane occurs in Chapter IV, after the exponential function has been developed (in Chapter 111) and the useful concept of the index of a curve is available.
91
Elementary Results on Connectedness
Theorem 1.1 If3 is a collection of connected subsets of 6: and then U 3 is connected.
Proof: Let x
E
n 3 is not void,
n 3. It suffices to show that the only relatively clopen subset
is U 3. Let S be such a set. Then for each F E5, S n F is a relatively clopen subset of F and contains at least x , consequently is non-void and so must be all of the connected set F. It follows that S =I F,and this for each F E 3. Therefore S =I U 3. of
U 5 which contains x
Theorem 1.2 I f S is a connected subset of @, then any set T satisfying S c T c
s
is also connected.
Proof: If V is any non-void relatively clopen subset of T, then V n S is a relatively clopen subset of S. Moreover V n S # 0 , for the closure of S in T is n T = T; that is, S is dense in T, and V is open in T. It follows from the connectedness of S that V n S = S. But then the relatively closed subset V of T contains also the closure in T of S, viz., T itself.
s
Exercise 1.3 Prove the following useful extension of 1.1. connected and n B # 0 , then A U B is connected.
If A , B c 62 are each
Hints: Let P E R n B. By 1.2 the set A u { p } is connected and by 1.1 the union A u { p } u B = A u B is also, since p E B. Theorem 1.4 If X , Y are subsets of @ and f: X + Y is continuous, then f (X ) is connected i f X is. Proof: If V is a proper, non-void, relatively clopen subset of f ( X ) , then by continuity offthe setf-'( V) is a proper, non-void, clopen subset of X . Exercise 1.5 Show that if XI =I X , 3 . . are closed, connected subsets o j @ at X , is connected. least one of which is compact, then X =
4 2. Connectedness of Intervals, Curves and Convex Sets
23
Hints: If not, there exist disjoint open U, V which each meet X such that X c U u V. Then X,, c U u V for some n.
- -
Exercise 1.6 Show that if XI 2 X2 3 . are closed, connected subsets of C and X = X,, is compact and non-void, then some X, is compact and X is con[1935].) nected. (Cf.W. M. WHYBURN
n:= ,
v
Hint: Take open V with X c V c 7 compact. Then V x X = X n = (X,, n V ) . These sets being compact, it follows X,, n c V for some n. Then X,, n V is clopen in X,,, hence not a proper subset.
n:=,
v
Exercise 1.7 If F,, F2: R --t C\{O} are continuous, R is connected and Ff E F i , prove that either Fl = Fa or F, = -Fa. What happens if the F, are allowed to take the value zero ? Hint: Q is the disjoint union of the two relatively closed subsets (F, and (Fl - Fa)-l(0).
02
+ F2)-l(O)
Connectedness of Intervals, Curves and Convex Sets
Theorem 1.8 l f a , b E R, then [a,b] is connected. Proof: We are to show that there is no proper, non-void, relatively clopen subset A of [a, b]. With such an A the set B = [a, b]\A is another such and one of A and B contains a. Let, say, a E A. Since A is relatively open in [a, b], there is some a < x Ib such that [a, x] c A. Let c denote the supremum of such x . Then by definition of c we have [a, x] c A for every x < c, and so since A is closed, [a, c] c A. If c < b, then since c E A and A is relatively open in [a, b], there exists c < d < b such that [c, d ] c A ; and then [a, d ] = [a, c] u [c, d ] c A , contrary to the maximality of c. It follows that c = b, so [a, b ] = [a, c] c A , contrary to the propriety of A. Corollary 1.9 Any (non-void) interval in R is connected. Proof: If I is an interval and x E I is arbitrary, then I
=
u
[a, b1
a. b E I aSxSb
An appeal to the last result and 1 . I finishes the proof. Exercise 1.10 Establish the converse of the last corollary, namely that every connected subset of R is an interval. Definition 1.11 (i) A curve is a continuous function y from a compact interval [a, h] in R into @. y(a) is called the initial point and r(b) the terminal point of y and y is called closed if y(a) = y(b). When there is no possi-
24
(ii)
(iii)
Curves, Connectedness and Convexity
bility of confusion, we sometimes permit the linguistic abuse of writing simply y for the set y[a, b]. This set is called the range of y. A closed curve is also called a loop. A one-to-one curve is called an arc. A loop y : [a, b]--f C is called simple if y is one-to-one on [a, b). A curve y : [a, b] -+ C is conTTtinuously diflerentiable or smooth if it is differentiable in (a,b), has left- and right-hand derivatives at b and a respectively and the derivative function y’ is continuous on [a, b]. A curve y : [a, b] -+ C is piecewise continuously differentiable or piecewise smooth if there exist a = to c t , < .. < t, = b such that y is continuously differentiable on each [t,- t,]. For a closed curve y : [a, b] -+ C define 0.y: [a, b] --f C to be the constant curve y(a), (- l)*y:[a, b] -+ C by (- l)mr(t)= y(b a - t ) , n*y: [a, b] + C for each positive integer n by
,,
(iv)
-
+
nmy(t) = y(a
+ n(t.-
t , - , ) ) for t E [ t , - , , t,] and t, = a
+ (b - a)j/n,
j = 1,2,
(v)
..., n
and for every negative integer k define kmy to be (- k)*(- 1 ) ~ . A Jordan-curve is a homeomorph in C of a non-degenerate circle.
Definition 1.12 (i) If a,, . . ., a, E C, then [a,, a,, . . ., a,] is used to denote both the piecewise smooth curve y : [0, n] --f C defined by y(t) =
(ii)
Uk-1
+ ( 2 - k + 1)(ak - ak-,), k - 1 I
t S
k, 1
I
k In
and the range of this curve. Any such curve is called a polygon, more precisely, an n-gon. When n = 1 the term interval is also used. Furthermore we let (a,,. . ., a,], [a,, . . ., a,) and (a,,. . ., a,) denote the restriction of the above y to (0,n], [0, n ) and (0, n ) respectively, as well as the ranges of these restriction functions. If a, b, c, d~ R, a c b, c < d and S = (a, b) x (c, d ) , then
as = a.9
=
[a + ci, b
+ ci, b + di, a + di, a + c i ] .
(Note that here the convention in 1.1 I(i) is consistent with the usual definition of topological boundary. See Q 4, Chapter 0.)
Definition 1.13 A non-void subset S of C is polygonally connected if each pair of points of S lie on some polygon wholly contained in S. (Compare 1.21.) When this happens a one-to-one polygon can always be selected, a technical fact which will be quite useful in Chapter IV. This follows from
Exercise 1.14 Let S be a connectedset which is afinite union of (closed) intervals. Then any two points of S lie on a polygonal arc in S. Hints: Go by induction on the (minimal) number of intervals in S. The result is clearly.true if S is comprised of a single interval. If the result is true whenever
8 2. Connectedness of Intervals, Curves and Convex Sets
25
S is comprised of fewer than n intervals, consider a connected set S' which is the union of n intervals Z,, . . ., I,,. Consider any two points a', b' E S', say a' E I,,. We want to find a polygonal arc in S' joining a' to b'. There is nothing to prove if b' E I,,, so we suppose b' #I,,. Let S denote the union of all the connected subsets of ZlU. - UZ,,-l which contain b'. By 1.I, S is connected and if I, meets S for somej I n - 1, then by 1.1 and 1.8, S u I, is connected. It follows that S is a union of some of the intervals Zl,. . ., and is disjoint from each of the others. Let S" denote the union of the latter. If Z,,were disjoint from S, then S and I,, u S" would constitute a disconnection of S'. We infer that I,, meets S. Letting I,, = [a,,, b,], it follows that one of [a', a,,] and [a',b,,] meets S. We take a to be the first point of this interval which lies in S. By the induction hypothesis there is a polygonal a r c p in S joining 6' to a. Then p u [a, a'] is a polygonal arc in S' joining 6' to a'.
-
Definition 1.15 (i) If S c C, an arc with one endpoint on as and all other points in S is called an end-cut in S. An arc with both endpoints on as but all other points in S or a Jordan-curve with one point on as but all other points in S is called a cross-cut in S. (ii) A point z E as is accessible from S if it is an endpoint of an end-cut in S. Exercise 1.16 For any open subset U of C the accessible points are dense in aU. Hints: Let zo E aU and E > 0. Since zo is a boundary point, there exists w E U n D(zo, 42). There obviously exists (elementary compactness argument) at least one point z1E aU which is at a minimum distance 6 from w : Izl - wI = inf{lz - wI : Z E ~ U=}6 > 0. Then Izl - wI IIzo - wI < 4 2 , whence Izl - zoI I Iz, - wl + Iw - zoI < E. By minimality of 6, [w, zl)does not meet aU, Since it is connected and meets U , it must lie wholly in U. Therefore [w, z , ] is an endcut, and z1 is an accessible point of aU lying in D(zo, .?). Definition 1.17 (i) A subset S of C is starlike with respect to the point z if [z, w] c S for every w E S. We say simply that S is starlike if it is starlike with respect to some point. A subset S of C is conoex if it is starlike with respect to each of its points, (ii) that is, if [z, w ] c S for every z, w E S. (iii) If S is a subset of C, the conuex hull of S , noted co S, is the intersection of all convex subsets of C which contain S. Exercise 1.18 A convex combination of elements of a subset S of C is any sum Ajxj where x, E S , 0 IA, 2 I and Aj = I . (i) Show that S is conivx if and only if it contains all convex combinations of its elements.
z;=,
zyZl
Hint: Use induction on n. (ii) Show that co S is conivx and consists of all contiex combinations of elements of S.
Curves, Connectedness and Convexity
26
Theorem 1.19 (i) r f S is a bounded subset of@, then co S is bounded and has rhe same diameter as S. (ii) r f K is a compact subset of C, then co K is compact. Proof:
(ii)
(i) Let d be the diameter of S. It evidently suffices to show that Ix - yl I d for x , y E co S. For each w E S we have Iw - zI I d for all z E S, that is, S lies in the convex set b(w,d). Therefore co S c D(w, d), that is, (w - y ( Id for every y E co S and every w E S. This says that S lies in the convex set S(y, d ) , whence co S c 4(y, d ) , for every y E co S ; that is, Ix - yl I d for every x E co S. Suppose n > 3, zl,. . .,z, E K, tl, .. .,t , are positive and tl +. 1, = 1. The n - 1 vectors zI - z, (1 I j I n - 1) in Ra are linearly dependent over W (since n - I > 2), so there exist a l , . . ., a,-1 E 08 not all 0 such that
-+
aj(zf- z,) = 0.
Set an = -27:; a, and choose k so that laIl/tfI lakl/tk, 1 5 j I n. This inequality shows that a, # 0 (since not all a, are 0). Furthermore, replacing all the a, by their negatives if necessary, we can suppose that a, > 0. Set then cj = t,
- tkaj/ak,
1Ij I n
and note that
An obvious inductive argument then shows that
tlzl + * * - + tnZn E {UX
+ by + CZ:a , 6,c E [0, I],
X,J,z E K , u
+ h + c = I}.
The latter set, call it C, is a continuous image of the compact set 6 + c = I } and so is compact, while the sum on the left is the generic point of co K by I . I8(ii). Since evidently C co K, we have finally co K = C.
{(a, b, c, x , y, z)E [0,113 x K 3 : a
+
Theorem 1.20 Every curve is connected. Proof:
1.4 and 1.8.
Corollary 1.21 Every polygonally connected set is connected. Proof: If S is polygonally connected, fix x E S and for every z E S let p2 be a polygon in S which contains x and z. p; is connected by the last theorem and evidently S = Upcspr, so by I . I , S is connected.
2. Connectedness of Intervals, Curves and Convex Sets
21
Corollary 1.22 Every starlike set and (hence) every convex set is polygonally connected and (hence) connected. Corollary 1.23 Center-punctured disks, annuli and circles in @ are connected.
Proof: We treat the case of open disks and annuli centered at the origin. The reader can easily extend this to all other cases. Let D = D(0, 1). Then D\{O}
=
W\(-1,011 u (D\[O, 1)).
The two sets on the right are starlike (with respect to any point in (0, 1) or (- 1,O) respectively) and so connected. Also they have points in common (for example, 4i). Therefore their union is connected. Now if 0 5 a < b < oc), then $ ( t ) = tb + (1 - r)a maps (0, 1) continuously onto (a, b), so z -+ $(IzI).z/IzI maps D\{O} continuously onto the annulus A(a, b). Now cite 1.4. Take a = b in (an argument similar to) the above to see that the circle { z E C: IzI = a} is connected.
Theorem 1.24 I f Q is an open connected subset of Q: and A is a subset of R which has no limit point in Q, then Q\A is open and connected. Proof: Since A has no limit point in Q, each point of R\A is the center of a disk which does not meet A. Therefore Q\A is open. Suppose U1,U2are disjoint, non-void, (relatively) open subsets of Q\A such that Q\A = U , U U,. For each a E A there is an r, > 0 such that D, = D(a, r,) c Q and D, n A = {a}. Each subset D,\{a} of R\A is connected (by I .23) and so lies entirely in one of the U j . Let A j = {a E A : D,\{a} c U j }( j = I , 2). Then V, = U, U U { D,: a E A,} ( j = 1, 2) are disjoint, non-void, open subsets of 0, that is, a disconnection of Q. Exercise 1.25 (i) I f C is a proper subset of a circle, then @\C is connected.
Hints: Let the circle be C(0, I), set D = D(0, 1) and select p E C(0, l)\C. Note that (I)
D = b\Cc
(2)
C\b
c
Li,
(@\b) u { p } c C\D
-
= @\D.
'Now D is connected (1.22) and so is C\D, being the image of the connected set D\{O) under the continuous map z -+ l/z. Thus ( I ) , (2) and I .2 yield (3)
b\C
and ( C \ b ) u { p } are each connected.
But then, since p lies in both sets, their union C\C is connected, by 1.1. (ii)
i2 is an open, connected subset of C and D is an open disk such that SZ, then Q\B is connected.
bc
28
Curves, Connectedness and Convexity
Hints: Let D1 be an open disk concentric with D such that Suppose U and V are a disconnection of Q\b:U and V are non-empty, open V. The subset Dl\b of Q\bis connected (1.23) subsets of Q\band U = (Q\b)\ and so lies wholly in one of U or V, say D l \ b c U. Then
U U a = U u D1, an open subset of Q. We have
v = (Q\D)\U
=
Q\(Uu
b),
so V and U u b are disjoint, non-empty, open subsets of R which cover contradiction.
a,
Open connected subsets of C occur so frequently in all that follows that it will be extremely convenient to have a generic name for this species of set. The traditional one is
Definition 1.26 A region is an open, connected, non-empty subset of C.
53
The Basic Connectedness Lemma
We codify here a useful and simple device for exploiting connectedness. It is useful because we often encounter in function theory situations where it is easy to show that a certain subset A of a set E contains a fixed percentage of each disk which is centered in A and lies in E.
Theorem 1.27 (Basic Connectedness Lemma) Let U be an open subset of@ and o # A c U have the property that for some O > 0 there holds: aEA
and b ( a , r ) c U
-
D(a, Or) c A .
Then A is relatively clopen in U . In particular, if in addirion U is connected, then A = U.
Proof: Evidently A is open in U, since U is open. To see that U\A is also open in U, let b E U\A and pick R > 0 so that B(b, R) c U . It follows that if D(b, OR/(]+ O)) meets A, say in a, then we have (*)
la
- bl
OR
<1 + e*
We have for r = R - la
- bl
B(a, r ) c B(b, R ) c U .
8 4. Components and Compact Exhaustions
29
But then D(a, Or) c A and from (*) we get
la - bl < OR
- ela - bl
= Or,
putting b E D(a, Or) c A , contradiction. Corollary 1.28 Every region is polygonally connected. Proof: Let R be a region. It suffices to show that for each fixed a E R the set A of z in R for which there is a polygon in R with initial point a and terminal point z is all of R. This set is non-void (a E A ) and if z E A and r > 0 is such that B(z, r ) = R, then D(z, r ) c A , because if [a, . . ., z ] is a polygon in R and w E D(z, r ) , then [ a , . . ., z, w] is also a polygon in SZ. Thus A meets the hypothesis of the Basic Connectedness Lemma with 8 = I.
Exercise 1.29 Any two distinct accessible points on the boundary of a region R lie on a cross-cut in SZ. Hints: Let a , b be distinct accessible boundary points of R. Let A , B be endcuts in R with a the initial point of A , b the terminal point of B. By ignoring an appropriate initial segment of B, we can suppose A and B disjoint. By 1.28 and 1.14 there is an arc P: [0, I] -+ R with initial point on A and terminal point on B. Let t , be the largest t E [0, 11 such that P ( t ) E A . We have t, < 1 since A n B = 0 and P(1) E B. Let tb be the smallest t E [t,, 11 such that P ( t ) E B. Then A , /‘(fa, tb), B are mutually disjoint and, since each of the functions involved here is one-to-one, this implies that their union is an arc. It is evidently the desired cross-cut from a to b.
94
Components and Compact Exhaustions
Recall that a component of a set is a maximal connected subset. Theorem 1.30 Let X be a non-empty subset of @. Then Each component of X is relatively closed. (i) (ii) Distinct components are disjoint. (iii) Each connected subset of X lies in a unique component. (iv) X is the (disjoint) union of its components. If X is open, then: (i)’
Each component of X is open and there are at most countably many of tltem.
Proof: (i) follows from the fact that a component is a maximal connected set while its relative closure is still connected (by 1.2). (ii) If C, and C, are components with a point in common, then C , u C , is connected by I . 1 and so by the maximality of C, and C, we see that
c, = c, u c, = c,.
Curves, Connectedness and Convexity
If C is a connected subset of X,then the union of all the connected subsets of X which contain C is connected by 1 . 1 and evidently is maximal among connected subsets of X,i.e., is a component. Since single points are connected sets, (iv) follows from (iii). If C is a component and x E C and D is an open disk centered at .r and contained in X, then D is connected (being convex) and so C U D is connected by 1.1 and consequently by maximality C U D c C, that is, D c C.Thus C contains a neighborhood of each of its points and so is open. Being open, C contains a point with rational coordinates. As there are only countably many such points and components are disjoint, there can be only countably many components. Theorem 1.31 Let U be an open subset of C. Then there exist compact sets K , such that (1) (2)
Kn c & + I *
0
K, = U.
n-1
(3)
Every bounded component of C\Kncontains a component of C\U. In particular, ifC\U has no bounded components, then each set C\Kn is connected.
Proof: For each positive integer n form (4)
C, = {z E C: d(z, 02\17 2> l / n } c
U,
where d(z, C\U) = inf{lz - wI : w E C\U}. Notice that (5)
C\C, = {z E C: d(z, C\U) < l/n} =
u
D(a, l / n )
osc\u
is obviously open, so C, is closed. Form
K, = C,, n b(0, n). (6) Then K, is compact and lies in U. Moreover it is obvious that (2) holds: given z E U,pick positive integer n 2 IzI so that D(z, l / n ) t U.Then z E K,. To prove (I), we set r, = l / n - l/(n + 1 ) and show that D(z, r,) every z E K,,. Indeed, given such a z and w E D(z, r,), we have IwI I IzI
+ r,, < n + r,,,
since Z E K,, c b ( 0 , n),
sn+l, so w E a(0, n + 1). But also for any a E C\U we have 1 I w - a l ~ I z - a l - I w - z l r - - I w - ~ I , sincezEC, n 1 > - - r, = - since w E ~ ( zr,). , n n + 1'
t
K,,, for
0 4. Components and Compact Exhaustions
It follows that w E C,,+ and so finally w E B(0, n
31
+ 1) n C,,
+
=
K,, + 1.
It remains to look after (3). Notice that
C\Kn= [C\D(O, n>l u [C\C,,l by (6) (7)
The set C\B(O, n) is the image of the center-punctured disk D(0, I/n)\(O} under the continuous function z +- l/z and so is connected. Therefore all the sets in the union (7) are connected. Now let C be a bounded component of C\K,,. Since C is the union of all the connected subsets of C\K, which meet it, we see from (7) that on the one hand C does not meet C\b(O, n) and on the other hand
u
u
D(a, l / n ) n c =
D(a, l/n).
aeCn(C\ U )
R€C\U
In particular, C n (C\U) # 0 . Being non-void, this set meets some component K of C\U. But then K is a connected subset of @\U c @\K, (by (2)) which meets C and hence lies in C.
Exercise 1.32 Let S be a non-empty subset of R", g : S --t [0,co) a bounded, continuousfunction. For each x E R" define d(x) = d,(x)
=
inf{llx - yllg(y):y
E SI,
where 1 1 is the euclidean norm in R". Show that d is a continuousfunction on R". (i)
Hints: Let M be a bound for g. Then for any xl, x2 E R", y E S d ( x l ) I 11x1 - yllg(y) 5 [Ikl - x2II + 11x2 - yllIg(y) 5 Mlbl - x2II + 11x2 - rllg(y), that is, d(x,) - Mllx, - x211 is a lower bound for the set {Ilx, - yllg(y):y E S}. Consequently
4x1) -
11x1
- x2II
5 d(x2).
Reversing the roles o f x1 and x2, we are therefore led to Id(x1) - 4x211 5 M l b l - x2II. (ii)
For the function g
= 1
we have dil({O})= 3.
Theorem 1.33 Let X be a compact subset of C and C a component of X . Then C is the intersection of all the relatively clopen subsets of X which contain it. Proof: If %' is the class of all relatively clopen subsets of X which contain C, then $? is not void ( X E %?)and the closed set K = V contains C. Because C is a maximal connected set, it suffices to show that K is connected in order to conclude that K = C. This we do by reductio ad absurdum. I f K is not connected, there exist disjoint non-void closed sets K,, K2 such that K = Kl u K2. Now there are disjoint open V, 3 K,. In fact, if d,(z) denotes the distance from z to
n
32
Curves, Connectedness and Convexity
the closed set K,, i.e., d,(z) = inf{lz - wI : w E K,}, then by 1.32 d, is continuous and so the function f = dl d2 is continuous on C. Evidently Klc f-l(-co, 0) and K, c f -l(O, co). Now V is compact and lies in K = Klu K, c V1 u V2 and so some finite intersection of elements of W,i.e., another element of V, lies in Vl U V2. Say, C, EW, C, c V , u V,. Then
n
C, n 7, = [C,n (v,u v,)]n Vl = (C, n V, n Vl)u (C, n v2n T,) = C, n V, since V2,being open, cannot meet Vl without meeting V,. Therefore Con V , is relatively clopen. Similarly for C, n V,. Now not both these sets, whose union C, contains K =) C, can meet C, because Cis connected. Let, say, C c C, n V,. Then Con V , E W and so C, n V1 3 K , by definition of K. Therefore V , 3 K, so V , n K = 0 , a contradiction, since V2 n K 3 K,.
Corollary 1.34 (SURA-BURA[1941]) Let X be a closed subset of @ and C a compact component of X . Then C is the intersection of all the compact, relatively open subsets of X which contain it. Proof: It suffices to produce for each open subset U of C with C c U a compact relatively open subset of X which contains C and lies in U. Cover C with finitely many open disks whose closures lie in U and let V be their union. Thus C c V n X c V compact c U. If V is the family of all compact, relatively open subsets of V n X which contain C, then C = V by the last theorem. By the finite intersection property of compacta, since V = C c V , an intersection of finitely many members of W,which is again a member K of V, must already fall into the open set V. Thus C c K c V n X c U . K is compact and K is relatively open in n X, whence in V n X , whence in A', since V is open in @.
n n
v
Theorem 1.35 The boundary of an open subset Q of C homeomorphic to an open disk is connected if il is bounded and otherwise has no bounded components. Proof: Let D = D(0, I ) and 4: D -+ Q be an onto homeomorphism. Set D, = D(0, 1 - l/n), A n = D\&, X,, = +(A,,). Thus each X , is closed and connected (by 1.4). If all X,, are unbounded, then X = (7= : X,, has no bounded component. For if Cis a bounded component of X, then C lies in a compact subset K of X which is relatively open in X , that is, X\K is closed. There exists then an open set Y such that K c V c Vcompact, disjoint from X\K.
,
We have
n(x,n 7 ) m
n=l
=
Xn
V = K n V = K C V,
8 5. Connectivity of a Set
33
since X\K is disjoint from fr. Therefore, since the sets X,, n fr are each compact, the finite intersection property of compacta implies that not all of them can meet the closed set C\V. So X,, n V c V for some n. Then the set
w=x,,nfr=X,,nV is relatively clopen in X,,, contains X n V 3 K and so is non-void. Since X,, is connected, it follows that X,,= W.But then X,, is compact, a contradiction. On the other hand, if some X,,, is compact, then X,, is connected by 1.5. In this case SZ c +(&J u X,,,, a union of compact sets, so SZ is bounded. Finally notice that 22
95
=
n X,, (exercisette).
Connectivity of a Set
The theorems of this section are technical results which will be needed later (in Chapter X). They require only material presented so far and it is a good idea to dispose of them now. This will mean one less distraction when the proofs of these later results, often lengthy enough in their own right, are carried out. The impatient reader may skip this material and return to it later as needed. Definition 1.36 A subset A of C is called simply-connectedif its complement @\A has no bounded component, doubly-connected if @\A has exactly one bounded component. In general we will say A has connectivity n E N U {co} if C\A has exactly n - 1 bounded components. [Roughly speaking, connectivity counts the holes in A.] Exercise 1.37 (i) Show that an open subset of @ is simply-connected fi either (a) its boundary has no bounded component or (b) it is bounded and has a connected boundary. Hint: Every component of the complement meets the boundary. Show that if the subset A of C is simply-connected, then A contains every (ii) bounded subset S of C whose boundary lies in A .
s
Hints: 3s = S\s c A implies S n (C\A) = n (@\A), so that this set is relatively clopen in @\A. It therefore contains every component which it meets. As it is bounded and C\A has no bounded components, n (C\A) is empty.
s
Theorem 1.38 Let U be an open subset of @ such that C\U has exactly one bounded component C. Then U U C is open and simply-connected. If in addition U is connected, then so is U u C. Proof: The components of C\(U U C) are just the unbounded components (if any) of C\U. Thus there are no bounded ones, so U u C is simply-connected.
34
Curves, Connectedness and Convexity
According to 1.34 there is a compact, relatively open subset V of C\U which contains C. Since V is compact and all the other components of C\U are unbounded, V contains none of them. On the other hand, the intersection of V with any of these components is a relatively clopen subset of the component. This intersection is therefore void. I.e., V = C,so C is relatively open in C\U. It follows easily that U u C is open. Now C n u # 0 ; in fact aC c u. For if x E aC\V and r > 0 is such that D(x, r ) n 0 = 0, then C u D(x, r ) is a connected (by 1.22 and 1.1) subset of C\U which properly contains the component C, a contradiction. From C n u # 0 and 1.3 it follows that U u Cis connected if U is.
Theorem 1.39 Let R be a region, C,, C2 two distinct bounded components of C\R. Then there is an unbounded, connected, closed subset of C\C, which contains Ca.
Proof: Since C,, Ca are disjoint and compact, there exists an open neighborhood V of Ca diijoint from C,. Now Ca meets fi, Pick any point c2 E C2n fi and take a convex neighborhood N2 of C a which is disjoint from C, and pick ba E Na n R. Consider then two cases: Case I : R is bounded. Then C\Q has (exactly) one unbounded component C,. Pick c3 E C, n fi and a convex neighborhood N , of c3 disjoint from C,. Pick b, E N3 n R and let (1.28) r be a curve in R from b2 to b3. Consider then Ca U [ca, bal U
r u [b3, ~
3U 1 C3.
This is an unbounded, connected, closed set which coaains Ca and is disjoint from C,. Case I f : R is unbounded. Then use 1.28 to construct a curve b2 to some w E R with IwI > suplC,(.
r in
Q joining
Then Cz U [cz, bal U
r u [I,
0 3 ) ~
is an unbounded, connected, closed set which contains C2and is disjoint from C,.
Theorem 1.40 Let R be a region such that 62\12 has (only)finitelymany bounded components C,, C,, . . ., C,,. Then there exists an open subset ill of 11 such that C1 is the unique bounded component of C\8,. Proof: Let W be the set of unbounded components of C\11. For eachJ the last theorem provides unbounded, closed sets K2,. . ., K,, with C, c K, c C\C, ( j = 2 ,..., n).SetQ, = Q\(K2u...uK,,).Then C\R1 = (C\8) U Ka U ** * UK,,. (I) Every bounded component of C\Q different from C,lies in some Kj, which is connected and unbounded. Therefore every point of C\Q, not in C1lies in an
0 5. Connectivity of a Set
35
unbounded component of C\n,. But, as in the proof of 1.38, Q u C1u is open, so its complement U W is closed. Evidently from (1) (2)
C\Ql
=
C, u Ka U.-.U K,, U
u
- . u C,,
V,
which shows that C, is relatively open in C\Q,. Being also compact and connected, C, is therefore a component.
Theorem 1.41 Let K be a compact, connected subset of C, x limit point of each component of K\{x}.
E
K. Then x is a
Proof: Suppose contrariwise that C is a component of K\{x} and x 6 C.Then C, being closed in K\{x}, is closed in K, hence compact. Since x $ C, there is then an r > 0 sufficiently small that b ( x , r ) n C = 0 . Evidently C is then a component of the compact set K\D(x, r). By 1.33 there is a compact set U which is relatively open in K\D(x, r ) , which contains C and which lies in the open set C\b(x, r ) . Then K\D(x, r)\U is relatively closed in K\D(x, r ) and so is compact, while
K\U
=
[ K n b ( x , r ) ] u [K\D(x, r)\U].
This decomposition shows that K\U is compact. Therefore U disconnects K.
Theorem 1.42 There is a countable set X of simply-connected, compact subsets of C\B(O, 1) with the property that every simply-connected, compact subset of C\B(O, 1) is a subset of some element of .f. Proof: In the space of continuous complex-valued functions on [0, 11 which are 1 at 0 there is a countable set {f&, . . .} which is uniformly dense. Indeed, by an easy uniform continuity argument one sees that the piecewise linear functions with rational complex “vertices” are such a class.
For each pair of positive integers n and m define
This is an open, connected set. For
is connected, being the union of connected sets with a point in common. l/m) (in fn(0) = 1) and Similarly, as fn[O, I ] meets both the disk D(0, 1
+
- l/m> (in &(I)),
C\D(O, Ifn(l)l
(3)
w
7
1
+ 1/m)u
f n P 7
the set
11 u [@\W Ifn(l)l - l/m)l
Curves, Connectedness and Convexity
36
is connected. Then the union of the set (3) and all the sets in (2), viz., (l), is connected. Define (4)
K(n, rn) = C\U(n, m).
Thus K(n, m) is a compact set which is disjoint from B(0, 1) and has connected complement. Now let K be any simply-connected, compact subset of C\B(O, 1). We will show that K c K(n, m) for some n, m.Choose r > 1 + suplKI. Then 1 and r are two points in the open connected set C\K. So by 1.28 there is a continuous y : [0, 11 + C\K with y(0) = 1, r(1) = r . Choose a positive integer m so large that D(0, 1
(5)
+ l/m) c C\K,
and (6)
2
; < dist(A0, 11, K ) .
Then choose n so that
It follows from (7) and (6) that (8)
u
D(fn(O,1/m) c C\K
tec0.11
and also that
<
Ifn(1)l
IIfn(l)l
+ l/m - 1 - l/m (if m 2 21,
that is, (9)
K = D(0, Ifn(1)l
- 1h).
It follows from (9, (8) and (9) that K c K(n, m). Exercise 1.43 Let U be an open subset of C and C1,. . ., C, distinct bounded components of C\U. Show that there exists compact K c U such that C,, . . ., C, lie in distinct bounded components of C\K. Hints: Choose bounded, open V, 2 C, such that Vl, . . ., V, are pairwise disjoint. Apply 1.34 to select compact K, c C\V, relatively open in C \ V and satisfying C, c K, c V,. C\(U U Kl U * U KM)= (C\U)\(Kl U U K,) is
--
-
6. Extension Theorems
37
relatively closed in @\U (since the K, are relatively open there) and so is closed in C. Therefore U v Kl u. v K M is open in C. Consequently there exist U, open in @ such that
-
K, c U, open c g, compact c U U Kl v - ..U KM
(1)
and the 0, are mutually disjoint.
(2)
Define
K = au, u... V a u M . This set is compact and is disjoint from Kl u. u KMby (1) and (2), but lies in U v K, u . . . vKM by (I). Therefore K c U. (1) and (2) also show that U, c @\K. Since U,\U, = aU, c K, we have U, = U, n (@\K) = 0, n (@\K), so U, is open and relatively closed in @\K. Hence U, contains any component of C\K which it meets. As C, c U, and the U, are bounded and disjoint, it follows that C1, . . ., C,, lie in different bounded components of @\K.
56
Extension Theorems
These results, pretty enough in themselves, will be of the utmost importance in Chapter IV when we want to produce logarithms. Theorem 1.44 (LEBESGUE [1907]) Let C be a closed subset of 88" and f: C --f R a continuousfunction. Then f has a continuous extension F: R" + R. Ifin addition f is bounded, then such an F exists which satisfies
inf F(Rn) = inf f ( C ) ,
sup F(R")
=
supf ( C ) .
Proof: (H. BOHR) The reader may check the routine details involved in the following outline. For each r 2 0 and x E R" define d(x) = inf{llx - yll : y
E
C}.
This is a continuous function by 1.32. Set
B(x, r )
=
{ y E 58":
#(x, r )
=
supf ( c n B(x, r ) ) , (x, r ) E S.
r} S = {(x, r ) E R" x [O,OO): d(x) Ir } IIX
- yI( I
Sincef is uniformly continuous on each compact subset of C, it is easy to check that # is continuous on the closed set S. Form x E R"\C.
Curves, Connectedness and Convexity
38
Prove that I$ is continuous and satisfies in addition +(xk)+f(x) whenever xk E Rn\Cand x k --t x E C. Finally define the desired extension by
.={:
in Rn\C.
Theorem 1.45 (BORSUK [1937]) Let A be a compact subset of a closed subset B of 88". Let fi A -+ C\{O} and g :B -+ C\{O} be continuous and suppose there exists a continuousfunction h: A x [0, 11 --+ C\{O} so that h(x, 0) = f(4} A. h(x, 1) = g(x) Then f has a continuous extension F:B --t C\{O}.
Proof: Let C = A x [0, I ] u B x {I} and extend h to C by the decree h(x, 1) = g(x) for all x E B. Apply the last theorem to Re h and Im h separately to come up with a continuous H:R"+l --t C which extends h. Since H(C)= h(C) lies in C\{O}, H-'(C\{O}) is an open neighborhood of C. The compact sets Ak = {X E R": d(X, A ) I Ilk} Satisfy m
Ak x
[o,
11 = A x
[o,
11
c
H-'(C\{o}).
k-1
Therefore by compactness there is some k such that Ak x
[o,
11
H-'(C\{o}).
Then for every x E B the point (x, min{l, kd(x, A)}) lies in A k x [O, 11 U B x { I } c H-'(C\{O}) and so F(x) = H(x, min{l, kd(x, A)}) is the desired continuous extension off. Remark: This is called Borsuk's homotopy extension theorem. The latter notion will be defined and explored in Chapter 1V.
+
Exercise 1.46 Let a, b, A , B E R with a < b, A < B and be a homeomorphism of (a, b) onto ( A , B). Show that extends to a homeomorphismof [a,b]onto [A, B ]
+
with endpoints mapping to endpoints.
Hints: After changes of scale and translations we can assume a = A = 0, b = B = I . For each integer n 2 2 the set +-l[I/n,(n - I)/n] is a compact connected subset of (0, I ) and so is an interval [a,, b,], say. Since is one-to-one, +(O, a,) is a connected subset of (O,+) u (+, I ) and so +(O, a,) lies wholly in one of these intervals. Replacing 4 by 1 - if necessary, we can assume that
+
+
+@, a21 = (OY3). Since +(O, a,) u +(b,, I ) (1)
(2)
I$(bz,1)
= (3, 1).
=
(0, I)) u (+, l), it follows from ( I ) that
39
Notes to Chapter I
Again the univalence of 4 and the definition of an and bn give
and from (l), (2) and connectedness then follow Vn 2 2.
and
(3) The conclusions
lim +(t) exists and equals 0 ti0
and lim + ( t ) exists and equals 1 ttl
are immediate from (3).
Exercise 1.47 Replace the hypothesis on 4 in 1.46 by the formally weaker one that it be (continuous and) bijective, i.e., one-to-one and onto (with no a priori continuity claim for the inverse). Prove that then it is either strictly increasing or strictly decreasing and (so) the conclusion of 1.46 still follows. Notes to Chapter I
The results of this chapter belong t o the realm of general point-set topology and all of them are valid in the appropriately general topological space (most in any [Hausdorff] topological space; some require local compactness or connectedness). For some of the history of some of the concepts here consult the notes at the end of HAUSDORFF’S books [1914], [1957]. On the important concept of connectedness see especially FREUDENTHAL’S notes on pp. 486-488 of BROUWER [ 19761. In almost any function theory book (e.g., CONWAY [ 19731, pp. 8-1 0) the reader will find a discussion of the stereographic projection of the plane onto the sphere@, = { ( x ~x2, , x3) E R3: x: x i + x t = I} minus its north pole (0,0, I). One regards C as a subset of @, and does all of function theory on the sphere. This has several advantages (not the least being esthetical), since now the point “at infinity” does not enjoy a privileged role (topologically, at least). The statement and proofs of many results thus acquire greater cohesion and uniformity. This point of view is essential in the theory of Riemann surfaces and differentiable manifolds and in the study of meromorphic functions. A penalty is, however, extracted, which we have elected not to pay; namely, the consideration of cases returns when one engages in algebraic operations. C, is called the Riemann sphere-see 0 8 of OSGOOD [ 19011.
+
40
Curves, Connectedness and Convexity
Simple connectivity for subsets S of Q: is usually defined as C,\S being connected. It is not hard to show that our definition agrees with this one when S is bounded or open, essentially the only kinds of sets with which we will be working. For arbitrary S, however, the two definitions do not agree. To see this, consider a connected subset C of C, with an “explosion point” x , i.e., a point x such that C\{x} is totally disconnected (meaning that each component is a single point). Such exotica indeed exist; see page 145 of STEENand SEEBACH [1970]. We may situate Cin C, so that x = (0,0,l). Then let S = Q:,\C, a subset of C,\{(O,O, 1)) = C. Then of course this set has a connected complement in C , but its complement in C is the totally disconnected set C\{(O, 0, I)} and so has infinitely many bounded components.
A much more general version of 1.14 is true: any two points on any curve lie on an arc which lies on the curve. For a proof of this surprisingly non-trivial fact (due to R. L. MOORE[1916/17]) see TIETZE[1919], MAZURKIEWICZ [1920], KAMIYA [1931] or G. T. WHYBURN [1932]. This fact would be quite useful in Chapter IX (in the proof of 9.14) but appeal to it there will be circumvented by using 1.16 and 1.29. Contained in the proof of 1.19(ii) is a famous result of CARATH~~OWRY [191I] (p. 200) :if S c Rk,then every element of co S is a convex combination of k + 1 or fewer points of S. The proof in the text is due to STEINITZ 119131 (p. 153). The idea of the proof of 1.35 comes from HEINS[1962] (p. 150) and that for 1.39 is from SAKS and ZYGMUND [1971] (p. 210). See also DE VITO [1957]. Definition 1.36 is due to HAUSDORFF (p. 351 of his book [1914]) and supersedes a less tractable one which CarathCodory had made earlier. There is another proof of 1.44 (due to F. Riesz) in DIEUDONNB [19691(pp. 89,90). It is quite similar to the second of two proofs which HAUSWRFF [1919] offers. Both of Hausdorff’s proofs are elegant and interesting; the first involves inserting a continuous function between an upper semicontinuous function and a lower semicontinuous function. (See also pp. 276-277 and 281-283 of HAUSDORFF [19571.) For other proofs see R. RADO[ 1931 ] and VIZZINI[19321. Theorem 1.44 was extended to metric spaces by TIETZE[I9141 and is often called the “Tietze extension theorem”; this designation has even come to be applied to the euclidean space version of the theorem. The plane version of 1.44 with C compact can already be found in PHRAGM~N [1900].
41
Chapter I1 (Complex) Derivative and (Curvilinear) Integrals This short chapter is comprised of very basic and very easy material, probably familiar to most readers in one form or other. Even the reader with only modest experience can probably supply his own proofs for most of these results as quickly as he can read mine! We record them here for later reference and to fix notation and terminology.
01
Halomorphic and Harmonic Functions
Definition 2.1 Iff is a complex-valued function defined in a neighborhood of the point zo, we say f is differentiable at zo if the quotient of complex numbers (f(z) - f(zo))/(z - zo) has a limit in C as z approaches zo. When it exists, this limit is called the derivative off at zo and is notedf’(z,). Iff is differentiable at each point of an open subset U of @, we say f is differentiable in U or holomorphic in U and by H ( U ) denote the set of all such functions. We denote by H ” ( U ) the subset of all functions in H ( U ) which are bounded on U. A one-to-one holomorphic function is called conformal; other synonyms are injective, univalent and schlicht. A function which is holomorphic in C is called entire. Remarks: Often the term conformal is bestowed on holomorphic functions which are only locally univalent, i.e., univalent in some neighborhood of each point. We shall see later (5.89) that this just means that the derivative is never zero. The rationale for this term may be found in the nice discussion on pp. 73-75 of AHLFORS[1966a]. It should also be noted that British usage for entire is integral. Sometimes analytic is also used for holomorphic, but equally often that term has a more technical use. (See chapter VI of SAKSand ZYCMUND [1971].) The terms monogenic and regular, now largely archaic, are other synonyms for holomorphic. But by now perhaps we are teetering on the edge of Ockham’s Razor.
Definition 2.2 A function f defined in an open set U is called harmonic in U if I/ is a union of open sets in each of whichfis the real part of some holomorphic function; that is, for each a E U there is an r > 0 and a function Fa holomorphic in D(a, r ) such that f = Re Fa in U n D(a, r ) . Remarks: This is not the customary definition. Later the myriad equivalences of this important concept will be established. One of them is the traditional definition of harmonic: f satisfies Laplace’s partial differential equation. (See 9.29, 9.3 I .) A complex-valued function F is defined to be harmonic if each of Re F and Im F is harmonic.
(Complex) Derivative and (Curvilinear) Integrals
42
The expected elementaryresults prevail (and thus, for example, H( V )and H “ ( U ) are algebras) :
Theorem 2.3 Let$, g, h be complex-valued functions with f and g defined in a neighborhood of zo and direrentiable at zo and h defined in a neighborhood of f ( z o )and direrentiable at f(zo). Then f is continuous at zo. (i) f + g and f .g are each diyerentiable at zo and (ii) ( f + g)’(zo) = f ’ ( Z 0 ) + g’(zo), cT.g)’(zo) = f’(zolg(z0) + f(zolg‘(z0). (iii) The composite h 0 f is defined in a neighborhood of zo, is direrentiable at zo and ( h of)’(zo)= h’(f(zo))*f’(zo).The latter formula is called the Chain Rule. Proof: For (i) write
let z approach zo and cite (i). For (iii) define two functions 6 and e near zo and f(z,), respectively, by
The definitionsoff ’(zo)and h’(f(zo))are just such as to make 6 and E continuous at zo and f ( z o ) , respectively. Then for all z sufficiently near zo we get from ( I )
(3) f ( z ) - f ( z o ) = (z - zo)lf’(zo) + Wl and for all w sufficiently near f ( z o )we get from (2) (4)
h(w) - h(f(Z0)) = (w - f(zo))[h’(f(zo))+
4W)l.
Now by (i), f ( z ) is an eligible w for z sufficiently close to zo. For such z insertion of (3) into (4) gives
+ &(f(Z))l, h(f(z)) - h(f(Z0)) = ( z - zo)Lf’(zo) + ~(z)l[h’(f(zo))
8 1. Holomorphic and Harmonic Functions
43
that is, (5)
+ eCf(z))].
‘h o f ) ( z ) - (h o f ) ( z 0 ) = [f’(zo) -t S(z)][h’cf(z0)) z - zo
Let z approach zo. Then S(z) and f ( z ) approach S(z,) = 0 and f ( z o )respectively and so e(f(z)) approaches e(f(zo)) = 0 and the assertion (iii) follows from (5). Exercise 2.4 Let f be holomorphic in an open set U. Define U* = {Z:z E U } and f * on U* by f *(z) = 3(Z). Show that f * is holomorphic in U*.
Hint: For z, zoE U* with z # zo we have Z, Zo E U and
-
Then f* is differentiable at zowith derivativef’(Zo). Exercise 2.5 Consider the function +(z) =
(i) (ii)
z+l 2 = 1 + 7, z E a=\{l}. z-1 Z-
Show that Show that (0,m) x
+ is uniualent, its range is C\{l} and +. + maps D(0, 1) onto (- 0) x R and maps @\b(O, +-I
=
00,
1 ) onto
W\{ll.
Hints: If w = +(z),then compute
(iii) (iv)
+
Show that maps [ - 1, 1) onto (-m,O]and (consequently)maps C\[- 1,1] onto C\(-00,0]\{l}. Show that $(z) = z 1 /zmaps C\b(O, 1) conformally onto C\[- 2,2].
+
Hints: Set s(z) C\D(O, 1)
= z2 and
note that in
2 (0,
x
0O)
W\{1) 2-a=\( -0O, O]\{1)
5 C\[- 1, 11
all maps are one-to-one and onto. Then check that $(z)
=
2+(+Yz)).
Exercise 2.6 Let D = D(0, 1) and for each a E D define f a by
Show that fa is one-to-one and continuous on b, holomorphic in a neighborhood of 6,that f a ( D ) = D, f a ( B )= b and that the inverse of f a on is f-,. (See 6.2(ii) for the conuerse of this.)
44
(Complex) Derivative and (Curvilinear) Integrals
Hints: Evidently f a is holomorphic in C\(l/Z} 3 a = 0. Direct computation leads, for z E D, to
B in case a
# 0 and entire if
lszL(1
Izla)(l lala) < 1. 11 iizIzI”
It follows that f4(D) c D. Another simple calculation confirms that for all z E D,f-4(fa(z)) = z. Thus f4 is one-to-one in b. Applying all the conclusions so far secured to - a in the role of a, we learn that for all z .s D , f - .(z) E D and f4(f-.(z)) = z. Thus f , ( D ) 3 D. We now have f4(D) = D. By continuity then f a ( b )=
92
D and all claims about
f4
and f - 4 are established.
Integrals along Curves
Exercise 2.7 Let y : [a, 61 --f C be a piecewise smooth curve. Let, say, a = to < t1 < . < t, = by a = so < s1 c < s,,, = b and y be continuously differentiable on each [r, - 1, tr] (j= 1, 2, . . .,n ) and on each [ s k - 1, s k ] (k = 1, 2, . . .,m). (Recall definition 1.1 I(ii).) Verfy that (i)
-
(ii)
- 6 .
Verfy that for each complex-valuedfunction f which is continuous on the range of y
Hint: Take a “common refinement” of the two partitions of [a, b ] . Definition 2.8 The sums in (i) and (ii) above are noted /(y) andJYf (or sometimes f(E)dt) and called the length of y and the integral o f f along y, respectively.
JY
Remarks: My attitude toward curves and integrals is frankly utilitarian. There is no need to integrate over curves more general than piecewise smooth ones, so we will not. There is, however, some esthetic loss in defining the length of (a smooth) y to be J” Iy’l. One ought to call a curve y : [a, 61 -+ C rectifiable if there is a finite M such that the length Iy(t,) - y(t,-J of the polygon [y(to), . . ., y(t,)] inscribed in y is not greater than M whatever be the points a I to Itl I . . . 5 t, I 6. In such cases call the least upper bound of the lengths of these inscribed polygons the length of y. I t is then a theorem (and an easy one, see RUDJN[1976],p. 137) that if y is smooth, then it is rectifiable (see 2.13(ii) below) and its length in the above sense equals J” Iy‘l. Only this latter integral intervenes in our subsequent considerations and 1 chose for it its traditional name, the length of y ; the above theorem is the rationale for this.
zy=l
0 2. Integrals along Curves
45
Again esthetic considerations might lead one to want to have J y f defined for any curve y (lying in the domain of the holomorphic function f). After Cauchy's theorem (in a disk) is proved in Chapter V, this can easily be done by approximating y uniformly with piecewise smooth curves (whether y is rectifiable in the above sense or not). See PERRY AND YOUNGS [1947]or REDHEFFER [1969]for details. (Cf. also Mathematical Reviews vol. 53 #3270.)
Exercise 2.9 (i) If y is a piecewise smooth curve and f is continuous on the range of y and M is a bound for I f 1 there, then
(ii)
Ifao,. . ., a,
and i f a ,
E
E
C and f is continuous on [a,, . . .,a,], then
[ao,a,], then
Theorem 2.10 Let U be an open subset of @, F E H ( U ) and suppose that F' is continuous on U. [This last hypothesis will later be shown to be redundant.] Then for any piecewise smooth curve y in U with initial point zo and terminal point z1
If in addition y is closed, then
1
F'
=
0.
If U is connected, there is for each zo and z in U a polygon yz in U with initial point zo and terminal point z (by 1.28). For any such polygons
F(z) = F(zo) +
s,
F'
VZ E U.
( When U is starlike with respect to z,,,the intereal [zo, z ] is an appropriate yz.) U is connected and F' = 0 throughout U,then F is constant in U.
If'
(Complex) Derivative and (Curvilinear) Integrals
46
Proof: If the domain of y is [a, b] and a = to < tl c.- .c tn = b are such that y is continuously differentiable on each [ t j e l , t j ] ,then by definition
(Chain Rule) n
2 [(F
=
o
y)(tj)
- ( F o y)(tj-l)]
,= 1
= (F 0 y)(tn) =
-
0
(Fundamental Theorem of Calculus)
to) = F(Ab)) - F(Aa))
ml)- F(Z0)
(by definition of z1 and zo).
This establishes (i), and (ii), (iii) and (iv) are trivial corollaries of (i), There is a converse to part (ii):
Theorem 2.11 Let 52 be a region and f a continuous function in 51 with the property that f = 0 for every piecewise smooth loop y in R. Then there is a (continuously) direrentiable function F i n i2 such that F’ = f (cf. 5.39).
1,
Proof: According to 1.28 i2 is polygonally connected. Fix zo E Q and for each z E R let yr be a polygon in Q with initial point zo and terminal point z and define F(z) =
We will show that at each zl E 52, F’(z,) exists and equals f(zl). Pick r > 0 so that D(zl, r ) c 52. I f z E D(z,, r ) , we may consider the piecewise smooth loop y : [0, n + m + 11 +. R defined by
I
O s t l n
YZl(t)
At) = z1 + (t - n)(z - z l ) n I t s n y,(n+rn+l-t)
+1
n + l s t s n + m + l ,
where [0,n], [0, m]are the parameter intervals of yzl and yi respectively. After some trivial changes of variable we see that
S* f / =
YSl
f+J
121 .rl
f - J f = F(Z1) - F(4 + 71
By hypothesis this integral is zero, that is,
d,,,~]f.
8 3. Differentiating under the Integral
47
whence
From the continuity off at zl the desired conclusion is now immediate.
Deflnition 2.12 For a subset S of C and a bounded function8 S --f C let w,(S) =
sup{\f ( z ) - f ( w ) l : z , w E s, 12 -
WI
5 S}
for each 6 2 0. The function w r : [0, 00) --f [0,00)so defined is called the oscillation o f f or, in case f is continuous on S, the modulus of (uniform) continuity o f f .
Exercise 2.13 (i) Let S be a subset of C andf: S + C a bounded function. Show that w I is continuous at 0 if and only i f f is uniformly continuous on S. Let y : [0, 13 --f C be a piecewise smooth curve. Show that (ii)
whenever0 = to < tl <...< t, = 1.
Hint: By adding more points t j the left side is not decreased, so we can suppose that all the points of discontinuity of y' are among the t j . Then y(tj) = /:-1 Y' and 4 Y ) = 27=1j:;-l lY% (iii)
With y , t o , . . ., t, as above, set 6 = maxlsjs,(tj - t j - l ) . Show that i f f is a continuousfunction on the range of y and all the points of discontinuity of y' are among the tj, then
Hint: Use the hint to (ii) and the fact that
03
Differentiating under the Integral
We will use (and prove) as we progress, several successively stronger theorems on differentiating behind the integral sign. (See e.g., 7.18.) The easiest and most useful of these is codified in
(Complex) Derivative and (Curvilinear) Integrals
48
Theorem 2.14 (Cf.with 3.8.) Let y be a piecewise smooth curve, g a fwtction continuous on the range of y . Then the functions Gn(z) =
s en
d5, n = 1,2, 3 , . . .
Y
are (infinitely) diflerentiable in the complement of the range of y and satisfy (*)
Gk = nG,+,.
Proof: We base the proof on a simple algebraic identity which we derive first. Consider two unequal, non-zero complex numbers u and b.
If la - bl
I;
r while la1 2 rand 161 1 r, then this gives
Consider now any z, zo not on y. We have (3)
- Gn(z0) - nGn+l(zo) z - 20
Gn(z)
( 5 -l Z0)n )
0 4. A Useful Sufficient Condition for Differentiability
49
Now choose r > 0 so small that D(zo,2 r ) is disjoint from y and consider only z # zo. Then It - zl 2 r and 14 - zoI 2 r for any E y and so for the last integrand above, (2) provides the upper bound z E D(zo, r ) with
From this and (3) follows (recalling 2.9(i))
where M is the maximum of lgl on y. Now let z approach zo to see that Gb(zo) exists and equals nG, +
If y is a piecewise smooth loop, show that for every integer n
Exercise 2.15
# 1
lY(3 -0
dz
V W € c\y.
Hint: For such n the integrand is a derivative, so 2.10(ii) may be cited.
Q4
A Useful Sufficient Condition for Differentiability
If U is an open subset of C and f: U -+ C a function, there are various conditions on f which insure that it is holomorphic in U. (See, for example, Morera's theorem 5.39.) One such condition is that f have continuous first partial derivatives which satisfy the so-called Cauchy-Riemann equation in U (see p. 13 of OSGOOD[1901]): (C.R.) D J
=
-iDJ
There is a slick proof in HOFFMAN [1975],p. 202. Here we prove a stronger pointwise result by more pedestrian means; 2.18 below gives a slight extension.
Theorem 2.16 Let U be an open subset of @, zo E U , f: U --f 62 a function such that D1f and D2f exist in U and are continuous at zo. Suppose that D ,f ( z o ) = - iDaf(zo). Then f is diferentiable at zo and f '(zo)= D1f(zo). Proof: Write zo = (xo,yo) and consider r > 0 such that Qr = [xo - r, xo + r ] x [ y o - r,yo + r ] c U . Consider in what follows real h, k with lhl, Ikl 5 r. The hypothesis D1f ( z o ) = -iDz f ( z o )gives If@O
+ h, Yo + 4 - f(x0, Yo) - (h, W , f ( x o , Yo11 5 I f ( X 0 + h,Yo + k) -f(xo,yo + k) -
+ I f ( X 0 , Yo + 4
h[Re Dlf(X0, Yo)
- f @ O Y Yo) - k[Re Daf(xo,
yo)
+ i Im Dlf(X0, Y0)ll + i Im Daf(Xo,. ~ o ) l l .
50
(Complex) Derivative and (Curvilinear) Integrals
Apply the Mean Value Theorem to the real and imaginary parts of each expression on the right to come up with real numbers a, b, c, d (dependent on xo,yo, h, k ) satisfying 1a1, lbl I lhl; IcI, [dl s Ikl and such that
+ h,Yo +
-f(Xo,Yo) - (h, k)Dlf(XO,YO)l I lhDl Ref(xo + a, YO + k) - h Re Dlf(xo, yo) ihDl Im f(xo 6, yo k) - ih Im Dlf(xo, yo)]
If@O
+
+
+
+ lkDa Ref(xo, yo + c) - k Re Dzf(xo, yo) + ikDa Imf(xo, YO + 4 - ik Im Daf(xo, yo)l
Now let r $ 0 and use the continuity of D1f and Daf at zo. Exercise 2.17 (i) Zf f is direrentiable ar zo, then D1f(zo), Daf(zo) exist and satisfy (C.R.). Hint: The hypothesis is that the quotient f(z0
+ h) - f@o)
h has a limit as the complex number h approaches 0. Consider first h E R, then h E i-R. (ii) Iff is holomorphic in a region IR and Ref is constant, thenf is constant. Hint: Equating real and imaginary parts in (C.R.) shows that Dl(Imf) = - D,(Ref). Therefore, f’= D1f = Dl(Re f ) - iD,(Re f). The latter is 0 if Ref is constant. Cite 2.1qiv). Exercise 2.18 (D. R. CURTIS[ I9011021) Modify the mean value argument above to prove the diflerentiability off at zo when rhe second hypothesis in 2.16 is replaced by the weaker one rhat both Re D1f and Im Daf [or, alternatively, both Im D1f and Re Daf ] are continuous at zo. Notes to Chapter II For more on the two geometric features (“streckentreue” and “winkeltreue”) which earn locally univalent holomorphic functions the name “conformal,” see pp. 4246 of BIEBERBACH [1934], REMAK[1914], BOHR [1918], RADEMACHER [1919a], R. K.WILLIAMS [1973].
Notes to Chapter II
51
Sometimes it is convenient to speak of a function8 A Q: being holomorphic in A without A being open. There would be two possible definitions, a local one and a global one: (i) For each a E A there is an open neighborhood V, of a and an f a E H(V,) such that f coincides with f , in A n V,. (ii) There is an open neighborhood V of A and F E H(V) such that f coincides with F i n A. We will not use this language, but the two definitions are equivalent, a not entirely trivial fact: see MINDA[1973]. Though adumbrated by Gauss and Poisson, the idea of the complex contour integral evolved at the hands of Cauchy, beginning with his famous 1825 [1900], ETTLINGER [1921-221 and Y u h v r E [1947].) memoir. (See STACKEL Much work has gone into efforts to weaken the conditions in 2.16 and these conditions can indeed be considerably relaxed. Here is a sample result: [19231, RIDDER[ 193Oa1, WILKOSZ [19331, MENCHOFF [19361) Theorem (LOOMAN
Iff is continuous on U,D1f and D2f each exist at all but countably many points of U and the equation (C.R.) holdr almost everywhere in U (in the sense of plane Lebesgue measure), then f is holomorphic in U. The requirement of differentiability at every point in the definition 2.1 of holomorphy can also be relaxed. 5.41 and 9.28 are examples; here is another:
Theorem (POMPEIU[1905a], LOOMAN [1925], RIDDER[1930a]) r f f is continuous in U,&,,,,l(f(z + h) - f(z))/hl isfinite for all but countably many z in U and f’ exists almost everywhere in U,then f is holomorphic in U. For details of these results, which are heavily real-variable in nature, the reader may consult MENCHOFF [1936], pp. 195-201 of SAKS[1937] or the exhaustive (but terse) treatise of TROKHIMCHUK [1964]. For a somewhat more elementary account of somewhat weaker results in this direction, see MEIER[1951], [1960] and ARSOVE [1955]. For a survey of results and history (together with a proof of [1962] the first theorem above) see GRAYand MORRIS[1978]; in TROKHIMCHUK the reader will find a longer survey and some proofs. See also TAR[1969], [1971] for [1971], [1973], MEIER[1970], PONOMAREV [1970], and BEREN~TE~N recent results. Readers knowledgeable of Bulgarian may also want to consult the paper reviewed in Mathematical Reviews vol. 36 #5311 and Zentralblatt vol. 311 #30001. For one-to-one functions even weaker conditions suffice to ensure analyticity. See pages 5 , 6 of MONTEL [1933b] and the references there, as well as MENCHOFF [1936], [1937] and BRODOVICH [1970], [1974]. Chapter 1 of MARKUSCHEWITSCH [1976] is also devoted to these questions and contains a proof of the first theorem above. With definition 2.1 a commitment is made that has profound historical significance. The theory to be erected here did not spring fully-armed from the head of Zeus, but condensed gradually out of the primordial vapors. There are at least
52
(Complex) Derivative and (Curvilinear) Integrals
three distinct lines of development: the theory of Augustin Cauchy, based on 2.1 and on integrals of the type 2.14, has a geometric character; that of Bernhard Riemann, based on the equation (C.R.) and closely connected with potential theory, is analytic; and that of Karl Weierstrass (and Charles MCray), based on power series, is purely arithmetic. Each of these has its strengths and weaknesses. For example, the (unadulterated) Weierstrass theory did not deal so well with mapping problems and the beautiful theorem 9.7 eluded it. On the other hand, it was the most logically rigorous and philosophically satisfactory of the three because it started with only the arithmetic of complex numbers (i.e., rational functions) and added just one more (“natural”) ingredient-uniform convergence. As is customary nowadays, the account to be presented here imperiously conscripts the best features from each of these. The strategy consists in exploiting first one (until it encounters a chasm it cannot bridge) and then another of these points of view. And, as with any anabasis, extensive logistical preparation is necessary. This is the work of the next two chapters. In FOUBT [1904] the reader will find a detailed comparison of the three theories with many references to the original works and in PRINGSHEIM [1925], [1932] a complete and careful (though sometimes pedantic) presentation of the Weierstrass theory. (Incidentally, the latter tome is a good place to observe the price which methodological purity can exact: results which will be secured very expeditiously in the course of Chapter V often require many pages there.) For [I9751 and for the the historical evolution of Weierstrass’ theory see MANNING [ 19251. master’s own comparison of the three approaches, WEIERSTRASS
53
Chapter I11 Power Series and the Exponential Function $1
Introduction
As with integrals, power series (though fascinating) are a tool here and are not pursued extensively. (However, some special kinds of power series, those with many zero coefficients or with integer coefficients, are examined in some detail in Chapters XVI and XVII.) For in-depth treatises on power series the reader should consult KNOPP[1951] or BROMWICH [1926]. To make our definitions and get started only one simple result is needed: Theorem 3.1
limn+mniln = 1 and for any a > 0,
Proof: Set x,
=
niln
alln = 1.
- 1 . Since this is non-negative for n 2
2
Therefore O I X , I
K
and so x, -+ 0. If a 2 1, then 1 I all" Inl/" for large n, so 0 < a < 1, apply this conclusion to ] / a .
alln--t
1. If
Remarks: We are, of course, assuming known the theory of rational roots and powers on [0, co). This is an easy consequence of the completeness of R. (See, e.g., chapter 1 of RUDIN[ 19761.) Irrational powers on [0, co) can be dealt with at the same level of elementariness but will not be needed. Everything is finally subsumed under theorem 3.14. (For an alternative elementary derivation of 3.1 see PRACHAR [ 19751.) $2
Power Series
Definition 3.2 An infinite series of the form 2,"- c,(z - zO)n,where c,, z, zo E @, is called a power series, more precisely a power series about zo, or a power series centered at zo. (No a priori convergence claim is being made.) Theorem 3.3 Let c,, zo E 62 and consider the power series m
Then there exists an R E [O,CQ]such that: The series ( I ) converges absolutely for all z E C with Iz - zol < R and (i) uniformly in D(zo, p) for any p < R.
Power Series and the Exponential Function
54
(ii) (iii)
The terms of the series (1) are unbounded (and hence the series diverges) for every z E C with Iz - zol > R. The extended real number R is the reciprocal of the extended real number and is called the radius of convergence of the series (1). limndm
Proof: Define R to be the least upper bound in [0, 031 of the r E [0, 00) for which {Icnlr"} is a bounded sequence. If Iz - zol > R, then the sequence {c,(z - z0)n} is unbounded, while if p c R and we pick r satisfying p c r c R, then by definition of R we shall have that {Icnlr"}is a bounded sequence, say Ic,,Jr"I M < 00 for all n. Then for all z in o(zo, p )
and since p/r c 1, the assertion (i) follows. Now if 0 < r < R, then {Icnlr"}is bounded, say by M(r) E (0, co): lcnlrn IM(r) 1 IcnlllnI - [M(r)]lln Vn. r Let n + co and cite 3.1 to conclude that
-
lim lcnllln5 l/r
n+ (o
and since r is arbitrary in (0, R),
(2)
limI~,,ll'~ I1/R.
n+m
Equality necessarily holds in (2) if R = co. If R 00 and R c r , co, then by definition of R the sequence {lcnlrm}is not bounded and so in particular infinitely many of its terms exceed 1 and therefore lcnlllnr > 1 for infinitely many n. It follows that
Again as r E (R, 00) is arbitrary, it follows that
which with (2) establishes the claim (iii). Example 3.4 The radius of convergence of the power series infinite. For if m is any positive integer, then for n > m we have
n! 2 n(n mn
- l ) . . . ( m + 1)m > mn-'"+'
s rn"-l. n!
(l/n!)z" is
8 2. Power Series
55
Recalling how R is defined in the first line of the above proof, we conclude that R 2 m for all m.
Theorem 3.5
zo E @, then the two series 2;- cn(z - zo)n and
If c,,
m
2ncn(z -
m
2 (n +
~ ~ y=- 1
I)C,+~(Z
- z0y
n= 0
n- 1
have the same radius of convergence. Proof: Since X'=o ncn(z - z0)n = (z - z o ) . ~ ~ncn(z = , - zO)n-l,it suffices to show that the two series ncn(z - z0)n and cn(z - z0)n have the same radius of convergence. And by part (iii) of the last theorem, for this it suffices to show that
z:n"po
-
Iim Incnll/n=
n-r m
lim ~c,,ll/n.
n- m
This in turn follows from 3.1 : lim Icnl1ln s Iim Incnll/n I n-
n- m
m
lim nlln. n-limIc,ll/n m
n-r a0
=
iiElcnll/~.
n-.
m
Theorem 3.6 Let cn,zo E C and let the radius of convergence R of the series 2-: cn(z - zo)nbe positive. Then the function f defined in the open disk D(zo, R ) bY m
(1)
=
2 cn(z - zo)n
n=O
is infinitely differentiable and for every positive integer k satisfies m
(2.k) f("(z) =
2n(n - l ) . . . ( n - k + l)cn(z - ~ ~ ) nV Z-E D(zo, ~ R).
n=k
Proof: It suffices to prove that f is differentiable in D(zo,R) and satisfies equation (2. I). For then we may, via 3.5, induce on k. Also, by considering the function F(z) = f ( z zo) in D(0, R), we may assume without loss of generality that zo = 0. Let g denote the function defined (by 3.5) in the disk D(0, R) by the right side of equation (2.1). Fix w E D(0, R) and choose IwI < r < R. Then for z E D(0, r)\{w}
+
The expression in square brackets is 0 if n confirms that it equals n-1
(4)
(z
- w)
2kw"-'z"-*-'.
k- 1
= 1
and for n 2 2 direct multiplication
Power Series and the Exponential Function
56
Since w, z E D(0, r), the absolute value of the sum in (4) is less than
2krk-lrn-k-l
n- 1
= rn-l
2
k-1
and so finally
Two successive applications of the last theorem show that the series m
z:n"po
has the same radius of convergence as the series Icnlzn,viz., R and so, since r < R , the sum in ( 5 ) is finite. Therefore, since D(0, r ) is a neighborhood of w, we have only to let z --f w in ( 5 ) to conclude thef'(w) exists and equals g(w), as claimed.
zo.,:
Exercise 3.7 If the series f ( z ) = cnznhas a radius of convergence R > 0 andf'(0) = c1 # 0, then for some 0 < r < R , f is one-to-one in D(0, r).
Hints: If 0 < r < R and z, w E D(0, r ) then, as in the proof of 3.6,
z,"=nlcnlzn- has radius o f convergence R, so for sufficiently
By 3.5 the series small 0 < r < R,
If(Z>-f(w)l
nlc,lrn-' < Icll/2 and it follows that > (IClll2)lZ -
WI.
Remark: These same techniques show, with a little more work (see KRAFFT [1932]), that f ( D ( 0 ,r)) is open and f-' is given by a power series near co, facts which we will secure in Chapter V by other means.
Exercise 3.8 In the notation of 2.I4 show that each G, is of power series type near each point of C\y, i.e., for each a E C\y there is a power series about a which agrees with G, in some neighborhood of a. Deduce along the way a new proof of 2.14.
8 2. Power Series
57
Hints: (after Cauchy) From 1/(1 - w) = follows by differentiation that
z;,=owk for all w
E
D(0, 1) and 3.6
Given a E @\y, choose R > 0 so that D(a, R) c @\y. Then for any 0 < r < R, ZE
D(a, r) and ( E Y we have 1
-
1
1
(t - Z ) n + l - (6 - a y + 1
with convergence uniform in such z and 1. Consequently, for z E D(a, r )
by 3.6,
by equation (2.n
- 1) and the fact that
n Exercise 3.9 (Cf. CAUCHY [ 1 82 1 1, p. 59.) Show that if anis positive for all (SUBciently large) n, then
lim a,,l d J q + G G n < G % . n-m
an
n-m
n- m
n-m
an
Hints: Call the last limit superior a E [0, co]. It suffices to prove the last inequality. For if a = 0, this finishes our work, while if a > 0, this result can be applied to the sequence { 1/an}. In proving this last inequality we may assume a < co. For an e > 0 there is an N = N ( e ) such that
Power Series and the Exponential Function
58
Multiply these inequalities for n = N, . . ., m
- 1 to obtain
P'G S a + e.
It follows from this and 3.1 that
Exercise 3.10 Show that for each positive integer k n+ limm
IF)
=
kk (k - l)k-l*
Hint: The corresponding limit for ratios is trivial, so use the last exercise.
Exercise 3.11 Show ?hat ifa, ao,al, . . ., E C and limn-,ma, = a, then
Hints: Since (1)
2 (3
= (1
k-0
+ 1)^ = 2",
we have
Now divide and conquer: given e > 0 choose ko = ko(e)so that (3)
la
- akl < e/2
Vk 2 k o ;
then use the fact that limn--rm nko/2" = 0 to pick no = no(e) 2 ko so that
for some M > sUP(IaI,
2
4 =
k
.
= 0, 1,2,. .}.
n(n - l ) . - . ( n - k 2"k !
+ I)
Then for k nk
nko
<-s-<- 2" 2"
and so kq-1
la k-0
- akl I 2M
2 2-'([1)
k=O
=
0, 1 , . e
4Mko
. ., ko Vn 2 no,
zoGo=;
kq-1
< 2M
Vn 2 no.
5 2. Power Series
59
From (2), (3) and (4)
[z&lIcn,,I] < 03. Show that then
Exercise 3.12 Let cn,,,E C be such that
ConsequentIy, for each n the series c,,,,,, converges (say to sn),for each m the series (ii) c,,,,,, converges (say to t,) and the series sn, 2-: t, are convergent and equal.
z&
z:=
Hints: Let L denote the (finite) number in (i) and set
ztLNtl
zKM+]. It,,,] 5
Show that Is,] I 1 3 ~ and , ~ all N' > N, M' > M. In the inequality
valid whenever N' 2 N and M' 2 M , first let M' to see that IzL, s, t,l I2 8 N . M .
zEpl
8N.M
for all N and M and
--+ 03
and then let N' +-00
Exercise 3.13 (i) Let X c C, ak: X - t C and bk E R with bk $0. Set A , = ak and suppose that {A,,} is uniformly bounded on X. Show that bkakis uniformly convergent on X.
zE=o
Hints: Since ak = A k - A k - 1 , a little juggling with indexes of summation leads to (Abel's partial summation formula) :
5
k=p+l
bkak
=
2
Ak(bk
k ip + 1
- b k + l ) + Aqbq+l - A p b p + l , 0 5 p < 9.
If M is a bound for {A,} on X , we then get
= M(bp.1 =
- bq+d
+ Mbq.1 + Mbp.1
2Mbp.1,
showing that the sequence {I;5o bk&} is uniformly Cauchy on X.
Power Series and the Exponential Function
60
(ii)
bk E R and bk 4 0, then the series z2-ob g k converges throughout D(0, I)\{ I} and unflormly on each compact subset.
If
Hints: For any 0 < r c 1 and all n 2 0 we have
IXZkl I =
p + 1
-1
2-1
2 2 c -I - Vz E D(0, l)\D(l, r ) ; -12-11 r
now cite (i).
03
The Complex Exponential Function
The most important power series in analysis will now be introduced and studied. Besides the interesting numerical results which we will derive from it in this chapter, it will serve as the basis for a rigorous logical treatment of the idea “the number of times a curve winds around a point.” This will be essential to the whole Cauchy theory of holomorphic functions and also will be one of the main tools in the rather complete topological analysis of the plane offered in Chapter IV. The presentation here, while maximally concise, has a deus ex machina character. Since the function y --f ely is, up to a constant, the unique (continuous) homomorphism of the topological group R onto the topological group T (see 3.25), it can be introduced “naturally.” One has only to show somehow, without the exponential, that these two groups are locally isomorphic. Similarly with the real exponential x --f ex. This elegant, but arduous, program is carried out in BOURBAKI [1966], chapter V, Q 3 and 4, and chapter VIII, 9 2. Cf. also DZEWAS [ 19681.
Theorem 3.14 The function E defined for all z E C (cf. 3.4) by
has the following properties: (i) E’ 2 E. For all z l , 2, E @, E(zl (ii)
+ Z a ) = E(zl)E(z2).
(; -1 = i and
(iii)
There is a positive number s such that E
(iv)
E l R is strictly increasing and E(R) = (0,00). The mapping x --f E(ix) maps R onto the unit circle { z E C: E(C) = C\{O}.
(v)
(vi)
i
121
=
1).
Note: (ii), (iii) and (vi) say that E is a homomorphism of the additive group @ onto the multiplicative group @\{O} with kernel 27rih.
I
61
$ 3 . The Complex Exponential Function
Proof: That E is differentiable and that
for all z follows from 3.6. Given c E C, define a function8 C -+ C by
f ( z ) = E(c
- 2).
Then by (i) (and the Chain Rule), the functionfis differentiable throughout C and satisfiesf' E -$ Therefore the function F = f.E satisfies F' = 0 whence (by 2.10) F = F(O), that is, for all z E C
E(c - z)E(z) = F(z) = F(0) = E(c)E(O) = E(c). Taking c = zl + z2and z = zl, we get (ii). For positive real x we have from the series definition of E
E(x) > 1
+ x,
so
(1)
lim E(x) = co; X+W
while from (ii) follows that for all z E C 1 = E(0) = E(z)E(-2) (2) and then (1) yields
(3)
lim E ( t ) = lim
t-+-
-t-tW
(0
1 = E(-f)
1
lim - - 0. E(x)
X-Q
Now the coefficients in the series for E are real, so for any z E C we see that
-
E(z) = E(2). In particular E(R) c R and in fact, bearing in mind (2) that E is never zero, for any X E R E(x) = E(x/2 x/2) = [E(x/2)]2> 0.
(4)
+
Therefore E(R) is a connected subset of (0, co), which by (1) and (3) must be all of (0, co). Define functions C, S: R -+ R by C(x) = Re E(ix),
S(x) = Im E(ix).
Now the derivative of the function x -+ E(ix) = C(x) iE'(ix) = iE(ix) = iC(x) - S(x), so C'(x)
(5)
+ iS'(x) = iC(x) - S(x),
-C' = S,
S' = c.
+ iS(x) (exists and) is
62
Power Series and the Exponential Function
Also from (4) and (2) we have for all x C2(x) Ca
(6)
E
R
-
+ S2(x) = IE(ix)la = E(ix)E(ix) = E(ix)E(-ix)
= 1,
+ S a = 1.
The definition of C gives C(X) =
E(ix)
+ E(Gj -- E(ix) + E(-ix) 2
2
an - ix4n N-m n = 1
(4n
-a
- 2)!
+
Observe that for 0 5 x I 2 and n 2 1 4
X2
-<
(4n)!- (4n)(4n - 1)(4n - 2)! < (4n
1
- 2)!
and so
< 1
+
-
,I,-?
Therefore C ( d ) < -4. Since C(0) = Re E(0) = 1, we have that C[O, 1/31 is a connected subset of 08 which contains positives and negatives and hence zero; that is, the compact set [0, <3] n C-l(O) is not void. Let n/2 denote its least element:
(7)
n/2 = min[O,
d]n c-~(o).
Thus
(8)
0<4 2 <
fi
and C(n/2) = 0.
From (8) and (6) we get (9)
S(n/2) =
* 1.
However by ( 5 ) and the definition of n
(10)
S'
=C
> 0 in [0,71/2),
0 3. The Complex Exponential Function
63
so that S is strictly increasing in [0, n/2].Therefore S(51/2) > S(0) = 0 and from (9) we get (1 1) S(71/2) = 1. Putting (8) and (1 1) together:
whence
+ 2 7 4 = E(z)E(2ni) = E(z) Vz E C. Now suppose z = x + iy (x, y E R) is such that E(z) = 1. Then 1 = IE(z)I
(13)
E(z
=
IE(x)E(iy)l = E(x)IE(iy)l = E(x), since E(R) c (0, a)and IE(iy)l = 1 by (6). Since E(0) = 1 and ElR is strictly increasing, it follows that x = 0. To prove that y/2a is an integer it is enough, in view of (13), to show that E(it) # 1 if 0 < f < 2m. Given such a t, we have 0 < t/4 < 4 2 and, since C and S are both ) (1 0)), we have positive in (0, ~ / 2 (by (14)
C(t/4) > 0,
S(f/4) > 0.
+
+
Writing z4 - 1 = (z l)(z - l)(z i)(z - i), shows that k 1, f i are the only fourth roots of 1. Equation (14) shows that E(it/4) = C(f/4) + iS(r/4) is none of these numbers. Therefore E(it) = [E(it/4)I4 is not I.
+
Now if u2 u2 = 1 and u 2 0, u 2 0, then C(n/2)= 0 I u I 1 = C(0) and so by continuity of C there is a t E [0, ~ / 2 such ] that C(f) = u. But S is nonnegative in [0, n/2](by (lo)), so (6) gives S(t)
=
d1 - C2(f) = m = u,
E(it) = u
+ iu.
If u2 + u2 = 1 and u < 0, u 2 0, pick t according to the previous recipe so that E(it) = u - iu and then have by (12)
+
If u2 u2 = I and u < 0, pick t according to one of the previous two recipes so that E(it) = - u - iu and then have E(i(t
+ x ) ) = E(it)E(i?r)= ( - u
- iu)(- 1)
= u
+ iu.
The assertion (v) is thus proven. If w E @\{O}, then IwI E ( 0 , ~= ) E(R), so IwI = E(x) for some x E R; while Iw/lwl I = I , so w/lwl = E(iy) for some y E R by the result (v). Thus E(x + iy) = E(x)E(iy) = w and we have C\{O} c E(@),completing the proof of (vi).
Power Series and the Exponential Function
64
Remarks: If n is a positive integer, then E(l/n) is a positive real number whose nth power is E(l), that is, E(l/n) is the unique positive nth root [E(l)]”* of E(1). If m is any integer, then
E(m/n) = [E(1In)]” = [E(l)]”’”. Consequently, if we follow the universal custom and, in honor of Euler, let e denote the number E(1), then for every rational r
E(r) = e‘. This equality and the homomorphism property of E (the so-called “law of exponents”) explain another universal notation, namely ea, as a name for E(z). Thus
Definition 3.15 e = C:so l/n! and 8 = x:Eozn/n! for every ZEC. This function is called the (complex) exponential function and is sometimes also noted exp. Its restriction to R is called the real exponential function. Definition 3.16 For any a E C and r > 0 the circle of center a and radius r is the curve y : [O, 13 -+ C defined by y ( t ) = a + rea”*’.We denote this curve by C(a, r ) ; this is consistent with the definition in Chapter 0 and the convention of l.ll(i), thanks to 3.14(v). According to 3.14 the real exponential function is strictly increasing and has range exactly (0, co). Consequently there is a function from ( 0 , ~onto ) R which is inverse to the real exponential. The notation and terminology are again traditional :
Definition 3.17 The (natural) logarithm function, noted log, is the function with domain (0,oo) and range R which is inverse to the real exponential. Most of the properties of this function are immediate consequences of 3.14. For example,
Scholium 3.18 Log is strictly increasing and, since its range is R,we have (1)
lim logx =
-00,
x10
lim logx = 00. xtw
Log is continuous and (therefore) differentiable: (2)
log’(x) = lim Y+X
1
y -x
- elOKX logy - log x elOKU
1
I=-
elOgX
since the exponential function is its own derivative. Since the real exponential is an isomorphism of the additive group W onto the multiplicative group
5 3. The Complex Exponential Function
65
(0, co), its inverse log is an isomorphism of the multiplicative group (0, co) onto the additive group R, so
log(xy)
(3)
=
log x
+ logy
for all x , y E (0,~).
We noted in the proof of 3.14 that for positive x we have ex > 1 x > log(1 x ) and so
+
logy < y
-1
+ x. Therefore
for ally > 1.
Since also log l/x = -log x from (3), it follows that, in spite of (I), we have for any positive integer n 1 = 2nx1/"log Xl/an lxl/" log XI = 12nx11nlog
(4) lim x1Inlog x = 0. X I 0
Now the exponential function is not one-to-one in C but it is locally so, and we have the following important theorem on the (local) existence of holomorphic logarithms : Theorem 3.19 I f c E @\{O}, then there is afunction L (= L,) defined in D(c, Icl) by a convergent power series such that eL(z)= z for all z E D(c, Icl). Proof: Evidently the series ZrElzk/k converges for all IzI < 1 and therefore defines a holomorphic function I in D(0, 1). By 3.6 we have
2 zk-1 m
l'(z)
=
=
2
zn.
n=o
k=l
Since
it follows that 1
l'(z) = I-z (1)
(1 - z ) ~ ' ( z = ) 1 VZ E D(0, I),
whence, for the function F(z) = ( 1 - z)e"",
z
E
D(0, I),
the Chain Rules gives ~ ' ( ~1 (1
- .)w(~w(~) (2n w7 c run
11
Power Series and the Exponential Function
66
It follows from 2.10 that F(z)
= F(0) =
s
eo = 1 Vz E D(0, 1);
that is, upon recalling the definition of F,
(2)
1
1 - z = -p = e-l(a
Vz E D(0, 1).
Now given c E @\{O}, for each w E D(c, Icl) apply (2) to
c-w z=-
E
C
-1 -1 [D(c, Icl) - c] = - D(0, Icl) C C
=
D(0, 1)
and get c-w
-W = 1 C
(3)
w
=
- 1 - z = e-I(2) = e - l ( ( c - w ) / c )
C
v w E D(c, Icl).
ce-l(‘C-””C’
Now by 3.14, c = eb for some b E C, so if we define L in D(c, Icl) by
L(w) = b
-l
( y ) , w E D(c, Icl),
then L is a power series centered at c and by (3) satisfies
w = eL(w) Vw E D(c, Icl), as desired.
Corollary 3.20 Thefunction defined by the series IF= zZk-’/(2k- 1) maps the unit disk D(0, 1) univalently onto the strip R x (-44, ~14). Proof: Recall (proof of 3.19) that k-1
converges for all z E D
=
D(0, 1) and satisfies
e-r(z’= 1 - z. (I) Replacing z with -z and dividing the two versions of (I), gives
Therefore
22k - I’ OD
L ( z ) = l(2) - I(-z) = 2
satisfies (2)
e‘ =
+.
k-l
22k-1
z E D,
8 3. The Complex Exponential Function
67
According to 2.5 I) maps D univalently onto H = (0, GO) x R. The univalence of L therefore follows from (2). Now exponentialmaps 88 x {mr/2:m odd integer} into i - R c @\H. Therefore (2) shows that we have L(D) =
U R x ((h- 1M2, (2n + I)+). WZ
As L(D) is connected [1.4 and 1.221, it follows from the last inclusion that L(D) = R x ((2n - 1)r/2,(2n + 1)1T/2)for a single n. Then L(0) = 0 shows that n = 0. Moreover, if w E R x (-r/2,r/2), then ewE H = $(D) = eL(D), that is, ew = eL(z)for some z E D . By periodicity, L(z) - w = 2rki. But L(z) - w E R x (-r, r). Therefore k = 0, w = L(z) and we have shown that L(D) =I R x (-r/2,42). There is an important limit expression for ez which we will derive now. It can serve as the basis for the whole theory, but not quite so smoothly as the power series definition. (See VAN YZEREN [1970] and A. J. MACINTYRE [1949].)
Theorem 3.21 lim,,+m(l + z/n)” exists and equals eZ for each z E C and the convergence is uniform on any compact set. In fact, for all z E C and all positive integers m
Proof: (Cf. BIEHLER[ 18871.) The binomial expansion gives
and so
Two applications of ( 1 ) show that
=
elzl
- (1
+) !k
m
.
Notice that for 2 Ik Im k-1
k(k - 1 ) 2 m ‘
Power Series and the Exponential Function
68
Therefore (2) yields
+
+
N o w m 2 1 meansthatm 1 2 2,(m 1)m 2 2m. Consequentlyk(k 2m for k 2 m + 1 and we can estimate the second sum in (3) thus:
- (l
za7k!
!)"
k(k - 1) l Z l k
-t
k-$+l
- 1)
2
lzlk 2m(k - 2)!
About the constant n we will need very little beyond the inequality (8) of the proof of 3.14. In fact only
Theorem 3.22
I
1/(1
+ xa)dx = 4 4 .
Proof: We have, in the notation of the proof of 3.14, 0 = C(n/2) = Re[eiz/4]a= [Re einl4Ia- [Im eiz/4]a = C2(n/4)
- SS(n/4),
C2(7r/4) = S"44). But S and C are both positive in (0,n/2), so this last equality means that (1)
C(7r/4) = S(44) > 0.
Since C is never zero in [0, n/2), by definition of n, we may form the function T = S/C on [0, n/4] and have from equation ( 5 ) of the proof of 3.14 that
Therefore T is strictly increasing, T(0) = 0 and by ( I ) T(n/4) = 1 . It follows from (2) then that
Exercise 3.23 With the convention Oo = 1, the function x - is~ continuous on [0, 11. (Cf.3.18(4) andrecall the customary definition x - % = e - x l O gfor x x > 0.) Prove the satisfvingly symmetric formula
0 3. The Complex Exponential Function
69
z:=o
Hints: x - = ~ (-I)"@ log x)"/n!.Interchange summation and integration and evaluate ff x" log" (x)dx by repeated integration-by-parts. Exercise 3.24 Show that iff is diferentiable in an open, connected subset R of Q: or W andf' = cf for some constant c, then f ( z ) = f(a)ebCaeCZVa, z E R. Hint: Let g(z) = e - c f and note that ( f - g ) ' = 0 throughout R. Exercise 3.25 Find all continuous homomorphismsf of the additive group W with the multiplicative group T. Hints: Since f is a homomorphism, f(0) = 1. By continuity then there exists a > 0 such that f = b # 0. The homomorphic propertyf(x t) = f ( x ) f ( t ) (all x , t E W) then implies that
1;
+
bf(x) = f ( x ) / ' f ( t ) d t = 0
loa + f(x
x+a
t)dt =
J
Since f is continuous, the last expression is a differentiable function of x . It follows that bfi hence f, is differentiable. We can therefore differentiate the functional equation with respect to t and set t = 0 to learn that f' = cf, where c = f'(0). This leads via 3.24 to f ( x ) = f(0)ecx= ecx. Since I 3 1, we must have Re c = 0, that is, c = iy for some y E R.
If
Exercise 3.26 Let 4: [0, I ] -+ C be continuous and satisfy +(l) = +(O). Show that there exists a continuous 0:C(0, 1) -+ C satisfying (*)
@(e2nlt) =
b(t) Vt E
[0, 11.
Hints: By 3.14(v) and the 2ni-periodicity of the exponential function, the map t 4 e2nitsends [0, I ) one-to-one onto the circle C(0, 1). Hence we can define @ on C(0, 1) by the decree (I)
@(eanlt) =
d ( t ) V t E [0, 1).
The condition + ( I ) = d(0) ensures that in fact (*) holds. Suppose now that @ is not continuous at some zo E C(0, I). This means that there exists an e > 0 and a sequence {z,} c C(0, I ) such that z, -+zo and I@(z,) - O(zo)I 2 e, n = 1, 2, 3,. . (2) For each n 2 1 there is a unique t, E [0, 1) such that z, = eanttnand there is a subsequence of {f,} which converges to some to E [0, I]. Passing to that subsequence, we can simply suppose that {t,} itself converges to to. Then z, = eZnitn + eln%,and so zo = e2% But then I
(9)
@(z,) = +(tn)4 +(to) = @(e2nito)= @(zo),
in violation of (2).
I0
Power Series and the Exponential Function
It is customary to introduce functions cos, sin, tan, and cot by Definition 3.27 The functions cos and sin are defined for all z E C by , I S
cos(z) =
sin(z) =
+ e-l'
2 el"
- e-l'
= =
2 2
n-0
2i
(-1)nZ2n (- l)"z2"+'
(2n
+ l)!
'
The function tan is defined as sinlcos. Since the zeros of cos are evidently the odd integer multiples of 4 2 the domain of tan is C\ri(Z 1/2). The function cot is defined as cos/sin, with the appropriate domain, viz., C \ d .
+
Remarks: The functions C and S in the proof of 3.14 were just cos and sin restricted to R. The functions cos and sin are infinitely differentiable throughout C and cos' = -sin, sin' = cos.
Exercise 3.28 [sinXI I 1x1 for all real x. Hint: For each x # 0 the Mean Value Theorem provides an x' such that
Exercise 3.29 cos x 2 1
- &/.I
for all x in [0,7r/2].
Hints: The function g(x) = cos x + 2xl.1 satisfies g(0) = g(.1/2) = I . Also = 2/.1 - sin. From equation (10) in the proof of 3.14, sin increases on [0, .1/2] from sin(0) = 0 to sin(.1/2) = 1 > 21.1. Therefore g' has a unique zero x o e [0,.1/2] and g' > 0 on [O,xo), g' < 0 on (xo,x/2]. It follows that g is increasing on [0, xo], decreasing on [xo,.1/2] and so min g[O, 421 = g(0) = g(.I/2) = 1 .
g'
Exercise 3.30 sin x 2 2 x / r for all x in [0,.1/2]. Hints: The function h(x) = sin x - 2xl.1 satisfies h(0) = h(.1/2) = 0, h' = cos - 2/n. cos' = -sin is negative on (0,.1/2], so h' decreases from h'(0) = 1 - 2/.1 > 0 to h'(n/2) = -2/.1 c 0. As in the hints of 3.29, it follows that min h[O, 421 = h(0) = h(.1/2) = 0.
8 3. The Complex Exponential Function
71
cnzn has Exercise 3.32 (Parseval’s Formula) If the power series f ( z ) = I;=,o radius of convergence R, then for every 0 I r < R we have
Hints: The functions S,(Z) =
z:lo
cnznsatisfy
so
By 3.3(i), ISN(reit)lis close to If(reit)l uniformly in t E R for large N.
Exercise 3.33 (Liouville) Deduce from the last exercise that i f R bounded in @, then f is constant.
= 00
and f is
Exercise 3.34 Deduce from 3.32 the so-called Cauchy Estimates: With the notation and hypotheses of that exercise, fi we set M ( r ) = f(z)l, then for every non-negative integer k
Exercise 3.35 Suppose that ~~~o CkZk converges for ad z for each r 2 0 set M(r) = sup{If(z)l: IzI = r } . (i) Show that
E
c. Call it f ( z ) and
Hints: For all r > 0 the Cauchy estimates (3.34) give Ickl 5 M(2r) k = 0 , 1 , 2 ,..., (2r)” ’
whence
(ii) (1)
Let c be a non-negative real number. Show that the following boundedness condition on the coeficients off:
-
lim nlc,ll’n I ce
ndm
Power Series and the Exponential Function
72
is equivalent to the following global boundedness condition on f itself:
(2)
M(r)e-(C+8)r is a boundedfunction ofr
E [0, a ),for
Hints: (1) e. (2). Consider any e > 0 and define 6 =
By (1) there exists an N (4)
nlcnll/n <
(c
=
+ ;)e
S(e)
each e > 0. > 1 by
N(e) such that
vn > N.
Moreover by 3.9 we have
Consequently we can also suppose the N above so large that
Multiplying (4) and (5), we get from (3) 6 =c
+e
Vn > N
and so
N
<
(6)
2 IcnII z ~ n+ e(c+8)lal vz
E
C.
n-0
For any n > 0, however, the power series for the exponential function yields
and so there exists M = M ( e ) such that N
(7)
2 1cnlIznI < eslzl
V I Z ~2
M.
n -0
From (6) and (7) If(z)l I 2e(C+8)IZIVlzl 2 M and this proves thatf(z)e-(“+”IZI is bounded in @. As e > 0 is arbitrary, (2) is established.
8 4. Bernoulli Polynomials, Numbers and Functions
73
(2) 3 (1). If the limit superior in (1) exceeds ce, then we can select sufficiently small that (8)
nlc,,]lln > (c
+ 2e)e
e
>0
for infinitely many n.
According to 3.34 we have IcnI 5
(9)
1
r" M(r),
M ( r ) 2 r"lcnl Vr > 0, n = 1, 2, 3,.
If in (9) we choose r
n/(c
=
..
+ 2e) for an n as in (8),
we get by (8)
so M(r)e-(C+8)r 2 esr. This holds for a set of arbitrarily large r and so shows that M(r)e-(C+8)r is not a bounded function of r E [0, a). (iii) Show that lim,,,(n/e)lc,,I1'" is equul to the least element c of [0,a]for which (2) holds.
94
Bernoulli Polynomials, Numbers and Functions
In this section we use the theory of the exponential and logarithm functions to compute Z,mP, k-2n. None of this material is used later. Exercise 3.36 The function L of 3.19 has a continuous extension (call it L also) to B(c, Icl)\{O} which satisfies eL(r)= z for all such z. In fact, the series for L about c converges uniformly on each compact subset of B(c, Icl)\{O}.
Hints: It suffices to deal with c (I)
(2) =
" 1 2
=
1. In proving 3.19 we defined
z E D(0, 1)
zk,
k-1
and saw that (2)
,-Ics)
=
1
-z
V Z E D(0, 1).
By 3.13(ii) this series converges uniformly on each compact subset of D(0, 1)\{1} and so defines a continuous function I on B(0, l)\{l}. By continuity (2) holds for all z in this latter set.
z;=l
Exercise 3.37 (i) sin(nO)/n = (71 - O)/2for all 0 E (0,271) and convergence is uniform on each compact subset of (0,271).
Power Series and the Exponential Function
74
Hints: Consider the logarithm 1 of the previous exercise: e-U) = 1 - z
For Z E B(0, 1)\{1} we have 1 - Z E n(1, 1)\{0} C C\(-w,O]. It follows then from (1) that -1m l(z) is not an odd integer multiple of n, that is, Im 1 maps D(0, I)\{1) into UZ- - ((2k - l)n, (2k 1)n). As a(0,1)\{1) is connected [use 1.2 or 1.221, the range of Im 1 must lie in only one of the intervals ((2k - l)n, (2k + 1 ) ~ ) Since . l(0) = 0, k = 0. For 8 E (0,274 we have sin 8/2 > 0 and so from 1 - ei6 = [e - Mia - eWa]eWa = - i(2 sin 8/2)eM/a
+
= (2 sin 8/2)ei(6-n)/a,
follows
Since (8 - n)/2 E (- n,r), we get from (l), (2) and the above observation about Im 1, -Im l(eie) = (8 - 4 / 2 . Since I(ete)=
z&leike/k,the assertion follows.
m
(ii)
2
nil
(-1~+1-
sin(nx) x = 2 Vx E (-my n
?T)
with convergence uniform on compacta. Hint: Replace 8 by n - x in (i).
Hint: Both sides of the alleged equation are continuous functions of 8 (since the series is uniformly convergent), so it suffices to confirm the equality for 8 E (-n, n). For such 8, integrate (ii) from x = 0 to x = 8 and use the uniform convergence on [ - 181, lei] to interchange sum and integral.
Hint: The series (iii), being uniformly convergent, can be integrated term by term over [ -n, n].
Hint: Subtract (iv) from (iii) and change x to n
- 8.
0 4. Bernoulli Polynomials, Numbers and Functions
75
Exercise 3.38 (i) There exists a unique sequence {P,,}(n = 0, 1,2, . . .) ofpolynomials (called Bernoulli polynomials) such that (1)
Po = 1
(2)
P:+l = P,, Vn 2 0
(3)
S'P,, = O
Vn 2 1.
0
(ii)
The polynomials P,,satisfy in addition
(4)
Pl(Z) = z
(5)
Pa(z)
(6)
P,,(z) = (- l)nP,,(l
-3 za/2 - ~
+
/ 2&
- z)
for all z
Hint: Show that the polynomialsp,(z) (2)s (3). P,,(O)
(8)
P,,(O) = P,,(l) Vn 2 1.
(9)
Pn+l(z + 1) - Pn+l(z) =
for all z
EC
(10) P,(Z
=
n 2 0.
(- l)nP,,(l
- z ) have properties (l),
P,(1) = 0 for all odd n > 1.
(7)
= P,,(1/2) =
E @,
1
Pn(t
r0.21
+ 1)dt -
1
Pn(5)dt
co.21
and all n 2 1. (Use induction.) Zn- 1
+ 1)
=
P,(Z)
+for all z E C and all n 2 (n - l ) !
(iii)
Use (4) and 3.37(i) to deduce that
(11)
P1(r) = --1
w w 2 s k2
1.
Vt €(O, 1)
('
7r k = l
with convergence uniform on compacta. Similarly me ( 5 ) and 3.37(v) to deduce that (I2)
=
1
kzl OD
cos(27rkt) k2
Vt E [O, I].
Evidently the convergence is uniform on [0, I ] and so successive integrations lead to (13)
Pzm(t) = (- 1y-1Pzm+l(t)= (-l)'"-'
2
2
(27r)2m k = 1
cos(27rkt) Vt € [O, 11 kam
-
sin(27rkt)
Vt E [O,13.
(The periodicfunctions on R defined by these series are called the Bernoulli functions.)
76
(iv)
Power Series and the Exponential Function
Define B,, = n!P,,(O) (the so-called Bernoulli numbers) for each n 2 0 and show via (2) that B g n - k for all z E C , n 2 0 ; then use (8) to conclude that
Deduce from ( 1 3) that
1 - (- 1)m-'(27r)amB,m Vm 2 1. 2(2m)! Using this and ( 1 6), deduce the formulas
By breaking (17) into sums over even and odd k, deduce that
Use (1 0), ( 1 5) and ( 1 6) to deduce that 1 n + l )&(N + 2 k" = 2 ( + N
(21)
k-1
for all n, N 2 1.
k-0
Confirm then the following identities
$ k P = NT3 +-+x, Na N k-1
i
k-1
(v)
12
2 ~ k p=l k l a , i k 3 N=4 T N+3 ~N +
k-1
k4
=
NS + N4 + N N -3 - -
5
2
For t E R, z E C with 0 5
3
30'
t I1
N6
NS
5NP
b S = +a- 2+ + - -12.
k-1
Na 12
and 0 c IzI c 27r we have
Hints: Fix z E 6 with IzI < 2w. It follows easily from (1 1)-(14) that for any n2OandtE[OY1]
8 5. Cauchy's Theorem Adumbrated
77
Consequently the series in (23) converges uniformly for limit f ( t ) . Using (2),
t E [0,1].
Call the
for some tn between t and to (Mean Value Theorem). It follows from (24) and (25) t h a t y exists in [0, 11 and satisfiesf ' ( t ) = zf(t). Consequently e-'"f(t) has derivative 0 with respect to t and so (26) f ( t ) = c(z)@ V t E [0, 11,
1;
where c(z) = f(0). Integrate (26) with respect to t. Computing f(t)dt termwise through the series forfand recalling (1) and (3),gives for this integral the value z, whence (23). (vi) Take t = 0 in (23)and recall (7)to get
Transpose -+z, multiply and divide by edzl2to get
and conclude by a change of variable that m
(27) z c o t z
=
2 (-1)"'-
m=o
22"B2"' zam,
(2m)!
Use the identity tan z = cot z
85
z
E
c, 0 <
IZI
< ?1.
- 2 cot 22 to deduce from (27)the series
Cauchy's Theorem Adumbrated
Exercise 3.39 (i) For any a E C, r > 0 d5
- 27ri Vz E D(a, r ) .
Hint: Take g = I , y = C(a, r ) in the series appearing in 3.8 (and recall 2.15). (ii) Let f be differentiable and f' be continuous in a neighborhood of a(a,r ) . Show that
whence, via 3.8, f is locally of power series type in D(a, r).
Power Series and the Exponential Function
78
Hints: Fix such a z and form
G(t) =
1
C(a.r)
f’(z
+ t ( l - z))&
(0 It
5
1).
Show that F is differentiable and that F‘ = G, thus :
d since (Chain Rule) -f(z + T(( - z)) = f ’ ( z + .(I - z))(f - z). Now make d7 d the obvious appraisals of the last integrand. Note also that - f ( z + t(5 - z)) dl = ff‘(z t(5 - z)), so by 2.10(ii), G = 0. It follows that F(l) = F(0). Use (i) to evaluate F(0). Remarks: The proof in (ii) works in any convex set to show that
+
whenever U is open and convex, f E H(U), f’ is continuous in U,and y is a piecewise smooth loop in U. [Convexityis needed so that the points z + t(6 - z ) (0 It I1) remain in U.] Notice that according to 2.14 and 2.15 the integral on the left in (**) has derivative 0 as a function of z and so by 2.10(iv) is constant in each component of C\y. In the next chapter we will prove that it is always an integer multiple of 2ni. Formula (**) then looks like (*). It is in fact valid for a much larger class of open sets than the convex ones and can be proved without the a priori assumption of the continuity off’. p h a t continuity and more of course follow from (**) via 3.8.1 This is the theme of Chapters X and V respectively. New techniques, not at all as straightforward and simple as those in 3.39, will9be required. Their creation was a major advance in the foundations of the subject, which prior to 1900 had always hypothesized continuity off’, in addition to its existence.
Q6
Holomorphic Logarithms Previewed Following 3.17 and tradition we shall call any function L which satisfies eL(Z) =z for all z in its domain, a logarithm function. Thanks to 3.14(vi), such functions
6. Holomorphic Logarithms Previewed
79
exist throughout @\{O}, but what is wanted and turns out to be of paramount importance and utility are continuous logarithms. Their existence on a given set is intimately tied to the geometry of the set, i.e., to its disposition in @. This will all be thoroughly explored in the next chapter, but here are a few elementary cases.
Exercise 3.40 Let U,, Ua be open subsets of @\{O} such that Ul n Ua is connected. Show that ifthere exists a continuous logarithmL, on U,for eachj , then there exists a continuous logarithm on U, U U,. Hint: Show that L1 - La is constant in U , n Ua. (Cf. the proof of 4.67(ii).) Exercise 3.41 (Cf. 4.60) Prove that a continuous logarithm is necessarily holomorphic. More precisely, prove that i f L is a continuous logarithm in an open subset U of @\{O}, then L is holomorphic and L'(z) = l/z for every z E U. Hints: Imitate the argument in 3.18. Alternatively, use 3.19 to get local holomorphic logarithms and use continuity to show that locally L differs only by constants from such functions. Exercise 3.42 (i) Prove that in every open half-plane which does not contain 0 there is a holomorphic logarithm. Hints: It suffices to consider H = {z E @: Re z > O}. For each positive integer n there is a holomorphic logarithm L, in D(n, n), by 3.19. Then [L,+ - L,]/2ni is continuous and integer-valued in D(n + 1, n + 1 ) n D(n, n) = D(n, n). Therefore, by adding an appropriate (constant) integer multiple of 2ni to L, +, we can assume that L, + extends L,. Do this successively for each n = 1,2,3, . . . It is then possible to define the desired logarithm L in H by the simple decree L = L, in D(n, n), for every n, bearing in mind that U;=l D(n, n) = H. (ii) Prove that there is a holomorphic logarithm in any slit-plane S = @\{tu:t I0},u E @\{O}. Show moreover that any such function dflers only by an additive constant from that defined by the integral jlu,z, d [ / &z E S.
,
Hints: S = H 1 u H , u H3 where H, are open half-planes such that HI n Ha and Hz n H 3 are connected while H I n H3 is void. Part (i) provides holomorphic logarithms L, in each H j . Add appropriate constants to these to synthesize a single holomorphic logarithm L in H1 u H , u H3, as in 3.40. (Cf. with the proof of 4.67(iii).) From eL.")= 5 and the Chain Rule follows L'(5) = 1/(. Observing that S is starlike with respect to u, it follows then from 2.10 that L(z) - L(u) = d5/& for all z E S.[It is easy to see-from the proof of 5.2, e.g.-that the existence of L can also be secured by means of this integral.] (iii) Show that in C\[O, 03) there is a unique holomorphic logarithm L such that Im L(z) E (0,27r) for all z E C\[O, 03). Thus for any r > 0 and 0 E (0,2n), ,!,(refo)= log r + iB.
Icu,e,
Hints: I f 1 is any holomorphic logarithm in @\[O, co)(such exist by (ii)), then
Power Series and the Exponential Function
80
ei(t' = z 4 [0,00) implies that Im l(z) # 2vn for any integer n. Since Im I is a continuous real-valued function and @\[O, a)is connected (starlike), the set Im I(@\[O, co)) is a connected subset of J l;= - (2nn, 2n(n + 1)) and so lies wholly in (2m, 2v(n + 1)) for some one integer n. Set L = 1 - 2nin. Alternatively, notice that [I(reie)- log r - id]/2ni is a continuous, integer-valued function of (r, 0) in the connected set (0, a)x (0,27r).
Remark 3.43: The function L above is customarily called the Principal Branch of the Logarithm in C\[O, a).There is similarly a unique holomorphic logarithm in @\(- a,01 which assigns to reio the value log r + id whenever r > 0 and -T < 8 < n. It is called the Principal Branch of the Logarithm in @\(03, 01.
Exercise 3.44 Let a, b E R with a < b and consider 4(z) = ( z - ia)/(z - ib)for z E C\{ib} and the Principal Branch 1 of the Logarithm in @\(-a,01. (i) Describe the mapping properties of 4. Show, in particular, that 4 maps the open right half-plane onto itselS. (CJ 2.5.) (ii) Show that for all z in the open right half-plane (*)
l(z
- ia) - l(z - ib) - I(xb)z - ia
= 0.
Hints: All the parenthetic terms in (*) lie in the open right half-plane, so each of the 1 values is well-defined and falls into R x (-n/2,n/2). Therefore the left-hand side of (*) lies in R x (- 3v/2, 3n/2). Since this number exponentiates to 1, it is an integer multiple of 2ni. The only such in R x (- 3n/2, 3n/2) is 0. (iii) If Re z > 0, then Im Z(~(Z))
=
jab dt. Iz - itla
Hint: el(') = z and the Chain Rule show that I'(z) l(z - ia) - l(z - ib) =
/
[P-
-
5-'d4 =
fa.# Ibl
= l/z
and so (see 2.10)
* idt ja a.
Consequently, using (ii)
Notes to Chapter III The history and development of the ideas in this chapter are well detailed in the encyclopedia article of PRINGSHEIM, FABER and MOLK[191 I]. 3.3(iii) is due to CAUCHY 118211, p. 286. It was rediscovered by HADAMARD [1888], p. 259 and [1892b], pp. 107-108. It is therefore customarily called the Cauchy-Hadamard radius of convergence formula. All sorts of behavior of a power series
z&, c,z"
are possible on its circle of
Notes to Chapter 111
81
convergence: for example, the series may converge uniformly on this circle but not absolutely; an example due to FEJBR[ 19171 is found on p. 122 of HILLE [1959] and one due to Hardy in LANDAU [1929a] or NOVINGER [1975b]. See also GAIER[ 19531. The series may converge at every point of this circle but represent a discontinuous function there (SIERPINSKI [1916]). We may have divergence at every point of this circle and yet have c,zn -+ 0 for each z on the circle and it is also possible that the series converge at exactly one point on this circle. Examples of the latter two phenomena, due to Lusin and Sierpinski respectively, can also be found in LANDAU [1929a]. See also NEDER[1920], MAZURKIEWICZ [1922b], HERZOG[1953-541, DVORETSKY and E R D ~[S19551, and VIJAYARAGHAVAN [19471. Two elementary and especially important facts about power series are conspicuously absent from the text. These are the theorem on multiplication of power series and the existence of a power series expansion centered at any point within the (open) disk of convergence of a given power series. The reader can easily formulate and prove these as exercises now or find them in BROMWICH [1926] or KNOPP[1951]. However, they will not be needed before Chapter V and there they will appear as effortless spin-off from other results. Similar remarks apply to the theorems affirming that the composition of two or the uniform limit of a sequence of power series is again a power series. My account of 3.5 and 3.6 was influenced by APOSTOL [1952]. In connection with the definition of radius of convergence contained in the proof of 3.3, there is the following curious result: If 8, # E [0,24, (8 - #)/27~ is irrational but algebraic and the two sets {Re(cnefne)}, {Re(c,efn')} are bounded, then the series 2 C,Z" has radius of convergence at least 1. See TEISSIER DU CROS [ 19441 and VALIRON[ 1 9441,
I have followed PRINCSHEIM [I9251 and RUDIN[1974] in the concise treatment of the exponential function. Other interesting approaches occur in WICNER [ 19521, EBERLEIN [1954], [1960], ROBISON [I9681 and chapter 11 of WEIL[1976].
A very nice alternative proof of 3.25 can be found on page 35 of GUICHARDET [1968]. Yet another proof runs thus: use an analog of 4.1 to find a continuous function 4: R + @ such that f = eb and d(0) = 0. Deduce that 4 is additive, whence 4 ( r ) = r#l) for all rational r, whence by continuity +(x) = cx for all x E R (c = #(I)). Though proofs of 3.32 appear in GUTZMER [ 18871, [I 8881, [ 18891, the result predates this; he acknowledges the priority of A. Harnack, but in fact the formula goes back to an I806 memoir of M. A. PARSEVAL (see Q 23 of BURKHARDT [1914]) and is customarily referred to in the literature as Parseval's formula. It is valid (with the same proof as given in the text) for bilateral series as well. See Chapter XI. The Cauchy estimates, valid also for bilateral series, date from 1831 and were discovered independently in 1841 by WEIERSTRASS (Werke I, pp. 67-74 and
82
Power Series and the Exponential Function
11, pp. 224-226), who gave an integral-free treatment. On the latter see also pp. 278,280, 606 of PRINCSHEIM [I9251 and MONTEL [1936].
3.33 is due, curiously, to CAUCHY [1844]-see BURKHARDT [1914], p. 1014; its ultimate generalization is 12.17, Picard's Little Theorem. For an improvement in 3.34 see TAMMI[1957] and for material related to 3.35(i) see SIDON[1927], LANDAU [1929a], 9 4 and TOMIC[1962]. Embryonic versions of 3.35(ii),(iii) were [1893] and further elucidated by LINDEL~F [1903] discovered by HADAMARD and PRINGSHEIM [1902], [1904]. The numbers e and ?I introduced in this chapter have many remarkable properties. For example, each is transcendental, that is, satisfies no polynomial equation with rational coefficients. A. BAKER[1975], pp. 4, 5 gives nice short proofs of both these facts, as well as the relevant historical references. The appendix of MAHLER [1976] gives a unified treatment of many of the beautiful classical proofs, together with more history, and HESSENBERG [I9121 is a completely self-contained account of the classical proofs. For other elementary and ab initio treatments of the sums 3.38(17) see K. S. WILLIAMS [1971], STARK[1972], [I9741 and BERNDT[1975]. The latter two papers contain extensive bibliographies, as does ELY[1882]. See also GOULD [I9721 and pp. 350-364, vol. I of LEVEQUE[1974]. SAALSCHUTZ [I8931 and NIELSEN[ 19231 are exhaustive treatises. These formulas were first deduced by Euler. (See AYOUB [ 19741.) Odd powers will be treated in Chapter XIV. The sum IFal (k > 1) is the value at k of an important function which is holomorphic in the open halfplane H = { z E @: Re z > I}. This is Riemann's Zeta function, about which there is an enormous literature. Any of the basic texts in the bibliography discuss the elementary theory of this function and in addition several (e.g., VEECH[1967]) discuss its role in the proof of the Prime Number Theorem. One n V 2= e--E'ogn converges abeasily checks that the series ( ( 2 ) = solutely in Hand uniformly on each compact subset. From the results of Chapter VII (or from 5.44) it follows that f; is indeed holomorphic in H.(This series is a typical example of what are called Dirichlet series, another extensive chapter of function theory with which this book will not deal at all.)
z;=l
z;==l
For recent literature on the sums 3.38(21) see pp. 335-339, vol. I of LEVEQUE [ 19741. The material of 3.38 can also be treated with the aid of Cauchy's Residue Theorem (Chapter XI).For such a treatment see Q 5, chapter I11 of BEHNKEand [I9651 or pp. 32-37 of LINDEL~F [1905]. For a complete history of who SOMMER did what and when, more relations and alternative developments, of the material of Q 4 see BURKHARDT [1914], Q 7.
83
Chapter IV The Index and Some Plane Topology 01
Introduction
In this chapter we complete the preliminary investigations of Chapter I on the topology of the plane. The chief tools are the index and deformation and extension techniques. The former rests squarely on the theory of the exponential function developed in the last chapter.
02
Curves Winding around Points
The exponential function makes clear how to formalize the notion of “the number of times the loop y in @\{O} winds counterclockwise around 0”: we have only to write y = lyleis, where 8 is continuous and real-valued. Evidently the function 8 tells how much “angle y sweeps out.” Our first theorem along these lines is a bit more general.
Theorem 4.1 Let y : [a, b] -+ C be continuous, zo a complex number not on y. Then there is a disk Do about zo disjoint from y and a continuouf function +: [a, b] x Do -+ 42 such that y ( t ) - z = eb(t*z) for all (t, z ) E [a, b] x Do. Moreover, for each z E Do and any such function +, the function t --+ +(t, z ) enjoys at each point of [a, b] whatever smoothness properties y does. Proof: Select r > 0 so that D(zo, 2r) is disjoint from y and let Do = D(zo,r). Use uniform continuity of y to select a = to < tl < . . . < t, = b so that y [ t j - l , t,] has diameter less than r. Define r: [a, b] x Do C\{O} by r(r,2 ) = y ( t ) - z and consider the disks D, = D(I’(r,-l, zo),2r), ( j = I , 2,. . ., n). Notice that IF(?, zo)l = I y ( t ) - zoI 2 2r for every t, by definition of r, so 0 4 D,.Moreover I’maps [t,-,, t,] x Do into D,; for if (t, z) E [?,- 1, t,] x Do, then --f
IW, z ) - w , - 1 9
zo>l 5 IY(t)
- Y(t,-l)l + Iz - ZOI + 1.z - zol
I diametery[t,-,, t,]
+ r = 2r.
By 3.19 there exists a continuous logarithm L , in D, and we may form 4, = L, 0 I’ on [ t j - l , t,] x Do. This function is continuous on [t,-,, t,] x Do. Notice and so that for every z E Do,F(t,, z ) E D j n D j + l eL,(IVj.a))
=
r(r,,z) = e L j + l ( W j ~ ~ ) )
whence by 3.14(iii)
L,(W,, z)) - L, + m t , ,
ZN
=
2riNAz)
The Index and Some Plane Topology
84
for some integer N,(z); that is,
(*I
+At,, 2)
- +j+dtj, 4 = 2wiNAz).
The continuous integer-valued function Njmaps the connected set Do onto a connected subset of integers. As the only such sets of integers are single points, N j is constant on Do. We can then finally define on
+
n
+
Then is well-defined and continuous (by (*)) and in each satisfies
t j ] x Do,
-
e@(tA= e Y t A = eL,l(lYt,s))= r ( t , 2) = y ( t ) z. For (7,z ) E [a, b] x Do, a logarithm L can be defined by a power series in a neighborhood of Y(T) - z (3.19). As above, it follows from 3.14(iii) that in a connected neighborhood of 7 , +(t, z ) differs only by a constant from L(y(t) - z). The latter function o f t has (thanks to the Chain Rule and the power series form of L) any differentiability properties near T which y does; hence so does +.
Definition 4.2 If y : [a, b] + C is any loop and z any point not on y, then we define the (circulation) index or order or winding number of y with respect to z, noted Ind,(z), as [+(b) - + ( a ) ] / 2 ~for i any continuous logarithm on [a, b] of the function y - z. (Notice that such exist by the last theorem.)
+
+
Corollary 4.3 I f y : [a, b] -+C is a loop, then Ind, is a well-defined, continuous, integer-valued function on C\y[a, b] which is (therefore) constant on the components of C\y[a, b]. Moreover, Ind, is 0 on the unbounded component of @\r[a,bl. Proof: To see that Ind,(zo) is well-defined for each zo E C\y[u, b ] , let +, 4: [a, b] --f C be two continuous logarithms of the function y - z o : eb = y - zo = e*. Then [+ - +]/2si is a continuous integer-valued (by 3.14(iii)) function on the connected set [a, b], and so is constant. Thus +(b) - +(a) = #(b) - #(a). To see that Ind,(zo) is an integer, note that e@(b)-aKa)
= eb(b) &a) =
/e
(Ye4 - zo)/o@) - 2 0 )
= 1
(since y is closed), so [+(b) - +(a)]/2siis an integer. Next, given zo E C\y[a, 61, the last theorem provides a disk Do about zo and a continuous +: [a,b] x Do+ C which satisfies e@('".l) = y ( t ) - z for all (t, z) E [a,b] x Do.Then for all z E Do we have Ind,(z) = [+(b,z) - +(a, 2)]/27ri, showing that Ind, is continuous at
!j 2. Curves Winding around Points
85
zo. As noted before, it follows that the continuous integer-valued function Ind, is constant on connected subsets of its domain. Also, if we consider a fixed 1.1 > suply[a, b]l and (3.19) a continuous logarithm L in the open disk D1 = D(- 1, l), then we may form $ ( t ) = L(z-ly(t) - 1). If we write z = ew for some complex number w (see 3.14(vi)) and set = $ w, then emct)= = e”[z-ly(t) - I] = y ( t ) - z, so by definition of the index, Ind,(z) = [+(b) - +(a)]/2wi = [$(b) - $(a)]/2ni = 0 (since y(b) = ~ ( a ) )Thus . Ind,(z) vanishes for all sufficiently large IzI. Since {z E C : IzI > suply[a,b]l} is a connected subset of @\y[a,b] (for example, it is the image of D(0, 1)\{0} under z + c/z for appropriate constant c), it lies in some component of @\y[a,b]. All other components, being disjoint from this one, lie in the disk of radius suply[a,b]l and so are bounded. Thus C\y[a,b] has exactly one unbounded component and Ind, vanishes on it.
+
Corollary 4.4
If y : [a, b] -+
Ind,(z) = 27ri
+
C is a piecewise smooth loop, then
I J’,dt f -z
V Z E C\y[a, b].
Proof: Let zo E C\y[a, b]. By 4.1 there is a continuous +: [a, b] +-C such that y - zo = ed and a partition a = to < tl < - . .< t, = b such that both y and are smooth on each [t,-l, t,]. Differentiating the relation y - zo = e@,gives
+
y’ = (y
- zo)’ = +’e@ = +‘[y - zo] in [t,-l, t , ] , j = 1, 2,. . ., n.
Therefore
= Ind,(zo).
Example 4.5 Let a E C, s > 0 and set b = Re a, c (c, c s). Then
+
=
Im a, Q = (b, b
+ s) x
Indao(z) = 1 Vz E Q.
Proof: (PRINGSHEIM [1896a]) The very definition o f index shows that for any loop y, any w E C and any z not on y we have Ind,-,(z
- w) = Ind,(z).
The Index and Some Plane Topology
86
(In either case logarithms of y - z are involved.) Moreover, a( Q - w) = aQ - w and so without loss of generality we may replace Q by any Q - w. Taking w = u + +s(l + i), it therefore suffices to consider the case where u = -+s(l + i ) , that is, with r = 3s
Q
=
( - r , r ) x ( - r , r).
By 4.3 it then suffices to establish that Indao(0) = 1. Let f be the function in @\{O) defined by f ( z ) = l/z. Then by 4.4 and 2.9 27ri Indao(0) =
bp
f
=
j
Ir(- 1 - O.r(l- 1))
+
=
f
+
6 r ( 1 + t>,r(- 1 + 111f
Iol
1 , 1 - t ) . r ( l + 01
+
f
L(-l+t),r(-l-t)]
f
- t)r(-l - i ) + tr(1 - i))2rdt
f((1
+ jolf((l - t)r(l - i) + tr(1 + i))2ridt + jolf((l
- t>r(l
+ i ) + tr(-l + i>)(-2r)dt
+ jolf((l - t)r(-1 + i ) + tr(-1 = 2r
1
f(r(-
1
- i) + 2rt)dt
+ 2riIo1f ( r ( 1 - i) + 2rit)dr - 2r/
1
f(r(1
+ i ) - 2rt)dt
0
- 2 r i C f(r(-1
+ i) - 2rit)dt
- i))(-2ri)dt
8 2. Curves Winding around Points
87
Combining the first and second and the third and fourth terms, dt u+i -4 du
=
l 1 8ij0 u a d u ,
+
since u/(ua 1) is an odd function and I/(ua assertion now follows from 3.22.
+ 1) is an even function. The
According to 4.3, Ind,(z) is a continuous function of z. We next show that it is also a continuous function of y. Exercise 4.6 (i) Let y o : [a, b] -+ C be a loop and z E C\yo. Then there exists a positive 6 = 6(z, yo) with this property: for any loop y l : [a, b] -+ C with / y o - yll c 6 on [a, b], we have z E C\yl and (*)
Ind,,(z) = Ind,,(z).
Hints: As in the proof of 4.5, replacing yo by yo - z and y1 by y1 - z , enables us to assume that z = 0. Then infly&, b]l is positive. This number has the properties sought for 6. For if y1 : [a, b] -+ C is a loop satisfying Iyo - yll < 6, then Iyo - yll < lyol on [a, b]. In particular, y1 never takes the value 0: 0 E C\y,. Also the quotient y = yl/yo is a well-defined continuous function, in fact a loop, which maps [a, b] into D(1, 1). Since C\D(l, 1) is connected and contains 0, it follows from 4.3 that (1)
Ind,(O)
=
0.
But it is clear from the definition of index in terms of logarithms that (2)
Ind,,,(O) = Ind,,(O)
+ Ind,(O).
Since yoy = y l , the assertion (*) follows from (1) and (2). Formulate and prove a theorem on the joint continuity of Ind,(z) as a (ii) function of the pair ( y , z). Exercise 4.7 (i) r f F: [a, b] + C is a simple loop, then (a, b).
r is bicontinuous on
Hints: We have to show that if r(t,) + r ( t ) for some t,, t E (a, b), then t, + t. It suffices to show that t is the only cluster point of {t,} in [a,b]. If to E [a, b] and t,, --+ to, then by continuity r(to)= F(t). Since {t, to} c [a, b) or (1, to} c (a, 61 and since r is one-to-one on [a, b) and on (a, 61, it follows that to = t. (ii) If rl, are two simple loops with the same range J and f is continuous and zero-free on J , then l~ndf~rl(o)l = lIndf~rs(0)l.
The Index and Some Plane Topology
88
Hints: Let the parameter interval of I?, be [a,, b,]. Let logarithm for f I?,. Then the definition
$1
be a continuous
0
(1)
$(t
+ n(b1 - ail) = +i(t) + n[+i(bi) - +i(ai)l,
provides a continuous extension of #, to R. Select tl
E
t E [a,, bil,
n Ez
[a,, b,] such that
(2) .ri(ti)= I'a(as). Extend I'l by periodicity to R and set r(t)= r,(t), tl I t Itl
+
(61
- a,).
We have
f r(t)= e@(*),
t1 I t 5
0
tl
+
(61
- al)
and so
+
27riInd,or(0) = $0,
+1(61)
(61
- a,)) - $(td
- $,(a,)
=
27riInd,,rl(0).
Therefore it sufficesto prove the assertion with rl replaced by I', the upshot of which is that we can assume (3)
ri(ai) =
ra(4-
Now by (i), ,'1 is a homeomorphism of (aj, 6,) onto J\I',(a,). By (3) we may therefore form I';l o rl and have a homeomorphism of (a,, 61) onto (a2,b2). This extends by 1.46 to a homeomorphism I,4 of [a,, b,] onto [a2,b2]. Thus rl = Fa o 4 and if +1 is a continuous logarithm for f 0 Fa then f I'2 = e", f I?, = e*aO*,whence 0
0
h i Ind,orl(0) = $a
- $2 0 +(ad = [+Ah) - $a(aa)I, since I,4 maps endpoints to endpoints,
*
=
0
f 2ni Ind,orB(0).
Definition 4.8 (i) If yo, y , : [a, b] -+ A c C are loops, we say yo and y1 are A-homologous or homologous in A if Ind,,(z) = Ind,,(z) for every z E C\A. If y1 (as above) is constant, we say yo is A-nullhomologous or nullhomo(ii) logous in A , i.e., if Ind,,(z) = 0 for every z E @\A. (iii) If every loop in A is nullhomologous in A , we call A homologicallyconnected. We close this section with a technical result which we will need later: < -= R},y:[O,I]-+ Exercise4.9 L e t O < r < R < o o , S = { z ~ @ : R e z > O , rIzI {z E C: Re z > 0} a curve such that Iy(0)l = r, Iy(l)l = R. If C is a component of S\y, show that C does not meet both the negative and the positive y-axis.
9 2. Curves Winding around Points
89
Hints: Since y is a compact subset of the open right half-plane, if C meets both the positive and negative y-axis, then C is a relative neighborhood in S of both [ir,iR] and [-ir, -iR]. It follows easily, via 1.28, that there exists a polygon rl which joins - ir to ir and lies, except for iir, in C. We may suppose the domain of rl to be [0, I ] and then define
r,(t)= retntIa
t E [ I , 31,
Since rl lies in C u { i ir} c s\y, we see that I’3 c
@\[Z(r,R)\yI
=
P\Z(r,R)I u Y
=
a(r,R)\y.The set
W ,r i u y u [ C \ W , R)I
!
is connected (by 1.3), unbounded and lies in C\r3. Consequently Indr,(c) = 0 VC E D(0, r). For c E (- r, 0) we compute 0
=
2niInd,,(c) =
s,,d” z
c
dz
dz
However F6 and -r4 are each closed curves and c lies in an open connected unbounded subset of C disjoint from each, viz., the open left half-plane. Consequently
Using this in (1) gives
dz
dz
= 2ni Indco,,,(0), by 4.3.
This is an obvious contradiction.
dz
2 - c
- 2ni Ind,,,,,,(c),
by 4.4
The Index and Some Plane Topology
90
03
Homotopy and tbe Index
Definition 4.10 (i) Let S c R", fo,fl:S-+ A c C continuous functions. An A-homotopy or a homotopy in A of fo withf, is a continuous function h: [0,1] x S+ A such that
(ii)
We sometimes write &(x) for h(t, x). We say fois A-homotopic to fi or homotopic in A tofl if such an h exists. Iffr is constant, we say fois A-nullhomotopic or nullhomotopic in A.
Definition 4.11 (i) Let [a, b] c 02, yo, y l : [a,b] + A c C be loops. An Aloophomotopy or a loophomotopy in A of yo with y1 is an A-homotopy h such that each curve yc(x) = h(r, x) is a loop, i.e., h(t, a) = h(t, b) V t E [0, 11.
(ii) (iii)
We say yo is A-loophomotopic to y1 or loophomotopic in A to y1 if such an h exists. If y1 is constant, we say yo is A-loopnullhomotopic or loopnullhomotopic in A. Call A loophomotopically-connected if every loop in A is loopnullhomotopic in A.
Remarks: It is the work of a moment to confirm that both these notions define equivalence relations. Thus in particular the roles of foand fl(resp., yo and yl) can be interchanged above without affecting the definitions and so symmetric terminology like "fo, flare A-homotopic," etc., is employed.
Theorem 4.12 Let S be a subset of C , yo, y l : [a,b] --f S loops which are loophomotopic in S. Then yo, y1 are S-homologous. Proof: Let H be a loophomotopy in S of yo with y l . Then for each T E [0, I ] the function y r : [a,b] -+ S defined by n ( t ) = H(T,t ) is a loop and T -+ yI is a continuous map of [0, I ] into C[a,b]. It follows easily then from 4.6 that, for each z E C\S,T --f IndJz) is a continuous function. Since it is integer-valued and its domain is the connected set [0, I ] , It is constant. Thus Ind,,(z) = Jnd,,(z). This holds for every z E C\Sand therefore says that yo and y1 are S-homologous.
Exercise 4.13 Prove the converse of 4. I2 in the special case S = Q=\{O}. That is, show that if yo, y1 : [a,b] --f C\{O} are homologous in C\{O}, i.e., have the same index with respect to 0, then yo and y1 are loophomotopic in C\{O}.
0 3. Homotopy and the Index
91
Hints: If y,(t) = e"P (j= 0, l ) , define H : [0,1] x [a,b]+ C\{O} by H(T, t ) = ethi(t)+(l-r)ho(t). Then H(0, t ) = yo(t),H ( l , t ) = y,(t) for all t E [a, b],and for each T E [O, 11 [Thdl) + (1 - 7)hO(l)l - [Th,(O) + ( 1 - 7)h0(0)1 = dhi(1) - h(0)I + ( 1 - 7)[ho(l)- ho(011 = 2ni7 Ind,,(O) 2ni( 1 - T ) Ind,,(O) = 2?ri Ind,(O),
+
an integer multiple of 2ni, so H(T, t ) is a closed curve.
Exercise 4.14 If n Ind,(z).
y
is a loop and z E C\y, then for every integer n, Ind,. ,(z) =
Exercise 4.15 Let U be A(r, R)for some 0 Ir IR < 00. (i) Show that if yo, y, are two loops in U and Ind,(O) = Ind,,(O), then yo and y1 are U-loophomotopic. Hints: The proof offered for 4.13 works here too. Just note that ho, hl satisfy log r < Re h, < log R and so the same is true for each Thl + ( 1 - ~ ) h , , showing that the range of H is indeed in U. (ii) Show that i f y o , y1 are two loops in U,then there exist integers no, n,, not both 0, such that no*yo is U-loophomotopicto nl*yl. Hints: If Ind,,(O) equals Ind,,(O), then take no = nl = 1 and cite (i). Otherwise, not both of the integers no = Ind,,(O) and n, = Ind,(O) are 0 and according to 4.14 we have Ind,o.~o(0)= Ind,, .,,(O). So again (i) may be applied. Exercise 4.16 Every starlike subset of C is loophomotopically-connected. Hint: If S is starlike with respect to zo and y : [a, b] --f S is a loop, then H(t, T )
= (1
- t)y(7)
+ t ~ o , (t,
7)
E
[0, 11 x [a,b]
is obviously a loophomotopy of y with the constant zo. By starlikeness of S the range of H i s in S. We close this section with the computation of another specific index which we will need later.
+ i, r > 0 and - .),-rc + 3, rc + 3, rc - .), -rc - 31.
Exercise 4.17 Let c y =
[-re
= 1
Show that 0 E C\y and Ind,(O) = I.
Hints: Define r = [-c/2, Z/2, 4 2 , -Z/2, -c/2] and h : [0, 11 x C -+ C by h(s, z) = Re z - s Im z + i[s/2r + 1 - s] Im z. Show that h(0, y ) = y, h(1, y ) = I' and 0 4 h([O, I ] x y). It follows from 4.12 that Ind,(O) = Indr(0), and the latter is 1 by 4.5.
The Index and Some Plane Topology
92
Q4
Existence of Continuous Logarithms
Theorem 4.18 (Abstract Monodromy Theorem) Let U be an open subset of C andf: U --f C\{O} a continuous function. Then the following are equivalent: (i) Ind,.,(O) = Ofor every loop y in U. (ii) f has a continuous logarithm in U.
Proof: (ii) z-(i). Trivial. (i) s (ii). The components of U inherit property (i) and are open. Since we have only to manufacture the logarithm i n each component, let us assume that U is connected. Fix zo E U and let wo E C satisfy eWo= f(zo). For each z E U let yz: [0, 11 + U be a curve joining zo to z. (See 1.28.) Let $z be a continuous logarithm for f ya: 0
(1)
f o y z = e@n, Z E U.
(See 4.1.) Evidently we may require that (2)
$,(O)
=
wo
VZ€
u.
We define O(z) to be $z( 1) and have edl(z)
=
e".'l'
2)f ( y z ( l ) ) = f(z),
by definition of yz.
So only continuity of 0 has to be established. To this end, fix z1E U and pick r > 0 so small that b(zl, r ) c U andf(n(zl, r ) ) c D(f(zl), If(zl)l). Let L be a continuous logarithm in the latter disk. (See 3.19.)We may require that
(3)
Uf(z1)) = $Zl(l),
since both these numbers are logarithms of f(zl). Now, given z E D(z,, r ) , let y = [zl, z] and consider the loop 'I defined by
(4)
r(t)=
I I
yz(l - t ) 0 5 t I, 1 yzl(t - 1) 1 It I, 2 fit-2) 21,t<3
and the function $ defined by (5)
+(t) =
+A1 - t )
O l t l l
- 1)
l I t 1 2
+zAr
L(f(y(t - 2))) 2 I2
I, 3.
Conditions (2) and (3)ensure that $ is consistently defined at r = 1 and t = 2. Evidently is continuous on each of the intervals [0, 11, [ I , 21, [2, 31. Therefore $ is continuous. It is evidently a logarithm forfo I'. By hypothesis therefore
+
0 = 211i IndfOr(O)= $(3) - $(O) = L(f(z)) -,)I(,$
@(4= +Z(l)
= W(Z)).
8 4. Existence of Continuous Logarithms
93
This shows that 0 coincides with L 0 f i n D(zl, r ) and hence is continuous in that disk.
Exercise 4.19 If U is an open subset of C andf: U +-C\{O} has a continuous nth root $,,for every positive integer n (or even for just an injnite set of n), then f has a continuous logarithm.
Hints: Let y be any loop in U and +,, a continuous logarithm for $, n+,, is a continuous logarithm for f o y and so
0
y . Then
Indlo,(0) = n Ind,n,,(0). Since both indexes are integers and n does not feature on the left side, the index on the right cannot be non-zero for large n. It follows that Ind,,,(O) = 0. Now appeal to 4.18.
Corollary 4.20 Let U be an open subset of C. I f U is loophomotopically-connected, in particular (see 4.16) if U is starlike, then every continuous, zero-free function on U has a continuous logarithm. Proof: Let f : U - t @\{O} be continuous and let y : [a, b] -+ C be any loop in U. By hypothesis there is a homotopy h : [0, 11 x [a,b] + U of y with a constant. Then H = f 0 h is a homotopy in f(U)c C\{O} off 0 y with a constant. Consequently by 4.12, Ind,,,(O) = 0. Now cite 4.18.
Example 4.21 Let K be either [- 1, I ] x [- 1, I ] or D(0, 1). Then any continuous, zero-free function on K has a continuous logarithm. Proof: Let (I = (-1, 1) x ( - I , 1) or D(0, 1) according as K is [-1, I ] x [ - 1, I ] or D(0, 1) and let continuous f : K + C\{O} be given. 1.44 furnishes an extension F: C + C off. Then F-'(C\{O}) is an open neighborhood of K and so contains rU for some r > 1. Apply 4.20 to get a continuous logarithm for F in rU.
Exercise 4.22 ( i ) Prove that if h : C(0, 1) + @\{O} is continuous and satisfies h( - z ) = - h(z) for all z, then h does not have a continuous square root (henceno continuous logarithm either). The conclusion applies in pariicular to the identity function. Hints: If g is a continuous square root of h, then g is never zero, so +(z) = g(-z)/g(z) is a continuous map of C(0, 1) into @\{O} and +2 = - I . Thus by 1.7 and the connectedness of C(0, I ) we infer that = k where k is either i or -i. It follows that
+
-1
(ii)
=
uf:
k2 = +(z)+(-z)
=
1 ++.
C(0, I ) 4 @\{O} is continuous, then there exists an integer n and a continuous 4: C(0, 1) + C such thatf(z) = zned(n).
The Index and Some Plane Topology
94
Hints: Let n = Ind,(O), where y is the loop f i t ) = f(eanrt).Thus At) = eanc*(t) where $ is continuous and $(I) - $(O) = n. Then (*) - a ~ i n t f ( ~ a n r t=) eani[rl(t)- nti vt [o, 11. The function 277i[#(t) - n t ] has the value 27ri$(0) at t = 0 and also the value 2si$(O) at t = 1. According to 3.26 there is then a continuous 4: C(0, 1) --f Q= such that 4(eantr)= 27ri[$(t) - n t ] V t E [0,1].
We get then from (*)
- anrntf(eanit)
=
e@(e'"9 Vt E 10,11,
that is, z'"f[z) = e@(.' VZE C(0, 1).
(iii)
(iv)
(v)
The set Y of all continuous, zero-free, complex-valuedfunctions on C(0, 1) is a commutative group under multiplication and the set d of all exponentials of continuous, complex-valuedfunctions on C(0,l) constitutes a subgroup of g. What do (i) and (ii) say about the quotient group 9/S? Let gl be the subgroup of functions in 3 ' of modulus 1, &r = S n gl. Show that Y, is complete in the unijiorm metric and that rf1 is both open and cloted in Y, and connected. Conclude that 8, is the component of the metric space 9,which contains 1. Show also that 9,/r& = g/&. Show that this quotient group is torsion-free, that is, iff: C(0, 1) +- C\{O} is continuous andf" = e@for some non-zero integer n and some continuous 4, then f = e* for Some continuous $.
Hint: The sets { Z E C(0, 1): f ( z ) = e[@(z)+2nrkl'n } ( k = 1,2,. . . , n ) are disjoint, closed and their union is C(0, I). Remark: Evidently the nature of the domain off is irrelevant to the truth of (v), as long as it is connected. Cf. 1.7.
Exercise 4.23 Prove the analog of 4.22(ii) for squares: If Q = (- 1, 1) x (- 1, 1) and f: aQ +-C\{O} is continuous, then there exists an integer n and, continuous CP: aQ + C such that f ( w ) = wnem(w) for all w E aQ. Hints: Define 4: aQ +- C(0, I ) by $(w) = w/lwl. Then $ is a surjective horneomorphism. Apply 4.22(ii) to f $ - l to come up with an integer n and a continuous on C(0, 1) such that 0
+
f($-'(z)) = zne@(z)Vz E C(0, I),
whence f ( w ) = $(w)"e@(*(w))
- Wne~(*(w))-nloKlwI
vwE aQ.
8 4. Existence of Continuous Logarithms
95
4.21 and 4.22(i) show that the domain of a continuous, zero-free function affects whether it has a continuous logarithm or not. In particular, if continuous, zero-free extension to a disk or to @ is possible, continuous logarithms are assured. Thus the extension theorems 1.44 and 1.45 (and, with the latter, homotopy properties) come to play a big role.
Theorem 4.24 (BORSUK[1932]) For a compact subset C of @ and a continuous function f : C -t @\{O} the following three conditions are equivalent: f is homotopic in @\{O} to a constant, (i) f has an extension to a continuousfunction F : @ --f @\{O}, (ii) f has a continuous logarithm. (iii)
Proof: (i) =. (ii). Immediate from 1.45. (ii) =- (iii). F will have a continuous logarithm, courtesy of 4.20. (iii) * (i). If h is a continuous logarithm for f on C, then H(t, z) = dhCP) (z E C, t E [0, 11) is evidently a homotopy in @\{O} of the constant function 1 with the function eh = f . Corollary 4.25 Let C be a compact subset of @, f o ,f l : C - t @\{O} continuous functions which are homotopic in @\{O}. Thenf o has a continuous logarithm ifand only $fl does. Proof: If f o has a continuous logarithm, then f o is homotopic in C\{O} to a constant, by 4.24. But thenf, is also homotopic in @\{O} to a constant, homotopy being a transitive relation. Finally, by 4.24 again, it follows that f l has a continuous logarithm.
Corollary 4.26 Let C be a compact subset of @, f o , f i : C - t @ continuous functions which satisfy If o - flI < 1f l l throughout C. Then both functions are zero-free and one has a continuous logarithm if and only if the other does. Proof: The strict inequality evidently prevents either function from having a zero. Moreover, it also implies that for any t E [0, I],
ltfo
+ (1
- tlfll
=
If1
+ t(So -h)I 2
If11
- tlfo
-fll > 0
throughout C. Therefore H(t, z) = tfo(z)+ ( I - t)fl(z) defines a homotopy in @\{O} of f l with f o and the last corollary applies.
forl
Exercise 4.27 (i) Give a direct proof of 4.26 based on the fact that f = maps into D( I , 1) and on D( 1, I ) there is a continuous logarithm. (ii) Show that the conclusion in 4.26 still follows if the hypothesis is weakened If J , and no hypothesis is imposed on C. to If o - fll c Ifol
+
Hints: Each function is still zero-free and the quotient fo/fl maps into C\(-m, 01. The latter set is starlike with respect to any point on the positive real axis, so by 4.20 the identity function has a continuous logarithm L there.
The Index and Some Plane Topology
96
(See also 3.43.) Then L 0 c f , / f )is a continuous logarithm in C for the quotient hlfi-
Exercise 4.28 Let K be a compact subset of @ and f: K -+ @\{O} continuous. Show that if0 belongs to the unbounded component of @\f ( K ) , thenf is homotopic in @\{O} to a constant (and then by 4.25 f has a continuous logarithm).
Hints: Choose r > suplf(K)I and use 1.28 and 1.30 to find a continuous y:
[0,1] -+ C\f ( K ) such that y(0)
=
0, y(1) = r. Define h by
Then h is a homotopy in @\{O} off with the constant -r. Alternatively, extend y to r : [0, bo) +-@ by setting r(t)= rt for t 1 1. Then to get a continuous logarithm L for the identity function apply 4.18 to U = @\r on U.The composite L 0 f is a continuous logarithm for$
Theorem 4.29 Let K be a compact subset of @, f: K -+ @\{O} continuous. Then there exist finitely many points p,, . , .,pNE @\K and integers n,, . . .,nN such that the function F(z) = f(z) fly= (z - p,)”’ has a continuous logarithm on K.
,
Proof: As a matter of convenience subject U 2 to a preliminary transformation z az + b in order to have (1)
K c (0,1) x (0,1).
Apply 1.44 to get a continuous extension J,: Q = [0, I] x [0, I]-+ @. Let L = f ; I({O}). This is a closed subset of Q disjoint from K , so by compactness there exists an r > 0 such that (2)
Iz - w [ 1 r Vz E K, w E L.
Let m be a positive integer greater than Q,k
=
rq, ]
x
d 2 / r and consider the squares
[m,m], k-1 k
centerplk = i - 3 + i k m- 3 m
forj, k = I , 2,..., m. Set
X = { ( j , k ) : I < j , k < m and
Q,knK#O}
- Y = { ( j , k ) : l < j , k < m and
QlknK=O}.
It follows from the choice of m and r that
(3)
K
c
U {elk: ( j , k ) E X } = Kl closed c Q\L.
Let f i be the restriction of f o to K,. Since K, is a union of squares Qjk,each interval {j/m} x [(k - I)/m,k/m] and each interval [ ( j - I)/m,j/m] x { k / m } either lies wholly in Kl or meets K , only at endpoints. At each endpoint wheref,
$ 4 . Existence of Continuous Logarithms
97
is not already defined give it the value 1. Then for any interval I = [a,b] of the above kind which does not lie wholly in K l , h ( a ) and f,(b) are non-zero complex numbers and f l is not defined on (a, b). Since @\{O} is open and connected, 1.28 furnishes a continuous extension of f , to a map of I into C\{O}. We now have a continuous, zero-free extension f 2 off to the closed subset m
of Q. The definitions of 9 and Kl then show that (5)
K2 n Qjk =
aQjk
v(j, k ) E 3
For each such (j,k) there exists an integer nfk such that ( z - P j k ) n j k f ( Z ) has a zero-free, continuous extension Fjk to Q,k. This follows from 4.23 and 4.24. We can then consistently define Fo on Q by
This function is continuous and zero-free on Q, hence has a continuous logarithm on Q by 4.21. The restriction of Fo to K has the product form stated in the theorem. Corollary 4.30 Let K be a compact fubset of @, 2? the set of bounded components of @\K and for each C E V let pc E C. Then given continuous f : K - t @\{O}, there exist C,,. . ., CM E 2? and integers n,, . . ., nM such that the function F(z) = f(z) ( z - pCj)"j has a continuous logarithm on K. The case V = 0 is allowed, void products being interpreted as 1.
ny=
Proof: Let p,, . . ., p N and n,, . . ., nN be as provided for f by the last theorem. It suffices to show that if p j E C, E %, then g(z) = (z - pc,)/(z - p,) has a continuous logarithm on K and if p , belongs to the unbounded component of @\K then z - p i itself has such a logarithm. For then we just multiply the representation 4.29 by the appropriate powers of these factors. In the second case the existence of the desired logarithm is guaranteed by 4.28. In the first case, recalling that C, is open (1.30(i)'), we use 1.28 to select a curve y : [0, I] --+ C, joining pc, to p,. Then H ( t , Z)
=
- '('I,( 1 , z)
= - Pi
E
[0, I ] x K
is a homotopy in C\{O} of g with I and the existence of the desired logarithm follows from 4.25.
Theorem 4.31 Lei K be a compact subset of @, C a bounded component of C\K and p a point of C. Then the function f dejined on K by f ( z ) = z - p has no continuous, zero-free extension to K u C; neither does any non-zero power o f f .
The Index and Some Plane Topology
98
Proof: We may suppose p = 0. Suppose, contrariwise, that for some integer n # O the function f” has a continuous extension F:K u C + C\{O}. Thus F(z) = z“ for all z E K. Choose r > suplCl and define =
{znF(z),
z E D(0, r)\C z
E
c.
Notice that C A [D(O,r)\C] = C\C c K (C being open and relatively closed in C\K). This shows that the definition of g is consistent and that in fact g is continuous. Moreover, we see that g maps into C\{O} (remember, 0 E C and F is zero-free). Then 4.21 furnishes a continuous logarithm Q for g. In particular, (*)
zn = g(z) = e@@)Vz E C(0, r).
This contradicts 4.22(i) and (v). Alternatively, we can compute indexes at 0 on both sides of (*) and reach the contradiction n = 0.
Exercise 4.32 Let K be a compact subset of C. Form the groups Y = Y ( K )and 8 = S(K) of all continuous, zeroyree functions on K and all exponentials of continuousfunctions on K,respectively, as in 4.22. (i) Let C,, . . ., C, be distinct bounded components of C\K and p j E C,.Let fr(z) = z - p j , z E K. Then fi, . . .,f,E Y. Show that their cosets are independent in the quotient group $18. That is, show that f t i . f$n E 6 for integers k l , . . .,k , only i f k , = = k, 0.
--
Hints: Use 4.31 : If ffi ffi
=f , k a
-
.f$n
E 6 and
- -
5:
some k, is not zero, say kl # 0, we write
f;kne@
for some continuous Q on K.That is,
The denominator on the right naturally extends to a continuous, zero-free function on C1,since p2, . . .,p n $ C,,and Q has by I .44a continuous extension to C. Thus f f i admits a continuous, zero-free extension to K u C1,contradicting 4.3 1. (ii) Use (i) and 4.30 to show that the rank of the group B/b equals n ifC\K has exactly n bounded components and this rank is injnite if C\K has infinitely many bounded components. ( j = 1 , 2), are (iii) Noting that the groups B(Kj), as well as the groups I(&) naturally isomorphic whenever the compact sets K j are homeomorphic, deduce that the number of components of the complement of a compactum is a positional invariant.
8 4. Existence of Continuous Logarithms
99
Corollary 4.33 (BORSUK[1932]). For a compact subset K of C the following are equivalent: (i) C\K is connected. Every continuous, zero-freefunction on K has a continuous logarithm. (ii)
Proof: (i) =- (ii). Use 4.30. (ii) =- (i). Use 4.31 and 4.24. Corollary 4.34 The property of having a connected complement is a positional invariantfor compact subsets of C.
Exercise 4.35 A compact subset of C is simply-connected i f and only i f each of its components is. The sequence of steps below (mainly from EILENBERG [19361) will carry the reader through to this conclusion. (i) Let C closed c K closed c C, f: K+ C\{O} continuous and suppose that f has a continuous logarithm on C. Show that there is a relatively open subset U of K containing C such that f has a continuous logarithm on U. Hints: Let +: K - t C be a continuous extension to K (after 1.44) of a continuous logarithm off on C and consider U = { Z E K : If(z)e-*(") 11 < I}. This set is relatively open in K and contains C. It is mapped by fe-* into D(l, 1) and there is (by 3.19) a continuous logarithm L in D(1, 1). Therefore we may form I) = L 0 Ue-4) on U and have f = e*e* = em+*on U. (ii) Let K be a compact subset of C,f:K + C\{O} continuous. Suppose that f has a continuous logarithm on each component of K. Show that f has a continuous logarithm on K.
-
Hints: For each component C of K let U, be a neighborhood of C as provided by (i). Use 1.33 to select a compact, relatively open (in K) neighborhood V, of C lying in U,. Cover compact K with finitely many of the sets V,, say with V,,, . . ., Vcn. Then the sets A, = Vc,, Ak = VC,\U:;: Vc, (1 < k 5 n) are disjoint, compact, they cover Kand on each of themf has a continuous logarithm. (iii) I f K is a compact subset of C and each component of K is simply-connected, then K is simply-connected. Hint: Use (ii) and 4.33. (iv) If C, is a component of a compact, simply-connected subset K of C, then Cois simply-connected. Hints: It suffices to show that for each (other) component C of K, @-meets C. For then (@\K) U C is connected (by 1.3) and C\Co is a union of such sets. If C\K n C = a,then for each z E C there exists an r, > 0 such that (C\K) n D(z, r,) = D . Then U = UzeC D(z, r,) = UZEC C u D(z, r,) is connected, contains C and lies in K. Hence by maximality of components, U = C. But then C is clopen in C.
The Index and Some Plane Topology
100
Exercise 4.36 Say that the set S c 42 separates two points a, b i f a, b lie in direrent components of C\S. (i) (EILENBERG [1936]) Let K be a compact subset of @, a, b E C\K. Let f: K - t @ be defined by f ( z ) = ( z - a)/(z - b). Show that K does not separate a and b i f and only i f f has a continuous logarithm on K. Hints:
Examine the proof of 4.30. to 4.24, f has a continuous zero-free extension F to @. If a, b are not in the same component of C\K, then one of them, say a, belongs to a bounded component C of C\K which does not contain the other. Then the function z - a = ( z - b)f(z) (2 E K) has the zero-free continuous extension ( z - b)F(z)( z E K u C), contradicting 4.31. (ii) (JANISZEWSKI[1915]) Suppose that Kl, Ka are two compact subSets of @ neither of which separate$ a, 6. Show that if Kln Ka is connected then Kl U Ka does not separate a, b either. (3)
(e) According
Hint: Formf(z) = (z - a)/(z - b) (z E Kl u KJ. According to (i) this function has a continuous logarithm on Kl and a continuous logarithm on K2. Use connectedness of Kl n Ka to manufacture a single continuous logarithm on Klu K2. Then cite the other direction of (i). Exercise 4.31 This exercise is! designed to culminate in a Strengthened version of the non-trivial implication in 4.18. Let U be an open subset of C andf: U +-C\{O} a continuous function satisfying (*)
IndlOr(O) = 0 for every simple loop r in U.
(i)
Consider two arcs yl,7 2 : [0, I] -+ U such that
(1.0) ~i(0)= ya(0) (1.1)
~i(l)
= All
and let (2)
for,
=
[0, I] --t @ satisfy
+2:
e 3 (j= 1,2)
(3.0) +l(O> = +2(O).
Show that dl(l) = +a(l).
Hints: Argue by contradiction and suppose that (3.1)
Ci(1)
# +a(l).
Notice that h = y; l y1 is a homeomorphism of the compact subset y ; ' ( y Z [ O ,I]) of [0, I ] onto the compact subset y; '( yl[ O , I]) of [0, I ] which maps 0 to 0 and I to 1. Consider the set 0
T
= {t E
[O, 11: ~ i ( tE)Y ~ P11,& +i(t) = +a(h(t))).
0 4. Existence of Continuous Logarithms
101
Tis closed, 0 E T [by ( I .O) and (3.0)] and 1 4 T [by (I .I) and (3.1)]. Consequently there is a largest element tl E T.Setting s1 = h(tl), we have 0 I tl, s1 < 1 8L Yl(t1) = y2(s1) 8L +l(tl) and, by the maximality of tl,
(4)
< t 5 1 8L Ydt) E Y a P , 11 * 410) z Next form
(5)
tl
= da(s1)
+2(W).
11: Y 2 b ) E Ydtl, 11 8L +2(s) z +1@-Ys))}By (4), s1 4 S and by (1.1) and (3.1), 1 E S. If y2(s) E yl[tl,I ] and we set t = h-l(s), then yl(t) = y2(s). Consequently
s = (s E P 1 , e",(t)
=
= f ( Y z ( s ) ) = e"dSL'
f(Yl(t))
and therefore +2(s) - d l ( t ) is an integer multiple of 2ni. This shows that the set S can also be described as = {s E [Sl, 11:
Y2(S)
E Yl[tl,
11 8L I+z(s) - +dh-Ys))I
2 24,
which makes it clear that S is closed. Therefore S has a smallest element s2. Setting t 2 = h-l(s2), we have s1 < $2 5 1, tl < t 2 5 1, (6) and, by the minimality of sz,
Ya(s2) =
(7) $1 5 s < s2 & Y 2 ( S ) E YJtl, 11 It follows easily from ( 5 ) and (7) that Yl(t1, t 2 ) n Y2b1, $21 = (8) Indeed, suppose
(9)
tl
(10)
rl(t)= W), with s E
t2
+2(s)
=
Yl(t2)
8L +As21 #
+&2)
+1(h-Ys)).
la.
and Y l W E Y2[Sl,
s21,
say,
[s,, 4.
Now f # rl, t 2 and h one-to-one show that s1 = h ( t , ) # h ( t ) # h(t,) is, s = h ( r ) # s,, s2 and so (I I)
$1
<s<
= s2,
that
s2.
I t follows on the one hand from (9), (10) and (5) that dl(t) # +2(s) and on the With (8) confirmed and other hand from ( I I), (10) and (7) that c$~(s)= +l(r). (4) and (6) in mind, the equations
well-define a simple loop in U. Moreover, by (4) the equations
The Index and Some Plane Topology
102
well-define a continuous function which satisfies f o 2ni Indfor(0) = @(2)- @(O) = +a(sg)
r
= eQ. Consequently
- 4dtl) # 0,
by (6).
This violates the hypothesis on f. Prove that under hypothesis (*), f has a continuous logarithm in U. (ii)
Hints: As in 4.18 we reduce at once to connected U.Fix a point zoE U and a wo E C such that eWo= f(zo). Set yz, = zo and for each z E U different from zo select [by 1.28 and 1.141 an arc y r : [0, I] -+ U joining zo to z . Let q$ and (D be defined as in 4.18. To prove @ continuous at a point zl,select r as in 4.18 and let tl be the smallest t E [0, 11 such that y,,(t) E D(zl, r ) . Then choose L as in 4.18 but with the normalization (3) replaced by (3)'
L(f(Y,(tl))) = 42Atl).
For each z E D(zl, r ) define Oltltl
O l t I t l tl It I1. We note that Oz is well-defined at t l , by (3)' and so is continuous on [0, I]. Also clearly rZ= e% If z1 # zo, then yzl is one-to-one and if z1 = zo, then t l = 0. In either case therefore yZ1is one-to-one on [0, t l ] . Moreover, by minimality of tl, r,[O,t l ) is disjoint from d(zl, r ) 3 r.[tl,I]. Hence rz is one-to-one. Finally, = OZ(O),the conclusion +2( I ) = @,(I) follows from since +,(O) = wo = C$~~(O) (i). This says that =
05
Uf(rz(1)))= L ( f ( z ) )
vz E
m 1 ,
r).
The Jordan Curve Theorem
Corollary 4.38 For any Jordan-curve J the complement @\J has exactly one bounded component.
Proof: J = +(C)for some homeomorphism of C = C(0, I). Since C\Chas exactly one bounded component, so does @\J by 4.32(iii). Alternatively, if one wishes to avoid the algebra, we can argue thus: If C\J had no bounded component, then by 4.33 !??(J)= d'(J), whence, via 4, g(C) = G(C). This contradicts 4.22(i). If C\J has two distinct bounded components C1,C,, we select points p , E C, and form functions ft(z) = z - p , ( j = I , 2) on J. By 4.22(ii) there exist integers n, and continuous functions $, on C such that (*)
#(w) - p ,
=
w?eVW) Vw E C, j = 1,2.
0 5. The Jordan Curve Theorem
103
Then
(4(w) - p,)s(+(w) - p , ) - " ~= e"a*i(w)-"i*a(w)
Vw E C,
whence
( z - pl)la(z - p,)-"i Then 4.32(i) implies that n,
= e"aYi(~-'("-"1YI("-'(.)) =
Vz E J.
n, = 0. Returning to (*), we have then
$(w) - p1 = err+') v w E c, f l ( z ) = z - p1 = e*i(@-'(a))Vz E J. Thus extends to a continuous, zero-free function on C (since $, extendable), violating 4.31.
o
q5-l is
Exercise 4.39 I f K is a proper, closed subset of a Jordan-curve J, then C\K is connected. Hints: By 4.34 it suffices to demonstrate this for the special case J = C(0, 1). However, that case was handled in 1.25(i). Exercise 4.40 If K is a compact subset of C homeomorphic to a $ubset of then C\K is connected.
I$,
Hint: Treat the case K c R directly (cf. the proof of 1.25(i)), then cite 4.34. Theorem 4.41 I f J is a Jordan-curve and C a component of C\J, then BC = J.
Proof: By I .30, C is open and relatively closed in C\J. Therefore aC = C\C = n J u C n (C\J)]\C = [C n J u C]\C = C n J\C = C n J. In particular,
[c
(*)
ac c J.
By 4.38, C\J is not connected, so there is another component K of C\J disjoint from C. Thus K is disjoint from since c C u J (as was shown above). It follows that C \ c is not void. Therefore the equality
c,
c
qac = c u (qC) displays @\aC as a disjoint union of non-void, open sets, thus showing it to be disconnected. Consequently 4.39 tells us that the inclusion (*) cannot be proper. Theorem 4.42 Let J be a Jordan-curve, r any homeomorphism of C(0, 1) onto J. Then for the loop y defined by y ( t ) = l?(eznit),t E [0, I ] , we have Ind, = & 1 throughout the bounded component of C\J.
Proof: We have .f = F-I: J + @\{O} and so by 4.30 there exists p in the (unique!) bounded component of @\J, an integer n and a continuous function 4 on J such that (z
- p)-"f(z) = e@(')
Vz E J.
The Index and Some Plane Topology
104
Consequently w =
(r(w) - p)ne&cr(w))VW E c(0, 1).
In particular, C(0, 1)
= (y
- p)"e@Oy.
Taking indexes at 0 on both sides gives 1 = n Ind,-,(O) = n Ind,(p)
+ Ind,aw(O)
+ 0.
It follows that Ind,(p) = k 1. Exercise 4.43 Any homeomorphism of one circle onto another can be extended to a homeomorphism of C onto @. Hint: After translations and dilations in the domain and range it suffices to treat the case of a homeomorphism 4 of the unit circle C(0, 1) onto itself. Show that
defines an extension of the desired kind. Remarks 4.44 More generally, any homeomorphism of one Jordan-curve in @ onto another extends to a homeomorphism of 6 onto C. (SCH~NFLIES [1906], pp. 319-324 and [1908], pp. 209-213, modulo some errors; see also [1921], NOBELING [I9501 and p. 198 of TIETZE[1913], KLINE[1920], ANTOINE GUGGENHEIMER [ 19771.) This will be deduced in Chapter IX from a deeper extension theorem for conformal maps. A corresponding extension is possible for homeomorphisms of intervals in C, i.e., for arcs. One first extends the arc to a simple loop (5 7 of FEIGL[I9281 or p. 164 of M. H. A. NEWMAN [1951]). Definition 4.45 (i) For a Jordan-curve J the unique bounded component of @\J is called the inside of J and is denoted 9 ( J ) . The unique unbounded component of C\J is called the outside of J and is denoted O(J). A Jordan region is any set f ( J ) . (ii) (iii) A homeomorphism r of C(0, 1) onto J is called positively (negatiuely) oriented if Ind, equals 1 (- 1) throughout the inside of J, where f i t ) = I'(eanft).
g 5. The Jordan Curve Theorem
105
Remark 4.46: The fundamental facts 4.38 and 4.41 can be summarized in the above language as follows : Y ( J ) , O(J) are disjoint, open, connected sets (i) 9 ( J ) is bounded, O(J) is unbounded (ii) C\J = Y ( J ) u O(J) (iii) Y ( J ) = J U 9 ( J ) , O(J) = J U O(J). (iv)
Exercise 4.47 Let J be a Jordan-curve, a, b two digtinct points on J and C a cross-cut in Y (J ) with endpoints a and b. (i) Show that there are two arcs Al, Aa whose union is J and whose endpoints are each a and b. (ii) Show that J1 = A , u C and Ja = A2 u C are Jordan-curves. (iii) Show that 9(J)\C = 9 ( J l ) u 9(Ja). Hints: The set A ; = A,\{a, b} lies i n J a n d Jlies in the closure of the unbounded connected set B ( J ) (See 4.46.) Therefore A ; u O(J)is unbounded and connected [by 1.21. It is also disjoint from Ja. Hence it lies in 0(J2), whence (I)
Y(Ja) c @\(A; u B(J))
-
=
9(J)\A;.
Of course Y ( J J is disjoint from Ja = (J\A;) u C and so the inclusion (1) implies Y(Ja) c
~(J)\J\c= Y(J)\c.
Similarly for 9(J1),Thus (2)
u 9(J2)
Y(J1)
= -W)\C.
To reverse the inclusion, consider any point z E 9(J)\C and select
(3)
W E
B(J).
If z belongs to neither Y(J,) nor Y(J2),then (since z $ J u C = J1 U J2) z belongs to each of @(Jl),0 ( J 2 ) ,to which also the point w belongs by (2) and (3). Thus neither J1 nor J2 separate z and w. Since J1 n J2 = C is connected, it follows from Janiszewski’s theorem that J1 u J 2 does not separate z and w. A .fortiori then J, a subset of J , u J2, does not separate z and w. That is false however, since z E .Y(J)and w E U(J). (iv) Enunciate andprooe the analog of (i)-(iii) in case a = b. For use later we record here a technical result. Lemma 4.48 Let (2 be a Jordan region, z E an. Then for each E > 0 there exists 6 > 0 such that any two points of i2 n D(z, 6 ) lie on a polygon in Q n D(z, e). Let 12 be the inside of the Jordan-curve J. There is a homeomorphism such that #(l) = z. Let y ( t ) = $(eft)(t E R). Choose 0 < to iT sufficiently small that Proof:
4 of the unit circle onto J (1)
Jl
= y [ - h to1
= W Y 4.
The Index and Some Plane Topology
106
Now z is disjoint from the compact set Ja = J\y(- to, to) = y[to, - to + 2 ~ 1so , for some 0 < 8 < e, D(z, 8 ) is also disjoint from this set. Consider any two points p, q E Q n D(z, 8). Setting C = aD(z, e), it is obvious that (2)
p , q are not separated by C u Ja,
since the latter set lies in the complement of D(z, 8). Of course
(3) p, q are not separated by J either, since they both belong to the component i2 of C\J. Moreover, since J1 is disjoint from C (see (1)) and J1 u Ja = J, it follows that CnJcJ, and so (4)
(CU Ja) nJ = ( C n J ) U (Ja n J ) = Ja.
From (2), (3), (4) and Janiszewski's theorem we have that (5)
p , q are not separated by (C u Ja) u J = C U J,
that is, p , q belong to the same component U of C \ ( C u J) = (C\C) n (C\J). Since we know which of the two components of C\C contains p and q (viz., D(z, e)) and which of the two components of C\J contains p and q (viz., Q), it follows that U c i2 n D(z, e). Since U is open there is, thanks to 1.28, a polygon in U joining p to q.
06
Applications of the Foregoing Technology
Theorem 4.49 Ifs: C -+ Q: is continuous and for some pofitive integer n satisfies l i m l a l +z-"f(z) ~ = c E C\{O}, then f has a zero, In particular, every non-constant polynomial has a zero.
Proof: Suppose contrariwise that 0 $f(C).We may divide f by the hypothesized non-zero limit and so suppose from the start that it is 1. Choose then positive R sufficiently large that (1)
IZ-"f(z) - I 1 < 1 Vlzl L R If ( Z ) - z"I < IZ"~ V / Z >-~ R.
If we define (2) and
r(t)= [Rellt]n = e2ntltt+fbLOSR,
y,(t) = h(r, 2) (3) then (I) implies that
IYR(0
= f(reant'),
- Wl < I W l
tri [O,
11
(r, t ) E 10,Rl x [O, 11,
Vt E [O,
11.
0 6. Applications of the Foregoing Technology
107
It follows from (the proof of) 4.6 that Ind,(O) = IndAO). But from the form (2) of I' and the definition of index we have at once that Ind,(O) = n and so
(4)
Ind,,(O) = n.
However, by hypothesis h([O,R] x [0, 11) c f(C) c C\{O}, and so by 4.12 we have (5) Ind,,(O) = Ind,,(O).
As yo is constant, we have Ind,(O)
= 0 and
(5) contradicts (4).
Finally, note that ifp is a non-constant polynomial and n 2 1 is its degree, then z-"p(z) approaches the leading coefficient of p as IzI --f coy so that p is an eligiblef. Exercise 4.50 (i) For any polynomial p over C, p(z) - p(zo) is divisible by z - zo, that is, p(z) - p(zo) = (z - z,)q(z)for some polynomial q. Hint: For any positive integer k, zk - z! = (z - zo)2:f; zt-l-jzj. (ii) Use (i), induction on n, and 4.49 to show that i f p is any nth degree polynomial over C then there exist c, zl, . . ., z, E Q= such that p(z) 3 c n;=1 ( z - Zj). (iii) I f p is a non-constant polynomial, then all zeros of p' lie in co ~ ~ ' ( 0 ) . Hint: Let zl,. . ., zN be the distinct zeros of p and nj the multiplicity of z,. Then from (ii)
Then for z $p-'(O)
If in addition p'(z) = 0, it follows that
Take conjugates to see that v
z
=
2 ,=1
where
AjZj,
The Index and Some Plane Topology
108
Exercise 4.51 (i) For eachpositive integer n there are multinomials s,,~, . . .,fn,n-l with integer coeficients such that the coeficient of zj in the product ( z - al).. - ( z - a,) is sn,,(al,. . ., a,,)for each j = 0, 1, . . .,n - 1 and all choices of complex numbers al,. . .,a,. In particular, the coeficients of a monic polynomial are continuous functions of its zeros. Hint: Induction on n. Let n be a positive integer and al,. . ., a, E @. Suppose that the polynomial (ii) p(z) = (a1 - z ) . . (a, - z ) has integer coeficients. Show that then the polynomial P(z) = (a: - z ) * * (at - z ) also has integer coeficients.
-
Hint: (Ostrowski) The polynomial p(z)p( -z) has integer coefficients and equals Z) = (af - za)* (at - za) = P(za). (a1 - z)(al Z ) * (a, - z)(a, (iii) Let P be a monic polynomial with integer coeflcients all of whose zeros lie on the unit circle. Show that each of these zeros is in fact a root of unity.
+
+
--
Hints: Fix positive integer n and let 9 ( n ) denote the set of nth degree monk polynomials with integer coefficients whose zeros lie on the unit circle. It follows from part (i) that the coefficients of the polynomials in 9 ( n ) are bounded. As these coefficients are integers, it follows that 9 ( n ) is finite. Consequently the set Z(n) of all the zeros of all the polynomials in P ( n ) is also finite. But if a E Z(n),then so does 'a by part (ii). Inductively, {a2k: k positive integer} c Z(n). Then for some kl k, we must have aakl = aak1,a(2ka-ak1) = 1.
-=
Exercise 4.52 (cf. I I .42) Let W denote the set of all polynomials with rational coeficients. Let P, Q be (non-zero) elements of W which have no common nonconstant factor in 9. Show that there exist A , B E 9 such that A P + B Q = I . Hint: All is trivial if P or Q is constant. For example, if Q is constant take A = Q and B = - P + I / Q . So suppose deg P > 0 and deg Q > 0. Use induction on the degree of PQ. If, say, deg Q 5 deg P, let Bo be the quotient of the leading term of P by that of Q. Thus Bo E 9 and
P - BoQ
=
PI
has degree less than that of P. Therefore deg P I Q < deg PQ. Moreover Pl and Q have no common factor in 9 (any such would be one for P and Q too). Therefore the induction hypothesis provides A , B1 E 9 such that A P, + B1Q = I , that is,
+
A ( P - BOQ) B1Q A P (B1 - A&)Q
+
= =
I I.
I n 4.53 through 4.57 we abbreviate D(0, I ) to D and C(0, 1) to C. Theorem 4.53 (WAVRE and BRUTTIN[ 19261). Let f: B --f C be continuous a d satisfy f ( C ) c 6.Then there exists a point z E B such that f ( z ) = z. In particular, every continuous map of B into b j i x e s some point.
5 6. Applications of the Foregoing Technology
109
Proof: Define r : @\{O} -+ C by r(z) = z/lzl. Suppose, contrariwise, thatffixes no point in 6. Then
(2 - 2t)z - f ( ( 2 - 2t)z) # 0 V t € [+, I], z €
c,
since for such t and z the point (2 - 2t)z E 6. Moreover, z - 2tf(z) # 0 vt E [O,+), z E c, since for such t and z, J2ff(z)l I2 t (due t o f(C)c b) < 1 we can define H(t, Z ) =
CIt12Z-
=
1.
Therefore
0,4 E [O,31 x c
f ( ( 2 - 2t)z)), (t, z ) E [+, 11 x
c
and will get thereby a (well-defined and continuous) homotopy in C of the identity function on C with the constant function -f(O)/I f ( 0 ) l . Since the latter has a continuous logarithm while (by 4.22(i)) the former does not, a contradiction to 4.25 is reached. Exercise 4.54 (i) Let F: 6-t C be continuous. Show that for each h E C there exists some z = zAE C such that F(z) = hz. In particular, there is no continuous refraction of b onto Cfixing all the points of C. Hints: Consider f = h-'F. If no such z exists, thenffixes no point of C. No point of D is fixed either, since f maps D into the disjoint set C. Therefore f violates 4.53. (ii) (BROUWER[ 1912bl) Let K be a non-empty, conuex and compact subset of @, F: K-. K a continuous function. Show that F has a fixed point. Hints: We can assume that K c 6.Show first that to each point z of 6 there corresponds a unique nearest point g(z)in K and that g is a continuous function: Existence is an easy compactness argument; uniqueness is the strict convexity of the norm in R2 (the average of two candidates for g(z) still lies in K and is another candidate). Continuity follows easily from uniqueness. (Cf. with the hints to 1.32.) Now apply 4.53 to f = F g . Since f ( b ) = F ( K ) c K , any point of b fixed by f lies in K and is (therefore) fixed by g. 0
Exercise 4.55 Let 1': b + 62 be continuous, xo E D, f ( x o ) = y o # f(C).Suppose that the map fo: C -+ @\{O} defined by
.LOW
=f ( z )
- Yo
does not liaiie a continuous logarithm. Show that then yo belongs to the interior of
./(a.
Hints: f o ( C ) is compact and does not contain 0. Let r = inflfo(C)I. Then r > 0 and we can show that D(yo, r ) c f ( b ) . T o this end, consider any y1 E D(yo, r ) and form fi : C --f @ by
f&)
= m- Y l .
The Index and Some Plane Topology
110
We have
Ifo(z)l V Z E c. Sincef o does not have a continuous logarithm, it follows from (*) and 4.26 that fl does not have a continuous logarithm. A fortiori then the map
(*I
Ifi(z) -fo(z)l = lY1
- Yo1 < r 5
Fdz) = f @ ) - Y l , E b does not have a continuous logarithm. Consequently by 4.21 Fl must have a zero. Exercise 4.56 Let f : b --f C be continuous and one-to-one. Show thatf(0) is an interior point of f ( B ) . Hints: Define
fo(z) = f ( 4 - f(0) f l @ ) = f (32) - f ( - M
Z E C
Z€C
Since f is one-to-one, the function h never vanishes, i.e., maps into C\{O}. Evidentlyj; satisfiesfl( - z ) = -fl(z) for all z E C,and so by 4.22(i) fl does not have a continuous logarithm. Therefore by 4.25 f o does not have a continuous logarithm, and so the last exercise may be applied. Exercise 4.57 (Open Map Theorem) If U is an open subset of C and f: U +. C is continuous and one-to-one, then f( U ) is an open subset of C. Hints: Given a E U , choose r > 0 so that b(a, r ) c U and apply the last exercise. Exercise 4.58 Prove the Borsuk Antipoden Satz in dimension two: If S = E R3:X: + x i + x i = I ) is the unit sphere in R3 and f:S -+ C is continuous, then f ( p ) = f( - p ) for some p E S. What does this result say about the existence at any instant of antipodes on the earth which have the same temperature and the same barometric pressure ?
{(xl, xa, x,)
Hint: Consider the function h : B(0, I ) -+C defined by h(X,y) = f ( X , y , dl
- xa - y2) - f ( - x ,
-y,
-dl - X' - y')).
If no such point p exists, then h maps into C\{O} and so has a continuous logarithm by 4.21. Since h(-x, -y) = -h(x,y) for all ( x , y ) E C(0, I), a contradiction of 4.22(i) ensues. Remark: It follows from 4.58 that no continuous complex-valued function on S can be one-to-one and so R2 contains no subset homeomorphic to S. In particular, Ra is not homeomorphic to R3.
(j7.
07
Continuous and Holomorphic Logarithms in Open Sets
111
Continuous and Holomorphic Logarithms in Open Sets
The following variations on 4.30 are the first phase of a program to be completed in Chapter X of extending to open sets results of previous sections on existence of continuous logahthms and connectivity of the set. Theorem 4.59 Let U be an open subset of C such that C\U has onlyjinitely many bounded components C,, . . ., C,. Let p j E C,. Then for any continuow, zero-free f on U there exist integers kl, . . ,,kMand continuousfunction # such that
ZfC\U has no bounded components, then f = e@for such a #. Proof: Let {K,,}be a compact exhaustion of U as provided by 1.31. Let K be a compact subset of U as furnished by 1.43. Since the sets I?,, increase and cover U, they eventually all contain the compact set K. Ignoring early terms as necessary, we can suppose that K c K,, for all n. Now according to 1.43, Cl . . ., C, lie in distinct bounded components Cl(K), . , ., CM(K)of C\K.We have C, c C\U c C\Knc C\K. Therefore C, lies in a component C,(K,,) of C\Knand in turn C,(K,,) lies in a (unique) component of C\K.The latter is perforce C,(K). Thus Cl(K,,), . . ., CM(K,,)are distinct. On the other hand, by 1.31 the number of bounded components of C\K,does not exceed M.It follows that Cl(K,,), . . ., CM(K,,)account for them all and so p l , . . .,p , represent points from each of the distinct bounded components of C\K,,. Consequently, we may appeal to 4.30 to come up with integers kl(n), . . ., kM(n)and continuous functions #,, on K,, such that (1)
f(z) =
fi
(z
- pj)kj(n)e@n(a)vz E K,,.
I-1
The uniqueness result 4.32(i) ensures that we have kj(1) = kj(2) = kj(3) = * * * for each j = 1,2, . . ., M. Call the common value kj. Then (1) says that the function
has a continuous logarithm on each K,,. Since any loop y in U lies in some K,,, it follows that F o y has index 0 at 0. By 4.18 therefore F has a continuous logarithm on U . (For holomorphicf a different proof is offered in 10.12.) Exercise 4.60 Let U be an open subset of C, f : U + C\{O} holomorphic. Show that any continuous logarithm (resp., square root) o f f is holomorphic. C ’ 5.65. Hints: Let z E U be given. Choose r > 0 so small that D(r, r ) c U and f ( D ( z , r ) ) c D(f(z), If(z)l). Let L be a holomorphic logarithm in the latter
The Index and Some Plane Topology
112
disk (as furnished by 3.19). Then we can form L f in D(z, r ) and have a holomorphic function such that e@= f i n D(z, r). If g : U +-C is continuous and satisfies ep = f (resp., g 2 =f) throughout U, then eg-* = 1 (resp., g a - (e@12)2 = 0 ) in D(z, r). It follows from 3.14(iii) (resp., 1.7) that ( g - +)/2ni is a continuous integer-valued function on the connected set D(z, r ) (resp., that g = e@/2or g = throughout D(z, r)). Thus ( g - +)/25riis constant, say N, in D(z, r ) and g = + 25riN (resp., g = e@/2or g = -e@la) exhibits g as a holomorphic function in D(z, r).
+
0
+
Corollary 4.61 I f f in 4.59 is holomorphic, then so is 4.
+ is a continuous logarithm for the holomorphic ny-,( z - p j ) - 4 in U.
Proof: f(z)
function F(z) =
Exercise 4.62 Let G be a torsion-free abelian group. Suppose that {f l , . . .,fN} is an independent set in G and for some g,, . . ., g, E G we have {f,, . . .,f N } c grp{g,, , . .,g,}, the group generated by g,, . . .,g,. Show that n 2 N. Hints: Writing G multiplicatively, let
W
has a non-trivial rational solution (cl, .. ., cN)because the N vectors (ml,, . ..,m,,) . ., N ) are linearly dependent in the n-dimensional space Q". Upon clearing denominators, there is then a non-trivial integer solution (c,) to (2). From (1) and (2) together and the commutativity of the group we get ( j= 1,2,.
Since not all cj are 0, this violates the independence of {A, . . .,fN}.
Exercise 4.63 Let U be an open subset of C. Show that a necessary and suflcient condition that C\U have at most n bounded components is this: there exist zero-free holomorphic functions @, . . ., 0,such that every zero-free f E H(U ) determines integers kl, . . .,kn and E H(U )for which f = e@ @ff. [Infact, suflciency requires only the continuity of the @, and the +.]
+
n;=,
Hints: Necessity follows from 4.59 and 4.61. For sufficiency, suppose C,, . . .,C, are distinct bounded components of C\U and N > n. Pick p j E C, and define fr(z) = z - p , ( z E U ) . These are zero-free holomorphic functions, hence they have a representation of the advertised kind. But then by the last exercise the
8 8. Simple Connectivity for Open Sets
113
cosets A&(U) are dependent in the group 9 ( U ) / S ( U ) . That is, there exist integers k,, . . .,kN,not all zero, and continuous function 4 on U such that (*)
ft1..
.f i N
= e"
on U.
But by 1.43 there is a compact subset K of U such that p l , . . .,p N are representatives of distinct bounded components of @\K. Then the validity of the + lkNl > 0 contradicts 4.32(i). equality (*) on Kplus J k l J
+- -
08
Simple Connectivity for Open Sets
Definition 4.64 Let U be an open subset of @. Say that U has property (CL) if every zero-free continuous function in U has a continuous logarithm ; property (HL) if every zero-free holomorphic function in U has a holomorphic logarithm ; property (CS) if every zero-free continuous function in U has a continuous square root ; property (HS) [resp., (HS,)] if every zero-free holomorphic [and one-to-one] function in U has a holomorphic square root. These definitions and previous results enable us to state succinctly some important topological facts about @:
Theorem 4.65 For an open subset U of @ the following eight conditions are equivalent : (i) U is simply-connected (ii) U has property (CL) (iii) U has property ( C S ) (iv) U has property ( H S ) (v) U has property (HL) (vi) U has property ( H S l ) (vii) U i s homologically-connected (viii) U contains the inside of each Jordan-curve in it. Proof: (i) => (ii) from 4.59. (ii) * (iii) trivial. (iii) 3 (iv) 4.60. (iv) 3 (v). Iff: U --f @\{O} is holomorphic, repeated application of the hypothesis produces (zero-free)f, E H ( U ) such that f:" = f. It follows from 4.19 that f has a continuous logarithm in U, which by 4.60 must in fact be holomorphic. (v) 3 (vi) trivial. (vi) 2 (vii). For each p E @\U the function f ( z ) = z - p , being one-to-one, holomorphic and zero-free on U , has a holomorphic logarithm. The argument
The Index and Some Plane Topology
114
is the same as that in the proof (iv) 3 (v). It follows that Ind,(p) = Ind,.,(O) = 0 for all loops y in U . (vii) => (viii). If J is a Jordan-curve in U , let be a homeomorphism of the unit circle onto J and let y ( t ) = +(e").For any z E 9 ( J ) we have Ind,(z) # 0 by 4.42. Consequently by (vii), z $ C\U. (viii) (i). Let C be a bounded component of @\U, p E C and form f ( z ) = z - p as before. I f y is a simple loop in U , then 9 ( y ) lies wholly in U and so Ind, vanishes in C\U. Therefore 0 = Ind,(p) = Ind,,,(O), so by 4.37 this leads (via 1.43) to a contradiction of 4.32(i).
+
-
Remarks: In Chapter X these equivalences will be augmented by several more, the most dramatic of which is that each component of U is homeomorphic to a disk.
Corollary 4.66 An open subset U of C is simply-connected ifand only if each of its components is. Proof: The components are open and disjoint, so a function on U is continuous if and only if it is continuous on each component. Therefore the corollary follows from 4.65(ii). Exercise 4.61 Let U and V be open, simply-connected subsets of @. Show that U n V is simply-connected. (i) Hint: Use 4.65(vii). Show that if U n V is connected then U u V is simply-connected. Supply a (ii) counterexample to the conclusion when this intersection is not connected. (CJ 3.40.) Hints: If f:U u V + C\{O} is continuous, 4.65(ii) provides continuous logarithms for f on U, V respectively. We have e%-@v= 1 on the is conconnected set U n V, hence the integer-valued function (+u - ~$~)/27ri stant there, say N.Then the function defined by
+",
+
=
;{
+
- 2TiN
on u on V
is a (well-defined) continuous logarithm for f on U u V. (iii) Let U, ( j = 1,2,3) be simply-connected regions such that Ul n U, and U, n U3 are each connected while Uln U3= 0 . Show that then U1 u U,u U3 is simply-connected. (Cf.3,42(ii).)
Hints: The sets U , u U, and U , u U, are each simply-connected by (ii). Their intersection is the connected set U,,due to U1n U , = 0. Now use (ii) again.
Exercise 4.68 If U, V are open subsets of C which are homeomorphic, then one is simply-connected if and only if the other is. In fact, if 6\V has exactly n (finite) bounded components, then so does C\U.
Notes to Chapter IV
115
Hints: If p l , . . . pn are points from each of the bounded components of C\V, - p , ( j= I , 2, . . . , 1 7 ; z E V ) and I?: U --f V a homeomorphism, then h. Using these functions, it follows from 4.59 and 4.63 that consider O j = C\U has at most n bounded components. If the actual number is m < n, make the same argument all over with the roles of U, Vreversed, to get a contradiction.
f;(z) = z
0
Exercise 4.69 If U is an open, loopfiomotopically-connected subset of @, then U is simply-connected. In particular, eoery open starlike set is simply-connected. Hints: 4.20 + 4.65. One can argue directly for starlike sets thus: If U is starlike with respect to 0, then for each z E @ \ Uall the points tz, t 2 1, also lie in C\U. Hence @\U has no bounded component. Remark: The converse of this is proved in 10.3. Notes to Chapter IV
The ideas in this approach t o the index find their appropriate culmination in the theory of covering spaces in topology. There is an important higher dimensional analog of index, called degree (due to Brouwer). See, e.g., HEINZ [1959], chapters 4, 5 of EISENACK and FENSKE [1978] or LLOYD [ 19781. For elementary accounts of aspects of plane topology similar in spirit and method to this one see PAL [1922/23], TUCKER [1945], EILENBERC [1948], FORT[1952], [1967], the last chapter of KURATOWSKI [1972], chapters VI and VII of CECH [1969] and R. F. BROWN[1974]. The classic K E R ~ K J A R [I9231 T ~ should also be consulted. (And the reader equipped to do so may also want to look at CSASZAR [1962] and CERNP[1967].) The definitive treatment of the topology of R“ is probably KURATOWSKI [ 19681. His account (especially chapter X) clearly influenced the presentation here. A very readable, less encyclopedic account, with excellent historical notes, which also introduces the reader to algebraic methods, is AGOSTON[1976]. In chapter 7 of his book, among other things relevant to the material here, the reader will find a discussion of the degree of a map mentioned above. Another elegant introduction to algebraic topology is the little book of WALL[1972]. The Greek constituents of “monodromy” show what an apt description of 4.18 this word is. There is also an important holomorphic monodromy theorem, which relates simple-connectivity and analytic continuation. See the Chapter X notes. For 4.22(i) see p. 162 of EILENBERC [1935]. For a beautiful direct proof of the implication (i) 3 (iii) in 4.24 (without the intervention of Lebesgue’s extension theorem) see pp. 326-327 of KURATOWSKI [1945]. A Banach algebra version of 4.28 will be proved in Chapter XIX.
116
The Index and Some Plane Topology
The important theorems 4.29,4.30 are from EILENBERG [1936]. There too (p. 90) the independence result 4.32(i) appears (with an inductive proof). See also KURATOWSKI [1945] and [1958]. These results (indeed most material of this chapter, with the notable exception of the Schonfliesextension theorem mentioned in 4.44) are valid, appropriately phrased, in R" as well as C = R2.The important result 4.32(iii), that the number of components of the complement of a compactum in R2 is a positional invariant, goes back to BROUWER [1912c]. It has many extensions. EILENBERG [1941] showed that if A, B are homeomorphic and Sn\A has finitely many components, then subsets of the sphere Sn(in Rn+l) this number equals the number of components of Sn\B. (If both numbers are infinite cardinals, however, they need not coincide-he adduces an example.) BORSUK[1950] supplies an elementary proof (no algebraic topology) of this when A is compact (see also p. 47 of LLOYD[ 19781) and KURATOWSKI [ 19501 (see also [ 19571, [ 19591) modifies Borsuk's proof to cover all A. FORT[ 1961 ] shows that even in case the number of components of R"\A is infinite, this cardinal equals that of the set of components of Rn\B whenever A, B are bounded, connected open subsets of Rn which are homeomorphic to each other. (Cf. 4.68.) Finally I mention that if A, B are open, connected subsets of S2 whose complements have the same finite number N of components, then A and B are homeomorphic. (See ~ E C H[1969], p. 264.) The proof of 4.37 is adapted from KAMPKE[19281.
CECH[1969]. For more on 4.36(ii) see
The union of 4.38 and 4.41 is called the Jordan Curve Theorem, even though Jordan's original proof (1887) was incomplete; he at least recognized that something here needed proof in spite of how obvious it all seems. The intuitions according to which everything here was obvious to the 19th century mind were severely jolted in 1903 when Osgood produced a Jordan-curve having non-zero area. (See, e.g., KNOPP[1917].) For the history of the many proofs of the Jordan Curve Theorem which have appeared in the literature see § I3 of BOREL and ROSENTHAL [1924], KLINE[I9421 and GUGGENHEIMER [ 19771. Most of these proofs are, not to put too fine a point on it, quite unesthetic and equally unenlightening. (The indirect proofs like that in KURATOWSKI [I9261 are exceptions to this indictment.) Remnants of the kind of geometric toil with which they abound can be found in a few of the proofs in Chapter IX in which we discuss boundary behavior of conformal maps. The proofs of 4.38-4.42 in the text are essentially from CECH[1969]. There is a complete converse ofthe Jordan theorem [ 19041 (and subsequently elaborated by many others) which due to SCH~NFLIES affirms that if C is a compact, connected subset of @ and @\C has exactly two components, for each of which every point of C is an accessible boundary point, then C is a Jordan-curve. See, e.g., M. H. A. NEWMAN[ 19511 for a complete proof.
Notes to Chapter IV
117
Exercise 4.5O(iii) is called the Gauss-Lucas theorem. See in connection with it the papers of HAYASHI[1914-15], SPECHT[1959], RUBEL[1966], MARDEN [1966], [1968], [I9761 and LABELLE [1971]. The special case of a polynomial in 4.49 is called the Fundamental Theorem of Algebra and indeed it looks like an algebraic result. But, as the conclusion is false if the coefficients and zeros sought are restricted to Q + iQ, the completeness (order, or metric) of R plays an essential role. In fact, this is the irreducible kernel of topology that is needed: given that every odd degree polynomial with real coefficients has a real zero [a trivial consequence of the connectedness of the topological space R], the Fundamental Theorem of Algebra can be proved by several purely algebraic arguments. See, e.g., the standard algebra treatises of van der Waerden and Jacobson or J. K ~ N I [1879], G NETTO[1880], WALECKI [ 18831, BRISSE[ 18861, A. KNESER[ 18871, VAHLEN[ 18971, GIUDICE[ 19071, MERTENS [I91 11, HOROWITZ [1966] c ARTINand SCHREIER [1926] (exceedingly elegant), VAN DER CORPUT[ 19501, VITALI[ 19281, D ~ R G[ 19281, E Puccro [ 19331, H. KNESER[1939], THOMAS[1940], MIGNOSI[1941], EATON [1960], and ZASSENHAUS [1967]. Interesting, more or less constructive proofs occur in MANSION[1880] (which contains a historical appendix), BLUTEL[I91I], MONTEL[ 19131, ROSENBLOOM [ 19451 and WOLFENSTEIN [ 19671. Unusual proofs occur in WEIERSTRASS [I8911 (see also Werke I, pp. 247-256 and 111, pp. 251-269), M ~ R A [1891], Y JAMET[1894], H. KNESER[1940], IGLISCH[1940], MOHR [1942], [1953a] and SCARF[1952]. A popular proof which recurs repeatedly in the literature uses compactness to select zo at which [PI has its minimum, P being a given polynomial of degree n > 0. If P(zo) # 0, an easy argument then shows that for an appropriate kth root u of 1 (k I n), the contradiction ( P ( z o+ ru)[ < IP(zo)l ensues for sufficiently small r > 0. This is supposed to be a totally elementary argument, but very often the writer falls back on the theory of the exponential function to produce such a u. The beautiful proofs in LITTLEWOOD [1941] are exceptions. (Cf. also MANSION,op. cir.) Recognizing that the existence of roots of unity is a special case of the theorem to be proved, he uses (in the second of two proofs) a modification of the argument above in conjunction with induction on the degree of P,so arranged that the requisite root of unity is provided by the induction hypothesis. This point is also recognized and circumvented nicely in POMEY[1905], in PRINGSHEIM [1925], pp. 184 ff., in SPIVAK[1967], p. 460 (this is Littlewood's first proofcf. M ~ R A Y [I8851 and § 3 of MERTENS[1892]), in ESTERMANN [1956] and in REDHEFFER [1964]. The proof in the latter and that in REDHEFFER [1957] uses elementary ideas about harmonic functions and maximum principles (see next chapter); both these papers are recommended reading. SCHMIDT [1936] and WIGERT [1936] are other interesting proofs using harmonic functions. Of course, using results about holomorphic functions, many proofs are possible : the Fundamental Theorem of Algebra is an immediate consequence of (1) Liouville's theorem (3.33) applied to the reciprocal of a zero-free polynomial, (2) the
118
The Index and Some Plane Topology
Maximum Modulus Principle (see 5.15), (3) the Open Map Theorem (5.77), (4) RouchC’s theorem (5.87), or ( 5 ) the mean value theorem 12.3. See NETTO and LEVAVASEUR119071, & 80-88 for history of this theorem and references to over 100 proofs and “proofs” of it which have occurred in the literature (up to that time!). See also LORIA118911, AGOSTINI119241, GASAPINA [1957], BA~MAKOVA 119571, [1961], 5 5 of SPECHT[1958] and PETROVA [1971], [1973], [1974]. The first proof which is acceptable by modem standards was given by C. F. Gauss, who altogether gave four more-or-less correct proofs, that in the text being a modern variant of one of them. See GAUSS118901. Prior to Gauss, J. d’Alembert had given a not entirely rigorous (but “rigorizable”) geometric proof and (so) many French writers refer to this result as “le thCor&me de op. cit.) d‘Alembert.” (See PETROVA, The result 4.51(iii) is due to KRONECKER [1857]. The suggested proof is from BIEBERBACH 119531 and is quite close to the original. For a generalization see KLOOSTERMAN 119271. Part (ii) is a trivial consequence of the Fundamental Theorem on Symmetric Polynomials, but the suggested proof is self-contained and avoids appeal to this basic result from algebra (for a proof of which the [1925].) interested reader may see, e.g., 5 25 of PRINGSHEIM The n-dimensional version of 4.53 was secured by KNASTER, KURATOWSKI and 119291. An infinite dimensional version dates from 1937. (See, MAZURKIEWICZ e.g., p. 51 of GRANAS [1962].) The first part of 4.53 was rediscovered by ABIAN [1961] and other proofs appear in ABIANand BROWN[1962] and A. B. BROWN [1962].These authors get the conclusion of 4.53 with D replaced by the inside of any Jordan curve, a corollary of 4.53 and 9.19 taken together. [ I8791 but is often attributed to SCH~NFLIES [ 18991. 4.57 first occurs in JURGENS [1900], SCHONFLIES Proofs were also supplied by OSGOOD[1900], F. BERNSTEIN 119271, and NOBELING119501. 119081(pp. 162-164), PAL [1922/23], WINTERNITZ The n-dimensional version was secured by BROUWER 11912al and another proof 119361. (See also OSTROWSKI 119461.) The proof in the text occurs in EILENBERG is from GRANAS [1962], chapter VII. This result is called the “invariance of domain” and is closely related to the problem of the (topological) invariance of the dimension number n in R”. (Cf. the Remark following 4.58.) The latter problem was treated by J. Liiroth, G.Cantor and others in the late 19th century (see DAUBEN 119751) but only definitively resolved by BROUWERin 119 I I], amid an interesting controversy. In a note following Brouwer’s in the 191 1 Mathematische Annalen Henri Lebesgue claimed to give a simple proof of the invariance of the dimension number. This proof was in error at several points and totally inadequate from the point of view of logical completeness. Though Lebesgue never recanted (as Brouwer intensely hoped and campaigned that he would), in subsequent patch-up attempts (none completely successful) he gave birth to the important concept that lies at the basis of modern (covering) dimension theory.
Notes to Chapter IV
I19
(See SPERNER [I9281 and HUREWICZ [1929]. For the fascinating details of the controversy, including the names of other protagonists, the reader should see FREUDENTHAL [1975] and his notes on pp. 435-452 of BROUWER [1976]. Exercise 4.58 was conjectured by Ulam and proved by BORSUK[1933a]. Its meteorological interpretation seems to be due to H. Steinhaus. For history and extensions see $ 59.V of KURATOWSKI [1968], as well as HADWIGER [1959], [1960]. E.g., in 1944 H. Hopf proved the following: w i t h 5 S as in 4.58, for every d E [0, 21 there exist points x, y E S with IIx - yll = d and f ( x ) = f(y). See WILLE[1970] and NOWINSKI [1974] for extensions of Hopf's result.
HEILBRONN [I9581 gives the following extension of 4.59: for any open U C and continuous f: U+C\{O} there exist holomorphic h: U - t C and continuous +: U + @ such thatf = he". On the theme of 4.63 see RUDIN[1955b]. For extensions of many of the results of $ 6 to the infinite dimensional (i.e., Banach space) setting see the beautiful little monograph of GRANAS[1962] or the book of EISENACK and FENSKE[1978].
120
Chapter V Consequences of the Cauchy-Goursat TheoremMaximum Principles and the Local Theory 51
Goursat’s Lemma and Cauchy’s Theorem for Starlike Regions
Of great utility in the differential calculus of functions on R are primitives or antiderivatives. The Fundamental Theorem here affirms that integration always produces such primitives. In particular, every continuous function on R has a primitive. [We will see that this is not so for continuous functions on regions in C.] Naturally we look to integration to produce primitives in the plane too. But now we must face the fact that integration can be carried out over many paths from z,, to z, whereas if the integrandfhas a primitive F, then the integral over any such path must equal F(z) - F(z,) (see 2.10) and be consequently independent of the path chosen. This independence of path is equivalent to the integral over any closed path being 0. Conversely, when the integral is path independent, a primitive can be manufactured by using an “indefinite” integral (see the proof of 2.1 I). Thus the corresponding fundamental theorem@) in the plane affirm that certain integrals over closed paths are 0. Everything flows from Theorem 5.1 (Cauchy-Goursat) Let U be an open subset of C, f holomorphic in U,a, 6, C E C andco{a, b, c} c U. Thenj[n,b.c,al f = 0.
Proof: Write A for co{a, b, c} and d for the diameter of A. If d = 0, then a = b = c and the assertion is trivial. So we suppose d > 0. Consider b+c a’ = -
2 ’
b’
=
a + c , -
2 ’
a+b c’ = -
By 2.9
J
ln.b.c.nl
f = j f+S [n.bl
Ib.Cl
f + JIc.01 f
2 .
8 1. Goursat's Lemma and Cauchy's Theorem for Starlike Regions
121
Notice that the sets co{a, c', b'}, cdc', bya'}, co{a', c, b'} and co{a', b', c'} each lie in co{a, by c} and each has diameter not greater than 3 the diameter of co{a, by c), by 1.19. It follows from (1) that at least one of the integrals on its right side has modulus not less than aljIa,b,o,al f l ; that is, there are points aI,bl, c1 with co{al, bl, cl} = A1 such that (A1 c A, diam Al I 2-1 diam A and
Proceed inductively to construct, for every positive integer n, points a,, b,, c, with A, = co{a,, b,, c,} satisfying (A,, c A,,-ly diam A,, I 2-1 diamA,-l
and
Now by induction on this we have for all positive integers n (2.n)
A, c A,-l c
- - - c A.
(3.n) diam A, I 2-"d.
According to 1. I 9(ii) An is compact. From (2.n) therefore it follows that there exists zo E A, c U. Therefore given e > 0, there exists r = r(e) > 0 so small that
n;-l
that is, (5)
Iz - zol < r
=- Z E U and If(z) - f(zo) -f'(zo)(z
- zo)l I elz - zoI.
Now it follows from ( 3 4 that for n > (logd/r)/log2 all points of A, lie in D(zo,r) and so ( 5 ) and (3.n) show that (6)
t~
log d/r > - and z E A, log 2
=>
If@)
- f(zo) - f'(z,,)(z - zo)l I 2-"de.
By 2.9(ii) the length of the curve [a,, b,, c,, a,] is not greater than 3 diam A, I 3.2-"d. It follows then from (6) and 2.9(i) that
(7)
n >log d'r 3 log
I
If(z) [%.bn.cnvanl
- f(zo) - f'(zo)(z - z0)]dz
I
I3.4-"dae.
Consequences of the Cauchy-Goursat Theorem
122
It follows from this and ( 4 4 that
lJab. 1
(9)
.e.al
As
E
f
5
3daE.
> 0 is arbitrary in (9),the theorem follows.
Corollary 5.2 (Cauchy's Theorem for Starlike Regions) I f Q is an open starlike subset of C and f is holomorphic in a, then there is a holomorphic function F in Q such that F' = f. Therefore f = 0 for every piecewise smooth loop y in Q.
ly
Proof: Let Q be starlike with respect to a. Then [a,z] c Q for every z E Q and it is possible to form the integrals
F(z)
f
=
VZEER.
ta,zl
Let z1E Q be given. Take r > 0 so that D(z,, r ) c Q and consider in what follows only z E D(zl, r). For such z we have [Zl, 21
= N Z l , r) = a
and this implies that co{a, zl,z } c Q. For if w E co{a,zl,z}, then w = AOU ha = 1. If Al + A, > 0, then
+ Alzl+ &Z
for A, 2 0 with A,
+ Al +
and, calling the square-bracketed term z', we have that z' E [zl,z] c R, and so w E [a, 2'3 c Q. The last theorem therefore applies and gives @)
- F(z,)
=
1 f -1 f 1 =
[a.4
[a.zll
f.
[Z~.ZI
It follows just as in the proof of 2.11 that F'(z,) exists and equals f(zl). Then
I,,f = o follows from 2. IO(ii).
Exercise 5.3 (Sneak preview) Deduce from 5.2 and 3.39 that ifsis holomorpltic in an open set U,then in fact f is infinitely differentiable and even locally of poner series type in U.
8 1. Goursat's Lemma and Cauchy's Theorem for Starlike Regions
123
Hints: The problem is a local one, so assume U is a disk. Then 5.2 furnishes a primitive F for f. Since F' = f, we know F' is continuous. Consequently by 3.39(ii) F has a power series expansion valid throughout U. By 3.6 so does$ As an immediate and not atypical application of 5.2 we have Exercise 5.4 (i) Prove that
Hints: The function
is entire. Therefore for the piecewise smooth loop
Cauchy's Theorem for Convex Regions gives
S_:
/i(x)dx
Since
the result follows. Show that (ii)
- ni
= -i [
Ir,h
exp(ire'x)k
=
0. It follows that
Consequences of the Cauchy-Goursat Theorem
124
Hints: Integrating by parts, we see that
Therefore from part (i) follows
2sinar T 2 s - + r- s ; +2r- < - . (iii)
n
2r
Show that
Hints:
Therefore
4
(iv)
Hints:
Show that
1
+ ;=
<;
by part (ii).
4
r
8 1. Goursat's Lemma and Cauchy's Theorem for Starlike Regions
Integrate by parts twice to get 2Jr -r
4 sin3 r cos r 3 r2
r cos r _ 43-sin3r2
X2
sin4 x
=-
-
si;3 x [_-_sin x -
125
2 cos x x3
sin3 x cos x
du
' j ' --adx sin4 x +j
-I
x
sin4 x
dx.
It follows then from parts (ii) and (iii) that sin4 x
dx exists and equals
-.2737
Therefore
(v)
Show that
Hint: In
(sin y/y)dy set y
=
x2 and recall part (i).
Lemma 5.5 Let c E @, 0 < a < b < co and g be holomorphic in the annulus A = { z E @ : a < Iz - CI < b}. Then (i) j; g(c re2"ff)dtis a constantfunction o f r E ( a , 6). I f g is confinuous in D(c, 6 ) and holomorphic in D(c, b)\(cJ, then (ii) g ( c ) = j:,g(c rez**l)dt vo < r < 6.
+
+
Proof: We may assume c = 0. Define E(z) = e' for z E l2 = (log a , log b) x Iw. It is easy to see that 12 is open and convex and E maps Q into A. Let r, R E ( a , b) be given and set y =
[log r , log R, log R
+ Zvi, log r + 2 ~ ilog , r].
Consequences of the Cauchy-Goursat Theorem
126
Evidently y maps into 0,is piecewise smooth and is closed. Apply 5.2 to the function f = g 0 E, which is holomorphic in Q. We get
0=
s,56
f(t log R
f=
+ (1 - t ) log r)(log R - log r)dt
+ j12 f(log R + 2ni(t - 1))2nidt + s,"f ( ( t - 2) log r + (3 - t ) log R + 24(10g r - log ~ ) d t -
1
f(1og r
= (log R
+ 2ni(4 - t))2nidt
- log r ) /
1
g ~ (logt R
+ (1 - t ) log r)dt
0
+2nilg
0
E(log R
+ 2nit)dt
1
+ (log r - log R)
g 0 E(t log r
+ (1 - 1 ) log R)dt
0
- 2ni jol g E(i0g r + 2nit)dt, by changing variables and using the 2ri-periodicity of E. By the change of variable 7 = 1 - t the first integral is found to be equal to the third. Thus we get
I
g 0 E(log r
+ 2nit)dt =
5,'
g 0 E(1og R
+ 2~it)dt,
that is, I.1
"1
0
0
J
g(rean")dt = J g(Reanit)dt.
Since r, R are arbitrary in (a, b), part (i) is established. In the last equation let R J. 0 and cite the continuity of g at c = 0 to see that
tends to 0, thus proving (ii).
8 2. Maximum Principles
92
127
Maximum Principles
With a view toward later applications it is convenient to atomize the theory and proceed a bit more generally here than our immediate goals dictate. For the moment the next definition serves merely as a convenient abbreviation; the rationale for the terminology will emerge later.
Definition 5.6 Let U be an open subset of @, f: U +- R a continuous function. Say that f is subharmonic in U if (*)
f(a) 5
1 %J0
f(a
+ retO)dO
whenever D(a, r ) c 17Say . that f is superharmonic in U if -f is subhaImonic in U ;i.e., if the reverse inequality always obtains in (*). The integrals in (*) are called circumferential means off.
Exercise 5.7 Let U be an open subset of @, F : U - t @ holomorphic. Show that f = ReF is both subharmonic and superharmonicin U and that IF I is subharmonic in U .
Hint: Whenever &a, r ) c U use 5.5(ii) to show that equality holds in (*) above. As to IF[,pass I I through the integral in 5S(ii). Remark: In 5.21(ii) we will see that for harmonic functions equality holds in (*). The proof suggested for 5.7 then shows that the modulus of a harmonic
function is subharmonic.
Theorem 5.8 (Maximum Principle) Let Q be a region, f a subharmonicfunction a.Iff attains a maximum in Q, then f is constant.
in
Proof: Supposef attains a maximum over Q at some point a E Q. Then whenever R > 0 is such that D(a, R) c Q, we have from (*) above that
0 s JO2' If(a f reio) - f(u)]dO, 0 5 r < R. On the other hand, f - f ( a ) I 0 throughout Q, by definition of a, so the integrand above is non-positive. Being continuous, its integral can only be nonnegative if it is identically 0. We infer that f ( a reio)- f ( a ) = 0 VO E [0,2s].
+
This holds for all r E [0, R), so we conclude that f ( z ) = f ( a ) Vz E D(a, R).
Let S2, be the set of all points at which f attains its maximum value, M say, over Q. Thus R, = f - I ( M ) and by hypothesis a,,is not empty. Sincef is continuous, Q, is relatively closed in Q. The result of the first paragraph says that a, is open. Since S2 is connected, it follows that a, = a.
Consequences of the Cauchy-Goursat Theorem
128
Scholium This proof does not use the full force of the definition 5.6. In fact an examination of the proof shows that the desired conclusion follows iff is continuous and for each a E R there is some r4 > 0 such that inequality (*) of 5.6 holds for all r < r4. (Cf. 5.23 for a further weakening.)
Corollary 5.9 If U is a bounded open Subset of 62,f : 0 -+ R is continuous and f is subharmonic in U , then sup f ( V ) = sup f ( 8 V ) .
Proof: Since the boundary of each component of U lies wholly in aU, it suffices to treat connected U. V is compact, so f attains a maximum in 0. If this occurs in U, then f is constant in U (hence in V ) by 5.8. Otherwise this maximum occurs on 8U. In either case the asserted equality is obvious.
Corollary 5.10 (Maximum Modulus Principle) Let R be a region, F a holomorphic function in R. If Re F, IRe F1 or I FI attains a maximum in In, then F is constant . Proof: If /Re FI attains a maximum in R, then this is either the maximum of Re F or of -Re F = Re( - F). In either case Re F is constant by 5.7 and 5.8. Then F is constant by 2.17(ii).
If IF1 attains a maximum in Q at zo, write F(zo) = eteIF(z0)I for some real d and observe that the maximum of the function Re(O-*OF)in 0 is attained at zo and is lF(zo)l. From the result of the first paragraph it follows that ,-*OF, whence F itself, is constant.
Corollary 5.11 Let fI be a region, f:(1 + R harmonic. If either f o r a maximum in R, then f is constant.
If1
attaiiis
Proof: As in the proof of 5.10, it suffices to treat the case where ,f attains a maximum in Q. I n this case cite 5.5(ii) and the Scholium above.
Theorem 5.12-Let U be a bounded open subset of C, h srihharnioiiic i i i L’ a i d suppose that lim,--zo h(z) I M for every zo E irU. Then h is b o w i d d uhorc