Graduate Texts in Mathematics
11
Editorial Board
F. W. Gehring
P. R. Halmos
Managing Editor
C. C. Moore

Graduate Texts in Mathematics
1 T AKEUTI/ZARING. Introduction to Axiomatic Set Theory. 2nd ed.
2 OXTOBY. Measure and Category. 2nd ed.
3 SCHAEFFER. Topological Vector Spaces.
4 HIL TON/ST AMMBACH. A Course in Homological Algebra.
5 MACLANE. Categoes for the Working Mathematician.
6 HUGHES/PIPER. Projective Planes.
7 SERRE. A Course in Arithmetic.
8 T AKEUTI/ZARING. Axiometic Set Theory.
9 HUMPHREYS. Introduction to Lie Algebras and Representation Theory.
10 COHEN. A Course in Simple Homotopy Theory.
11 CONWAY. Functions of One Complex Variable, 2nd ed.
12 BEALS. Advanced Mathematical Analysis.
13 ANDERSON/FuLLER, Rings and Categories of Modules.
14 GOLUBITSKy/GuILLEMIN. Stable Mappings and Their Singularities.
15 BERBERIAN. Lectures in Functional Analysis and Operator Theory.
16 WINTER. The Structure of Fields.
17 ROSENBLATT. Random Processes, 2nd ed.
18 HALMOS. Measure Theory.
19 HALMOS. A Hilbert Space Problem Book. 2nd ed., revised.
20 HUSEMOLLER, Fibre Bundles. 2nd ed.
21 HUMPHREYS. Linear Algebraic Groups.
22 BARNEs/MACK. An Algebraic Introduction to Mathematical Logic.
23 GREUB. Linear Algebra. 4th ed.
24 HOLMES. Geometric Functional Analysis and its Applications.
25 HEWITT/STROMBERG. Real and Abstract Analysis.
26 MANES. Algebraic Theories.
27 KELLEY. .General Topology.
28 ZARISKI/SAMUEL, Commutative Algebra. Vol. I.
29 ZARISKIISAMUEL. Commutative Algebra. Vol. II.
30 JACOBSON. Lectures in Abstract Algebra I: Basic Concepts.
31 JACOBSON. Lectures in Abstract Algebra II: Linear Algebra.
32 JACOBSON. Lectures in Abstract Algebra III: Theory of Fields and Galois Theory.
33 HIRSCH. Differential Topology,
34 SPITZER. Principles of Random Walk. 2nd ed.
35 WERMER. Banach Algebras and Several Complex Variables. 2nd ed.
36 KELLEy/NAMIOKA et al. Linear Topological Spaces,
37 MONK. Mathematical Logic.
38 GRA UERT/FRITZSCHE. Several Complex Variables.
39 ARVESON. An Invitation to C*-Algebras.
40 KEMENy/SNELL/KNAPP. Denumerable Markov Chains. 2nd ed.
41 APOSTOL. Modular Functions and Dirichlet Series in Number Theory.
42 SERRE. Linear Representations of Finite Groups.
43 GILLMAN/JERIsON, Rings of Continuous Functions.
44 KENDIG, Elementary Algebraic Geometry.
45 LOEVE. Probability Theory I. 4th ed.
46 LOEVE. Probability Theory II. 4th ed.
47 MOISE. Geometric Topology in Dimensions 2 and 3.
continued after Index

John B. Conway
Functions of
One Complex Variable
Second Edition
With 30 Illustrations
Springer- Verlag
New York Berlin Heidelberg Tokyo

John B. Conway
Department of Mathematics
Indiana University
Bloomington, IN 47405
USA
Editorial Board
P. R. Halmos
F. W. Gehring
Department of Mathematics
University of Michigan
Ann Arbor, MI 48104
USA
C. C. Moore
Department of Mathematics
Indiana University
Bloomington, IN 47405
USA
Department of Mathematics
University of California
Berkeley, CA 94720
USA
AMS Subject Classification: 30-0 I
Library of Congress Cataloging in Publication Data
Conway, John B
Functions of one complex variable,
(Graduate texts in mathematics ; II)
Bibliography: p.
Includes index.
I. Functions of complex variables. I. Title.
II. Series.
QA331.C659 1978 515'.93 78-18836
@ 1973, 1978 by Springer-Verlag New York Inc,
All rights reserved, No part of this book may be translated or reproduced in any form without
written permission from Springer-Verlag, 175 Fifth Avenue, New York, New York, 10010,
USA,
Prin ted and bound by R. R, Donnelley & Sons, Harrisonburg, Virginia,
Printed in the United States of America,
9 8 7 6 543
Third printing, 1984
ISBN 0-387-90328-3
ISBN 3-540-90328-3
Springer-Verlag New York Berlin Heidelberg Tokyo
Springer- Verlag Berlin Heidelberg New York Tokyo

To
Ann

PREFACE
This book is intended as a textbook for a first course in the theory of
functions of one complex variable for students who are mathematically
mature enough to understand and execute E - 8 arguments. The actual pre-
requisites for reading this book are quite minimal; not much more than a
stiff course in basic calculus and a few facts about partial derivatives. The
topics from advanced calculus that are used (e.g., Leibniz's rule for differ-
entiating under the integral sign) are proved in detail.
Complex Variables is a subject which has something for all mathematicians.
In addition to having applications to other parts of analysis, it can rightly
claim to be an ancestor of many areas of mathematics (e.g., homotopy theory,
manifolds). This view of Complex Analysis as "An Introduction to Mathe-
matics" has influenced the writing and selection of subject matter for this book.
The other guiding principle followed is that all definitions, theorems, etc.
should be clearly and precisely stated. Proofs are given with the student in
mind. Most are presented in detail and when this is not the case the reader is
told precisely what is missing and asked to fill in the gap as an exercise. The
exercises are varied in their degree of difficulty. Some are meant to fix the
ideas of the section in the reader's IJ;lind and some extend the theory or give
applications to other parts of mathematics. (Occasionally, terminology is used
in an exercise which is not defined-e.g., group, integral domain.)
Chapters I through V and Sections Vr.I and VI.2 are basic. It is possible
to cover this material in a single semester only if a number of proofs are
omitted. Except for the material at the beginning of Section VI.3 on convex
functions, the rest of the book is independent of VI. 3 and VI.4.
Chapter VII initiates the student in the consideration of functions as
points in a metric space. The results of the first three sections of this chapter
are used repeatedly in the remainder of the book. Sections four and five need
no defense; moreover, the Weierstrass Factorization Theorem is necessary
for Chapter XI. Section six is an application of the factorization theorem.
The last two sections of Chapter VII are not needed in the rest of the book
although they are a part of classical mathematics which no one should
completely disregard.
The remaining chapters are independent topics and may be covered in any
order desired.
Runge's Theorem is the inspiration for much of the theory of Function
Algebras. The proof presented in section VIlLI is, however, the classical one
involving "pole pushing". Section two applies Runge's Theorem to obtain a
more general form of Cauchy's Theorem. The main results of sections three
and four should be read by everyone, even if the proofs are not.
Chapter IX studies analytic continuation and introduces the reader to
analytic manifolds and covering spaces. Sections one through three can
be considered as a unit and will give the reader a knowledge of analytic
vii

viii
Preface
continuation without necessitating his going through all of Chapter IX.
Chapter (X studies harmonic functions including a solution of the Dirichlet
Problem and the introduction of Green's Function. If this can be called
applied mathematics it is part of applied mathematics that everyone should
know.
Although they are independent, the last two chapters could have been
combined into one entitled "Entire Functions". However, it is felt that
Hadamard's Factorization Theorem and the Great Theorem of Picard are
sufficiently different that each merits its own chapter. Also, neither result
depends upon the other.
With regard to Picard's Theorem it should be mentioned that another
proof is available. The proof presented here uses only elementary arguments
while the proof found in most other books uses the modular function.
There are other topics that could have been covered. Some consideration
was given to including chapters on some or all of the following: conformal
mapping, functions on the disk, elliptic functions, applications of Hilbert
space methods to complex functions. But the line had to be drawn somewhere
and these topics were the victims. For those readers who would like to explore
this material or to further investigate the topics covered in this book, the
bibliography contains a number of appropriate entries.
Most of the notation used is standard. The word "iff" is used in place of
the phrase "if and only if", and the symbol II is used to indicate the end of a
proof. When a function (other than a path) is being discussed, Latin letters
are used for the domain and Greek letters are used for the range.
This book evolved from classes taught at Indiana University. I would like
to thank the Department of Mathematics for making its resources available
to me during its preparation. I would especially like to thank the students
in my classes; it was actual1y their reaction to my course in Complex Variables
that. made me decide to take the plunge and write a book. Particular thanks
should go to Marsha Meredith for pointing out several mistakes in an early
draft, to Stephen Berman for gathering the material for several exercises on
algebra, and to Larry Curnutt for assisting me with the final corrections of the
manuscript. I must also thank Ceil Sheehan for typing the final draft of the
manuscript under unusual circumstances.
Finally, I must thank my wife to whom this book is dedicated. Her
encouragement was the most valuable assistance I received.
John B. Conway

PREFACE FOR THE SECOND EDITION
I have been very pleased with the success of my book. When it was
apparent that the second printing was nearly sold out, Springer- Verlag
asked me to prepare a list of corrections for a third printing. When I
mentioned that I had some ideas for more substantial revisions, they
reacted with characteristic enthusiasm.
There are four major differences between the present edition and its
predecessor. First, John Dixon's treatment of Cauchy's Theorem has been
included. This has the advantage of providing a quick proof of the theorem
in its full generality. Nevertheless, I have a strong attachment to the
homotopic version that appeared in the first edition and have proved this
form of Cauchy's Theorem as it was done there. This version is very
geometric and quite easy to apply. Moreover, the notion of homotopy is
needed for the later treatment of the monodromy theorem; hence, inclu-
sion of this version yields benefits far in excess of the time needed to
discuss it.
Second, the proof of Runge's Theorem is new. The present proof is due
to Sandy Grabiner and does not use "pole pushing". In a sense the "pole
pushing" is buried in the concept of uniform approximation and some
ideas from Banach algebras. Nevertheless, it should be emphasized that the
proof is entirely elementary in that it relies only on the material presented
in this text.
N ext, an Appendix B has been added. This appendix contains some
bibliographical material and a guide for further reading.
Finally, several additional exercises have been added.
There are also minor changes that have been made. Several colleagues
in the mathematical community have helped me greatly by providing
constructive criticism and pointing out typographical errors. I wish to
thank publicly Earl Berkson, Louis Brickman, James Deddens, Gerard
Keough, G. K. Kristiansen, Andrew Lenard, John Mairhuber, Donald C.
Meyers, Jeffrey Nunemacher, Robert Olin, Donald Perlis, John Plaster,
Hans Sagan, Glenn Schober, David Stegenga, Richard Varga, James P.
Williams, and Max Zorn.
Finally, I wish to thank the staff at Springer-Verlag New York not only
for their treatment of my book, but also for the publication of so many
fine books on mathematics. In the present time of shrinking graduate
enrollments and the consequent reluctance of so many publishers to print
advanced texts and monographs, Springer-Verlag is making a contribution
to our discipline by increasing its efforts to disseminate the recent develop-
ments in mathematics.
John B. Conway
ix

Preface
I.
II.
III.
IV.
v.
TABLE OF CONTENTS
The Complex Number System
 1. The real numbers .
2. The field of complex numbers .
3. The complex plane
4. Polar representation and roots of complex numbers .
5. Lines and half planes in the complex plane
6. The extended plane and its spherical representation .
Metric Spaces and the Topology of C
 1. Definition and examples of metric spaces .
2. Connectedness
3. Sequences and completeness
4. Compactness
5. Continuity
6. Uniform convergence
Elementary Properties and Examples of Analytic Functions
 1. Power series .
2. Analytic functions .
3. Analytic functions as mappings, Mobius transformations .
Complex Integration
 1. Riemann-Stieltjes integrals
2. Power series representation of analytic functions
3. Zeros of an analytic function .
4. The index of a closed curve
5. Cauchy's Theorem and Integral Formula.
6. The homotopic version of Cauchy's Theorem and
simple connectivity
7. Counting zeros; the Open Mapping Theorem .
8. Goursat's Theorem
Singulari ties
1. Classification of singularities .
2. Residues
3. The Argument Principle .
xi
. Vll
1
1
3
4
6
8
11
14
17
20
. 24
. 28
30
33
. 44
58
68
76
. 80
83
87
97
. 100
. 103
. 112
. 123

xu
Table of Contents
VI. The Maximum Modulus Theorem
l. The Maximum Principle
2. Schwarz's Lemma .
3. Convex functions and Hadamard's Three Circles Theorem
14. Phragmen-Lindelof Theorem .
VII. Compactness and Convergence in the
Space of Analytic Functions
l. The space of continuous functions C(G,Q)
2. Spaces of analytic functions
3. Spaces of meromorphic functions
4. The Riemann Mapping Theorem
5. Weierstrass Factorization Theorem .
6. Factorization of the sine function
7. The gamma function
8. The Riemann zeta function
VIII. Runge's Theorem
 1. Runge's Theorem .
2. Simple connectedness
3. Mittag-Leffler's Theorem
IX. Analytic Continuation and Riemann Surfaces
 1. Schwarz Reflection Principle .
2. Analytic Continuation Along A Path
3. Mondromy Theorem
. Topological Spaces and Neighborhood Systems
5: The Sheaf of Germs of Analytic Functions on an Open Set
6. Analytic Manifolds
7. Covering spaces
X. Harmonic Functions
 1. Basic Properties of harmonic functions
2. Harmonic functions on a disk.
3. Subharmonic and superharmonic functions
4. The Dirichlet Problem .
5. Green's Functions .
XI. Entire Functions
1. Jensen's Formula .
2. The genus and order of an entire function
3. Hadamard Factorization Theorem .
. 128
. 130
· 133
· 138
. 142
. 151
. 155
. 160
. 164
. 174
. 176
. 187
. 195
. 202
· 204
. 210
. 213
. 217
. 221
. 227
. 233
. 245
. 252
. 256
. 263
. 269
. 275
· 280
· 282
. 287

Table of Contents
XII. The Range of an Analytic Function
1. Bloch's Theorem .
2. The Little Picard Theorem
3. Schottky's Theorem
4. The Great Picard Theorem
XUI
. 292
. 296
. 297
. 300
Appendix A: Calculus for Complex Valued Functions on . . 303
an Interval
Appendix B: Suggestions for Further Study and
Bibliographical Notes . . 307
References . . 311
Index . . 313
List of Symbols . 317

Chapter I
The Complex Number System
1. The real numbers
We denote the set of all real numbers by IR. It is assumed that each
reader is acquainted with the real number system and all its properties. In
particular we assume a knowledge of the ordering of , the definitions and
properties of the supremum and infimum (sup and inf), and the complete-
ness of  (every set in  which is bounded above has a supremum). It is
also assumed that every reader is familiar with sequential convergence in
 and with infinite series. Finally, no one should undertake a study of
Complex Variables unless he has a thorough grounding in functions of one
real variable. Although it has been traditional to study functions of several
real variables before studying analytic function theory, this is not an
essential prerequisite for this book. There will not be any occasion when
the deep results of this area are needed.
2. The field of complex numbers
We define C, the complex numbers, to be the set of all ordered pairs
(a, b) where a and b are real numbers and where addition and multiplication
are defined by:
(a, b)+(c, d) = (a+c, b+d)
(a, b) (c, d) = (ac-bd, bc+ad)
I t is easily checked that with these definitions C satisfies all the axioms for
a field. That is, C satisfies the associative, commutative and distributive
laws for addition and multiplication; (0,0) and (1, 0) are identities for
addition and multiplication respectively, and there are additive and multi-
plicative inverses for each nonzero element in C.
We will write a for the complex number (a, 0). This mapping a  (a, 0)
defines a field isomorphism of IR into C so we may consider IR as a subset of
C. If we put i = (0, 1) then (a, b) = a+bi. From this point on we abandon
the ordered pair notation for complex numbers.
Note that i 2 = -1, so that the equation Z2 + 1 = 0 has a root in C. In
fact, for each z in C, Z2+ 1 = (z+i) (z-i). More generally, if z and ware
complex numbers we obtain
Z2+W 2 = (z+iw) (z-iw)
1

2 The Complex Number System
By letting z and w be real numbers a and b we can obtain (with both a and
b =1= 0)
1 a - ib a ( b )
a+ib = a 2 +b 2 = a 2 +b 2 - i a 2 +b 2
so that we have a formula for the reciprocal of a complex number.
When we write z = a + ib (a, b E ) we call a and b the real and imaginary
parts of z and denote this by a = Re z, b = 1m z.
We conclude this section by introducing two operations on C which are
not field operations. If z = x+ iy(x, y E ) then we define Izi = (x 2 + y2)"!- to
be the absolute value of z and z = x- iy is the conjugate of z. Note that
2.1
/z12 = zz
In particular, if z =1= 0 then
1 z
Z Izl 2
The following are basic properties of absolute values and conjugates
whose verifications are left to the reader.
2.2
1
Rez = t(z+z) and Imz = 2i (z-z).
2.3
2.4
2.5
2.6
( z+w ) = z+ w and zw = z w .
Izwl = Izi/wi.
Iz/wl = Iz/llwl.
/z/ = /zl.
The reader should try to avoid expanding z and w into their real and
imaginary parts when he tries to prove these last three. Rather, use (2.1),
(2.2), and (2.3).
Exercises
1. Find the real and imaginary parts of each of the following:
1 z - a ( ) 3 3 + 5i ( -1 + iJ3 ) 3 ;
-.--aEozo 0
z ' z + a " 7i + 1 ' 2
( - 1 - i J 3 ) 6 0 on 0 ( 1 + i ) n
2 ' I, --/2 for 2 < n < 8.
2. Find the absolute value and conjugate of each of the following:
3-i i
-2+i; -3; (2+i) (4+3i); j- 3 .;  3 ;
V 2+ 1 l+
(l+i)6; i 17 .

The complex plane 3
3. Show that z is a real number if and only if z = z.
4. If z and ware complex numbers, prove the following equations:
Iz+wl 2 = Iz1 2 +2Re z w + Iw1 2 .
Iz-wl 2 = Iz12-2Re z w + Iw1 2 .
Iz+wl 2 + Iz-wl 2 = 2(lzI2+ IwI 2 ).
5. Use induction to prove that for z = Z1 +.. .+zn; w = W 1 W 2 ... w n :
Iwl = Iw 1 1...lw n l;z=Z1+...+ Z n; w = w 1 ... w n-
6. Let R(z) be a rational function of z. Show that R(z) = R(z) if all the
coefficients in R(z) are real.
3. The complex plane
From the definition of complex numbers it is clear that each z in C can
be identified with the unique point (Re z, 1m z) in the plane [R2. The addition
of complex numbers is exactly the addition law of the vector space [R2.
If z and ware in C then draw the straight lines from z and w to ,0 ( = (0, 0)).
These form two sides of a parallelogram with 0, z and w as three vertices.
The fourth vertex turns out to be z + w.
Note also that Iz - wi is exactly the distance between z and w. With this
in mind the last equation of Exercise 4 in the preceding section states the
parallelogram law: The sum of the squares of the lengths of the sides of a
parallelogram equals the sum of the squares of the lengths of its diagonals.
A fundamental property of a distance function is that it satisfies the
triangle inequality (see the next chapter). In this case this inequality becomes
I Z 1- Z 21 < I Z 1- Z 31 + I Z 3- Z 21
for complex numbers z 1, Z2, Z 3. By using z 1 - Z2 = (z 1 - z 3) + (z 3 - Z2), it is
easy to see that we need only show
3.1
jz+wl < Izi + Iwl (z, WE C).
To show this first observe that for any z in C,
3.2 -izi < Re z < Izi
-izi < Imz < Izl
Hence, Re (z w ) < Izwl = Izllwl. Thus,
Iz+wl 2 = Izj2+2Re (z w ) + Iwl 2
< Izl2+2lzllwl + Iw/ 2
= (izi + Iw1)2,
from which (3.1) follows. (This is called the triangle inequality because, if we
represent z and w in the plane, (3.1) says that the length of one side of the
triangle [0, z, z + w] is less than the sum of the lengths of the other two sides.
Or, the shortest distance between two points is a straight line.) On encounter-

4 The Complex Number System
ing an inequality one should always ask for necessary and sufficient conditions
that equality obtains. From looking at a triangle and considering the geo-
metrical significance of (3.1) we are led to consider the condition z = tw
for some t E!R, t > o. (or w = tz if w = 0). It is clear that equality will
occur when the two points are colinear with the origin. In fact, if we look
at the proof of (3.1) we see that a necessary and sufficient condition for
Iz+ wi = Izi + Iwl is that Izwl = Re (zw). Equivalently, this is z w > 0 (i.e., z w
is a real number and is non negative). Multiplying, this by w/w we get
IwI 2 (z/w) > 0 if w i= o. If
t = zJw = C12 ) IwI 2 (zJw)
then t > 0 and z = two
By induction we also get
3.3
I Z t+ Z 2+...+znl < I Z ll+l z 21+...+l z nl
Also useful is the inequality
3.4
Ilzl-lwll < Iz-wl
Now that we have given a geometric interpretation of the absolute value
let us see what taking a complex conjugate does to a point in the plane.
This is also easy; in fact, z is the point obtained by reflecting z across the
x-axis (i.e., the real axis).
Exercises
1. Prove (3.4) and give necessary and sufficient conditions for equality.
2. Show that equality occurs in (3.3) if and only if Zk/Zl > 0 for any integers
k and I, 1 < k, 1 < n, for which z I i= o.
3. Let a E !R and c > 0 be fixed. Describe the set of points z satisfying
Iz-al-Iz+al = 2c
for every possible choice of a and c. Now let a be any complex number
and, using a rotation of the plane, describe the locus of points satisfying the
above equation.
4. Polar representation and roots of complex numbers
Consider the point z = x + iy in the complex plane C. This point has
polar coordinates (r, ()): x = r cos 8, y = r sin 8. Clearly r = Izi and () is
the angle between the positive real axis and the line segment from 0 to z.
Notice that () plus any multiple of 27T can be substituted for () in the above
equations. The angle 8 is called the argument of z and is denoted by 8 = arg z.
Because of the ambiguity of 8, "arg" is not a function. We introduce the
notation
4.1
cis () = cos () + i sin e.

Polar representation and roots of complex numbers 5
Let Zl = r 1 cis 8 1 , Z2 = r2 cis ° 2 . Then Zl Z 2 = r 1 r2 cis (}1 cis ° 2 = r 1 r 2
[(cos ° 1 cos (}2-sin ° 1 sin (2)+i (sin ° 1 cos 02+ sin ° 2 cos ( 1 )]. By the
formulas for the sine and cosine of the sum of two angles we get
4.2
Z 1 Z 2 = r 1 r 2 cis (8 1 + ( 2 )
Alternately, arg (z 1 Z 2) = arg Z 1 + arg z 2. (What function of a real variable
takes products into sums?) By induction we get for Zk = r k cis 0b 1 < k < n.
4.3
Z 1 Z 2 . . . Z" = r 1 r 2 . . . r n cis (0 1 +. · . + On)
In particular,
4.4
Zn = r n cis (nO),
for every integer n > O. Moreover if Z i= 0, z' [r - 1 cis (- 0)] = 1; so that
(4.4) also holds for all integers n, positive, negative, and zero, if z i= o. As a
special case of (4.4) we get de M oivre's formula:
(cos 8 + i sin 8)n = cos nO + i sin nO.
We are now in a position to consider the following problem: For a given
complex number a i= 0 and an integer n > 2, can you find a number z
satisfying zn = a? How many such z can you find? In light of (4.4) the
solution is easy. Let a = laj cis a; by (4.4), z = jal 1/n cis (a/n) fills the bill.
However this is not the only solution because z' = lajl/n cis  (IX + 21T) also
n
satisfies (z,)n = a. In fact each of the numbers
1
lal 1/n cis - (a + 27Tk), 0 < k < n-l,
n
4.5
in an nth root of a. By means of (4.4) we arrive at the following: for each
non zero number a in C there are n distinct nth roots of a; they are given by
formula (4.5).
Example
Calculate the nth roots of unity. Since 1 = cis 0, (4.5) gives these roots as
27T 47T 27T
1, cis - , cis - , . . . , cis - (n - 1).
n n n
In particular, the cube roots of unity are
1 1- 1 I -
I, ):2 tI+iv3), )2 (I-i, 3).
Exercises
1. Find the sixth roots of unity.

6 The Complex Number System
2. Calculate the following:
(a) the square roots of i
(b) the cube roots of i
(c) the square roots of 3 + 3i
3. A primitive nth root of unity is a complex number a such that
l,a,a 2 ,... ,an-I are distinct nth roots of unity. Show that if a and bare
primitive nth and mth roots of unity, respectively, then ab is a kth root of
unity for some integer k. What is the smallest value of k? What can be said
if a and bare nonprimitive roots of unity?
4. Use the binomial equation
(a+b)n = t ( n ) an-kb\
k=O k
where
(z) = k!(nnk)! '
and compare the real and imaginary parts of each side of de Moivre's
formula to obtain the formulas:
cos n8 = cos n 8- () cosn- 2 sin 2 8+ () cosn- 4 8 sin 4 8-. . .
sin n8 = (;) cos n - 1 8 sin 8 - (;) cosn- 3 8 sin 3 8+. . .
. 2 . 1
5. Let z = CIS - for an Integer n > 2. Show that 1 +z+. . . +zn- = o.
n
6. Show that rp(t) = cis t is a group homomorphism of the additive group
[R onto the multiplicative group T = {z: Izi = I}.
7. If Z E C and Re(z n) > 0 for every positive integer n, show that z is a
non-negative real number.
5. Lines and half planes in the complex plane
Let L denote a straight line in C. From elementary analytic geometry,
L is determined by a point in L and a direction vector. Thus if a is any point
in Land b is its direction vector then
L= {z=a+tb:-oo<t< oo}.
Since b =/:: 0 this gives, for z in L,
ID1; ( z b a ) = O.
In fact if z is such that
then
( z - a )
o = 1m b
( z - a )
t= -
b

Lines and half planes in the complex plane
implies that z = a + tb, - 00 < t < 00. That is
7
5.1
L = {z: 1m ( z b a ) = o} .
What is. the locus of each of the sets
{ z: 1m ( : b a) > o} ,
{ z: 1m ( z b a) < o} ?
As a first step in answering this question, observe that since b is a direction
we may assume Ibl = 1. For the moment, let us consider the case where
a = 0, and put Ho = {z: 1m (z/b) > O}, b = cis f3. If z = r cis () then
z/b = r cis (O-f3). Thus, z is in Ho if and only if sin (O-f3) > 0; that is, when
f3 < 0 < 7T + f3. Hence Ho is the half plane lying to the left of the line L if
Ho
we are "walking along L in the direction of b." If we put
Ha = {z: 1m (= b a) > o}
then it is easy to see that Ha = a+Ho = {a+w: WE Ho}; that is, Ha is the
translation of H 0 by a. Hence, Ha is the half plane lying to the left of L.
Similarly,
Ka = {z: 1m ( z b a) < o}
is the half plane on the right of L.
Exercise
1. Let C be the circle {z: Iz-cl = r}, r > 0; let a = c+r cis (X and put

8
The Complex Number System
Lp = {z: 1m ( z b a ) = o}
where b = cis p. Find necessary and sufficient conditions in terms of f3 that
Lp be tangent to C at a.
6. The extended plane and its spherical representation
Often in complex analysis we will be concerned with functions that be-
come infinite as the variable approaches a given point. To discuss this situa-
tion we introduce the extended plane which is C u {oo} = Coo. We also
wish to introduce a distance function on Coo in order to discuss continuity
properties of functions assuming the value infinity. To accomplish this
and to give a concrete picture of Coo we represent Coo as the unit sphere
in 1R3
,
s = {( Xl' X 2' x 3) E IR 3 : xi + x + x = I}.
Let N = (0, 0, 1); that is, N is the north pole on S. Also, identify C with
{(XI' X2, 0): XI' X2 E IR} so that C cuts S along the equator. Now for each
point z in C consider the straight line in 1R3 through z and N. This intersects
N
 I
" //
'........ ,.../
"""'-----
the sphere in exactly one point Z i= N. If Izl > 1 then Z is in the northern
hemisphere and if Izl < 1 then Z is in the southern hemisphere; also, for
Izl = 1, Z = z. What happens to Z as Izl --+ oo? Clearly Z approaches N;
hence, we identify N and the point 00 in Coo. Thus Coo is represented as
the sphere S.
Let us explore this representation. Put z = x + iy and let Z = (x 1, X 2' x 3)
be the corresponding point on S. We will find equations expressing Xb X2,
and X3 in terms of x and y. The line in 1R3 through z and N is given by
{tN+(l-t)z: -00 < t < oo}, or by
6.1
{«l-t)x, (l-t)y, t): - 00 < t < oo}.
Hence, we can find the coordinates of Z if we can find the value of t at

The extended plane and its spherical representation
which this line intersects S. If t is this value then
1 = (1- t)2X2 +(1- t)2y2 + t 2
= (l-t)2/Z/2+t 2
9
From which we get
l-t 2 = {1-t)2/Z/2.
Since t i= I (z i= (0) we arrive at
/z/2_1
t = IZ/2 + 1 ·
Thus
6.2
2x 2y /z/2_1
Xl = /z/2+1' X2 = /ZI2+1 ' X3 = /z/2+1
But this gives
6.3
z+i
x =
1 Izl 2 + I
x 2 =
- i ( z - i)
Iz1 2 + 1
Iz1 2 -1
x=
3 I z l 2 + 1 .
If the point Z is given (Z =1= N) and we wish to find z then by setting
t = X3 and using (6.1), we arrive at
XI+ ix 2
z=
I- X 3
Now let us define a distance function between points in the extended
plane in the following manner: for z, z' in Coo define the distance from z to z',
d(z, z'), to be the distance between the corresponding points Z and Z' in 1R3.
If Z = (Xl' X2, X3) and Z' = (x;, X2, x)) then
6.4
6.5
d(z, z') = [(Xl - X;)2 + (X 2 - X2)2 + (X 3 - X))2]t
Using the fact that Z and Z' are on S, (6.5) gives
6.6
[d(z, Z')]2 = 2-2(x 1 x{ +X2 X 2+ X 3 X ))
By using equation (6.3) we get
6.7
d ( ' ) 21 z - z' I ' )
z, z = [(1 + IZJ2) (1 + IZ'12)Ji-' (z, z E C
In a similar manner we get for z in C
6.8
2
d ( z (0 ) =
, (I + Izl 2 )t
This correspondence between points of S and Coo is called the stereographic
projection.

10
Exercises
The Complex Number System
1. Give the details in the derivation of (6.7) and (6.8).
2. For each of the following points in C, give the corresponding point of
s: 0, 1 + i, 3 + 2i.
3. Which subsets of S correspond to the real and imaginary axes in C.
4. Let A be a circle lying in S. Then there is a unique plane P in 3 such
that P () S = A. Recall from analytic geometry that
P = {(Xl' X2, X 3 ): Xlf3l +X2f32+X3f33 = I}
where ({31, (32' (33) is a vector orthogonal to P and I is some real number.
It can be assumed that f3f+f3+f3 = 1. Use this information to show that
if A contains the point N then its projection on C is a straight line. Otherwise,
A projects onto a circle in C.
5. Let Z and Z' be points on S corresponding to z and z' respectively. Let
W be the point on S corresponding to z+z'. Find the coordinates of W in
terms of the coordinates of Z and Z'.

Chapter II
Metric Spaces and the Topology of C
1. Definition and examples of metric spaces
A metric space is a pair (X, d) where X is a set and d is a function from
X x X into , called a distance function or metric, which satisfies the following
conditions for x, y, and z in X:
d(x, y) > 0
d(x, y) = 0 if and only if x = y
d(x, y) = d(y, x) (symmetry)
d(x, z) < d(x, y) + d(y, z) (triangle inequality)
If x and r > 0 are fixed then define
B(x; r) = {y EX: d(x, y) < r}
R(x; r) = {y E X: d(x, y) < r}.
B(x; r) and R(x; r) are called the open and closed balls, respectively, with
center x and radius r.
Examples
1.1 Let X =  or C and define d(z, w) = Iz-wl. This makes both (IR, d)
and (C, d) metric spaces. In fact, (C, d) will be the example of principal
interest to us. If the reader has never encountered the concept of a metric
space before this, he should continually keep (C, d) in mind during the study
of this chapter.
1.2 Let (X, d) be a metric space and let Y eX; then (Y, d) is also a metric
space.
1.3 Let X = C and define d(x+iy, a+ib) = Ix-al + Iy-b/. Then (C, d) is
a metric space.
1.4 Let X = C and define d(x+iy, a+ib) = max {Ix-al, Iy-bl}.
1.5 Let X be any set and define d(x, y) = 0 if x = y and d(x, y) = 1 if x i= y.
To show that the function d satisfies the triangle inequality one merely
considers all possibilities of equality among x, y, and z. Notice here that
B(x; E) consists only of the point x if € < 1 and B(x; E) = X if € > 1. This
metric space does not appear in the study of analytic function theory.
1.6 Let X = n and for x = (Xl' . . . , x n ), Y = (Yl' . . . , Yn) in IR n define
d(x,y) = Ltl (X j - y j )2f
11

12 Metric Spaces and the Topology of C
1.7 Let S be any set and denote by B(S) the set of all functions I: S  C
such that
11/1100 = sup {1/(s)l: s E S} < 00.
That is, B(S) consists of all complex valued functions whose range is con-
tained inside some disk of finite radius. For f and g in B(S) define d(j; g) =
11/- glloo. We will show that d satisfies the triangle inequality. In fact if f,
g, and h are in B(S) and s is any point in S then I/(s) - g(s) I = If(s) - h(s) +
h(s) - g(s) I < If(s) -h(s)! + Ih(s) - g(s) I < IIf-h 1100 + Ilh - g 1100. Thus, when the
supremum is taken over all s in S, Ilf- glloo < Ilf-h 1100 + II h - glloo, which is
the triangle inequality for d.
1.8 Definition. For a metric space (X, d) a set G c X is open if for each
x in G there is an E > 0 such that B(x; E) c G.
Thus, a set in C is open if it has no "edge." For example, G = {z E C:
a < Re z < b} is open; but {z: Re z < O} u {O} is not because B(O; E) is not
contained in this set no matter how small we choose E.
We denote the empty set, the set consisting of no elements, by D.
1.9 Proposition. Let (X, d) be a metric space; then:
(a) The sets X and D are open; n
(b) If G 1 , . · . , G n are open sets in X then so is n G k ;
k=l
(c) If {G j : j E J} is a collection of open sets in X, J any indexing set,
then G = U {G j: j E J} is also open.
n
Proof The proof of (a) is a triviality. To prove (b) let x E G = n G k ; then
k=l
x E G k for k = 1, . . . , n. Thus, by the definition, for each k there is an Ek > 0
such that B(x; Ek) c G k . But if E = min {E1, E2, . . . , En} then for 1 < k < n
B(x; E) c B(x; Ek) C G k . Thus B(x; E) c G and G is open.
The proof of (c) is left as an exercise for the reader. II
There is another class of subsets of a metric space which are distinguished.
These are the sets which contain all their "edge"; alternately, the sets whose
complements have no "edge."
1.10 Definition. A set F c X is closed if its complement, X - F, is open.
The following proposition is the complement of Proposition 1.9. The
proof, whose execution is left to the reader, is accomplished by applying
de Morgan's laws to the preceding proposition.
1.11 Proposition. Let (X, d) be a metric space. Then:
(a) The sets X and D are closed; n
(b) If F 1 , · · · , Fn are closed sets in X then so is U F k ;
k=l
(c) If {F j : j E J} is any collection 01 closed sets in X, J any indexing set,
then F = n {F j : j E J} is also closed.
The most common error made upon learning of open and closed sets
is to interpret the definition of closed set to mean that if a set is not open it is

Definition and examples of metric spaces 13
closed. This, of course, is false as can be seen by looking at {z E C: Re z > O}
u {O}; it is neither open nor closed.
1.12 Definition. Let A be a subset of X. Then the interior of A, int A, is the
set U {G: G is open and G c A}. The closure of A, A-, is the set n {F: F
is closed and F  A}. Notice that int A may be empty and A - may be X.
If A = {a+bi: a and b are rational numbers} then simultaneously A- = C
and int A = D. By Propositions 1.9 and 1.11 we have that A- is closed and
int A is open. The boundary of A is denoted by 8A and defined by 8A = A-
() (X-A)-.
1.13 Proposition. Let A and B be subsets of a metric space (X, d). Then:
(a) A is open if and only if A = int A;
(b) A is closed if and only if A = A - ;
(c) int A = X-(X-A)-; A-  X-int (X-A); 8A = A--int A;
(d) (A U B)- = A - u B-;
(e) Xo E int A if and only if there is an E > 0 such that B(xo; E) c A;
(f) Xo E A - if and only if for every E > 0, B(xo; E) () A =1= D.
Proof The proofs of (a)-(e) are left to the reader. To prove (f) assume
Xo E A- = X -int (X -A); thus, Xo ft int (X -A). By part (e), for every
E > 0 B(x 0 ; E) is not contained in X-A. That is, there is a point Y E B(x 0 ; E)
which is not in X-A. Hence, Y E B(xo; E) fl A. Now suppose Xo ft A - =
X - int (X - A). Then Xo E int (X-A) and, by (e), there is an E > 0 such
that B(xo; E) c X-A. That is, B(xo; E)flA = 0 so that Xo does not
satisfy the condition. _
Finally, one last definition of a distinguished type of set.
1.14 Definition. A subset A of a metric space X is dense if A - = X.
The set of rational numbers Q is dense in  and {x+iy: x, YEQ} is
dense in C.
Exercises
1. Show that each of the examples of metric spaces given in (1.2)-( 1.6) is,
indeed, a metric space. Example (1.6) is the only one likely to give any
difficulty. Also, describe B (x; r) for each of these examples.
2. Which of the following subsets of C are open and which are closed: (a)
{z:lzl<l}; (b) the real axis; (c) {z:zn=1 for some integer n > l}; (d)
{z E C: z is real and 0 < z < I }; ( e) {z E C : z is real and 0 < Z < 1 } ?
3. If (X, d) is any metric space show that every open ball is, in fact, an open
set: Also, show that every closed ball is a closed set.
4. Give the details of the proof of (1.9c).
5. Prove Proposition 1.11.
6. Prove that a set G c X is open if and only if X - G is closed.
7. Show that (Coo, d) where d is given by (I. 6.7) and (I. 6.8) is a metric space.
8. Let (X, d) be a metric space and Y c X. Suppose G c X is open; show

14 Metric Spaces and the TOpOlOgy of C
that G () Y is open in (Y, d). Conversely, show that if G 1 c Y is open in
(Y, d), there is an open set G c X such that G 1 = G () Y.
9. Do Exercise 8 with "closed" in place of "open."
10. Prove Proposition 1.13.
11. Show that {cisk: k > O} is dense in T= {z E C: Izi = I}. For which
val ues of () is {cis( k(}) : k > O} dense in T?
2. Connectedness
Let us start this section by giving an example. Let X = {z E C: Iz/ < I}
u {z: /z-31 < I} and give X the metric it inherits from C. (HencefoFward,
whenever we consider subsets X of  or C as metric spaces we will assume,
unless stated to the contrary, that X has the inherited metric d(z, w) = Iz - }Vl.)
Then the set A = {z: Iz/ < I} is simultaneously open and closed. It is closed
because its complement in X, B = X - A = {z: Iz - 31 < I} is open; A is
open because if a E A then B(a; 1) c A. (Notice that it may not happen
that {z E C: Iz - a/ < I} is contained in A-for example, if a = 1. But the
definition of B(a; 1) is {ZEX: /z-al < I} and this is contained in A.)
Similarly B is also both open and closed in X.
This is an example of a non-connected space.
2.1 Definition. A metric space (X, d) is connected if the only subsets of X
which are both open and closed are D and X. If A c X then A is a connected
subset of X if the metric space (A, d) is connected.
An equivalent formulation of connectedness is to say that X is not
connected if there are disjoint open sets A and B in X, neither of which is
empty, such that X = A u B. In fact, if this condition holds then A = X - B
is also closed.
2.2 Proposition. A set X c  is connected iff X is an interval.
Proof. Suppose X = [a, b], a and b elements of . Let A c X be an open
subset of X such that a E A, and A i= X. We will show that A cannot also be
closed-and hence, X must be connected. Since A is open and a E A there is
an € > 0 such that [a, a+€) c A. Let
r = sup {€: [a,a+€) c A}
Claim. [a, a+r) c A. In fact, if a < x < a+r then, putting h = a+r-x > 0,
the definition of supremum implies there is an € with r - h < € < rand
[a, a+€) c A. But a < x = a+(r-h) < a+€ implies x E A and the claim is
established.
However, a+r ft A; for if, on the contrary, a+r E A then, by the openness
of A, there is as> 0 with [a+r, a+r+S) c A. But this gives [a, a+r+S}
c A, contradicting the definition of r. Now if A were also closed then a + r E B
= X-A which is open. Hence we could find as> 0 such that (a + r - S,
a + r] c B, contradicting the above claim.
The proof that other types of intervals are connected is similar and it will
be left as an exercise.
The proof of the converse is Exercise 1. II

Connectedness 15
If wand z are in C then we denote the straight line segment from z to w
by
[z, w] = {tw+(I-t)z: 0 < t < I}
n
A polygon from a to b is a set P = U [Zk' w k ] where Zl = a, W n = band
k=1
W k = Zk+ 1 for 1 < k < n -1; or, P = [a, Z 1 . . . Zn, b].
2.3 Theorem. An open set Gee is connected iff for any two points a, b in
G there is a polygon from a to b lying entirely inside G.
Proof Suppose that G satisfies this condition and let us assume that G is
not connected. We will obtain a contradiction. From the definition, G =
A U B where A and B are both open and closed, A () B = D, and neither
A nor B is empty. Let a E A and b E B; by hypothesis there is a polygon P
from a to' b such that peG. Now a moment's thought will show that one
of the segments making up P will have one point in A and another in B.
So we can assume that P = [a, b]. Define,
s = {s E [0,1]: sb+(I-s)a E A}
T = {t E [0,1]: tb+(I-t)a E B}
Then S () T = D, S u T = [0, 1], 0 E Sand 1 E T. However it can be shown
that both Sand T are open (Exercise 2), contradicting the connectedness of
[0, 1]. Thus, G must be connected.
Now suppose that G is connected and fix a point a in G. To show how to
construct a polygon (lying in G!) from a to a point b in G would be difficult.
But we don't have to perform such a construction; we merely show that one
exists. For a fixed a in G define
A = {b E G: there is a polygon peG from a to b}.
The plan is to show that A is simultaneously open and closed in G. Since
a E A and G is connected this will give that A = G and the theorem will be
proved.
To show that A is open let' b EA and let P = [a, Zl'...' Zm b] be a
polygon from a to b with peG. Since G is open (this was not needed in the
first half), there is an € > 0 such that B(b; E) c G. But if Z E B(b; E) then
[b, z] c B(b; E) c G. Hence the polygon Q = P u [b, z] is inside G and goes
from a to z. This shows that B(b; E) c A, and so A is open.
To show that A is closed suppose there is a point Z in G - A and let € > 0
be such that B(z; E) C G. If there is a point b in A () B(z; E) then,' as above,
we can construct a polygon from a to z. Thus we must have that B(z; E) n A
= D, or B(z; E) C G - A. That is, G - A is open so that A is closed. II
2.4 Corollary. If Gee is open and connected and a and b are points in G
then there is a polygon P in G from a to b which is made up of line segments
parallel to either the real or imaginary axis.
Proof There are two ways of proving this corollary. One could obtain a

16 Metric Spaces and the Topology of C
polygon in G from a to b and then modify each of its line segments so that a
new polygon is obtained with the desired properties. However, this proof
is more easily executed using compactness (see Exercise 5.7). Another proof
can be obtained by modifying the proof of Theorem 2.3. Define the set A as
in the proof of (2.3) but add the restriction that the polygon's segments are
all parallel to one of the axes. The remainder of the proof will be valid with
one exception. If z E B(b; E) then [b, z] may not be parallel to an axis. But it
is easy to see that if z = x + iy, b = p + iq then the polygon [b, p + iy] u
[p+iy, z] c B(b; E) and has segments parallel to an axis. II
It will now be shown that any set S in a metric space can be expressed,
in a canonical way, as the union of connected pieces.
2.5 Definition. A subset D of a metric space X is a component of X if it is a
maximal connected subset of X. That is, D is connected and there is no
connected subset of X that properly contains D.
If the reader examines the example at the beginning of this section he
will notice that both A and B are components and, furthermore, these are
the only components of X. For another example let X = {O, 1, 1, j-, . . .}.
Then clearly every component of X is a point and each point is a component.
Notice that while the components H} are all open in X, the component {O}
is not.
2.6 Lemma. Let Xo E X and let {D j: j E J} be a collection of connected subsets
of X such that Xo E D j for each j in J. Then D = U {D j: j E J} is connected.
Proof Let A be a subset of the metric space (D, d) which is both open and
closed and suppose that A i= D. Then A (\ D j is open in (D j, d) for each j
and it is also closed (Exercises 1.8 and 1.9). Since D j is connected we get that
either A (\ D j = 0 or A () D j = D j. Since A i= 0 there is at least one k
such that A () Dk i= 0; hence, A (\ Dk = Dk. In particular x 0 E A so that
Xo E A () Dj for every j. Thus A (\ Dj = Dj, or Dj c A, for each index j.
This gives that D = A, so that D is connected. _
2.7 Theorem. Let (X, d) be a metric space. Then:
(a) Each Xo in X is contained in a component of X.
(b) Distinct components of X are disjoint.
Note that part (a) says that X is the union of its components.
Proof (a) Let !?) be the collection of connected subsets of X which contain
the given point Xo. Notice that {xo} E !?) so that fg i= D. Also notice that
the hypotheses of the preceding lemma apply to the collection !?). Hence
C = U {D: D E fg} is connected and Xo E C. But C must be a component.
In fact, if D is connected and C c D then x 0 E D so that DE!!); but then
D c C, so that C = D. Thus C is maximal and part (a) is proved.
(b) Suppose C 1 and C 2 are components, C 1 i= C 2 , and suppose there is
a point Xo in C 1 () C 2 . Again the lemma says that C 1 u C 2 is connected.

Sequences and completeness 17
Since both C 1 and C 2 are components, this gives C 1 == C I U C 2 == C 2 , a
contradiction. II
2.8 Proposition. (a) If A c X is connected and A c B c A -, then B is connected.
(b) If C is a component of X then C is closed.
The proof is left as an exercise.
2.9 Theorem. Let G be open in C; then the components of G are open and
there are only a countable number of them.
Proof Let C be a component of G and let Xo E C. Since G is open there is an
€ > 0 with B(xo; E) c G. By Lemma 2.6, B(xo; E) U C is connected and so
must be C. That is B(xo; E) c C and C is, therefore, open.
To see that the number of components is countable let S == {a+ ib:
a and b are rational and a + bi E G}. Then S is countable and each com-
ponent of G contains a point of S, so that the number of components is
countable. II
Exercises
1. The purpose of this exercise is to show that a connected subset of  is an
interval.
(a) Show that a set A c R is an interval iff for any two points a and b
in A with a < b, the interval [a, b] c A.
(b) Use part (a) to show that if a set A c R is connected then it is an
interval.
2. Show that the sets Sand T in the proof of Theorem 2.3 are open.
3. Which of the following subsets X of C are connected; if X is not connected,
what are its components: (a) X == {z: Izi < I} U {z: Iz - 2/ < 1 }. (b) X ==
[0,1) u {1+ : n > I}. (c) X = C-(A U B) where A = [0,00) and B =
{z == r cis 8: r == 8, 0 < 8 < oo}?
4. Prove the following generalization of Lemma 2.6. If {D j: j E J} is a
collection of connected subsets of X and if for each j and k in J we have
Dj n Dk i= D then D == U {D j : j E J} is connected.
5. Show that if F c X is closed and connected then for every pair of points
a, b in F and each E > 0 there are points z 0' z l' . . . , Zn in F with z 0 == a,
Zn == band d(Zk-l' Zk) < E for 1 < k < n. Is the hypothesis that F be closed
needed? If F is a set which satisfies this property then F is not necessarily
connected, even if F is closed. Give an example to illustrate this.
3. Sequences and completeness
One of the most useful concepts in a metric space is that of a convergent
sequence. Their central role in calculus is duplicated in the study of metric
spaces and complex analysis.
3.1 Definition. If {Xl' X2'..'} is a sequence in a metric space (X, d) then

18 Metric Spaces and the Topology of C
{xn} converges to x-in symbols x = lim x n or x n  x-if for every E > 0
there is an integer N such that d(x, x n ) < € whenever n > N.
Alternately, x = lim X n if 0 = lim d(x, x n ).
If X = C then Z = lim Zn means that for each € > 0 there is an N such
that Iz-znl < € when n > N.
Many concepts in the theory of metric spaces can be phrased in terms
of sequences. The following is an example.
3.2 Proposition. A set F c X is closed iff for each sequence {x n } in F with
x = lim X n we have x E F.
Proof. Suppose F is closed and x = lim X n where each X n is in F. So for every
€ > 0, there is a point X n in B(x; E); that is B(x; E) n F i= D, so that x E F-
= F by Proposition 2.8.
Now suppose F is not closed; so there is a point Xo in F- which is not
in F. By Proposition 1.13(f), for every € > 0 we have B(xo; E) n F i= D.
In particular for every integer n there is a point X n in B( Xo; ) n F. Thus,
d(xo, x n ) < ! which implies that X n - Xo. Since Xo rt F, this says the con-
n
dition fails. II
3.3 Definition. If A c X then a point x in X is a limit point of A if there
is a sequence {xn} of distinct points in A such that x = lim Xn.
The reason for the word "distinct" in this definition can be illustrated
by the following example. Let X = C and let A = [0, 1] u {i}; each point
in [0, 1] is a limit point of A but i is not. We do not wish to call a point such
as i a limit point; but if "distinct" were dropped from the definition we
could taken X n = i for each i and have i = lim Xn.
3.4 Proposition. (a) A set is closed iff it contains all its limit points.
(b) If A c X then A- = A u {x: x is a limit point of A}.
The proof is left as an exercise.
From real analysis we know that a basic property of  is that any sequence
whose terms get closer ,together as n gets large, must be convergent. Such
sequences are called Cauchy sequences. One of their attributes is that you
know the limit will exist even though you can't produce it.
3.5 Definition. A sequence {xn} is called a Cauchy sequence if for every
€ > 0 there is an integer N such that d(xn, x m ) < € for all n, m > N.
If (X, d) has the property that each Cauchy sequence has a limit in X
then (X, d) is complete.
3.6 Proposition. C is complete.
Proof If {x n + iYn} is a Cauchy sequence in C then {x n } and {Yn} are Cauchy
sequences in . Since  is complete, X n  x and Yn  Y for points x, Y in .
It follows that x + iy = lim (xn + iYn), and so C is complete. II
Consider Coo with its metric d (I. 6.7 and I. 6.8). Let Zm Z be points in C;

Sequences and completeness 19
it can be shown that d(zm z) -7 0 if and only if IZn - zl -7 O. In spite of this,
any sequence {zn} with lim IZnl == 00 is Cauchy in Coo, but, of course, is not
Cauchy in C.
If A c X we define the diameter of A by diam A == sup {d(x, y): x and
yare in A}.
3.7 Cantor's Theorem. A metric space (X, d) is complete iff for any sequence
00
{Fn} of non-empty closed sets with F 1  F 2  . . . and diam Fn -7 0, n Fn
consists of a single point. n = I
Proof Suppose (X, d) is complete and let {Fn} be a sequence of closed sets
having the properties: (i) F 1  F 2  . . . and (ii) lim diam Fn == O. For each
n, let X n be an arbitrary point in Fn; if n, m > N then X n , X m are in FN so that,
by definition, d(xn, x m ) < diam FN' By the hypothesis N can be chosen
sufficiently large that diam FN < E; this shows that {xn} is a Cauchy sequence.
Since X is complete, x 0 == lim X n exists. Also, X n is in F N for all n > N
00
since Fn c F N ; hence, Xo is in FN for every N and this gives Xo E n Fn == F.
n=1
So F contains at least one point; if, also, y is in F then both x 0 and yare in
Fn for each n and this gives d(xo, y) < diam Fn -7 O. Therefore d(xo, y) == 0,
or Xo == y.
Now let us show that X is complete if it satisfies the stated condition.
Let {xn} be a Cauchy sequence in X and put Fn == {xn, X n + l' . . .} -; then
F 1  F;  . . . . If E > 0, choose N such that d(xn, x m ) < E for each n,
m > N; this gives that diam {xn, X n + 1, . . .} < € for n > N and so diam
Fn < E for n > N (Exercise 3). Thus diam Fn -7 0 and, by hypothesis, there
is a point Xo in X with {xo} == F 1 (\ F 2 (\ . .. . In particular Xo is in Fm
and so d(xo, x ll ) < diam Fn -7 o. Therefore, Xo == lim Xn- II
There is a standard exercise associated with this theorem. It is to find a
sequence of sets {Fn} in  which satisfies two of the conditions:
(a) each Fn is closed,
(b) F 1  F 2  . . . ,
(c) diam Fn  0;
but which has F == F 1 (\ F 2 (\ . . . either empty or consisting of more than
one point. Everyone should get examples satisfying the possible combina-
ti 0 n s.
3.8 Proposition. Let (X, d) be a complete metric space and let Y c X. Then
(Y, d) is a complete metric space iff Y is closed in X.
Proof. I t is left as an exercise to show that ( Y, d) is complete whenever Y is
a closed subset. Now assume ( Y, d) to be complete; let Xo be a limit point
of Y. Then there is a sequence {Yn} of points in Y such that xo=limYn'
Hence {Yn} is a Cauchy sequence (Exercise 5) and must converge to a
point Yo in Y, since (Y, d) is complete. I t follows that Yo = Xo and so Y
contains all its limit points. Hence Y is closed by Proposition 3.4. II

20
Exercises
Metric Spaces and the Topology of C
1. Prove Proposition 3.4.
2. Furnish the details of the proof of Proposition 3.8.
3. Show that diam A = diam A -.
4. Let Zn, Z be points in C and let d be the metric on Coo. Show that IZn - zi  0
if and only if d(zn' z)  O. Also show that if IZnl  00 then {ZIJ} is Cauchy
in Coo. (Must {zn} converge in Coo?)
5. Show that every convergent sequence in (X, d) is a Cauchy sequence.
6. Give three examples of non complete metric spaces.
7. Put a metric d on  such that IXn - xl  0 if and only if d(xn, x)  0,
but that {xn} is a Cauchy sequence in (, d) when IXnl  00. (Hint: Take
inspiration from Coo.)
8. Suppose {xn} is a Cauchy sequence and {x nk } is a subsequence that is
convergent. Show that {xn} must be convergent.
4. Compactness
The concept of compactness is an extension of the benefits of finiteness to
infinite sets. Most properties of compact sets are analogues of properties
of finite sets which are quite trivial. For example, every sequence in a finite
set has a convergent subsequence. This is quite trivial since'there must be at
least one point which is repted an infinite number of times. However the
same statement remais true if "finite" is replaced by "compact."
4.1 Definition. A subset K of a metric space X is compact if for every collec-
tion c:g of open sets in X with the property
4.2
KCU{G:GEc:g},
there is a finite number of sets G 1 , . . . , G n in c:g such that K c G 1 U G 2 U
. . . u G II" A collection of sets c:g satisfying (4.2) is called a cover of K; if
each member of c:g is an open set it is called an open cover of K.
Clearly the empty set and all finite sets are compact. An example of a
non compact set is D = {z E C: Izi < I}. IfG n = {z: Izi < 1 -l} for n =
2, 3, . . . , then {G 2 , G 3 , . . .} is an open cover of D for which there is no
finite subcover.
4.3 Proposition. Let K be a compact subset of X; then:
(a) K is closed;
(b) If F is closed and F c K then F is compact.
Proof To prove part (a) we will show that K = K-. Let Xo E K-; by Pro-
position 1.13(f), B(xo; €) n K =1= 0 for each € > O. Let G n = X-B(xo;)
00 00
and suppose that Xo ft K. Then each G n is open and K c U G n (because n
n=l n=l

Compactness
21
B( X 0; ) = {x o }). Since K is compact there is an integer m such that
K c 0 G n . But G 1 C G 2 C ... so that K c G m = X-B ( XO;  ) . But this
n=l m
gives that B( xo;  ) () K = 0, a contradiction. Thus K = K-.
To prove part !b) let q; be an open cover of F. Then, since F is closed,
q; u {X - F} is an open cover of K. Let G 1, . . . , G n be sets in q; such that
Ke G 1 u...uGnU(X-F). Clearly, Fe G. u...uG n and so F is
compact. II
If :F is a coIlection of subsets of X we say that :F has the finite inter-
section property (f.i.p.) if whenever {F 1 , F 2 , . . . , Fn} e :F, F 1 n F 2 n . . . n
Fn # D. An example of such a collection is {D - G 2 , D - G 3, . . .} where
the sets G n are as in the example preceding Proposition 4.3.
4.4 Proposition. A set K e X is compact iff every collection :F of closed
subsets of K with the fi.p. has n {F: FE:F} # D.
Proof Suppose K is compact and :F is a collection of closed subsets of K
having the f.i.p. Assume that n {F: FEg;} = D and let q; = {X-F:
FEff}. Then, U {X-F: FEff} = X - n {F: FE:F} = X by the
assumption; in particular, q; is an open cover of K. Thus, there are F 1 , . . . ,
n n n
Fn E:F such that K e U (X - F k ) = X - n Fk. But this gives that n f
k=l k=l n k=l
e X - K, and since each Fk is a subset of K it must be that n Fk = D. This
contradicts the f.i. p. k = 1
The proof of the converse is left as an exercise. II
4.5 Corollary. Every compact metric space is complete.
Proof This follows easily by applying the above proposition and Theorem
3.7. II
4.6. Corollary. If X is compact then every infinite set has a limit point in X.
Proof Let S be an infinite subset of X and suppose S has no limit points.
Let {a 1, a 2 ,...} be a sequence of distinct points in S; then Fn = {an,
an + l' · . .} also has no limit points. But if a set has no limit points it contains
all its limits points and must be closed! Thus, each Fn is closed and {Fn:
00
n > I} has the f.i.p. However, since the points aI' a 2 , . . . are distinct, n Fn
= D, contradicting the above proposition. II n = 1
4.7 Definition. A metric space (X, d) is sequentially compact if every sequence
in X has a convergent subsequence.
. It will be shown that compact and sequentially compact metric spaces
are the same. To do this the following is needed.
4.8 Lebesgue's Covering Lemma. If (X, d) is sequentially compact and

22 Metric Spaces and the Topology of C
CfJ is an open cover of X then there is an E > 0 such that if x is in X, there is a
set G in cg with B(x; E) C G.
Proof The proof is by contradiction; suppose that CfJ is an open cover of X
and no such E > 0 can be found. In particular, for every integer n there is a
point X n in X such that B( X n ; ) is not contained in any set G in eg. Since X
is sequentially compact there is a point x 0 in X and a subsequence {x nk }
such that Xo == lim x nk . Let Go E CfJ such that Xo E Go and choose E > 0
such that B(xo; E) C Go. Now let N be such that d(xo, x nk ) < E/2 for all
n k > N. Let n k be any integer larger than both Nand 2/E, and let y E B(x nk ;
link). Then d(xo, y) < d(xo, x nk )+d(X llk , y) < E/2+ link < E. That is, B(x nk ;
link) c B(xo; E) eGo, contradicting the choice of x nk . II
There are two common misinterpretations of Lebesgue's Covering
Lemma; one implies that it says nothing and the other that it says too much.
Since cg is an open covering of X it follows that each x in X is contained in
some G in CfJ. Thus there is an E > 0 such that B(x; E) C G since G is open.
The lemma, however, gives one E > 0 such that for any x, B(x; E) is con-
tained in some member of CfJ. The other misinterpretation is to believe that
for the E > 0 obtained in the lemma, B(x; E) is contained in each G in CfJ
such that x E G.
4.9. Theorem. Let (X, d) be a metric space; then the following are equivalent
statements:
(a) X is compact;
(b) Every infinite set in X has a limit point;
(c) X is sequentially compact;
(d) X is complete and for every E > 0 there are a finite number of points
x b . . . , x n in X such that
n
X == U B(x k ; E).
k=l
(The property mentioned in (d) is called total boundedness.)
Proof That (a) implies (b) is the statement of Corollary 4.6.
(b) implies (c): Let {x n } be a sequence in X and suppose, without loss of
generality, that the points Xl' X 2, . . . are all distinct. By (b), the set {x 1,
X2'...} has a limit point Xo. Thus there is a point x n1 E B(xo; 1); similarly,
there is an integer n 2 > nl with x n2 E B(xo; 1/2). Continuing we get integers
n l < n 2 <. . . , with x nk E B(xo; Ilk). Thus, Xo == lim x nk and X is sequen-
tially compact.
(c) implies (d): To see that X is complete let {x n } be a Cauchy
sequence, apply the definition of sequential compactness, and appeal to
Exercise 3.8.
Now let E > 0 and fix Xl E X. If X == B(x 1; E) then we are done; other-
wise choose X2 EX - B(x l ; E). Again, if X == B(Xl; E) U B(x 2 ; E) we are done;

Compactness 23
if not, let X3 EX -[B(x 1 ; E) U B(X2; E)]. If this process never stops we find a
sequence {xn} such that
n
Xn+l EX - U B(x k ; E).
k=l
But this implies that for n #- m, d(xn, x m ) > E > O. Thus {XII} can have no
convergent subsequence, contradicting (c).
(d) implies (c): This part of the proof will use a variation of the "pigeon
hole principle." This principle states that if you have more objects than you
have receptacles then at least one receptacle must hold more than one
object. Moreover, if you have an infinite number of points contained in a
finite number of balls then one ball contains infinitely many points. So
part (d) says that for every E > 0 and any infinite set in X, there is a point
Y E X such that B(y ; E) contains infinitely many points of this set. Let {XII}
be a sequence of distinct points. There is a point Yl in X and a subsequence
{xl)} of {xn} such that {xl)} c BevI; 1). Also, there is a point Y2 in X
and a subsequence {X2)} of {xl)} such that {x)} c B(Y2; t). Continuing,
for each integer k > 2 there is a point Yk in X and a subsequence {Xk)} of
{Xk-I)} such that {Xk)} c B(Yk; Ilk). Let Fk = {Xk)} - ; then diam Fk < 2/k
00
and FI :::> F 2 :::> . .. . By Theorem 3.7, n Fk = {xo}. We claim that Xk) 
k=1
Xo (and {Xk k )} is a subsequence of {xn}). In fact, Xo E Fk so that d(xo, Xk») <
diam Fk < 21k, and Xo = lim Xk k ).
(c) implies (a): Let  be an open cover of X. The preceding lemma givs
an E > 0 such that for every x E X there is a G in  with B(x; E) c G. Now
(c) also implies (d); hence there are points X I' . . . , XII in X such that
n
X = U B(x k ; E). Now for 1 < k < n there is a set G k E  with B(x k ; E) c G k .
k= 1 n
Hence X = U G k ; that is, {G 1 ,. . . , G n } is a finite subcover of .II
k=1
4.10 Heine-Borel Theorem. A subset K oflR lI (n > 1) is compact iff K is closed
and bounded.
Proof. If K is compact then K is totally bounded by part (d) of the
preceding theorem. It follows that K must be closed (Proposition 4.3);
also, it is easy to show that a totally bounded set is also bounded.
Now suppose that K is closed and bounded. Hence there are real
numbers al,...,a n and bl,...,b n such that K cF=[al,b.]x... x [an,b n ]. If
it can be shown that F is compact then, because K is closed, it follows that
K is compact (Proposition 4.3(b)). Since Rn is complete and F is closed it
follows that F is complete. Hence, again using part (d) of the preceding
theorem we need only show that F is totally bounded. This is easy
although somewhat "messy" to write down. Let E > 0; we now will write F
as the union of n-dimensional rectangles each of diameter less than E.
m
After doing this we will have FeU B (X k ; E) where each X k belongs to
k=1

24 Metric Spaces and the Topology of C
one of the aforementioned rectangles. The execution of the details of this
strategy is left to the reader (Exercise 3). II
Exercises
1. Finish the proof of Proposition 4.4.
2. Let P = (PI' . . . , Pn) and q = (qI' . . . , qn) be points in n with Pk < qk
for each k. Let R = [PI' qI] X . . . x [Pn' qn] and show that
diam R = d(p, q) = [ i (qk_Pk)2 ] t.
k=l
3. Let F = [at, b l ] x . . . x [am b n ] C n and let E > 0; use Exercise 2 to
m
show that there are rectangles R 1 , . . . , Rm such that F = U Rk and diam
k=1
Rk < E for each k. If Xk E Rk then it follows that Rk c B(x k ; E).
4. Show that the union of a finite number of compact sets is compact.
5. Let X be the set of all bounded sequences of complex numbers. That is,
{xn} E X iff sup {Ixnl: n > I} < 00. If x = {xn} and Y = {Yn}, define
d(x, y) = sup {Ixn - Ynl: n > I}. Show that for each x in X and E > 0, R(x; E)
is not totally bounded although it is complete. (Hint: you might have an
easier time of it if you first show that you can assume x = (0, 0, . . .).)
6. Show that the closure of a totally bounded set is totally bounded.
5. Continuity
One of the most elementary properties of a function is continuity. The
presence of continuity guarantees a certain degree of regularity and smooth-
ness without which it is difficult to obtain any theory of functions on a metric
space. Since the main subject of this book is the theory of functions of a
complex variable which possess derivatives (and so are continuous), the study
of continuity is basic.
5.1 Definition. Let (X, d) and (0, p) be metric spaces and let f: X  Q be
a function. If a E X and W E 0, then limf(x) = w if for every € > 0 there is a
xa
S > 0 such that p(f(x), w) < € whenever 0 < d(x, a) < o. The function f is
continuous at the point a if limf(x) = f(a). Iffis continuous at each point of
xa
X then f is a continuous function from X to O.
5.2 Proposition. Let f: (X, d)  (0, p) be a function and a E X, ex = f(a).
The following are equivalent statements:
(a) f is continuous at a;
(b) For every € > O,f-l(B(ex; E)) contains a ball with center at a;
(c) ex = limf(x n ) whenever a = lim X n .
The proof will be left as an exercise for the reader.
That was the last proposition concerning continuity of a function at a

Continuity 25
point. From now on we will concern ourselves only with functions continuous
on all of X.
5.3 Proposition. Let f: (X, d)  (0, p) be a function. The following are
equivalent statements:
(a) f is continuous;
(b) If is open in 2 thenf-l() is open in X;
(c) If r is closed in 0 then f- 1 (r) is closed in X.
Proof (a) implies (b): Let  be open in 0 and let x Ef-l(). If w == f(x)
then w is in ; by definition, there is an E > 0 with B( w ; E) C . Since f is
continuous, part (b) of the preceding proposition gives a 8 > 0 with B(x; 8)
c f-l(B(w; E)) c f-l(). Hence, f-l() is open.
(b) implies (c): If reO is closed then let  == f2-r. By (b),f-l() ==
X - f- 1 (r) is open, so thatf-l(r) is closed.
(c) implies (a): Suppose there is a point x in X at whichfis not continuous.
Then there is an E > 0 and a sequence {,x n } such that p(f(x n ), f(x)) > E
for every n while x == lim X n . Let r == 2 - B(J(x); E); then r is closed and
each X n is in f- 1 (r). Since (by (c)) J- 1 (r) is closed we have x Ef- 1 (r). But
this implies p(f(x), f(x)) > E > 0, a contradiction. II
The following type of result is probably well understood by the reader
and so the proof is left as an exercise.
5.4 Proposition. Let f and g be continuous functions from X into C and let
ex, (3 E C. Then exf + (3g and fg are both continuous. Also, fig is continuous
provided g(x) i= 0 for every x in X.
5.5 Proposition. Let f: X  Y and g: Y  Z be continuous functions. Then go f
(where go f(x) == g(f(x))) is a continuous function from X into Z.
Proof If U is open in Z then g-l(U) is open in Y; hence,f-l(g-l(U)) ==
(g of) - 1 (U) is open in X. II
5.6 Definition. A function f: (X, d)  (0, p) is uniformly continuous if for
every E > 0 there is a 8 > 0 (depending only on E) such that p(J(x),f(y)) < E
whenever d(x, y) < 8. We say that.fis a Lipschitzfunction if there is a constant
M > 0 such that p(f(x), fey)) < M d(x, y) for all x and y in X.
I t is easy to see that every Lipschitz function is uniformly continuous.
In fact, if E is given, take 8 == E/ M. I t is even easier to see that every uniformly
continuous function is continuous. What are some examples of such func-
tions? If X == f ==  then f(x) == x 2 is continuous but not uniformly
continuous. If X ==  == [0, 1] then f(x) == xi is uniformly continuous but
is not a Lipschitz function. The following provides a wealthy supply of
Lipschitz functions.
Let A c X and x E X; define the distance from x to the set A, d(x, A), by
d(x, A) == inf {d(x, a): a E A}.
5.7 Proposition. Let A eX; then:
(a) d(x, A) == d(x, A -);

26
Metric Spaces and the Topology of C
(b) d(x, A) = 0 iff x E A - ;
(c) Id(x, A) - d(y, A)I < d(x, y) for all x, y in X.
Proof (a) If A c B then it is clear from the definition that d(x, B) < d(x, A).
Hence, d(x, A -) < d(x, A). On the other hand, if E > 0 there is a point
y in A - such that d(x, A -) > d(x, y) - E/2. Also, there is a point a in A with
d(y, a) < E/2. But Id(x, y) -d(x, a)j < d(y, a) < E/2 by the triangle inequality.
In particular, d(x, y) > d(x, a) - E/2. This gives, d(x, A -) > d(x, a) - E >
d(x, A) - E. Since E was arbitrary d(x, A -) > d(x, A), so that (a) is proved.
(b) If x E A - then 0 = d(x, A -) = d(x, A). Now for any x in X there is
a minimizing sequence {an} in A such that d(x, A) = lim d(x, an). So if
d(x, A) = 0, lim d(x, an) = 0; that is, x = lim an and so x E A -.
(c) For a in A d(x, a) < d(x, y) + d(y, a). Hence, d(x, A) = inf {d(x, a):
a E A} < inf {d(x, y) + d(y, a): a E A} = d(x, y) + d(y, A). This gives d(x, A)-
d(y, A) < d(x, y). Similarly d(y, A) - d(x, A) < d(x, y) so the desired in-
equality follows. II
Notice that part (c) of the proposition says that f: X   defined by
f(x) = d(x, A) is a Lipschitz function. If we vary the set A we get a large
supply of these functions.
It is not true that the product of two uniformly continuous (Lipschitz)
functions is again uniformly continuous (Lipschitz). For example, f(x) = x
is Lipschitz but f'f is not even uniformly continuous. However if both f and
g are bounded then the conclusion is valid (see Exercise 3).
Two of the most important properties of continuous functions are
contained in the following result.
5.8 Theorem. Let f: (X, d)  (0, p) be a continuous function.
(a) If X is compact then f(X) is a compact subset of f2.
(b) If X is connected then f(X) is a connected subset of o.
Proof To prove (a) and (b) it may be supposed, without loss of generality,
that f(X) = O. (a) Let {w n } be a sequence in 0; then there is, for each
n > 1, a point X n in X with W n = f(xn). Since X is compact there is a point
x in X and a subsequence {x nk } such that x = lim x nk . But if W = f(x), then
the continuity of f gives that W = lim w nk ; hence f2 is compact by Theorem
4.9. (b) Suppose  c 0 is both open and closed in 0 and that  i= D.
Then, because f(X) = 0, D i= j'-l(); also,f-l() is both open and closed
because f is continuous. By connectivity, f-l() = X and this gives 0 = .
Thus, 0 is connected. II
5.9 Corollary. If f: X  f2 is continuous and K c X is either compact or
connected in X then f(K) is compact or connected, respectively, in Q.
5.10 Corollary. If f: X  R is continuous and X is connected then f(X) is an
interval.
This follows from the characterization of connected subsets of  as
intervals.

Continuity 27
5.11 Intermediate Value Theorem. Iff: [a, b] -+ fR is continuous and f(a) < g
< f(b) then there is a point x, a < x < b, with f(x) = g.
.
5.12 Corollary. Iff: X -+ fR is continuous and K c X is compact then there are
points Xo and Yo in K withf(x o ) = sup {f(x): x E K} andf(yo) = inf {f(x):
x E K}.
Proof If rx = sup {[(x): x E K} then rx is in f(K) because f(K) is closed and
bounded in fR. Similarly f3 = inf {f(x): x E K} is in f(K). II
5.13 Corollary. If K c X is compact and f: X -+ C is continuous then there
are points x 0 and Yo in K 'with
If(xo)1 = sup {If(x) I : x E K} and If(yo)! = inf {If(x) I : x E K}.
Proof This corollary follows from the preceding one because g(x) = If(x)/
defines a continuous function from X into fR.
5.14 Corollary. If K is a compact subset of X and x is in X then there is a
point y in K with d(x, y) = d(x, K).
Proof Define f: X -+ fR by fey) = d(x, y). Then f is continuous and, by
Corollary 5.12, assumes a minimum value on K. That is, there is a point
y in K with fey) < fez) for every Z E K. This gives d(x, y) = d(x, K). II
The next two theorems are extremely important and will be used re-
peatedly throughout this book with no specific reference to the theoreC1
numbers.
5.15. Theorem. Suppose f: X -+ Q is continuous and X is compact; then f is
uniformly continuous.
Proof Let E > 0; we wish to find as> 0 such that d(x, y) < S implies
p(f(x), fey)) < E. Suppose there is no such S; in particular, each S = Iln
will fail to work. Then for every n > 1 there are points X n and Yn in X with
d(x m Yn) < Iln but p(f(x n ), f(Yn)) > E. Since X is compact there is a sub-
sequence {x nk } and a point x E X with x = lim x nk .
Claim. x = lim Ynk. In fact, d(x, Ynk) < d(x, x nk ) + link and this tends to zero
as k goes to 00.
But if w = f(x), w = lim f(x nk ) = lim f(Ynk) so that
E < p(f(xnk),f(Ynk))
< p(f(x nk ), w) + p( w, fey n,))
and the right hand side of this inequality goes to zero. This is a contradiction
and completes the proof. II
5.16. Definition. If A and B are subsets of X then define the distance from
A to B, dCA, B), by
dCA, B) = inf {dCa, b): a E A, b E B}.
Notice that if B is the single-point set {x} then dCA, {x}) = d(x, A). If

28 Metric Spaces and the Topology of C
A == {y} and B == {x} then d( {x}, {y}) == d(x, y). Also, if A (\ B i= D
then dCA, B) == 0, but we can have dCA, B) == 0 with A and B disjoint. The
most popular type of example is to take A == {(x, 0): x E [R} C [R2 and
B == {(x, eX): x E [R}. Notice that A and B are both closed and disjoint and
still dCA, B) == O.
5.17 Theorem. If A and B are disjoint sets in X vith B closed and A compact
then dCA, B) > O.
Proof Definef: X -+ [R by f(x) == d(x, B). Since A n B == D and B is closed,
f(a) > 0 for each a in A. But since A is compact there is a point a in A such
that 0 < f(a) == inf {/(x): x E A} == dCA, B). II
Exercises
1. Prove Proposition 5.2.
2. Show that iff and g are uniformly continuous (Lipschitz) functions from
X into C then so is f+ g.
3. We say that I: X -+ C is bounded if there is a constant M > 0 with
I/(x) I < M for all x in X. Show that if f and g are bounded uniformly
continuous (Lipschitz) functions from X into C then so is fg.
4. Is the composition of two uniformly continuous (Lipschitz) functions
again uniformly continuous (Lipschitz)?
5. Suppose f: X -+ 0 is uniformly continuous; show that if {x n } is a Cauchy
sequence in X then {f(xn)} is a Cauchy sequence in O. Is this still true if we
only assume that f is continuous? (Prove or give a counterexample.)
6. Recall the definition of a dense set (1.14). Suppose that 0 is a complete
metric space and that f: (D, d) -+ (0; p) is uniformly continuous, where D is
dense in (X, d). Use Exercise 5 to show that there is a uniformly continuous
function g: X -+ 0 with g(x) == f(x) for every x in D.
7. Let G be an open subset of C and let P be a polygon in G from a to b.
Use Theorems 5.15 and 5.17 to show that there is a polygon Q c G from a
to b which is composed of line segments which are parallel to either the real
. .
or ImagInary axes.
8. Use Lebesgue's Covering Lemma (4.8) to give another proof of Theorem
5.15.
9. Prove the following converse to Exercise 2.5. Suppose (X, d) is a compact
metric space having the property that for every E > 0 and for any points a,
b in X, there are points Zo, Zl'...' Zn in X with Zo == a, Zn == b, and d(Zk-l'
Zk) < E for 1 < k < n. Then (X, d) is connected. (Hint: Use Theorem 5.17.)
10. Let I and g be continuous functions from (X, d) to (0, p) and let D be
a dense subset of X. Prove that if I(x) == g(x) for x in D then I == g. Use
this to show that the function g obtained in Exercise 6 is unique.
6. Uniform convergence
Let X be a set and (0, p) a metric space and suppose f, 11, 12, . . . are
functions from X into O. The sequence {In} converges unifor'!lly to I-written

U nifonn convergence
29
f == U -lim In-if for every E > 0 there is an integer N (depending on E
alone) such that p(f(x), '/;lx)) < E for all x in X, whenever n > N. Hence,
sup {p(f(x),fn(x)): x E X} < E
whenever n > N.
The first problem is this: If X is not just a set but a metric space and each
./;, is continuous does it follow that f is continuous? The answer is yes.
6.1 Theorem. Suppose fn: (X, d)  (f2, p) is continuous for each n and that
f == u - Jim.in; then f is continuous.
Proof Fix x 0 in X and E > 0; we wish to find a 0 > 0 such that p(f(x 0),
f(x)) < E when d(x 0, x) < O. Since f == u - Jim In' there is a function In with
p(f(x), j(x)) < E/3 for all x in X. Since In is continuous there is a 0 > 0
such that p(fn(x 0), In(x)) < E/3 when d(x 0, x) < o. Therefore, if d(x 0, x) < 0,
p(f(x o ), f(x)) < p(f(x o ), fn(x o )) + p(fn(x o ), fn(x)) + p(fn(x), f(x)) < E. II
Let us consider the special case where il == C. If Un: X  C, let fn(x) ==
00
u1(x)+.. .+un(x). We say f(x) == L un(x) ifff(x) == limfn(x) for each x in X.
00 n-l
The series L un is uniformly convergent to f iff f == u - Jim fn.
I
6.2 Weierstrass M-Test. Let un: X  C be afunction such that Iun(x) I < M n
00 00
for every x in X and suppose the constants satis.fy L M n < 00. Then L Un is
n=l 1
uniformly convergent.
Proof Let In(x) == U 1 (x) +. . . + un(x). Then for n > m,
n
Ifn(x) -1m (x) I == IU m + 1 (x) +. . . + Un(x) I < L
k=m+l
00
M k for each x. Since L M k
1
converges, {fn(x)} is a Cauchy sequence in C. Thus there is a number g E C
with g == lim In(x). Define I(x) == g; this gives a function f: X  C. Now
00
If(x) - h(X) I == I L
k=n+ 1
00
Un(x)/ < L
k=n+l
00
lun(X) I < L M k ;
k=n+l
00 00
since L M k is convergent, for any E > 0 there is an integer N such that L
1 k=n+l
M k < E whenever 11 > N. This gives If(x) - fn(x) I < E for all x in X when
11 > N. II
Exercise
1. Let {fn} in a sequence of uniformly continuous functions from (X, d)
into (£1, p) and suppose that./' == u -lim In exists. Prove that f is uniformly
continuous. If each In is a Lipschitz function with constant M n and sup
M n < 00, show that f is a Lipschitz function. If sup M n == 00, show that I
may fail to be Lipschitz.

Chapter III
Elementary Properties and Examples of
Analytic Functions
1. Power series
In this section the definition and basic properties of a power series will
be given. The power series will then be used to give examples of analytic
functions. Before doing this it is necessary to give some elementary facts on
infinite series in C whose statements for infinite series in fR should be well
00
known to the reader. If an is in C for every n > 0 then the series L an
m n=O
converges to Z iff for every E > 0 there is an integer N such that I L an - zl < E
n=O
whenever m > N. The series L an converges absolutely if L lanl converges.
1.1 Proposition. If L an converges absolutely then L an converges.
Proof. Let E > 0 and put Zn = ao+a 1 +.. · + an" Since L Ian I converges
00
there is an integer N such that L Ian I < E. Thus, if m > k > N,
n=N
m
IZm-zkl = I L ani <
n=k+l
m
L
n=k+l
00
Ian I < L lanl < E.
n=N
That is, {zn} is a Cauchy sequence and so there is a Z in C with Z = lim Zn"
Hence L an = z.1I
Also recall the definitions of limit inferior and superior of a sequence in
fR. If {an} is a sequence in fR then define
lim inf an = lim [inf {an, a n + b . . .}]
n-+ 00
lim sup an = lim [sup {am a n + b . . .}]
n-+ 00
An alternate notation for lim inf an and lim sup an is lim an and lim an" If
b n = inf {an, a n + b . . .} then {b n } is an increasing sequence of real numbers
or { - oo}. Hence, lim inf an always exists although it may be + 00. Similarly
lim sup an always exists although it may be + 00.
A number of properties of lim inf and lim sup are included in the exercises
of this section. 00
A power series about a is an infinite series of the form L ai,(Z-a)n. One
n=O
of the easiest examples of a power series (and one of the most useful) is the
00
geometric series L zn. For which values of z does this series converge and
n=O
30

Power series 31
when does it diverge? It is easy to see that l-z n + 1 == (l-z) (1 +z+. . . +zn),
so that
1.2
1 - zn + 1
1 + z +. . . + zn ==
l-z
If Izi < 1 then 0 == lim zn and so the geometric series is convergent with
00 1
"'" zn == _
L l-z.
o
If Izi > 1 then lim Izln == 00 and the series diverges. Not only is this result
an archetype for what happens to a general power series, but it can be used
to explore the convergence properties of power series.
00
1.3 Theorem. For a given pover series L an(z - a)n define the number R,
o < R < 00, by n= 0
 = lim sup lanl!/n,
then:
(a) if Iz - al < R, the series converges absolutely:
(b) if Iz-al > R, the terms of the series become unbounded and so the
series diverges;
(c) if 0 < r < R then the series converges uniformly on {z: Izl < r}.
Moreover, the number R is the only number having properties (a) and (b).
Proof We may suppose that a == o. If Izi < R there is an r with Izi < r < R.
Thus, there is an integer N such that lanl!/n < ! for all n > N ( because  >
r r
 ) . But then lanl <  and so lanznl < ( B ) n for all n > N. This says that
R r n r
the tail end  anz n is dominated by the series L ( B ) n, and since B < I
n =N r r
the power series converges absolutely for each Izi < R.
Now suppose r < R and choose p such that r < p < R. As above, let
1 ( r ) n
N be such that Ian I < pn for all n > N. Then if Izi < r, 1 anz n I < p and
(;) < I. Hence the Weierstrass M-test gives that the power series converges
uniformly on {z: Izi < r}. This proves parts (a) and (c).
1 1
To prove (b), let Izi > R and choose r with Izi > r > R. Hence - < - ;
r R
from the definition of lim sup, this gives infinitely many integers n with
 < lan,!/n. It follows that 1 anz n I > (':' )" and, since (':' ) > 1, these terms
become unbounded. _
The number R is called the radius of convergence of the power series.

32 Elementary Properties and Examples of Analytic Functions
1.4 Proposition. If L an(z-a)n is a given power series with radius of con-
vergence R, then
R = lim lan/an + 11
if this limit exists.
Proof Again assume that a = 0 and let (X = lim lan/an + 11, which we suppose
to exist. Suppose that Izi < r < (X and find an integer N such that r <
lan/an+tI for all n > N. Let B = laNlr N ; then laN+llr N + 1 = laN+llrr N <.
laNlr N = B; laN+2Ir N + 2 = laN+2Irr N + 1 < laN+llr N + 1 < B; continuing we get
lanynj < B for all n > N. But then I anz n I = !anynl lz In < Biz In for all n > N.
00 r n r n
Since Izl < r we get that L lanznl is dominated by a convergent series and
n=1
hence converges. Since r < (X was arbitrary this gives that (X < R.
On the other hand if Izl > r > (x, then lanl < rla n + 11 for all n larger than
some integer N. As before, we get Ian'" I > B = laNrNI for n > N. This
gives lanznl > B 1 1 ;1: which approaches 00 as n does. Hence, L anz n diverges
and so R < (X. Thus R = (X. II
00 n
Consider the series L  ; by Proposition 1.4 we have that this series
n=O n!
has radius of convergence 00. Hence it converges at every complex number
and the convergence is uniform on each compact subset of C. Maintaining a
parallel with calculus, we designate this series by
%  zn
e = exp z =  ,.,
_ 0 n.
n-
the exponential series or function.
Recall the following proposition from the theory of infinite series (the
proof will not be given). '
1.5 Proposition. Let L an and L b n be tM'O absolutely convergent series and put
n
C n = L akbn-k.
k= 0
Then L c n is absolutely convergent with sum
(L an) (L b n ).
1.6 Proposition. Let L an(z-a)n and L b,,(z-a)n be power series with radius
of convergence > r > o. Put
n
C n = L akb n - k ;
k= 0
then both power series L (an+b n ) (z-a)n and L cn(z-a)n have radius of con-
vergence > r, and

Analytic functions
L (an+b n ) (z-a)n == [L an(z-a)n+ L bn(z-a)n]
L cn(z-a)n == [l: an(z-a)n] [l: bn(z-a)n]
33
for Iz-al < r.
Proof We only give an outline of the proof. If 0 < s < r then for Izi < s,
we get L Ian + bnl Izln < L lan/sn + L Ibnls n < 00; L ICnl IZln < (L lanls n )
(L Ibnls n ) < 00. From here the proof can easily be completed. II
Exercises
I. Prove Proposition 1.5.
2. Give the details of the proof of Proposition 1.6.
3. Prove that lim sup (an + b n ) < lim sup an + lim sup b n and lim inf (an + b n )
> lim inf an + lim inf b n for {an} and {b n } sequences of real numbers.
4. Show that lim inf an < lim sup an for any sequence in IR.
5. If {an} is a convergent sequence in IR and a == lim an, show that a == lim
inf an == lim sup an"
6. Find the radius of convergence for each of the following power series:
00 00 00 00
(a) L anz n , a E C; (b) L a n2 z n , a E C; (c) L knz n , k an integer :f0; (d) L zn!.
n=O n=O n=O n=O
7. Show that the radius of convergence of the power series
i (-nIt zn(n+l)
n=1
is 1, and discuss convergence for z == 1, -1, and 1. (Hint: The nth co-
efficient of this series is not ( - I )nj n.)
2. Analytic functions
In this section analytic functions are defined and some examples are
given. It is also shown that the Cauchy-Riemann equations hold for the real
and imaginary parts of an analytic function.
2.1 Definition. If G is an open set in C and f: GC then f is differentiable
at a point a in G if
1 . f(a+h)-f(a)
1m
II -. 0 h
exists; the value of this limit is denoted by f'(a) and is called the derivative of
I at a. If f is differentiable at each point of G we say that f is differentiable
on G. Notice that if j' is differentiable on G then f'(a) defines a function
I': G  C. Iff' is continuous then we say thatfis continuously differentiable.
If I' is differentiable then f is twice differentiable; continuing, a differentiable
function such that each successive derivative is again differentiable is called
infinitely differentiable.
(Henceforward, all functions will be assumed to take their values in C
unless it is stated to the contrary.)

34
Elementary Properties and Examples of Analytic Functions
The following was surely predicted by the reader.
2.2 Proposition. If I: G  C is differentiable at a point a in G then I is
continuous at a.
Proof In fact,
lim I/(z) - I(a) I == [ lim I/(z) -/(a) I ] . [ lim Iz - a l ] == I'(a)' 0 == 0.11
z-+a z-+a Iz-al z-+a
2.3 Definition. A function f: GC is analytic if f is continuously differen-
tiable on G.
It follows readily, as in calculus, that sums and products of functions
analytic on G are analytic. Also, if f and g are analytic on G and G 1 is the
set of points in G where g doesn't vanish, then f / g is analytic on G).
Since constant functions and the function z are clearly analytic it
follows that all rational functions are analytic on the complement of the
set of zeros of the denominator.
Moreover, the usual laws for differentiating sums, products, and
quotients remain valid.
2.4 Chain Rule. Let f and g be analytic on G and Q respectively and suppose
f(G)cQ. Then gof is analytic on G and
(gof)'(z) = g'(f(z))f'(z)
for all z in G.
Proof. Fix Zo in G and choose a positive number r such that B (zo; r) c G.
We must show that if O<lhn/<r and limhn=O then lim{hn-I[g(f(zo+h n ))'
- g(f(zo))]} exists and equals g'(f(zo))f'(zo)' (Why will this suffice for a
proof?)
Case 1 Suppose f(zo)* f(zo+ h n ) for all n.
In this case
gof(zo+ h n ) - gof(zo) g(f(zo+ h n )) - g(f(zo)) f(zo+ h n ) - f(zo)
-
h n f(zo + h n ) - f(zo) h n
Since lim[f(zo + h n ) - f(zo)] = 0 by (2.2) we have that
limh n - I [gof(zo+ h n ) - gof(zo) ] = g'(f(zo))f'(zo)
Case 2 f(zo) = f(zo + h n ) for infinitely many values of n.
Write {h n } as the union of two sequences {k n } and {In} where f(zo) *
f(zo + k n ) and f(zo) = f(zo + In) for all n. Since f is differentiable, f'(zo) =
lim In-I[f(zo + In) - f(zo)] = O. Also lim In- I [ gof(zo + In) - gof(zo)] = O. By
Case 1, limkn-I[gof(zo + k n )- gof(zo)] = g'(f(zo))f'(zo) =0. Therefore
limh n - I [ go f(zo + h n ) - go f(zo)] = 0 = g'(f(zo))f'(zo).
The general case easily follows from the preceding two. _
In order to define the derivative, the function was assumed to be defined
on an open set. If we say f is analytic on a set A and A is not open, we mean
that f is analytic on an open set containing A.

Analytic functions
35
Perhaps the definition of analytic function has been anticlimatic to many
readers. After seeing books written on analytic functions and year-long
courses and seminars on the theory of analytic functions, one can excuse a
certain degree of disappointment in discovering that the definition has
already been encountered in calculus. Is this theory to be a simple generaliza-
tion of calculus? The answer is a resounding no. To show how vastly different
the two subjects are let us mention that we will show that a differentiable
function is analytic. This is truly a remarkable result and one for which there
is no analogue in the theory of functions of a real variable (e.g., consider
x 2 sin ) . Another equally remarkable result is that every analytic junction
is infinitely differentiable and, furthermore, has a power series expansion
about each point of its domain. How can such a humble hypothesis give
such far-reaching results? One can get come indication of what produces
this phenomenon if one considers the definition of derivative.
In the complex variable case there are an infinity of directions in which a
variable can approach a point a. In the real case, however, there are only two
avenues of approach. Continuity, for example, of a function defined on IR
can be discussed in terms of right and left continuity; this is far from the
case for functions of a complex variable. So the statement that a function of
a complex variable has a derivative is stronger than the same statement about
a function of a real variable. Even more, if we consider a function f defined
on Gee as a function of two real variables by putting g(x, y) = f(x+ iy)
for (x, y) E G, then requiring that f be Frechet differentiable will not ensure
that f has a derivative in our sense.
In an exercise we ask the reader to show that fez) = /Z/2 has a derivative
only at z = 0; but, g(x, y) = f(x + iy) = x 2 + y2 is Frechet differentiable.
That differentiability implies analyticity is proved in Chapter IV; but
right now we prove that power series are analytic functions.
00
2.5 Proposition. Let j(z) = L an(z-a)n have radius of convergence R > o.
Then: n=O
(a) For each k > 1 the series
2.6
00
L n( n - 1) . . . (n - k + 1 )a n ( Z - a)n - k
n=k
has radius of convergence R;
(b) The function f is in.finitely differentiable on B(a; R) and, furthermore,
f(k)(z) is given by the series (2.6) for all k > 1 and Iz - al < R;
(c) For n  0,
I
2.7 an = ,f(n)(a).
n.
Proof Again assume that a = o.
(a) We first remark that if (a) is proved for k = 1 then the cases k = 2, . . .
will follow. In fact, the case k = 2 can be obtained by applying part (a) for
k = I to the series L nan(z-a)n-l. We have that R- 1 = lim sup lani lln ; we

36 Elementary Properties and Examples of Analytic Functions
wish to show that R- 1 = lim sup /nanI1/(n-l). Now it follows from I'H6pital's
. log n . _ .
rule that hm - = 0, so that hm n 1 /(n 1) = 1. The result wIll follow from
n-+ 00 n - 1 11-+ 00
Exercise 2 if it can be shown that lim sup lanll/(n-I)= R -I.
Let (R')-I=lim sup lanll/(n-I); then R' is the radius of convergence of
00 00
La n z n - 1 = Lan+1z n . NoticethatzLa n + 1 z 1Z +a o = Lanzn;henceifjzl < R'
1 0
then L I anz n 1 < laol + Izi L la n + lznl < 00. This gives R' < R. If Izi < Rand
1 1
z -# 0 then L I allz" I < 00 and L la,,+ lz"l < . L la"z" I + Iaol < 00, so
that R < R'. This gives that R = R' and completes the proof of part (a).
00 n 00
(b) For Izi < R put g(z) = L na n z n - 1 , sn(z) = L akz k , and Rn(z) = L
n=1 k=O k=n+l
akz k . Fix a point w in B(O; R) and fix r with Iwl < r < R; we wish to show
thatf'(w) exists and is equal to g(w). To do this let S > 0 be arbitrary except
for the restriction that B( w; S) c B(O; r). (We will further restrict S later in
the proof.) Let z E B( w; S); then
2.8 f(z)-f(w) _ g(w) = [ s,,(Z)-S,,(W) - S(W) ] + [s(w)-g(w)]
z-w z-w
+ [ Rn(Z)-Rn(W) ]
z-w
Now
R,,(z)-R,,(w) =  f ak(zk-wk)
z-w z-w k=n+l
00
_ L ak ( zk = wk )
k=n+l Z W
But
I Zk-wk l
_ I I = I Z k-l +Zk-2 W +. · · +ZW k - 2 + wk- 1 1 < kr k - 1 .
z-w
Hence,
Rn(z)-Rn(w)
<
z-w
00
L
k=n+t
la k lkr k - 1
00
Since r < R, L laklkr k - 1 converges and so for any € > 0 there is an integer
k = 1
Nt such that for n > Nt
Rn(z)-Rn(w) €
< -
z-w 3
(z E B(w; S)).
Also, Iim s(w) = g(w) so there is an integer N 2 such that Is(w)-g(w)1 < j
whenever n > N 2 . Let n = the maximum of the two integers N 1 and N 2 .

Analytic functions
Then we can choose 0 > 0 such that
37
sn(Z)-sn(w) ' ( )
- sn W
Z-w
E
<-
3
whenever 0 < Iz - wi < o. Putting these inequalities together with equation
(2.8) we have that
f(z)-f(w) _ g(w) < E
z-w
for 0 < Iz-wl < o. That is,f'(w) == g(w).
(c) By a straightforward evaluation we get f(O) == f(O)(O) == ao. Using
(2.6) (for a == 0), we get f(k)(O) == k !ak and this gives formula (2.7). II
co
2.9 Corollary. If the series L an(z - a)n has radius of convergence R > 0 then
co n=O
fez) == L an(z - a)n is analytic in B(a; R).
n=O 00
Hence, exp z == I z n / n! is analytic in C. Before further examining the
n=O
exponential function and defining cosz and sinz, the following result must
be proved.
2.10 Proposition. If G is open and connected and f:G -+ C is differentiable
with f'(z) == 0 for all z in G, then f is constant.
Proof Fix Zo ill G and let Wo == f(zo). Put A == {z E G: fez) == wo}; we will
show that A == G by showing that A is both open and closed in G. Let z E G
and let {zn} c A be such that z == lim Zn. Since f(zn) == w 0 for each n > 1
and f is continuous we get fez) == Wo, or z E A. Thus, A is closed in G. Now
fix a in A, and let E > 0 be such that B(a; €) c G. If z E B(a; E), set g(t) =
j(tz+(I-t)a), 0 < t < 1. Then
get) - g(s) get) - g(s) (t - s)z + (s - t)a
-
(t-s)z + (s- t)a
2.11
t-s
t-s
Thus, if we let ts we get (A.4(b), Appendix A)
. get) - g(s) ,
hm = f (sz+(I-s)a).(z-a) = O.
t-+s t-s
That is, g'(s) == 0 for 0 < s < 1, implying that g is a constant. Hence,
fez) == gel) ==g(O) == f(a) == WOe That is, B(a; E) C A and A is also open. II
Now differentiate fez) == e Z ; we do this by Proposition 2.5. This gives
that
co co co
j'(z) = 2: zn-l = 2: 1 zn-l = L zn =f(z).
n = 1 n! n = 1 (n - I) ! n = 0 n!
Thus the complex exponential function has the same property as its real
counterpart. That is
2.12
d
-eZ=e Z
dz

38 Elementary Properties and Examples of Analytic Functions
Put g(z) = eZe a - z for some fixed a in C; then g'(z) = eZea-z+e Z ( _e a - z ) = o.
Hence g(z) = w for all z in C and some constant w. In particular, using
eO = 1 we get w = g(O) = ea. Then eZe a - z = e a for all z. Thus e a + b = eae b
for all a and b in C. This also gives 1 = eZe- z which implies that e Z i= 0
for any z and e- Z = l/e z . Returning to the power series expans ion of e Z ,
since all the coefficients of this series are real we have exp z = exp z. In
particular, for () a real number we get lei8j2 = e i8 e- ilJ = eO = 1. More
generally, /e z j2 = eZe z = e Z + z = exp (2 Re z). Thus,
2.13
lexp zl = exp (Re z).
We see, therefore, that e Z has the same properties that the real function eX
has. Again by analogy with the real power series we define the functions
cos z and sin z by the power series
Z2 Z4 z2n
cos Z = 1 - - + - +. . . + ( - l)n ( - +. . .
2 ! 4 ! 2n) !
Z3 Z5 Z2n+ 1
sin z = z - - + - +. . . + ( - l)n +. . .
3 ! 5 ! (2n + 1) !
Each of the series has infinite radius of convergence and so cos z and sin z
are analytic in C. By using Proposition 2.5 we find that (cos z)' = - sin z
and (sin z)' = cos z. By manipulating power series (which is justified since
these series converge absolutely)
.. I.,
2.14 cos z = !( e lZ + e - lZ) sin z = 2i (e lZ - e - lZ)
This gives for z in C, cos 2 z + sin 2 z = 1 and
2.15
e iz = cos z+ i sin z.
In particular if we let z = a real number (J in (2.15) we get e ilJ = cis (J.
Hence, for z in C
2.16
z = IzleilJ
where ()=argz. Since eX+1Y=eXelY we have lezl=exp(Rez) and arge z =
Imz.
A function f is periodic with period c if fez + c) = fez) for all z in C. If c
is a period of e Z then e Z = e Z + c = eZe c implies that e C = 1. Since 1 = leci =
exp Re( c), Re( c) = O. Thus c = i() for some () in . But I = e C = e iO = cos() +
i sin () gives that the periods of e Z are the multiples of 2'1Ti. Thus, if we
divide the plane into infinitely many horizontal strips by the lines Imz =
'1T(2k - I), k any integer, the exponential function behaves the same in
each of these strips. This property of periodicity is one which is not present
in the real exponential function. Notice that by examining complex func-
tions we have demonstrated a relationship (2.15) between the exponential
function and the trigonometric functions which was not expected from our
knowledge of the real case.

Analytic functions 39
Now let us define log z. We could adopt the same procedure as before
and let log z be the power series expansion of the real logarithm about some
point. But this only gives log z in some disk. The method of defining the
logarithm as the integral of t- 1 from 1 to x, x > 0, is a possibility, but
proves to be risky and unsatisfying in the complex case. Also, since e Z is not
a one-one map as in the real case, log z cannot be defined as the inverse of e Z .
We can, however, do something similar.
We want to define log w so that it satisfies w = e Z when z = log w.
Now since e Z =F 0 for any z we cannot define log o. Therefore, suppose  = w
and w =F 0; if z = x+iy then Iwl = eX and y = arg W+21Tk, for some k.
Hence
2.17
{log I wi + i( arg w + 21Tk): k is any integer}
is the solution set for e Z = w. (Note that log Iwl is the usual real logarithm.)
2.18 Definition. If G is an open connected set in C and f: G  C is a con-
tinuous function such that z = exp f(z) for all z in G then f is a branch of
the logarithm.
Notice that 0 j G.
Suppose f is a given branch of the logarithm on the connected set G
and suppose k is an integer. Let g(z) = f(z) + 21Tki. Then exp g(z) = exp f(z)
= z, so g is also a branch of the logarithm. Conversely, iff and g are both
branches of log z then for each z in G,f(z) = g(z) + 21Tki for some integer k,
where k depends on z. Does the same k work for each z in G? The answer is
yes. In fact, if h(z) = [f(z)-g(z)] then h is continuous on G and h(G)
21Tl
C 1., the integers. Since G is connected, h( G) must also be connected
(Theorem II. 5.8). Hence there is a k in 1. withf(z)+21Tki = g(z) for all z in
G. This gives
2.19 Proposition. If G c C is open and connected and f is a branch of log z
on G then the totality of branches of log z are the functions f(z) + 21Tki, k E I.
Now let us manufacture at least one branch of log z on some open
connected set. Let
G = C- {z: z < O};
that is, "slit" the plane along the negative real axis. Clearly G is connected
and each z in G can be uniquely represented by z = Izle i9 where -1T < 8 < 1J'.
For 8 in this range, define f(re i8 ) = log r + i8. We leave the proof of con-
tinuity to the reader (Exercise 9). It follows thatfis a branch of the logarithm
on G.
Is f analytic ? To answer this we first prove a general fact.
2.20 Proposition. Let G and n be open subsets of c. Suppose that f: G  C
and g: n  C are continuous functions such that f(G) c nand g(f(z)) = z
for all z in G. If g is differentiable and g'(z) =F 0, f is differentiable and
j'(z) = g'(Z» ·

40
Elementary Properties and Examples of Analytic Functions
!j'g is analytic, f is analytic
Proof Fix a in G and let h E C such that h =1= 0 and a+h E G. Hence a =
g(f(a)) and a+h = g(f(a+h)) implies f(a) =1= f(a+h). Also
1 = g(f(a+h))-g(f(a) )
h
g(f(a+h)) - g(f(a)) f(a+ h) - f(a )
f(a+h) - j{a) h
Now the limit of the left hand side as h  0 is, of course, 1; so the limit
of the right hand side exists. Since lim [f(a+h)-f(a)] = 0,
h-O
Jim g(f(a+h))-g(f(a)) = g'(f(a)).
h-O f(a+h)-j(a)
Hence we get that
. f(a+h)-f(a)
hm
h-O h
exists since g'(f(a)) =1= 0, and 1 = g'(f(a))f'(a).
Thus, f'(z) = [g'(f(z))] - 1. If g is analytic then g' is continuous and this
gives that j' is analytic. II
2.21 Corollary. A branch of the logarithm function is analytic and its derivative
is z - 1 .
We designate the particular branch of the logarithm defined above
on C - {z: z < O} to be the principal branch of the logarithm. If we write
log z as a function we will always take it to be the principal branch of the
logarithm unless otherwise stated.
Iff is a branch of the logarithm on an open connected set G and if b in C
is fixed then define g: G  C by g(z) = exp (bf(z)). If b is an integer, then
g( z) = Zb. In this manner we define a branch of Zb, b in C, for an open con-
nected set on which there is a branch of log z. If we write g(z) = Zb as a
function we will always understand that Zb = exp (b log z) where log z is
the principal branch of the logarithm; Zb is analytic since log z is.
As is evident from the considerations just concluded, connectedness
plays an important role in analytic function theory. For example, Proposition
2.10 is false unless G is connected. This is analogous to the role played by
intervals in calculus. Because of this it is convenient to introduce the term
"region." A region is an open connected subset of the plane.
This section concludes with a discussion of the Cauchy-Riemann equa-
tions. Letf': G  C be analytic and let u(x, y) = Re.f(x+iy), vex, y) = 1m
f(x+ iy) for x+ lY in G. Let us evaluate the limit
f ' ( ) I . fe z + h) -Ie z)
z = In1 h
h-O
in two different ways. First let h  0 through real values of h. For h =1= 0
and h real we get

Analytic functions
41
f(z+h)-f(z)
h
f(x+h + iy) - f(x+ iy)
-
h
u(x + h, y) - u(x, y) . vex + h, y) - vex, y)
= +l
h h
Letting h  0 gives
ou ov
f'(z) = ox (x, y) + i ox (x, y)
Now let h  0 through purely imaginary values; that is, for h =1= 0 and
h real,
2.22
j(z+ih)-j(z)
ih
. u( x, y + h) - u( x, y) v( x, y + h) - v( x, y)
- -l h + h
Thus,
2.23
ou ov
/'(z) = - i - (x, y) + - (x, y)
oy oy
Equating the real and imaginary parts of (2.22) and (2.23) we get the
Cauchy-Riemann equations
ou ov ou ov
- = - and - = - -
ox oy oy ox
Suppose that u and v have continuous second partial derivatives (we will
eventually show that they are infinitely differentiable). Differentiating the
Cauchy-Riemann equations again we get
o2U o2V o2U o2V
--- and -=--
ox 2 oxoy oy2 oyox
2.24
Hence,
02U o2U
2.25  + -Z - O.
ox oy-
Any function with continuous second derivatives satisfying (2.25) is said to
be harmonic. In a similar fashion, v is also harmonic. We will study
harmonic functions in Chapter X.
Let G be a region in the plane and let u and v be functions defined on
G with continuous partial derivatives. Furthermore, suppose that u and v
satisfy the Cauchy-Riemann equations. Ifj(z)=u(z)+iv(z) thenjcan be
shown to be analytic in G. To see this, let z = x + iy E G and let B (z; r) c
G. If h = s + it E B (0; r) then
u( x + s, y + t) - u( x, y) = [u( x + s, y + t) - u( x, y + t)] + [u( x, y + t) - u( x, y)]
Applying the mean value theorem for the derivative of a function of one
variable to each of these bracketed expressions, yields for each s + it in
B(O; r) numbers Sl and t 1 such that IS11 < Isl and It 1 1 < It I and
{ U(x+s, y+t)-u(x, y+t) = u x (x+s 1 , y+t)s
2.26
u(x, y + t) - u(x, y) = uy(x, y + t l)t

42
Letting
Elementary Properties and Examples of Analytic Functions
cp(s, t} = [u(x + s, y + t) - u(x, y)] - [ux(x, y)s + uy(x, y)t]
(2.26) gives that
<p(s, t) s t
+' = , [ u x ( x + s I ,Y + t) - u x ( X ,Y ) ] + , [ uy ( x,y + t I) - u y ( x,y ) ]
S It S+lt S+1t
But IsJ < Is+itl, It I < Is+itl, Is 1 1 < Is], It 1 1 < Itl, and the fact that U x and u y
are continuous gives that
2.27
lim cp(s01 = 0
s+it-.O s+it
Hence
u(x + s, y + t) - u(x, y) = ux(x, y)s + uy(x, y)t + cp(s, t)
where cp satisfies (2.27). Similarly
vex + s, y + t) - vex, y) = vx(x, y)s + vy(x, y)t + if;(s, t)
where if; satisfies
2.28
lim if;(s, t) = 0
s+it-.O s+it
Using the fact that u and v satisfy the Cauchy-Riemann equations it is easy to
see that
f(z+s+it)-f(z) _ ( ) . ( ) cp(s, t)+if;(x, t)
. - U x z + IVx Z + .
s+zt S+ll
In light of (2.27) and (2.28), f is differentiable and j"(z) = ux(z) + ivx(z).
Since U x and V x are continuous, f' is continuous and f is analytic. These
results are summarized as follows.
2.29. Theorem. Let u and v be real-valued functions defined on a region G
and suppose that u and v have continuous partial derivatives. Then f: G  C
de.fined by fez) = u(z) + iv(z) is analytic iff u and v satisfy the Cauchy-Riemann
equations.
Example. Is u(x, y) = log (x 2 + y2y1- harmonic on G = C - {O}? The answer
is yes! This could be shown by differentiating u to see that it satisfies (2.25).
However, it can also be shown by observing that in a neighborhood of each
point of G, u is the real part of an analytic function defined in that neighbor-
hood. (Which function?)
Another problem concerning harmonic functions which will be taken
up in more detail in Section VIII. 3, is the following. Suppose G is a region
in the plane and u: G  !R is harmonic. Does there exist a harmonic function
v: G  !R such that! = u+ iv is analytic in G? If such a function v exists it is
called a harmonic conjugate of u. If VI and V2 are two harmonic conjugates
of u then f(v! -v 2 ) = (u+iv l )-(U+ fv 2) is analytic on G and only takes on

Analytic functions 43
purely imaginary values. It follows that two harmonic conjugates of a
harmonic function differ by a constant (see Exercise 14).
Returning to the question of the existence of a harmonic conjugate, the
above example u(z) = log Izi of a harmonic function on the region G = c-
{O} has no harmonic conjugate. Indeed, if it did then it would be possible to
define an analytic branch of the logarithm on G and this cannot be done.
(Exercise 21.) However, there are some regions for which every harmonic
function has a conjugate. In particular, it will now be shown that this is the
case when G is any disk or the whole plane.
2.30 Theorem. Let G be either the lvhole plane C or some open disk. If
u: G   is a harmonic function then u has a harmonic conjugate.
Proof. To carry out the proof of this theorem, Leibniz's rule for differentiating
under the integral sign is needed (this is stated and proved in Proposition IV.
2.1). Let G = B(O; R), 0 < R < 00, and let u: G --7  be a harmonic function.
The proof will be accomplished by finding a harmonic function v such that
u and v satisfy the Cauchy-Riemann equations. So define
y
v(x, y) = f uix, t)dt+cp(x)
o
and determine gJ so that V x = - u y . Differentiating both sides of this equation
with respect to x gives
y
vx(x, y) = f uxix, t) dt+cp'(x)
o
y
- f uyi X , t) dt+cp'(x)
o
- uy(x, y) + uy(x, 0) + gJ'(x)
So it must be that gJ'(x) = -uy(x, 0). It is easily checked that u and
y x
v(x, y) = f ux(x, t)dt- f ui s , O)ds
o 0
do satisfy the Cauchy-Riemann equations. II
Where was the fact that G is a disk or C used? Why can't this method of
proof be doctored sufficiently that it holds for general regions G? Where
does the proof break down when G = C - {O} and u(z) = log Izl?
Exercises
1. Show that f(z) = Izl2 = x 2 + y2 has a derivative only at the origin.
2. Prove that if b n , an are real and positive and 0 < b = lim b n , a = lim
sup an then ab = lim sup (anb n ). Does this remain true if the requirement of
positivity is dropped?
3. Show that lim n1/n = 1.

44 Elementary Properties and Examples of Analytic Functions
4. Show that (cos z)' = - sin z and (sin z)' = cos z.
5. Derive formulas (2.14).
6. Describe the following sets: {z: e Z = I}, {z: e Z = -I}, {z: e Z = -I},
{z: cos z = O}, {z: sin z = O}.
7. Prove formulas for cos (z + w) and sin (z + 1'v).
8. Define tan z = SIn z ; where is this function defined and analytic?
cos z
9. Suppose that Zm Z E G = C- {z: z < O} and Zn = rne iOn , z = rei(} where
-7T < (), On < 7T. Prove that if Zn  z then On  ° and r n  r.
10. Prove the following generalization of Proposition 2.20. Let G and Q be
open in C and suppose f and h are functions defined on G, g : QC and
suppose thatf(G)cQ. Suppose that g and h are analytic, g'(w) *0 for any
w, thatf is continuous, h is one-one, and that they satisfy h(z) = g(f(z)) for
z in G. Show thatf is analytic. Give a formula for f'(z).
11. Suppose that f: G  C is a branch of the logarithm and that n is an
integer. Prove that z" = exp (nf(z)) for all z in G.
12. Show that the real part of the function zt is always positive.
13. Let G = C - {z: z < O} and let n be a positive integer. Find all analytic
functions f: G  C such that z = (f(z))n for all z E G.
14. Suppose f: G  C is analytic and that G is connected. Show that if
fez) is real for all z in G thenfis constant.
15. For r > 0 let A = {w: w = exp (D where 0 < Izi < r} ; determine the
set A.
16. Find an open connected set G c C and two continuous functionsfand
g defined on G such thatf(z)2 = g(Z)2 = 1 _Z2 for an z in G. Can you make
G maximal? Are f and g analytic?
17. Give the principal branch of J I- z.
18. Let}': G  C and g: G  C be branches of ZO and Zb respectively. Show
thatfg is a branch of za+b andf/g is a branch of za-b. Suppose thatf(G) C G
and g(G) C G and prove that bothf 0 g and g 0 f are branches of zab.
19. Let G be a region and define G* = {z: Z E G}. If f: G  C is analytic
prove that f*: G*  C, defined by f*(z) = j(z) , is also analytic.
20. Let Zl,Z2,..., Zn be complex numbers such that Rez k > 0 and Re(zl...
Zk) > 0 for 1 < k < n. Show that log (z, . . . zn) = log z 1 + . . . + log Zn,
where log z is the principal branch of the logarithm. If the restrictions on the
Zk are removed, does the formula remain valid?
21. Prove that there is no branch of the logarithm defined on G = C - {O}.
(Hint: Suppose such a branch exists and compare this with the principal
branch.)
3. Analytic functions as mappings. Mohius transformations
Consider the function defined bY.f(z) = Z2. If z = x+iy and J-t+iv=f(z)
then J-t = x 2 - y2, v = 2xy. Hence, the hyperbolas x 2 - y2 = c and 2xy = d
are mapped by f into the straight lines J-t = c, v = d. One interesting fact is

Analytic functions as mappings. Mobius transformations 45
that for c and d not zero, these hyperbolas intersect at right angles, just as
their images do. This is not an isolated phenomenon and this property will
be explored in general later in this section.
Now examine what happens to the lines x = e and y = d. First consider
x = c (y arbitrary) ;fmaps this line into Jk = e 2 - y2 and v = 2ey. Eliminating
y we get that x = e is mapped onto the parabola v 2 = - 4c 2 (Jk - c 2 ). Similarly,
f takes the line y = d onto the parabola v 2 = 4d 2 (J1- + d 2 ). These parabolas
intersect at (e 2 _d 2 , :t 2Ied)). It is relevant to point out that as c  0 the
parabola v 2 = - 4e 2 (Jk - e 2 ) gets closer and closer to the negative real axis.
This corresponds to the fact that the function zt maps G = C - {z: z < O}
onto{z:Rez> O}.Noticealsothatx = eandx = -c(andy = d,y= -d)
are mapped onto the same parabolas.
What happens to a circle centered at the origin? If z = rei8 then fez) =
r 2 e 2i8 ; thus, the circle of radius r about the origin is mapped onto the circle
of radius r 2 in a two to one fashion.
Finally, what happens to the sector Sea, f3) = {z: a < arg z < f3}, for
a < f3? It is easily seen that the image of Sea, (3) is the sector S(2a, 2(3). The
restriction of f to Sea, (3) will be one-one exactly when f3 - a < 1T.
The above discussion sheds some light on the nature of fez) = Z2 and,
likewise, it is useful to study the mapping properties' other analytic functions.
In the theory of analytic functions the following problem holds a paramount
position: given two open connected sets G and .0, is there an analytic function
J defined on G such that f( G) = .Q? Besides being intrinsically interesting,
the solution (or rather, the information about the existence of a solution)
of this problem is very useful.
3.1 Definition. A path in a region Gee is a continuous function y : [a, b]
G for some interval [a, b] in R. If y/( t) exists for each t in [a, b] and
y' : [a, b ] C is con tin uous then y is a smooth path. Also y is piecewise
smooth if there is a partition of [a, b], a = to < t 1< . .. < t n = b, such that y is
smooth on each subinterval [t)-I,t)], I < j < no
To say that a function y : [a, b ]C has a derivative y'( t) for each point t
in [a, b] means that
. y(t+h)-y(t) I
hm h =y(t)
hO
exists for a < t < b and that the right and left sided limits exist for t = a and
t = b, respectively. This is, of course, equivalent to saying that Re y and
1m y have a derivative (see Appendix A).
Suppose y: [a,b]G is a smooth path and that for some to in (a, b),
y'( to) =:F O. Then y has a tangent line at the point Zo = y( to)' This line goes
through the point Zo in the direction of (the vector) y/( to); or, the slope of
the line is tan(argy'(t o )). If YI and Y2 are two smooth paths with YI(t l )=
Y2( t 2) = Zo and y (t I) =:F 0, y;( t 2) =:F 0, then define the angle between the paths
YI and Y2 at Zo to be
argy;(t 2 ) -argy(tl)'

46
Elementary Properties and Examples of Analytic Functions
Suppose Y is a smooth path in G and f: GC is analytic. Then a = fa Y
is also a smooth path and a/(t)= f'(y(t))y'(t). Let Zo= y(t o ), and suppose
that y/(to)O and f'(zo) O; then a/(t o ) O and arga/(t o ) = argf'(zo) +
argy/(t o )' That is,
3.2
arga/( to) - arg y/( to) = argf'(zo).
Now let YI and Y2 be smooth paths with YI(t l )= Y2(t 2 )=zo and y(tl)*
0* y(t2); let a l = fay I and a 2 = f O Y2' Also, suppose that the paths YI and Y2
are not tangent to each other at zo; that is, suppose y(tl)*y(t2)' Equa-
tion (3.2) gives
3.3
arg y(t2)-arg y;(t j ) = arg a(t2)-arg a;(t j ).
This says that given any two paths through z 0, f maps these paths onto two
paths through Wo = I(zo) and, when/'(zo) =1= 0, the angles between the curves
are preserved both in magnitude and direction. This summarizes as follows.
3.4 Theorem. If I: G -7 C is analytic then I preserves angles at each point
z 0 01 G where I'(z 0) =1= o.
A functionf: G -7 C which has the angle preserving property and also has
I . I/(z) - I(a) 1
1m
za Iz-al
existing is called a conformal map. If I is analytic and I'(z) =1= 0 for any z
then f is conformal. The converse of this statement is also true.
If I(z) = e Z then f is conformal throughout C; let us look at the expo-
nential function more closely. If z = c+ iy where c is fixed then fez) = re iy
for r = e C . That is, f maps the line x = c onto the circle with center at the
origin and of radius e C . Also, I maps the line y = d onto the infinite ray
{re id : 0 < r < oo}.
c
e C
1Ti
---------------.
'I'
di
,
------- 1----- - ---
-1Ti
We have already seen that e Z is one-one on any horizontal strip of width
<27T. Let G = {z: -7T < 1m z < 7T}. Thenf(G) = Q = C- {z: z < a}; also

Analytic functions as mappings. Mobius transformations 47
fmaps the vertical segments {z = e+iy, -1T < Y < 1T} onto the part of the
circle {e c e i8 : -1T < (J < 1T}, and the horizontal line y = d, -'IT < d < 'IT,
goes onto the ray making an angle d with the positive real axis.
Notice that log z, the principal branch of the logarithm, does the opposite.
It maps Q onto the strip G, circles onto vertical segments in G, rays onto
horizontal lines in G.
The exploration of the mapping properties of cos z, sin z, and other
analytic functions will be done in the exercises. We now proceed to an
amazing class of mappings, the Mobius transformations.
3.5 Definition. A mapping of the form S(z) = az+b is called a linear frac-
ez+d
tional transformation. If a, b, c, and d also satisfy ad-be =F 0 then S(z) is
called a Mobius transformation.
dz-b
If S is a Mobius transformation then S-l(Z) = satisfies
- cz + a
S(S -l(Z)) = S -l(S(Z)) = z; that is, S -1 is the inverse mapping of S. If
Sand T are both linear fractional transformations then it follows that SoT
is also. Hence, the set of Mobius maps forms a group under composition.
Unless otherwise stated, the only linear fractional transformations we will
consider are Mobius transformations.
Let S(z) = az+ ; if ,\ is any non-zero complex number, then
ez+
(Aa)z + (Ab)
S (z) = ('\c)z + (Ad) ·
That is, the coefficients a, b, e, d are not unique (see Exercise 20).
We may also consider S as defined on Coo with S( (0) = aje and S( -dje)
= 00. (Notice that we cannot have a = 0 = e or d = 0 = e since either
situation would contradict ad-be =F 0.) Since S has an inverse it maps Coo
onto Coo.
If S(z) = z + a then S is called a translation; if S(z) = az with a =F 0
then S is a dilation; if S(z) = ei8 z then it is a rotation; finally, if S(z) = Ijz
it is the inversion.
3.6 Proposition. If S is a Mobius transformation then S is the composition of
translations, dilations, and the inversion. (Of course, some of these may be
missing. )
Proof. First, suppose e = O. Hence S(z) = (ajd)z+(bjd) so if Sl(Z) = (ajd)z,
S2(Z) = z+(bjd), then S2 0 SI = S and we are done.
(be-ad)
Now let e =F 0 and put SI(Z) = z+dje, S2(Z) = ljz, S3(Z) = 2 z,
e
S4(Z) = z+aje. Then S = S4 0 S3 0 S2 0 SI.11
What are the finite fixed points of S? That is, what are the points z
satisfying S( z) = z. If z satisfies this condition then
cz 2 +(d-a)z-b = O.

48 Elementary Properties and Examples of Analytic Functions
Hence, a Mobius transformation can have at most two fixed points unless
S(z)=z for all z. (Why?)
Now let S be a Mobius transformation and let a, b, c be distinct points
in Coo with ex == Sea), f3 == S(b), y == S(c). Suppose that T is another map
with this property. Then T- t 0 S has a, b, and c as fixed points and, there-
fore, T- t 0 S == I == the identity. That is, S == T. Hence, a Mobius map is
uniquely determined by its action on any three given points in Coo.
Let Z 2, Z 3' Z4 be points in Coo. Define S: Coo -+ Coo by
( Z- Z 3 )j( Z 2 - Z 3 ) .
S(z) == If
Z-Z4 Z2 -Z4
Z2,Z3,Z4 EC ;
S(z) == Z-Z3 if 00 .
Z2 ,
Z-Z4
S(z) == Z2 -Z4 if 00 .
Z3 == ,
Z-Z4
S(z) == Z-Z3 if
Z4 == 00.
Z2 -Z3
In any case S(z 2) == 1, S(z 3) == 0, S(z 4) == 00 and S is the only transforma-
tion having this property.
3.7 Definition. If Zt E Coo then (Zt, Z2, Z3, Z4). (The cross ratio of Zt, Z2, Z3,
and Z4) is the image of Z t under the unique Mobius transformation which
takes Z2 to 1, Z3 to 0, and Z4 to 00.
For example: (Z2, Z2, Z3, Z4) == 1 and (z, 1,0, 00) == z. Also, if M is any
Mobius map and w 2 , W 3 , JV 4 are the points such that MlV 2 == I, MWj == 0,
MW4 == 00 then Mz == (z, W 2 , W3, w 4 ).
3.8 Proposition. If Z2, Z3, Z4 are distinct points and T is any Mobius trans-
formation then
(Zt, Z2, Z3, Z4) == (Tz 1 , Tz 2 , Tz 3 , Tz 4 )
for any point Z 1.
Proof Let Sz == (z, Z2, Z3, Z4); then S is a Mobius map. If M == ST- 1
then M(Tz 2 ) == 1, M(Tz 3 ) == 0, M(Tz 4 ) == 00; hence, ST-tz == (z, Tz 2 ,
Tz 3' Tz 4 ) for all z in Coo. In particular, if Z == Tz t the desired result follows. II
3.9 Proposition.lfz2' Z3, Z4 are distinct points in Coo and W2, W3, W4 are also
distinct points of Coo, then there is one and only one Mobius transformation S
such that SZ2 == W2, SZ3 == W3, SZ4 == W4
Proof Let Tz == (z, Z2, Z 3' Z4), Mz == (z, W2, W 3 , w4) and put S == M -1 T.
Clearly S has the desired property. If R is another Mobius map with Rz j =
W j for j == 2, 3, 4 then R - t 0 S has three fixed points (z 2, Z 3' and z 4). Hence
R- 1 0 S == I, or S == R. II
It is well known from high school geometry that three points in the plane
determine a circle. (Recall that a circle in Coo passing through 00 corresponds
to a straight line in C. Hence there is no need to inject in the previous state-

Analytic functions as mappings. Mobius transformations 49
ment the word "non-colinear.) A straight line in the plane will be called a
circle.) The next result explains when four points lie on a circle.
3.10 Proposition. Let ZI, Z2, Z3, Z4 be four distinct points in Coo' Then (ZI, Z2,
Z 3' Z4) is a real number iff all four points lie on a circle.
Proof Let S: Coo -+ Coo be defined by Sz = (z, Z2, Z 3, Z4); then S -1(!R) = the
set of z such that (z, z 2, Z 3, z 4) is real. Hence, we will be finished if we can
show that the image of !Roo under a Mobius transformation is a circle.
az + b . 1 h S . 1 . h
Let Sz = ; If z = x E !R and w = S - (x) t en x = wImp Ies t at
cz+d
Sew) = Sew) . That is,
aw+b
cw+d
aw + b
ew+d
Cross multiplying this gives
3.11 (ae-ac) IwI2+(ad-bc)w+(be-da)w+(bd-bd) = o.
If ae is real then ae-ac = 0; putting a = 2(ad-bc), f3 = i(bd-bd) and
multiplying (3. I I) by i gives
3.12 0 = 1m (aw)-f3 = 1m (aw-f3)
since f3 is real. That is, w lies on the line determined by (3.12) for fixed ex and
f3. If ae is not real then (3.1 I) becomes
IwI2+yw+yw-S = 0
for some constants y in C, S in . Hence,
3.13
Iw+yl = "
where
ad - bc
" = (Ir1 2 + S)t = _ _ > o.
ac - ac
Since rand" are independent of x and since (3. I 3) is the equation of a circle,
the proof is finished. II
3.14 Theorem. A M 6bius transformation takes circles onto circles.
Proof Let r be any circle in Coo and let S be any Mobius transformation.
Let Z2, z 3, Z4 be three distinct points on r and put w j = Sz j for j = 2, 3, 4.
Then W2, w 3 , W4 determine a circle r'. We claim that S(r) = r'. In fact,
for any z in Coo
3.15
(z, Z2, Z 3, Z4) = (Sz, w2, w3, w 4 )
by Proposition 3.8. By the preceding proposition, if z is on r then both
sides of(3.15) are real. But this says that SZE r'.11
Now let rand r' be two circles in Coo and let Z2, z 3, Z4 E r; w2, w3, w4 E
r'. Put Rz = (z, Z2, Z3, Z4), Sz = (z, w2, w3, W4). Then T = S-l 0 R maps

50 Elementary Properties and Examples of Analytic Functions
r onto r'. In fact, Tz j = W j for j = 2, 3, 4 and, as in the above proof, it
follows that T(r) = r'.
3.16 Proposition. For any given circles rand r' in Coo there is a Mobius
transformation T such that T(r) = r'. Furthermore we can specify that T
take any three points on r onto any three points of r'. If we do specify Tz j
for j = 2, 3, 4 (distinct z j in r) then T is unique.
Proof The proof, except for the uniqueness statement, is given in the previous
paragraph. The uniqueness part is a trivial exercise for the reader. II
Now that we know that a Mobius map takes circles to circles, the next
question is: What happens to the inside and the outside of these circles?
To answer this we introduce some new concepts.
3.17 Definition. Let r be a circle through points Z2, Z3, Z4. The points z,
z* in Coo are said to be symmetric with respect to r if
3.18
(z*, Z2, Z3, Z4) = (z, Z2, Z3, Z4).
As it stands, this definition not only depends on the circle but also on the
points Z2, Z 3' Z4..It is left as an exercise for the reader to show that symmetry
is independent of the points chosen (Exercise 11).
Also, by Proposition 3.10 z is symmetric to itself with respect to r if
and only if z E r.
/ z*
/
/
/
/
/
/
/
/
/
z
r
Let us investigate what it means for Z and z* to be symmetric. If r is a
straight line then our linguistic prejudices lead us to believe that z and z*
are symmetric with respect to r if the line through z and z* is perpendicular
to rand z and z* are the same distance from r but on opposite sides of r.
This is indeed the case.
If r is a straight line then, choosing z 4 = 00, equation (3.18) becomes
*
Z -Z3
Z-Z3
Z2-Z3 22- 2 3
This gives Iz* - z 31 = Iz - z 31; since z 3 was not specified, we have that z

Analytic functions as mappings. Mobius transformations
and z* are equidistant from each point on r. Also
51
*
Z -Z3 Z-Z3
1m = 1m _ _
Z2- Z 3 Z2- Z 3
Z-Z3
= -1m
Z2 -Z3
Hence, we have (unless z E r) that z and z* lie in different half planes deter-
mined by r. It now follows that [z, z*] is perpendicular to r.
Now suppose that r = {z: Iz-al = R} (0 < R < (0). Let Z2, Z3, Z4 be
points in r; using (3.18) and Proposition 3.8 for a number of Mobius trans-
formations gives
(z*, Z 2, Z 3, z 4) = (z, Z 2' Z 3, z 4)
= (z-a, z2-a, Z3-a, Z4-a)
( _ _ R 2 R 2 R2 )
= Z - a, ,
Z2- a Z3- a Z4- a
= ( _R2_ , z2-a, Z3- a , Z4- a )
z-a
= ( _R 2 _ + a, Z2, Z3, Z4 )
z-a
Hence, z* = a + R 2 (z - a) -1 or (z* - a) (z - a) = R 2 . From this it follows that
z* - a R 2
= I 1 2 > 0,
z-a z-a
so that z* lies on the ray {a+t(z-a): 0 < t < oo} from a through z. Using
the fact that Iz - allz* - al = R 2 we can obtain z* from z (if z lies inside r)
as in the figure below. That is: Let L be the ray from a through z. Construct
z*
a line P perpendicular to L at z and at the point where P intersects r con-
struct the tangent to r. The point of intersection of this tangent with L is
the point z*. Thus, the points a and 00 are symmetric with respect to r.
3.19 Symmetry Principle. If a Mobius transformation T takes a circle r 1
onto the circle r 2 then any pair of points symmetric with respect to r 1 are
mapped by T onto a pair of points symmetric with respect to r 2.

52 Elementary Properties and Examples of Analytic Functions
Proof Let Z2, z 3, Z4 E r 1; it follows that if z and z* are symmetric with
respect to r 1 then
(Tz*, Tz 2 , Tz 3 , Tz 4 ) == (z*, Z2, Z3, Z4)
== (z, Z2, Z3, Z4)
== (Tz, Tz 2 , Tz 3, Tz 4 )
by Proposition 3.8. Hence Tz* and Tz are symmetric with respect to r 2. II
Now we will discuss orientation for circles in Coo; this will enable us to
distinguish between the "inside" and "outside" of a circle in Coo. Notice
that on Coo (the sphere) there is no obvious choice for the inside and outside
of a circle.
3.20 Definition. If r is a circle then an orientation for r is an ordered triple
of points (z 1, Z 2, z 3) such that each z j is in r.
Intuitively, these three points give a direction to r. That is we Hgo"
from z 1 to Z2 to z 3. If only two points were given, this would, of course, be
ambiguous.
az+b
Let r ==  and let Zf, Z2, Z3 E; also, put Tz == (z, Zf, Z2, z3) == d .
ez+
Since T(oo) == oo it follows that a, b, e, d can be chosen to be real numbers
(see Exercise 8). Hence,
az+b
Tz ==
ez+d
az+b
- Icz+dj2 · (cz+d)
1
- Icz+d/ 2 [aclzI 2 +bd+bcz+adz]
Hence,
(ad-be)
1m (z, Z1, Z2, Z3) = Icz+d/ 2 1m z.
Thus, {z: 1m (z, z l' Z 2, z 3) < O} is either the upper or lower half plane
depending on whether (ad-be) > 0 or (ad-be) < O. (Note that ad-be is
the "determinant" of T.)
Now let r be arbitrary, and suppose that z l' Z 2, Z 3 are on r; for any
Mobius transformation S we have (by Proposition 3.8)
{z: 1m (z, Zl, Z2, Z3) > O} == {z: 1m (Sz, SZt, SZ2, SZ3) > O}
== S-l {z: 1m (z, SZI' SZ2, SZ3) > O}
In particular, if S is chosen so that S maps r onto !R ee , then {z: 1m (z, z l'
Z2, z 3) > O} is equal to S -1 of either the upper or lower half plane.
If (z l' Z 2' z 3) is an orientation of r then we define the right side of r
(with respect to (z 1, Z 2, z 3)) to be
{z: 1m (z, Zt, Z2, Z3) > O}.

Analytic functions as mappings. Mobius transformations
Similarly, we define the left side of r to be
{z:lm(z,zbz2,z3) < O}.
The proof of the following theorem is left as an exercise.
3.21 Orientation Principle. Let r 1 and r 2 be two circles in Coo and let T be
a Mobius transformation such that T(r 1 ) = r 2 . Let (zj, Z2, Z3) be an orienta-
tion for r 1. Then T takes the right side and the left side of r 1 onto the right
side and left side of r 2 with respect to the orientation (Tz l' Tz 2, Tz 3).
Consider the orientation (1, 0, 00) of . By the definition of the cross
ratio, (z, 1, 0, 00) = z. Hence, the right side of  with respect to (1,0, 00)
is the upper half plane. This fits our intuition that the right side lies on our
right as we walk along  from 1 to 0 to 00.
As an example consider the following problem: Find an analytic function
f: G -+ C, where G = {z: Re z > O}, such thatf(G) = D = {z: Izl < I}. We
solve this problem by finding a Mobius transformation which takes the
imaginary axis onto the unit circle and, by the Orientation Principle, takes
G onto D (that is, we must choose this map carefully in order that it does not
send G onto {z: Izi > 1 }).
If we give the imaginary axis the orientation ( - i, 0, i) then {z: Re z > O}
is on the right of this axis. In fact,
2z
(z, -i, 0, i) = --=
Z-l
53
2z z + i
z-iz+i
2 2 .
- I . 1 2. (izi + lZ)
Z-l
Hence, {z: 1m (z, -i, 0, i) > O} = {z: 1m (iz) > O} = {z: Re z > O}.
Giving r the orientation ( - i, - 1, i) we have that D lies on the right of r.
Also,
2i z + 1
( z -i -1 i ) = - . -
, , , . 1 ..
1- Z-l
If
2z ( 2i ) ( z + 1 )
Sz = -. and Rz = - -.
Z-l 1-1 Z-l
then T = R- 1 S maps G onto D (and the imaginary axis onto r). By algebraic
manipulations we have
z-1
Tz=-
z+1
e Z -l
Combining this with previous results we have that g(z) = 1 maps
e Z +
the infinite strip {z: 11m zl < 71'/2} onto the open unit disk D. (It is worth
e Z -l
mentioning that z 1 = tanh (zj2).)
e+

54 Elementary Properties and Examples of Analytic Functions
Let G l' G 2 be open connected sets; to try to find an analytic function f
such thatf(G 1 ) = G 2 we try to map both G 1 and G 2 onto the open unit disk.
If this can be done, f can be obtained by taking the composition of one
function with the inverse of the other.
L
/
/
/
/
/
/
/
r
1

/
/
/
/
/
/
/
As an example, let G be the open set inside two circles r 1 and r 2, inter-
secting at points a and b (a i= b). Let L be the line passing through a and b
and give L the orientation (00, a, b). Then Tz = (z, 00, a, b) = ( z- a )
z-b
maps L onto the real axis (Too = 1, Ta = 0, Tb = (0). Since T must map
circles onto circles, T maps r 1 and r 2 onto circles through 0 and 00. That is,
T(r 1) and T(r 2) are straight lines. By the use of orientation we have that
T( G) = {w - ex < arg w < a} for some a > 0, or the complement of some
such closed sector. By the use of an appropriate power of z and possibly a
rotation we can map this wedge onto the right half plane. Now, composing
with the map (z-l) (Z+I)-1 givesamapofGontoD = {z: Izi < I}.
Exercises
1. Find the Image of {z: Re z < 0, 11m zl < 7T} under the exponential
function.
2. Do exercise 1 for the set {z: 11m zl < 7T/2}.
3. Discuss the mapping properties of cos z and sin z.
4. Discuss the mapping properties of zn and zl/n for n > 2. (Hint: use polar
coordinates. )
5. Find the fixed points of a dilation, a translation and the inversion on Coo.
6. Evaluate the following cross ratios: (a) (7 + i, 1, 0, (0) (b) (2, 1 - i, 1, 1 + i)
(c) (0,1, i, -1) (d) (i-I, 00, l+i, 0).
az+b
7. If Tz = find Z2, z 3' Z4 (in terms of a, b, c, d) such that Tz = (z,
cz+d
z 2, Z 3' z 4).

Analytic functions as mappings. Mobius transformations 55
az+b .
8. If Tz = d show that T(oo) = oo Iff we can choose a, b, c, d to be
cz+
real numbers.
az + b fi d ffi . d . . h T(r) r
9. If Tz = d ' nd necessary an su Clent con ltIons t at =
cz+
where r is the unit circle {z: Izl = I}.
10. Let D = {z: Izi < I} and find all Mobius transformations T such that
T(D) = D.
11. Show that the definition of symmetry (3.17) does not depend on the
choice of points Z2, Z3, Z4. That is, show that if W 2, W3, W4 are al so in r then
equation (3.18) is satisfied iff (z*, W2, W3, w4) = (z, W2, W3, w4). (Hint: Use
Exercise 8.)
12. Prove Theorem 3.4.
13. Give a discussion of the mappingf(z) = t(z+ l/z).
14. Suppose that one circle is contained inside another and that they are
tangent at the point a. Let G be the region between the two circles and
map G conformally onto the open unit disk. (Hint: first try (z - a) -1.)
15. Can you map the open unit disk conformally onto {z: 0 < Izi < I}?
16. Map G = C- {z: -1 < z < I} onto the open unit disk oy an analytic
function f Can f be one-one?
17. Let G be a region and suppose that f: G  C is analytic such that I( G)
is a subset of a circle. Show that f is constant.
z-ia
18. Let - 00 < a < b < 00 and put Mz = . . Define the lines Ll =
z-lb
{z: 1m z = b}, L 2 = {z: 1m z = a} and L3 = {z: Re z = O}. Determine
which of the regions A, B, C, D, E, F in Figure 1, are mapped by M onto the
regions U, V, W, X, Y, Z in Figure 2.
A
D
ib
u
w
B
E
o
x
z
ia
C F
Figure 1 Figure 2
19. Let a, b, and M be as in Exercise 18 and let log be the principal branch of
the logarithm.

56
Elementary Properties and Examples of Analytic Functions
(a) Show that log (Mz) is defined for all z except z = ie, a < c < b; and
if h(z) = 1m [log Mz] then 0 < h(z) < 7T for Re z > o.
(b) Show that log (z - ie) is defined for Re z > 0 and any real number c;
7T
also prove that 11m log (z - ie)1 < 2 if Re z > o.
(c) Let h be as in (a) and prove that h(z) = 1m [log (z-ia)-log (z-ib)].
(d) Show that
b
f dt
--:- = i[log (z-ib)-log (z-ia)]
z-ll
a
(Hint: Use the Fundamental Theorem of Calculus.)
(e) Combine (c) and (d) to get that
b
h(x+iy) = f X2+-t)2 dt = arctan ( y x a ) -arctan ( y x b)
a
(f) Interpret part (e) geometrically and show that for Re z > 0 h(z) is the
angle depicted in the figure.
ib
z
ia
az+b fXZ+f3
20. Let Sz = and Tz = ; show that S = T iff there is a non zero
cz+d yz+8
complex number" such that C( = "a, f3 = "b, y = "c, 0 = "d.
21. Let T be a Mobius transformation with fixed points ZI and Z2' If S is a
Mobius transformation show that S -1 TS has fixed points S -1 Z 1 and S -1 Z2.
22. (a) Show that a Mobius transformation has 0 and 00 as its only fixed
points iff it is a dilation.

Analytic functions as mappings. Mobius transformations 57
(b) Show that a Mobius transformation has (fJ as its only fixed point iff
it is a translation.
23. Show that a Mobius transformation T satisfies T(O) = 00 and T( 00) = 0
iff Tz = az- 1 for some a in C.
24. Let T be a Mobius transformation, T i= the identity. Show that a
Mobius transformation S conlmutes with T if Sand T have the same fixed
points. (Hint: Use Exercises 21 and 22.)
25. Find all the abelian subgroups of the group of Mobius transformations.
26. (a) Let G L 2 (C) = all invertible 2 x 2 matrices with entries in C and
let .A be the group of Mobius transformations. Define cp: GL 2 (C)  Jt by
'P(: ) = ::: . Show that cp is a group homomorphism of G L 2 (C) onto vIt.
Find the kernel of cpo
(b) Let SL 2 (C) be the subgroup of GL 2 (C) consisting of all matrices of
determinant I. Show that the image of SL 2 (C) under cp is all of .A. What
part of the kernel of cp is in SL 2 (C)?
27. If rJ is a group and AI is a subgroup then AI is said to be a normal subgroup
of rJ if S -1 TS E AI whenever TEAl and S E rJ. t(g is a simple group if the
only normal subgroups of rJ are {I} (I = the identity of) and t(g itself.
Prove that the group .A of Mobius transformations is a simple group.
28. Discuss the mapping properties of (I - z )',
29. For complex numbers a and !3 with lal 2 + I !312= I
-
az - !3
ua.p(z)= f3 - and let U={u a . p :lo:j2+1f31 2 =I}.
z-a
(a) Show that U is a group under composition.
(b) If SU 2 is the set of all unitary matrices with determinant 1, show that
SU 2 is a group under matrix multiplication and that for each A in SU 2
there are unique complex numbers a and !3 with laI 2 +1!312=I and
A= (   ) .
- f3 a
(c) Show that ( _ ;  }-U a. p is a homomorphism of the group S U 2 onto
U. What is its kernel?
(d) If I E {O, , l, , .. .} let HI = all the polynomials of degree < 2/. For
ua,fJ=u in U define TJI):HrHI by (TJ I >.f)(z)=(!3z+a)2'f(u(z». Show
that Tu(l) is an invertible linear transformation on HI and U  TJ/) is an
injective homomorphism of U into the group of invertible linear transfor-
mations of HI onto HI'
30. For Izi < I define fez) by
f(z) = exp { - iIO g [ i( :   ) )'/2}.
(a) Show that J maps D = {z : Izi < I} conformally onto an annulus G.
(b) Find all Mobius transformations S(z) that map D onto D and such
that J(S (z» = J(z) when Izi < 1.

Chapter IV
Complex Integration
In this chapter results are derived which are fundamental in the study of
analytic functions. The theorems presented here constitute one of the pillars
of Mathematics and have far ranging applications.
1. Riemann-Stieltjes integrals
We will begin by defining the Riemann-Stieltjes integral in order to
define the integral of a function along a path in C. The discussion of this
integral is by no means complete, but is limited to those results essential to
a cogent exposition of line integrals.
1.1 Definition. A function y: [a, b] -+ C, for [a, b] c , is of bounded variation
if there is a constant M > 0 such that for any partition P = {a = to < t 1
< . . . < t m = b} of [a, b]
m
v(y; P) = L ly(t k )-y(t k - 1 )1 < M.
k=l
The total variation of y, V(y), is defined by
V(y) = sup {v(y; P): P a partition of [a, b]}.
Clearly V(y) < M < 00.
It is easily shown that y is of bounded variation if and only if Re y
and 1m yare of bounded variation. If y is real valued and is non-decreasing
then .y is of bounded variation and V(y) = y(b)-y(a). (Exercise 1) Other
examples will be given, but first let us give some easily deduced properties of
these functions.
1.2 Proposition. Let y: [a, b] -+ C be of bounded variation. Then:
(a) If P and Q are partitions of [a, b] and P c Q then v(y; P) < v(y; Q);
(b) If a: [a, b] -+ C is also 0.( bounded variation and ex, f3 E C then exy + f3a
is of bounded variation and V(exy+ f3a) < lexl V(y) + 1f31 V(a).
The proof is left to the reader.
The next proposition gives a wealthy collection of functions of bounded
variation. In actuality this is the set of functions which is of principal concern
to us.
1.3 Proposition. If y : [a, b]-+ C is piecewise smooth then y is of bounded
variation and
b
V(y) = I ly'(I)J dl
a
58

Riemann-Stieltjes integrals 59
Proof. Assume that "I is smooth (the complete proof is easily deduced from
this). Recall that when we say that "I is smooth this means "I' is continuous.
Let P = {a = to < I 1< ... < 1m = b}. Then, from the definition,
m
v(y; P) = L /y(t k )-y(t k - 1 )1
k=1
m tic
= kl I I y'(t) dtl
tic -1
m tic
< kl I ly'(t)J dt
tic - 1
b
= I ly'(t)1 dt
a
Hence V(y) < J ly'(t)1 dt, so that y is of bounded variation.
Since y' is continuous it is uniformly continuous; so if € > 0 is given we
can choose 8 1 > 0 such that Is-tl < 8 1 implies that ly'(s)-y'(t)1 < €. Also,
we may choose 8 2 > 0 such that if P = {a = to < t 1 <.. .<t m = b} and
II P II = max {( t k - t k - 1): 1 < k < m} < 8 2 then
b m
I /y'(t)1 dt - kl Iy'( Tk)1 (tk - t k - 1 ) < £
a
where Tk is any point in [t k - 1 , t k ]. Hence
b m
I ly'(t)1 dt < £ + kl ly'(Tk)! (tk- t k-l)
a
m
= € + L
k=l
tic
I y'( Tk) dt
tk-l
m
< € + L
k=l
tk m
I [y'( Tk) - y'(t)] dt + L
k=l
tk-l
tk
I y'(t) dt
tk-l
If liP II < o=min(ol,o2) then ly'(T k )- y'(t)/ <€ for I in [/k-l,t k ] and
b
m
I ly'(t)1 dt < £+£(b-a) + kl !y(tk)-y(tk-l)!
a
= E[l +(b-a)]+v(y; P)
< E[l+(b-a)]+ V(y).

60
Letting E  0 +, gives
Complex Integration
b
f ly'(t)J dt < V(y),
a
which yields equality. II
1.4 Theorem. Let y: [a, b]  C be of bounded variation and suppose that
f: [a, b]  C is continuous. Then there is a complex number I such that for
every E > 0 there is a 8 > 0 such that when P = {to < t 1 <... < t m } is a
partition of [a, b] with IIPI! = max {(t k - t k - 1 ): 1 < k < m} < 8 then
m
I - I f(Tk) [y(t k )-y(t k - 1 )] < E
k=1
for whatever choice of points Tk, t k - 1 < Tk < t k .
This number I is called the integral of f with respect to y over [a, b] and
is designated by
b b
1= f Jdy = f J(t) dy(t).
a a
Proof. Since f is continuous it is uniformly continuous; thus, we can find
(inductively) positive numbers 8 1 > 8 2 > 8 3 >. . . such that if Js-t/ < 8m,
IJ(s) - J(t) I < . For each m > 1 let (lJJ m = the collection of all partitions P
m
of [a, b] with IIP'I < 8",; so f}Jl :::> f}J2 :::> Finally define Fm to be the
closure of the set:
1.5 Ltl J( Tk)[y(t k ) - y(t k -1)]: P E (lJJ m and t k - 1 < Tk < t k } ·
The following are claimed to hold:
[ Fl :::> F 2 :::> · .. and
1.6 diam Em <  V(y)
If this is done then, by Cantor's Theorem (II. 3.7), there is exactly one com-
plex number I such that IE Fm for every m > 1. Let us show that this will
complete the proof. If E > 0 let m > (2/E) V(y); then E > (21m) V(y) >
diam Fm. Since IE Fm, Fm c B(/; E). Thus, if 8 = 8m the theorem is proved.
Now to prove (1.6). The fact that F 1 :::> F 2 :::>. . . follows trivially from
the fact that (lJJ 1 ::> (lJJ 2 ::>. .. . To show that diam Em <  V(y) it suffices
m
to show that the diameter of the set in (1.5) is < 2 V(y). This is done in two
m
stages, each of which is easy althou'gh the first is tedious.
If P = {to < ... < t n } is a partition we will denote by S (P) a sum of the
form  f( 'T k )[ y( t k ) - y( t k _ I)] where 'Tk is any point with t k - I < 'T k < t k .

Riemann-Stieltjes integrals 61
Fix m > 1 and let P E f!JJ m ; the first step will be to show that if P c Q (and
hence Q E (!Jm) then IS(P)- S(Q)I < 1- V(y). We only give the proof for
m
the case where Q is obtained by adding one extra partition point to P. Let
1 < p < m and let tp_1<t*<t p ; suppose that Pu{t'}=Q. If t p - 1 < (J < t*,
t *< '< t d
- (J _ p' an
S(Q)= L !((Jk) [ y(tk)-y(t k - 1 )] +f((J) [ y(t*)-y(tp_t)]
k=t=p
+f((J') [ y(tp)-y(t*)],
then, using the fact that If( T) - f( (J)I <.l for IT - (JI < Om'
m
/ S (P) - S (Q)/ = I L [f( 7k) - f(ak)] [y(t k ) -y(tk-t)] + f( 7 p) [y(t p ) -y(tp-t)]
kp
- f(a) [y(t*) -y(tp-t)] - I(a') [y(t p ) -y(t*)]/
< -.!. L Iy(tk) - y(t k - 1 )1 + l[f( T p) - f( 0")] [y(t*) - y(tp-l)]
mkp
+ [f( T p) - f( a')] [y(t p) - y(t*)] I
1 1
< - L ly(tk)-y(tk-1)1 + - Iy(t*)-y(tp-t)/
m kp m
1
+ -Iy(tp)-y(t*)/
m
1
< - V(y)
m
For the second and final stage let P and R be any two partitions in f!lJ m. Then
Q = PuR is a partition and contains both P and R. Using the first part
we get
IS (P) - S(R)I < IS(P) - S (Q)/ + IS (Q)- S(R)I < .2 V( y).
m
It now follows that the diameter of (1.5) is <  V(y). .
m
The next result follows from the definitions by a routine E - S argument.
1.7 Proposition. Let f and g be continuous functions on [a, b] and let y and a
be functions of bounded variation on [a, b]. Then for any scalars a and (3:
(a) J (af+f3g) dy = a Jfdy+{3 Jgdy
(b) J:f d (ay+{3a) = aJfdy+{3 Jfda.
The following is a very useful result in calculating these integrals.
1.8 Proposition. Let y: [a, b]  C be of bounded variation and let f: [a, b]  C
be continuous. If a = to < t 1 <... < t n = b then
b n tk
f fdy = kf: 1 f fdy.
II tk-l

62
Complex Integration
The proof is left as an exercise.
As was mentioned before, we will mainly be concerned with those y
which are piecewise smooth. The following theorem says that in this case
we can find ffdy by the methods of integration learned in calculus.
1.9 Theorem.ffy is piecewise smooth andf:[a,b]C is continuous then
fb fdy= fb f(t)y'(t)dt.
a a
Proof Again we only consider the case where y is smooth. Also, by
looking at the real and imaginary parts of y, we reduce the proof to the
case where y([ a, b]) c IR. Let {> 0 and choose 0 > 0 such that if P = { a = to
< ... < t n = b} has II P II < 0 then
b n
1.10 I fdy - k1;/(Tk) [y(t k )-y(tk-l)] < 1- E
a
and
1.11
b n
I f(t)y'(t) dt - Jtf(Tk)y'h) (tk- t k-l) <-!E
a
for any choice of Tk in [t k - 1 , t k ]. If we apply the Mean Value Theorem for
derivatives we get that there is a Tk in [t k - 1 , t k ] with y'(Tk) = [y(t k ) -y(t k - 1 )]
(t k - t k - 1 ) -1. (Note that the fact that y is real valued is needed to apply the
Mean Value Theorem.) Thus,
n n
L I( 7"k) [y(t k ) - y(t k - 1 )] = L I( Tk)Y'( Tk) (t k - t k -1).
k=1 k=1
Combining this with inequalities (1.10) and (1.11) gives
b b
I fdy - I f(t)y'(t) dt < E.
a a
Since E > 0 was arbitrary, this completes the proof of the theorem. _
We have already defined a path as a continuous function y: [a, b] -+ C.
If y: [a, b] -+ C is a path then the set {y( t): a < t < b} is called the trace of y
and is denoted it by {y}. Notice that the trace of a path is always a compact
set. y is a rectifiable path if y is a function of bounded variation. If P is a
partition of [a, b] then v(y; P) is exactly the sum of lengths of line segments
connecting points on the trace of y. To say that y is rectifiable is to say that
y has finite length and its length is V(y). In particular, if y is piecewise
smooth then y is rectifiable and its length is J Iy'/ dt.
If y: [a, b] -+ C is a rectifiable path with {y} c E c C and f: E -+ C
is a continuous function then f 0 y is a continuous function on [a, b]. With
this in mind the following definition makes sense.

Riemann-Stieltjes integrals 63
1.12 Definition. If y: [a, b]  C is a rectifiable path and f is a function
defined and continuous on the trace of y then the (line) integral of f along y is
b
f .f(y(t» dy(t).
a
This line integral is also denoted by Jyf = Ji'f(z) dz.
As an example let us take y: [0, 21T]  C to be yet) = e it and define
f(z) = ! for z # O. Now y is differentiable so, by Theorem 1.9 we have
z
L  dz = J" e - it(ie it ) dt = 271i.
z
U sing the same defini tion of "I and letting m be any integer > 0 gives
f z m dz = J67Teiml (iell)dt = i f6 7T exp (i(m + I)t) dt = if6 7T cas (m + I)t dt-
J1T sin (m + 1)t dt = O.
Now let a,b C and put yet) = tb + (1- t)a for 0 < t < 1. Then y'(t) = b
- a, and using the Fundamental Theorem of Calculus we get that for
1
n > 0, Ii' zndz = (b-a) IA [tb+(l-t)a]n dt = - (b n + t _a n + 1).
n+l
There are more examples in the exercises, but now we will prove a certain
"invariance" result which, besides being useful in computations, forms the
basis for our definition of a curve.
If y: [a, b] - C is a rectifiable path and ep: [c, d]  [a, b] is a continuous
non-decreasing function whose image is all of [a, b] (i.e., ep(c) = a and
ep(d) = b) then y 0 ep: [e, d]  C is a path with the same trace as y. Moreover,
y 0 ep is rectifiable because if c = So < SI <... < Sn = d then a = ep(so) <
ep(SI) < . . · < ep(sn) = b is a partition of [a, b]. Hence
n
L ly(ep(Sk» -y(ep(Sk-l»1 < V(y)
k=1
so that V(y 0 ep) < V(y) < 00. So if f is continuous on {y} = {y 0 ep} then
Iyo qJ f is well defined.
1.13 Proposition. If y: [a, b]  C is a rectifiable path and ep: [e, d]  [a, bJ
is a continuous non-decreasing function -.rith ep(c) = G, ep(d) = b; then for any
functionf continuous on {y}
f f= f f
i' yolf'
Proof Let € > 0 and choose 8 1 > 0 such that for {so < SI <... < sn}, a
partition of [e, d] with (Sk-Sk-l) < 8 1 , and Sk-t < Gk < Sk we have
n
1.14 f f - k/(Y 0 q:>(ak»)[Y 0 <P(Sk)-y 0 <P(Sk-l)] <!e
yolf'
Similarly choose 8 2 > 0 such that if {to < t 1 <... < t n } is a partition of
[a, b] with (t k - tk-t) < 8 2 and tk-t < Tk < t k , then

64
Complex Integration
! f- kt1f(Yh» [y(tk)-y(tk-1) < -iE.
But ep is uniformly continuous on [c, d]; hence there is a 8 > 0, which can be
chosen with 8 < 8 1 , such that lep(s)-ep(s')1 < 8 2 whenever Is-s'l < 8. So if
{so < SI <... < sn} is a partition of [c, d] with (Sk-Sk-l) < 8 < 8 1 and
t k = ep(Sk)' then {to < t 1 < ... < In} is a partition of [a, b] with (tk-t k - 1 )
< 8 2 . If Sk-t < ak < Sk and Tk = rp(ak) then both (1.14) and (1.15) hold.
Moreover, the right hand parts of these two differences are equal! It follows
that
1.15
ff-ff<E
Y "Iolp
Since € > 0 was arbitrary, equality is proved. _
We wish to define an equivalence relation on the collection of rectifiable
paths so that each member of an equivalence class has the same trace and
so that the line integral of a function continuous on this trace is the same for
each path in the class. It would seem that we should define a and y to be
equivalent if a = y 0 ep for some function ep as above. However, this is not
an equivalence relation!
1.16 Definition. Let a: [e, d] -+ C and y: [a, b] -+ C be rectifiable paths.
The path a is equivalent to y if there is a function ep: [c, d] -+ [a, b] which is
continuous, strictly increasing, and with ep(e) = a, ep(d) = b; such that
a = y 0 ep. We call the function ep a change 0..( parameter.
A curve is an equivalence class of paths. The trace of a curve is the trace
of anyone of its members. If/is continuous on the trace of the curve then the
integral of/ over the curve is the integral off over any member of the curve.
A curve is smooth (piecewise smooth) if and only if some one of its
representatives is smooth (piecewise smooth).
Henceforward, we will not make this distinction between a curve and its
representative. In fact, expressions such as "let y be the unit circle tra-
versed once in the counter-clockwise direction" will be used to indicate a
curve. The reader is asked to trust that a result for curves which is, in fact,
a result only about paths will not be stated.
Let y: [a, b] -+ C be a rectifiable path and for a < 1 < b, let Iyl (t) be
V(y; [a, tD. That is,
/yl (t) = sup Lt 1 /y(t k ) - y(tk- 1)1: {to, · · · , t n } is a partition of[a, t]} ·
Clearly Iyl (t) is increasing and so Iyl: [a, b] -+ C is of bounded variation. If
f is continuous on {y} define
b
f fldzl = f f(y(t» dlyl (t).
Y a
If y is a rectifiable curve then denote by -y the curve defined by ( -y) (1) =

Riemann-Stieltjes integrals 65
y( - t) for - b < t < - a. Another notation for this is y - 1. Also if c E C
let y+c denote the curve defined by (y+c) (t) == y(t)+c. The following
proposition gives many basic properties of the line integral.
1.17 Proposition. Let y be a rectifiable curve and suppose that f is a function
continuous on {y}. Then:
(a) 5y.1' == - f - yf;
(b) If yfl < 5 y Iflldzl < V(y) sup [If(z) 1 : z E {y}];
(c) If c E C then fyf(z) dz == 5y +cf(z - c) dz.
The proof is left as an exercise.
The next result is the analogue of the Fundamental Theorem of Calculus
for line integrals.
1.18 Theorem. Let G be open in C and let y be a rectifiable path ill G with
initial and end points (X and f3 respectively. Iff: G  C is a continuous function
with a primitive F: G  C, then
f f = F(f3)-F(rx)
y
(Recall that F is a primitive of fwhen F' == j:)
The following useful fact will be needed in the proof of this theorem.
1.19 Lemma. If G is an open set in C, y: [a,b]-+G is a rectifiable path, and
f: G C is continuous then for every (> 0 there is a polygonal path f in G
such that f(a) = yea), f(b) =:y(b), and Il y f - Ir fl < {.
Proof. Case I. Suppose G is an open disk. Since {y} is a compact set,
d=dist({y},JG»O. It follows that if G=B(c;r) then {y}cB(c;p) where
p = r -  d. The re ason for passing to this smaller disk is that f is uniformly
con tin uous in B ( c; p) c G. Hence wi thou t loss of generality it can be
assumed that f is uniformly continuous on G. Choose 8 > 0 such that
If(z)-f(w)I<€ whenever /z-wl<8. If y:[a,b]-+C then y is uniformly
con tin uous so there is a parti tion {to < t I < ... < t n } of [a, b] such that
1.19a
Iy(s) - y(t)/ < 8
if t k _ I < s, t < t k ; and such that for t k _ I < T k < t k we have
1.20
n
fJ- L J(Y(Tk})[ y(tk)-y(t k -,}] <L
Y k = I
Define f: [a,b]C by
1
f(t)= t -t [(tk-t)y(tk-l)+(t-tk-l)y(tk)]
k k - I
if t k _ I < t < t k . So on [t k _ I' t k ], f( t) traces out the straight line segment
from y(t k - 1 ) to y(t k ); that is, f is a polygonal path in G. From (1.19a)

66
1.21
Complex Integration
If (1)- Y(Tk)1 < 8 for l k - I < I < I k .
Since f r f= f/:J(f(t))f'(t)dl it follows that
( i=  y(tk)-y(t k - I ) f t f(f(/))dt.
J r A. = I I k - I k - I t I
Using (1.20) we obtain
n
fi-li < (+ L i(y(T k »)[ y(t k )-y(t k - 1 )]-li
Y r k=1 r
n
< (+  !y(tk)-y(tk_I)!(tk-tk_I)-ljIA li(r(t»)-i(Y(Tk»)ldt.
k = I t I
Applying (1.21) to the integrand gives
n
fi-l/ « +{ly(tk)-y(tk_I)I < {(I+V(y»).
Y I A.=I
The proof of Case I now follows.
Case I I. G is arbitrary. Since {y} is compact there is a number r with
0< r < dist( {y}, aG). Choose 8 > 0 such that I y(s) - y(t)1 < r when Is - II <
8. If P= {t o < t l <... < In} is a partition of [a,b] with IIPII <8 then
ly(/)-y(lk-I)I<r for Ik-I < t < I k . That is if Yk:[tk-I,lk]G is defined by
Yk(/)=y(/) then {Yk}cB(Y(lk_I);r) for l < k < n. By Case I there is a
polygonal path f k : [t k - 1 , I k ]  B(y(t k - 1 ); r) such that fk(t k - 1 ) = y(t k - 1 ),
fk(t k ) = y(t k ), and I/ yk ! - Irk!1 < fin. If f(/) = fk(t) on [t k - 1 , t k ] then
f has the required properties. II
Proof of Theorem 1.18. Case I. y: [a,b]C is piecewise smooth. Then fyf =
.r:f( y( t))y'( I) dt = fF'( Y(/))y'( I) dl = f (Fe y)'( t) dt = F( y( b)) -
F(y(a))=F(f3)-F(a) by the Fundamental Theorem of Calculus.
Case II The General Case. If f>O then Lemma 1.19 implies there is a
polygonal path f from a to f3 such that IIyf - Ir f/ < f. But f is piecewise
smooth, so by Case I f r f = F( f3) - F( a). Hence If yf - [F( f3) - F(a)]1 < f.;
since £. > 0 is arbitrary, the desired equality follows. II
The use of Lemma 1.19 in the proof of Theorem 1.18 to pass from the
piecewise smooth case to the rectifiable case is typical of many proofs of
results on line integrals. We shall see applications of Lemma 1.19 in the
future.
A curve y: [a, b]  C is said to be closed if y(a) = y(b).
1.22 Corollary. Let G, y, and f satisfy the same hypothesis as in Theorem
1.18. If y' is a closed curve then
jl= 0
y

Riemann-Stieltjes interals
67
The Fundamental Theorem of Calculus says that each continuous
function has a primitive. This is far from being true for functions of a
complex variable. For example letf(z) = Izl 2 = X 2 +y2. If F is a primitive
of f then F is analytic. So if F = U+iV then X 2 +y2 = F'(x+iy). Now,
using the Cauchy-Riemann equations,
oU oV au 8V
- = - = x 2 + y2 and - = - = o.
8x oy oy ox
oU
But - = 0 implies that U(x, y) = u(x) for some differentiable function u.
oy
au
But this gives x 2 + y2 = - = u'(x), a clear contradiction. Another way to
ox
see that Izl2 does not have a primitive is to apply Theorem 1.18 (see Exercise
8).
Exercises
1. Let y: [a, b]   be non decreasing. Show that y is of bounded variation
and V(y) = y(b)-y(a).
2. Prove Proposition 1.2.
3. Prove Proposition 1.7.
4. Prove Proposition 1.8 (Use induction).
5. Let y(t) = exp « -1 + i)t- 1 ) for 0 < t < 1 and y(O) = o. Show that y is
a rectifiable path and find V(y). Give a rough sketch of the trace of y.
6. Show that if y; [a, b] --+ C is a Lipschitz function then y is of bounded
variation.
1
7. Show that y: [0, 1] -7 C, defined by y(t) = t + it sin - for t =1= 0 and
t
y(O) = 0, is a path but is not rectifiable. Sketch this path.
8. Let y and a be the two polygons [1, i] and [1, 1 + i, i]. Express y and a as
paths and calculate fy f and Sa f where f(z) = Izj2.
9. Define y: [0, 27T] -7 C by y(t) = exp (int) where n is some integer (positive,
negative, or zero). Show that f  dz = 27Tin.
y z
10. Define y(t) = e it for 0 < t < 27T and find Jy zn dz for every integer n.
11. Let y be the closed polygon [1- i, 1 + i, -1 + i, -1- i, 1- i]. Find
f ! dz.
y z
12. Let l(r) = f eiz dz where y: [0, 1T]  C is defined by yet) = re u . Show
y z
that lim l(r) = o.
r --'; 00
13. Find J y z - t dz where : (a) y is the upper half of the unit circle from
+ 1 to - 1 : (b) y is the lower half of the unit circle from + 1 to - 1.

68
Complex Integration
14. Prove that if ({J: [a, b]  [c, d] is continuous and ({J(a) == c, ({J(b) == d
then ({J is one-one iff ({J is strictly increasing.
15. Show that the relation in Definition 1.16 is an equivalence relation.
16. Show that if y and a are equivalent rectifiable paths then V(y) == V(a).
17. Show that if y: [a, b]  C is a path then there is an equivalent path
a: [0, 1]  C.
18. Prove Proposition 1.17.
19. In the proof of Case I of Lemma 1.19, where was the assumption that y
lies in a disk used?
20. Let yet) == I + e it for 0 < t < 27T and find Jy (Z2 -1) -1 dz.
21. Let yet) == 2e it for -7T < t < 7T and find Jy (z2_1)-1 dz.
22. Show that if F 1 and F 2 are primitives for f: G  C and G is connected
then there is a constant c such that F 1 (z) == c + F 2 (z) for each z in G.
23. Let y be a closed rectifiable curve in G and a  G. Show that for n > 2,
J y (z - a) - n dz == O.
24. Prove the following integration by parts formula. Let f and g be analytic
in G and let y be a rectifiable curve from a to b in G. Then J y jg' == f( b )g( b) -
f(a)g(a) - Jyf'g.
2. Power series representation of analytic functions
In this section we will see that a function f, analytic in an open set G,
has a power series expansion about each point of G. In particular, an analytic
function is infinitely differentiable.
We begin by proving Leibniz's rule from Advanced Calculus.
2.1 Proposition. Let ({J: [a, b] x [c, d]  C be a continuous function and define
g: [c, d]  C by
2.2
b
g(t) = f qJ(s, t) ds.
a
Then g is continuous. Moreover, if oqJ exists and is a continuous function on
ot
[a, b] x [c, d] then g is continuously differentiable and
2.3
b
, f 0({J (
g (t) == - s, t) ds.
ot
a
Proof The proof that g is continuous is left as an exercise. Notice that if we
prove that g is differentiable with g' given by formula (2.3) then it will follow
from the first part that g' is continuous since oqJ is continuous. Hence, we
ot
need only verify formula (2.3).

Power series representation of analytic functions 69
oqJ
Fix a point to in [c, d] and let E > O. Denote - by qJ2; it follows
ot
that qJ2 must be uniformly continuous on [a, b] x [c, d]. Thus, there is a 8 > 0
such that !<P2(S', t')-<P2(S, t)1 < E whenever (S-S')2+(t-t')2 < 8 2 . In
particular
2.4
1<p2(s, t) - <P2(S, t 0)1 < E
whenever It-to! < 8 and a < s < b. This gives that for It-to! < 8 and
a < s < b,
2.5
t
f [<pis, 1") - <pis, to)] d1" < Elt - tol.
to
But for a fixed s in [a, b] <D(t) = <pes, t) - t<P2(S, to) is a primitive of qJ2(S, t)-
<P2(S, to). By combining the Fundamental Theorem of Calculus with in-
equality (2.5), it follows that
I <pc s, t) - <pc s, to) - ( t - t o)<p 2 (s, to) I < E It - to I
for any s when It-tol < 8. But from the definition of g this gives
b
g(t)-g(t o ) _ f <P2(S, to) ds < E(b-a)
t-t o
a
when 0 < It-tol < 8.11
This result can be used to prove that
21t
f .eiS ds = 27T if Izi < 1.
e 'S - z
o
Actually, we will need this formula in the proof of the next proposition.
e is
Let <pes, t) = is for 0 < t < 1, 0 < s < 27T; (Note that <P is continuously
e -tz
differentiable because Izi < 1.) Hence get) = S6 1t <pes, t) ds is continuously
differentiable. Also, g(O) = 27T; so if it can be shown that g is a constant,
then 27T = g(l) and the desired result is obtained.
Now
21t
f zeis
g'(t) = (e iS _ tZ)2 ds;
o
but for t fixed, <1>(s) = zi(e iS - tz) -1 has <1>'(s) = - zi(e is - tz) - 2(ie is ) =
ze is (e is _tz)-2. Hence g'(t) = <1>(27T)-<1>(O) = 0, so g must be a constant.

70 Complex Interation
The next result, although very important, is transitory. We will see a
much more general result than this-Cauchy's Integral Formula; a formula
which is one of the essential facts of the theory.
2.6 Proposition. Let f: G -7 C be analytic and suppose B(a; r) c G(r > 0).
If yet) = a + re it , 0 < t < 27T, then
I(z) =  f f(W) dw
27T1 w-z
'Y
for Iz-al < r.
Proof. By considering G 1 = H (z-a): z E G} and the function g(z) = I(a+
rz) we see that, without loss of generality, it may be assumed that a = 0
and r = 1. That is we may assume that B(O; 1) c G.
Fix z, Izi < 1; it must be shown that
I(z) =  f f(W) dw
27T1 w-z
'Y
21t
_  f f(eiS)eiS .
- . ds,
27T e 'S - z
o
that is, we want to show that
21t
f f( eis)e is
o = . ds-27Tf(z)
elS - z
o
21t
f[ f(eiS)e iS ]
= . - fez) ds
e lS - Z
o
We will apply Leibniz's rule by letting
( ) = fez + t(e is - z»e iS _ f( )
q; s, t , z ,
e 'S - z
for 0 < t < 1 and 0 < s < 27T. Since Iz+t(eis-z)1 = Iz(l-t)+te iS I < 1,
q; is well defined and is continuously differentiable. Let get) = J1t cp(s, t) ds;
so g has a continuous derivative.
The proposition will be proved if it can be shown that gel) = 0; this is
done by showing that g(O) = 0 and that g is constant. To see that g(O) = 0

Power series representation of analytic functions
compute:
71
21t
g(O) = J Ip(S, 0) ds
o
21t
f [ j(z)eiS ]
= eis_z - j(z) ds
o
21t
f eis
= j(z) is ds-27Tf(z)
e -z
o
= 0,
f 21t eis
since we showed that ' ds = 27T prior to the statement of this pro-
o e lS - z
position.
To show that g is constant compute g'. By Leibniz's rule, g'(t) = J1t
f{J2(S, t) ds where
f{J2(S, t) = eiJ'(z+ t(e is - z».
However, for 0 < t < 1 we have that <1>(s) = -it-1f(z+t(eiS-z» is a
primitive of f{J2(S, t). So g'(t) = <1>(27T) -<1>(0) = 0 for 0 < t < 1. Since g' is
continuous we have g' = 0 and g must be a constant. II
How is this result used to get the power series expansion? The answer is
that we use a geometric series. Let Iz-al < r and suppose that w is on the
circle Iw-al = r. Then
1 1 1 1 ex>
w-z = w-a . [ z-a J = (w-a) L ( z- a ) n
1- n=O w-a
w-a
since Iz-al < r = Iw-al. Now, multiplying both sides by [f(w)/27TiJ and
integrating around the circle y: Iw-al = r, the left hand side yieldsf(z) by the
preceding proposition. The right hand side becomes-what? To find the
answer we must know that we can distribute the integral through the infinite
sum.
2.7 Lemma. Let y be a rectifiable curve in C and suppose that Fn and Fare
continuous functions on {y}. If F = u-lim Fn on {y} then
f F = lim f Fn.
y y

72 Complex Integration
Proof Lete > O;thenthereisanintegerNsuchthatIFn(w)-F(w)1 < ejV(y)
for all w on {y} and n > N. But this gives, by Proposition 1.17(b),
J F - J Fn = J (F-F n )
y y y
< J IF(w)-Fn(w)lldwJ
y
< e
whenever n > N. II
00
2.8 Theorem. Let f be analytic in B(a; R); then fez) = L an(z-a)n for
n=O
1
Iz-al < R where an = ,. f(lI) (a) and this series has radius 0..( convergence > R.
n.
Proof Let 0 < r < R so that B(a; r) c B(a; R). Ify(t) = a+re it , 0 < t < 217,
then by Proposition 2.6,
I J f( w)
fez) = -. - dw for Iz-al < r.
2171 w-z
y
But, since Iz-al < rand w is on the circle {y},
If(w)/Iz-al n < M ( lz-a, ) n
Iw-al n + 1 - r r
Iz-al
where M = max {Ij'(w) I ; Iw-al = r}. Since < 1, the Weierstrass
r
M-test gives that L few) (z-a)nj(w-a)n+l converges uniformly for w on
{y}. By Lemma 2.7 and the discussion preceding it
2.9
 [ 1 J few) ]
j(z) = ;S 217i (w-aY+ 1 dw (z-aY
y
If we set
a =  J f( w) dw
n 217i (w_a)n+l
y
then an is independent of z, and so (2.9) is a power series which converges
for Iz-al < r.
It follows (Proposition III. 2.5) that an =  j(n)(a), so that the value of an
n!
is independent of y; that is, it is independent of r. So
2.10
00
fez) = L an(z-a)n
n= 0
for Iz - al < r. Since r was chosen arbitrarily, r < R, we have that (2. 10)

Power series representation of analytic functions 73
holds for Iz - al < R; giving that the radius of convergence of (2.10) must
be at least R. _
00
2.11 Corollary. Iff: G  C is analytic and a E G thenf(z) = L an(z-a)n for
Iz-al < R where R = dCa, 8G). 0
Proof. Since R = dCa, 8G), B(a; R) c G so that f is analytic on B(a; R).
The result now follows from the theorem. _
2.12 Corollary. Iff: G  C is analytic then f is infinitely differentiable.
2.13 Corollary. Iff: G  C is analytic and R(a; r) c G then
j(n)(a) =  f few) dw
21Ti (w_a)n+l
)'
where yet) = a+re it , 0 < t < 21T.
2.14 Cauchy's Estimate. Let f be analytic in B(a; R) and suppose If(z) I < M
for all z in B(a; R). Then
/j(n)(a) I < n,: .
Proof. Since Corollary 2.13 applies with r < R, Proposition 1.17 implies
that
If(n)(a) I < ( n! ) M . 21Tr = n !M
21T r n + 1 r n
Since r < R is arbitrary, the result follows by letting r  R -. II
We will conclude this section by proving a proposition which is a special
case of a more general result which will be presented later in this chapter.
2.15 Proposition. Let f be analytic in the disk B(a; R) and suppose that y is a
closed rectifiable curve in B(a; R). Then
f j = O.
}'
Proof. This is proved by showing that f has a primitive (Corollary 1.22).
Now, by Theorem 2.8, fez) = L an(z-a)n for Iz-al < R. Let
F(z) =  (  ) (z-a)n+l = (z-a)  (  ) (z-a)n.
n=O n+l 0 n+l
Since lim (n+ l)l/n = 1, it follows that this power series has the same radius
of convergence as L an(z-a)n. Hence, F is defined on B(a; R). Moreover,
F'(z) = fez) for Iz-al < R. II
Exercises
1. Show that the function defined by (2.2) is continuous.
2. Prove the- following analogue of Leibniz's rule (this exerCIse will be

74 Complex Integration
frequently used in the later sections.) Let G be an open set and let I' be a
rectifiable curve in C. Suppose that ep: {y} x G  C is a continuous function
and define g: G  C by
g(z) = f cp(w, z) dw
y
then g is continuous. If acp exists for each (w, z) in {y} x G and is continuous
oz
then g is analytic and
f oep
g'(z) = - (w, z) dJv.
oz
'Y
-
3. Suppose that y is a rectifiable curve in C and ep is defined and continuous
on {y}. Use Exercise 2 to show that
f ep( w)
g(z) = - dw
w-z
'Y
is analytic on C - {y} and
(n) ( ) - , f ep( w) d
g z - n. (w_z)n+l w.
'Y
4. (a) Prove Abel's Theorem: Let Lan (z-a)n have radius of convergence 1
and suppose that L an converges to A. Prove that
lim L anr" = A.
rl-
(Hint: Find a summation formula which is the analogue of integration by
parts. )
(b) Use Abel's Theorem to prove that log 2 = 1-!-+-!--. . .
5. Give the power series expansion of log z about z = i and find its radius of
convergence.
6. Give the power series expansion of Ii about z = I and find its radius of
convergence.
7. Use the results of this section to evaluate the following integrals:
f e i %
(a) Z2 dz,
y
(b) f dz ,
z-a
y
(c) f S3 Z dz,
y
(d) fo; z dz,
.,
y(t) = e it ,
o < t < 21T;
1'(1) = a+ re it ,
o < 1 < 21T;
1'(1) = e it ,
o < t < 21T;
y(1) = I +te it ,
o < I < 21T and n > o.

Power series representation of analytic functions 7S
8. Use a Mobuis transformation to show that Proposition 2.15 holds if the
disk B(a; R) is replaced by a half plane.
9. Use Corollary 2.13 to eval uate the following integrals:
(a) f ez - e - z dz where n is a positive integer and y(t) = e it , 0 < t < 21T;
zn
y
(b) f dz 1 n where n is a positive integer and y( t) = 1 + e it , 0 < t < 27T;
(Z-2)
y
(c) f 2dz where y(t) = 2e it , 0 < t < 21T. (Hint: expand (Z2 + 1)-1 by
z + I
y
means of partial fractions);
f sIn z '
(d) ----;- dz where y(t) = e", 0 < t < 21T;
y
f zl/m
(e) ) dz where y(t) = I+!e it , 0 < t < 21T.
(z -I m
y
f Z2 + I '
10. Evaluate 2 dz where yet) = re 't ,
z(z + 4)
y
values of r, 0 < r < 2 and 2 < r < 00.
11. Find the domain of analyticity of
o < t < 21T, for all possible
1 ( 1 + iZ )
f(z) = 2i log l-iz ;
also, show that tan f(z) = z (i.e., f is a branch of arctan z). Show that
00 Z2k+ 1
j(z) = L ( - l)k for Izl < 1
k=O 2k+ I
(Hint: see Exercise III. 3.19.)
12. Show that
00
'" E 2k k
sec z = 1 +  - Z2
k = 1 (2k)!
for some constants £2' £4" · · . These numbers are called Euler's numbers.
What is the radius of convergence of this series? Use the fact that 1 = cos z
sec z to show that
E 2n - (2 ;n 2) E 2n - 2 + (2 ;n 4) E 2n - 4 + · · · +( _I)n C2 n ) E 2 +( _l)n = O.
Evaluate E 2 , E 4 , E 6 , Es. (E 10 = 50521 and E 12 = 2702765).

76 Complex Integration
e Z -l
13. Find the series expansion of about zero and determine its radius
z
z
of convergence. Consider f(z) = and let
e Z -l
00
I(z) = 6 : Zk
be its power series expansion about zero. What is the radius of convergence?
Show that
( n+ 1 ) ( n+ 1 )
o = a 0 + 1 a 1 + . . . + n an.
Using the fact that f(z) +!z is an even function show that a k = 0 for k odd
and k > 1. The numbers B 2n = (_I)n-l a2n are called the Bernoulli numbers
for n > 1. Calculate B 2 , B4'. . . Bl o.
14. Find the power series expansion of tan z about z = 0, expressing the
coefficients in terms of Bernoulli numbers. (Hint: use Exercise 13 and the
formula cot 2z = t cot z-! tan z.)
3. Zeros of an analytic function
If p(z) and q(z) are two polynomials then it is well known that
p(z) = s (z)q(z) + r(z) where s(z) and r(z) are also polynomials and the degree
of r(z) is less than the degree of q(z). In particular, if a is such that p(a) = 0
then choose (z - a) for q(z). Hence, p(z) = (z - a)s(z) + r(z) and r(z) must
be a constant polynomial. But letting z = a gives 0 = p(a) = r(a). Thus,
p(z) = (z-a)s(z). If we also have that s(a) = 0 we can factor (z-a) from
s(z). Continuing we get p(z) = (z-a)m t(z) where 1 < m < degree of p(z),
and t(z) is a polynomial such that t(a) :/; O. Also, degree t(z) = degree
p(z)-m.
3.1 Definition. If f: G -7 C is analytic and a in G satisfies f(a) = 0 then a
is a zero of f of multiplicity m > 1 if there is an analytic function g: G -7 C
such that f(z) = (z - a)mg(z) where g(a) :/; O.
Returning to the discussion of polynomials, we have that the multiplicity
of a zero of a polynomial must be less than the degree of the polynomial.
If n = the degree of the polynomial p(z) and aI' . . . , ak are all the distinct
zeros of p(z) thenp(z) = (z-a1)m t .. . (z-ak)mkS(z) where s(z) is a polynomial
with no zeros. Now the Fundamental Theorem of Algebra says that a
polynomial with no zeros is constant. Hence, if we can prove this result we
will have succeeded in completely factoring p(z) into the product of first
degree polynomials. The reader might be pleasantly surprised to know that
after many years of studying Mathematics he is right now on the threshold
of proving the Fundamental Theorem of Algebra. But first it is necessary to
prove a famous result about analytic functions. It is also convenient to
introduce some new terminology.

Zeros of an analytic function 77
3.2 Definition. An entire function is a function which is defined and analytic
in the whole complex plane C. (The term "integral function" is also used.)
The following result follows from Theorem 2.8 and the fact that C
contains B(O; .R) for arbitrarily large R.
3.3 Proposition. If f is an entire function then f has a power series expansion
00
f(z) = L anz n
n= 0
with infinite radius of convergence.
In light of the preceding proposition, entire functions can be considered
as polynomials of "infinite degree". So the question arises: can the theory of
polynomials be generalized to entire functions? For example, can an entire
function be factored? The answer to this is difficult and is postponed to
Section VII. 5. Another property of polynomials is that no non constant
polynomial is bounded. Indeed, if p(z) = zn + an _ 1 zn - 1 + . . . + ao then
limp(z) = lim zn [1+an_lz-l+".+aoz-n] = 00. The fact that this also
ZOO zoo
holds for entire functions is an extremely useful result.
3.4 Liouville's Theorem. If f is a bounded entire function then f is constant.
Proof. Suppose If(z) I < M for all z in C. We will show that f'(z) = 0 for
all z in C. To do this use Cauchy's Estimate (Corollary 2.14). Since f is
analytic in any disk B(z; R) we have that If'(z)/ < Mj R. Since R was arbi-
trary, it follows that f'(z) = 0 for each z in C. II
The reader should not be deceived into thinking that this theorem is
insignificant because it has such a short proof. We have expended a great
deal of effort building up machinery and increasing our knowledge of analytic
functions. We have plowed, planted, and fertilized; we shouldn't be surprised
if, occasionally, something is available for easy picking.
Liouville's Theorem will be better appreciated in the following applica-
ti 0 n.
3.5 Fundamental Theorem of Algebra. If p(z) is a non constant polynomial
then there is a complex number a with p(a) = o.
Proof. Suppose p(z) =1= 0 for all z and let fez) = [p(z)] -1 ; then f is an entire
function. If p is not constant then, as was shown above, lim p(z) = 00;
z oo
so lim fez) = o. In particular, there is a number R > 0 such that If(z) I < 1
zoo
if Izi > R. Butfis continuous on B(O; R) so there is a constant M such that
If(z) I < M for Izi < R. Hencefis bounded and, therefore, must be constant
by Liouville's theorem. It follows that p must be constant, contradicting our
assumption. II
3.6 Corollary. If p(z) is a polynomial and aI' . . . , am are its zeros with a j
having multiplicity k j then p(z) = c(z-a 1 )kl.. . (Z-am)k m for some constant c
and k 1 + . . . +k m is the degree of p.
Returning to the analogy between entire functions and polynomials, the

78 Complex Integration
reader should be warned that this cannot be taken too far. For example, if p
is a polynomial and a E C then there is a number z with p(z) = a. In fact,
this follows from the Fundamental Theorem of Algebra by considering the
polynomial p(z) - a. However the exponential function fails to have this
property since it does not assume the value zero. (Nevertheless, we are able
to show that this is the worst that can happen. That is, a function analytic
in C omits at most one value. This is known as Picard's Little Theorem and
will be proved later.) Moreover, no one should begin to make an analogy
between analytic functions in an open set G and a polynomial p defined on
C; rather, you should only think of the polynomials as defined on G.
For example, let
f(z) = cos ( 1 +z ) , Izl < 1.
l-z
Notice that 1 +z maps D = {z: Izi < I} onto G = {z: Re z > O}. The zeros
l-z
of f are the points { n1T - 2 : n is Odd } ; so f has infinitely many zeros.
n1T + 2
However, as n  00 the zeros approach 1 which is not in the domain of
analyticity D. This is the story for the most general case.
3.7 Theorem. Let G be a connected open set and let f: G  C be an analytic
junction. Then. the following are equivalent statements:
(a) f = 0;
(b) there is a point a in G such that f(n)(a) = 0 for each n > 0;
(c) {z E G: j(z) = o} has a limit point in G.
Proof. Clearly (a) implies both (b) and (c). (c) implies (b): Let a E G and a
limit point of Z = {z E G: f(z) = O}, and let R > 0 be such that B(a; R) c
G. Since a is a limit point of Z and f is continuous it follows that f(a) = O.
Suppose there is an integer n > 1 such that f(a) = f'(a) = · . . = f(n-l)(a)
= 0 and f(n)(a) =1= O. Expanding f in power series about a gives that
00
f(z) = L ak(z-a)k
k=n
for Iz-al < R. If
00
g(z) = L ak(z-a)k-n
k=n
then g is analytic in B(a; R), f(z) = (z - a)ng(z), and g(a) = an =1= o. Since
g is analytic (and therefore continuous) in B(a; R) we can find an r, 0 < r <
R, such that g(z) =1= 0 for Iz - al < r. But since a is a limit point of Z there
is a point b with f(b) = 0 and 0 < Ib-al < r. This gives 0 = (b-a)ng(b)
and so g(b) = 0, a contradiction. Hence no such integer n can be found;
this proves part (b).
(b) implies (a): Let A = {z E G: f<n)(z) = 0 for all n > O}. From the
hypothesis of (b) we have that A =1= D. We will show that A is both open

Zeros of an analytic function 79
and closed in G; by the connectedness of G it will follow that A must be G
and so f = O. To see that A is closed let z E A - and let z" be a sequence in
A such that z = Iim z". Since each fen> is continuous it follows that
f(n>(z) = limf(n>(z,,) = O. So Z E A and A is closed.
To see that A is open, let a E A and let R > 0 be such that B(a; R) c G.
1
Then fez) =  an(z-a)n for Iz-al < R where an = - 1(1I>(a) = 0 for each
n!
n > O. Hencef(z) = 0 for all z in B(a; R) and, consequently, B(a; R) c A.
Thus A is open and this completes the proof of the theorem. II
3.8 Corollary. If f and g are analytic on a region G then f = g iff {z e G:
fez) = g(z)} has a limit point in G.
This follows by applying the preceding theorem to the analytic function
f-g.
3.9 Corollary. If f is analytic on an open connected set G and f is not identi-
cally zero then for each a in G with f(a) = 0 there. is an integer n > 1 and an
analytic function g: G  C such that g(a) -# 0 and fez) = (z-a)"g(z) for all
z in G. That is, each zero off has finite multiplicity.
Proof Let n be the largest integer ( > 1) such that f(lI- 1 >(a) = 0 and define
g(z) = (z-a)-'1(z) for z -# a and g(a) = l1<")(a). Then g is clearly analytic
n!
in G - {a}; to see that g is analytic in G it need only be shown to be analytic
in a neighborhood of a. This is accomplished by using the method of the
proof that (c) implies (b) in the theorem. II
3.10 Corollary. If'f: G  C is analytic and not constant, a E G, and f'(a) = 0
thenthereisanR > OsuchthatB(a;R) C Gandf(z) -# Of or 0 < Iz-al < R.
Proof By the above theorem the zeros of j' are isolated. II
There is one instance where the analogy between polynomials and analytic
functions works in reverse. That is, there is a property of analytic functions
which is not so transparent for polynomials.
3.11 Maximum Modulus Theorem. IfG is a region andf: G --.)0 C is an analytic
function such that there is a point a in G with I/(a) I > I/(z) I for all z in G, then
f is constant.
Proof Let B( a; r) c G, y(t) = a+re it for 0 < t < 217'; according to Pro-
position 2.6
1(0) =  f f(W) dw
21T1 w-a
.,
2_
=  f f(a+reit)dt
217'
o

80
Hence
Complex Integration
21t
I J '
I/(a) I < - I/(a + re't)1 dt < I/(a) I
271
o
since I/(a + re it )/ < I/(a) I for all t. This gives that
21t
0= I [if(a)[-lf(a+reit)l]dt;
o
but since the integrand is non-negative it follows that I/(a) I = I/(a + reit)1
for all t. Moreover, since r was arbitrary, we have that j' maps any disk
B(a; R) c G into the circle Iz/ = lal where a = I(a). But this implies that I
is constant on B(a; R) (Exercise III. 3.17). In particular/(z) = a for Iz-aj
< R. According to Corollary 3.8, I = a. _
According to the Maximum Modulus Theorem, a non-constant analytic
function on a region cannot assume its maximum modulus; this fact is far
from obvious even in the case of polynomials. The consequences of this
theorem are far reaching; some of these, along with a closer examination of
the Maximum Modulus Theorem, are presented in Chapter VI. (Actually,
the reader at this point can proceed to Sections VI. 1 and VI. 2.)
Exercises
1. Let I be an entire function and suppose there is a constant M, an R > 0,
and an integer n > 1 such that I/(z) 1 < M jzjn for Izi > R. Show that I is a
polynomial of degree < n.
2. Give an example to show that G must be assumed to be connected in
Theorem 3.7.
3. Find all entire functions I such that I(x) = eX for x in .
4. Prove that e Z + a = eZe a by applying Corollary 3.8.
5. Prove that cos (a + b) = cos a cos b - sin a sin b by applying Corollary 3.8.
6. Let G be a region and suppose that I: G  C is analytic and a E G such
that I/(a)/ < I/(z) 1 for all z in G. Show that either I(a) = 0 or I is constant.
7. Give an elementary proof of the Maximum Modulus Theorem for
polynomials.
8. Let G be a region and let f and g be analytic functions on G such that
f(z)g(z) = 0 for all z in G. Show that either f = 0 or g = O.
9. Let U: C  IR be a harmonic function such that U( z) > 0 for all z in C;
prove that U is constant.
10. Show that if f and g are analytic functions on a region G such that! g is
analytic then either f is constant or g = o.
 4. The index of a closed curve
We have already shown that f (z - a) - I dz = 2'1Tin if yet) = a + elwin/.
The following result shows that this Y is not peculiar to the path y.

Cauchy's Theorem 81
4. t Proposition. If "I : [0, l] C is a closed rectifiable curve and a f {y} then
I f dz
2wi z-a
y
is an integer.
Proof. This is only proved under the hypothesis that "I is smooth. In this
case define g : [0, 1 ]C by
I I y'(s)
g(t)= () ds
"I s -a
o
Hence, g(O)=O and g(I)= fy(z - a)-I dz. We also have that
g'(t)= y'(t) for O < t < 1.
y(t)-a
But this gives
!{ e - g ("I - a) = e - gy, - g' e - g ("I - a)
dt
=e- g [ y'-y'(y-a)-l(y-a)]
=0
So e - g ("I - a) is the constant function e - g(o>( "1(0) - a) = "1(0) - a =
e-g(I)(y(I)- a). Since "1(0)= "1(1) we have that e-g(l)= lor that g(I)=21Tik
for some integer k. .
4.2 Definition. If "I is a closed rectifiable curve in C then for a f {"I}
n(y;a)= _ 2 1 , j (z-a)-ldz
WI y
is called the index of "I wi th respect to the point a. I t is also sometimes
called the winding number of "I around a.
Recall that if y: [0, I]C is a curve, - y or y -1 is the curve defined by
(-y)(t)=y(l-t) (this is actually a reparametrization of the original
definition). Also if y and 0 are curves defined on [0, I] with y( 1) = 0(0) then
1'+0 is the curve (y+o)(t)=y(2t) if o < ti and (1'+o)(t)=0(2t-l) if
t < t < I. The proof of the following proposition is left to the reader.
4.3 Proposition. If "I and a are closed rectifiable curves having the same
initial points then
(a) n ( "I; a) = - n ( - "I; a ) for every a  {"I};
(b) n ( "I + a; a) = n ( "I; a) + n ( a; a) for every a f {"I} U { a } .
Why is n( y; a) called the winding number of y about a? As was said
before if y(t)=a+e 2 '1Tint for 0 < t < I then n(y; a)=n. In fact if Ib-al < I
then n(1'; b)=n and if Ib-al> 1 then n(y; b)=O. This can be shown
directly or one can invoke Theorem 4.4 below. So at least in this case
n( 1'; b) measures the number of times l' wraps around b - with the minus
sign indicating that the curve goes in the clockwise direction.

82 Complex Integration
The following discussion is intuitive and mathematically imprecise.
Actually, with a little more sophistication this discussion can be corrected
and gives insight into the Argument Principle (V.3).
If "I is smooth then
J( ) -I d 1 1 y'(t) d
z - a z = t.
y 0 y(t)-a
Taking inspiration from calculus one is tempted to write f y(z - a)-I dx =
log[y(t)- a]I:. Since "1(1)= "1(0), this would always give zero. The diffi-
culty lies in the fact that y(t) - a is complex valued and unless y(t) - a lies
in a region on which a branch of the logarithm can be defined, the above
inspiration turns out to be only so much hot air. In fact if "I wraps around
the point a then we cannot define log( y( t) - a) since there is no analytic
branch of the logarithm defined on C - { a}.
Nevertheless there is a correct interpretation of the preceding discus-
sion. If we think of logz = loglzl + i argz as defined then
J (z - a) - I dz = log[ y( I) - a ] -Iog[ y (0) - a ] =
y
{logly(l) - al-Iogly(O) - al} + i {arg[ "1(1) - a] -arg[ "1(0) - a]}.
Since the difficulty in defining logz is in choosing the correct value of
arg z, we can think of the real part of the last expression as equal to zero.
Since "I (1) = "I (0) it m us t be that even with the ambiguity in defining arg z,
arg[ y( 1) - a] - arg[ "1(0) - a] must equal an integral multiple of 2'lT, and
furthermore this integer counts the number of times "I wraps around a.
Let "I be a closed rectifiable curve and consider the open set G = C -
{ "I}. Since {"I} is compact {z: I z I> R } c G for some sufficiently large R.
This says that G has one, and only one, unbounded component.
4.4 Theorem. Let "I be a closed rectifiable curve in C. Then n ( "I; a) is
constant for a belonging to a component of G = C - { "I }. A Iso, n ( "I; a) = 0 for
a belonginK to the unbounded component of G.
Proof. Definef:GC byf(a)=n(y;a). It will be shown thatfis continu-
ous. If this is done then it follows that feD) is connected for each
component D of G. But since f( G) is contained in the set of integers it
follows that f(D) reduces to a single point. That is, f is constant on D.
To show that f is continuous recall that the components of G are open
(Theorem II. 2.9). Fix a in G and let r = d {a, { "I}). If I a - bl < 8 <  r then
If(a)-f(b)l= 2 [(z-a)-I-(z-b)-I]dZ
I I (a-b)
= 2'lT (z-a)(z-b) dz
y
la- b/ l Idzl
< 2'lT Iz - al/z - bl
y

Cauchy's Theorem
But for la - hi < i rand z on {y} we have that
28
Iz - bl > i r. It follows that IJ(a) - f(b)/ < 2 V (y).
'Trr
then, by choosing 8 to be smaller than -i rand (wr 2 £) j2V( y), we see that f
must be continuous. (Also, see Exercise 2.3.) _
Now let U be the unbounded component of G. As was mentioned before
the theorem there is an R > 0 such that U:J {z: Izi > R}. If € > 0 choose
a with lal > Rand Iz - al > (2'Tr€)-lV(y) uniformly for z on {y}; then
In(y; a)1 < €. That is, n(y; a)  0 as a  00. Since n(y; a) is constant on
U, it must be zero. II
83
Iz-al > r>!r and
So if £ >0 is given
Exercises
1. Prove Proposition 4.3.
2. Give an example of a closed rectifiable curve y in C such that for any
integer k there is a point a f/. {y} with n( y; a) = k.
3. Let p (z) be a polynomial of degree n and let R > 0 be sufficiently large
so that p never vanishes in {z: z > R}. If y(t) = Re lt , 0 < t < 2'Tr, show
that f p'( z) dz = 2'Trin.
yp(z)
4. Fix w=re I8 #=O and let y be a rectifiable path in C-{O} from 1 to w.
Show that there is an integer k such that f yZ - I dz = logr + if} + 2wik.
5. Cauchy's Theorem and Integral Formula
We have already proved Cauchy's Theorem for functions analytic In a
disk: if G is an open disk then f yJ = 0 for any analytic function f on G and
any closed rectifiable curve y in G (Proposition 2.15). For which regions G
does this result remain valid? There are regions for which the result is
false. For example, if G = C,- {O} and 1(z) = z - I then y(t) = ell for 0 < t <
2'1T gives that f y1 = 2'1Ti. The difficulty with C - {OJ is the presence of a hole
(namely {O}). In the next section it will be shown that f yf = 0 for every
analytic function 1 and every closed rectifiable curve y in regions G that
have no "holes."
In the present section we adopt a different approach. Fix a region G
and an analytic function J on G. Is there a condition on a closed rectifiable
curve y such that f yf = O? The answer is furnished by the index of y with
respect to points outside G. Before presenting this result we need the
following lemma. (This has already been seen in Exercise 2.3.)
5.1 Lemma. Let y be a rectifiable .curve and suppose cp is a function defined
and continuous on {y}. For each m > 1 let Fm(z) = f yCP( w)( w - z) -m dw for
z f {y}. Then each Fm is analytic on C - {y} and F;"(z) = mF m + )(z).
Proof. We first claim that each Fm is continuous. In fact, this follows in the
same way that we showed that the index was continuous (see the proof of
Theorem 4.4). One need only observe that, since {'Y} is compact, fP is

84
bounded there; and use the factorization.
Complex Integration
m
( 1 )m - ( 1 )m = [ wz - wa ] L ( \m-k( l)k_1
w-z w-a k=1 w-z w-a
5.2 = (z - a ) [ I + 1 + . . .
(w-z)m(w-a) (w_z)m-l(w-a)2
+ (W-Z):w-a)m ]
The details are left to the reader.
Now fix a in G = C - {y} and let z E G, z =1= a. It follows from (5.2) that
Fm(z)-Fm(a) j q?(w)(w-a)-' j <p(w)(w-a)-m
5.3 = dw + . . . + dw
z-a y (w-z)m y w-z
Since a i {y}, <pC w)(",' - a) - k is continuous on {y} for each k. By the first
part of this proof (the part left to the reader), each integral on the right
hand side of (5.3) defines a continuous function of z, z in G. Hence letting
za, (5.3) gives that the limit exists and
1 <p(",') 1 <p(w)
F:n ( a ) = ( ) m +, dw + . . . + ( ) m + I dw
w-a w-a
y y
=mFm+,(a).1I
5.4 Cauchy's Integral Formula (First Version). Let G be an open subset of
the plane and f: GC an analytic function. If y is a closed rectifiable curve
in G such that n(y; ",')=Ofor all w in C- G, then for a in G- {y}
1 1 f( z)
n(y;a)f(a)= _ 2 ' dz.
11'1 Z - a
y
Proof. Define <p:GxGC by <p(z,w)=[f(z)-f(w)]/(z-w) if z*w and
cp(z,z)= f'(z). It follows that cp is continuous; and for each w in G,
zcp(z,w) is analytic (Exercise I). Let H={wEC:n(y;w)=O}. Since
n(y; w) is a continuous integer-valued function of w, H is open. Moreover
HuG = C by the hypothesis. .
Define g:CC by g(z)=jycp(z,"')dw if ZEG and g(z)=jy(w-
z)-1(w)dw if z E H. If z E GnH then
j cp(z, w) dw = j l(w) - I(z) dw
y y w-z
= j f ( w) dw _ f ( z )n ( y ; z )2 '1Ti
w-z
y
= j f(w) dW.
yW-Z
Hence g is a well-defined function.

Cauchy's Theorem
85
By Lemma 5.1 g is analytic on C; that is, g is an entire function. But
Theorem 4.4 implies that H contains a neighborhood of 00 in Coo' Since f
is bounded on {y} and lim (w - z) - I = 0 uniformly for w in {y},
Z ---+ 00
5.5 }n;, g(z)= } I <: dw=O.
Y
In particular (5.5) implies lhere is an R > 0 such that I g(z)1 < 1 for
I z I > R. Since g is bounded on B (O R) it follows that g is a bounded entire
function. Hence g is constant by Liouville's Theorem. But then (5.5) says
that g O. That is, if a E G - { y} then
0= I J(z) - J(a) dz
z-a
Y
= I J(z) dz- J(a) f dz .
z-a z-a
Y Y
This proves the theorem. II
Often there is a need for a more general version of Cauchy's Integral
Formula that involves more than one curve. For example in dealing with
an annulus one needs a formula involving two curves.
5.6 Cauchy's Integral Formula (Second Version). Let G be an open subset of
the plane and f: G  C an analytic function. If Yl' . . . , Y m are closed rectifiable
curves in G such that n ( Yl; w) + ... + n ( Y m; w) = 0 for all w in C - G,
then for a in G - U :=l{Yk}
m L m I I f(z)
f(a)  n(Yk;a)= _ 2 ' dz.
'lT1 Z - a
k=l k=l h
Proof. The proof follows the lines of Theorem 5.4. Define g(z, w) as it was
done there and let H= {w: n(YI; w)+ ... + n(Ym; w)=O}. Now g(z) is
defined as in the proof of (5.4) except that the sum of the integrals over
Y I" .. , Y m is used. The remaining details of the proof are left to the reader.
II
Though an easy corollary of the preceding theorem, the next result is
very important in the development of the theory of analytic functions.
5.7 Cauchy's Theorem (First Version). Let G be an open subset of the plane
and f: GC an analytic function. If YI'"'' Ym are closed rectifiable curves in
G such that n(YI;l-v)+'.' +n(Ym;w)=Ofor all win C- G then
m
 f J = O.
A = I Yt.
Proof. Substitute f(z)(z - a) for f in Theorem 5.6.11
Let G = {z : Rt < Izi < R 2 } and define curves YI and Y2 in G by YI(I) =
rle ll , Y2(t)=r 2 e- 1l for O < I < 2'lT, where RI<rt<r2<R2' If Iwl < Rt,

86 Complex Integration
n('Yl; w) = 1 = - n('Y2; w); if I wi > R 2 then n('YI; w) = n( Y2; w) = O. So n( YI; w)
+n(Y2;w)=O for all win C-G.
5.8 Theorem. Let G be an open subset of the plane and f: GC an analytic
function. If YI,...,Ym are closed rectifiable curves in G such that n(YI;w)
+... +n(Ym;w)=Ofor all w in C-- G then for a in G- {y} and k > I
m  1 f f(z)
J< k)( a)  n ( YJ; a) = k! L.J hi ( ) k+ I dz.
j=l j=l z-a
Y j
Proof. This follows immediately by differentiating both sides of the for-
mula in Theorem 5.6 and applying Lemma 5.1. II
5.9 Corollary. Let G be an open set and f: G -)- C an analytic function. If Y is
a closed rectifiable curve in G such that n(y; w)=o for all w in C- G then
for a in G - { Y }
k' f f(z)
J<k)(a)n(y;a)= 2;i ( )k+l dz.
z-a
Y
Cauchy's Theorem and Integral Formula is the basic result of
complex analysis. With a result that is so fundamental to an entire theory
it is usual in mathematics to seek the outer limits of the theorem's validity.
Are there other functions that satisfy Iyf = 0 for all closed curves y? The
answer is no as the following converse to Cauchy's Theorem shows.
A closed path T is said to be triangular if it is polygonal and has three
sides.
5.10 Morera's Theorem. Let G be a region (lnd let f: G C be a continuous
function such that I Tf = 0 for every triangular path T in G; then f is analytic
in G.
Proof. First observe that f will be shown to be analytic if it can be proved
that f is analytic on each open disk contained in G. Hence, without loss of
generality, we may assume G to be an open disk; suppose G= B(a; R).
Use the hypothesis to prove that f has a primitive. For z in G define
F(z) = I[a,z]f. Fix Zo in G; then for any point z in G the hypothesis gives
that F(z) = f[a,zo]f + I[zo,z]f. Hence
F(z) - F(zo) = 1 f f.
z - Z 0 Z - Z 0 [ Z 0, z]
This gives
F(z)-F(zo) - f(zo) = 1 f f-f(zo)
z-zo (z-zo)
[z 0, z]
= 1 f [f(w)-f(zo)] dw.
(z-zo)
[ Z 0, z]

Cauchy's Theorem
But by taking absolute values
87
F(z) - F(zo)
- /(zo) < sup{ 1/( w) - /(zo) I: w E [Z, ZO]}
Z - Zo
which shows that
I . F(z) - F(zo) - j( ) II
1m - zo.
zzo Z - Zo
Exercises
1. Suppose j: GC is analytic and define cp: G X GC by cp(z, w)=[j'(z)
- f(w)](z - w)-I if z =1= wand cp(z,z) = j'(z). Prove that cp is continuous and
for each fixed w, zcp(z, w) is analytic.
2. Give the details of the proof of Theorem 5.6.
3. Let B = B( + 1; ), G= B(O; 3)-(B+ U B_). Let "1),"12,"13 be curves
whose traces are Iz - 11 = 1, Iz + 11 = 1, and Izi = 2, respectively. Give "I., "12'
and 1'3 orientations such that n(y); w)+ n(Y2; w)+ n(Y3; w)=O for all w in
C-G.
4. Show that the Integral Formula follows from Cauchy's Theorem.
5. Let "I be a closed rectifiable curve in C and a fl { "I}. Show that for n > 2
fy(z-a)-ndz=O.
6. Letjbe analytic on D = B(O; 1) and suppose Ij(z)1 < I for Izi < 1. Sh<.'w
Ij'(O)1 < I.
7. Let y( t) = I + e it for 0 < t < 2'17. Find f "I L  I r dz for all positive in-
tegers n,
8. Let G be a region and suppose fn : GC is analytic for each n > I.
Suppose that {j,,} converges uniformly to a function j: GC Show that j
is analytic.
9. Show that if j: CC is a continuous function such that j is analytic off
[ - I, I] then f is an entire function.
10. Use Cauchy's Integral Formula to prove the Cayley-Hamilton Theo-
rem: If A is an n X n matrix over C and j(z) = det(z - A) is the characteris-
tic polynomial of A then j (A) = O. (This exercise was taken from a paper
by C. A. McCarthy, Amer. Math. Monthly, 82 (1975),390-391).
16 The homotopic version of Cauchy's Theorem and simple connectivity
This section presents a condition on a closed curve "I such that f J = 0
for an analytic function. This condition is less general but more geometric
than the winding number condition of Theorem 5.7. This condition is also
used to introduce the concept of a simply connected region; in a simply
connected region Cauchy's Theorem is valid for every analytic function
and every closed rectifiable curve. Let us illustrate this condition by

88 Complex Integration
considering a closed rectifiable curve in a disk, a region where Cauchy's
Theorem is always valid (Proposition 2.15).
Let G = B (a; R) and let y: [0, I] G be a closed rectifiable curve. If
O < t < 1 and O < s < l, and we put z=ta+(I-t)y(s); then z lies on the
straight line segment from a to y(s). Hence, z must lie in G. Let Y/(S) = ta
+(I-/)y(s) for O < s < 1 and O < t < 1. So, Yo=Y and YI is the curve
constantly equal to a; the curves YI are somewhere in between. We were
able to draw Y down to a because there were no holes. If a point inside Y
were missing from G (imagine a stick protruding up from the disk with its
base inside y), then as Y shrinks it would get caught on the hole and could
not go to the constant curve.
6.1 Definition. Let Yo, Y I : [0, I] G be two closed rectifiable curves in a
region G; then Yo is homolopic to YI in G if there is a continuous function
f: [0, I] X [0, I]G such that
{ f ( s, 0) = Y o( s ) an d f ( s, I) = Y I ( s) (0 < S < I)
6.2
f(O,/)=f(I,/) (0 < 1 < I)
So if we define Y / : [0, I] G by YI (s) = f( s, I) then each Y 1 is a closed
curve and they form a continuous family of curves which start at Yo and go
to Y I. Notice however that there is no requirement that each YI be
rectifiable. In practice when Yo and Y I are rectifiable (or smooth) each of
the Y 1 will also be rectifiable (or smooth).
If Yo is homotopic to YI in G write YO"-'YI' Actually a notation such as
YO"-'YI(G) should be used because of the role of G. If the range of f is not
required to be in G then, as we shall see shGrtly, all curves would be
homotopic. However, unless there is the possibility of confusion, we will
only write YO"-'YI.
It is easy to show that ",,-," is an equivalence relation. Clearly any
curve is homotopic to itself. If YO"-'YI and f: [0, l]x[O, I]G satisfies (6.2)
then define A(s,/)=f(s,I-/) to see that YI"-'YO. Finally, if YO"-'YI and
YI "-'Y2 with f satisfying (6.2) and A: [0, I] X [0, I] G satisfying A(s, 0) =
.\
Y2
r
Yo
o

Cauchy's Theorem 89
Yl(S), A(s, 1) = Y2(S), and A(O, t) = A(l, t) for all s and t; define <I>: [0,1]
X [0, 1] --+ G by
{ f(s, 2t)
<I>(s,t) =
A(s,2t-l)
if 0 < t < 
if  < t < 1
Then <I> is continuous and shows that YO-';Y2.
6.3 Definition. A set G is convex if given any two points a and b in G the
line segment joining a and b, [a, b], lies entirely in G. The set G is star
shaped if there is a point a in G such that for each z in G, the line segment
[a,z] lies entirely in G. Clearly each convex set is star shaped but the
converse is just as clearly false.
We will say that G is a- star shaped if [a,z]c G whenever z E G. If G is
a- star shaped and z and ware points in G then [z,a, w] is a polygon in G
connecting z and w. Hence, each star shaped set is connected.
6.4 Proposition. Let G be an open set which is a- star shaped. If Yo is the
curve which is constantly equal to a then every closed rectifiable curve in G is
homotopic to Yo.
Proof. Let YI be a closed rectifiable curve in G and put f(s, t) = tYI(S) +
(I - t)a. Because G is a- star shaped, f(s, t) E G for 0 < s, t < 1. It is easy to
see that f satisfies (6.2). _
The situation in which a curve is homotopic to a constant curve is one
that we will often encounter. Hence it is convenient to introduce some new
terminology.
6.5 Definition. If Y IS a closed rectifiable curve in G then I' is homotopic to
zero (y---O) if Y is homotopic to a constant curve.
6.6 Cauchy's 1beorem (Second Version). If f: G C is an analytic function
and Y is a closed rectifiable curve in G such that y-.;O, then
!/=o.
y
This version of Cauchy's Theorem would follow immediately from the
first version if it could be shown that n(y; w)=O for all w in C- G
whenever y---O. This can be done. A plausible argument proceeds as
follows.
Let 1'1 = y and let Yo be a constant curve such that 1'1 ---Yo. Let r satisfy
(6.2) and define h(t)=n(Yt;w), where Yt(s)=f(s,t) for O < s, t < I and w is
fixed in C - G. Now show that h is continuous on [0, 1]. Since h is integer
valued and h(O)=O it must be that h(t) - O. In particular, n(y; w)=O for all
w in C - G.
The only point of difficulty with this argument is that for 0 < t < 1 it
may be that Y t is not rectifiable.
As was stated after Definition 6.1, in practice each of the curves Y t will
not only be rectifiable but also smooth. So there is justification in making

90 Complex Integration
this assumption and providing the details to transform the preceding
paragraph into a legitimate proof (Exercise 9). Indeed, in a course de-
signed for physicists and engineers this is probably preferable. But this is
not desirable for the training of mathematicians.
The statement of a theorem is not as important as its proof. Proofs are
important in mathematics for several reasons, not the least of which is that
a proof deepens our insight into the meaning of the theorems and gives a
natural delineation of the extent of the theorem's validity. Most important
for the education of a mathematician, it is essential to examine other
proofs because they reveal methods.
A good method is worth a thousand theorems. Not only is this
statement valid as a value judgement, but also in a literal sense. An
important method can be reused in other situations to obtain further
results.
With this in mind a complete proof of Theorem 6.6 will be presented.
In fact, we will prove a somewhat more general fact since the proof of this
new result necessitates only a little more effort than the proof that
n(y; w)=O for w in C - G whenever y--O. In fact, the proof of the next
result more clearly reveals the usefulness of the method.
6.7 Cauchy's Theorem (Third Version). If Yo and YI are two closed rectifiable
curves in G and YO--YI then
f J= f J
Yo YI
for every function f analytic on G.
Before proceeding let us consider a special case. Suppose r satisfies (6.2)
and also suppose r has continuous second partial derivatives. Hence
8 2 f 0 2 f
os8t 8tos
throughout the square [2 = [0, 1] x [0, 1]. Define
1
f f
g(t) = j(f(s, t»  (s, t) ds;
os
o
then g(O) = fyo j and g(l) = fYl f By Leibniz's rule g has a continuous
derivative,
1
f[ of 8f 02 f ]
g'(t) = j'(f(s, t» - -- + j(f(s, t» -::- ds
8s ot otos
o
But
 [ C/o f) Of ] = (f' 0 r) or or + fo r o2r ;
os ot 8s 01 osol

Cauchy's Theorem
hence
91
of or
g'(t) = !(f( I, t)) -- (I, t) - !(f(O, t)) - (0, t).
at 8t
Since f( 1, t) = f(O, t) for all t we get g'(t) = 0 for all t. So g is a constant;
in particular I yo! = I YI f
Proof of Theorem 6.7. Let f: 12G satisfy (6.2). Since f is continuous
and 1 2 is compact, f is uniformly continuous and f( /2) is a compact
subset of G. Thus
r = d(f(j2), C-G) > 0
and there is an integer n such that if (s - S')2 + (t - 1')2 < 4/n 2 then
If(s, t)- f(s', 1')1 < r.
Let
Zjk = rG, ), 0 < j, k < 11
and put
]'k = [  , j + 1 ] x [  , k + 1 ]
J n n n n
for 0 < j, k < n - 1. Since the diameter of the square k is Ii , it follows
n
that f(.ljk) C B(Zjk; r). So if we let l}k be the closed polygon [Zjk' Zj+1, k'
Zj+1, k+l' Zj, k+1' Zjk]; then, because disks are convex, k C B(Zjk; r). But
from Proposition 2.15 it is known that
6.8
Jf=O
PJk
for any function! analytic in G.
It can now be shown that Iyo! = IYI! by going up the ladder we have
constructed, one rung at a time. That is, let Qk be the closed polygon [ZO,k'
Zt,k..., Znk]. We will show that Iyo!= IQof= fQJ!='" = fQn!= JYJ!
(one rung at a time !). To see that I Yo! = I Qo! observe that if <7 j (t) = yo(t) for
. . 1
.[ < I <J+
n n
then <7j + [Z j + t , 0' Z jO] (the + indicating that <7j is to be followed by the
polygon) is a closed rectifiable curve in the disk B( Z jO; r) c G. Hence
Jf= -
J f=
[Zj + I. 0, ZjO]
J f
[ZjO, Zj + 1. 0]
(1j
Adding both sides of this equation for 0 < j < n yields fyo! = f Qo !. Simi-
larly f y1 ! = f Qn !.

92 Complex Integration
To see that f Q f = f Q f use equation (6.8); this gives
k k+'
n-l
6.9 0 = .o f J
J - P jk
ZJ+l.k+l
ZJ. k+ 1
Zj+2.k+
i 
ZJk
However, notice that the integral fpjk f includes the integral over [Zj+l,k'
Zj+l,k+d, which is the negative of the integral over [Zj+l,k+l, Zj+l,k],
which is part of the integral JPj+ l.k f Also,
ZO,k = r(o,  ) = r(l,  ) = Zn,k
so that [ZO,k+l' ZO,k] = -[Zlk' Zltk+d. Hence, taking these cancellations
into consideration, equation (6.9) becomes
o=fJ- f J
Qk Qk+l
This completes the proof of the theorem. II
The second version of Cauchy's Theorem immediately follows by
letting y, be a constant path in (6.7).
6.10 Corollary. If y is a closed rectifiable curve in G such that yo then
n(y; w)=O for all w in C - G.
The converse of the above corollary is not valid. That is, there is a
closed rectifiable curve y in a region G such that n(y; w)=O for all w in
C - G but y is not homotopic to a constant curve (Exercise 8).
If G is an open set and Yo and YI are closed rectifiable curves in G then
n( Yo; a) = n( YI; a) for each a in C - G provided YOYl( G). Let yo(t) = e 2 'TTit
and y,(t) = e -2'TT1I for 0 < t <. 1. Then n( Yo; 0) = I and n( Yl; 0) = - 1 so that
Yo and y, are not homotopic in C - {O}.
6.11 Definition. If Yo, y, : [0, l] G are two rectifiable curves in G such that
Yo(O)=y,(O)=a and yo(I)=YI(I)=b then Yo and Yt are jixed-end-point

Cauchy's Theoren1 93
homotopic (FEP homotopic) if there is a continuous map r: [2G such
that
6.12
f(s, 0) = Y o(s)
f(O, t) = a
f(s, 1) = Yl(S)
f( 1, t) = b
for 0 < s, t < 1.
Again the relation of FEP homotopic is an equivalence relationship on
curves from one given point to another (Exercise 3).
Notice that if Yo and Yl are rectifiable curves from a to b then Yo - Yl
is a closed rectifiable curve. Suppose f satisfies (6_.12) and define Y: [0, 1]  G
by y(s) = Yo(3s) for 0 < s < t; y(s) = b for t < s < t; and y(s) = Yl
(3 - 3s) for t < s < 1. We will show that Y "" O. In fact, define A: [2  G by
f(3s(I-t), t) if 0 < s < t
A(s,t)= f(I-t,3s-1+2t-3st) if t < s < t
Yl«3-3s) (I-t)) if t < s < 1.
Although this formula may appear mysterious it can easily be understood
by seeing that for a given value of t, A is the restriction of f to the boundary
of the square [0, 1- t] x [t, 1] (see the figure). It is left to the reader to check
that A shows Y "" o.
o
.
,
1-1
Hence, for f analytic on G the second version of Cauchy's Theorem gives
O=fl=fl-f!
"I "10 "11
This is summarized in the following.
6.13 Independence of Path Theorem. If 'Yo and 'Yl are two rectifiable curves
in G vfrom a to b and 'Yo and 'Yl are FEP homotopic then
f f= f f
Yo y,
for any function f analytic in G.
Those regions G for which the integral of an analytic function around a
closed curve is always zero can be characterized.
6.14 Definition. An open set G is simply connected if G is connected and
every closed curve in G is homotopic to zero.

94 Complex Integration
6.15 Cauchy's Theorem (Fourth Version). If G is simply connected then
Iyf = 0 for every closed rectifiable curve and every analytic function f.
Let us now take a few moments to digest the concept of simple connected-
ness. Clearly every star shaped region is simply connected. Also, examine the
complement of the spiral r = B. That is, let G = C - {()e i8 : 0 < B < oo};
then G is simply connected. In fact, it is easily seen that G is open and
connected. If one argues in an intuitive way it is not difficult to become
convinced that every curve in G is homotopic to zero. A rigorous proof will
be postponed until we have proved the following: A region G is simply
connected iff Coo - G, its complement in the extended plane, is connected in Coo.
This will not be proved until Chapter VIII. If this criterion is applied to the
region G above then G is simply connected since Coo - G consists of the
spiral r = () and the point at infinity.
Notice that for G = C - {O}, C - G = {O} is connected but Coo - G =
{O, oo} is not. Also, the domain of the principal branch of the logarithm is
simply connected.
It was shown earlier in this chapter (Corollary 1.22) that if an analytic
function f has a primitive in a region G then the integral of f around every
closed rectifiable curve in G is zero. The next result should not be too sur-
prising in light of this.
6.16 Corollary. If G is simply connected and f: G C is analytic in G then f
has a primitive in G.
Proof. Fix a point a in G and let Y1' Y2 be any two rectifiable curves in
G from a to a point z in G. (Since G is open and connected there is
always a path from a to any other point of G.) Then, by Theorem 6.15,
o = lYI-Y2 f = ly1f - !Y2 f (where Y1 - Y2 is the curve which goes from a to z
along Y1 and then back to a along - Y2). Hence we can get a well defined
function F: G  C by setting F( z) = !yf where Y is any rectifiable curve
from a to z. We claim that F is a primitive of f.
If Z 0 E G and r > 0 is such that B(z 0; r) c G, then let y be a path from
a to zoo For z in B(zo; r) let y% = y+[zo, z]; that is, y% is the path y followed
by the straight line segment from Zo to z. Hence
F(z)-F(zo) = 1 f f
Z-Zo (z-zo) [zo,z]
Now proceed as in the proof of Morera's Theorem to show that
F'(zo) = f(zo)' -
Perhaps a somewhat less expected consequence of simple connectedness
is the fact that a branch of log f(z) where f is analytic and never vanishes,
can be defined on a simply connected region. Nevertheless this is a direct
consequence of the preceding corollary.
6.17 Corollary. Let G be simply connected and let f: G C be an analytic
function such that f(z)=I=O for any z in G. Then there is an analytic function

Cauchy's Theorem 95
g: G C such that f(z) = expg(z). If Zo E G and e W o = f(zo), we may choose g
such that g(zo) = woo
Proof. Since f never vanishes, L is analytic on G; so, by the preceding
I
corollary, it must have a primitive g l' If h(z) = exp g 1 (z) then h is analytic
and never vanishes. So, [ is analytic and its derivative is
h
h(z)/'(z) - h'(z)f(z)
h(Z)2
But h' = gh so that hi' - fh' = O. Hence flh is a constant c for all z in G.
That is f(z) = c exp g 1 (z) = exp [g 1 (z) + c'] for some c'. By letting g(z) =
gl(Z)+C' + 27rik for an appropriate k, g(zo) = Wo and the theorem is
proved. II
Let us emphasize that the hypothesis of simple connectedness is a topo-
logical one and this was used to obtain some basic results of analysis. Not
only are these last three theorems (6.15, 6.16, and 6.17) consequences of
simple connectivity, but they are equivalent to it. I t will be shown in
Chapter VIII that if a region G has the conclusion of each of these
theorems satisfied for every function analytic on G, then G must be simply
connected.
We close this section with a definition.
6.18 Definition. If G is an open set then y is homologous to zero, in symbols
)'O, if n(y; w)=O for all w in C- G.
Using this notation, Corollary 6.10 says that yO implies yO. This
result appears in Algebraic Topology when it is shown that the first
homology group of a space is isomorphic to the abelianization of the
fundamental group. In fact, those familiar with homology theory will
recognize in the proof of Theorem 6.7 the elements of simplicial approxi-
mation.
Exercises
I. Let G be a region and let 0'1' 0'2: [0, 1]  G be the constant curves
O't(t) = a, a 2 (t) = b. Show that if y is closed rectifiable curve in G and y "" 0'1
then y "" 0'2' (Hint: connect a and b by a curve.)
2. Show that if we remove the requirement "r(O, t) = r(l, t) for all t"
from Definition 6.1 then the curve yo(t) = e 21tit , 0 < t < 1, is homotopic to
the constant curve Yl (t) = 1 in the region G = C - {O}.
Uet  = all rectifiable curves in G joining a to b and show that Definition
6.11 gives an equivalence relation on .
4. Let G = C - {O} and show that every closed curve in G is homotopic
to a closed curve whose trace is contained in {z: Izl = I}.

96 Complex Integration
f  
5. Evaluate the integral 2 where y(O) = 2/cos 201 e ' for 0 < 0 < 21T.
z +1
"I
6. Let y(O) = Oe i8 for 0 < 0 < 21T and y(O) = 41T - 0 for 21T < 0 < 41T.
f dz
Evaluate 2 2 ·
Z +11'
"I '1
7. Let fez) = [(z--!-i).(z-l-ti).(z-l-).(z-  -i)]- and let y be the
polygon [0, 2, 2 + 2i, 2i, 0]. Find J}' f.
8. Let G = C - {a, b}, a =1= b, and let y be the curve in the figure below.

(a) Show that n(y; a) = n(y; b) = O.
(b) Convince yourself that y is not homotopic to zero. (Notice that the
word is "convince" and not "prove". Can you prove it?) Notice that this
example shows that it is possible to have a closed curve y in a region such
that n(y; z) = 0 for all z not in G without y being homotopic to zero. That
is, the converse to Corollary 6. 10 is false.
9. Let G be a region and let Yo and YI be two closed smooth curves in G.
Suppose YOYI and f satisfies (6.2). Also suppose that y 1 (s)=f(s,t) is
smooth for each t. If WE C- G define h(t)=n(Yl; w) and show that h:
[0, I] 7L is continuous.
10. Find all possible values of f dz where y is any closed rectifiable
y I + Z2
curve in C not passing through + i.
J ez-e- z
11. Evaluate dz where Y is one of the curves depicted below.
y Z4
(Justify your answer.)
(a)
(b)

Counting zeros; the Open Mapping Theorem
97
7. Counting zeros; the Open Mapping Theorem
In this section some applications of Cauchy's Integral Theorem are
given. It is shown how to count the number of zeros inside a curve; also,
using some information on the existence of roots of an analytic equation,
it will be proved that a non-constant analytic function on a region maps
open sets onto open sets.
In section 3 it was shown that if an analytic functionfhad a zero at z = a
we could write f(z) = (z - a)mg(z) where g is analytic and g(a) # O. Suppose
G is a region and letfbe analytic in G with zeros at a 1 , . . . , am. (Where some
of the a k may be repeated according to the multiplicity of the zero.) So we
can writef(z) = (z-a 1 ) (z-a 2 ) . . . (z-am)g(z) where g is analytic on G and
g(z) # 0 for any z in G. Applying the formula for differentiating a product
gIves
7.1
f'(z)
f(z)
1
1
+...+
1
g'(z)
+-
g(z)
Z- a l
+
Z- a 2
z-a m
for z # a l' . . . , am. Now that this is done, the proof of the following
theorem is straightforward.
7.2 Theorem. Let G be a region and let f be an analytic function on G with
zeros aI' . . . , am (repeated according to multiplicity). If y is a closed rectifiable
curve in G which does not pass through any point a k and if y  0 then
 f f'(Z) dz = f n(y; a k )
21Ti f(z) k = 1
"t
Proof If g(z) # 0 for any z in G then g'(z)/g(z) is analytic in G; since y  0,
Cauchy's Theorem gives f g'(Z) dz = o. So, using (7.1) and the definition of
g(z)
"t
the index, the proof of the theorem is finished. II
7.3 Corollary. Let J, G, and y be as in the preceding theorem except that
a},...,a m are the points in G that satisfy the equationJ(z)=a.; then
 f f'(z) dz = i n(y; ak)
21Ti f(z) - ex k= 1
y
A . 11 ' f (2z + 1)
s an 1 ustratlon, let us calculate 2 dz where y is the circle
z +z+ 1
y
Izl = 2. Since the denominator of the integrand factors into (z - wI) (z - W2 ),
where WI and W2 are the non-real cubic roots of 1, Theorem 7.2 gives
f 2z+ 1 d 4 .
z = 1TI.
Z2 + z + 1
"t

98
Complex Integration
As another illustration, let y: [0, I] G be a closed rectifiable curve in
C, yO. Suppose that J is analytic in G. Then Jo y = a is a closed rectifiable
curve in C (Exercise I). Suppose that a is some complex number with
a  { a} = J( {y}), and let us calculate n( a a). We get
1 f dw
n(a; ) = -. -
21Tl w-
a
-.
=  f !'(z) dz
21Ti !(z)-
'V
m
= L n(y; a k )
k=l
where a k are the points in G with J(a k ) = a. (To show the second equality
above takes a little effort, although for y smooth it is easy. The details are
left to the reader.)
Note. It may be that there are infinitely many points in G that satisfy the
equation J(z) = a. However, from what we have proved, this sequence
must converge to the boundary of G. It follows that n(y;z)O for at most
a finite number of solutions of J(z) = a. (See Exercise 2.)
N ow if f3 in C - { a} belongs to the same componen t of C - { a} as does
a, then n( a; a) = n( a; (3); or,
L n(y; Zk()) = L n(y; Zj«(3))
k j
where Zk (a) and z} (f3) are the points in G that satisfy J(z) = a and J(z) = f3
respectively. If we had chosen y so that n( y; Zk (a)) = 1 for each k, we
would have thatJ(G) contains the component of C- J({y}) that contains
a. We would also have some information about the number of solutions of
J(z) = f3. This procedure is used to prove the following result which, in
addition to being of interest in itself, will yield the Open Mapping
Theorem as a consequence.
7.4 Theorem. Supposefis analytic in B(a; R) and let ex = f(a). Iff(z)-ex has
a zero of order m at z = a then there is an E > 0 and S > 0 such that for
I -! < S, the equation f(z) =  has exactly m simple roots in B(a; E).
A simple root of f(z) =  is a zero of f(z) -  of multiplicity I. Notice that
this theorem says thatf(B(a; E)) :J B(ex; S). Also, the condition thatf(z)-
have a zero of finite multiplicity guarantees that f is not constant.

Counting zeros; the Open Mapping Theorem
99
Proof of Theorem. Since the zeros of an analytic function are isolated we
can choose E > 0 such that E < -tR, fez) = ex has no solutions with 0 <
Iz - al < 2E, and f'(z) =I- 0 if 0 < Iz - al < 2E. (If m > 2 then f'(a) = 0.)
Let yet) = a+E exp (27Tit), 0 < t < 1, and put a = fa y. Now ex f/= {a}; so
there is a 8 > 0 such that B(ex; 8) n {a} = D. Thus, B(ex; 8) is contained in
the same component of C - {a}; that is, lex - I < 8 implies n( a; ex) = n( a;
p
) = L n(y; Zk()). But since n(y; z) must be either zero or one, we have that
k = 1
there are exactly m solutions to the equation fez) =  inside B(a; E). Since
f'(z) =I- 0 for 0 < Iz - al < E, each of these roots (for  =I- ex) must be simple
(Exercise 3). II
7.5 Open Mapping Theorem. Let G be a region and suppose that f is a non
constant analytic function on G. Then for any open set U in G, f( U) is open.
Proof If U eGis open, then we will have shown that f( U) is open if we
can show that for each a in U there is a 8 > 0 such that B( ex; 8) c f( U),
where ex = f(a). But only part of the strength of the preceding theorem is
needed to find an E > 0 and a 8 > 0 such that B(a; E) c U andf(B(a; E)) ::)
B(ex; 8).11
If X and i2 are metric spaces and f: X  Q has the property that f( U)
is open in i2 whenever U is open in X, then f is called an open Inap. Iff is a
one-one and onto map then we can define the inverse map f- 1: Q -. X
by 1-1( w) = x where f(x) = w. It follows that f-1 is continuous exactly
whenfis open; in fact, for U c X, (f-1)-1(U) =f(U).
7.6 Corollary. Suppose f: G  C is one-one, analytic and f(G) = O. Then
f-!: QC is analytic and (f-1)'(w) = [f'(Z)]-l where w =f(z).
Proof By the Open Mapping Theorem, 1- 1 is continuous and 0 is open.
Since z = f-1(f(z)) for each z E Q, the result follows from Proposition III.
2.20. II
Exercises
1. Show that if f: GC is analytic and y is a rectifiable curve in G thenfoy
is also a rectifiable curve. (First assume G is a disk.)
2. Let G be open and suppose that y is a closed rectifiable curve in G such
that yO. Set r=d({y},JG) and H={z EC:n(y;z)=O}. (a) Show that
{z:d(z,JG)<tr}cH. (b) Use part (a) to show that iff:GCis analytic
then fez) = a has at most a finite number of solutions z such that
n(y;z):;60.
3. Letfbe analytic in B(a; R) and suppose thatf(a) = O. Show that a is a
zero of multiplicity m iffj(m-l)(a) = . . . = f(a) = 0 andf(m)(a) i= O.

100 Complex Integration
4. Suppose that I: G  C is analytic and one-one; show that I'(z) i= 0 for
any z in G.
5. Let X and fA be metric spaces and suppose that I: X  Q is one-one and
onto. Show that I is an open map iff I is a closed map. (A function I is a
closed map if it takes closed sets onto closed sets.)
6. Let P: C   be defined by P(z) = Re z; show that P is an open map
but is not a closed map. (Hint: Consider the set F = {z: 1m z = (Re Z)-1
and Re z  O}.)
7. Use Theorem 7.2 to give another proof of the Fundamental Theorem of
Algebra.
fiB. GOllrsat's Theorem
Most modern books define an analytic function as one which is differen-
tiable on an open set (not assuming the continuity of the derivative). In this
section it is shown that this definition is the same as ours.
Goursat's Theorem. Let G be an open set and let I: G  C be a differentiable
lunction; then I is analytic on G.
Proof. We need only show that f' is continuous on each open disk
contained in G; so, we may assume that G is itself an open disk. It will be
shown that f is analytic by an application of Morera's Theorem (5.10).
That is, we must show that Jrf=O for each triangular path Tin G.
Let T = [a, b, c, a] and let Ll be the closed set formed by T and its inside.
Notice that T = all. Now using the midpoints of the sides of Ll form four
triangles Llt, Ll 2 , Ll 3 , Ll4 inside Ll and, by giving the boundaries appropriate
b
a
directions, we have that each Tj = all j is a triangle path and
4
8.1 I I = .L I I
T J = 1 T}
Among these four paths there is one, call it T(1), such that IIT(1)/1 > IIT}II
for j = 1, 2, 3, 4. Note that the length of each Tj (perimeter of Ll j)-denoted
by t(Tj)-is !t(T). Also diam Tj = t diam T; finally, using (8.1)
II II < 41 I II.
r T( 1 )

Goursat's Theorem
101
Now perform the same process on T(l), getting a triangle T(2) with the
analogous properties. By induction we get a sequence {T(n)} of closed tri-
angular paths such that if  (n) is the inside of T(n) along with T(n) then;
8.2
(1) :::> (2) :::> . . . ;
8.3
I I II < 41 I II;
T(n) T(n+1)
8.4
t(T(n+ 1») = tt(T(n»);
8.5
diam (n+ 1) = t diam (n).
These equations imply:
8.6
II II < 4 n I I II;
T T(n)
8.7
t(T(n») = (t)nt where t = t(T);
8.8
diam (n) = (!-)nd where d = diam .
Since each  (n) is closed, (8.2) and (8.8) allow us to apply Cantor's
00
Theorem (II. 3.6), and get that n  (n) consists of a single point z o.
. n=l
Let € > 0; since f has a derivative at z 0 we can find a 0 > 0 such that
B(zo; 0) c G and
I(z)-/(zo ) _ f'(zo)
Z-Zo
< €
whenever 0 < Iz-zol < o. Alternately,
8.9
I/(z)-f(zo)-f'(zo) (z-zo)1 < € Iz-zol
whenever Iz-zol < o. Choose n such that diam (n) = (t)nd < o. Since
Zo E (n) this gives (h) c B(zo; 0). Now Cauchy's Theorem implies that
o = JT(n) dz = JT(n) Z dz. Hence
I I II = I I [J(z)-/(zo)-f'(zo) (Z-Zo)] dzl
T(n) T(n)
< E I Iz-zolldzl
T(n)
< E [diam Ll (n)] [it T(n»)]
= Edt(!)n

102
But using (8.6) this gives
If II < 4 n €dt(t)n = Edt.
T
Since E was arbitrary and d and t are fixed, IT f = o. _
Complex Integration

Chapter V
Singularities
In this chapter functions which are analytic in a punctured disk (an open
disk with the center removed) are examined. From information about the
behavior of the function near the center of the disk, a number of interesting
and useful results will be derived. In particular, we will use these results to
evaluate certain definite integrals over the real line which cannot be evaluated
by the methods of calcul us.
1. Classification of singularities
This section begins by studying the best behaved singularity-the
removable kind.
1.1 Definition. A function f has an isolated singularity at z = a if there is an
R >0 such that f is defined and analytic in B(a;R)-{a} but not in
B (a; R). The point a is called a removable singularity if there is an analytic
function g: B (a; R )C such that g(z) = f(z) for 0 < Iz - al < R.
. 1 1
SIn z d h . d . .
The functions - , - , an exp - all ave Isolate singularltIes at z = o.
z z z
sIn z .. ..
However, only - has a removable sIngularIty (see ExercIse 1). It IS left to
z
the reader to see that the other two functions do not have removable
singularities.
How can we determine when a singularity is removable? Since the function
has an analytic extension to B(a; R), J yl = 0 for any closed curve in the
punctured disk; but this may be difficult to apply. Also it must happen that
lim I(z) exists. This is easier to verify, but a much weaker criterion is
za
available.
1.2 Theorem. II I has an isolated singularity at a then the point z = a is a
removable singularity iff
lim (z-a)/(z) = 0
z--'a
Proof Suppose I is analytic in {z: 0 < Iz-al < R}, and define g(z) =
(z-a)/(z) for z =I- a and g(a) = o. Suppose lim (z-a)/(z) = 0; then g is
za
clearly a continuous function. If we can show that g is analytic then it follows
that a is a removable singularity. In fact, if g is analytic we have g(z) =
(z-a)h(z) for some analytic function defined on B(a; R) because g(a) = 0
(IV. 3.9). But then h(z) and f(z) must agree for 0 < Iz - al < R, so that a is,
by definition, a removable singularity.
103

104 Singularities
To show that g is analytic we apply Morera's Theorem. Let T be a
triangle in B(a; R) and let  be the inside of T together with T. If a rt  then
T "'-lOin {z: 0 < Iz - al < R} and so, I Tg = 0 by Cauchy's Theorem. If a
is a vertex of T then we have T = [a, b, e, a]. Let x E [a, b] and Y E [e, a] and
c
b
a
x
form the triangle T 1 = [a, x, y, a]. If P is the polygon [x, b, e, y, x] then
IT g = ITl g+ Ip g = ITl g since P "'-lOin the punctured disk. Since g is
continuous and g(a) = 0, for any E > 0 x and y can be chosen such that
Ig(z)1 < Eft for any z on T 1 , where t is the length of T. Hence lIT gl =
IITl gl < E; since E was arbitrary we have IT g = o.
If a E  and T = [x, y, z, x] then consider the triangles T 1 = [x, y, a, x],
T 2 = [y, z, a, y], T3 = [z, x, a, z]. From the preceding paragraph ITj g = 0
y
.\
for j = 1, 2, 3 and so, I Tg = I Tl g+ I T2g + I T3 g = O. Since this exhausts all
possibilities, g must be analytic by Morera's Theorem. Since the converse is
obvious, the proof of the theorem is complete. II
The preceding theorem points out another stark difference between
functions of a real variable and functions of a complex variable. The function
I(x) = lxi, x E , is not differentiable because it has a "corner" at x = o.
Such a situation does not occur in the complex case. For a function to have
an honest singularity (i.e., a non-removable one) the function must behave
badly in the vicinity of the point. That is, either If(z)/ becomes infinite as z
nears the point (and does so at least as quickly as (z - a) -1), or If(z) 1 doesn't
have any limit as z --+ a.

Classification of singularities 105
1.3 Definition. If z = a is an isolated singularity of f then a is a pole of f
if lim I/(z) 1 = 00. That is, for any M > 0 there is a number € > 0 such that
za
If(z)! > M whenever 0 < Iz - al < E. If an isolated singularity is neither a
pole nor a removable singularity it is called an essential singularity.
It is easy to see that (z-a)-m has a pole at z = a for m > 1. Also, it is
not difficult to see that although z = 0 is an isolated singularity of exp (z - 1),
it is neither a pole nor a removable singularity; hence it is an essential singu-
lari ty .
Suppose that.fhas a pole at z = a; it foHows that [fez)] -1 has a removable
singularity at z = a. Hence, h(z) = [f(Z)]-1 for z # a and h(a) = 0 is
analytic in B(a; R) for some R > O. However, since h(a) = 0 it follows by
Corollary IV. 3.9 that h(z) = (z - a)mhl (z) for some analytic function hi with
hi (a) # 0 and some integer m > 1. But this gives that (z-a)mf(z) = [h 1 (z)]-1
has a removable singularity at z = a. This is summarized as follows.
1.4 Proposition. If G is a region with a in G and if f is analytic on G - {a}
with a pole at z = a then there is a positive integer m and an analytic function
g: G -)0 C such that
1.5
j(z) = g(z) .
(z-a)m
1.6 Definition. If f has a pole at z = a and m is the smallest positive integer
such thatf(z) (z-a)m has a removable singularity at z = a thenfhas a pole
of order m at z = a.
Notice that if m is the order of the pole at z = a and g is chosen to
satisfy (1.5) then g(a) i= O. (Why?)
Letfhave a pole of order m at z = a and putf(z) = g(z) (z-a)-m. Since
g is analytic in a disk B(a; R) it has a power series expansion about a. Let
00
g(z) = A m +A m - 1 (z-a)+'" +A 1 (z-a)m-l+(z-a)m L ak(z-a)k.
k= 0
Hence
Am Al
f( z) = + . . . + + g 1 (z)
(z-a)m (z-a)
where g 1 is analytic in B(a; R) and Am # O.
1.7
1.8 Definition. If f has a pole of order m at z = a and f satisfies (1.7) then
Am(z - a) -m + . . . + Al (z - a) -1 is called the singular part of fat z = a.
As an example consider a rational function r(z) = p(z)jq(z), where
p(z) and q(z) are polynomials without common factors. That is, they have
no common zeros; and consequently the poles of r(z) are exactly the zeros of
q(z). The order of each pole of r(z) is the order of the zero of q(z). Suppose
q(a) = 0 and let S(z) be the singular part of r(z) at a. Then r(z) - S(z) =
r 1 (z) and r 1 (z) is a rational function whose poles are also poles of r(z). More-

106 Singularities
over, it is not difficult to see that the singular part of r 1 (z) at any of its poles
is also the singular part of r(z) at that pole. Using induction we arrive at the
f
following: if ab. · ., an are the poles of r(z) and Sj(z) is the singular part of
r( z) at z = a j then
1.9
n
r(z) = L Sj(Z) + P(z)
j=1
where P(z) is a rational function without poles. But, by the Fundamental
Theorem of Algebra, a rational function without poles is a polynomial! So
P(z) is a polynomial and (1.9) is nothing else but the expansion of a rational
function by partial fractions.
Is this expansion by partial fractions (1.9) peculiar only to rational
functions? Certainly it is if we require P(z) in (1.9) to be a polynomial. But
if we allow P(z) to be any analytic function in a region G, then (1.9) is valid
for any function r(z) analytic in G except for a finite number of poles.
Suppose we have a function f analytic in G except for infinitely many poles
(e.g.,[(z) = (cos Z)-1); can we get an analogue of (1.9) where we replace the
finite sum by an infinite sum? The answer to this is yes and is contained in
Mittag-Leffler's Theorem which will be proved in Chapter VIL.
There is an analogue of the singular part which is valid for essential
singularities. Actually we will do more than this as we will investigate
functions which are analytic in an annulus. But first, a few definitions.
1.10 Definition. If {zn: n = 0, + 1, + 2, . . .} is a doubly infinite sequence of
00 00 00
complex numbers, L Zn is absolutely convergent if both L Zn and L Z-n
n= - 00 n=O n=l
00 00 00
are absolutely convergent. In this case L Zn = L Z -n + L Zn. If Un is a
n= - 00 n=l n=O
00
fun.ction on a set S for n = 0, + 1, . . . and L un(s) is absolutely convergent
-00 00 00
for each s E S, then the convergence is uniform over S if both L Un and L
n=O n=l
U- n converge uniformly on S.
The reason we are limiting ourselves to absolute convergence is that this
is the type of convergence we will be most concerned with. One can define
00 m
convergence of L Zn, but the definition is not that the partial sums L Zn
-00 n=-m
1
converge. In fact, the series L - satisfies this criterion but it is clearly not a
n;eO n 00
series we wish to have convergent. On the other hand, if L Zn is absolutely
-00
m
convergent with sum z then it readily follows that Z = lim L Zn.
n= -m
If 0 < R 1 < R 2 < 00 and a is any complex number, define ann (a; R 1 ,
R 2 ) = {z: R 1 < Iz-al < R 2 }. Notice that ann (a; 0, R 2 ) is a punctured
disk.

Classification of singularities 107
1.11 Laurent Series Development. Let f' be analytic in the annulus ann (a; R l'
R 2 ). Then
00
fez) = L an(z - a)n
n=-oo
where the con'ergence is absolute and uniform orer ann (a; '1' '2)- if'R I <
'1 < '2 < R 2 . Also the coe.lficients an are given by the fo,mula
1.12
a = - J fez) dz
n 27Ti (z_a)n+l
y
whe,e Y is the circle Iz-al = r fo, any', R 1 < r < R 2 . Moreover, this series
is unique.
Proof If R 1 < '1 < '2 < R 2 and Yl, Y2 are the circles Iz-al = '1' Iz-al =
'2 respectively, then Yl t-...; Y2 in ann (a; R 1 , R 2 ). By Cauchy's Theorem we
have that for any function g analytic in ann (a; R l' R 2 ), J Y 1 g = J Y2 g. In
particular the integral appearing in (1.12) is independent of, so that for each
integer n, an is a constant. Moreover, f2: B(a; R 2 )  C given by the formula
1.13
f2(Z) =  J
27T1
Iw-al =1'2
few) dw
,
w-z
where Iz - al < '2' R 1 < '2 < R 2 , is a well defined function. Also, by
Lemma IV.5.1 /2 is analytic in B( a; '2)' Similarly, if G = {z: Iz - al > 'I}
then /1 : G  C defined by
1.14
fl(z) =
-  J f( w) dw
27Ti w-z'
Iw-al =1'1
where Iz-al > '1 and Rl < '1 < R 2 , is analytic in G.
If R 1 < Iz-al < R 2 let '1 and '2 be chosen so that R 1 < '1 < Iz-al <
'2 < R 2 0 Let Yl(l) = a+'leit and Y2(t) = a+'2 eit , 0 < t < 27T. Also choose
a straight line segment ,\ going from a point on Yl radially to Y2 which
misses z. Since Yl t-...; Y2 in ann (a; R 1 , R 2 ) we have that the closed curve
)'2

108
Singularities
Y = Y2 - A - Yl + A is homotopic to zero. Also n(Y2; z) = 1 and n(Yl' z)
= 0 gives, by Cauchy's Integral Formula, that
/(z) =  f l(W) dw
21T1 w-z
"I
=  f l(W) dw -  f l(W) dw
21Ti w-z 21Ti w-z
"12 )/1
= 12(Z) +/1 (z).
The plan now is to expand 11 and 12 in power series (11 having negative
powers of (z-a)); then adding them together will give the Laurent series
development of I(z). Since 12 is analytic in the disk B(a; R 2 ) it has a power
series expansion about a. Using Lemma IV. 5.1 to calculate fin)(a),
1.15
00
12(Z) = L an(z-a)n
n= 0
where the coefficients an are given by (1.12).
Now define g(z) for
o < Izi <  by g(z) = /l ( a + ! ) ;
R 1 Z
so Z = 0 is an isolated singularity . We claim that z = 0 is a removable
singularity. In fact, if r > R 1 then let p(z) = d(z, C) where C is the circle
{w: Iw-al = r}; also put M = max {If(w)l: WE C}. Then for Iz-al > r
Mr
If 1 (z)1 < p(z) '
But lim p(z) = 00; so that
z-,oo
lim g(z) = l imfl ( a + ! ) = o.
::;-+0 ::;-+0 Z
Hence, if we define g(O) = 0 then g is analytic in B(O; 1/ R 1). Let
1.16
00
g(z) = L Bn zn
n=1
be its power series expansion about O. It is easy to show that this gives
00
1.17 fl(Z) = L a_n(z-a)-n
n=l
where a_ n is defined by (1.12) (the details are to be furnished by the reader
00
in Exercise 3). Also, by the convergence properties of (1.15) and (1.17), L
-00
an(z - a)n converges absolutely and uniformly on properly smaller annuli.
The uniqueness of this expansion can be demonstrated by showing that
00
if f(z)=  an(z - a)n converges absolutely and uniformly on proper
n=-oo
annuli then the coefficients an must be given by the formula (1.12). .

Classification of singularities
109
We now use the Laurent Expansion to classify isolated singularities.
00
1.18 Corollary. Let z = a be an isolated singularity of f and let fez) = L
an(z - a)n be its Lflurent Expansion in ann (a; 0, R). Then: - 00
(a) z = a is a removable singularity iff an = 0 for n < -I;
(b) :3 = a is a pole of order m iff a_ m =1= 0 and an = o for n < -(m+ I);
( c) z = a is an essential singularity iff an =1= 0 for infinitely many negative
integers n.
Proof (a) If an = 0 for n < -I then let g(z) be defined in B(a; R) by
00
g(z) = Lan(z-a)n; thus, g must be analytic and agrees withfin the punc-
n=O
tured disk. The converse is equally as easy.
(b) Suppose an = 0 for n < -(m+ I); then (z-a)mf(z) has a Laurent
Expansion which has no negative powers of (z-a). By part (a), (z-a)mf(z)
has a removable singularity at z - a. Thus f has a pole of order m at z = a.
The converse follows by retracing the steps in the preceding argument.
(c) Since f has an essential singularity at z = a when it has neither a
removable singularity nor a pole, part (c) follows from parts (a) and (b).11
One can also classify isolated singularities by examining the equations
1.19 lim /z-al s If(z) I = 0
z-+a
1.20
lim /z-al s If(z)/ = 00
z-+a
where s is some real number. This is outlined in Exercises 7, 8, and 9; the
reader is strongly encouraged to work through these exercises.
The following gives the best information which can be proved at this time
concerning essential singularities. We know that f has an essential singularity
at z = a when lim If(z)j fails to exist ("existing" includes the possibility that
z -+-a
the limit is infinity). This means that as z approaches a the values of fez)
must wa-nder through C. The next theorem says that not only do they wander,
but, as z approaches a,f(z) comes arbitrarily close to every complex number.
Actually, there is a result due to Picard that says that fez) assumes each
complex value with at most one exception. However, this is not proved until
Chapter XII.
1.21 Casorati-Weierstrass Theorem. Iff' has an essential singularity at z = a
then for every 8 > 0, {f [ann (a; 0, 8)]} - = C.
Proof. Suppose that f is analytic in ann (a; 0, R); it must be shown that if
c and E > 0 are given then for each S > 0 we can find a z with Iz-a/ < 8
and /f(z) - cl < E. Assume this to be false; that is, assume there is a c in C
and E > 0 such that If(z) - cl > E for all z in G = ann (a; 0, S). Thus lim
za
/z-al-1/j(z)-c/=oo, which implies that (z-a)-l(j(z)-c) has a pole
at z=a. If m is the order of this pole then lim Iz-alm+1Ij(z)-cl=O.
za
Hence Iz - a/m+1Ij(z)/ < Iz - alm+1If(z) - cl + Iz - alm+1lcl gives that

110 Singularities
limlz-alm+llj(z)I=O since m > l. But, according to Theorem 1.2, this
z---+a
gives that j(z)(z - a)m has a removable singularity at z = a. This con-
tradicts the hypothesis and completes the proof of the theorem. II
Exercises
I. Each of the following functions I has an isolated singularity at z = o.
Determine its nature; if it is a removable singularity define 1(0) so that I is
analytic at z = 0; if it is a pole find the singular part; if it is an essential
singularity determine f( {z: 0 < Izl < S}) for arbitrarily small values of S.
.
SIn z
(a) fez) = - ;
z
(b) I(z) = cos z ;
z
(c) fez) = cos z-l ;
z
(d) I(z) = exp (Z-l);
(e) fez) = log (+ 1) ;
z
Z2+ 1
(g) fez) = z(z-l) ;
(i) f(z) = z sin! ;
z
(f) fez) = cos 1-1) ;
Z
(h) I(z) = (1 - e Z ) - 1 ;
(j) fez) = zn sin! .
z
2 G . h . I f . . f ( Z2 + 1
· lve t e partla ractIon expansIon 0 r z) = 2 2 .
(z +z+ 1) (z-I)
3. Give the details of the derivation of (1.17) from (1.16).
I
4. Letf(z) = z(z-l) (z-2) ; give the Laurent Expansion of fez) in each of
the following annuli: (a) ann (0; 0, 1); (b) ann (0; 1,2); (c) ann (0; 2, (0).
5. Show that fez) = tan z is analytic in C except for simple poles at
7T
Z = :2 + n7T, for each integer n. Determine the singular part of I at each of
these poles.
6. If I: G  C is analytic except for poles show that the poles of I cannot
have a limit point in G.
7. Let I have an isolated singularity at z = a and suppose I o. Show that
if either (1.19) or (1.20) holds for some s in  then there is an integer m such
that (1.19) holds if s > m and (1.20) holds if s < m.
8. Let.!: Q, and m be as in Exercise 7. Show: (a) m = 0 iff z = a is a remov-
able singularity and I(a) =1= 0 ; (b) m < 0 iff z = a is a removable singularity
and/has a zero at z = a of order -m; (c) m > 0 iff z = a is a pole of I of
order m.
9. A function f has an essential singularity at z = a iff neither (1.19) nor
(1.20) holds for any real number s.

Classification of singularities
111
10. Suppose that f has an essential singularity at z = a. Prove the following
strengthened version of the Casorati-Weierstrass Theorem. If e E C and
€ > 0 are given then for each 8 > 0 there is a number a, Ie-a/ < €, such
that f(z) = a has infinitely many solutions in B(a; 8).
11. Give the Laurent series development of j(z) = exp (D. Can you
generalize this result?
12. (a) Let ,\ E C and show that
exp {!A (z + D} = ao +  an (zn + ;n )
for 0 < Izi < 00, where for n > 0
1t
an =  f e" cos t cos nt dt
o
(b) Similarly, show
eXP{!A(Z - D} = b o + bn(zn + (:)n )
for 0 < Izl < 00, where
1t
 b n =  f cos (nt-A sin t) dt.
o
13. Let R > 0 and G = {z: Izi > R}; a functionf: G  C has a removable
singularity, a pole, or an essential singularity at infinity if f(Z-l) has, respec-
tively, a removable singularity, a pole, or an essential singularity at z = o.
If f has a pole at 00 then the order of the pole is the order of the pole of
f(Z-l) at z = o.
(a) Prove that an entire function has a removable singularity at infinity
iff it is a constant.
(b) Prove that an entire function has a pole at infinity of order m iff it is a
polynomial of degree m.
(c) Characterize those rational functions which have a removable singularity
at infinity.
(d) Characterize those rational functions which have a pole of order m at
infinity.
14. Let G = {z: 0 < Izi < I} and let ./': G  C be analytic. Suppose that
y is a closed rectifiable curve in G such that n(y; a) = 0 for all a in C - G.
What is J yf? Why?
15. Let f be analytic in G = {z: 0 < Iz - aj < r} except that there is a
sequence of poles {an} in G with an  a. Show that for any w in C there is
a sequence {zn} in G with a = lim Zn and w = lim j(zn).

112 Singularities
16. Determine the regions In which the functions f (z) = (sin 1 ) - I and
z
g(z) = £ I (t - z)  I dt are analytic. Do they have any isolated singularities?
Do they have any singularities that are not isolated?
17. Letfbe analytic in the region G=ann(a;O,R). Show that if f £If(x+
iy )1 2 dx dy < 00 then f has a removable singularity at z = a. Suppose that
p>O and f£lf(x+ iy)IPdxdy < 00; what can be said about the nature of
the singularity at z = a?
 2. Residues
The inspiration behind this section is the desire for an answer to the
following question: If f has an isolated singularity at z = a what are the
possible values for f yf when y is a closed curve homologous to zero and
not passing through a? If the singularity is removable then clearly the
integral will be zero. If z = a is a pole or an essential singularity the answer
is not always zero but can be found with little difficulty. In fact, for some
curves y, the answer is given by equation (1.12) with n = - 1.
2.1 Definition. Let j' have an isolated singularity at z = a and let
00
I(z) = I an(z-a)n
n=-oo
be its Laurent Expansion about z = a. Then the residue of 1 at z = a is the
coefficient a_I. Denote this by Res (I; a) = a_I. The following is a generaliza-
tion of formula (1.12) for n = -1.
2.2 Residue Theorem. Let f be analytic in the region G except for the isolated
singularities aI' a 2' . . . , am. If y is a closed rectifiable curve in G which does
not pass through any of the points a k and if y  0 in G then
1 m
_ 2 . jf = L n( y; a k ) Res (j; a k ).
7Tl y k=l
Proof. Let mk=n(y;a k ) for I < k < m, and choose posItIve numbers
r I' . . . , r m such that no two disks B (a k ; r k) intersect, none of them intersects
{y}, and each disk is contained in G. (This can be done by induction and
by using the fact that y does not pass through any of the singularities.) Let
y/.. (t) = a k + r k exp( - 27Tim k t) for 0 < t < 1. Then for I < j < m
m
n ( y ; G J ) + L n ( y k ; a}) = O.
k=l
Since yO(G) and B(ak;rk)cG,
m
n(y;a)+ L n(Yk;a)=O
k=1

Residues 113
for all a not in G - {a I'''' ,am}' Since f is analytic In G - {a I'''' ,am}
Theorem IV.5.7 gives
2.3
m
0= f f+ 2. f f
y k = I y"
00
If fez) = L bn(z - ak)n is the Laurent expansion about z = a k then this
-00
00
series converges uniformly on JB(a k ; rd. Hence f f = L bnf (z - ak)n.
yk -00 yk
But f (z-akr=O if n=l= -I since (z-akr has a primitive. Also f (z-
 
ak) - I = 2'lTin (Yk; a k )Res(f; a k ). Hence (2.3) implies the desired result. II
Remark. The condition in the Residue Theorem that f have only a finite
number of isolated singularities was made to simplify the statement of the
theorem and not because the theorem is invalid when f has infinitely many
isolated singularities. In fact, if f has infinitely many singularities they can
only accumulate on aGo (Why?) If r = d( {y}, aG) then the fact that yO
gives that n(y;a)=O whenever d(a; aG)< kr. (See Exercise IV.7.2.)
The Residue Theorem is a two edged sword; if you can calculate the
residues of a function you can calculate certain line integrals and vice versa.
Most often, however, it is used as a means to calculate line integrals. To use
it in this way we will need a method of computing the residue of a function at
a pole.
Suppose 1 has a pole of order m > 1 at z = a. Then g(z) = (z-a)ml(z)
has a removable singularity at z = a and g(a) =1= O. Let g(z) = b o +b1(z-a) +
· · . be the power series expansion of g about z = a. It follows that for z near
but not equal to a,
b o b m - 1  'k
I(z) = +. . . + + '-.J bm+k(z-a) ·
(z-a)m (z-a) k=O
This equation gives the Laurent Expansion of 1 in a punctured disk about
z = a. But then Res (I; a) = b m - 1 ; in particular, if z = a is a simple pole
Res (I; a) = g(a) = lim (z-a)/(z). This is summarized as follows.
za
2.4 Proposition. Suppose 1 has a pole of order m at z = a and put g(z) =
(z-a)m/{z); then
1
Res (f; a) = g(m-l)(a).
(m -I)!
The remainder of this section will be devoted to calculating certain integrals
by means of the Residue Theorem
2.5 Example. Show
00
f X2 7T
I +x 4 dx = .J2
-00

1 t 4 2 Singulari ties
z
If I(z) = 4 then 1 has as its poles the fourth roots of - 1. These are
l+z
exactly the numbers e iO where
 3 5 7
e = - - - and-
4' 4' 4' 4.
Let
an = exp({ +(n-l)J)
for n = 1, 2, 3, 4; then it is easily seen that each an is a simple pole of f
Consequently,
Res (I; a 1 ) = lim (z-a 1 )/(z) = aT(a 1 -a2)-1(a 1 -a 3 )-1(a 1 -a4)-1
z-+a1
1 - i ( 7Ti )
= 42 = t exp - 4 ·
Similarly
-1-i ( -31Ti )
Res (f; a2) = 42 = t exp 4 ·
Now let R > 1 and let y be the closed path which is the boundary of
the upper half of the disk of radius R with center zero, traversed in the
counter-clockwise direction. The Residue Theorem gives
-R - I
o
I R
2i f f = Res (f; a 1) + Res (f; a2)
"t
-i
2/2
But, applying the definition of line integral,
R 1t
1 f 1 f X2 1 f R3e3it
- - - dx - dt
2i 1 - 2i 1 +x 4 + 2 1 +R 4 e 4it .
y -R 0
This gives
2.6
R 1t
f 2 f e 3it
x 7T. 3
1 + x 4 dx = 2 - IR 1 +R 4 e 4it dt.
-R 0

Residues 115
For 0 < t < 'IT, 1 + R 4e 4lt lies on the circle centered at 1 of radius R 4; hence
11 + R 4e 4lt I  R 4 - 1. Therefore
iR 3 (''' e 311 dt < 7TR 3 ;
J 0 1 + R 4e 4lt R 4 - 1
x 2
and since 4 > 0 for all x in IR, it follows from (2.6) that
l+x
00 R
J X2 f X2
1 4 dx = lim 1 4- dx
+x R-+oo +x
- 00 -R
7T
= J2
2.7 Example. Show
00
f sinx dx = 
x 2.
o
e iz
The function f(z) = - has a simple pole at z = O. If 0 < r < R let Y be the
z
closed curve that is depicted in the adjoining figure. It follows from Cauchy's
-R
-r
r
R
Theorem that 0 = J y f Breaking y into its pieces,
2.8
R -r
J e iX J eiZ J eix J e iZ
0= -;dx+ -;dz+ -;dx+ -;dz
r . y R - R y,
where YR and Yr are the semicircles from R to - Rand - r to r respectively.
But
R R
J Sin x 1 J e iX -e- ix
-dx=- dx
x 2i x
r r
R -r
1 f e iX 1 f eix
=- -dx+- -dx
2i x 2i x
r -R

116
Also
Singulari ties
1t
f ez dz = i f exp (i R e i8 ) dO
YR 0
1t
< I lexp (i R ei1 dO
o
1t
= I exp (-R sin 0) dO
o
By the methods of calculus we see that, for 8 > 0 sufficiently small, the
largest possible value of exp (- R sin 8), with 8 < e < 71' - 8, is exp (- R
sin 8). (Note that 8 does not depend on R if R is larger than 1.) This gives that
1t - B
f ez dz < 28 + f exp ( - R sin 0) dO
YR B
< 28+17 exp (-R sin 8).
If E > 0 is given then, choosing 8 < t E, there is an Ro such that exp ( - R
E
sin 8) < - for all R > Ro. Hence
371'
f e iZ
Iim - dz = O.
R-+oo Z
YR
e iz - 1
Since has a removable singularity at z = 0, there is a constant
Z
e iz - 1
M > 0 such that < M for Izl < 1. Hence,
z
that is,
f e iZ - 1
z dz < 17rM;
Yr
f eiz - 1
o = Iim dz.
r-+ 0 Z
i'r
But f  dz = -1T; for each r so that
"Ir
f e i %
-71'i = lim - dz
r-+ 0 Z
i'r
So, if we let r -+ 0 and R -+ 00 in (2.8)
00
f sin x dx = 
x 2
o

Residues 117
Notice that this example did not use the Residue Theorem. In fact, it could
have been presented after Cauchy's Theorem. It was saved until now because
the methods used to evaluate this integral are the same as the methods used
in applying the Residue Theorem.
2.9 Example. Show that for a > I,
1t
f d() 'IT
a + cos () = .J a 2 - 1 ·
o
'0 I
If z = e l then z = - and so
z
( I ) z2+2az+ I
a+cos () = a+t(z+z) = a+-! z + - = .
z 2z
Hence
1t 21t
f d() f d()
a+cos () =! a+cos ()
o 0
= -; f Z2+:Z+1
"I
where y is the circle Izj = I. But Z2 + 2a z + I = (z - ex) (z - f3) where ex =
-a+ (a 2 -l)-!-, f3 = -a-(a 2 -l)t. Since a > I it follows that lexl < I and
1f31 > I. By the Residue Theorem
f dz 'lTi
Z2 + 2a z + 1 = .J a 2 - 1 ;
"I
by combining this with the above equation we arrive at
1t
f d() 'IT
a + cos () - .J a 2 - 1 ·
o
2.10 Example. Show that
00
f log x d = 0
1 2 X ·
+x
o
To solve this probJem we do not use the principal branch of the logarithm.
Instead define log z for z belonging to the region
{ 'IT 3 'IT }
G = Z E C: z =1= 0 and -"2 < arg z < 2 ;

118 Singularities
if z = Izi ei9 =I- 0 with - < 8 < 31T , let t(z) = log Izi +i8. Let 0 < r < R
2 2
and let y be the same curve as in Example 2.7. Notice that t(x) = log x for
x > 0, and t(x) = log Ixl +1Ti for x < o. Hence,
R 11:
I t(z) d - I log x d . I [log R+iO] iO AIJ
Z - 2 X + lR 2 2 '0 e uu
1 + Z2 1 + x 1 + ReI
'Y r 0
2.11
-r 0
I log Ixl + 1Ti d . I [log r + iO] iO 
+ 2 X+lr 2 2'0 e u(J
l+x l+re l
-R 11:
Now the only pole of t(z) (1 +Z2)-1 inside y is at z = i; furthermore, this
is a simple pole. By Proposition 2.4 the residue of t(z) (I + Z2) -1 is i
1T
[log Iii +t1Ti] = "4. So,
I t(z) dz = 1T 2 i
1 + Z2 2
'Y
Also,
R -r R R
I log x d I log Ixl +1Ti d I log x d . I dx
x + x = 2 x + 1Tl
1 + x 2 1 + x 2 1 + x 2 1 + x 2
r -R r r
Letting r  0 + and R  00, and using the fact that
00
I dx 1T
1 + x 2 = "2
o
(Exercise 2(f)), it follows from (2.11) that
00 11:
f log x .. I [l o g r + iO] i 0
2 dx =! 11m Ir 2 2iO e dO
1 +x r-'O+ 1 +r e
o 0
11:
. . I [log R + iO] iO
- t 11m zR 1 R 2 2iB e dO.
R-.oo + e
o
We now show that both of these limits are zero. If p > 0 then
11: 11:
< p Ilog pi I dO + p I OdO
- II-p 2 1 11-p 2 1
o 0
1Tp Ilog pi P1T 2 .
= Il-p 2 1 + 211-p21 '
letting p  0 + or p  00, the limit of this expression is zero.
11:
I [IOg p+iO] iBdO
p 1+p 2 e io e
o

Residues
119
if)
2.12 Example. Show that f x- C dx = . 7T if 0 < c < I.
I + x SIn 7TC
o
To evaluate this integral we must consider a branch of the function z - C.
The point z = 0 is called a branch point of z - c, and the process used to
R
evaluate this integral is sometimes called integration around a branch point.
Let G = {z: z # 0 and 0 < arg z < 27T}; define a branch of the logarithm
on G by putting t(re i8 ) = log r + if) where 0 < f) < 27T. For z in G put
fez) = exp [ - ct(z)]; so f is a branch of z- c. We now select an appropriate
curve Y in G. Let 0 < r < I < R and let S > O. Let L 1 be the line segment
[r + Sf,. R + Si]; YR the part of the circle Izi = R from R + Sf counterclockwise
to R - Sf; L 2 the line segment [R - Sf, r - Sf]; and Yr the part of the circle
Izl = r from r - Sf clockwise to r + Si. Put Y = Ll + YR + L 2 + Yr.
Since Y 1"-1 0 in G and Res (f(z) (I + z) -1; -I) = f( -I) = e- inc, the
Residue Theorem gives
2.13
f f(Z) d 2 . -i1tc
I + z z = 7Tle ·
y
Using the definition of a line integral
j f(Z) _ j Rf(t+i8)
I dz - I '8 dl.
+z +1+1
LI r
Let g( 1,8) be defined on the compact set [f, R] X [0,  1T] by
f( t + i8 ) t - C
g (t, 8 ) = 1 + t + i8 - 1 + t
when 8 > 0 and g( t, 0) o. Then g is continuous and hence uniformly
con tinuous. If £ > 0 then there is a 8 0 such that if (I - t')2 + (8 - 8 ')2 < 8J
then I g( 1,8) - get', 8 ')1 < £/ R. In particular, g(l, 8) < £/ R when f < I < R

120
and 8 < 8 0 , Thus
Singularities
f.R g(tJJ)dt «
r
for 8 < 8 0 , This implies that
f. R t-C ' f fez)
-dt= hm dz.
r 1 + t 8 O + L I 1 + z
Similarly, using the fact that I (i) = I (z) + 21Ti
f R t-C . f fez)
- e -2'lT1c - dt = 11m dz.
I+t 8O+ I+z
r L 2
Now the value of the integral in (2.13) does not depend on 8. There-
fore, letting 8O + and using (2.14) and (2.15) gives
2.14
2.15
2.16
21Tie- i1TC - (1- e- 2 'lT1C) f R  dt= lim [ f j(z) + f fez) ] .
I+t 8O+ I+z I+z
r Yr YR
N ow if p > 0 and p"* 1 and if y p is the part of the circle Izi = p from
Vp 2 - 8 2 + i8 to Vp 2 - 8 2 - i8 then
f fez) p-C
1 +z dz < II-p/ 27r P .
Y p
Since this estimate is independent of 8, (2.16) implies
f R -c -c R -c
. - mc - 21Tic t < r
2me -(1- e ) r 1 +t dt - II_rI 2'1Tr+ 11- RI 2 '1TR.
But as rO+ and Roo the right-hand side of this last inequality
converges to zero. Hence
00
. . f t-C
27Ti e- mc = ( l_e- 2mc ) - dt"
l+t '
o
or,
00
f t-C 27Ti e- i1tc
-dt= .
l+t l_e- 21t f,C
o
21Ti
- e 1tic _ e- 1tic
'TT
sin 'TTC

Residues
Exercises
121
1. Calculate the following integrals:
00
f x2dx
(a) x 4 +x 2 +1
o
00
(b) f cos ;2- 1 dx
o
n
f cos 20df)
(c) 1 2 0 2 where a 2 < 1
- a cos + a
o
n
f dO
(d) ( 0) 2 where a > 1.
a + cos
o
2. Verify the following equations:
00
f dx 'TT
(a) (X 2 +0 2 )2 = 40 3 ' 0 > 0;
o
00
(b) f (1og X)3 dx = 0
l+x2
o
00
( ) f cos ax d = 'TT( a + I) e - a if a > 0 , .
c (l+x2)2 X 4
o
nl2
( d) f dO 7T if 0 > 0;
a+ sin 2 0 = 2[a(a+ 1)]1- '
o
00
f log x
(e) (1 +X2)2 dx =
o
4 '
00
(f) f 1 XX2 =  ;
o
'TT
00
f eax
(g) dx =
1 +e x
w
SIn aw
if 0 < a < I;
-00
2n n
(h) flog sin 2 20dO = 4 f log sin OdO = - 4TT log 2.
o 0
3. Find all possible values of f y expz - I dz where y is any closed curve not
passing through z = o.
4. Suppose thatfhas a simple pole at z = a and let g be analytic in an open
set containing a. Show that Res (fg; a) = g(a) Res (f; a).
5. Use Exercise 4 to show that if G is a region and f is analytic in G except
for simple poles at aI' . . . , an; and if g is analytic in G then
1 f n
_ 2 . Ig = L n(y; ak) g(a k ) Res (I; ak)
'TTl k = 1
'1

122 Singularities
for any closed rectifiable curve y not passing through at, . . . , an such that
y  0 in G.
6. Let y be the rectangular path [n + 1- + ni, - n - 1- + ni, - n - 1- - ni, n + t - ni,
n+t+ni] and evaluate the integral Sy7T(z+a)-2 cot 7Tzdz for a # an integer.
Show that lim S y 7T(Z + a) - 2 cot 7Tzdz = 0 and, by using the first part, deduce
that n-+oo
7T 2 00 I
sin 2 1Ta = nhoo (a+n)2
(Hint: Use the fact that for z=x+iy, Icoszl 2 =cOS 2 x+sinh 2 y and
Isinzl 2 = sin 2 x + sinh 2 y to show that Icot '7TZ I < 2 for z on y if n is
sufficien tly large.)
7. Use Exercise 6 to deduce that
7T 2 00 1
8 - 6 (2n + 1 )2
8. Let y be the polygonal path defined in Exercise 6 and evaluate S y 7T(Z2 - a 2 )-1
cot 7Tzdz for a # an integer, Show that lim S y 7T(Z2 - a 2 ) -1 cot 7Tzdz = 0, and
consequently n-+oo
1 00 2a
1T cot 7Ta = - +  2 2
a L a -n
n=1
for a # an integer"
9. Use methods similar to those of Exercises 6 and 8 to show that
00
7T 1  2(-I)na
sin 1Ta = a + 6 a 2 -n 2
for a # an integer.
10. Let y be the circle Izl = I and let m and n be non-negative integers.
Show that
 f (Z2 :t l)mdz =
27Ti zm+n+l
y
( :t I)P(n + 2p)!
p! (n+p)! ' if m = 2p+n,
p > 0
o otherwise
11. In Exercise 1.12, consider an and b n as functions of the parameter A and
use Exercise 10 to compute power series expansions for an(A) and bn(A).
(bn(A) is called a Bessel function.)
12. Let 1 be analytic in the plane except for isolated singularities at aI' a2,
. . . , am' Show that
Res (I; 00) =
m
L Res (I; ak)'
k=l

The Argument Principle
123
(Res(f; 00) is defined as the residue of - z -1(z - I) at z = O. Equivalently,
Res(f 00) = - _ 2 1 ,If when y(t) = ReI!, 0 < t < 2w, for sufficiently large R.)
WI
What can you say if f has infinitely many isolated singularities?
13. Letfbe an entire function and let a, bEe such that lal < Rand Ibl < R.
Ify(l) = Re it , 0 < t < 21T, evaluate Sy [(z-a) {z-b)]-(z)dz. Use this result
to give another proof of I..iouville's Theorem.
3 The Argument Principle
3.1
Suppose that f is analytic and has a zero of order m at z = a. So fez) =
(z - a)mg(z) where g(a) i= O. Hence
f'(z) m g'(z)
-=-+--
fez) z-a g(z)
and g' /g is analytic near z = a since g(a) i= O. Now suppose that f has a
pole of order m at z = a; that is, fez) = (z-a)-mg(z) where g is analytic
and g(a) i= O. This gives
3.2
f'(z) -m g'(z)
-=-+-
fez) z-a g(z)
and again g' /g is analytic near z = a.
Also, to avoid the phrase "analytic except for poles" which may have
already been used too frequently, we make the following standard definition.
3.3 Definition. If G is open andfis a function defined and analytic in G except
for poles, then f is a meromorphic function on G.
Suppose that f is a meromorphic function on G and define f: G  Coo
by setting fez) = 00 whenever z is a pole of f It easily follows that f is
continuous from G into Coo (Exercise 4). This fact allows us to think of
meromorphic functions as analytic functions with singularities for which
we can remove the discontinuity of f, although we cannot remove the non-
differentiability off
3.4 Argument Principle. Let f be meromorphic in G with poles PI' P2, · . . , Pm
and zeros z l' Z 2' . . . , Zn counted according to multiplicity. If y is a closed
rectifiable curve in G with y  0 and not passing through PI' · · · , Pm ;
Z b . . . , Zn; then
3.5
I f f'(Z) n m
_ 2 ' "' ( ) dz = L n(y;zk) - L n(y;pj).
1Tl J ' Z k = 1 j = 1
y
Proof By a repeated application of (3.1) and (3.2)
1 '( z )
I(z)
n 1
- L
k=l Z - zk
m 1
- L
j= 1 Z - Pj
+ g/( Z )
g(z)

124 Singularities
where g is analytic and never vanishes in G. Since this gives that g'lg is
analytic, Cauchy's Theorem gives the result. II
Why is (this called the "Argument Principle"? The answer to this is no t
completely obvious, but it is suggested by the fact that if we could define
log I(z) then it would be a primitive for I'lf. Thus Theorem 3.4 would give
that as z goes around y, log/(z) would change by 27TiK where K is the integer
on the right hand side of (3.5). Since 27TiK is purely imaginary this would
give that 1m log I(z) = arg I(z) changes by 27TK.
Of course we can't define log I(z) (indeed, if we could then J y I'll = 0
since I'll has a primitive). However, we can put the discussion in the above
paragraph on a solid logical basis. Since no zero or pole of I lies on y there
is a disk B(a; r), for each a in {y}, such that a branch of log/(z) can be defined
on B(a; r) (simply select r sufficiently small that I(z) =1= 0 or 00 in B(a; r)).
The balls form an open cover of {y}; and so, by Lebesgue's Covering Lemma,
there is a positive number e > 0 such that for each a in {y} we can define a
branch of log I(z) on B(a; e). Using the uniform continuity of y (suppose
that y is defined on [0, I]), there is a partition 0 = to < t 1 <... < t k = 1
such that y(t)EB(y(tj_t); e) for t j - 1 < t < t j and I < j < k. Let t j be a
branch of log I defined on B(y(t j-1); e) for I < j < k. Also, since the j-th
and (j + I )-st sphere both contain y( t j) we can choose tt, . . . , t k so that
t 1 (y( t 1)) = t 2 (y( t t)); t 2 (y( t 2)) = t 3 (y t 2)); . · · ; t k - 1 (y( t k - 1)) = t k ( y( t k - 1)).
If y j is the path y restricted to [t j - 1, t J then, since tj = l'lf,
I I'
f = t'Jy(t j ))- t'Jy(tj-t))
Yj
for 1 < j < k. Summing both sides of this equation the right hand side
"telescopes" and we arrive at
I I'
I = tk(a) - t 1 (a)
y
where a = y(O) = yet). That is, tk(a) - t 1 (a) = 27TiK. Because 27TiK is purely
imaginary we get 1m tk(a)-Im t 1 (a) = 27TK. This makes precise our con-
tention that as z traces out y, arg I(z) changes by 27TK.
The proof of the following generalization is left to the reader (Exercise 1).
3.6 Theorem. Let I be meromorphic in the region G with zeros z l' Z2, . . . , Zn
and poles PI' · · . , Pm counted according to multiplicity. II g is analytic in G
and y is a closed rectifiable curve in G with y  0 and not passing through
any Zi or Pj then
1 I (' n m
_ 2 . g' l = L g(zi)n(y; z;) - L g(pj)n(y;pj).
7Tl i=1 j=l
Y
We already know that a one-one analytic function I has an analytic
inverse (IV. 7.6). It is a remarkable fact that Theorem 3.6 can be used to give

The Argument Principle 125
a formula for calculating this inverse. Suppose R > 0 and that j' is analytic
and one-one on B(a; R); let n = f[B(a; R)]. If Iz-al < R and  = fez) En
thenf(w)- has one, and only one, zero in B(a; R). Ifwe choose g(w) = w,
Theorem 3.6 gives
z =  f wf'(w) dw
2-rri few) - 
y
where y is the circle I w - 01 = R. But z = j'-l(); this gives the following
3.7 Proposition. Let f be analytic on an open set containing B(a; R) and
suppose that f is one-one on B(a; R). If n = f[B(a; R)] and y is the circle
Iz-al = R thenf-l(w) is defined for each w in n by the formula
f-l(w) =  f zf'(z) dz.
2-rri f(z)-w
y
This section closes with Rouche's Theorem.
3.8 _Rouche's Theorem. Suppose f and g are meromorphic in a neighborhood
of B (a; R) with no zeros or poles on the circle y = { z : I z - a I = R }. If Zf' Zg
(Pf,Pg) are the number of zeros (poles) off and g inside y counted according
to their multiplicities and If
If(z) + g(z)1 < If(z)1 + I g(z)1
on y, then
Zf- Pf= Zg - Pg.
Proof. From the hypothesis
fez) fez)
g(z) + 1 < g(z) + J
on y. If ,\ = f(z)1 g(z) and if ,\ is a positive real number then this inequality
becomes ,\ + I <,\ + I, a contradiction. Hence the meromorphic function
fig maps y onto Q = C - [0, 00). If I is a branch of the logarithm on Q then
l(f(z)lg(z») is a well-defined primitive for (flg),(flg)-l in a neighbor-
hood of y. Thus
0=  f (fl g),(fl g)-l
21Tl y
= 2i f[ j -  ]
y
=(Zf-Pf)-(Zg-Pg).11
This statement of Rouche's Theorem was discovered by Irving Glicks-
berg (A mer. Math. Monthly, 83 (1976), 186-187). In the more classical
statements of the theorem, f and g are assumed to satisfy the inequality

126 Singularities
11+ gl < I g/ on y. This weaker version often suffices in the applications as
can be seen in the next paragraph.
Rouch6's Theorem can be used to give another proof of the Fundamental
Theorem of Algebra. If p(z) = z"+a 1 z"-1 + · . . +a" then
p(z) a 1 a"
-=1+-+...+-
z" z z"
and this approaches 1 as z goes to infinity. So there is a sufficiently large.
number R with
p(z) _ 1 < 1
z"
for 1:z1 = R; that is, Ip(z) - z"1 < Izl" for Izi = R. Rouche's Theorem says
that p(z) must have n zeros inside Izi = R.
We also mention that the use of a circle in Rouche's Theorem was a
convenience and not a necessity. Any closed rectifiable curve i' with i' '" 0 in
G could have been used, although the conclusion would have been modified
by the introduction of winding numbers.
Exercises
1. Prove Theorem 3.6.
2. Suppose 1 is analytic on B (0; I) and satisfies 11(z)/ < I for Izl = I. Find
the number of solutions (counting multiplicities) of the equation fez) = zn
where n is an integer lar ge r than or equal to 1.
3. Let 1 be analytic in B(O; R) with 1(0)=0, 1'(0):;=0 and f(z):;=O for
0< Izi < R. Put P = min{ 11(z)l: Izi = R} > O. Define g: B (0; p)C by
g(W)= f zf'(z) dz
2 wi 1 ( z ) - W
Y
where y is the circle Izi = R. Show that g is analytic and discuss the
properties of g.
4. If 1 is meromorphic on G and j: GCoo is defined by j(z) = 00 when z is
a pole of 1 and j(z) = 1(z) otherwise, show that j is continuous.
5. Letfbe meromorphic on G; show that neither the poles nor the zeros off
have a limit point in G.
6. Let G be a region and let H (G) denote the set orall analytic functions on
G. (The letter" H" stands for holomorphic. Some authors call a differentiable
function holomorphic and call functions analytic if they have a power series
expansion about each point of their domain. Others reserve the term
"analytic" for what many call the complete analytic function, which we will
not describe here.) Show that H(G) is an integral domain; that is, B(G) is a
commutative ring with no zero divisors. Show that M(G), the meromorphic
functions on G, is a field.
We have said that analytic functions are like polynomials; similarly,
meromorphic functions are analogues of rational functions. The question

The Argument Principle 127
arises, is every meromorphic function on G the quotient of two analytic
functions on G? Alternately, is M(G) the quotient field of H(G)? The answer
is yes but some additional theory will be required before this answer can be
proved.
7. State and prove a more general version of Rouch6's Theorem for curves
other than circles in G.
8. Is a non-constant meromorphic function on a region G an open mapping
of G into C? Is it an open mapping of G into Coo ?
9. Let ,\ > 1 and show that the equation It - z - e- z = 0 has exactly one
solution in the half plane {z: Re z > O}. Show that this solution must be
real. What happens to the solution as It -+ I ?
10. Let j be analytic in a neighborhood of D = B (0; I). If Ij(z)1 < I for
Izi = 1, show that there is a unique z with Izi < I and j(z) = z. If Ij(z)1 < I
for Izi = I, what can you say?

Chapter VI
The Maximum Modulus Theorem
This chapter continues the study of a property of analytic functions first
seen in Theorem IV. 3.11. In the first section this theorem is presented again
with a second proof, and other versions of it are also given. The remainder
of the chapter is devoted to various extensions and applications of this
maximum principle.
1. The Maximum Principle
Let 12 be any subset of C and suppose  is in the interior of 12. We can,
therefore, choose a positive number p such that B(; p) c 12; it readily
foIIows that there is a point g in 12 with Igi > II. To state this another way,
if  is a point in 12 with II > Igi for each g in the set 12 then  belongs to 012.
1.1 Maximum Modulus Theorem-First Version. Iff is analytic in a region G
and a is a point in G }vith If(a)! > !f(z) I for all z in G then f must be a constant
function.
Proof. Let Q = f(G) and put  = f(a). From the hypothesis we have that
II > I gl for each g in 12; as in the discussion preceding the theorem  is in
oQ f1 12. In particular, the set 12 cannot be open (because then 12 f1 012 = D).
Hence the Open Mapping Theorem (IV. 7.5) says thatfmust be constant. II
1.2 Maximum Modulus Theorem-Second Version. Let G be a bounded open
set in C and suppose f is a continuous function on G- which is analytic in G.
Then
max {If(z) I : Z E G-} = max {!f(z)!: z E oG}.
Proof. Since G is bounded there is a point a E G- such that If(a)/ > If(z) I
for all z in G- . Iff is a constant function the conclusion is trivial ; iff is not
constant then the result foIIows from Theorem 1.1. II
Note that in Theorem 1.2 we did not assume that G is connected as in
Theorem 1.1. Do you understand how Theorem 1.1 puts the finishing touches
on the proof of 1.2? Or, could the assumption of connectedness in Theorem
1.1 be dropped?
Let G = {z = x+iy: -!1T < y < !1T} and putf(z) = exp [exp z]. Then
f is continuous on G- and analytic on G. If z E oG then z = x + !1Ti so
If(z) I = lexp (:t ieX)1 = 1. However, as x goes to infinity through the real
numbers, f(x) -+ 00. This does not contradict the Maximum Modulus
Theorem because G is not bounded.
In light of the above example it is impossible to drop the assumption of
the boundedness of G in Theorem 1.2; however, it can be replaced. The
128

The Maximum Principle 129
substitute is a growth condition on If(z)1 as z approaches infinity. In fact,
it is also possible to omit the condition that f be defined and continuous on
G-. To do this, the following definitions are needed.
1.3 Definition. Iff: G -+ IR and a E G - or a = 00, then the limit superior of
fez) as z approaches a, denoted by lim sup fez), is defined by
z-+a
lim sup fez) = lim sup {f(z): z E G n B(a; r)}
z-+a r-+O+
(If a = 00, B(a; r) is the ball in the metric of Coo.) Similarly, the limit. i'1(erior
of fez) as z approaches a, denoted by lim inf fez), is defined by
z-+a
lim inff(z) = lim inf t(z): z E G n B(a; r)}.
z-+a r-+O+
It is easy to see that lim fez) exists and equals  iff a = lim sup fez) =
za
z-+a
lim inf fez).
z-+a
If G c C then let 0 00 G denote the boundary of G in Coo and call it the
extended boundary of G. Clearly 000G = oG if G is bounded and 000G =
oG U {oo} if G is unbounded.
After these preliminaries the final version of the Maximum Modulus
Theorem can be stated.
1.4 Maximum Modulus Theorem-Third Version. Let G be a region in
C and f an analytic function on G. Suppose there is a constant M such that
lim sup If(z) I < M for all a in 0ooG. Then If(z)/ < M for all z in G.
z-+a
Proof Let 8 > 0 be arbitrary and put H = {z E G: If(z) I > M + 8}. The
theorem will be demonstrated if H is proved to be empty.
Since If I is continuous, H is open. Since lim sup If(z) I < M for each
za
a in 0ooG, there is a ball B(a; r) such that If(z) I < M + 8 for all z in G n B(a;
r). Hence H- c G. Since this condition also holds if G is unbounded and
a = 00, H must be bounded. Thus, H- is compact. So the second version of
the Maximum Modulus Theorem applies. But for z in oH, If(z) I = M +8
since H- c {z: If(z) I > M+8}; therefore, H = 0 or fis a constant. But
the hypothesis implies that H = 0 if f is a constant. _
Notice that in the example G = {z: 11m zl < !7T}, fez) = exp (e Z ), f
satisfies the condition lim sup If(z)1 < 1 for all a in oG but not for a = 00.
z-+a
Exercises
1. Prove the following Minimum Principle. If f is a non-constant analytic
function on a bounded open set G and is continuous on G-, then either f
has a zero in G or If I assumes its minimum value on oG. (See Exercise IV.
3.6.)
2. Let G be a bounded region and suppose f is continuous on G- and

130 The Maximum Modulus Theorem
analytic on G. Show that if there is a constant c > 0 such that I/(z) 1 == c
for all z on the boundary of G then either I is a constant function or I has a
zero in G.
3. (a) Letlbe entire and non-constant. For any positive real number c show
that the closure of {z: I/(z) 1 < c} is the set {z: I/(z) 1 < c}.
(b) Let p be a polynomial and show that each component of {z: Ip(z)1 < c}
contains a zero of p. (Hint: Use Exercise 2.)
(c) If p is a polynomial and c > 0 show that {z: Ip(z)j == c} is the union
of a finite number of closed paths. Discuss the behavior of these paths as
c -+ 00. /
4. Let 0 < r < R and put A == {z: r < /zl < R}. Show that there is a
positive number E > 0 such that for each polynomial p,
sup {/ p( z) - z - 11 : z E A} > €
This says that Z-1 is not the uniform limit of polynomials on A.
5. Let I be analytic on B(O; R) with I/(z) 1 < M for Izi < Rand 1/(0)1 ==
a > O. Show that the number of zeros oflin B(O; tR) is less than or equal to
I I log ( M ) . Hint: If z l' . . . , Zn are the zeros of I in B(O; tR), consider
og 2 a
the function
g(z) = fez) [il (I - :J J-l,
and note that g(O) == 1(0). ( Notation: Ii a k = a 1 a2 · · · an. )
k= 1
6. Suppose that both I and g are analytic on B(O; R) with I/(z) 1 == Ig(z)1 for
/z / == R. Show that if neither I nor g vanishes in B(O; R) then there is a
constant A, / A/ == 1, such that I == Ag.
7. Let I be analytic in the disk B(O; R) and for 0 < r < R define A(r) ==
max {Re f(z): /zl == r}. Show that unless I is a constant, A(r) is a strictly
increasing function of r.
8. Suppose G is a region, I: G - C is analytic, and M is a constant such that
whenever z is on 000G and {zn} is a sequence in G with z == lim Zn we have
lim sup I/(zn) I < M. Show that I/(z) 1 < M, for each z in G.
2. Schwarz's Lemma
2.1 Schwarz's Lemma. Let D == {z: /zl < I} aILl. (ppose I is analytic on D
with
(a) I/(z) 1 < 1 lor z in D,
(b) 1(0) == O.
Then 11'(0)/ < 1 and I/(z) 1 < Izllor all z in the disk D. Moreover ifll'(O)1 == 1
or if If(z) 1 == Izl for some z =1= 0 then there is a constant c, lei = 1, such that
few) = cw for all w in D.

Schwarz's Lemma
131
Proof. Defineg: DCbyg(z)= j(z) fOfz*Oandg(O)=j'(O); thengis
z
analytic in D. Using the Maximum Modulus Theorem, Ig(z)l < r- 1 for
Izi < rand 0 < r < 1. Letting r approach I gives I g(z)1 < I for all z in D.
That is, 11(z)/ < Izi and 11'(0)1 = I g(O)1 < 1. If 11(z)1 = Izi for some z in D,
z =1=0, or 11'(0)1 = I then I gl assumes its maximum value inside D. Thus,
again applying the Maximum Modulus Theorem, g(z) - c for some con-
stan t c with I c I = 1. This yields 1 (z) = cz and completes the proof of the
theorem. II
We will apply Schwarz's Lemma to characterize the conformal maps of
the open unit disk onto itself. First we introduce a class of such maps. If
lal < 1 define the Mobius transformation:
z-a
f/Ja(z) = 1 -
-az
Notice that CPa is analytic for Izi < lal- 1 so that it is analytic in an open disk
containing the closure of D = {z: Izi < I}. Also, it is an easy matter to
check that
CPa( f/J- a(z» = Z = f/J- a( f/Ja(z»).
for Izi < 1. Hence CPa maps D onto itself in a one-one fashion.
Let () be a real number; then
e iO - a
If/J a( e iO ) I =
1 - ae iO
e iO - a
-
eiO -a
= 1
This says that CPa( oD) = oDe
These facts, and other pertinent information which can be easily checked,
are summarized as follows.
2.2 Proposition. If lal < 1 then CPa is a one-one map of D = {z: Izi < I}
onto itself; the inverse of f/Ja is cP_ a. Furthermore, CPa maps oD onto oD, CPa(a)
= 0, cp(O) = l-laI 2 , andcp(a) = (1-laI 2 )-1.
Let us see how these functions CPa can be used in applying Schwarz's
Lemma. Suppose f is analytic on D with If(z) I < 1. Also, suppose lal < 1
andf(a) = ex (so lexl < 1 unlessfis constant). Among all functionsfhaving
these propertie'S what is the maximum possible value of If'(a) I ? To solve
this problem let g = f/Ja 0 f 0 f/J- a. Then g maps D into D and also satisfies
g(O) = CPa(f(a)) = CPa(ex) = O. Thus we can apply Schwarz's Lemma to obtain
that /g'(O)1 < 1. Now obtain an explicit formula for g'(O). Applying the chain
rule

132
The Maximum Modulus Theorenl
g , ( 0) = (CPa 0 f)' ( CPa ( 0 ) ) cP' _ a ( 0 )
= «((Ja 0 I)' (a) (1 -laI 2 )
= ((J;(a)/'(a) (I-laI 2 )
= I -lal 2 f'(a).
1-l a 1 2
Th us,
2.3
If'(a) I < I -l a l 2 .
1-la1 2
Moreover equality will occur exactly when Ig'(O)1 = I, or, by virtue of
Schwarz's Lemma, when there is a constant c with Icl = 1 and
2.4
f ( z ) = <P - a ( Ccp a ( Z ) )
for Izi < 1.
We are now ready to state and prove one of the main consequences of
Schwarz's Lemma. Note that if Icl = I and lal < 1 then I = C((Ja, defines a
one-one analytic map of the open unit disk D onto itself. The next result
says that the converse is also true.
2.5 Theorem. Let I: D  D be a one-one analytic map 01 D onto itself and
suppose I(a) = O. Then there is a complex number c 'ith Icl = 1 such that
I = C((Ja,.
Proof Since I is one-one and onto there is an analytic function g: D  D
such that g{ I(z)) = z for Izi < 1. Applying inequality (2.3) to both I and g
gives II' (a) 1 < (1-laI 2 )-1 and Ig'(O)1 < l-lal 2 (since g(O) = a). But since
1 = g'(O)/''(a), II' (a) 1 = (1-laI 2 )-I. Applying formula (2.4) we have that
I = C((Ja, for some c, Ici = l. II
Exercises
1. Suppose I/(z)1 < 1 for Izi < I and I is analytic. By considering the
function g: D  D defined by .
I(z)-a
g(z) = l-af(z)
where a = 1(0), prove that
If(O)I-l zL < If(z) I < If(O) ) + l:L
I + If(O)llzl 1- If(O)llzl
for Izi < I.
2. Does there exist an analytic function!: D -+ D withf(t) = i andf'(t) =
t?

Convex functions and Hadamard's Three Circles Theorem
133
3. Suppose f: DC satisfies Re f( z) > 0 for all z in D and suppose that f is
analytic and not constant.
(a) Show that Ref(z»O for all z in D.
(b) By using an appropriate Mobius transformation, apply Schwarz's
Lemma to prove that if f(O) = 1 then
If(z) I < 1 + Izi
I-izi
for Izi < I. What can be said if 1(0) =I I?
(c) Show that if f(O) = 1, f also satisfies
I f(z) I > 1 -izi .
1 + Izi
(Hint: Use part (a)).
4. Prove Carat he odory's Inequality whose statement is as follows: l..et f be
analytic on B (0; R) and let M (r) = max{ If(z)l: Izi = r}, A (r) =
max{ Ref(z): Izi = r}; then for 0 < r < R, if A (r) > 0,
R+r
M(r) < - [A(R)+ 1/(0)1]
R-r
(Hint: First consider the case where 1(0) = 0 and examine the function
g(z) = I(Rz) [2A(R)+/(Rz)]-1 for Izi < 1.)
5. Let 1 be analytic in D = {z: Izi < I} and suppose that I/(z)1 < M for
all z in D. (a) If I(Zk) = 0 for 1 < k < n show that
II
If(z)1 < MIl l Z-k I
k = 1 11 - zkzl
for Izi < I. (b) If I(Zk) = 0 for 1 < k < n, each Zk =I 0, and 1(0) = Me i :
(Z l Z2' . · ZII)' find a formula for f
6. Suppose 1 is analytic in some region containing B(O; 1) and I I(z) \ = 1
where Izi = 1. Find a formula for f (Hint: First consider the case where I
has no zeros in B(O; 1).)
7. Suppose I is analytic in a region containing B(O; 1) and I/(z) I = 1 when
jzl = 1. Suppose that f has a simple zero at z = *(1 + i) and a double zero
at z=i. Canf(O)=i?
8. Is there an analytic functionj' on B(O; I) such that I/(z) I < 1 for Iz\ < 1,
1(0) = t, and 1'(0) = i? If so, find such anf Is it unique?
3. Convex functions and Hadamard's Three Circles Theorem
In this section we will study convex functions and logarithmically convex
functions and show that such functions appear in connection with the study
of analytic functions.

134 The Maximum Modulus Theorem
3.1 Definition. If [a, b] is an interval in the real line, a function f: [a, b]  IR
is convex if for any two points Xl and X 2 in [a, b]
f(tx2+(I-t)x t ) < if(x 2 )+(I-t)f(x t )
whenever 0 < t < 1. A subset Ace is convex if whenever z and lV are in
A, tz + (1- t)w is in A for 0 < t < 1; that is, A is convex when for any two
points in A the line segment joining the two points is also in A. (See IV. 4.3
and IV. 4.4.)
What is the rr.iation between convex functions and convex sets? The
answer is that a function is convex if and only if the portion of the plane
lying above the graph of the function is a convex set.
3.2 Proposition. A function f: [a, b] -+ IR is convex iff the set
A = {(x,y): a < x < b andf(x) < y}
is convex.
Proof. Suppose f: [a, b]  IR is a convex function and let (x l' Yt) and (x 2 , Y2)
be points in A. If 0 < t < 1 then, by the definition of convex function,
f(tX2 +(I-t)x 1 ) < if(X2)+(I-t)f(x 1 ) < tY2 +(I-t)Y1. Thus t(x 2 , Y2)+
(I-t) (Xl' YI) = (tx 2 +(I-t)x 1 , tY2+(I-t)Y1) is in A; so A is convex.
Suppose A is a convex set and let X t, X2 be two points in [a, b]. Then
(tx2+(I-t)xt, if(x 2 )+(I-t)f(x 1 » is in A if 0 < t < 1 by virtue of its
convexity. But the definition of A gives that f(tx2 + (1- t)x 1) < t!(x 2 ) +
(1- t)f(x 1); that is, f is convex. _
The proof of the next proposition is left to the reader.
3.3 Proposition. (a) A function f: [a, b]  IR is convex iff for any points
n
Xl' · · · , x n in [a, b] and real numbers t 1 , . . . , t n > 0 with L t k = 1,
k=1
ICt1 tkX k ) < kt td(Xk)'
(b) A set Ace is convex iff for any points z 1, . . . , Zn in A and real
n n
numbers t l' · · · , t n > 0 with L t k = 1, L/kZk belongs to A.
k=1 k=1
What are the virtues of convex functions and sets? We have already seen
the convex sets used in connection with complex integration. Also, the fact
that disks are convex sets has played a definite role, although this may not
have been apparent since this fact is taken for granted. The use of convex
functions may not be so familiar to the reader; however it should be. In the
first course of calculus the fact (proved below) that f is convex when I" is
non-negative is used to obtain a local minimum at a point to whenever
f'(t 0) = O. Moreover, convex functions (and concave functions) are used to
obtain inequalities. Iff: [a, b]  IR is convex then it follows from Proposition
3.2 thatf(x) < max {f(a),f(b)} for all X in [a, b]. We now give a necessary
condition for the convexity of a function.

Convex functions and Hadamard's Three Circles Theorem 135
3.4 Proposition. A differentiable function f on [a, b] is convex iff f' is increasing.
Proof First assume that f is convex; to show that f' is increasing let
a < x < y < b and suppose that 0 < t < 1. Since 0 < (l-t)x+ty-x =
t(y - x), the definition of convexity gives that
f((l-t)x+ty)-f(x) f(y)-f(x)
< .
t(y-x) y-x
Letting t -+ 0 gives that
3.5
f'(x) < fey) -.((x) .
y-x
Similarly, using the fact that 0 > (l-t)x+ty-y = (l-t) (x-y) and letting
t -+ 1 gives that
3.6
f'(y) > fey) - f(x) .
y-x
So, combining (3.5) and (3.6), we have that f' is increasing.
Now supposing thatf' is increasing and that x < u < y, apply the Mean
Value Theorem for differentiation to find rand s- with x < r < u < s < y
such that
f"(r) = feu) - f(x )
u-x
and
f'(s) = fey) - feu) .
y-u
Since f'(r) < f'(s) this gives that
f(u)-f(x) f(y)-f(u)
<
u-x y-u
whenever x < u < y. In particular by letting u = (l-t)x+ ty where
o < t < 1,
feu) - f(x) < fey) - feu) .
- ,
t(y-x) (l-t) (y-x)
and hence
(1- t) [feu) - f(x)] < t[f(y) - feu)].
This shows that f must be convex. _
In actuality we will mostly be concerned with functions which are not
only convex, but which are logarithmically convex; that is, logf(x) is convex.
Of course this assumes that f'(x) > 0 for each x. It is easy to see that a
logarithmically convex function is convex, but not conversely.
3.7 Theorem. Let a < b and let G be the vertical strip {x+iy: a < x < b}.

136 The Maximum Modulus Theorem
Suppose f: G-  C is continuous and f is analytic in G. If we define M:
[a, b]   by
M(x) == sup {If(x+iy)l: - 00 < y < oo},
and If(z) I < B for all z in G, then log M(x) is a convex function.
Before proving this theorem, note that to say that log M(x) is convex
means (Exercise 3) that for a < x < u < y < b,
(y-x) log M(u) < (y-u) log M(x)+(u-x) log M(y)
Taking the exponential of both sides gives
3.8 M(u)(Y-x) < M(x)(Y-u) M(y)<u-x)
whenever a < x < u < y < b. Also, since log M(x) is convex we have that
log M(x) is bounded by max {log M(a), log M(b)}. That is, for a < x < b
M(x) < max {M(a), M(b)}.
This gives the following.
3.9 Corollary. If f and G are as in Theorem 3.7 and f is not constant then
If(z) I < sup {If(w)l: w E 8G}
for all z in G.
To prove Theorem 3.7 the following lemma is used.
3.10 Lemma. Let f and G be as in Theorem 3.7 and further suppose that
If(z) I < 1 for z on 8G. Then If(z) I < 1 for all z in G.
Proof For each € > 0 let g(z) = [1 +€(z-a)]-l for each z in G-. Then for
z == x+iy in G-
Ig(z)/ < IRe [1 + €(z - a)]1- 1
= [1 +€(x-a)]-l
< 1.
3.11
So for z in 8G If(z)g(z)/ < 1. Also, since f is bounded by B in G,
If(z)g(z) I < Bll + €(z-a)/-l
< B[€'llm zlJ-l
So if R == {x+iy: a < x < b, Iyl < B/€}, inequality (3.11) gives If(z)g(z) I
< 1 for z in 8R. It folIows from the Maximum Modulus Theorem that
If(z)g(z) I < 1 for z in R. But if 11m zl > B/€ then (3.11) gives that If(z)g(z) I
< 1. Thus for all z in G.
If(z)/ < /1 +€(z-a)/.
Letting € approach zero the desired result follows. II
Proof of Theorem 3.7. First observe that to prove the theorem we need only
establish
M(U)(b-a) < M(a)(b- U ) M(b)(u-a)

Convex functions and Hadamard's Three Circles Theorem 137
for a < u < b (see (3.8)). To do this recall that for a constant A > 0,
A Z = exp (z log A) is an entire function of z with no zeros. So g(z) defined by
g(z) = M (a)(b - z)j(b - a) M (b )(z - a)j(b - a)
is entire, never vanishes, and (because /A z / = ARe Z) for z = x+ iy
3.12
/ g( z) I = M (a) ( b - x) j (b - a) M (b) (x - a) j (b - a) .
(It is assumed here that M(a) and M(b) # O. However, if either M(a) or
M (b) is zero then / = 0.) Since the expression on the right hand side of
(3.12) is continuous for x in [a, b] and never vanishes, /g/-l must be bounded
in G-. Also, Ig(a+iy)1 = M(a) and /g(b+iy)1 = M(b) so that /f(z)lg(z)/ < 1
for z in 8G; and fig satisfies the hypothesis of Lemma 3.10. Thus
/f(z) I < Ig(z)/, Z E G.
Using (3.12) this gives for a < u < b
M(u) < M(a)(b-U)/(b-a) M(b)(u-a)/(b-a)
which is the desired conclusion. II
Hadamard's Three Circles Theorem is an analogue of the preceding
theorem for an annulus. Consider ann (0; Rt, R 2 ) = A where 0 < Rl < R 2
< 00. If G is the strip {x + iy: log R 1 < X < log R 2 } then the exponential
function maps G onto A and 8G onto 8A. Using this fact one can prove the
following from Theorem 3.7 (the details are left to the reader).
3.13 Hadamard's Three Circles Theorem. Let 0 < R 1 < R 2 < 00 and suppose
f is analytic on ann (0; Rt, R 2 ). If Rt < r < R 2 , define M(r) = max
{If(re i8 )/: 0 < (} < 21T}. Then for R 1 < r 1 < r < r2 < R 2 ,
I M( ) logr2-logr 1 M( ) logr-Iogrl 1 M( )
og r < og r 1 + og r 2 .
log r 2 -log r 1 log r 2 -log r 1
Another way of expressing Hadamard's Theorem is to say that log M(r)
is a convex function of log r.
Exercises
1. Let f: [a, b] -+  and suppose that f(x) > 0 for all x and that / has a
continuous second derivative. Show that f is logarithmically convex iff
f"(x)f(x) - [f'(x)] 2 > 0 for all x.
2. Show that iff: (a, b) -+  is convex then/is continuous. Does this remain
true if fis defined on the closed interval [a, b]?
3. Show that a function .f: [a, b] -+  is convex iff any of the following
equivalent conditions is satisfied:
( f(U) U 1 )
(a) a < x < U < Y < b gives det f(x) x 1 > 0;
f(y) y 1

138 The Maximum Modulus Theorem
(b) a < x < u < y < b give J(u)-f(x) < f(y)-f(x) ;
u-x y-x
(c) a < x < u < y < b give J(u)-f(x) < f(y)-f(u) .
u-x y-u
Interpret these conditions geometrically.
4. Supply the details in the proof of Hadamard's Three Circle Theorem.
5. Give necessary and sufficient conditions on the function f such that
equality occurs in the conclusion of Hadamard's Three Circle Theorem.
6. Prove Hardy's Theorem : Iff is analytic on B(O; R) and not constant then
21t
I(r) =  f If(rei8)ldO
21T
o
is strictly increasing and log l(r) is a convex function of log r. Hint: If
o < r 1 < r < r 2 find a continuous function cp: [0, 21T]  C such that
cp(O)f(re i8 ) = Ij'(re i8 )1 and consider the function F(z) = J1t f(ze i8 )cp(O)dO.
(Note that r is fixed, so cp may depend on r.)
7. Let f be analytic in ann (0; R l' R 2 ) and define
21t
12(r) =  f If(rei8)12dO.
27T
o
Show that log 1 2 (r) is a convex function of log r, Rl < r < R 2 .
4. The Phragmen-Lindelof Theorem
This section presents some results of E. Ph ragmen and E. Lindelof (pub-
lished in 1908) which extend the Maximum Principle by easing the require-
me.nt of boundedness on the boundary.
The Phragmen-Lindelof Theorem bears a relation to the Maximum
Modulus Theorem which is analogous to the relationship of the following
result to Liouville's theorem. If f is entire and If(z)1 < 1 + Izl t then f is a
constant function. (Prove it!) So it is not necessary to assume that an entire
function is bounded in order to prove that it is constant; it is sufficient to
assume that its growth as z  00 is restricted by 1 + Izl t . The Phragmen-
Lindelof Theorem places a growth restriction on an analytic function
f: G  C as z nears a point on the extended boundary. Nevertheless, the
conclusion, like that of the Maximum Modulus Theorem, is thatfis bounded.
4.1 Phragmen-Lindelof Theorem. Let G be a simply connected region and let
f be an analytic function 011 G. Suppose there is an analytic function cp: G  C
which never vanishes and is bounded on G. If M is a constant and 000G = A u B
such that:
(a) for every a in A, lim sup If(z)1 < !vI;
za

Phragmen- Lindelof Theorem
(b) for every b in B, and 7] > 0, lim sup If(z)/ /CP(Z)I71 < M;
z-'b
then If(z) I < MforallzinG.
139
Proof Let I cp(z) I < K for a1l z in G. Also because G is simply connected there
is an analytic branch of log cp(z) on G (Corollary IV. 4.16). Hence g(z) = exp
(7] log cp(z)) is an analytic branch of cp(Z)77 for 7] > 0; and /g(z)/ = Icp(Z)/71.
Define F: G  C by F(z) = f(z)g(z)K- 77 ; then F is analytic on G and
IF(z)1 < If(z)1 since Icp(z)1 < K for all z in G. But then, by conditions (a)
and (b) on 0ocG, F satisfies the hypothesis of Theorem 1.4. Thus
IF(z)1 < max (M, K- 77 M) for all z in G. This gives
I f( z)1 < I K/ <p( Z )1 l1max( M, K -11M)
for all z in G and for all 7] > o. Letting 7]  0+ gives thflt 11(z)1 < M tor
all z in G. II
4.2 Corollary. Let a > t and put
G = {z: jarg zj <  } .
Suppose that f is analytic on G and there is a constant M such that lim sup
zw
If(z) I < M for all w in eG. If there are positive constants P and b < a such that
4.3
If(z) I < P exp (Izl b )
for all z with Izi sufficiently large, then If(z) I < M for all z in G.
Proof Let b < c < a and put cp(z) = exp (- z1 for z in G. If z = re i8 ,
101 < 7T/2a, then Re ZC = r C cos cO. So for z in G
Icp(z) I = exp ( - r C cos cO)
when z = re i8 . Since c < a, cos cO > P > 0 for all z in G. This gives that cp is
bounded on G. Also, if 7] > 0 and z = re i8 is sufficiently large,
If(z)llcp(z)l77 < P exp (r b -7]r c cos cO)
< Pexp(r b -7]r C p)
But r b -7]r C p = r C (r b - c -7]p). Since b < c, rb-cO+ as r 00 so that
r b -7]r C p  - 00 as r  00. Thus
lim sup If(z) I Icp(z) 1 71 = 0
Hence, f and cp satisfy the hypothesis of the Phragmen-Lindelof Theorem
so that /f(z) 1 < M for each z in G. II
Note that the size of the angle of the sector G is the only relevant fact
in this corollary; its position is inconsequential. So if G is any sector of angle
'TT/a the conclusion remains valid.

140 The Maximum Modulus Theorem
4.4 Corollary. Let a > t,
G = {Z: Jarg ZI < ;:, },
and suppose that for every w in 8G, lim sup If(z)1 < M. Moreover, assume that
%....w
for every 8 > 0 there is a constant P (which may depend on 8) such that
4.5
/f(z) I < P exp (8Iz/D)
for z in G and Izi sufficiently large. Then If(z) I < M for all z in G.
Proof. Define F: G  C by F(z) = fez) exp ( - €ZD) where € > 0 is arbitrary.
If x > 0 and 8 is chosen with 0 < 8 < € then there is a constant P with
/F(x)1 < P exp [(8 - €)x D ].
But then /F(x)1 O as x  00 in IR; so M 1 = sup {/F(x)l: 0 < x < oo}
< 00. Define M 2 = max {M 1 , M} and
H + = {z E G: 0 < arg z < 71' /2a },
H_ = {ZEG:O > argz > -71'/2a};
then lim sup If(z) I < M 2 for all z in 8H + and 8H _. Using hypothesis (4.5),
%-+w
Corollary 4.2 gives I F(z) I < M 2 for all z in H+ and H_ hence, IF(z)/ < M 2
for all z in G.
We claim that M 2 = M. In fact, if M 2 = M 1 > M then IFI assumes its
maximum value in G at some point x, 0 < x < 00 (because IF(x)1  0 as
x  00 and lim sup /f(x)/ = lim sup IF(x)1 < M < M 1 ). This would give
x-+O x-+O
that F is a constant by the Maximum Principle and so M = MI. Thus,
M 2 = M and IF(z)1 < M for all z in G; that is, "
If(z)1 < M exp (€ Re ZD)
for all z in G; since M is independent of €, we can let €  0 and get If(z) I < M
for all z in G. II
Let G = {z: z =F 0 and larg zl < 71'/2a} and letf(z) = exp (ZD) for z E G.
Then /f(z) I = exp (IZ/D cos a8) where 8 = arg z. So for z in 8G If(z) I = 1;
but fez) is clearly unbounded in G. In fact, on any ray in G we have that
If(z)1 -+ 00. This shows that the growth condition (4.5) is very delicate and
can't be improved.
Exercises
1. In the statement of the Phragmen-Lindelof Theorem, the requirement
that G be simply connected is not necessary. Extend Theorem 4.1 to
regions G with the property that for each z in a oo G there is a sphere V in
Coo centered at z such that V (\ G is simply connected. Give some
examples of regions that are not simply connected but have this property
and some which don't.

The Phragmen-Lindelof Theorem 141
2. In Theorem 4.1 suppose there are bounded analytic functions CP),CP2"'"
qJn on G that never vanish and ° 00 G = A u B) u ... u Bn such that condition
(a) is satisfied and condition (b) is also satisfied for each CPk and Bk' Prove
that If(z)1 < M for all z in G.
3. Let G = {z: 11m zl < 1 1T } and suppose f: G  C is analytic and lim sup
%-+w
If(z) 1 <: M for w in aG. Also, suppose A < 00 and a < 1 can be found such
that
If(z) 1 < exp [A exp (a IRe zl)]
for all z in G. Show that If(z) 1 < M for all z in G. Examine exp (exp z) to
see that this is the best possible growth condition. Can we take a = 1 above?
4. Let f: G  C be analytic and suppose M is a constant such that lim sup
If(zn) 1 < M for each sequence {zn} in G which converges to a point in 0ooG.
Show that If(z) 1 < M. (See Exercise 1.8).
5. Let f: G  C be analytic and suppose that G is bounded. Fix Zo in oG
and suppose that lim sup If(z) 1 < M for w in 8G, w 1= zoo Show that if
zw
Jim /z-zol£ If(z)/ = 0 for every E > 0 then If(z)/ < M for every z in oG.
zzo
(Hint: IfaftG, consider cp(z) = (z-zo) (z-a)-1.)
6. Let G = {z: Re z > O} and let f: G  C be an analytic function with
lim sup /f(z)/ < M for w in 8G, and also suppose that for every S > 0,
zw
lim sup {exp ( - Elr If(re i8 )/: /8/ < 11T} = O.
r-O
Show that /f(z)/ < M for all z in G.
7. Let G = {z: Re z > O} and let f: G  C be analytic such that f(l) = 0
and such that lim sup If(z) 1 < M for }v in eG. Also, suppose that for every
zw
0, 0 < 0 < 1, there is a constant P such that
If(z)/ < P exp (l z l 1 -c5).
Prove that
/f(z) 1 < M [ (1 _ -X)2+ y 2 ] t.
(l+x)2+ y 2
( . . ( I + Z ) )
HInt: ConsIder fez) 1- z ·

Chapter VII
Compactness and Convergence in the
Space of Analytic Functions
In this chapter a metric is put on the set of all analytic functions on a
fixed region G, and compactness and convergence in this metric space is
discussed. Among the applications obtained is a proof of the Riemann
Mapping Theorem.
Actually some more general results are obtained which enable us to also
study spaces of meromorphic functions.
1. The space of continuous functions C(G,S1)
In this chapter (0, d) will always denote a complete metric space.
Although much of what is said does not need the completeness of 0, those
results which hold the most interest are not true if (0, d) is not assumed to
be complete.
1.1 Definition. If G is an open set in C and (0, d) is a complete metric space
then designate by C( G, 0) the set of all continuous functions from G to Q.
The set C(G, Q) is never empty since it always contains the constant
functions. However, it is possible that C( G, Q) contains only the constant
functions. For example, suppose that G is connected and Q = N = {I,
2, . . .}. Iff is in C(G, Q) then f(G) must be connected in Q and, hence, must
reduce to a point.
However, our principal concern will be when Q is either C or Coo. For
.
these two choices of Q, C(G, Q) has many non constant elements. In fact,
each analytic function on G is in C(G, C) and each meromorphic function
on G is in C(G, Coo) (see Exercise V. 3.4).
To put a metric on C(G, Q) we must first prove a fact about open subsets
of C. The third part of the next proposition will not be used until Chapter
VIII.
1.2 Proposition. If G is open in C then there is a sequence {Kn} of compact
00
subsets of G such that G = U Kn. Moreover, the sets Kn can be chosen to
n=l
satisfy the following conditions:
(a) Kn C intK n + 1 ;
(b) KeG and K compact implies K C Knfor some n;
(c) Every component of Coo - Kn contains a component of Coo - G.
142

The space of continuous functions C( G ,Q)
Proof. For each positive integer n let
Kn = {z: Izi < n} n {z: d(z, C-G) > } ;
since Kn is clearly bounded and it is the intersection of two closed subsets
of C, Kn is compact. Also, the set
143
{z: Izi < n+I} n { z: d(z, C-G) >  }
n+I
is open, contains Kn, and is contained in Kn+ 1. This gives that (a) is satisfied.
00 00
Since it easily follows that G = U Kn we also get that G = U int Kn; so if
n=l n=l
K is a compact subset of G the sets {int Kn} form an open cover of K. This
gives part (b).
To see part (c) note that the unbounded component of Coo - Kn (=> Coo - G)
must contain 00 and must therefore contain the component of Coo - G
which contains 00. Also the unbounded component contains {z: Izi > n}.
So if D is a bounded component of C - Kn it contains a point z with
1
d{z, C - G) < -. But by definition this gives a point w in C - G with
n
Iw-zl < . But then z E B(W; ) C Coo -K n ; since disks are connected and
z is in the component D of Coo - Kn, B( w; ) cD. If D 1 is the component
of Coo - G that contains w it follows that Dl cD. II
vv
If G = U Kn where each Kn is compact and Kn c int Kn+ l' define
n = I
1.3
Pn{f, g) = sup {d(/{z), g{z)): z E Kn}
for all functions I and g'in C( G, Q). Also define
p(f, g) = f (tt Pn(f, g)
n = 1 1 + Pn{f, g)
1.4
since t{I + t) - 1 < 1 for all t > 0, the series in (1.4) is dominated by L (t)n and
must converge. It will be shown that P is a metric for C{G, Q). To do this the
following lemma, whose proof is left as an exercise, is needed.
1.5 Lemma. II (S, d) is a metric space then
( ) des, t)
p" s, t =
1 + des, t)
is a/so a metric 011 S. A set is open in (S, d) iff it is open in (S, p,,); a sequence
is a Cauchy sequence in (S, d) iff it is a Cauchy sequence in (S, p,,).
1.6 Proposition. (C{ G, Q), p) is a metric space.

144 Compactness and Convergence
Proof It is clear that p(/, g) = p(g,f). Also, since each Pn satisfies the triangle
inequality, the preceding lemma can be used to show that p satisfies the
00
triangle inequality. Finally, the fact that G = U Kn gives that f = g whenever
p(/, g) = O. II n = 1
The next lemma concerns subsets of C(G, Q) x C(G, Q) and is very useful
because it gives insight into the behavior of the metric p. Those who know
the appropriate definitions will recognize that this lemma says that two
uniformities are equivalent.
1.7 Lemma. Let the metric p be defined as in (1.4). If E > 0 is given then there
is a 8 > 0 and a compact set KeG such that for f and g in C( G, Q),
1.8
sup {d(j(z), g(z)): z E K} < S => p(/, g) < E.
Conversely, if 8 > 0 and a compact set K are given, there is an € > 0 such
that for f and g in C(G, Q),
1.9 p(f, g) < € => sup {d(f(z), g(z)): z E K} < o.
00
Proof If € > 0 is fixed let p be a positive integer such that L (t)n < !€
n=p+l
and put K = Kp- Choose 8 > 0 such that 0 < t < 8 gives  < -i€. Suppose
I +t
f and g are functions in C(G, i2) that satisfy sup {d(j(z), g(z)): z E K} < o.
Since Kn c Kp = K for 1 < n < p, Pn(f, g) < 0 for I < n < p. This gives
Pn(f, g) < 1
2€
1 + Pn(/' g)
for 1 < n < p. Therefore
p
p(/, g) < L (t)n(tE) +
n=1
00
L tt)n
n=p+l
< €
That is, (1.8) is satisfied. 00 00
Now suppose K and S are given. Since G = U Kn = U int Kn and K is
n=l n=l
compact there is an integer p > 1 such that K c K p ; this gives
pp(/, g) > sup {d(f(z), g(z)): z E K}
Let € > 0 be chosen so that 0 < s < 2 P € implies  < 8; then  < 2 P €
I-s l+t
implies t < 8. So if p(/, g) < € then pi/' g) < 2 P € and this gives pi/' g)
I + pp(f, g)
< o. But this is exactly the statement contained in (1.9). II
1.10 Proposition. (a) A set (!) c (C(G, Q), p) is open iff for each f in (!) there
is a compact set K and as> 0 such that
(!) :::> {g: d(f(z), g(z)) < S, Z E K}

The space of continuous functions C(G,Q) 145
(b) A sequence {In} in (C( G, Q), p) converges to I iff {In} converges to I
uniformly on all compact subsets 01 G.
Proof If (!) is open and IE (!) then for some € > 0, (!) ::) {g: p(/, g) < €}.
But now the first part of the preceding lemma says that there is a 0 > 0
and a compact set K with the desired properties. Conversely, if (!) has the
stated property and I E (!) then the second part of the lemma gives an € > 0
such that (!) ::) {g: p(/, g) < €}; this means that (!) is open.
The proof of part (b) will be left to the reader. II
1.11 Corollary. The collection 01 open sets is independent 01 the choice 01 the
00
sets {Kn}. That is, ifG == U K where each K is compact and K c int K+l
n=l
and if JL is the metric defined by the sets {K} then a set is open in (C( G, Q), JL)
iff it is open in (C( G, Q), p).
Proof This is a direct consequence of part (a) of the preceding proposition
since the characterization of open sets does not depend on the choice of the
sets {Kn}. II
Henceforward, whenever we consider C(G, Q) as a metric space it will
be assumed that the metric p is given by formula (1.4) for some sequence
00
{Kn} of compact sets such that Kn C int Kn+ 1 and G == U Kn. Actually, the
n = 1
requirement that Kn c int Kn+ 1 can be dropped and the above results will
remain valid. However, to show this requires some extra effort (e.g., the
Baire Category Theorem) which, though interesting, would be a detour.
Nothing done so far has used the assumption that Q is complete. How-
ever, if Q is not complete then C( G, Q) is not complete. In fact, if {w n } is
a non-convergent Cauchy sequence in Q and In(z) == W n for all z in G, then
{In} is a non-convergent Cauchy sequence in C( G, Q). However, we are
assuming that Q is complete and this gives the following.
1.12 Proposition. C(G, Q) is a complete metric space.
Proof Again utilize Lemma 1.7. Suppose {In } is a Cauchy sequence in C(G, Q).
Then for each compact set KeG the restrictions of the functions In to K
gives a Cauchy sequence in C(K, 2). That is, for every 0 > 0 there is an
integer N such that
1.13
sup {d(ln(z),fm(z)): z E K} < 0
for n, m > N. In particular {In(z)} is a Cauchy sequence in Q; so there is a
point I{z) in Q such that I{z) == lim In(z). This gives a function f: G  Q;
it must be shown that I is continuous and p(ln, I)  o.
Let K be compact and fix 0 > 0; choose N so that (1.13) holds for n,
m > N. If z is arbitrary in K but fixed then there is an integer m > N so that
d(/(z), fm(z)) < o. But then
d(f{z),fn{z» < 20

146 Compactness and Convergence
for all n > N. Since N does not depend on z this gives
sup {d(f(z),fn(z)): z E K}  0
as n  00. That is, {fn} converges to f uniformly on every compact set in G.
In particular, the convergence is uniform on all closed balls contained in G.
This gives (Theorem II. 6.1) that f is continuous at each point of G. Also,
Proposition 1.1 0 (b) gives that p(fn, f)  o. II
The next definition is derived from the classical origins of this subject.
Actually it could have been omitted without interfering with the development
of the chapter. However, even though there is virtue in maintaining a low
ratio of definitions to theorems, the classical term is widely used and should
be known by the reader.
1.14 Definition. A set ff c C(G, i2) is normal if each sequence in ff has a
subsequence which converges to a function fin C(G, i2).
This of course looks like the definition of sequentially compact subsets,
but the limit of the subsequence is not required to be in the set ff. The next
proof is left to the reader.
1.15 Proposition. A set ff c C(G, f2) is normal iff its closure is compact.
1.16 Proposition. A set ff c C(G, i2) is normal iff for every compact set
KeG and S > 0 there are functions fl' . . . ,In in ff such that for f in ff
there is at least one k, 1 < k < n, with
sup {d(f(z),h(Z)): z E K} < S.
Proof Suppose ff is normal and let K and S > 0 be given. By Lemma 1.7
there is an E > 0 such that (1.9) holds. But since ff- is compact, ff is
totally bounded (actually there are a few details to fill in here). So there
are fl' . . . ,fn in ff such that
n
ff C U {f: P{f,h) < E}
k=1
But from the choice of E this gives
n
ff C U {f: d(f(z),h(Z)) < s, z E K};
k=1
that is, !F satisfies the condition of the proposition.
For the converse, suppose ff has the stated property. Since it readily
follows that ff- also satisfies this condition, assume that ff is closed. But
since C(G, f2) is complete ff must be complete. And, again using Lemma 1.7,
it readily follows that ff is totally bounded. From Theorem II. 4.9 ff is
compact and therefore normal. II
This section concludes by presenting the Arzela-Ascoli Theorem. Al-
though its proof is not overly complicated it is a deep result which has
proved extremely useful in many areas of analysis. Before stating the theorem
a few results of a more general nature are needed.

The space of continuous functions C(G,O)
147
00
Let (X m d n ) be a metric space for each n > 1 and let X = TI X n be their
n=l
cartesian product. That is, X = {g = {xn}: X n E X n for each n > I}. For
g = {xn} and 7] = {Yn} in X define
1.17 d(g,7]) = f G-Y dixn> Yn) .
n= I 1 + dn(xn, Yn)
1.18 Proposition. CQ Xn> d), where d is defined by (1.17), is a metric space.
00
If gk = {x}:= I is in X = TI X n then gk  g = {xn} iff x  X n for each n.
n=l
Also, if each (X n , d n ) is compact then X is compact.
Proof The proof that d is a metric is left to the reader. Suppose d(gk, g)  0;
sInce
dn(Y!", :n) < 2ndW, g)
1 + dn(xm x n )
we have that
I . dn(x, x n ) - 0
1m k -.
k-+ 00 1 + dn(xm x n )
This gives that x  X n for each n > 1. The proof of the converse is left to
the reader.
Now suppose that each (X n , d n ) is compact. To show that (X, d) is com-
pact it suffices to show that every sequence in Xhas a convergent subsequence;
this is accomplished by the Cantor diagonalization process. Let gk = {Y!,,} E X
for each k > 1 and consider the sequence of the first entries of the gk; that
is, consider {x} }f= I C Xl. Since Xl is compact there is a point x I in Xl
and a subsequence of {x}} which converges to it. We are now faced with a
problem in notation. If this subsequence of {x }f= I is denoted by {x}j} /f 1
there is little confusion at this stage. However, the next step in the proof is to
consider the corresponding subsequence of second entries {xj} j: 1 and take
a subsequence of this. Furthermore, it is necessary to continue this process
for all the entries. It is easy to see that this is opening up a notational
Pandora's Box. However, there is an alternative. Denote the convergent
subsequence of {x}} by {x}: kEN I }, where N I is an infinite subset of the
positive integers N. Consider the sequence of second entries of {gk: kEN I}.
Then there is a point X 2 in X 2 and an infinite subset N 2 C N I such that
lim {x: kEN 2} = X 2 . (Notice that we still have lim {x}: kEN 2} = XI.)
Continuing this process gives a decreasing sequence of infinite subsets of
N, N I  N 2 . . . ; and points X n in X n such that
1.19 lim {x: k E N n } = X n
Let k j be the }th integer in N j and consider {gk j }; we claim that gkj  g =
{xn} as k  00. To show this it suffices to show that
1.20
x = lim  j
n n
kJ-+ 00

148 Compactness and Convergence
for each n > 1. But since !\I} C !\In for j > n, {xJ: j > n} is a subsequence
of {x: k E !\In}. So (1.20) follws from (1.19). II
The following definition plays a central role in the Arzela-Ascoli Theorem.
1.21 Definition. A set  c C(G, n) is equicontinuous at a point Zo in G iff
for every E > 0 there is a 0 > 0 such that for Iz-zol < s,
d(f(z),f(z 0» < E
for every fin .  is equicontinuous over a set E c G if for every E > 0 there
is as> 0 such that for z and z' in E and Iz-z'l < S,
d(f(z), fez'» < E
for all f in .
Notice that if  consists of a single functionfthen the statement that 
is equicontinuous at z 0 is only the statement that f is continuous at z o. The
important thing about equicontinuity is that the same S will work for all
the functions in . Also, for  = {f} to be equicontinuous over E is to
require that f is uniformly continuous on E. For a larger family  to be
equicontinuous there must be uniform uniform continuity.
Because of this analogy with continuity and uniform continuity the
following proposition should not come as a surprise.
1.22 Proposition. Suppose  c C(G, (2) is equicontinuous at each point ofG;
then  is equicontinuous over each compact subset of G.
Proof. Let KeG be compact and fix E > o. Theft for each w in K there is
a Ow > 0 such that
d(f(w'),f(w» .< 1€
for all j in whenever I w - w'l < 8 w . Now {B( w; 8w): w E K} forms an open
cover of K; by Lebesgue's Covering Lemma (II. 4.8) there is a 8>0 such
that for each z in K, B(z; 8) is contained in one of the sets of this cover. So
if z and z' are in K and Iz-z'l <8 there is a w in K with z' E B(z; 8) c
B(w; 8w). That is, Iz-wl <8w and Iz' -wi <8w. This gives d(j(z), few»
<if and d(j(z'),j(w»<if; so that d(j(z),j(Z'»<f andis equicon-
tinuous over K. II
1.23 Arzela-Ascoli Theorem. A set /F c C(G, n) is normal iff the following
two conditions are satisfied:
(a) for each z in G, {f(z): f E /F} has compact closure in n;
(b)  is equicontinuous at each point of G.
Proof. First assume that /F is normal. Notice that for each z in G the map
of C(G, n) -+ n defined by f  fez) is continuous; since /F- is compact its
image is compact in n and (a) follows. To show (b) fix a point z 0 in G and
let E > O. If R > 0 is chosen so that K = B(z 0; R) c G then K is compact

The space of continuous functions C(G,O) 149
and Proposition 1.16 implies there are functions f, . . . , j in :F such that
for each f in :F there is at least one h with
1.24
E
sup {d(f(z),h(z)): Z E K} < - .
3
But since eachh is continuous there is a S, 0 < S < R, such that Iz - Z 0/ < S
implies that
E
d(h(z),h(zo)) < -
3
for I < k < n. Therefore, if Iz - Z 0 I < S, f E:F, and k is chosen so that
(1.24) holds, then
d(f(z),f(z 0)) < d(f(z),h(z)) + d(h(z),h(Z 0)) + d(h(zo),f(zo))
< E
That is, :F is equicontinuous at Z o.
Now suppose :F satisfies conditions (a) and (b); it must be shown that :F
is normal. Let {zn} be the sequence of all points in G with rational real and
imaginary parts (so for z in G and S > 0 there is a Zn with Iz - znl < S). For
each n > 1 let
X n = {f(zn):f'E:F} - C 0;
from part (a), (X n , d) is a compact metric space. Thus, by Proposition 1.18,
00
X = Il X n is a compact metric space. For fin :F define! in X by
n=l
! = {f(Zl),f(Z2)' · · .}.
Let {.he} be a sequence in :F; so {!k} is a sequence in the compact metric
space X. Thus there is a g in X and a subsequence of {!k} which converges
to g. For the sake of convenient notation, assume that g = Jim !k' Again
from Proposition 1.18,
1.25
lim h(zn) = W n
k-+ 00
where g = {w n }.
I t will be shown that {he} converges to a function f in C (G, 0). By (1.25)
this function f will have to satisfy f(zn) = W n . The importance of (1.25) is
that it imposes control over the behavior of {he} on a dense subset of G. We
will use the fact that {h} is equicontinuous to spread this control to the rest
of G.
To find the function f and show that {h} converges to fit suffices to show
that {he} is a Cauchy sequence. So let K be compact set in G and let E > 0;
by Lemma 1.IO(b) it suffices to find an integer J such that for k, j > J,
1.26 sup {d(ik(z),fj(z)): Z E K} < E.
Since K is compact R = d(K, 8G) > O. Let K 1 = {z: d(z, K) < !R}; then
K 1 is compact and K c int K 1 C Kl C G. Since ff is equicontinuous at each

150 Compactness and Convergence
point of G it is equicontinuous on KI by Proposition 1.22. So choose S,
o < S < tR, such that
1.27
d(f(z), fez'») < !.
3
for all fin  whenever z and z' are in KI with Iz-z'l < S. Now let D be
the collection of points in {zn} which are also points in K 1 ; that is
D = {zn: Zn E Kl }
If Z E K then there is a Zn with Iz - znl < 8; but 8 < !-R gives that d(zn' K)
< tR, or that Zn E KI' Hence {B(w; 8): wED} is an open cover of K. Let
WI' . . . , W n E D such that
n
K c U B(Wi; 8).
i= 1
Since lim Ik(w j ) exists for 1 < i < n (by (1.25») there is an integer J such
koo
that for j, k > J
1.28
E
d(h(Wi),Jj(Wi)) < -
3
for i = 1, . . . , n.
Let z be an arbitrary point in K and let Wi be such that I Wi - zl < S. If
k and j are larger than J then (1.27) and (1.28) give
d(h(z), Jj(z») < d(h(z), h( Wi) + d(h( Wi), Jj( Wi» + d(Jj( Wi), Jj(z)
< E.
Since z was arbitrary this establishes (1.26). II
Exercises
1. Prove Lemma 1.5 (Hint: Study the function f(t) =  for t > -1.)
1 +t
2. Find the sets Kn obtained in Proposition 1.2 for each of the following
choices of G: (a) G is an open disk; (b) G is an open annulus; (c) G is the
plane with n pairwise disjoint closed disks removed ; (d) G is an infinite strip;
(e) G = C-il.
3. Supply the omitted details in the proof 0 f Proposition 1.18.
4. Let F be a subset of a metric space (X, d) such that F- is compact. Show
that F is totally bounded. .
5. Suppose {};.} is a sequence in C(G, Q) which converges tofand {zn} is a
sequence in G which converges to a point z in G. Show lim f,lzn) = fez).
6. (Dini's Theorem) Consider C(G, IR) and suppose that {In} is a sequence
in C(G, IR) which is monotonically increasing (i.e., In(z) < fn+ l(Z) for all
z in G) and limJ;.(z) = j'(z) for all z in G where/ E C(G, ). Show thatJ;.  f
7. Let {In} C C(G,!1) and suppose that {hz} is equicontinuous. Ifl E C(G, Q)
andf(z) = limJ;.(z) for each z then show that};,  f.

Spaces of analytic functions
151
co
8. (a) Let f be analytic on B(O; R) and let f(z) = L anz n for /zl < R. If
n n=O
f,,(z) = L akz\ show that J;. -+ fin C(G; C).
k=O
(b) Let G = ann (0; 0, R) and letfbe analytic on G with Laurent series
00 n
development f(z) = L anz n . Put J,,(z) = L akz k and show that f,.  f in
C(G;C). n=-oo k=-oo
2. Spaces of analytic functions
Let G be an open subset of the complex plane. If H (G) is the
collection of analytic functions on G, we can consider H (G) as a subset of
C (G, C). We use H (G) to denote the analytic functions on G rather than
A (G) because it is a universal practice to let A (G) denote the collection of
continuous functions f:G-C that are analytic in G. Thus A(G)
H (G). The letter H is used in reference to "analytic" because the word
holomorphic is commonly used for analytic. Another term used in place of
analytic is regular.
The first question to ask about H(G) is: Is H(G) closed in C(G,C)?
The next result answers this question positively and also says that the
functionff' is continuous from H(G) into H(G).
2.1 Theorem. If{f,,} is a sequence in H(G) andfbelongs to C(G, C) such that
,f"  f then f is analytic and fk) -+ f(k) for each integer k > 1.
Proof. We will show that f is analytic by applying Morera's Theorem (IV.
5.10). So let T be a triangle contained inside a disk D c G. Since T is
compact, {fn} converges to f uniformly over T. Hence f Tf = lim f Tfn = 0
since each j" is analytic. Thus f must be analytic in every disk D c G; but
this gives that f is analytic in G.
To show thatfk)  f(k), let D = B(a; r) c G; then there is a number
R > r such that .D(a; R) c G. If y is the circle Iz-al = R then Cauchy's
Integral Formula gives
fk)(Z)-f(k)(Z) =  f f,.(W)-f(W) dw.
21Ti (W_Z)k+l
y
for z in D. Using Cauchy's Estimate,
2.2 Ifk)(Z)-f(k)(z)1 < k!Mnkl for Iz-aj < r,
(R-r)
where M n = sup {/f,,(w)-f(w)/: /w-al = R}. But sinceJ;. -+ f, lim M n = O.
Hence, it follows from (2.2) that fk) -+ f(k) uniformly on B(a; r). Now if K
is an arbitrary compact subset of G and 0 < r < d(K, oG) then there are
n
at, . . . , an in K such that K c U B(a j ; r). Since fk) -+ f(k) uniformly on
j=1
each B(a j ; r), the convergence is uniform on K. II
We will always assume that the metric on H(G) is the metric which it

152 Compactness and Convergence
inherits as a subset of C(G, C). The next result follows because C(G, C) is
complete.
2.3 Corollary. H(G) is a complete metric space.
00
2.4 Corollary. If In: G ---7 C is analytic and L In(z) converges uniformly on
n=l
compact sets to fez) then
00
f(k)(Z) == L fk)(z).
n=l
It should be pointed out that the above theorem has no analogue in the
theory of functions of a real variable. For example it is easy to convince
oneself by drawing pictures that the absolute value function can be obtained
as the uniform limit of a sequence of differentiable functions. Also, it can
be shown (using a Theorem of Weierstrass) that a continuous nowhere
differentiable function on [0, 1] is the limit of a sequence of polynomials.
Surely this is the most emphatic contradiction of the corresponding theorem
for Real Variables. A contradiction in another direction is furnished by the
1
following. Let In(x) == - x n for 0 < x < 1. Then 0 == u -lim.f; however the
n
sequence of derivatives {f} does not converge uniformly on [0, 1].
To further illustrate how special analytic functions are, let us examine a
result of A. Hurwitz. As a consequence it follows that if In ---7.f and each In
never vanishes then either f - 0 or f never vanishes.
2.5 Hurwitz's Theorem. Let G be a region and suppose the sequence {h} in
H(G) converges to f If f  0, B(a; R) c G, and fez) =f= 0 for Iz-al == R
then there is an integer N such that for n > N, f and f" have the same number
of zeros in B(a; R).
Proof Since j(z) # 0 for Iz - al == R,
8 == inf {If(z)/: Iz-al == R} > O.
Buthi uniformly on {z : Iz - al = R} so there is an integer N such that if
n > N and I z - a I = R then
li( z) - in (z)1 <  8 < li( z)1 < li( z)1 + lin (z )1.
Hence Rouche's Theorem (V.3.8) implies that i and in have the same
number of zeros in B(a; R). .
2.6 Corollary. If {In} c B(G) converges to f in B(G) and each in never
vanishes on G then either f = 0 or f never vanishes.
In order to discuss normal families in H (G) the following terminology is
needed.

Spaces of analytic functions 153
2.7 Definition. A set :F c R(G) is locally bounded if for each point a in G
there are constants M and r > 0 such that for all f in :F,
Ij'(z) 1 < M, for Iz-al < r.
Alternately, :F is locally bounded if there is an r > 0 such that
sup {If(z)l: Iz - al < r,f E:F} < 00.
That is, :F is locally bounded if about each point a in G there is a disk on
which :F is uniformly bounded. This immediately extends to the requirement
that :F be uniformly bounded on compact sets in G.
2.8 Lemma. A set :F in H(G) is locally bounded iff for each compact set
KeG there is a constant M such that
If(z) 1 < M
for all f in :F and z in K.
The proof is left to the reader.
2.9 Montel's Theorem. Afamity :F in H(G) is normal (ff ff is locally bounded.
Proof Suppose :F is normal but fails to be locally bounded; then there is a
compact set KeG such that sup {If(z)l: z E K, f E:F} = 00. That is, there
is a sequence {h} in :F such that sup {lh(z)l: z E K} > n. Since ff is normal
there is a function fin H(G) and a subsequence {h k } such thathk -*f But
this gives that sup {Ihk(z) - f(z) 1 : z E K} -* 0 as k -* 00. If If(z)/ < M for
z in K,
n k < sup {lhktZ) - f(z)/: z E K} + M;
since the right hand side converges to M, this is a contradiction.
Now suppose :F is locally bounded; the Ascoli-Arzela Theorem (1.23)
will be used to show that ff is normal. Since condition (a) of Theorem 1.23
is clearly satisfied, we must show that ffis equicontinuous at each point of
G. Fix a point a in G and ( > 0; from the hypothesis there is an r > 0 and
M > 0 such that B( a; r) c G and 1/(z)1 < M for all z in B( a; r) and for all
/ in ff. Let Iz - al < 1r and / E ffl'; then using Cauchy's Formula with
yet) = a + rell, 0 < t < 27T,
If(a)-f(z)1 <  f _ f(l') (a-z) dw
21T ( v - a) (w - z)
y
4M
< - la-zl
r
Letting D < min {!r, 4 €} it follows that la-zl < D gives If(a)-f(z)1
< E for alliin g;. _

154
Compactness and Convergence
2.10 Corollary. A set :F c H(G) is compact (If it is closed and locally
bounded.
Exercises
1. Let f, 11' 12' . . . be elements of H (G) and show that In -* f iff for each
closed rectifiable curve y in G, In(z) -* I(z) uniformly for z in {y}.
2. Let G be a region, let a E rR, and suppose that I: [a, 00] x G -* C is a
continuous function. Define the integral F(z) = J: I(t, z)dt to be uniformly
convergent on compact subsets of G if lim J I(t, z)dt exists uniformly for z
b -+ co
in any compact subset of G. Suppose that this integral does converge uni-
formly on compact subsets of G and that for each t in (a, (0), f(t, .) is
analytic on G. Prove that F is analytic and
co
F(k)(Z) = J o/'(t,31 dt
OZk
a
3. The proof of Montel's Theorem can be broken up into the following
sequence of definitions and propositions: (a) Definition. A set  c C(G, C)
is locally Lipschitz if for each a in G there are constants M and r > 0 such
that I/(z)-/(a)1 < Mlz-al for alliin :F and Iz-al < r. (b) If :F c C(G,
C) is locally Lipschitz then :F is equicontinuous at each point of G. (c) If
:F c H(G) is locally bounded then l is locally Lipschitz.
4. Prove Vitali's Theorem: If G is a region and {in} c H ( G) is locally
bounded and i E H (G) that has the property that A = {z E G: limin(z) =
j(z)} has a limit point in G then fnr.
5. Show that for a set :# c H(G) the following are equivalent conditions:
(a) ff is normal;
(b) For every E > 0 there is a number c > 0 such that {c/: IE ff} c
B(O; E) (here B(O; €) is the ball in H(G) with center at 0 and radius E).
6. Show that if ff c H(G) is normal then ff' = {I': IE ff} is also normal.
Is the converse true? Can you add sonlething to the hypothesis that ff' is
normal to insure that ff is normal?
7. Suppose  is normal in H( G) and Q is open in C such that f( G) c Q for
every fin. Show that if g is analytic on Q and is bounded on bounded sets
then {g 0 f: f E } is normal.
8. Let D = {z: Izi < I} and show that  c H(D) is normal iff there is a
sequence {M n } of positive constants such that lim sup  M n < 1 and if
co
f(z) = L anz n is in  then lanl < M n for all n.
o
9. Let D=B(O; 1) and for O<r< 1 let Yr(t)=re 2 '1rit, 0 < t < 1. Show that a
sequence Un} in H(D) converges to! iff J 1!(z)-j,,(z)lldzlO as noo
Yr
for each r, 0< r< l.
10. Let {In} c R(G) be a sequence of one-one functions which converge
to f. Show that either j' is one-one or f is a constant function.

Spaces of meromorphic functions
155
11. Suppose that {J;.} is a sequence in H(G), I is a .non-constant function,
and In -+,{ in H(G). Let a E G and (X = I(a); show that there is a sequence
{an} in G such that: (i) a = lim an; (ii) In(a n ) = (X for sufficiently large n.
12. Show that lim tan nz = - i uniformly for z in any compact subset of
G = {z: 1m z > O}.
13. (a) Show that if I is analytic on an open set containing the disk B(a; R)
then
21t R
1!(aW < 1T2 f fl!(a+re i8W rdrd8.
o 0
(b) Let G be a region and let M be a fixed positive constant. Let  be
the family of all functions fin H (G) such that f f If(z)1 2 dxdy < M. Show
that  is normal. G
3. Spaces of meromophic functions
If G is a region and I is a meromorphic function on G, and if I( z) = 00
whenever z is a pole of I then I: G  Coo is a continuous function (Exercise
v. 3.4). If M(G) is the set of all meromorphic functions on G then consider
M(G) as a subset of C(G, Coo) and endow it with the metric of C(G, Coo).
In this section this metric space will be discussed as B(G) was discussed jn
the previous section.
Recall from Chapter I that the metric d is defined on Coo as follows:
for Zl and Z2 in C
d 21 z 1 -z21
(z/, Z2) = [(1 + I Z tI 2 ) (1 + I Z 21 2 )]t ;
and for Z in C
2
d(z, 0Ci) = (1 + Izl 2 )t ·
Notice that for non zero complex numbers Zl and Z2,
3.1
d(Zl' Z2) = d ( !, ! ) ;
Zl Z2
and for z =F 0
d(z, 0) = d G, 0Ci).
Also recall that if {zn J IS a sequence in C and z E C that satisfies
d(z,zn)O then Iz - znlO.
Some facts about the relationship between the metric spaces C and Coo
are summarized in the next proposition. In order to avoid confusion B(a; r)
will be used to designate a ball in C and Boo(a; r) to designate a ball in Coo.
3.2

156 Compactness and Convergence
3.3 Proposition. (a) If a is in C and r > 0 then there is a number p > 0 such
that Boo(a; p) c B(a; r).
(b) Conversely, if p > 0 is given and a E C then there is a number r > 0
such that B(a; r) C Boo(a; p).
(c) If p > 0 is given then there is a compact set K c C such that Coo - K
c Boo(oo; p).
(d) Conversely, if a compact set K c C is given, there is a number p > 0
such that Boo( 00; p) c Coo - K.
The proof is left to the reader.
The first observation is that M(G) is not complete. In fact if In(z) = n
then {h} is a Cauchy sequence in M(G). But {h} converges to the function
which is identically 00 in C(G, Coo) and this is not meromorphic.
However this is the worst that can happen.
3.4 Theorem. Let {h} be a sequence in M(G) and suppose/,. -* fin C(G, Coo).
Then either.f is meromorphic or f = 00. If each In is analytic then either f is
analytic or f = 00.
Proof. Suppose there is a point a in G with I(a) i= 00 and put M = I/(a)/.
Using part (a) of Proposition 3.3 we can find a number p > 0 such that
Boo(f(a); p) c B(f(a); M). But since In -* j' there is an integer no such that
d(h(a),j(a)) < !p for all n > no. Also {i:fl,f2' . . .} is compact in C(G, Coo)
so that it is equicontinuous. That is, there is an r > 0 such that Iz - al < r
implies d(h(Z), In(a)) < !p. That gives that d(ln(z), ,lea)) < p for Iz-a/ < r
and for n > no. But by the choice of p, IIn(z) I < /h(z)-/(a)1 + I/(a) 1 < 2M
for all z in B(a; r) and n > no. But then (from the formula for the metric d)
2
(1 + 4M 2 ) If,,(z) - f(z)! < d(j,,(z),f(z))
for z in B(a; r) and n > no. Since d(ln(z), fez)) -* 0 uniformly for z in
B(a; r), this gives that Ih(z) - f(z)/ -* 0 uniformly for z in B(a; r). Since the
tail end of the sequence {hz} is bounded on B(a; r), h has no poles and must
be analytic near z = a for n > no. It follows thatfis analytic in a disk about a.
Now suppose there is a point a in G withf(a) = 00. For a function g in
C(G, Coo) define! by ( ! ) (z) =  if g(z) =I- 0 or 00; ( 1_ ) (z) = 0 if g(z) =
g g g) g
00; and G) (z) = 00 if g(z) = O. It follows that  E C(G, Coo), Also, since
f" -+ f in C(G, Coo) it follows from formulas (3.1) and (3.2) that  -+ f ! in
in
C(G, Coo). Now each function !- is meromorphic on G; so the preceding
In
1 1
paragraph gives a number r > 0 and an integer no such that f -- and -- are
/,.
1 1
analytic on B(a; r) for n > no and -  - uniformly on B(a; r). From
In f

Spaces of meromorphic functions 157
Hurwitz's Theorem (2.5) either! = 0 or ! has isolated zeros in B(a; r). So
/ /
I
if f;t 00 then j;t 0 andfmust be meromorphic in B(a; r). Combining this
with the first part of the proof we have that / is meromorphic in G if/is not
identically infinite.
I
If each /n is analytic then -- has no zeros in B(a; r). It follows from
/n
Corollary 2.6 to Hurwitz's Theorem that either ! = 0 or .! never vanishes.
/ f
1
But since f(a) = 00 we have that i has at least one zero; thus f = 00 In
B(a; r). Combining this with the first part of the proof we see that / = 00 or /
is analytic. II
3.5 Corollary. M(G) u {oo} is a complete metric space.
3.6 Corollary. H(G) u {oo} is closed in C(G, CC(J.
To discuss normality in M(G) one must introduce the quantity
2//'(z)1
--- - ---
1+/I(z)1 2 '
for each meromorphic function f However if z is a pole of / then the above
expression is meaningless since /'(z) has no meaning. To rectify this take the
limit of the above expression as z approaches the pole. To show that the
limit exists let a be a pole of ,( of order m > 1; then
f(z) = g(z) + __1",_ + . . . + . _L..
(z - a)m (z - a)
for z in some disk about a and g analytic in that disk. For z =1= a
I'(z) = g'(z) - [ - mAm - + . . . + - J
(z - a)m + 1 (z - a) 2
Thus
21/'(z)1
1 + 1/(z)1 2
mA m
2 --
(z - a)m + 1
Am
1 +
AI ,
+ . · . + ( ) 2 - g (z)
z-a
Al 2
- + . . . + -- - - - - + g( z)
(z - a)m (z - a)
21 z - al m - 1 lmA m + ... + A 1 (z - a)m-l - g'(z)(z - a)m+ll
Iz - al 2m + lAm + ... + A 1 (z - a)m-l + g(z)(z - a)ml2

158
So if m > 2
Compactness and Convergence
lim J /'(z2 1_ == 0
z--+a 1 + If(z)1 2
If m == 1 then
lim 2 1 f'(z)'2 = - .
z--+a 1+/I(z)1 IAII
3.7 Definition. If I is a meromorphic function on the region G then define
!-t(f): G --:)0  by
2If'(z)1
/L(f) (z) = I + If(zW
whenever z is not a pole of f, and
(I) ( ) 1 . 21/'(z)1
!-t a == 1m 2
z--+a 1 + If(z)1
if a is a pole of f.
It follows that !-t(f) E C(G, C).
The reason for introducing !-t(f) is as follows: If I: G --:)0 Coo is mero-
morphic then for z close to z' we have that d(f(z),/(z')) is approximated by
!-t(f) (z) Iz-z'l. So if a bound can be obtained for !-t(f) then 1 is a Lipschitz
function. If I belongs to a family of functions and !-t(f) is uniformly bounded
for 1 in this family, then the family is a uniformly Lipschitz set of functions.
This is made precise in the following proof.
3.8 Theorem. Alamity ff c M(G) is normal in C(G, Coo) ifJ'!-t(ff) = {!-t(/):
IE ff} is locally bounded.
Note. If j,,(z) = nz for n > I then /L(f.) (z) = 21 /2 ' Thus !!7 = {f,.} is
1 +n z
normal in C(G, C<x) and J1-(ff) is locally bounded. However, ff is not
normal in M (G) since the sequence {fn} converges to the constantly infinite
function which does not belong to M(G).
Proof of Theorem 3.8. We will assume that !-t(ff) is locally bounded and
prove that ff is normal by applying the Arzela-Ascoli Theorem. Since Coo
is compact it suffices to show that ff is equicontinuous at each point of G.
So let K be an arbitrary closed disk contained in G and let M be a constant
with !-t(f) (z) < M for all z in K and all 1 in ff. Let z and z' be arbitrary
points in K.
Suppose neither z nor z' are poles of a fixed function 1 in ff and let
ex > 0 be an arbitrary number. Choose points Wo = Z, WI' . . . , W n = z' in
K which satisfy the following conditions:
3.9 W in [W k - 1 , Vk] implies W is not a pole of I;

Spaces of meromorphic functions
159
,.
3.10 L Iwk-Wk-11 < 2/z-z'/;
k=1
3.12
(1 + If(Wk-1W) _ 1 < a
1 ,
[(1 + If(w k )1 2 )(1 + If(W k _ 1 )1 2 )]2
f(Wk)-f(w k -.) _ f'(W k - l ) < IX, I < k < n.
Wk - Wk - 1
1 < k < n;
3.11
To see that such points can be found select a polygonal path P in K satisfying
(3.9) and (3.10). Cover P by small disks in which conditions similar to (3.11)
and (3.12) hold, choose a finite subcover, and then pick points wo, . . . , W n
on P such that each segment [Wk _ 1, Wk] lies in one of these disks. Then
{wo, . . . , w n } will satisfy all of these conditions. If fik = [(I + If(W k - 1 )/2)
(1 + If(w k )1 2 )]t then
n
d(f(z),.f(z'» < L d(f(Wk-l),.f(Wk»
k == I
n 2
= L -If(wk)-f(wk-I)I
k==1 fik
n
 2 f(Wk)-.f(Wk-l) j " ( ) I I
<  - - W k - 1 W k -Wk-l
k = 1 fik W k - Wk - 1
n 2
+ L -1f'(Wk-l)ll w k- W k-ll
Ie = 1 fik
Using the fact that 2If'(w k )/ < M(I + If(w k ) I 2) and the conditions on
w o , . . . , W n this becomes
n n ( I 1 2 )
, 1 I + f( Wk - 1)
d(f(z),.f(z» < 2IX L - IWk-Wk-t!+M L Iw k -W k - 1 1
k == 1 fik k == 1 {3k
n
< (4IX+2IXM) Iz-z'l + L Mlw k -W k - 1 1
k = I
< (4<x+2<xM +2M)IZ-z'l
Since (X > 0 was arbitrary this gives that if z and z' are not poles of.r then
3.13
d(f(z),f(z'» < 2Mlz-z'/.
Now suppose z' is a pole of f but z is not. If w is in K and is not a pole
then it follows from (3.13) that
d(f(z), (0) < d(f(z),f(w»+d(f(w), (0)
< 2M/z-w/+d(f(w), (0).

160 Compactness and Convergence
Since it is possible to let w approach z' without wever being a pole of f
(poles are isoJated!), this gives thatf(u')  fez') = 00 and Iz-wl  Iz-z'/.
Thus (3.13) holds if at most one of z and z' is a pole. But a similar procedure
gives that (3.13) holds for all z and z' in K. So if K = B(a; r) and E > 0 are
given then for S < min {r, E/2M} we have that Iz-aj < S implies d(f(z),
j(a)) < E, and S is independent off in ff. This gives that :# is equicontinuous
at each point a in G.
The proof of the con verse is left to the reader. _
Exercises
1. Prove Proposition 3.3.
2. Show that if :# c M(G) is a normal family in C(G, C<xJ then 11-(:#) is
locally bounded.
4. The Riemann Mapping Theorem
We \\fish to define an equivalence relation between regions in C. After
doing this it will be shown that all proper simply connected regions in C
are equivalent to the open disk D = {z: Izl < I}, and hence are equivalent
to one another.
4.1 Definition. A region G 1 is conformally equivalent to G 2 if there is analytic
function f: G 1  C such that f is one-one and f(G 1 ) = G 2 . Clearly, this is
an equivalence relation.
It is immediate that C is not equivalent to any bounded region by
LiouviIle's Theorem. Also it is easy to show from the definitions that if G 1
is simply connected and G 1 is equivalent to G 2 then G 2 must be simply
connected. If f is the principal branch of the square root then 1 is one-one
and shows that C - {z: z < O} is equivalent to the right half plane.
4.2 Riemann Mapping Theorem. Let G be a simply connected reginn which is
not the 'whole plane and let a E G. Then there is a unique analytic lunction
f: G  C having the properties:
(a) f(a) = 0 and f'ea) > 0;
(b) 1 is one-one;
( c) j( G) = { z: I z I < I} .
The proof that the function f is unique is rather easy. In fact, if g also
has the properties of 1 and D = {z: Izi < I} thenf 0 g-1 : D  D is analytic,
one-one, and onto. Also f 0 g-1(O) = j(a) = 0 so Theorem VI. 2.5 implies
there is a consta'1t e with lei = 1 and f 0 g-1(Z) = cz for all z. But then
I(z) = eg(z) gives that 0 < f'ea) = eg'(a); since g'(a) > 0 it follows that
e = 1, or 1 = g.
To motivate the proof of the existence off, consider the family !F of all
analytic functions f having properties (a) and (b) and satisfying If(z) 1 < 1
for z in G. The idea is to choose a member of ff having property (c). Suppose

The Riemann Mapping Theorem
161
00
{Kn} is a sequence of compact subsets of G such that U Kn = G and a E Kn
n=l
for each n. Then {f(Kn)} is a sequence of compact subsets of D = {z: Izi
< I}. Also, as n becomes larger f(Kn) becomes larger and larger and tries to
fill out the disk D. By choosing a function fin ff with the largest possible
derivative at a, we choose the function which "starts out the fastest" at z = a.
It thus has the best possible chance of finishing first; that is, of having
00
U I(Kn) = D.
n=l
Before carrying out this proof, it is necessary for future developments
to point out that the only property of a simply connected region which will
be used is the fact that every non-vanishing analytic function has an analytic
square root. (Actually it will be proved in Theorem VIII. 2.2 that this property
is equivalent to simple connectedness.) So the Riemann MaWing Theorem
will be completely proved by proving the following.
4.3 Lemma. Let G be a region which is not the whole plane' and such that
every non-vanishing analytic function on G has an analytic squate root. If a E G
then there is an analytic function f on G such that:
(a) f(a) = 0 andf'(a) > 0;
(b) f is one-one;
(c) f(G) = D = {z: Izi < I}.
Proof Define  by letting
ff = {IE H(G):fis one-one,/(a) = O,f"(a) > O,}(G) c D}
Since f( G) c D, sup {If(z) I : Z E G} < 1 for f in ff; by Montel's Theorem
 is normal if it is non-empty. So the first fact to be proved is
4.4
 i= D.
It will be shown that
4.5
- =  U {O}.
Once these facts are known the proof can be completed. Indeed, suppose (4.4)
and (4.5) hold and consider the function.f  f'(a) of H(G)  C. This is a
continuous function (Theorem 2.1) and, since ff- is compact, there is an
I in - \\'ith f'(a) > g'(a) for all g in . Because ff i= D, (4.5) implies
that fE ff. It remains to show that I(G) = D. Suppose WED such that
W f(G). Then the function
f(z)-W
l-wl(z)
is analytic in G and never vanishes. By hypothesis there is an analytic function
h: G  C such that
4.6
[h(z)]2 = fez) - W .
1 -wf(z)

162 Compactness and Convergence
Since the Mobius transformation n = J -  maps D onto D, h(G) c D.
l-w'
Define g: G  C by
g(z) = Ih'(a)1 h(z(a)
h'(a) I-h(a)h(z)
Then g(G) c D, g(a) =-= 0, and g is one-one (why?). Also
'(a) = Ih'(a)1 . h'(a) [l-lh(aW]
g h'(a) [1-lh(a)1 2 j2
Ih'(a)1
l-lh(a)/2
But Ih(a)1 2 = I-wi = Iwl and differentiating (4.6) gives (sincef(a) = 0) that
2h(a)h'(a) = f'(a) (1-l w I 2 ).
Therefore
g'(a) = f'(a) (l-l w I 2 ) . 1
2lwl l-I w l
= f'(a) ( 1 + I w l )
2Jl w l
> f'(a)
This gives that g is in :F and contradicts the choice of f. Thus it must be
thatf(G) = D.
N ow to establish (4.4) and (4.5). Since G =F C, let bEe - G and let g
be a function analytic on G such that [g(Z)]2 = z-b. If ZI and Z2 are points
in G and g(Zl) = :tg(Z2) then it follows that Zl = Z2. In particular, g is
one-one. By the Open Mapping Theorem there is a number r > 0 such that
4.7
g( G) ::> B(g(a); r)
So if there is a point z in G such that g(z) E B( - g(a); r) then r > Ig(z) + g(a) I
= l-g(z)-g(a)l. According to (4.7) there is a w in G with g(w) = -g(z);
but the remarks preceding (4.7) show that w = z which gives g(z) = O. But
then z-b = [g(Z)]2 = 0 implies b is in G, a contradiction. Hence
4.8
g(G) n {,: 1'+g(a)1 < r} = D.
Let U be the disk {,: "+g(a)1 < r} = B(-g(a); r). There is a Mobius
transformation T such that T(Coo-U-) = D. Let gl = Tog; then gl is
analytic and gl(G) c D. If C( = gl(a) then let g2(Z) = CPa 0 gl(Z); so we still
have that g2(G) c D and g2 is analytic, but we also have that g2(a) = o.
Now it is a simple matter to find a complex number c, lei = 1, such that
g3(Z) = eg 2 (z) has positive derivative at z = a and is, therefore, in .
This establishes (4.4).

The Riemann Mapping Theorem 163
Suppose {fn} is a sequence in :F and fn  f in R(G). Clearly f(a) = 0
and since fn'(a)  j"(a) it follows that
4.9
f'ea) > o.
Let z 1 be an arbitrary element of G and put' = fez 1); let 'n = j(z 1.). Let
z 2 E G, z 2 i= z 1 and let K be a closed disk centered at z 2 such that z 1  K.
Thenfn(z) - 'n never vanishes on K since fn is one-one. Butfn(z) - 'n  j'(z) -,
uniformly on K, so Hurwitz's Theorem gives that fez) -, never vanishes on
K or fez) = ,. If fez) = , on K then f is the constant function' throughout
G; sincej(a) = 0 we have thatf(z) = o. Otherwise we get thatf(z2) i= f(ZI)
for z 2 i= z 1 ; that is, f is one-one. B ut iff is one-one then f' can never vanish;
so (4.9) implies that f'ea) > 0 and f is in :F. This proves (4.5) and the proof
of the lemma is con1plete. II
4.10 Corollary. Among the simply connected regions there are only tu'o
equivalence classes; one consisting of C alone and the other containing all the
proper simply connected regions.
Exercises
1. Let G and a be open sets in the plane and let f: G  a be a continuous
function which is one-one, onto, and such thatj'-1 : a  G is also continuous
(a homeomorphism). Suppose {zn} is a sequence in G which converges to a
point z in oG; also suppose that w = lim f(zn) exists. Prove that w E 00.
2. (a) Let G be a region, let a E G and suppose thatf: (G- {a})  C is an
analytic function such that I(G - {a}) = a is bounded. Show that f has a
removable singularity at z = a. If f is one-one, show that I(a) E 00.
(b) Show that there is no one-one analytic function which maps G =
{z: 0 < Izi < I} onto an annulus a = {z: r < Izi < R} where r > o.
3. Let G be a simply connected region which is not the whole plane and
suppose that Z E G whenever z E G. Let a E G ()  and suppose that f:
G -+ D = {z: Izi < I} is a one-one analytic function with f(a) = 0, f' (a) > 0
and f(G) = D. Let G+ = {z E G: 1m z > O}. Show that j'(G+) must lie
entirely above or entirely below the real axis.
4. Find an analytic function j' which maps {z: Izi < 1, Re z > O} onto
B(O; 1) in a one-one fashion.
5. Letfbe analytic on G = {z: Re z > O}, one-one, with Ref(z) > 0 for
all z in G, andf(a) = a for some real number a. Show that If'(a)1 < 1.
6. Let Gland G 2 be simply connected regions neither of which is the whole
plane. Let f be a one-one analytic mapping of G 1 onto G 2 . Let a E G 1 and
put ex = f(a). Prove that for anyone-one analytic map h of G 1 into G 2 with
h(a) = ex it follows that /h'(a)1 < If'(a)l. Suppose h is not assumed to be
one-one; what can be said?
7. Let G be a simply connected region and suppose that G is not the whole
plane. Let  = {g: I gl < I} and suppose that.r is an analytic, one-one map
of G onto  with f(a) = 0 and f'ea) > 0 for some point a in G. Let g be
any other analytic, one-one map of G onto  and express g in terms off.

164 Compactness and Convergence
8. Let '1' '2' R 1 , R 2 , be positive numbers such that Rtfr l = R 2 !r2; show
that ann (0; 'I' R 1 ) and ann (0; r2, R 2 ) are conformal1y equivalent.
9. Show that there is an analytic function f defined on g = ann(O; 0, I) such
tha t f' never vanishes and f ( G) = B (0; I).
5. The Weierstrass Factorization Theorem
The notion of convergence in H(G) can be used to solve the following
problem. Given a sequence {a k } in G which has no limit point in G and a
sequence of integers {m k }, is there a function f which is analytic on G and
such that the only zeros off are at the points a k , with the multiplicity of the
zero at ak equal to m k ? The answer to the question is yes and the result is due
to Weierstrass.
If there were only a finite number of points, aI' . . . , an then ,{(z) =
(z - an)m t . . . (z - an)m n would be the desired function. What happens if there
are infinitely many points in this sequence? To answer this we must discuss
the convergence of infinite products of numbers and functions.
Clearly one should define an infinite product of numbers Zn (denoted
00
by n zn) as the limit of the finite products. Observe, however, that if one of
n=1
the numbers Zn is zero, then the limit is zero, regardless of the behavior of
the remaining terms of the sequence. This does not present a difficulty, but
it shows that when zeros appear, the existence of an infinite product is
trivial.
n
5:1 Definition. If {zn} is a sequence of complex numbers and if Z = lim n Zk
k = I
exists, then z is the infinite product of the numbers Zn and it is denoted by
00
Z = n Zn.
n=1
00
Suppose that no one of the numbers Zn is zero, and that z = n Zn exists
n=1
n
and is also not zero. Let Pn = n Zk for 11 > 1; then no Pn is zero and
k = 1
 = Zn. Since Z =F 0 and Pn  Z we have that lim Zn = 1. So that except
Pn-l
for the cases where zero appears, a necessary condition for the convergence
of an infinite product is that the n-th term must go to 1. On the other hand,
note that for Zn = a for all nand lal < 1, n Zn == 0 although lim Zn = a =F o.
Because of the fact that the exponential of a sum is the product of the
exponentials of the individual terms, it is possible to discuss the convergence
of an infinite product (when zero is not involved) by discussing the con-
vergence of the series L log Zn, where log is the principal branch of the
logarithm. However, before this can be made meaningful the Zn must be

Weierstrass Factorization Theorem 165
restricted so that log Zn is meaningful. If the product is to be non-zero, then
Zn  1. So it is no restriction to suppose that Re Zn > 0 for all n. Now
n
suppose that the series L log Zn converges. If Sn = L log Zk and Sn  s then
n 00 k=1
exp Sn  exp s. But exp Sn = Il Zk so that Il Zn is convergent to Z = ff =1= o.
k=1 n=1 00
5.2 Proposition. Let Re zn > 0 for all n > 1. Then Il Zn converges to a non
n=1
00
zero number iff the series L log Zn converges.
n=1
Proo.f. Let Pn = (z 1 · · . Zn), Z = re i9 , -7T < 8 < 7T, and t(pn) = log IPnl + i8"
where 8-7T < 8n < 8+7T. If Sn = log Z1 +... +log Zn then exp (sn) = Pn so
that Sn = t(Pn) + 27Tik n for some integer k n . Now suppose that Pn  z. Then
Sn:-Sn-1 = log znO; also t(Pn)-t(Pn-1)0, Hence, (kn-kn-l)O as
n  00. Since each k n is an integer this gives that there is an no and a k such
that k m = k n = k for m, n > no. So Sn  t(z) + 27Tik; that is, the series
L log Zn converges. Since the converse was proved above, this completes the
proof. II
Consider the power series expansion of log (1-+- z) about Z = 0:
00
 zn Z2
log (l+z) =  (_I)n-1_ = Z - - +...,
n=1 n 2
which has radius of convergence 1. If Izi < 1 then
1 - log (l +z) = It z -}z2+...1
Z
< t(/z I + Iz 1 2 +. · .)
Izi
= t 1 -izi ·
If we further require Izi < t then
1 _ log(l+z) < t.
z
This gives that for Izi < t
5.3
tlzl < Ilog (1 +z)1 <  Izi.
This will be used to prove the following result.
5.4 Proposition. Let Re Zn > -1; then the series L log (1 +zn) converges
absolutely iff the series L zn converges absolutely.
Proof. If L IZnl converges then Zn  0; so eventually IZnl < !-. By (5.3)
L Ilog (1 + zn)/ is dominated by a convergent series, and it must converge
also. If, conversely, L Ilog (1 + zn)/ converges, then it follows that IZnl < t
for sufficiently large n (why?). Again (5.3) allows us to conclude that L IZnl
converges. II

166 Compactness and Convergence
We wish to define the absolute convergence of an infinite product. The
first temptation should be avoided. That is, we do not want to say that
n IZnl converges. Why? If n IZnl converges it does not follow that n Zn
converges. In fact, let Zn = -1 for all n; then IZnl = 1 for all n so that
n
n IZnl converges to 1. However n Zk is + 1 depending on whether 11 is even
k=l
or odd, so that n Zn does not converge. Thus, if absolute convergence is to
imply convergence, we must seek a different definition.
On the basis of Proposition 5.2 the following definition is justified.
5.5 Definition. If Re Zn > 0 for all n then the infinite product n Zn is said to
converge absolutely if the series L log Zn converges absolutely.
According to Proposition 5.2 and the fact that absolute convergence of
a series implies convergence, we have that absolute convergence of a product
implies the convergence of the product. Similarly, if a product converges
absolutely then any rearrangement of the terms of the product results in a
product which is still absolutely convergent. If we combine Propositions 5.2
and 5.4 with the definition, the following fundamental criterion for con-
vergence of a infinite product is obtained.
5.6 Corollary. If Re Zn > 0 then the product n Zn converges absolutely iff
the series L (zn -1) converges absolutely.
Although the preceding corollary gives a necessary and sufficient con-
dition for the absolute convergence of an infinite product phrased in terms
with which we are familiar, it does not give a method for evaluating infinite
products in terms of the corresponding infinite series. To evaluate a particular
product one must often resort to trickery.
We now apply these results to the convergence of products of functions.
A fundamental question to be answered is the following. Suppose {};,} is a
sequence of functions on a set X and };,(x) -:)0 J(x) uniformly for x in X;
when will exp (fn(x)) -:)0 exp (f(x)) uniformly for x in X? Below is a partial
answer which is sufficient to meet our needs.
5.7 Lemma. Let X be a set and let.f, Jl' f2, . . . be Junctions .from X into C
such that j(x) -:)0 f(x) uniformly for x in X. If there is a constant a such that
Re f(x) < a for all x in X then exp f,,(x) -:)0 exp f(x) uniformly for x in X.
Proof. If E > 0 is given then choose 8 > 0 such that le z - 11 < £ e - a whenever
/z/ < 8. Now choose no such that /};,(x)-f(x)/ < S for all x in X whenever
n > no. Thus
ee- a > /exp[};.(x)-f(x)]-I/
= exp };,(x) _ 1
exp J(x)
It follows that for any x in X and for n > no,
lexPh(x)-expf(x)1 < £ e- a lexpj'(x)/ < £.11
5.8 Lemma. Let (X, d) be a compact metric space and let {gn} be a sequence

Weierstrass Factorization Theorem 167
of continuous functions from X into C such that L gn(x) converges absolutely
and uniformly for x in X. Then the product
00
f(x) = n (1 + gn(x))
n=1
converges absolutely and uniformly for x in X. Also there is an integer no such
that f(x) = 0 iff gn(x) = -1 for some n, 1 < n < no.
Proof. Since L gn(x) converges uniformly for x in X there is an integer no
such that Ign(x) I < 1- for all x in X and n > .1'10. This implies that Re [1 + gn(x)]
> 0 and also, according to inequality (5.3), Ilog (1 + gn(x)) I <  Ign(x) I for
all n > no and x in X. Thus
00
h(x) = L log (1 + gn(x))
n = no + 1
converges uniformly for x in X. Since h is continuous and X is compact it
follows that h must be bounded; in particular, there is a constant a such that
Re h(x) < a for all x in X. Thus, Lemma 5.7 applies and gives that
00
exp h(x) = n (1 + gn(x))
n = no + 1
converges uniformly for x in X.
Finally,
f(x) = [1 + g 1 (x)]. . · [1 + gno(x)] exp h(x)
and exp h(x) '# 0 for any x in X. So if,f(x) = 0 it must be that gn(x) = -1
for some n with 1 < n < no. II
We now leave thi,s general situation to discuss analytic functions.
5.9 Theorem. Let G be a region in C and let {f,.} be a sequence in H(G) such
that no.f" is identically zero. If L [J;.(z) - 1] converges absolutely and uniformly
00
on compact subsets ofG then n.t:.(z) converges in H(G) to an analytic function
n=l
f(z). If a is a zero off then a is a zero of only a finite number of the functions
f", and the multiplicity of'the zero off at a is the sum of the multiplicities of the
zeros of the functions fn at a.
Proof: Since L [f(z) -1] converges uniformly and absolutely on compact
subsets of G, it follows fron1 the preceding theorem that f'(z) = n};.(z)
converges uniformly and absolutely on compact subsets of G. That is, the
infinite product converges in H( G).
Suppose f(a) = 0 and let r > 0 be chosen such that B(a; r) c G. By
hypothesis, L [f,.(z) -1] converges uniformly on B(a; r). According to Lemma
5.8 there is an integer n such that f(z) = fl (z) . . . f,,(z)g(z) where g does not
vanish in /j(a; r). The proof of the remainder of the theorem now follows. II
Let us now return to a discussion of the original problem. If {an} is a
sequence in a region G with no limit point in G (but possibly some point
may be repeated in the sequence a finite number of times), consider the

168 Compactness and Convergence
functions (z - an). According to Theorem 5.9 if we can find functions gn(z)
which are analytic on G, have no zeros in G, and are such that
L/(Z - an)gn(z) - II converges uniformly on compact subsets of G; thenf(z) =
I1(z - an)gn(z) is analytic and has its zeros only at the points z = an. The saf-
est way to guarantee that gn(z) never vanishes is to express it as gn(z)=exp
hn(z) for some analytic function hn(z). In fact, if G is simply connected it
follows that gn(z) must be of this form. The functions we are looking for
were introduced by Weierstrass.
5.10 Definition. An elementary factor is one of the following functions Ep(z)
for p = 0, 1, . . . :
Eo(z) = l-z,
( Z2 ZP )
Ei z ) = (1- z) exp z + 2 + · · · + p , p > 1.
The function Ep(z/a) has a simple zero at z = a and no other zero. Also
if b is a point in C - G then E p ( : : ) has a simple zero at z = a and is
analytic in G. These functions will be used to manufacture analytic functions
with prescribed zeros of prescribed multiplicity, but first an inequality must
be proved which will enable us to apply Theorem 5.9 and obtain a con-
vergent infinite product.
5.11 Lemma. If /zl < 1 and p > 0 then /1 - Ep(z) I < IzjP+ 1.
Proof. We may restrict our attentiol) to the case where p > 1. For a fixed
p let
00
Ep(z) = 1 + L akz k
k=l
be its power series expansion about z = O. By differentiating the power
series as well as the original expression for Ep(z) we obtain
00
E;(z) = Lka k z k - 1
k=l
= - zP exp (z + . . . +  )
Comparing the two expressions gives two pieces of information about the
coefficients a k . First, a 1 = a2 = . . . = a p = 0; second, since the coefficients
of the expansion of exp (z + · · · +  ) are all positive, ak < 0 for k > p + 1.
Thus, lakl = -a k for k > p+ 1; this gives
00
o = E p (l) = 1 + L ak,
k=p+l
or
00
L lakl =
k =p + 1
00
L ak = 1.
k =p + 1

Weierstrass Factorization Theorem
169
Hence, for Izi < I,
IEp(z)-11 = I L akzkl
k =p -r 1
00
= /ZIP+l I L akzk-p-11
k=p+l
00
< IzIP+ 1 L jakl
k=p+l
= IzIP+ 1
which is the desired inequality. II
Before solving the general problem of finding a function with prescribed
zeros, the problem for the case where G = C will be solved. This is done for
several reasons. In a later chapter on entire functions the specific information
obtained when G is the whole plane is needed. Moreover, the proof of the
general case, although similar to the proof for C, tends to obscure the rather
simple idea behind the proof.
5.12 Theorem. Let {an} be a sequence in C such that lim lanl = 00 and an =F 0
for all n > 1. (This is not a sequence of distinct points; but, by hypothesis, no
point is repeated an infinite number of times.) If {Pn} is any sequence oj'integers
such that
5.13
i (  ) pn+l < 00
n= 1 I nl
for all r > 0 then
00
fez) = n EPn (z/a n )
n=1
converges in B(C). The function j' is an entire function with zeros only at the
points an. lj' z 0 occurs in the sequence {an} exactly m times then f has a zero
at z = z 0 of multiplicity m. Furthermore, if Pn = n - 1 then (5.13) "'ill be
sat isfied.
Proof Suppose there are integers Pn such that (5.13) is satisfied. Then,
according to Lemma 5.11,
Z Pn + 1 ( r ) pn + 1
II - Epn(zfa n ) I < an < lanl
whenever Izi < rand r < Ian'. For a fixed r > 0 there is an integer N such
that lanl > r for all n > N (because lim lanl = (0). Thus for each r > 0 the
series L 11-EpJz/a n )1 is dominated by the convergent series (5.13) on the
disk .8(0; r). This gives that L [1 - Epn(z/ an)] converges absolutely in H(C).
00
By Theorem 5.9, the infinite product n Ep"(z/a n ) converges in H(C).
n = I
To show that {Pn} can be found so that (5.13) holds for all r is a trivial

170 Compactness and Convergence
matter. For any r there is an integer N such that lanl > 2r for all n > N.
This gives that C; ) < t for all n > N; so if PII = n-l for all n, the tail
end of the series (5.13) is dominated by L (t)n. Thus, (5.13) converges. II
There is, of course, a great latitude in picking the integers Pn. If Pn were
bigger than 1l-1 we would have the same conclusion. However, there is an
advantage in choosing the Pn as small as possible. After all, the smaller the
integer Pn the more elen1entary the elementary factor Epn(z/a n ). As is evident
in considering the series (5.13), the size of the integers Pn depends on the rate
at which {Ian I } converges to infinity. This will be explored later in Chapter
XI.
5.14 The Weierstrass Factorization 1beorem. Let f be an entire function and
let {an} be the non-zero zeros of f repeated according to multiplicity; suppose
f has a zero at z=O of order mO (a zero of order m=O at z=O means
f(O) =1=0). Then there is an entire function g and a sequence of integers {Pn}
such that
fez) = z m e9(Z) D Epn ( :J ·
Proof According to the preceding theorem integers {Pn} can be chosen such
that
h(z) = zm D Epn (  )
has the same zeros as f with the same multiplicities. It follows that f(z)jh(z)
has removable singularities at z = 0, aI' a 2 ,... . Thus f/h is an entire
function and, furthermore, has no zeros. Since C is simply connected there
is an entire function g such that
f{z) = ef1(z)
h(z)
The result now follows. II
5.15 Theorem. Let G be a region and let {a j } be a sequence of distinct points
in G with no limit point in G; and let {m j } be a sequence of integers. Then
there is an analytic function f defined on G whose only zeros are at the points
a j ; furthermore, a j is a zero off of multiplicity m j .
Proof. We begin by showing that it suffices to prove this theorem for the
special case where there is a number R > 0 such that
5.16
{z: Izi > R} c G and lajl < R for allj > 1.
It must be shown that with this hypothesis there is a function f in B(G)
with the a j'S as its only zeros and m j = the multiplicity of the zero at z = a j;

Weierstrass Factorization Theorem
and with the further property that
171
5.17
lim I(z) = 1.
z-' 00
In fact, if such ani can always be found for a set satisfying (5.16), let G t be
an arbitrary open set in C with {oe j} a sequence of distinct points in G 1 with
no limit point, and let {m j} be a sequence of integers. Now if B(a; r) is a
disk in G 1 such that oe j f# B(a; r) for all j > 1, consider the Mobius trans-
formation Tz = (z-a)-l. Put G = T(G 1 ); it is easy to see that G satisfies
condition (5.16) where a j = Toe j = (oe j - a) -1. If there is a function I in
H(G) with a zero at each a j of multiplicity m j, with no other zeros, and such
thatfsatisfies (5.17); then g(z) = I(Tz) is analytic in G 1 - {a} with a remov-
able singularity at z = a. Furthermore, g has the prescribed zero at each tX J
of multiplicity m j.
So, assume that G satisfies (5.16). Define a second sequence {zn} consisting
of the points in {a j }, but such that each a j is repeated according to its multi-
plicity m j. Now, for each n > 1 there is a point W n in C - G such that
Iwn-znl = d(zm C-G).
Notice that the hypothesis (5.16) excludes the possibility that G = C unless
the sequence {a j} were finite. In fact, if {a j} were finite the theorem could
be easily proved so it suffices to assume that {a j} is infinite. Since fa jf < R
for allj and {a j} has no limit point in G it follows that C - G is non-empty as
well as compact. Also,
lim IZn - wnl = o.
Consider the functions
( Zn-W n ) .
En ,
Z-W n
each has a simple zero at z = Zn. It must be shown that the infinite product
of these functions converges in H(G).
To do this let K be a compact subset of G so that d(C - G, K) > O. For
any point z in K
zn-Wn
Z-W n
< IZn-wnl [d(w m K)]-1
< IZn-wnl [d(C-G, K)]-l
It follows that for any S, 0 < S < 1, there is an integer N such that
Zn-Wn < S
Z-W n
for all Z in K and n > N. But then Lemma 5.11 gives that
( z - W )
En n n _ 1 < 8 n + 1
Z-W n
5.18

172 Compactness and Convergence
for all z in K and n > N. But this gives that the series
 [En( n ) - IJ
converges uniformly and absolutely on K. According to Theorem 5.9
/(z) = fr En ( Zn Wn )
n= I Z W n
converges in H(G), so thatfis an analytic function on G. Also, Theorem 5.9
implies that the points {a j} are the only zeros off and m j is the order of the
zero at Z = aj (because a j occurs m j times in the sequence {zn}). To show
that Iimf(z) = 1, let E > 0 be an arbitrary number and let RI > R (R 1 will
zoo
be further specified shortly). If Izi > Rl then, because IZnl < Rand W n E C-
G c B(O; R),
/ zn-Wn 2R
I < ·
Z-W n - R1-R
So, if we choose RI > R so that 2R < 8(R 1 - R) for some 8, 0 < 8 < 1,
I I ( Zn-Wn )
(5.18) holds for Z > R 1 and for all n > 1. In particular, Re En z- W n > 0
for all nand Izl > R 1 ; so that
5.19
1/(z)-I/ = exp ( log En ( ;: )) - 1
is a meaningful equation. On the other hand (5.3) and (5.18) give that
i log En ( ZnWn ) < i log En ( ZnWn )
n= 1 Z W n n= 1 Z W n
00 ( )
3 Zn-Wn 1
< -E -
- ;S 2 n Z-W n
00 3
<  _ 8n + I
- L2
n=l
3 8 2
---
21-8
for Izi > RI. If we further restrict 8 so that le w -11 < E whenever
3 ( 82 )
I w l<2 1- 8'

Weierstrass Factorization Theorem 173
then equation (5.19) gives that Ij'(z)-ll < E whenever Izl > RI. That is,
limf(z) = 1. II
Z ----+ 00
One of the more interesting results that follows from the above theorem
says (in algebraic terms) that M(G) is the quotient field of the integral
domain H(G). Avoiding this language the result is as follows.
5.20 Corollary. If f is a meromorphic function on an open set G then there are
analytic functions g and h on G such that f = g/h.
Proof Let {a j} be the poles of f and let m j be the order of the pole at a j .
According to the preceding theorem there is an analytic function h with a
zero of multiplicity m j at each z = a j and with no other zeros. Thus hf has
removable singularities at each point a j. It follows that g = hf is analytic in
G.II
Exercises
1. Show that Il (1 +zn) converges absolutely iff Il (1 + IZnD converges.
log(I+z)
2. Prove that lim = 1.
z-+o z
3. Let f and g be analytic functions on a region G and show that there are
analytic functions.!I' gt, and h on G such thatf(z) = h(z)fl(Z) and g(z) =
h(z)g 1 (z) for all z in G; and fl and g t have no common zeros.
4. (a) Let 0 < lal < 1 and Izi < r < 1; show that
a+lal z I+r
<-
(l-az)a - l-r
(b) Let {an} be a sequence of complex numbers with 0 < lanl < 1 and
L (I-lanD < 00. Show that the infinite product
B(z) = fr lanl ( anZ )
n = I an 1 - anz
converges in H(B(O; 1» and that IB(z)/ < 1. What are the zeros of B?
(B(z) is called a Blaschke Product.)
(c) Find a sequence {an} in B(O; 1) such that I (I-Ianl) < 00 and every
number ei8 is a ]imit point of {an}.
(f)
5. Discuss the convergence of the infinite product T1  for p > O.
Il=l n
6. Discuss the convergence of the infinite products Il [I +  ] and III +  .
00 ( 1 ) 1
7. Show that il I - n 2 = 2. ·
8. For which values of Z do the products TI (1- zn) and TI (I + z2n) converge?
Is there an open set G such that the product converges uniformly on each
compact subset of G? If so, give the largest such open set.

174 Compactness and Convergence
9. Use Theorem 5.15 to show there is an analytic functionfon D = {z: Izi
< I} which is not analytic on any open set G which properly contains D.
10. Suppose G is an open set and {J;,} is a sequence in H(G) such that
fez) = nfn(z) converges in B(G). (a) Show that
kl (Z) JJ/(Z)J
converges in B(G) and equals f'(z). (b) Assume that f is not the identically
zero function and let K be a compact subset of G such that fez) '# 0 for all
z in K. Show that
f'(z) =  f(z)
fez) .£i In(z)
and the convergence is uniform over K.
11. A subset f of B(G), G a region, is an ideal iff: (i) f and g in f implies
af+bg is in f for all complex numbers a and b; (ii)fin f andg any function in
B(G) impIiesfg is in f. J is called a proper ideal if f '# (0) and f '# R(G);
f is a maximal ideal if f is a proper ideal and whenever J is an ideal with
f c J then either J = f or J = H(G); f is a prime ideal if whenever
f and g e B(G) and .rg E f then either f e f or g E f. If f E B(G) let (f)
be the set of zeros offcounted according to their multiplicity. So «z-a)3)
= {a, a, a}. If f/ c B(G) then (f/) = (\ {(f):fEf/}, where the zeros
are again counted according to their multiplicity. So if f/ = {(z-a)3 (z-b),
(z-a)2} then (f/) = {a, a}.
(a) Iff and g E H(G) then f divides g (in symbols, j'/g) if there is an h in
R(G) such that g = fh. Show that fig iff (f) c (g).
(b) If 9'c B(G) and 9'* D thenfis a greatest common divisor of 9'if: (i)
fig for each g in 9'and (ii) whenever hlg for each g in 9', hlf. In symbols,
f = g.c.d.9'. Prove that f = g.e.d.9'. iff fL(f) = fl'(!/) and show that
each non-empty subset of B( G) has a g.c. d.
(c) If A c G let f(A) = {fe B(G): (f) :::> A}. Show that f(A) is a
closed ideal in B(G) and f(A) = (0) iff A has a limit point in G.
(d) Let a E G and f = f( {a}). Show that f is a maximal ideal.
(e) Show that every maximal ideal in B(G) is a prime ideal.
(f) Give an example of an ideal which is not a prime ideal.
12. Find an entire function f such that fen + in) = 0 for every integer n
(positive, negative or zero). Give the most elementary example possible (i.e.,
choose the Pn to be as small as possible).
13. Find an entire function f such that f(rn + in) = 0 for all possible integers
n1, n. Find the most elementary solution possible.
6. Factorization of the sine function
In this section an application of the Weierstrass Factorization Theorem
to sin TTZ is given. If an infinite sum or product is followed by a prime

Factorization of the sine function 175
(apostrophe) (i.e., L' or TI '), then the sum or product is to be taken over all
the indicated indices fl except n = O. For example,
00 00 00
I' an = L a_ n + Lan.
n=-oo n=1 n=1
The zeros of sin TTZ = i (e inz - e - inz) are precisely the integers ; moreover,
each zero is simple. Since
n GY < 00
for all r > 0, one can (5.13) choose Pn = 1 for all n In the Weierstrass
Factorization Theorem. Thus
sin TTZ = [exp g(z)] z JJ (1 - ) ez/n;
or, because the terms of the infinite product can be rearranged,
sin 7T:: = [exp g(z)] :: D (1 - :: )
for some entire function g(z). If fez) = sin TTZ then, according to Theorem 2.!,
6.1
f'(z)
7T cot TTZ = --
fez)
00
' ( ) 1 L 2z
=gz+-+ 22
z z -n
n=1
and the convergence is uniform over compact subsets of the plane that
contain no integers (actually, a small additional argument is necessary to
justify this-see Exercise 5.10). But according to Exercise V. 2.8,
1 00 2z
71' cot TTZ = - +  2 2
Z  Z -n
n=1
for z not an integer. So it must be that g is a constant, say g(z) = a for all z.
It follows from (6.1) that for 0 < Izi < 1
sin 7TZ = e a 11 00 ( 1 _ z: ) .
7TZ 71' n
n= 1
6.2
Letting z approach zero gives that e a = 71'. This gives the following:
sin TTZ = TTZ Ii ( 1 - : )
n=1
and the convergence is uniform over compact subsets of C.

176
Exercises
Compactness and Convergence
1. Show that cos TTZ = D [I - (2n421)2 J ·
2. Find a factorization for sinh z and cosh z.
( 7TZ ) ( 7TZ ) n( I+(-I)nZ )
3. Show that cos 4 - sin 4 = n 1 2n - 1 ·
. , 7T n oo (2n )2
4. Prove Walhs s formula: - = (2 ) (2 ·
2 n=1 n-I n+l)
7. The gamma/unction
Let G be an open set in the plane and let {In} be a sequence of analytic
functions on G. If {In} converges in H(G) to f and f is not identically zero,
then it easily follows that {f,,} converges to f in M (G). Since d(z l' z 2) =
d ( ,  ) , where d is the spherical metric on Coo (see (3.1 )), it follows that
Zl Z2
{ I } 1 . . { I }
- converges to - in M(G). It IS an easy exercIse to show that - con-
/" f In
verges uniformly to ! on any compact set K on which no In vanishes. (What
f
does Hurwitz's Theorem have to say about this situation). Since, according
to Theorem 5.12, the infinite product
D (I + ) e- z / n
converges in B(C) to an entire function which only has simple zeros at
z = - I, - 2, . . . , the above discussion yields that
7.1
D(I + )-lez/n
converges on compact subsets of C - { - 1, - 2, . . .} to a function with
simple poles at z = - 1, - 2, . . . .
7.3
7.2 Definition. The gamma function, fez), is the meromorphic function on C
with simple poles at z = 0, - I, . . . defined by
r(z) = eYZ fI ( 1 + -= ) -le z / n ,
 n=1 n
where y is a constant chosen so that r( I) = 1.

The gamma function 177
The first thing that must be done is to show that the constant y exists;
this is an easy matter. Substituting z = 1 in (7.1) yields a finite number
00 ( 1 ) -1
C = D 1 + -,:; e 1 !n
which is clearly positive. Let y = log c; it follows that with this choice of y,
equation (7.3) for z = 1 gives f(l) = 1. This constant y is called Euler's
constant and it satisfies
7.4
00 ( 1 ) -1
e Y = D 1 + -,:; e 1 !n
Since both sides of (7.4) involve only real positive numbers and the real
logarithm is continuous, we may apply the logarithm function to both sides
of (7.4) and obtain
y =  log [(1 +  r 1 e 1 !k ]
=  [  - IOg(k+l)+logk ]
k=l k
- lim * [  - log (k+ l)+log k ]
noo 6-1 k
- lim [( 1 +  + ... + ! ) - 10g(n+l) ] .
n-+oo 2 n
Adding and subtracting log n to each term of this sequence and using the
fact that lim log ( n: I ) = 0 yields
7.5 y = ! [(1 +  + · · · + n - log n l
This last formula can be used to approximate y. Equation (7.5) is also
used to derive another expression for f(z). From the definition of f(z) it
follows that
e - }'Z n ( ) - 1
r(z) =  lim TI 1 +  ez!k
n-+oo k= 1 k
- }'Z n k z/ k
e TI e
= - lim -
z n-+oo k=l z+k
_ lim e-yzn! exp ( Z ( l +!-+ . . . +  ))
n -+ 00 z( Z + 1) . . . (z + n) 11

178
However
Compactness and Convergence
e - 1 Z exp [ ( I + 1: + · .. + )z ] = n Z exp [z( - y + I + 1: + .. · +  - log n ) l
So that the following is obtained
7.6 Gauss's Formula. For z =1= 0, -1, . . .
. n ! n Z
f(z) = hm
n-+oo z(z+ I) . . . (z+n)
The formula of Gauss yields a simple derivation of the functional equation
satisfied by the gamma function.
7.7 Functional Equation. For z =1= 0, -1,. . .
f(z+ I) = zf(z)
To obtain this important equation substitute z + 1 for z in (7.6); this
gl ves
n' n Z + 1
f(z+ 1) = lim .
n-+oo (z+ 1) . . . (z+n+ 1)
= z Ii m [ /1 ! n Z ] [ n ]
n -+ 00 z( z + I) . . . (z + n) z + n + 1
= zr(z)
. . ( n )
SInce hm = 1.
z+n+l
Now consider f(z+2);wehave f(z+2) = f«z+l)+I) = (z+l)f(z+l)
by the functional equation. A second application of (7.7) gives f(z+2) =
z(z+ l)f(z). In fact, by reiterating this procedure
7.8
f(z+n) = z(z+I)... (z+n-l)f(z)
for n a non negative integer and z =1= 0, - 1, . . . . In particular setting z = 1
gi ves that
7.9
f(n+ 1) = n!
That is, the r function is analytic in the right half plane and agrees with the
factorial function at the integers. We may therefore consider the gamma
function as an extension of the factorial to the complex plane; alternately,
if z =1= - 1, - 2, . . . then letting z! = f(z + I) is a justifiable definition of z!.
As has been pointed out, f has simple poles at z = 0, - 1, . . . ; we wish
to find the residue of f at each of its poles. To do this recal1 from Proposition
V. 2.4 that
Res (f; -n) = lim (z+n)f(z)
z-+ - n

The gamma function
for each non-negative integer n. But from (7.8)
(z+n)r(z) = f(z+n+ 1) .
z(z+ I) . . . (z+n-l)
So letting z approach - n gives that
179
7.10
( - l)n
Res (r; - n) = " n > O.
n.
According to Exercise 5.10 we can calculate r' jr by
7.11
00
r'(z) 1  z
f(z) = -y - ; + 6 n(n+z)
for z i= 0, - 1, . . . and convergence is uniform on every compact subset
of C - {O, -1,...}. It follows from Theorem 2.1 that to calculate the
derivative of r'jr we may differentiate the series (7.11) term by term. Thus
when z is not a negative integer
7.12
( r'(z» ) ' 1 00 1
f(z) = Z2 + 6 (n+z)2 ·
At this time the reader may well be asking when this process will stop.
Will we calculate the second derivative of r'/r? The answer to this question
is no. The answer to the implied question of why anyone would want to
derive formulas (7.11) and (7.12) is that they allow us to characterize the
gamma function in a particularly beautiful way.
Notice that the definition of r(z) gives that rex) > 0 if x > o. Thus,
log rex) is weB defined for x > 0 and, according to formula (7.12), the
second derivative of log rex) is always positive. According to Proposition
VI. 3.4 this implies that the gamma function is logarithmically convex on
(0, (0); that is, log rex) is convex there. It turns out that this property
together with the functional equation and the fact that r(l) = 1 completely
characterize the gamma function.
7.13 Bohr-Mollerup Theorem. Let f be a function defined on (0, (0) such that
f(x) > 0 for all x > o. Suppose that f has the follo}ving properties:
(a) log f(x) is a convex function;
(b) f(x+ 1) = xf(x) for all x;
(c) f( 1) = 1.
Then j'(x) = rex) for all x.
Proof. Begin by noting that since f has properties (b) and (c), the function
also satisfies
7.14
f(x+n) = x(x+ 1) . . . (x+n-I)f(x).
for every non- negative integer n. So if f(x) = rex) for 0 < x < I, this

180 Compactness and Convergence
equation will give that f and r are everywhere identical. Let 0 < x < 1 and
let n be an integer larger than 2. From Exercise VI. 3.3
f
logf(n-l)-logf(n) < logf(x+n)-log,f(n) < logf(n+ l)-logf(n)
(n-l)-n - (x+n)-n - (n+ 1)-n
Since (7.14) holds we have that j'(m) = (m - I)! for every integer m > 1.
Thus the above inequalities become
logf(x+n)-log (n-l)!
- log (n - 2) ! + log (n - I)! < < log n! - log (n - 1) ! ;
x
or
xlog(n-l) < logf(x+n)-log(n-l)! < xlogn.
Adding log (n - I)! to each side of this inequality and appJying the
exponential (exp is a monotone increasing function and therefore preserves
inequalities) gives
(n-l)X (n-l)! < f(x+n) < n X (n-l)!
Applying (7.14) to calculate f(x + n) yields
(n - I)X (n - 1) ! n X (n - 1) !
< f(x) <
x( x + 1) . . . (x + n - 1) - - x( x + 1) . . . (x + n - 1)
n X n! [ X + n J
= x(x+ 1) . . . (x+n) -;;- ·
Since the term in the middle of this sandwich, f(x), does not involve the
integer n and since the inequality holds for all integers n > 2, we may vary
the integers on the left and right hand side independently of one another
and preserve the inequality. In particular, n + 1 may be substituted for n on
the left while allowing the right hand side to remain unchanged. This gives
nXn! nXn! [ x+n J
< f(x) < -
x( x + 1) . . . (x + n) x( x + 1) . . . (x + n) n
for all n > 2 and x in [0, 1). Now take the limit as n  00. Since lim ( x:n )
= 1, Gauss's formula implies that rex) == f(x) for 0 < x < 1. The result
now follows by applying (7.14) and the Functional Equation. II
7.15 Theorem. If Re z > 0 then
(1)
r(z) = J e-tt z - 1 dt
o
The integrand in 7.15 behaves badly at t == 0 and t == 00, so that the
meaning of the above equation must be explicitly stated. Rather than give
a formal definition of the convergence of an improper integral, the properties
of this particular integral are derived in Lemma 7.16 below (see also Exercise
2.2).

The gamma function
7.16 Lemma. Let S = {z: a < Rez < A} where 0 < a < A < 00.
(a) For every € > 0 there is as> 0 such thatJor all z in S
181
p
J e - t t Z - 1 dt < E
ex
whenever 0 < et < fJ < S.
(b) For every € > 0 there is a number K such that for all z in S
fJ
J e - t t Z - 1 dt < E
ex
whenever fJ > et > K.
Proof To prove (a) note that if 0 < t < 1 and z is in S then (Re z-I) log
t < (a-I) log t; since e- t < 1,
Ie - t t Z - 11 < t Re z - 1 < t a - 1 .
So if 0 < et < fJ < 1 then
fJ fJ
J e - t t Z - 1 dt < J t a - 1 dt
ex ex
1
= - (fJa - eta)
a
for all z in S. If € > 0 then we can choose S, 0 < S < 1, such that a- 1 (fJa_ et a)
< € for let - 13/ < S. This proves part (a).
To prove part (b) note that for z in Sand t > 1, /t Z - 1 / < t A -1. Since
t A -1 exp ( - }t) is continuous on [1, 00) and converges to zero as t -? 00,
there is a constant c such that t A - 1 exp ( - tt) < c for all t > 1. This gives
that
/e- t t Z - 1 / < ce- tt
for aU z in Sand t > 1. If 13 > et > 1 then
fJ fJ
J e- t t z - 1 dt < C J e--!t
ex ex
= 2c(e -fex - e -tfJ).
Again, for any € > 0 there is a number K > 1 such that /2c(e- tex -e- tP )1 < €
whenever et, fJ > K, giving part (b). II
The results of the preceding lemma embody exactly the concept of a
uniformly convergent integral. In fact, if we consider the integrals
1
I e- t t z - 1 dt
ex

182
Compactness and Convergence
for 0 < IX < 1, then part (a) of Lemma 7.16 says that these integrals satisfy
a Cauchy criterion as IX  O. That is, the difference between any two will be
arbitrarily small if IX and f3 are taken sufficiently close to zero. A similar
interpretation is available for the integrals
(%
I e-tt Z - 1 dt
1
for IX > 1. The next proposition formalizes this discussion.
7.17 Proposition. JfG = {z: Re z > O} and
n
f,,(z) = I e-tt z - 1 dt
1/n
for n > 1 and z in G, then each In is analytic on G and the sequence is con-
vergent in H(G).
Proof Think Ofh(Z) as the integral of cp(t, z) = e- t t z - 1 along the straight line
segment [, nJ and apply Exercise IV. 2.2 to conclude that f" is analytic.
Now if K is a compact subset of G there are positive real numbers a and A
such that K c: {z: a < Re z < A}. ,Since
tin m
fm(z)-f,,(Z) = I e-tt z - 1 dt + I e-tt z - 1 dt
11m n
for m > n, Lemma 7.16 and Lemma 1.7 imply that {In} is a Cauchy sequence
in H(G). But H(G) is complete (Corollary 2.3) so that {In} must converge. II
If f is the limit of the functions {In} from the above proposition then
define the integral to be this function. That is,
7.18
00
fez) = I e-tt z - 1 dt, Re z > o.
o
To show that this functionf(z) is indeed the gamma function for Re z > 0
we only have to show that f'(x) = r(x) for x > 1. Since [1, (0) has limit
points in the right half plane and both f and r are analytic then it follows
thatfmust be r (Corollary IV. 3.8). Now observe that successive performing
of integration by parts on (1- t/n)ntx-t yields
n
f( t ) n n! n X
1 - - t X - 1 dt =
n x(x+ 1) . . . (x+n)
o
which converges to r(x) as n  00 by Gauss's formula. If we can show that
the integral in this equation converges to S e-tt x - 1 dt = f(x) as n  00 then

The gamma function 183
Theorem 7.15 is proved. This is indeed the case and it follows from the
following lemma.
7.19 Lemma. (a) {( 1 + y} converges to e Z in H(C).
(b) Ift > Othen(l-Y < e-tfora/ln > t.
Proof (a) Let K be a compact subset of the plane. Then Izi < n for all z in
K and n sufficiently large. It suffices to show that
lim 1l log ( 1 + -= ) = Z
n-+ 00 n
uniformly for z in K by Lemma 5.7. Recall that
00 }Vk
log(l+w) = L (-1)k-1k
k=1
for I\VI < ]. Let Il > Izl for all z in K; if z is any point in K then
Il lo g ( 1 +  ) = z _ ! Z2 + ! Z3 _
n 2 n 3 n 2 · .. ·
So
7.20 n log ( 1 + ) - z = { -  G) +  GY - · · .J ;
taking absolute values gives that
( ) 00 1 k-l
n log 1 + n  - z < Izi L - :
k =2 k n
00 Z k
< Izi L 
k=l
= Izl 2 1
n 1 -Izlnl
R 2
<
-1l-R
where R > Izi for an z in K. If n  00 then this difference goes to zero
uniformly for z in K.
(b) Now let t > 0 and substitute - t for z in (7.20) where t < n. This gives
( t ) 00 1 ( t ) k-l
n log 1 - - + t = - t L - - < 0
n k=2 k n

184
Thus
Compactness and Convergence
n log (I - ) < - t;
and since exp is a monotone function part (b) is proved. II
Proof of Theorem 7.15. Fix x > 1 and let € > O. According to Lemma 7.16 (b)
we can choose K > 0 such that
7.21
r
f e- t t x - 1 dt < 
K
whenever r > K. Let n be any integer larger than K and letfn be the function
defined in Proposition 7.17. Then
n 1/n
fn(x) - f(1 - y t x - 1 dt = - f(1 - y t x - 1 dt +
o 0
n
f[e- t - (I + YJ t x - 1 dt
J/n
Now by Lemma 7.19 (b) and Lemma 7.16 (a)
7.22
tIn tIn
f (I -  Y t X - 1 dt < f e - t t X - 1 dt < 
o 0
for sufficiently large n. Also, if n is sufficiently large, part (a) of the preceding
lemma gives
(I - Y
-t
-e
€
<-
- 4MK
for t in [0, K] where M = So t x - 1 dt. Thus
7.23
K
f[e- t - (I - YJ t x - 1 dt
1/n
€
<-
-4
Using Lemma 7.19 (b) and (7.21)
n n
f[e- t - (I - YJ t x - 1 dt < 2 f e- t t x - 1 dt < 
K K
for n > K. If we combine this inequality with (7.22) and (7.23), we get
n
fn(x) - f ( 1
o
t ) n
-  t x - I dt < €

The gamma function
for n sufficiently large. That is
185
n
0= Iim[fnC X ) - f(l - YtX-1 dtJ
o
. [ n ! n X ]
= hm f,(x) -
n x( x + 1) . . . (x + n)
= f(x) - r(x).
This completes the proof of Theorem 7.15. II
As an application of Theorem 7.15 and the fact that f(1) = .;; (Exercise
2) notice that
00
.J 'TT = f e-tr t dt.
o
Performing a change of variables by putting t = S2 gives
00
.J; = f e- s2 s- t (2s) ds
o
00
= 2 f e- s2 ds
o
That is,
00
f -s2 d  1T
e s=-
2
o
This integral is often used in probability theory.
Exercises
1. Show that 0 < y < 1. (An approximation to y is .57722. It is unknown
whether y is rational or irrational.)
2. Show that r(z) r(l-z) = 1T CSC 1TZ for z not an integer. Deduce from this
that r(!) = ;.
3. Show:  1T r(2z) = 2 2z - 1 r(z) r(z+!). (Hint: Consider the function r(z)
r(z+!) r(2z)-1.)
4. Show that log r(z) is defined for z in C -( - 00, 0] and that
Iogr(z) = -Iogz-yz - f [ log ( 1 +  ) -  J .
n= 1 n n
5. Letf be analytic on the right half plane Re z > 0 and satisfy: f(l) = I,
. j(z+n)
f(z+ l) = zf(z), and hm Zf() = 1 for all z. Show thatf = r.
n-+oo n n

186
6. Show that
Compactness and Convergence
00
r(z) = f (-It + f e-ttZ-ldt
n=O n!(z+n)
1
for z =1= 0, -1, -2,... (not for Re z > 0 alone).
7. Show that
00 00
I sin (t2) dt = I CDS (t2) dt = -hI 1- 1T .
o 0
8. Let u > 0 and v > 0 and express r(u) rev) as a double integral over the
first quadrant of the plane. By changing to polar coordinates show that
1[/2
r(u) r(v) = 2r(u + v) I (CDS 0)2U -I (sin 0)2 V - 1 dO.
o
The function
r(u) rev)
B(u, v) = r(u+v)
is called the beta jii/Iction. By changes of variables show that
1
B(u, v) = f.t U - 1 (1- ty-I dt
o
00
f u-1
t
= dt
(1 + t)u+v
o
Can this be generalized to the case when u and v are complex numbers with
positive real part?
9. Let (Xn be the volume of the ball of radius one in n (n > 1). Prove by
induction and iterated integrals that
1
OC n = 2OC n -l I (1- t 2 )<n-l)/2 dt
o
10. Show that
7T n / 2
(X =
n (n/2)r(n/2)
where (Xn is defined in problem 9. Show that if n = 2k, k > 1, then (Xn = 7T k /k!
11. The Gaussian psi function is defined by
r'(z)
'f(z) = r(z)
(a) Show that 'Y is meromorphic in C with simple poles at z = 0, -1, . . ·
and Res ('Y; -n) = -1 for n > O.

The Riemann zeta function 187
(b) Show that 'Y(I) = -yo
I
(c) Show that 'Y(z+ 1) - 'Y(z) = - .
z
(d) Show that 'Y(z) - 'Y( 1 - z) = -71' cot 71'z.
(e) State and prove a characterization of 'Y analogous to the Bohr-
Mollerup Theorem.
8. The Riemann zeta function
Let z be a complex number and n a positive integer. Then Inzi = lexp
(z log 11)1 = exp (Re z log n). Thus
11 11
L /k-Zj = L exp(-Rezlogk)
k=l k=l
11
= L k - Re Z
k=l
So if Re z > 1 + E then
11 11
L /k- z / < L k-(l +£);
k=l k=l
that is, the series
00
L n- z
n=1
converges uniformly and absolutely on {z: Re z > I + E}. In particular, this
series converges in H( {z: Re z > I}) to an analytic function '(z).
8.1 Definition. The Riemann zeta function is defined for Re z > 1 by the
equation
00
'(z) = L
n=1
-z
n .
The zeta function, as well as the gamma function, has been the subject
of an enormous amount of mathematical research since their introduction.
The analysis of the zeta function has had a profound effect on number
theory and this has, in turn, inspired more work on ,. In fact, one of the
most famous unsolved problems in Mathematics is the location of the zeros
of the zeta function.
We wish to demonstrate a relationship between the zeta function and
the gamma function. To do this we appeal to Theorem 7.15 and write
00
r(z) = f e-tt z - 1 dt
o

188 Compactness and Convergence
for Re z > o. Performing a change of variable in this integral by Jetting
t = nu gives
00
r(z) = n Z I e-ntt z - t dt;
o
that is
00
n-Zr(z) = I e-ntt z - t dt.
o
If Re z > 1 and we sum this equation over all positive n, then
8.2
00
'(z)r(z) = L n-Zr(z)
n=l
00 00
= L I e-ntt z - t dt.
n= 1 0
We wish to show that this infinite sum can be taken inside the integral sign.
But first, an analogue of Lemma 7.16.
8.3 Lemma. (a) Let S = {z: Re z > a} where a > 1. If € > 0 then there is
a number S, 0 < S < 1, such that jor all z in S
fJ
I (e t -1) - t t Z - t dt < €
IX
whenever S > f1 > eX.
(b) Let S = {z: Re z < A} where - 00 < A < 00. If € > 0 then there is
a number K > 1 such that for all z in S
fJ
I (e t - 1) - t t Z - t dt < €
IX
whenever f1 > eX > K.
Proof. (a) Since e t -1 > t for all t > 0 we have that for 0 < t < 1 and z in S
/ ( e t _ 1) - 1 t Z - 1/ < t a - 2.
Since a > 1 the integral Jb t a - 2 dt is finite so that S can be found to satisfy (a).
(b) If t > 1 and z is any point in S then, as in the proof of Lemma 7.16 (b),
there is a constant c such that
/(e t _l)-lt Z - 1 / < (e t _l)-lt A - 1 < celt (et_I)-l.
Since elt(et_I)-l is integrable on [I, (0) the required number K can be
found. II

The Riemann zeta function 189
8.4 Corollary. (a) If S = {z: a < Re z < A} where I < a < A < 00 then
the integral
00
f (e'-1)- l t Z - 1 dt
o
converges uniformly on S.
(b) If S = {z: Re z < A} where - 00 < A < 00 then the integral
00
f (e' - 1) - 1 t Z - 1 d t
1
converges uniformly on S.
8.5 Proposition. For Re z > 1
00
{(z)r(z) = f (e' -1) -1 t z - I dt
o
Proof According to the above corollary this integral is an analytic function
in the region {z: Re z > I}. Thus, it suffices to show that '(z)r(z) equals this
integral for z == x > 1.
From Lemma 8.3 there are numbers ex and f3, 0 < ex < f3 < 00, such that:
IX
f (e' - 1) - 1 t X - 1 dt <  '
o
00
f (e' -1) - 1 t X - 1 dt <  .
{3
Since
n 00
L e - kt < L e - kt = (e t - 1) - 1
k=l k=l
for all n > 1,
IX
; f e- n 't x - 1 dt < ,
o
00
; f e- n 't x - 1 dt <  ·
{3
U sing equation (8.2) yields
00
{(x)r(x) - f (e' -1) -I t x - I dt
o
{3
- f (e' -1) - 1 t X - 1 dt
IX
00 {3
< € + n1 f e- n 't x - 1 dt
ex

8.6
190 Compactness and Convergence
But L e- nt converges to (e t _1)-1 uniformly on [0:, ,8], so that the right hand
side is exactly €. II
We wish to use Proposition 8.5 to extend the domain of definition of , to
{z: Re z > -I} (and eventually to all C). To do this, consider the Laurent
expansion of (e Z -1) -1 ; this is
111 00
=---+ az"
eZ-1 z 2 61"
for some constants aI' a 2 ,. . . . Thus [(e t _l)-l-t- l ] remains bounded in a
neighborhood of t = O. But this implies that the integral
1
f ( 1 - ! ) tZ - 1 dt
e t - 1 t
o
converges uniformly on compact subsets of the right half plane {z: Re z > O}
and therefore represents an analytic function there. Hence
1 00
8.7 '(z)r(z) = f( / - ! ) tz-l dt+(z-I)-1 + f t:-l dt,
e-l t e-l
o 1
and (using Corollary 8.4(b)) each of these summands, except (z -1) -1, is
analytic in the right half plane. Thus one may define '(z) for Re z > 0 by
setting it equal to [r(z)] - 1 times the right hand side of (8.7). In this manner
, is meromorphic in the right half plane with a simple pole at z = 1 (L: n- 1
diverges) whose residue is 1.
Now suppose 0 < Re z < 1; then
00
(Z-l)-1 = - f t z - 2 dt.
1
Applying this to equation (8.7) gives
8.8
00
(z)r(z) = f ( etl - D t z - 1 dt,O < Re z < 1.
o
Again considering the Laurent expansion of (e Z -1) -1 (8.6) we see that
[(e t -1) -1 - t- 1 +t] < ct for some constant c and all t in the unit interval
[0, 1]. Thus the integral
1
f( 1 1 1 ) % 1
- - + - t - dt
e t - 1 t 2
o
is uniformly convergent on compact subsets of {z: Re z > -I}. Also, since
limt ( l.- 1 ) =1
t 00 t e t - 1

The Riemann zeta function
there is a constant c' such that
191
c -
1 ) c'
<-
e t - 1 - t'
t > 1.
This gives that the integral
00
f ( 1 -  ) t% - 1 dt
e t - 1 t
1
converges uniformly on compact subsets of {z: Re z < I}. Using these last
two integrals with equation (8.8) gives
8.9
1 00
f ( 1 1 1 ) % 1 1 f ( 1 1 ) 1
'(z)r(z) = - - + - t - dt - - + - - t%- dt
e t - 1 t 2 2z e t - I t
o 1
for 0 < Re z < 1. But since both integrals converge in the strip - 1 < Re z
< 1 (8.9) can be used to define '(z) in {z: -1 < Re z < I}. What happens
at z ;:: O? Since the term (2z) -1 appears on the right hand side of (8.9) will
, have a pole at z = O? The answer is no. To define '(z) we must divide (8.9)
by r(z). When this happens the term in question becomes [2zr(z)]-1 =
[2 r(z + 1)] - 1 which is analytic at z = O. Thus, if , is so defined in the strip
{z: -1 < Re z < I} it is analytic there. If this is combined with (8.7),
'(z) is defined for Re z > -1 with a simple pole at z = 1.
Now if -1 < Re z < 0 then
00
f t Z - 1 dt =
1
1
z
inserting this in (8.9) gives
00
8.10 (z)r(z) = f Ct 1 - I + D t z - 1 dt, -1 < Re z < O.
o
But
1 1 1 ( e t + 1 ) i
e t -1 + 2 = 2 e t -1 = 2 cot (tit).
A straightforward computation with Exercise V. 2.8 gives
2 00 1
cot (tit) =  - 4it  2 2 2
It  t +4n 7r
for t '# O. Thus
( 1 _  +  )  _ 2  1
e t - 1 t 2 t - :S t 2 + 4n 2 7r 2

192
Applying this to (8.10) gives
Compactness and Convergence
8.11
00
(z)r(z) = 2 f ( 1 2 +n21T2 ) I Z dl
o
00
00 f t'Z
= 2 dt
 1 2 + 4n 2 1T2
o
00
00 f 'Z
= 2 L (21TnY-l / dl
n= 1 t + 1
o
00
f t'Z
= 2(27T)'Z-1'(I-z) 2 dt,
t + 1
o
for -I < Re z < O. (It is left to the reader to justify the interchanging of
the sum and the integral.) Now for x a real number with -1 < x < 0, the
change of variable s = t 2 gives (by Example V. 2.12)
8.12
00 00
f tX I f s t (x - 1)
dt = - ds
t 2 + 1 2 s+ 1
o 0
1
= 27T cosec [-!7T(I-x)]
1
= 2 7T sec (!7TX).
But Exercise 7.2 gives
1 r(l-x) r(l-x)
r(x) = 1T sin 1TX = 1T [2 sin (-t1TX) cas (!-1TX)]
Combining this with (8.11) and (8.12) yields the following.
8.13 Riemann's Functional Equation.
'(z) = 2(27T)'Z-1 r(l- z)'(I- z) sin (-!7TZ)
for - 1 < Re z < o.
Actually this was shown for x real and in ( - 1, 0); but since both sides
of (8.13) are analytic in the strip -1 < Re z < 0, (8.13) follows. The same
type of reasoning gives that (8.13) holds for -I < Re z < 1 (what happens
at Z' = o?). But we wish to do more than this. We notice that the right hand
side of (8.13) is analytic in the left hand plane Re z < o. Thus, use (8.13) to
extend the definition of '(z) to Re z < o. We summarize what was done as
follows.

The Riemann zeta function 193
8.14 Theorem. The zeta function can be defined to be meromorphic in the
plane with only a simple pole at z = 1 and Res (,; 1) = 1. For z =1= 1 , satisfies
Riemann's functional equation.
Since r( 1 - z) has a pole at z = 1, 2, . . . and since , is analytic at z =
2, 3, . . . we know, from Riemann's functional equation, that
8.15
'(1- z) sin (!1TZ) = 0
for z = 2, 3, . . . . Furthermore, since the pole of r(l- z) at z = 2, 3, . . .
is simple, each of the zeros of (8.15) must be simple. Since sin (!1TZ) = 0
whenever z is an even integer, '(1- z) = 0 for z = 3, 5, . . . . That is (z) =
o for z = - 2, - 4, - 6, . . . . Similar reasoning gives that , has no other
zeros outside the closed strip {z: 0 < Re z < I}.
8.16 Definition. The points z = - 2, - 4, . . . are called the trivial zeros of ,
and the strip {z: 0 < Re z < I} is called the critical strip.
We now are in a position to state one of the most celebrated open questions
in all of Mathematics. Is the following true?
The Riemann Hypothesis. If z is a zero of the zeta function in the critical
strip then Re z = t.
It is known that there are no zeros of , on the line Re z = 1 (and hence
none on Re z = 0 by the functional equation) and there are an infinite
number of zeros on the line Re z = t. But no one has been able to show that
, has any zeros off the line Re z = t and no one has been able to show that
all zeros must lie on the line.
A positive resolution of the Riemann Hypothesis will have numerous
beneficial effects on number theory. Perhaps the best way to realize the
connection between the zeta function and number theory is to prove the
following theorem.
8.17 Euler's Theorem. IfRe z > 1 then
(z) = Ii ( 1_1 -z )
n = 1 Pn
where {Pn} is the sequence of prime numbers.
Proof First use the geometric series to find
8.18
1  _ m%
1- -% = L Pn
Pn m= 0
for all n > 1. Now if n > 1 and we take the product of the terms (1- Pk %)-1
for 1 < k < n, then by the distributive law of multiplication and by (8.18),
8.19
n ( I ) 00
T1 1- -z = 2: n j - Z
k=l Pk j=l
where the integers n l , n 2 ,. .. are all the integers which can be factored as a

194 Compactness and Convergence
product of powers of the prime numbers PI' . . . , Pn alone. (The reason that
no number n.- Z has a coefficient in this expansion other than 1 is that the
J
factorization of nj into the product of primes is unique.) By letting n  00
the result is achieved. II
Exercises
1. Let g(z) = Z(Z-I)1T -tz'(z)r(tz) and show that g is an entire function
which satisfies the functional equation g(z) = g(l- z).
2. Use Theorem 8.17 to prove that L P; 1 = 00. Notice that this implies
that there are an infinite number of primes.
00
3. Prove that 2(Z) = "'" d(n) for Re z > 1, where d(n) is the number of
L n Z
n=l
divisors of n.
00
4. Prove that (z)(z-I) = "'" a(n) , for Re z > I, where a(n) is the sum of
L n Z
n=l
the divisors of n.
'(z-I)  cp(n)
5. Prove that (z) =;s 7 for Re z > I, where p(n) is the number of
integers less than n and which are relatively prime to n.
1  p.(n)
6. Prove that (z) = ;s 7 for Re z > I, where fL(n) is defined as follows.
Let n = pftp2 . . . pm be the factorization of n into a product of primes
PI' · · · , Pm and suppose that these primes are distinct. Let p.(I) = 1; if
k 1 = . .. = k m = I then let p.(n) = (-I)m; otherwise let p.(n) = o.
"(z)  A(n)
7. Prove that 1(z) = - L 7 for Re z > I, where A(n) = log p if n =
n=l
P'" for some prime P and m > 1; and A(n) = 0 otherwise.
8. (a) Let 7J(z) = "(z)/'(z) for Re z > 1 and show that lim (z-zo)7J(z) is
zzo
always an integer for Re z 0 > 1. Characterize the point z 0 (in its relation to ,)
in terms of the sign of this integer.
(b) Show that for € > 0
00
Re7J(l+€+it) = L A(n)n-{l+€}cos(tlogn)
n=I
where A(n) is defined in Exercise 7.
(c) Show that for all € > 0,
3Re 7J (1 +€)+4Re 7J (1 +€+it)+Re 7J (1 +€+2it) < o.
(d) Show that '(z) =1= 0 if Re z = 1 (or 0).

Chapter VIII
Runge's Theorem
In this chapter we will prove Runge's Theorem and investigate simple
connectedness. Also proved is a Theorem of Mittag-Leffler on the ex-
istence of meromorphic functions wi th prescribed poles and singular parts.
1. Runge's Theorem
In Chapter IV we saw that an analytic function in an open disk is given
by a power series. Furthermore, on proper subdisks the power series con-
verges uniformly to the function. As a corollary to this result, an analytic
function on a disk D is the limit in H(D) of a sequence of polynomials. We
ask the question: Can this be generalized to arbitrary regions G? The answer
is no. As one might expect the counter-example is furnished by G = {z:
o < Izi < 2}. If {Pn(z)} is a sequence of polynomials which converges to an
analytic function f on G, and y is the circle Izi = 1 then Jyl = lim JyPn == O.
But Z-l is in B(G) and JyZ-l '# O.
The fact that functions analytic on a disk are limits of polynomials is due
to the fact that disks are simply connected. If G is a punctured disk then the
Laurent series development shows that each analytic function on G is the
uniform limit of rational functions whose poles lie outside G (in fact at the
center of G). That is, each I in H (G) is the limit of a sequence of rational
functions which also belong to H(G). This is what can be generalized to
arbitrary regions, and it is part of the content of Runge's Theorem.
We begin by proving a version of the Cauchy Integral Formula. Unlike
the former version, however, the next proposition says that there exist
curves such that the formula holds; not that the formula holds for every
curve.
1.1 Proposition. Let K be a compact subset of the region G; then there are
straight line segments Y I' . . . , Yn in G - K such that for every function f in
H(G),
fez) =   f l(W) dw
k=1271'1 w-z
l'k
for all z in K. The line segments form a finite number of closed polygons.
Proof. Observe that by enlarging K a little we may assume that K =
(int K) -. Let 0 < 8 <  d (K, C - G) and place a "grid" of horizontal and
vertical lines in the plane such that consecutive lines are less than a
distance 8 apart. Let R I' .. . , Rm be the resulting rectangles that intersect K
195

196 Runge's Theorem
(there are only a finite number of them because K is compact). Also let aRJ
be the boundary of Rj' I < j < m, considered as a polygon with the
counter-clockwise direction.
If Z E Rj, 1 < j < m, then d(z, K) < 2D so that Rj c G by the choice
of D. Also, many of the sides of the rectangles R 1, . . . , Rm will intersect.
Suppose R j and R i have a common side and let a j and ai be the line segments
in 8R j, and 8R i respectively, such that R i n R j == {a j} == {ai}. From the
direction given 8R j and 8R i , a j and a i are directed in the opposite sense. So
if cp is any continuous function on {a j },
f 'P + J 'P = O.
Gj Gi
Let Yl'"'' Y n be those directed line segments that constitute a side of
exactly one of the Rj' 1 < j < m. Thus
1.2 At! f 'P = j f 'P
Yk Rj
m
for every continuous function cp on U 8R j.
j-=l
We claim that each Yk is in G - K. In fact, if one of the Yk intersects K, it
is easy to see that there are two rectangles in the grid with Yk as a side and
so both meet K. That is, Yk is the common side of two of the rectangles
R l' . . · , Rm and this contradicts the choice of Yk.
If z belongs to K and is not on the boundary of any R j then
1 ( f(W» )
cp(tv) == -. -
27Tl w-z
m
is continuous on U 8 R j for f in H ( G). It follows from (1.2) that
j=l
1.3   f few} dw = *  f l(W) dw.
is. 27Ti w-z 6 27Ti w-z
 n
But z belongs to the interior of exactly one R j. If z tt R j,
 f f( w) dw == O.
27Ti w-z '
Rj
and if z is in R j, this integral equals fez) by Cauchy's Formula. Thus (1.3)
becomes
1.4
fez} = I  f f(W) dw
k=127Tl w-z
Yk
m
whenever z E K - U 8R j. But both sides of (1.4) are continuous functions
j=l
on K (because each Yk misses K) and they agree on a dense subset of K.
Thus, (1.4) holds for all z in K. The remainder of the proof follows. II

Runge's Theorem 197
This next lemma provides the first step in obtaining approximation by
rational functions.
1.5 Lemma. Let y be a rectifiable curve and let K be a compact set such that
K (\ {y} = D. If J is a continuous Junction on {y} and € > 0 then there is a
rational Junction R(z) having all its poles on {y} and such that
f J(W)
- dw-R(z)
w-z
y
< €
Jor all z in K.
Proof Since K and {y} are disjoint there is a number r with 0 < r < d(K,
{y}). If y is defined on [0, I] then for 0 < s, t < I and z in K
fi ( ( t y ) (t)) - (s)) <  f(y(t))y(s) - f(y(s))y(t) - zff(y(t)) - f(y(s))]
y -z y s -z r
1 1
< 2 J(y(t)) yes) -yet) + 2 yet) J(y(s))
r r
. Izi
- J(y(t)) + 2 J(y(s)) - J(y(t))
r
There is a constant c > 0 such that Izi < c for all z in K, ly(t)1 < c and
/J(y(t))/ < c for all t in [0, 1]. This gives that for all sand t in [0, I] and z in K,
f(y(t)) _ f(y(s)) <  /y(s) -y(t)1 + 2c /f(y(s)) - f(y(t)) I
y(t)-z y(s)-z ,2 r 2
Since both y andJ 0 yare uniformly continuous on [0, 1], there is a partition
{O = to < t 1 < . . . < t n = I} such that
J(y(t)) J(y(t j)) €
1.6 - < --
yet) -z yet j) -z V(y)
for t j-l < t < t j, 1 < j < n, and z in K. Define R(z) to be the rational
function
n
R(z) = L J(y(t j-l)) [yet j) - yet j-l)] [yet j-l) - Z]-1
j=1
The poles of R(z) are y(O), yet 1), . . . , y(t n - 1)' Using (1.6) yields that
f J( v)
---"- dv - R( z)
w-z
y
tj
=  f[ J(y(t)) - J(y(ti-t)) ] dy(t)
.tI y( t) - Z y( t j - 1) - z
tj-l
tj
< Vy)  f d/yl(t)
tj-l
=€
for all z in K. II

198
Runge's Theorem
Before stating Runge's Theorem let us agree to say that a polynomial is
a rational function with a pole at 00. I t is easy to see that a rational
function whose only pole is at 00 is a polynomial.
1.7 Runge's Theorem. Let K be a compact subset of C and let E be a subset
of Coo - K that meets each component of Coo - K. If f is analytic in an open
set containing K and € > 0 then there is a rational function R (z) whose only
poles lie in E and such that
If(z)-R(z)I<€
for all z in K.
The proof that will be given here was obtained by S. Grabiner (A mer.
Math. Monthly, 83 (1976), 807-808). For this proof we place the result in a
different setting. On the space C (K, C) we define a distance function p by
p(f,g) = sup{ If(z) - g(z)l: z E K}
for f and g in C (K, C). It is easy to see that P{fn,f)O iff f = u -limfn on
K. Hence C(K,C) is a complete metric space.
So Runge's Theorem says that if f is analytic on a neighborhood of K
and € > 0 then there is a rational function R (z) with poles in E such that
p(f, R) < €. By taking € = 1/ n it is seen that we want to find a sequence of
rational functions {Rn (z)} with poles in E such that p{f, Rn)O; that is,
such that f = u -lim Rn on K.
Let B (E) = all functions f in C (K, C) such that there is a sequence
{Rn} of rational functions with poles in E such that f = u -lim Rn on K.
Runge's Theorem states that if f is analytic in a neighborhood of K then
fl K, the restriction of f to K, is in B (E).
1.8 Lemma. B (E) is a closed subalgebra of C (K, C) that contains every
rational function with a pole in E.
To say that B (E) is an algebra is to say that if f and g are in B (E) and
a E C then af, f + g, and fg are in B (E). The proof of Lemma 1.8 is left to
the reader.
1.9 Lemma. Let V and U be open subsets of C with V c U and av f1 U = D.
If H is a component of U and H f1 V =1= 0 then H c v.
Proof. Let a E H f1 V and let G be the component of V such that a E G.
Then HuG is connected (11.2.6) and contained in U. Since H is a
component of U, G c II. But aG c av and so the hypothesis of the lemma
says that aG f1 H = D. This implies that
H - G = H f1 [ ( C - G - ) u aGJ
=Hn(C-G-)
so that H-G is open in H. But G is open implies that H-G=Hn(C-
G) is closed in H. Since H is connected and G=I=D, H - G=D. That is,
H = G c V. .

Runge's Theorem
1.10 Lemma. If a E C - K then (z - a)- 1 E B (E).
Proof. Case 1. 00 rI E.
Let U =C - K and let V = {a E C: (z - a)-I E B (E)}; so E eVe U.
1.11 IfaE Vandlb-al<d(a,K) then b{(2V.
199
The condition on b gives the existence of a number r, 0 < r < 1, such that
Ib-al<rlz-al for all z in K. But
(z-b)-I=(z-a)-I [ I- b-a ] -1
z-a
1.12
Hence Ib - allz - ai-I < r < I for all z in K gives that
1.13
[ 1- b - a ] - I = f ( b - a ) n
z-a z-a
n=O
converges uniformly on K by the Weierstrass M-test.
 ( b - a ) k
If Qn(z)= kO z-a then (z-a)-IQn(Z)EB(E) smce aEV and
B (E) is an algebra. Since B (E) is closed (1.12) and the uniform conver-
gence of (1.13) imply that (Z-b)-I E B(E). That is, b E V.
Note that (1.11) implies that V is open.
If b E av then let {an} be a sequence in V with b = lima n . Since b  V it
follows from (1.11) that Ib - ani > d(a n , K). Letting noo gives (by 11.5.7)
that 0= d(b, K), or b E K. Thus av n U = D.
If H is a component of U=C-K then HnE=I=D, so Hn V=I=D. By
Lemma 1.9, H c V. But H was arbitrary so U c V, or V = U.
Case 2. 00 E E.
Let d= the metric on Coo' Choose a o in the unbounded component of
C- K such that d(a o , 00) < d(oo,K) and laol >2max{lzl:z E K}. Let
Eo = (E - { 00 }) u {a o }; so Eo meets each component of Coo - K. If a E C-
K then Case I gives that (z - a)-I E B (Eo). If we can show that (z - ao)-l
eB(E) then it follows that B(Eo)cB(E) and so (z-a)-l eB(E) for
each a in C - K.
Now Iz / aol <  for all z in K so
I I 00
= - -  (z/ao)n
a o ( I - z / ao) a o n = 0
1
z-a o
converges uniformly on K. So Qn(z) = - ao-IL=o(Z / ao)k is a polynomial
and (z - ao) - I = u -lim Qn on K. Since Qn has its only pole at 00, Qn E
B (E). Thus (z - ao)-l E B (E). .
The Proof of Runge's Theorem. If f is analytic on an open set G and KeG
then for each € > 0 Proposition 1.1 and Lemma 1.5 imply the existence of a
rational function R(z) with poles in C-K such that If(z)-R(z)I<€ for

200 Runge's Theorem
all z in K. But Lemma 1.10 and the fact that B (E) is an algebra gives that
REB(E)..
1.14 Corollary. Let G be an open subset of the plane and let E be a subset of
Coo-G such that E meets every component of Coo-G. Let R(G,E) be the
set of rational functions with poles in E and consider R (G, E) as a subspace
of H(G). If f E H(G) then there is a sequence {Rn} in R(G,E) such that
f = lim Rn' That is, R (G, E) is dense in H (G).
Proof. Let K be a compact subset of G and € > 0; it must be show that
there is an R in R(G, E) such that If(z) - R(z)1 < € for all z in K.
According to Proposition VII.t.2 there is a compact set Kl such that
K c Kl C G and each component of Coo - Kl contains a component of
Coo - G. Hence, E meets each component of Coo - Kl. The corollary now
follows from Runge's Theorem. _
The next corollary follows by letting E = {oo} and using the fact that a
rational function whose only pole is at 00 is a polynomial.
1.15 Corollary. If G is an open subset of C such that Coo - G is connected
then for each analytic function f on G there is a sequence of polynomials { Pn }
such that f = lim Pn in H( G).
Corollary 1.14 can be strengthened a little by requiring only that E-
meets each component of Coo - G. The reader is asked to do this (Exercise
1 ).
The condition that E - meet every component of Coo - G cannot be
relaxed. This can be seen by considering the punctured plane C - {O} = G.
So Coo - G = {O, oo}. Suppose that for this case we could weaken Runge's
Theorem by assuming that E consisted of 00 alone. Then for each integer
n > 1 we could find a polynomial Pn(z) such that
1 1
- - Pn(z) <-
Z n
1.16
for! < Izi < n. Then /I-zPn(z)1 <  < 1 for! < Izi < n. But if Izi = n
n n n ·
then
1 1 1 2
lPn(z)/ = - /zPn(z)/ < - IZPn(z) -11 + - < - ·
n n n n
By the Maximum Modulus Theorem, IPn(z) I < 3 for Izi < n. In particular,
n
Pn(z)  0 uniformly on Izi < 1. This clearly contradicts (1.16) and shows
that E must be the set {O, oo}.
Of course, the point in the above paragraph could have been made by
appealing to what was said about this same example at the beginning of
this section. However, this further exposition gives an introduction to a
concept whose connection with Runge's Theorem is quite intimate.
1.21 Definition. Let K be a compact subset of the plane; the polynomial/y

Runge's Theorem 201
convex hull of K, denoted by K, is defined to be the set of all points w such
that for every polynomial p
Ip(w)1 < max {lp(z)l: z E K}.
That is, if the right hand side of this inequality is denoted by lip ilK' then
K = {w: Ip(w)1 < lip ilK for all polynomials p}.
If K is an annulus then K is the disk obtained by filling in the interior
hole. In fact, if K is any compact set the Maximum Modulus Theorem gives
that K is obtained by filling in any" holes" that may exist in K.
Exercises
1. Prove Corollary 1.14 if it is only assumed that E - meets each compo-
nent of Coo - G.
2. Let G be the open unit disk B(O; 1) and let K = {z: t < Izl < :t}. Show
that there is a function f analytic on some open subset G 1 containing K
which cannot be approximated on K by functions in B(G).
Remarks. The next two problems are concerned with the following question.
Given a compact set K contained in an open set G 1 c G, can functions in
H(G 1 ) be approximated on K by functions in B(G)? Exercise 2 says that
for an arbitrary choice of K, G, and G 1 this is not true. Exercise 4 below
gives criteria for a fixed K and G such that this can be done for any G 1.
Exercise 3 is a lemma which is useful in proving Exercise 4.
3. Let K be a compact subset of the open set G and suppose that any bounded
component D of G - K has D- (\ 8G # D. Then every component of Coo - K
contains a component of Coo - G.
4. Let K be a compact subset of the open set G; then the following are
equivalent:
(a) If f is analytic in a neighborhood of K and € > 0 then there is a g
in R(G) with If(z)-g(z)1 < € for all z in K;
(b) If D is a bounded component of G - K then D - (\ 8G # D;
(c) If z is any point in G-K then there is a function fin R(G) with
If(z) I > sup {If(w)l: win K}.
5. Can you interpret part (c) of Execise 4 in terms of K?
6. Let K be a compact subset of the region G and define KG = {z E G:
If(z) I < IIfllK for all fin B(G)}.
(a) Show that if Coo - G is connected then KG = K.
(b) Show that d(K, C - G) = d(KG' C - G).
(c) Show that KG c the convex hull of K = the intersection of all convex
subsets of C which contain K.

202
Runge's Theorem
(d) If KG C G 1 C G and G 1 is open then for every g in B(G 1 ) and € > 0
there is a function fin B(G) such that /f(z)-g(z)/ < € for all z in KG. (Hint:
see Exercise 4.)
(e) KG == the union of K and all bounded components of G-K whose
closure does not intersect eG.
2. Simple connectedness
Recall that an open connected set G is simply connected if and only if
every closed rectifiable curve in G is homotopic to zero. The purpose of this
section is to prove some equivalent formulations of simple connectedness.
2.1 Definition. Let X and Q be metric spaces; a homeomorphism between
X and £2 is a continuous map f: X -7 Q which is one-one, onto, and such
that 1- 1 : i2 -7 X is also continuous.
Notice that if f: X -7 i2 is one-one, onto, and continuous then I is a
homeomorphism if and only if I is open (or, equivalently, I is closed).
If there is a homeomorphism between X and £2 then the metric spaces
X and i2 are homeomorphic.
We claim that C and D == {z: Izl < I} are homeomorphic. In fact
I(z) == z(1 + Izl) -1 maps C onto D in a one-one fashion and its inverse,
1-1(w) == w(1-lwj)-1, is clearly continuous. Also, if/is a one-one analytic
function on an open set G and Q == f(G) then G and £1 are honleomorphic.
Finally, all annuli are homeomorphic to the punctured plane.
2.2 Theorem. Let G be an open connected subset of C. Then the following are
equivalent:
(a) G is simply connected;
(b) n(y; a) == 0 for every closed rectifiable curve y in G and every point
a in C-G;
(c) Coo - G is connected;
(d) For any f in H (G) there is a sequence of polynomials that converges
to fin H(G);
(e) For any / in H (G) and any closed rectifiable curve y in G, J y f == 0;
(f) Every functionf in B(G) has a primitive;
(g) For any fin B(G) such thatf(z) '# Ofor all z in G there is afunction g
in B(G) such thatf(z) == exp g(z);
(h) For any fin B(G) such that fez) '# 0 for all z in G there is a function
gin B(G) such thatf(z) == [g(z)] 2 ;
(i) G is homeomorphic to the unit disk;
(j) If u: G -7 R is harmonic then there is a harmonic function v: G  R
such that f == u + Iv is analytic on G.
Proof. The plan is to show that (a) => (b) => . . . => (i) => (a) and (h) => (j)
=> (g). Many of these implications have already been done.

Simple connectedness 203
(a) => (b) If Y is a closed rectifiable curve in G and a is a point in the
complement of G then (z - a) - 1 is analytic in G, and part (b) follows by
Cauchy's Theorem.
(b) => (c) Suppose Coo-G is not connected; then Coo-G == A u B where
A and B are disjoint, non-empty, closed subsets of Coo. Since 00 must be
either in A or in B, suppose that 00 is in B; thus, A must be a compact subset
of C (A is compact in Coo and doesn't contain (0). But then G 1 == G u A ==
Coo - B is an open set in C and contains A. According to Proposition 1.1
there are a finite number of polygons Yl, .". . , Ym in G 1 - A == G such that
for every analytic function 1 on G 1
m ..
fez) = L  j I(w) dw
k=1277'1 w-z
Yk
for all z in A. In particular, if I(z) = 1 then
m
1 = L n(Yk;z)
k=1
for all z in A. Thus for any z in A there is at least one polygon Yk in G such
that n(Yk; z) i= O. This contradicts (b).
(c) => (d) See Corollary 1. 15.
(d) => (e) Let Y be a closed rectifiable curve in G, let 1 be an analytic
function on G, and let {Pn} be a sequence of polynomials such thatl == lim Pn
in H (G). Since each polynomial is analytic in C and Y t"--.I 0 in C, J y Pn == 0
for every n. But {Pn} converges to 1 uniformly on {y} so that S y 1 = lim
JyPn=O.
(e) => (f) Fix a in G. From condition (e) it follows that there is a function
F: G  C defined by letting F(z) = Jylwhere Y is any rectifiable curve in G
from a to z. It follows that F' = f (see the proof of Corollary IV. 6.16).
(f) => (g) Iff(z) i= 0 for all z in G thenf'lfis analytic on G. Part (f) implies
there is a function F such that F' = f'lf It follows (see the proof of Corollary
IV. 6. 17) that there is an appropriate constant c such that g = F + c satisfies
I(z) == exp g(z) for all z in G.
(g) => (h) This is trivial.
(h) => (i) If G = C then the function z(1 + /z/) -1 was shown to be a homeo-
morphism immediately prior to this theorem. If G i= C then Lemma VII. 4.3
implies that there is an analytic mapping f of G onto D which is one-one.
Such a map is a homeomorphism.
(i) => (a) Let Iz: G  D = {z: Izi < I} be a homeomorphism and let Y
be a closed curve in G (note that Y is not assumed to be rectifiable). Then
a(s) = h(y(s» is a closed curve in D. Thus, there is a continuous function
A:I2DsuchthatA(s,O) = a(s) forO < s < I,A(s, 1) = Of orO < s < I
and A(O, t) = A(l, t) for 0 < t < 1. It follows that r == h- 1 0 A is a con-
tinuous map of [2 into G and demonstrates that Y is homotopic to the curve
which is constantly equal to h- 1 (O). The details are left to the reader.

204 Runge's Theorem
(h)  (j) Suppose that G i= C; then the Riemann Mapping Theorem
implies there is an analytic function h on G such that h is one-one and h( G)
= D. If u: G  R is harmonic then u 1 = U 0 h - 1 is a harmonic function on D.
By Theorem III. 2.30 there is a harmonic function VI: D  R such that
11 = U 1 + iV I is analytic on D. Let 1=/1 0 h. Then I is analytic on G and
u is the real part off. Thus V = 1m I = VI 0 h is the sought after harmonic
conjugate. Since Theorem III. 2.30 also applies to C, (j) follows from (h).
(j) => (g) Suppose I: G  C is analytic and never vanishes, and let u =
Re h V = 1m f. If V: G  R is defined by Vex, y) = log /f(x+iy)/ = log
[u(x, y)2 + vex, y)2]t then a computation shows that V is harmonic. Let V
be a harmonic function on G such that g = V + iV is analytic on G and
let h(z) = exp g(z). Then h is analytic, never vanishes, and I(z) = I for all
h(z)
z in G. That is, f/h is an analytic function whose range is not open. It follows
that there is a constant c such that fez) = c h(z) = c exp g(z) = exp [g(z) +
cd. Tl1us, g(z) + C 1 is a branch of logf(z).
This completes the proof of the theorem. II
This theorem constitutes an aesthetic peak in Mathematics. Notice that it
says that a topological condition (simple connectedness) is equivalent to
analytical conditions (e.g., the existence of harmonic conjugates and Cauchy's
Theorem) as well as an algebraic condition (the existence of a square root)
and other topological conditions. This certainly was not expected when
simple connectedness was first defined. Nevertheless, the value of the theorem
is somewhat limited to the fact that simple connectedness implies these nine
properties. Although it is satisfying to have the converse of these implica-
tions, it is only the fact that the connectedness of Coo - G implies that G is
simply connected which finds wide application. No one ever verifies one of
the other properties in order to prove that G is simply connected.
For an example consider the set G = C - {z = re ir : 0 < r < oo}; that
is, G is the complement of the infinite spiral r = 8, 0 < 8 < 00. Then
Coo - G is the spiral together with the point at infinity. Since this is connected,
G is simply connected.
Exercise
1. The set G={re '1 : -00<1<0 and 1+e 1 <r<1+2e 1 } is caed a
cornucopia. Show that G is simply connected. Let K = G -; is intK con-
nected?
3 Mittag-Leffler's Theorem
Consider the following problem: Let G be an open subset of C and let
{ak} be a sequence of distinct points in G such that {ak} has no limit point
in G. For each integer k > 1 consider the rational function
3.1
mk A
 jk
Sk(Z) = is (z-aY ,

Mittag-Lerner's Theorem 205
where mk is some positive integer and A lk, . . . , Amkk are arbitrary complex
coefficients. Is there a meromorphic function f on G whose poles are exactly
the points {a k } and such that the singular part of fat z = ak is Sk(Z)? The
answer is yes and this is the content of Mittag-Leffler's Theorem.
3.2 Mittag-Leffler's Theorem. Let G be an open set, {a k } a sequence of
distinct points in G without a limit point in G, and let {Sk(Z)} be the sequence
of rational functions given by equation (3.1). Then there is a meromorphic
function f on G whose pole.s are exactly the points {ak} and such that the
singular part of f at ak is Sk(Z).
Proof Although the details of this proof are somewhat cumbersome, the
idea is simple. We use Runge's Theorem to find rational functions {RJ,;(z)}
with poles in iCoo-G such that tt/k(Z)-Rk(Z)} is a Cauchy sequence in
M(G). The resulting limit is the sought after meromorphic function. (Actually
we must do a little more than this.)
Use Proposition VII. 1.2 to find compact subsets of G such that
00
G = U Kn, Kn c int K n + 1 ,
n=l
and each component of Coo - Kn contains a component of Coo - G. Since
each Kn is compact and {a k } has no limit point in G, there are only a finite
number of points ak in each Kn. Define the sets of integers In as follows:
II = {k: ak E K 1 },
In = {k: ak E Kn - Kn - 1 }
for n > 2. Define functions In by
In(Z) = L Sk(Z)
kEf n
for n > I. Then In is rational and its poles are the points {a k : k E In} C Kn -
Kn _ I' (If In is empty let in = 0.) Since in has no poles in Kn _ 1 (for n > 2) it is
analytic in a neighborhood of Kn-I' According to Runge's Theorem there
is a rational function Rn(z) with its poles in C x - G and that satisfies
IIn(z)-Rn(Z)1 < (t)n
for all Z in K n - 1 . We claim that
3.3
00
/(z) = /1 (z) + L [h(Z) - Rn(z)]
n=2
is the desired meromorphic function. It must be shown that f is a mero-

206 Runge's Theorem
morphic function and that it has the desired properties. Start by showing
that the series in (3.3) converges uniformly on every compact subset of
G- {ak: k > I}. This will give that / is analytic on G- {a k : k < I} and it
will only remain to show that each ak is a pole with singular part Sk{Z). So
let K be a compact subset of G - {ak: k > I}; then K is a compact subset of
G and, therefore, there is an integer N such that K c KN. If n > N then
I/n{z) - Rn{z) I < {t)n for all Z in K. That is, the series (3.3) is dominated on K
by a convergent series of numbers; by the Weierstrass M-test (II. 6.2) the
series (3.3) converges uniformly on K. Thus / is analytic on G - {a k : k > I}.
Now consider a fixed integer k > 1; there is a number R > 0 such that
laj-akl > R for j '# k. Thus/{z) = Sk(Z)+g(z) for 0 < Iz-akl < R, where
g is analytic in B{a k ; R). Hence, z = ak is a pole of/ and Sk(Z) is its singular
part. This completes the proof of the theorem. II
Just as there is merit in choosing the integers Pn in Weierstrass's Theorem
(VII. 5.2) as small as possible, there is merit in choosing the rational functions
Rn(z) in (3.3) to be as simple as possible. As an example let us calculate the
simplest meromorphic function in the plane with a pole at every integer n.
00
The simplest singular part is (z - n) -1 but L (z - n) -1 does not converge in
-00
M(C). However (z-n)-1+{z+n)-1 = 2Z{Z2_ n 2)-1 and
1 00 2z
-+ 
z L z2_n 2
n=l
does converge in M (C). The singular part of this function at z = n is (z - n) - 1.
In fact, from Exercise V. 2.8 we have that this function is 7T' cot 7T'z.
Exercises
1. Let G be a region and let {an} and {b m } be two sequences of distinct points
in G such that an '# b m for all n, m. Let Sn{z) be a singular part at an and let
Pm be a positive integer. Show that there is a meromorphic function.r on G
whose only poles and zeros are {an} and {b m } respectively, the singular part
at z = an is Sn(z), and z = b m is a zero of multiplicity Pm.
2. Let {an} be a sequence of points in the plane such that lanl  00, and let
{b n } be an arbitrary sequence of complex numbers.
(a) Show that if integers {k n } can be chosen such that
3.4
i (  ) kn bn
n = 1 an an
converges absolutely for all r > 0 then
3.5
i (  ) kn bn
n= 1 an z-a n
converges in M(C) to a function/with poles at each point z = {In.

3.6
Mittag-Leffler's Theorem 207
(b) Show that if lim sup Ibnl < 00 then (3.4) converges absolutely if
k n = n for all n.
(c) Show that if there is an integer k such that the series
00 b
2: Ok:1
n= 1 n
converges absolutely, then (3.4) converges absolutely if k n = k for all n.
(d) Suppose there is an r > 0 such that Ian-ami > r for all n i= m. Show
that L lanl- 3 < 00. In particular, if the sequence {b n } is bounded then the
series (3.6) with k = 2 converges absolutely. (This is somewhat involved and
the reader may prefer to prove part (f) directly since this is the only applica-
ti 0 n. )
(e) Show that if the series (3.5) converges in M(C) to a meromorphic
function f then
I(z) =  [ n + bn { l + (  ) + ... + (  ) kn-l }J
n = 1 Z an an an an
(f) Let wand w' be two complex numbers such that 1m (w'/w) i= o.
U sing the previous parts of this exercise show that the series
I ' ( 1 1 Z )
'(z) = - + L - + - + - ,
Z Z - W W w 2
where the sum is over all w = 2nw+2n'w for n, n' = 0, + 1, + 2, . . . but
not w = 0, is convergent in M(C) to a meromorphic function' with simple
poles at the points 2nw+2n'w'. This function is called the Weierstrass zeta
function.
(g) Let (z) = - "(z);  is called the Weierstrass pe function. Show that
gJ(z) = 1 2 + L' ( I )2 - -\ )
z z-w w
where the sum is over the same w as in part (f). Also show that
(z) = (z+2nw+2n'w')
for all integers nand n'. That is,  is doubly periodic with periods 2w and 2w'.
3. This exercise shows how to deduce Weierstrass's Theorem for the plane
(Theorem VII. 5.12) from Mittag-Leffler's Theorem.
(a) Deduce from Exercises 2(a) and 2(b) that for any sequence {an} in C
with lim an = 00 and an i= 0 there is a sequence of integers {k n } such that
 [ 1 1 1 ( z ) 1 ( Z ) k n - 1 ]
h(z) = L + - + - - +... + - -
n=l z-a n an an an an an
is a meromorphic function on C with simple poles at ai' a2, . .. .
The remainder of the proof consists of showing that there is a function f
such that h = f'lf. This function f will then have the appropriate zeros.

208 Runge's Theorem
(b) Let z be an arbitrary but fixed point in C - {at, a 2 , . . .}. Show that if
Yt and Y2 are any rectifiable curves in C - {a b a 2 , . . .} from 0 to z and h is
the function obtained in part (a), then there is an integer m such that
f h - f h = 27rim.
1'1 1'2
(c) Again let h be the meromorphic function from part (a). Prove that
for z '# at, a2'... and Y any rectifiable curve in C- {at, a2,.. .},
I(z) = exp (f h)
defines an analytic function on C- {at, a2, . . .} withf'ff = h. (That is, the
value of fez) is independent of the curve Y and the resulting function f is
analytic.
(d) Suppose that Z E {at, a2, . . .}; show that z is a removable singularity
of the function f defined in part (c). Furthermore, show that j(z) = 0 and
that the multiplicity of this zero equals the number of times that z appears
in the sequence {at, a2, . . .}.
(e) Show that
3.7
00 ( z ) [ z 1 ( z ) 1 ( Z ) kn J
I(z) = TI 1 - - exp - + - - 2 + . . . + - -
n = t an an 2 an k n an
Remark. We could have skipped parts (b), (c), and (d) and gone directly
from (a) to (e). However this would have meant that we must show that (3.7)
converges in H(C) and it could hardly be classified as a new proof. The steps
outlined in parts (a) through (d) give a proof of Weierstrass's Theorem
without introducing infinite products.
4. This exercise assumes a knowledge of the terminology and results of
Exercise VII. 5.11.
(a) Define two functionsfand g in H(G) to be relatively prime (in symbols,
(f, g) = 1) if the only common divisors off and g are non-vanishing functions
in H(G). Show that (f, g) = 1 iff fZ(f) () fZ(g) = D.
(b) If (.I: g) = 1, show that there are functions ft, gt in B(G) such that
1ft + gg t = 1. (Hint: Show that there is a meromorphic function cP on G
such thatft = cpg E B(G) and gl(l-Ift).)
(c) Let!b . . . ,fn E B(G) and g = g.c.d {ft,. . . ,fn}. Show that there
are functions CPt, . . . , CPn in H(G) such that g = CPt!t + . . .+CPnfn. (Hint:
Use (b) and induction.)
(d) If {fa.} is a collection of ideals in H (G), show that f = n fa. is
a.
also an ideal. If !/ c H(G) then let f = () {f: f is an ideal of B(G) and
!/ c f}. Prove that f is the smallest ideal in H(G) that contains g;
and f = {cpt!t + . . . +CPnfn: CPk E H(G), h E!/ for 1 < k < n}. J is called
the ideal generated by f/ and is denoted by f = (f/). If f/ is finite then
(f/) is called a finitely generated ideal. If !/ = {f} for a single function
f then (f) is called a principal ideal.

Mittag- Leffler's Theorem 209
(e) Show that every finitely generated ideal in H(G) is a principal ideal.
(f) An ideal f is called a fixed ideal if (..F) i= 0; otherwise it is called
a free ideal. Prove that if f = () then (f) = () and that a principal
ideal is fixed.
(g) Leth(z) = sin (2 -n z ) for all n > 0 and let ..F = ({It, 12, . . . }). Show
that ..F is a fixed ideal in H(C) which is not a principal ideal.
(h) Let f be a fixed ideal and prove that there is an I in H(G) with
(/) = (..F) and ..F c (I). Also show that ..F = (I) if ..F is finitely gener-
ated.
(i) Let vii be a maximal ideal that is fixed. Show that there is a point
a in G such that vii = «z-a).
(j) Let {an} be a sequence of distinct points in G with no limit point in G.
Let..F = {IE H(G): I(an) = 0 for all but a finite number of the an}. Show
that ..F is a proper free ideal in H(G).
(k) If J is a free ideal show that for any finite subset  of f, ()
:f= D. Use this to show that f can contain no polynomials.
(1) Let..F be a free ideal; then ..F is a maximal ideal iff whenever g E B(G)
and (g) () (/) :f= 0 for all I in J then g E..F.
5. Let G be a region and let {an} be a sequence of distinct points in G with
no limit point in G. For each integer n > 1 choose integers k n > 0 and
constants Ak), 0 < k < k n . Show that there is an analytic function I on G
such that f(k)(a n ) = k !Ak). (Hint: Let g be an analytic function on G with a
zero at an of multiplicity k n . Let h be a meromorphic function on G with
poles at each an of order k n and with singular part Sn(z). Choose the SII so
that I = gh has the desired property.)
6. Find a meromorphic function with poles of order 2 at 1, 2, 3, . . ·
such that the residue at each pole is 0 and lim (z- In)21(z) = 1 for all n.
z-+vn

Chapter I X
Analytic Continuation and Riemann Surfaces
Consider the following problem. Let I be an analytic function on a region
G; when can I be extended to an analytic function 11 on an open set G 1
which properly contains G? If G 1 is obtained by adjoining to G a disjoint
open set so that G becomes a component of G l' I can be extended to G 1 by
defining it in any way we wish on G 1 - G so long as the result is analytic.
So to eliminate such trivial cases it is required that G 1 also be a region.
Actually, this process has already been encountered. Recall that in the
discussion of the Riemann zeta function (Section VII. 8) (Z) was initially
defined for Re z > 1. Using various identities, principal among which was
Riemann's functional equation,  was extended so that it was defined and
analytic in C - {I} with a simple pole at Z = 1. That is,  was analytically
continued from a smaller region to a larger one.
Another example was in the discussion that followed the proof of the
Argument Principle (V.3.4). There a meromorphic function f and a closed
rectifiable curve y not passing through any zero or pole of 1 was given.
If z = a is the initial point of y (and the final point), we put a disk D 1 about
a on which it was possible to define a branch t 1 of log f Continuing, we
covered y by a finite number of disks D 1 , D 2 , . . . , Dn, where consecutive
disks intersect and such that there is a branch t j of logl on D j. Furthermore,
the functions t j were chosen so that tj(z) = t j - 1 (z) for z in D j-l n D j'
2 < j < n. The process analytically continues t 1 to D 1 U D 2 , then Dl U D 2
U D 3 , and so on. However, an unfortunate thing (for this continuation)
happened when the last disk Dn was reached. According to the Argument
Principle it is distinctly possible that tn(z) =1= t 1 (z) for z in Dn n D 1 . In fact,
tn(z) - t 1 (z) = 27TiK for some (possibly zero) integer K.
This last example is a particularly fruitful one. This process of continuing
a function along a path will be examined and a criterion will be derived
which ensures that continuation around a closed curve results in the same
function that begins the continuation. Also, the fact that continuation around
a closed path can lead to a different function than the one started with, will
introduce us to the concevt of a Riemann Surface.
This chapter begins with the Schwarz Reflection Principle which is more
like the process used to continue the zeta function than the process of
continuing along an arc.
1. Schwarz Reflection Principle
If G is a region and G* = {z: Z E G} and iff is an analytic function on G,
thenf*: G*  C defined by I*(z) = }'(z) is also analytic. Now suppose that
210

Schwarz Reflection Principle 211
G = G*; that is, G is symmetric with respect to the real axis. Then g(z) = fez)
- fez) is analytic on G. Since G is connected it must be that G contains an
open interval of the real line. Suppose f(x) is real for all x in G n IR; then
g(x) = 0 for x in G n IR. But G n IR has a limit point in G so thatf(z) = fez)
for all z in G.
The fact that f must satisfy this equation is used to extend a function
defined on G n {z: 1m z > O} to all of G.
If G is a symmetric region (i.e., G = G*) then let G + = {z E G: 1m z > O},
G_ = {ZEG: 1m Z < O}, and Go = {ZEG: 1m Z = O}.
1.1 Schwarz Reflection Principle. Let G be a region such that G = G*. If
f: G + U Go -* C is a continuous function }vhich is analytic on G + and if
f(x) is real for x in Go, then there is an analytic function g: G -* C such that
g(z) = fez) for Z in G + U Go.
Proof For z in G _ define g(z) = fez) and for z in G + U Go let g(z) = fez).
It is easy to see that g: G -* C is continuous; it must be shown that g is
analytic. It is trivial that g is analytic on G + U G _ so fix a point x 0 in Go
and let R > 0 with B(x 0; R) c G. I t suffices to show that g is analytic on
B(x 0; R); to do this apply Morera's Theorem. Let T = [a, b, c, a] be a triangle
in B(xo; R). To show that STf = 0 it is sufficient to show that Spf = 0
a
G
o
b
whenever P is a triangle or a quadrilateral lying entirely in G + U Go or
G _ u Go. In fact, this is easily seen by considering various pictures such as
the one above. Therefore assume that T c G + u Go and [a, b] c Go. The
proof of the other cases is similar and will be left to the reader. (See Exercise
1 for a general proposition which proves all these cases at once.)
Let  designate T together with its inside; then g(z) = fez) for all z in .
By hypothesis f is continuous on G + U Go and so f is uniformly continuous
on . So if E > 0 there is as> 0 such that when z and z' E  and Iz-z'l < S
then If(z) - f(z')1 < E. Now choose a and {j on the line segments [c, a] and
[b, c] respectively, so that la-al < Sand j{j-bl < S. Let T 1 = [a, {j, c, a]
and Q = [a, b, {j, a, a]. Then ITf = I Ttf+ IQh but Tl and its inside are
contained in G + and f is analytic there; hence
1.2
If= If.
T Q

212
Analytic Continuation and Riemann Surfaces
('
a
b
Go
But if 0 < t < 1 then
'[t + (1- t)a] - [tb + (1- t)a]/ < 8
so that
'f(t + (1- t)a) - f(tb + (1- t)a)/ < €.
If M = max {/f(z)/: z E } and t = the perimeter of T then
1 1
1.31 I I + I II = /(b-a) I l(tb+(I-t)a)dt-((3-IX) I l(t(3+(I-t)lX) dt l
[a, b J [13, exl 0 0
1
< Ib-al If [ICtb+(I-t)a)-/(t(3+(l-t)lX)dt!
o
1
+ I(b-a) - ((3 -1X)IIII(t(3 + (1- t)lX)dtl
o
< €Ib-a/ +M/(b-fi)+(a-a)1
< €t+2M8
Also
I I II < Mia-IX/ < M8
[ex, a]
and
I I II < M8.
[b, ]
Combining these last two inequalities with (1.2) and (1.3) gives that
II II < d+4M8.
T
Since it is possible to choose 8 < € and since € is arbitrary, it follows that
J T f = 0; thus f must be analytic. II
Can the reflection principle be generalized? For example, instead of
requiring that G be a region which is symmetric with respect to the real axis,
suppose that G is symmetric with respect to a circle. (Definition III. 3.17).

Analytic Continuation Along a Path 213
Can the reflection principle be formulated and proved in this setting? The
answer is provided in the exercises below.
Exercises
1. Let y be a simple closed rectifiable curve with the property that there is a
point a such that for all z on y the line segment [a, z] intersects {y} only at z;
i.e. [a, z] n {y} == {z}. Define a point w to be inside y if [a, w] n {y} == D
and let G be the collection of all points that are inside y.
(a) Show that G is a region and G- == G u {y}.
(b) Let I: G-  C be a continuous function such that lis analytic on G.
Show that Syl == O.
(c) Show that n(y; z) == + 1 if z is inside y and n(y; z) == 0 if z i G-.
Remarks. It is not necessary to assume that y has such a point a as above;
each part of this exercise remains true if y is only assumed to be a simple
closed rectifiable curve. Of course, we must define what is meant by the
inside of y. This is difficult to obtain. The fact that a simple closed curve
divides the plane into two pieces (an inside and an outside) is the content of
the Jordan Curve Theorem. This is a very deep result of topology.
2. Let G be a region in the plane that does not contain zero and let G* be
the set of all points z such that there is a point w in G where z and ware
symmetric with respect to the circle II = 1. (See III. 3.17.)
(a) Show that G * == {z: (1/2) E G}.
(b) If I: G  C is analytic, define 1*: G*  C by I*(z) == 1(1/2). Show
that f* is analytic.
(c) Suppose that G == G* and I is an analytic function defined on G
such that I(z) is real for z in G with Izi == 1. Show that 1== f*.
(d) Formulate and prove a version of the Schwarz Reflection Principle
where the circle I I == 1 replaces fR. Do the same thing for an arbitrary circle.
3. Let G, G+, G_, Go be as in the statement of the Schwarz Reflection
Principle and let I: G + u Go  Coo be a continuous function such that I is
meromorphic on G +" Also suppose that for x in Go I(x) E fR. Show that there
is a meromorphic function g: G  Coo such that g(z) == I(z) for z in G+ u Go.
Is it possible to allow I to assume the value 00 on Go?
2. Analytic Continuation Along a Path
Let us begin this section by recalling the definition of a function. We use
the somewhat imprecise statement that a function is a triple (f, G, 0) where
G and 0 are sets and/is a "rule" which assigns to each element of G a unique
element of O. Thus, for two functions to be the same not only must the rule
be the same but the domains and the ranges must coincide. If we enlarge the
range 0 to a set 0 1 then (f, G, 01) is a different function. However, this
point should not be emphasized here; we do wish to emphasize that a change
in the domain results in a new function. Indeed, the purpose of analytic
continuation is to enlarge the domain. Thus, let G == {z: Re z > -I} and

214 Analytic Continuation and Riemann Surfaces
fez) = log (1 +z) for z in G, where log is the principal branch of the logarithm.
Let D = B(O; 1) and let
00 n
g(z) =  (-It- 1 :
n= 1
for z in D. Then (f, G, C) :f= (g, D, C) even thoughf(z) = g(z) for all z in D.
Nevertheless, it is desirable to recognize the relationship between f and g.
This leads, therefore, to the concept of a germ of analytic functions.
2.1 Definition. A function element is a pair (f, G) where G is a region and
f is an analytic function on G. For a given function element (f, G) define the
germ of f at a to be the collection of all function elements (g, D) such that
a E D and fez) = g(z) for all z in a neighborhood of a. Denote the germ
by [f]a.
Notice that [f]a is a collection of function elements and it is not a function
element itself. Also (g, D) E [f]a if and only if (f, G) E [gJa. (Verify!). It should
also be emphasized that it makes no sense to talk of the equality of two
germs [fJa and [g]b unless the points a and b are the same. For example, if
(f, G) is a function element then it makes no sense to say that [fJa = [fJb
for two distinct points a and b in G.
2.2 Definition. Let y: [0, 1]  C be a path and suppose that for each t in
[0, 1] there is a function element eft, Dt) such that:
(a) yet) E Dt;
(b) for each t in [0, 1] there is as> 0 such that Is - tl < S implies
yes) E Dt and
2.3 [hJ yes) = LhJ yes).
Then (fl' D 1 ) is the analytic continuation of (fa, Do) along the path y; or,
(fl' D 1 ) is obtained from (fa, Do) by analytic continuation along y.
Before proceeding, examine part (b) of this definition. Since y is a
continuous function and yet) is in the open set D p it follows that there is a
S > 0 such that yes) E Dt for Is- t/ < S. The important content of part (b)
is that (2.3) is satisfied whenever Is - t/ < S. That is,
h(z) = fr(z), zEDs n Dt
whenever Is - tl < S.
Whether for a given curve and a given function element there is an
analytic continuation along the curve can be a difficult question. Since no
degree of generality can be achieved which justifies the effort, no existence
theorems for analytic continuations will be proved. Each individual case
will be considered by itself. Instead uniqueness theorems for continuations
are proved. One such theorem is the Monodromy Theorem of the next
section. This theorem gives a criterion by which one can tell when a con-
tinuation along two different curves connecting the same points results in the
same function element.

Analytic Continuation Along a Path 215
The next proposition fixes a curve and shows that two different con-
tinuations along this curve of the same function element result in the same
function element. Alternately, this result can be considered as an affirmative
answer to the following question: Is it possible to define the concept of
"the continuation of a germ along a curve?"
2.4 Proposition. Let y: [0, 1]  C be a path from a to b and let {(It, Dt):
o < t < I} and {(gt, Bt): 0 < t < I} be analytic continuations along y such
that [fo]a = [g O]a- Then [fdb = [g l]b-
Proof This proposition will be proved by showing that the set
T = {t E [0, 1]: [ltly(t) = [gt]y(t)}
is both open and closed in [0, 1]; since T is non-empty (0 E T) it will follow
that T = [0, 1] so that, in particular, 1 E T_
The easiest part of the proof is to show that T is open. So fix t in T and
assume t =1= 0 or 1. (If t = 1 the proof is complete; if t = 0 then the argu-
ment about to be given will also show that [a,a+8)c Tfor some 0 > 0.)
By the definition of analytic continuation there is a 0 > 0 such that for
Is-tl < 0, yes) EDt n Bt and
2.5 { [h] y(s) = [It] y(s)-
[gs] yes) = [g t] y(s)-
But since t E T, j(z) = gtCz) for all z in Dt n Bt. Hence [1t]y(S) = [gt]y(s) for
all yes) in Dt n Bt. So it follows from (2.5) that [j]y(S) = [gs]y(S) whenever
Is- tl < o. That is, (t-o, t+o) c T and so T is open.
To show that T is closed let t be a limit point of T, and again choose
o > 0 so that yes) E Dt n Bt and (2.5) is satisfied whenever Is - tl < o. Since
t is a limit point of T there is a point s in T with Is - tl < 0; so G = Dt n Bt
n Ds n Bs contains yes) and, therefore, is a non-empty open set. Thus,
h(z) = gs(z) for all z in G by the definition of T_ But, according to (2.5),
j(z) = frCz) and gs(z) = grCz) for all z in G. So frCz) = gt(z) for all z in G
and, because G has a limit point in Dt n Bo this gives that [ft]y(t) = [gt]y(t).
That is, t E T and so T is closed. II
2.6 Definition. If y: [0, 1]  C is a path from a to b and {(It, Dt): 0 < t < I}
is an analytic continuation along y then the germ [fl]b is the analytic con-
tinuation of [fo]a along y.
The preceding proposition implies that Definition 2.6 is unambiguous.
As stated this definition seems to depend on the choice of the continuation
{(It, Dt)}. However, Proposition 2.4 says that if {(go Bt)} is another con-
tinuation along y with [fo]a = [g O]a then [fl]b = [g db. So in fact the definition
does not depend on the choice of continuation.
2.7 Definition. If (f, G) is a function element then the complete analytic
function obtained from (f, G) is the collection :F of all germs [g]b for which
there is a point a in G and a path y from a to b such that [g]b is the analytic
continuation of [f]a along y-

216 Analytic Continuation and Riemann Surfaces
A collection of germs :F is called a complete analytic function if there is a
function element (f, G) such that :F is the complete analytic function ob-
tained from (f, G).
Notice that the point a in the definition is immaterial; any point in G
can be chosen since G is an open connected subset of C (see II. 2.3). Also,
if :F is the complete analytic function associated with (f, G) then [f]z E :F
for all z in G.
Although there is no ambiguity in the definition of a complete analytic
function there is an incompleteness about it. Is it a function? We should
refrain from calling an object a function unless it is indeed a function. To
make  a function one must manufacture a domain (the range will be C)
and show that :F gives a "rule". This is easy. In a sense we let :F be its own
domain; more precisely, let
f!lt = {(z, [f]z): [f]z E }.
Define :F: f!lt  C by (z, [f]z) = fez). In this way :F becomes an "honest"
function. Nevertheless there is still a lingering dissatisfaction. To have a
satisfying solution a structure will be imposed on f!lt which will make it
possible to discuss the concept of analyticity for functions defined on f!lt.
In this setting, the function :F defined above becomes analytic; moreover, it
reflects the behavior of each function element belonging to a germ that is in
:F. The introduction of this structure is postponed until Section 5.
Exercises
1. The collection {D 0, D l' . . . , Dn} of open disks is called a chain of disks
if D j - 1 n Dj :f= D for 1 < j < n. If {(fj, D j ): 0 < j < n} is a collection of
function elements such that {Do, D 1 , . . . , Dn} is a chain of disks andfj-l(z)
= fj(z) for z in Dj-l n Dj, 1 < j < n; then {(fj, D j ): 0 < j < n} is called
an analytic continuation along a chain of disks. We say that (In, Dn) is obtained
by an analytic continuation of (fo, Do) along a chain of disks.
(a) Let {(fj, D j): 0 < j < n} be an analytic continuation along a chain
of disks and let a and b be the centers of the disks Do and Dn respectively.
Show that there is a path y from a to b and an analytic continuation {(gt, Bt)}
n
along y such that {y} cUD j, [fo]a = [g o]a, and [fn]b = [g db.
j=O
(b) Conversely, let {(j;, Dt): 0 < t < I} be an analytic continuation
along a path y: [0, 1]  C and let a = y(O), b = y(I). Show that there is an
analytic continuation along a chain of disks {(gj, B j ): 0 < j < n} such that
n
{y} cUB j, [fo]a = [g o]a, and Lfdb = [gn]b.
j=O
2. Let Do = B(I; 1) and let fo be the restriction of the principal branch of
z to Do. Let yet) = exp (27Tit) and aCt) = exp (47Tit) for 0 < t < 1.
(a) Find an analytic continuation {(j;, Dt): 0 < t < I} of (fo, Do) along
y and show that [/dl = [-10]1.

Monodromy Theorem 217
(b) Find an analytic continuation {(gt, Bt): 0 < t < I} of (/0, Do) along
a and show that [gd1 = [gO]1.
3. Letlbe an entire function, Do = B(O; 1), and let y be a path from 0 to b.
Show that if {(It, Dt): 0 < t < I} is a continuation of (f, Do) along y then
It (z) = I(z) for all z in Dt. (This exercise is rather easy; it is actually an
exercise in the use of the terminology.)
4. Let y: [0, 1] -+ C be a path and let {(ft, Dt): 0 < t < I} be an analytic
continuation along y. Show that {(f:, Dt): 0 < t < I} is also a continuation
along y.
5. Suppose y: [0, 1] -+ C is a closed path with y(O) = y(l) = a and let
{(It, Dt): 0 < t < I} be an analytic continuation along y such that [/t]a =
[f]a and 10 =1= O. What can be said about (/0, Do)?
6. Let Do = B(I; 1) and let 10 be the restriction to Do of the principal
branch of the logarithm. For an integer n let yet) = exp (27Tint), 0 < t < 1.
Find a continuation {(It, Dt): 0 < t < I} along y of (/0' Do) and show that
[/d1 = [/0 + 27Tin] 1.
7. Let y: [0, 1] -+ C be a path and let {(It, Dt): 0 < t < I} be an analytic
continuation along y. Suppose G is a region such that IlDt) c G for all t,
and suppose there is an analytic function h: G -+ C such that h(/o(z» = z
for all z in Do. Show that h(ft(z» = z for all z in Dt and for aJI t.
Hint: Show that T = {t: h(ft(z» = z for all z in Dt} is both open and
closed in [0, 1].
8. Let y: [0, 1] -+ C be a path with y(O) = 1 and yet) '# 0 for any t. Suppose
that {(ft, Dt): 0 < t < I} is an analytic continuation of lo(z) = log z. Show
that each ft is a branch of the logarithm.
3. Monodromy Theorem
Let a and b be two complex numbers and suppose y and (J are two
paths from a to b. Suppose {(J;, Dr)} and {( gr' BJ} are analytic continua-
tions along y and (J respectively, and also suppose that [fo]a = [gO]a. Does it
follow that [fdb = [gdb? If y and (J are the same path then Proposition 2.4
gives an affirmative answer. However, if y and (J are distinct then the
answer can be no. In fact, Exercises 2.2 and 2.6 furnish examples that
illustrate the possibility that [fdb #= [g l]b' Since both of these examples
involve curves that wind around the origin, the reader might believe that a
sufficient condition for [fdb and [gl]b to be equal can be couched in the
language of homotopy. However, since all curves in the plane are homo-
topic the result would have to be phrased in terms of homotopy in a
proper subregion of C. For the examples in Exercises 2.2 and 2.6, this
sought after criterion must involve the homotopy of the curves in the
punctured plane. This is indeed the case. The origin is discarded in the
above examples because there is no germ [h]o centered at zero that belongs
to the complete analytic function obtained from (fa, Do).
If (f, D) is a function element and a E D then I has a power series expan-

218 Analytic Continuation and Riemann Surfaces
sion at z = a. The first step in proving the Monodromy Theorem is to
investigate the behavior of the radius of convergence for an analytic continua-
tion along a curve.
3.1 Lemma. Let y: [0, 1] -+ C be a path and let {(It, Dt): 0 < t < I} be an
analytic continuation along y. For 0 < t < 1 let R(t) be the radius of con-
vergence of the power series expansion of It about z = yet). Then either R(t)
= 00 or R: [0, 1] -+ (0, (0) is continuous.
Proof If R(t) = 00 for some value of t then it is possible to extend It to an
entire function. It follows that ,h(z) = It(z) for all z in Ds so that R(s) = 00
for each s in [0, 1]; that is R(s) = 00. So suppose that R(t) < 00 for all t.
Fix t in [0, 1] and let T = y(t); let
00
It(z) = L Tn(Z-T)n
n= 0
be the power series expansion of It about T. Now let 8 1 > 0 be such that
Is-tl < 8 1 implies that yes) EDt n B(T; R(t)) and [,h]y(s) = [ft]y(s). Fix s
with Is- tl < 8 1 and let a = yes). Now It can be extended to an analytic
function on B(T; R(t)). Since,h agrees with It on a neighborhood of a, Is can
be extended so that it is also analytic on B( T; R(t)) U Ds. If Is has power
. .
sefJes expanSIon
00
Is(z) = L an(z - a)n
n= 0
about z = a, then the radius of convergence R(s) must be at least as big as
the distance from a to the circle /z-TI = R(t): that is, R(s) > dCa, {z: IZ-TI
= R(t)}) > R(t)-IT-al. But this gives that R(t)-R(s) < ly(t)-y(s)l. A
similar argument gives that R(s) - R(t) < Iy(t) - y(s)/; hence
IR(s)-R(t)1 < ly(t)-y(s)1
for Is - t I < 8 1 . Since y: [0, 1] -+ C is continuous it follows that R must be
continuous at t. II
3.2 Lemma. Let y: [0,1] -+ C be a path from a to b and let {(It, Dt): 0 < t
< I} be an analytic continuation along y. There is a number € > 0 such that
if a: [0, 1] -+ C is any path from a to b with Iy(t) - a(t)1 < € for all t, and if
{(gt, Bt): 0 < t < I} is any continuation along a with [g O]a = [fo]a; then
[g db = L/]b.
Proof For 0 < t < 1 let R(t) be the radius of convergence of the power
series expansion of It about z = yet). It is left to the reader to show that if
R(t) = 00 then any value of E will suffice. So suppose R(t) < 00 for all t.
Since, by the preceding lemma, R is a continuous function and since R(t) > 0
for all t, R has a positive minimum value. Let
3.3 0 < E < 1- min {R(t): 0 < t < I}
and suppose that a and {(gt, Bt)} are as in the statement of this lemma.

3.4
Monodromy Theorem 219
Furthermore, suppose that Dt is a disk of radius R(t) about yet). The truth of
the conclusion will not be affected by this assumption (Why?), and the
exposition will be greatly simplified by it.
Since la(t) -y(t)1 < € < R(t), aCt) E Bt (\ Dt for all t. Thus, it makes
sense to ask whether gt(z) == h(z) for all z in Bt (\ Dt. Indeed, to complete
the proof we must show that this is precisely the case for t == 1. Define the
set T == {t E [0, 1]: h(Z) == gt(z) for z in Bt (\ Dt}; and show that 1 E T.
This is done by showing that T is a non-empty open and closed subset of
[0, 1].
From the hypothesis of the lemma, 0 E T so that T =1= D. To show T is
open fix t in T and choose 8 > 0 such that
ly(s)-y(t)1 < €, [h]y(s) == [h]y(s),
la(s) - a(t)1 < €, [gs]a(s) == [gt]a(s), and
a(s) E Bt
whenever Is-tl < 8. We will now show that Bs (\ Bt (\ Ds (\ Dt =1= D for
Is - tl < 8; in fact, we will show that a(s) is in this intersection. If Is - tl < 0
then
la(s) -y(s)/ < € < R(s)
so that a(s) E Ds. Also
/a(s)-y(t)1 < la(s)-y(s)1 + ly(s)-y(t)1 < 2€ < R(t)
by (3.3); so a(s) EDt. Since we already have that a(s) E Bs (\ Bt by (3.4),
a(s) E Bs (\ Bt (\ Ds (\ Dt == G.
Since t E T it follows that ft(z) == gt(z) for all z in G. Also, from (3.4) h(z) ==
h(z) and gs(z) == gt(z) for all z in G. Thus h(z) == gs(z) for z in G; but since
G has a limit point in Bs (\ Ds it must be that SET. That is, (t-8, t+8) c T
and T is open. The proof that T is closed is similar and will be left to the
reader. II
3.5 Definition. Let (f, D) be a function element and let G be a region which
cor...ains D; then (f, D) admits unrestricted analytic continuation in G if for
any path y in G with initial point in D there is an analytic continuation of
(f, D) along y.
If D == {z: Iz -11 < I} and f is the principal branch of Jz or log z then
(f, D) admits unrestricted continuation in the punctured plane but not in
the whole plane (see Exercise 2.7).
It has been stated before that an existence theorem for analytic con-
tinuations will not be proved. In particular, if (f, D) is a function element
and G is a region containing D, no criterion will be given which implies that
(f, D) admits unrestricted continuation in G. The Monodromy Theorem
assumes that G has this property and states a uniqueness criterion.
3.6 Monodromy Theorem. Let (f, D) be a function element and let G be a
region containing D such that (f, D) admits unrestricted continuation in G.

220 Analytic Continuation and Riemann Surfaces
Let a E D, bEG and let Yo and YI be paths in G from a to b; let {(ft, Dt):
o < t < I} and {(gt, D t): 0 < t < I} be analytic continuations of (f, D) along
Yo and YI respectively. If Yo and YI are FEP homotopic in G then
[fdb = [gdb.
Proof Since Yo and YI are fixed-end-point homotopic in G there is a con-
tinuous function f: [0, I] x [0, I] -+ G such that
f(t, 0) = Yo(t)
f(O, u) = a
f(t, 1) = YI(t)
f(l,u) = b
for all t and u in [0, I]. Fix u, 0 < u < 1 and consider the path Yu, defined
by Yu(t) = r(t, u), from a to b. By hypothesis there is an analytic continuation
{(ht,u, Dt,u): 0 < t < I}
of (f, D) along Yu. It follows from Proposition 2.4 that [g db = [h I, db and
[fdb = [h I, O]b. So it suffices to show that
[h I , 0] b = [h I, db.
To do this introduce the set
u = {u E [0, 1]: [hI ,u]b = [hI, O]b},
and show that U is a non-empty open and closed subset of [0, 1]. Since
o E U, U i= D. To show that U is both open and closed we will establish the
following.
3.7 Claim. For u in [0, 1] there is as> 0 such that if /u - vi < S then [h 1, u]b =
[h I, v]b. For a fixed u in [0, 1] apply Lemma 3.2 to find an € > 0 such that if
a is any path from a to b with /Yu(t) - a(t)1 < € for all t, and if {(kt, Et)} is
any continuation of (f, D) along a, then
3.8
[hl,u]b = [kdb.
Now f is a uniformly continuous function, so there is as> 0 such that
if /u - vi < S then /Yu(t) - Yv(t) I = / r(t, u) - r(t, v)1 < € for all t. Claim 3.7
now follows by applying (3.8).
Suppose u E U and let  > 0 be the number given by Claim 3.7. By the
definition of U, (u - , u + ) c U; so U is open. If u E U- and  is again
chosen as in (3.7) then there is a v in U such that lu - vi < . But by (3.7)
[hI, u]b = [hI, v]b; and since v E U, [hI, v]b = [hl,o]b. Therefore [hI, u]b =
[h t, O]b so that u E U, that is, U is closed. II
The following corollary is the most important conseq uence of the
Monodromy Theorem.
3.9 Corollary. Let (f, D) be a function element vhich admits unrestricted
continuation in the simply connected region G. Then there is an analytic
function F: G  C such that F(z) = fez) for all z in D.
Proof Fix a in D and let z be any point in G. If y is a path in G from a to z

Topological Spaces and Neighborhood Systems 221
and {(fn Dt): 0 < t < I} is an analytic continuation of (f, D) along y then
let F(z, y) = 11 (z). Since G is simply connected F(z, y) = F(z, a) for any
two paths y and a in G from a to z. Thus, F(z) = F(z, y) gives a well defined
function F: G -+ C. To show that F is analytic let z E G and let y and
{(fr, Dt)} be as above. A simple argument gives that F(w) = 11 (w) for w in a
neighborhood of z (Verify!); so F must be analytic. II
Exercises
1. Prove that the set T defined in the proof of Lemma 3.2 is closed.
2. Let (f, D) be a function element and let a E D. If y: [0, 1]  C is a path
with y(O) = a and y(I) = band {(fr, Dt): 0 < t < I} is an analytic con-
tinuation of (f, D) along y, let R(t) be the radius of convergence of the power
series expansion of fr at z = yet).
(a) Show that R(t) is independent of the choice of continuation. That is,
if a second continuation {(gt, Bt)} along y is given with [g O]a = [f]a and r(t)
is the radius of convergence of the power series expansion of gt about
z = yet) then r(t) = R(t) for all f.
(b) Suppose that D = B(I; 1), I is the restriction of the principal branch
of the logarithm to D, and yet) = 1 +a f for 0 < f < 1 and a > o. Find
R(t).
(c) Let (f, D) be as in part (b), let 0 < a < 1 and let yet) = (l-a f)
exp (27Tit) for 0 < t < 1. Find R(t).
(d) For each of the functions R(t) obtained in parts (b) and (c), find
min {R(t): 0 < t < I} as a function of a and examine the behavior of this
function as a  00 or a  O.
3. Let r: [0, 1] x [0, 1] - G be a continuous function such that reo, u) = a,
r(l, u) = b for all u. Let yu(t) = r(t, u) and suppose that {(h,u, Dt,u):
o < t < I} is an analytic continuation along Yu such that [/o,u]a = [fo,v]a for
all u and v in [0, 1]. Let R(f, u) be the radius of convergence of the power
series expansion of fr,u about z = r(t, u). Show that either R(f, u) = 00 or
R: [0, 1] x [0, 1]  (0, 00) is a continuous function.
4. Use Exercise 3 to give a second proof of the Monodromy Theorem.
4. Topological Spaces and Neighborhood Systems
The notion of a topological space arises by abstracting one of the most
important concepts in the theory of metric spaces-that of an open set.
Recall that in Chapter II we were given a metric or distance function on a
set X and this metric was used to define what is meant by an open set. In a
topological space we are given a collection of subsets of a set X which are
called open sets, but there is no metric available. After axiomatizing the
properties of open sets, it will be our purpose to recreate as much of the
theory of metric spaces as is possible.
4.1 Definition. A topological space is a pair (X, ff) where X is a set and ff
is a collection of subsets of X having the following properties:

222
Analytic Continuation and Riemann Surfaces
(a) D E Y and X E Y;
n
(b) if VI' . . . , V n are in Y then n V j E Y;
j=l
(c) if {Vi: i E I} is any collection of sets in Y then U Vi is in Y.
iEI
The collection of sets Y is called a topology on X, and each member of Y
is called an open set.
Notice that properties (a), (b), and ( c) of this definition are the
properties of open subsets of a metric space that were proved in Proposi-
tion I I. 1.9. So if (X, d) is a metric space and :T is the collection of all open
subsets of X then (X,ff) is a topological space.
When it is said that a topological space is an abstraction of a metric
space, the reader should not get the impression that he is merely playing a
game by discarding the metric. That is, no one should believe that there is a
distance function in the background, but the reader is now required to prove
theorems without resorting to it. This is quite false. There are topological
spaces (X, Y) such that for no metric d on X is Y the collection of open
sets obtained via d. We will see such an example shortly, but it is first neces-
sary to further explore this concept of a topology.
The statement "Let X be a topological space" is, of course, meaningless;
a topological space consists of a topology Y as well as a set X. However,
this phase will be used when there is no possibility of confusion.
4.2 Definition. A subset F of a topological space X is closed if X - F is
open. A point a in X is a limit point of a set A if for every open set U that
contains a there is a point x in A f1 U such that x =1= a.
Many of the proofs of propositions in this section follow along the same
lines as corresponding propositions in Chapter II. When this is the case the
proof will be left to the reader. Such is the case with the following two
proposi tions.
4.3 Proposition. Let (X, Y) be a topological space. Then:
(a) D and X are closed sets;
(b) if F I , . . . , Fn are closed sets then F 1 U . . . u Fn is closed;
(c) if {F i : i E I} is a collection of closed sets then n F i is a closed set.
i E l
4.4 Proposition. A subset of a topological space is closed iff it contains all its
limit points.
Now for an example of a topological space that is not a metric space.
Let X = [0, I] = { t : 0 < t < I} and let Y consist of all sets U such that:
(i) if 0 E V then X-V is either empty or a sequence of points in X;
(ii) if 0 i V then V can be any set.
I t is left to the reader to prove that (X, ff) is a topological space. Some
of the examples of open sets in this topology are: the set of all irrational
numbers in X; the set of all irrational numbers together with zero. To see

Topological Spaces and Neighborhood Systems 223
that no metric can give the collection of open sets fY, suppose that there is
such a metric and obtain a contradiction. Suppose that d is a metric on X
such that U E fY iff for each x in U there is an E > 0 such that B(x; E) ==
{y: d(x, y) < E} C U. Now let A == (0, 1); if U E fY and 0 E Uthen there is a
point a in UnA, a i= 0 (in fact there is an infinity of such points). Hence,
o is a limit point of A. It follows that there is a sequence {In} in A such that
d(ln, 0)  O. But if U == {x E X: x i= In for any n} == X - {II' 1 2 " . .} then
o E U and U is open. So it must follow that In E U for n sufficiently large;
this is an obvious contradiction. Hence, no metric can be found.
This example illustrates a technique that, although available for metric
spaces, is of little use for general topological spaces: the convergence of
sequences. It is possible to define "convergent sequence" in a topological
space (Do it !), but this concept is not as intimately connected with the
structure of a topological space as it is with a metric space. For example, it
was shown above that a point can be a limit point of a set A but there is no
sequence in A that converges to it.
If a topological space (X, 5) is such that a metric d on X can be found
with the property that a set is in fY iff it is open in (X, d), then (X, fY) is
said to be melrisable. There are many non-metrisable spaces. In addition to
inventing non-metrisable topologies as was done above, it is possible to
define processes for obtaining new topological spaces from old ones which
will put metrisable spaces together to obtain non-metrisable ones. For
example, the arbitrary cartesian product of topological spaces can be defined;
in this case the product space is not metrisable unless there are only a count-
able number of coordinates and each coordinate space is itself metrisable.
(See VII. 1.18.)
Another example may be obtained as follows. Consider the unit interval
I == [0, 1]. Stick one copy of / onto another and we have a topological space
which still "looks like" I. For example, [1, 2] is a copy of / and if we stick
it onto I we obtain [0, 2]. In fact, if we "stick" a finite number of closed
intervals together another closed interval is obtained. What happens if a
countable number of closed intervals are stuck together? The answer is that
we obtain the infinite interval [0, (0). (If the intervals are stuck together on
both sides then  is obtained.) What happens if we put together an uncount-
able number of copies of /? The resulting space is called the long line. Locally
(i.e., near each point) it looks like the real line. However, the long line is not
metrisable. As a general rule of thumb, it may be said that if a process is used
to obtain new spaces from old ones, a non-metrisable space will result if
the process is used an uncountable number of times.
For another example of a space that is non-metrisable let X be a set
consisting of three points-say X == {a, b, c}. Let fY == {D, X, {a}, {b},
{a, b} }; it is easy to check that fY is a topology for X. To see that (X, fY)
is not metrisable notice that the only open set containing c is the set X itself.
There do not exist disjoint open sets U and V such that a E U and C E V.
On the other hand if there was a metric d on X such that g- is the collection
of open sets relative to this metric then it would be possible to find such

224 Analytic Continuation and Riemann Surfaces
open sets (e.g., let U = B(a; €) and V = B(c; €) where € < dCa, c». In other
words, (X, ff) fails to be metrisable because Y does not have enough open
sets to separate points. (Does the first example of a non-metrisable space also
fail because of this deficiency?) The next definition hypothesizes enough open
sets to eliminate this difficulty.
4.5 Definition. A topological space (X, ff) is said to be a Hausdorff space
if for any two distinct points a and b in X there are disjoint open sets U and
V such that a E U and b E V.
Every metric space is a Hausdorff space. As we have already seen there
are examples of topological spaces which are not Hausdorff spaces. Many
authors include in the definition of a topological space the property of a
Hausdorff space. This policy is easily defended since most of the examples of
topological spaces which one encounters are, indeed, Hausdorff spaces.
However there are also some fairly good arguments against this combining
of concepts. The first argument is that mathematical pedagogy dictates
that ideas should be separated so that they may be more fully understood.
The second, and perhaps more substantial reason for not assuming all spaces
to be Hausdorff, is that more examples of nbn-Hausdorff spaces are arising
in a natural context. Even though there will be no non-Hausdorff space
which will appear in this book, this separation of the two concepts will be
maintained for a while longer.
The next step in this development is the definition, in the setting of
topological spaces, of certain concepts encountered in the theory of metric
spaces and the stating of analogous propositions.
4.6 Definition. A topological space (X, ff) is connected if the only non-
empty subset of X which is both open and closed is the set X itself.
4.7 Proposition. Let (X, ff) be a topological space; then X = U {C i : i E I}
where each C i is a component of X (a maximal connected subset of X). Further-
more, distinct components of X are disjoint and each component is closed.
4.8 Definition. Let (X, ff) and (12, Y) be topological spaces. A function
f: X -+ 12 is continuous if.r-l() E ff whenever  E Y.
4.9 Proposition. Let (X, ff) and (12, Y) be topological spaces and let,r: X -+ 12
be a function. Then the following are equivalent:
(a) f is continuous;
(b) if A is a closed subset of12 thenf-l(A) is a closed subset of X;
(c) if a E X and if f(a) E  E Y then there is a set U in :Y such that a E U
andf(U) c .
4.10 Proposition. Let (X, 5) and (12, Y) be topological spaces and suppose
that X is connected. If f: X -+ 12 is a continuous function such that f(X) = 12,
then Q is connected.
4.11 Definition. A set K c X is compact if for every sub-collection (!) of ff

Topological Spaces and Neighborhood Systems 225
such that K c U {U: U E (9} there are a finite number of sets U 1 , . . . , Un
n
in (9 such that K c U Uk.
k=l
4.12 Proposition. Let (X, Y) and (O, Y) be topological spaces and suppose
K is a compact subset of x. If f: X -+ Q is a continuous function then f{K) is
compact in Q.
If (X, d) is a metric space and Y c X then (Y, d) is also a metric space.
Is there a way of making a subset of a topological space into a topological
space? We could, of course, declare every subset of Y to be open an this
would make Y into a topological space. But what is desired is a topology on
Ywhich has some relationship to the topology on X; a natural topology on a
subset of a topological space.
If (X, 9) is a topological space and Y c X then define
Y y = {Un Y: UEY}.
It is easy to check that Y y is a topology on Y.
4.13 Definition. If Y is a subset of a topological space (X, 9) then Y y is
called the relative topology on Y. A subset W of Y is relatively open in Y
if W E :T y; W is relatively closed in Y if Y - W E :T y.
Whenever we speak of a subset of a topological space as a topological
space it will be assumed that it has the relative topology unless the contrary
is explicitly stated.
4.14 Proposition. Let (X, 9) be a topological space and let Y be a subset of x.
(a) If X is compact and Y is a closed subset of X then (Y, Y y) is compact.
(b) Y is a compact subset of X iff{Y, Yy) is a compact topological space.
(c) If{X, Y) is a Hausdorffspace then (Y, Yy) is a Hausdorffspace.
(d) If{X, :T) is a Hausdorff space and (Y, Y y) is compact then Y is a closed
subset of x.
Proof The proofs of (a), (b), and (c) are left as exercises. To prove part (d)
it suffices to show that for each point a in X - Y there is an open set U such
that a E U and U n Y = D. So fix a point a in X - Y; for each point y in Y
there are open sets U y and V y in X such that a E U Y ' Y E V Y ' and U y n V y =
D {because (X, Y) is a Hausdorff space). Then {V y n Y: y E Y} is a collec-
tion of sets in Y y which covers Y. So there are points Y1, . . . , Yn in Y such
n n n
that Y c U (V Yi n Y) c U V Yi = V. Since a E U Yi for each i, a E U = n
;=/ ;=/ n ;=1
U yi ; also U E:T. It is easily verified that Un V = U (U n V y ) = D so
that Un Y= D._ i=l
The proof of this proposition yields a stronger result.
4.15 Corollary. Let (X, 9) be a Hausdorff space and let Y be a compact
subset of X; then for each point a in X - Y there are open sets U and V in X
such that a E U, Y c V. and U n V = D.
If we return to the consideration of metric spaces we can discover a new

226 Analytic Continuation and Riemann Surfaces
way to define a topology. The sequence of steps by which open sets are
obtained in a metric space are as follows: the metric is given, then open balls
are defined, then open sets are defined as those sets which contain a ball
about each of their points. What we wish to mimic now is the introduction
of balls; this is done by defining a neighborhood system on a set.
4.16 Definition. Let X be a set and suppose that for each point x in X there
is a collection JV x of subsets of X having the following properties:
(a) for each U in JV x , x E U;
(b) if U and V EJV x , there is a W in JV x such that W c U n V;
(c) if U E..lV.x and V E JV y then for each z in V n V there is a W in 
such that W c V n V.
Then the collection {.: x E X} is called a neighborhood system on X.
If (X, d) is a metric space and if x E X then JV x = {B(x; E): E > O} gives
a collection {JV x : x E X} which is a neighborhood system. In fact, this was
the prototype of the above definitions.
Notice that condition (c) relates the neighborhood systems of different
points. If only conditions (a) and (b) were satisfied, it would not follow that
these neighborhoods would be open sets in the topology to be defined. For
example, if X is a metric space and JV x is the collection of closed balls about
x then {JV x : x E X} satisfies conditions (a) and (b) but not (c). Moreover, it
is easy to verify that by letting x = y = z condition (b) can be deduced from
(c) (Verify!).
The next proposition relates neighborhood systems and topological
spaces.
4.17 Proposition. (a) If (X, 3) is a topological space and JV x = {V E ff:
x E V} then {JV x : x E X} is a neighborhood system on X.
(b) If {JV x : x E X} is a neighborhood system on a set X then let ff = {U:
x in V implies there is a V in JV x such that V c V}. Then ff is a topology on
X and JV x c ff for each x.
(c) If(X, ff) is a topological space and {JV x : x E X} is defined as in part
(a), then the topology obtained as in part (b) is again ff.
(d) If {JV x : x E X} is a given neighborhood system and ff is the topology
defined in part (b), then the neighborhood system obtained from ff contains
{JV x : x E X}. That is, if V is one o.f the neighborhoods of x obtained from ff
then there is a V in JV x such that V c v.
Proof The proof of parts (a), (c), and (d) are left to the reader. To prove part
(b), first observe that both X and D are in ff(D E ff since the conditions
n
are vacuously satisfied). Let VI' . . . , V n E ff and put V = n V j . If x E U
j=l
then for each j there is a V j in ..AI X such that V j c V j . It follows by induction
n
on part (b) of Definition 4.16 that there is a V in JV x such that V c n V j .
j=l
Thus V c V and U must belong to ff. Since the union of a collection of

The Sheaf of Germs of Analytic Functions on an Open Set 227
sets in .r is clearly in .r, :T is a topology. Finally, fix x in and let U E JV x '
If y E U it follows from part (c) of Definition 4.16 that there is a V in JV y
such that V c U. Thus U E :T. II
4.18 Definition. If {<: x E X} is a neighborhood system on X and :T is the
topology defined in part (b) of Proposition 4.17, then :T is called the topology
induced by the neighborhood system.
4.19 Corollary. If {Al x : x E X} is a neighborhood system on X and :T is the
induced topology then (X, :T) is a Hausdorff space iff for any two distinct
points x and y in X there is a set U in  and a set V in JV y such that
U n V == D.
Exercises
I. Prove the propositions which were stated in this section without proof.
2. Let (X, :T) and (f2, Y) be topological spaces and let Y c X. Show that
if f: X  0 is a continuous function then the restriction of f to Y is a con-
tinuous function of (Y, :T y) into (0, Y).
3. Let X and 0 be sets and let {Al x : x E X} and {ult w: W EO} be neigh-
borhood systems and let :T and Y be the induced topologies on X and 0
respectively.
(a) Show that a function f: X  0 is continuous iff when x E X and
W == f(x), for each  in ult w there is a U in  such thatf(U) c .
(b) Let X == f2 == C and let  == ult z == {B(z; E): E > O} for each z in C.
Interpret part (a) of this exercise for this particular situation.
4. Adopt the notation of Exercise 3. Show that a function f: X  0 is open
iff for each x in X and U in  there is a set  in uIt w (where w == f(x)) such
that  c f( U).
5. Adopt the notation of Exercise 3. Let Y c X and define 0/1 y == {Y n U:
U E Aly} for each y in Y. Show that {0/1 y: y E Y} is a neighborhood system
for Yand the topology it induces on Y is :T y.
6. Adopt the notation of Exercise 3. For each point (x, w) in Xx 0 let
o/1(x,w) == {Ux: UE, Eultw}
(a) Show that {Ol/(x,w): (x, w) E Xx O} is a neighborhood system on
Xx £2 and let f!JJ be the induced topology on Xx O.
(b) If U E:T and  E Y, call the set Ux  an open rectangle. Prove that
a set is in f!JJ iff it is the union of open rectangles.
(c) Define PI: XxOX and P2: Xx£20 by PI (x, w) == x and
P2(X, w) == w. Show that PI and P2 are open continuous maps. Furthermore
if (Z, ) is a topological space show that a function f: (Z, )  (Xx 0, f!JJ)
is continuous iff PI 0 f: Z  X and P2 0 f: Z  0 are continuous.
5. The Sheaf of Germs of Analytic Functions on an Open Set
This section introduces a topological space which plays a vital role in
complex analysis. In addition to the topological structure, an analytical

228 Analytic Continuation and Riemann Surfaces
structure is also imposed on this space (in the next section). This will furnish
the setting in which to study the complete analytic function as an analytic
function.
If (f, D) is a function element, recall that the germ of (f, D) at a point
z = a in D is the collection of all function elements (g, B) such that a E B
and g(z) = fez) for all z in B n D. This germ is denoted by [fL.
5.1 Definition. For an open set G in C let
f/(G) = {(z, [fL): z E G,fis analytic at z}.
Define a map p: f/(G)  C by p(z, [f]z) = z. Then the pair (f/(G), p) is
called the sheaf of germs of analytic functions on G. The map p is called the
projection map; and for each z in G, p -1(Z) = P -1( {z}) is called the stalk or
fiber over z. The set G is called the base space of the sheaf.
Notice that for a point (z, [fL) to be in f/(G), it is not necessary thatfbe
defined on all of G; it is only required that f be analytic in a neighborhood
of z.
How do we picture this sheaf? (There are, of course, too many dimensions
to form an accurate geometrical picture.) One way is to follow the agri-
cultural terminology used in the definition. On top of each stalk there is a
collection of germs; the stalks are tied together into a sheaf. A better feeling for
f/(G) can be obtained by examining the notation for points in f/(G). When we
consider a point (z, [f]z) in f/(G), think of a function element (f, D) in the germ
[f]z instead of the germ itself. For every point w in D there is a point (w, [f]w)
in f/(G). Thus about (z, [f]z) there is a sheet or surface {(w; [f]w): wED}.
In fact, f/(G) is entirely made up of such sheets and they overlap in various
ways. Alternately, we can think of f/( G) as the union of graphs; each point
(z, [f]z) in f/(G) corresponding to the point (z, fez)) on the graph of (f, D).
(The graph of (f, D) is a subset of C 2 or 4.) Two function elements are
equivalent at a point z if their graphs coincide near z.
A topology will be defined on f/( G) by defining a neighborhood system.
For an open set D contained in G and a function f: D  C analytic on D
define
5.2
N(f, D) = {(z, [f]z): zED}.
That is, N(f, D) is defined for each function element (f, D). If we think of
f/( G) as a collection of sheets lying above G which are indexed by the germs,
then N(f, D) is the part of that sheet 1 iexed by j' and which lies above D.
5.3 Theorem. For each point (a, [f]a) in f/(G) let
a,[f]a) = {N(g, B): a E Band [g]a = [f]a}.
then {a,[fJa): (a, [f]a) E f/(G)} is a neighborhood system on f/(G) and the
induced topology is Hausdorff. Furthermore. the induced topology makes the
map p: f/( G)  G continuous.
Proof. Fix (a, [/]a) in Y( G); since it is clear that condition (a) of Definition

The Sheaf of Germs of Analytic Functions on an Open Set 229
4.16 holds, it remains to verify that condition (c) holds. (Condition (b) is a
consequence of (c).) Let N(gl' B I ) and N(g2, B 2 ) EA(a,(f]a} and let
5.4 (b, [hJb) E N(gl, B 1 ) f1 N(g2, B 2 ).
It is necessary to find a function element (k, W) such that N(k, W) EA(b,(h]b)
and N(k, W) c N(gl' B I ) f1 N(g2, B 2 ). It follows from (5.4) that b E BI n B 2
and [h]b = [gl]b = [g2]b. If b EWe BI f1 B 2 and h is defined on W then
N(h, W) c N(gl' B 1 ) f1 N(g2, B 2 ).
To show that the induced topology is Hausdorff, use Corollary 4.19. So
let (a, [f]a) and (b, [g]b) be distinct points of !J?(G). We must find a neighbor-
hood N(f, A) of (a, [/]a) and a neighborhood N(g, B) of (b, [g]b) such that
N(f, A) n N(g, B) = D. How can it happen that (a, [/]a) =1= (b, [g]b)? There
are two possibilities. Either a =1= b or a = band [/]a =1= [g]a. If a =1= b then
let A and B be disjoint disks about a and b respectively; it follows immediately
that N(f, A) f1 N(g, B) = D. If a = b but Lf]a =1= [g]a' we must work a little
harder (but not much). Since [f]a =1= [g]a there is a disk D = B(a; r) such that
both f and g are defined on D and f(z) =1= g(z) for 0 < Iz - al < r. (It may
happen that f(a) = g(a) but this is inconsequential.)
Claim. N(f, D) f1 N(g, D) = D.
In fact, if (z, [h]z) E N(f, D) f1 N(g, D) then zED, Lh]z = [/]z, and [h]z =
[g]z. It follows thatfand g agree on a neighborhood of z, and this is a contra-
diction. Hence the induced topology is Hausdorff.
Let U be an open subset of G; begin the proof that p: !J?(G)  G is
continuous by calculating p -1( U). Since p(z, [/]z) = z,
P -1( U) == {(z, [/]z): z E U}.
So if (z, [/]z) E P - l( U) and D is a disk about z on whichf is defined and such
that D c U, N(f, D) c P -l( U). It follows that p must be continuous
(Exercise 4.3). II
Consider what was done when we showed that the induced topology was
Hausdorff. If a # b then (a, [fL) and (b, [g]b) were on different stalks
p -lea) and p -l(b); so these distinct stalks were separated. In fact, if a E A,
bE B and A f1 B = D then p-l(A) f1 p-I(B) = D. If a = b then (a, lfJa)
and (a, [g]a) lie on the same stalk p -lea). Since [fJa # [gJa we were able to
divide the stalk. That is, one germ was "higher up" on the stalk than the
other. '
In the remainder of this section some of the properties of !J?( G) as a
topological space are investigated. In particular, it will be of interest to
characterize the components of !/(G). However, we must first digress to
study some additional topological concepts.
5.5 Definition. Let (X, :T) be a topological space. If x 0 and XI E X then an
arc (or path) in X from Xo to Xl is a continuous function y: [0, 1]  X such
that y(O) = x 0 and y( I) = X 1. The point x 0 is called the initial point of y and
x 1 is called the .final point or terminal point. The trace of y is the set {y} =
{y( t): 0 < t < I}.

230 Analytic Continuation and Riemann Surfaces
A subset A of X is said to be arc}-vise or path wise connected if for any two
points Xo and Xl in A there is a path from Xo to Xl whose trace lies in A. The
topological space (X, ff) is called locally arcwise or pathwise connected if
for each point X in X and each open set U which contains X there is an open
arcwise connected set V such that X E V and V c U.
For each X in X let Alx be the collection of all open arcwise connected
subsets of X which contain x. Then X is locally arcwise connected iff
{Al x : x E X} is a neighborhood system which induces the original topology
on X. (Verify!)
The proof of the following proposition is left to the reader.
5.6 Proposition. Let (X, :T) be a topological space.
(a) If A is an arcwise connected subset of X then A is connected.
(b) If X is locally arcwise connected then each component of X is an open
set.
The converse to part (a) of the preceding proposition is not true. For
example let
x= {t+iSin: t > o}u {si: -1 < s < l}.
Since X is the closure of a connected set it is itself connected. However,
,
there is no arc from the point 1/1T to i which lies in X. X is also an example of
a topological space which is connected but not locally arcwise connected.
Suppose X is connected and locally arcwise connected; does it follow
that X is arcwise connected? The answer is yes. In fact, this is an abstract
version of a theorem which was proved about open connected subsets of the
plane. Since disks in the plane are connected, it follows that open subsets of
C are locally arcwise connected. Recall that in Theorem II. 2.3 it was proved
that for an open connected subset G of the plane, any two points in G can
be joined by a polygon which lies in G. Hence, a partial generalization of this
(the concept of a polygon in an abstract metric space is meaningless) is the
following proposition whose proof is virtually identical to the proof of II. 2.3.
5. 7 Prposition. If X is locally arcwise connected then an open connected
subset of X is arcwise connected.
We now return to the sheaf of germs of analytic functions on an open
set G.
5.8 Proposition. Let G be an open subset of the plane and let U be an open
connected subset of G such that there is an analytic function f defined on U.
Then N(f, U) is arcwise connected in !/(G).
Proof Let (a, [f]a) and (b, [f]b) be two generic points in Ntf, U); then
a, b E U. Since U is a region there is a path y: [0, 1]  U from a to b. Define
a: [0, 1]  N(f, U) by
aCt) = (y(t), [f]y(t».

The Sheaf of Germs of Ana]ytic Functions on an Open Set 231
Clearly a(O) = (a, [/L) and a(l) = (b, [f]b); if it can be shown that a is
continuous then a is the desired arc.
Fix t in [0, 1] and let N(g, V) be a neighborhood of a(t). Then yet) E V
and [f]y(t) = [g]y(t). So there is a number r > 0 such that B(y(t); r) c U (\ V
and fez) = g(z) for Iz-y(t)j < r. Also, since y is continuous there is a
S > 0 such that Iy(s) -y(t)J < r whenever Is- tl < S. Combining these last
two facts gives that
(t-S, t+S) c a-l(N(g, V)).
It follows from Exercise 4.3 that a is continuous. II
5.9 Corollary. !/(G) is locally arcwise connected and the components of !/(G)
are open arcwise connected sets.
Proof The first part of this corollary is a direct consequence of the preceding
proposition. The second half follows from Proposition 5.6(b) and Pro-
position 5.7. II
In light of this last corollary, it is possible to gain insight into the nature
of the components of !/(G) by studying 'the curves in !/(G).
5.10 Theorem. There is a path in !/(G) Irom (a, [/L) to (b, [g]b) iff there is a
path y in G from a to b such that [g]b is the analytic continuation ol[/]a along y.
Proof: Suppose that a: [0, 1]  t( G) is a path with a(O) = (a, [f]a)' a( I) =
(b, [g]b)' Then y = p 0 a is a path in G from a to b. Since a(t) E !/(G) for
each t, there is a germ [,h]y(t) such that
a(t) = (y(t), [It]y(t»).
We claim that {[,h]y(t): 0 < t < I} is the required continuation of [}']a
along y. Since [f]a = [fo]a and [g]b = [/db, it is only necessary to show that
{[,h]y(t)} is a continuation. For each t let Dt be a disk about z = yet) such
that Dt c G and It is defined on Dt. Fix t in [0, 1]; since N(ft, Dt) is a neigh-
borhood of a(t) and a is continuous, there is as> 0 such that
(t-S, t+S) c a-l(N(h, Dt)).
That is, if Is- tl < S then (y(s), [h]y(s») = a(s) E N(fr, Dt). But, by definition,
this gives that yes) E Dt and [h]y(s) = [j]y(s); and this is precisely the con-
dition needed to insure that {(,h, Dt): 0 < t < I} is a continuation along y
(Definition 2.2).
Now suppose that y is a curve in G from a to band {[fr]y(t): 0 < t < I}
is a continuation along y such that [/o]a = [f]a and [fl]b = [g]b' Define a:
[0, 1]  !/(G) by a(t) = (y(t), [fr]y(t»); it is claimed that a is a path from
(a, [f]a) to (b, [g]b)' Since the initial and final points of a are the correct ones
it is only necessary to show that a is continuous. Because the details of this
argument consist in retracing the steps of the first half of this proof, their
execution is left to the reader. II
5.11 Theorem. Let  c Y(G) and let (a, [/]a) E ; then  is a component of
!/ (G) iff'

Analytic Continuation and Riemann Surfaces
re = {(b, [g]b): [g]b is the continuation of[f]a along some curve in G}.
Proo.f. Suppose  is a component of Y( G); by Corollary 5.9  is an open
arcwise connected subset of Y(G). So by the preceding theorem, for each
point (b, [g]b) in , [g]b is the continuation of [f]a along some curve in G.
Conversely, if [g]b is the continuation of [j'Ja along some curve in G then
(b, [g]b) belongs to the component of Y(G) which contains (a, [f]a); that
is, (b, [g]b) E .
Now suppose that  consists of all points (b, [g]b) such that [g]b is a
contin uation of [f]a. Then  is arcwise connected and hence is connected.
If  1 is the component of Y(G) containing  then by the first half of this
proof it follows that  =  1. II
Notice that the point (a, [f]a) in the statement of the preceding theorem
has a transitory role; any point in the component will do.
Fix a function element (f, D) and recall that the complete analytic
function g- associated with (f, D) is the collection of all germs [g]z which
are analytic continuations of [f]a for any a in D (see Definition 2.7). Let
232
5.12
G = {z: there is a germ [gJz in g-};
it follows that G is open. In fact, if z E G then there is a germ [gJz in g; and a
disk B about z on which g is defined. Clearly BeG so that G is open.
It follows from Theorem 5.11 that
5.13
. = {(z, [g]z): [g]z E g;}
is a component of Y(C) and that p(fJi) = G. (It is also true that fJi c Y(G).)
5.14 Definition. Let g; be a complete analytic function. If fJi is the set
defined in (5.13) and p is the projection map of the sheaf Y(C) then the
pair (S?, p) is called the Riemann Surface of g;. The open set G defined in
(5.12) is called the base space of g;. '
5.15 Theorem. Let g; be a complete analytic function with base space G and
let (a!, p) be its Riemann Surface. Then p: fJi  G is an open continuous map.
Also, if(a, [f]a) is a point in / then there is a neighborhood N(f, D) of (a, [f]a)
such that p maps N(f, D) hOlneomorphically onto an open disk in the plane.
Proof Consider fJi as a component of Y(C). Since p: Y(C)  C is con-
tinuous it follows that p: fJi  G is continuous. To show that p is open it is
sufficient to show that p(N(j: U)) is open for each (f, U) (Exercise 4.4). But
p(N(f, U)) = U which is open.
If (a, [f]a) E fJi let D be an open disk such that (f, D) E [j']a. Then p:
N(f, D)  D is an open, continuous, onto map. To show that p is a homeo-
morphism it only remains to show that p is one-one on N(f, D). But if
(b, [f]b) and (c, [f]c) are distinct points of N(f, D) then b =1= c which gives
that p is one-one. II
Remarks. I n its standard usage the Riemann surface of a complete analytic
function consists not only of what is here called a Riemann Surface but also

Analytic Manifolds 233
some extra points-the branch points. These branch points correspond to
singularities and permit a deeper analysis of the complete analytic function.
Exercises
1. Define F: Y(C)  t by F(z, [f]z) = fez) and show that F is continuous.
2. Let ff be the complete analytic function obtained from the principal
branch of the logarithm and let G = C - {O}. If D is an open subset of G
andf: D  C is a branch of the logarithm show that [f]a E ff for all a in D.
Conversely, if (f, D) is a function element such that [f]a E ff for some a in
D, show thatf: D  C is a branch of the logarithm. (Hint: Use Exercise 2.8.)
3 Let G = C - {O}, let ff be the complete analytic function obtained from
the principal branch of the logarithm, and let (, p) be the Riemann surface
of ff (so that G is the base of ). Show that  is homeomorphic to the graph
r = {(z, e Z ): z E G} considered as a subset of C x C. (Use the map h: f}l  r
defined by h(z, [f]z) = (f(z), z) and use Exercise 2.) State and prove an
analogous result for branches of zl/n.
4. Consider the sheaf Y(C), let B = {z: Iz -1/ < I}, let t be the principal
branch of the logarithm defined on B, and let t 1 (z) = t(z) + 27Ti for all z in B.
(a) Let D = {z: Izi < I} and show that (t, [t]t) and (t, [t 1 ]t) belong to the
same component of p -1(D). (b) Find two disjoint open subsets of Y(C)
each of which contains one of the points (t, [t]t) and (t, [t 1 ]t).
6. Analytic Manifolds
In this section a structure will be defined on a topological space which,
when it exists, enables us to define an analytic function on the space. Before
making the necessary definitions it is instructive to consider a previously
encountered example of such a structure. The extended plane Coo can be
endowed with an analytic structure in a neighborhood of each of its points.
If a E Coo and a =I- 00 then a finite neighborhood V of a is an open subset of
the plane. If flJ: V  C is the identity map, flJ(z) = z, then flJ gives a "co-
ordinatization" of the neighborhood V. (Do not become confused over the
preceding triviality. The introduction of the identity function flJ seems an
unnecessary nuisance. After all, U is an open subset of C so we know what it
means to have a function analytic on V. Why bring up flJ? The answer is that
for the general definition it is necessary to consider pairs such as (V, flJ);
trivialities appear here because this is a trivial example.) If a = 00 then let
V 00 = {z: Izi > I} U {oo} and define flJoo: V 00  C by flJoo(z) = Z-1 for
z =I- 00, flJoo( CX)) = o. So flJoo is a homeomorphism of U 00 onto the open disk
B(O; 1). Hence to each point a in Coo a pair (Va, flJa) is attached such that Va
is a neighborhood of a and flJa is a homeomorphism of Va onto an open sub-
set of the plane. What happens if two of the sets Va and Vb intersect? Suppose
for example that a =f. 00 and Va f1 V oo =f. D. Let Goo = B(O; 1) = flJoo(U oo )
and let G a = flJa( U a ) (= Va). Then flJ l(Z) = z-t for all z in Goo; thus
flJa 0 flJ I(Z) = z-t for all z in flJoo( U 00 f1 U a ). Since 00 ft U a , 0 ft flJoo( U 00 r\ Ua)

234 Analytic Continuation and Riemann Surfaces
so that fPa 0 fP 1 is analytic on its domain. Similarly, if both a and bare
finite then fPa 0 fPb- 1 is analytic on its domain. This is the crucial property.
6.1 Definition. Let X be a topological space; a coordinate patch on X is a
pair (U, fP) where U is an open subset of X and fP is a homeomorphism of U
onto an open subset of the plane. If a E U then the coordinate patch (U, fP)
is said to contain a.
6.2 Definition. An analytic manifold is a pair (X, <1» where X is a Hausdorff
connected topological space and <I> is a collection of coordinate patches on
X such that: (i) each point of X is contained in at least one member of <1>,
and (ii) if ( Va' CPa), ( Vb' CPb) E <I> with Va n Vb * D then CPa 0 CPb- I is an analytic
function of CPb( Va (\ Vb) onto CPa ( Va (\ Vb)' The set <I> of coordinate patches
is called an analytic structure on X.
An analytic manifold is also called an analytic surface.
Note immediately that fPa 0 fPb- 1 is one-one since both fPa and fPb are.
Henceforward, for the sake of brevity, care will not be taken in mentioning
the appropriate domain of a function such as fPa 0 fPb- 1.
Next, it must be emphasized that the definition of an analytic manifold
is tied to its analytic structure. It is possible to give the open disk two in-
compatible analytic structures (one of them the natural one). This is also the
case with the torus which can be made into an analytic manifold in an un-
countable number of incompatible ways. (Exercise 4.) But this investigation
must be postponed until we have the notion of an isomorphism between
analytic surfaces.
With the collection of coordinate patches introduced prior to Definition
6.1, Coo becomes an analytic manifold. However, a closed disk is not a mani:.
fold since the points on the boundary cannot be surrounded by a coordinate
patch. Similarly, the union of two intersecting planes in  3 is not an analytic
manifold.
A number of examples of analytic surfaces will be available after sub-
stantiating the foJIowing observations which are gathered into a proposition.
6.3 Proposition. (a) Suppose (X, <1» is an analytic surface and V is an open
connected subset of X. If
<I> v = { ( V n V, cp) : ( V, cp) E <I> }
then (V, <I> v) is an analytic surface. (b) If (X, <1» is an analytic surface and Q
is a topological space such that there is a homeomorphism h of X onto Q, then
with
'1'= {(h( V),cpoh- 1 ): (V,cp) E <I>},
(Q, i') is an analytic surface.

Analytic Manifolds
235
Proof. (a) This is a triviality.
(b) I t is clear that Q is connected, that 'I' is a collection of coordinate
patches for Q, and that each point of Q is contained in at least one member
of '1'. So let (U, cp) and (V, J.l) E <I> such that h( U) n h ( V) *0. But then
Un V*O sinc h(U)nh(V)=h(Un V). So, (cpoh-l)o(J.l°h- I )=
(cpoh-l)o(hoJ.l-I)=cp0J.l-1 which is analytic by the condition on <1>. Thus
(Q, '1') is an analytic manifold. .
I n virtue of part (a) of the preceding proposition the following assump-
tion is made on all analytic structures <I> that will be discussed:
If ( U, cp) E <I> and V is an open subset of U then ( V, cp) E <1>.
Of course, when an analytic structure is defined one does not bother to
give all the coordinate patches, but only those that generate <I> in the above
manner.
Proposition 6.3 also implies that any space that is homeomorphic to a
region in the plane is an analytic surface. Hence a piece of paper with a
crease in it is an analytic surface. Is this a shock to you? If the reader has
ever seen an introduction to differentiable manifolds, he may be surprised
at this.
If X is a subset of 3 then X is a differentiable 2-manifold if each point
in X is contained in a coordinate patch (U, cp) such that cp - 1 : cp( U) U c
3 has coordinate functions with continuous partial derivatives. That is, let
G = cp( U) and cp - I(S, t) = ((s, t), 1](s, t),  (s, t)) for all (s, t) in G. It is
required that , 1], and  be functions from G into  with continuous
partial derivatives. A folded piece of paper is not a differentiable 2-mani-
fold. In fact, if (U, cp) is a patch that contains a point on the crease then
cp - 1 has at least one non-differentiable coordinate function. Since analytic-
ity is a stronger notion than differentiability this seems confusing, but the
explanation is simple. If h is a homeomorphism of X on to the region G in
the plane then an analytic structure is imposed on X via h. In fact, by
considering X with this structure we are only considering G under a
different guise. In the definition of a differentiable 2-manifold there is no
differentiable structure "imposed" on X; the structure is restricted by
conditions that it inherits as a subset of IR 3 (where there is already a
differentiable structure).
In a similar fashion the surface of a cube in 1R3 is an analytic surface
since it is homeomorphic to CX'
Suppose now that G is a region and f: GC is an analytic function
such that f'(z)*O for any z in G. We wish to give the graph
r = { (z,f ( z )) : z E G }
an analytic structure. If p: r  G is defined by p(z, fez)) = z then p is a
homeomorphism of r onto G; consequently r inherits the analytic structure
of G as in 6.3( c). But this does not use the analyticity off, let alone the fact

236
Analytic Continuation and Riemann Surfaces
that f' doesn't vanish. This is surely an uninteresting structure. So, to
rephrase the problem: put an analytic structure on r that is "connected"
to the analytic properties of f
Fix IX = (a,f(a)) in r. Since.f'(a) =1= 0 there is a disk Da about a such that
Da c G and f is one-one on Da. Let
6.4
Va = {(z,f(z)): z E Da}
and define f{Ja.: Va.  C by
6.5
for each (z, f(z)) in Va..
f{Ja(z,f(z)) = fez)
6.6 Proposition. Let G be a region in the plane and let f be an analytic
function on G with non-vanishing derivative. If r is the graph off and
<I> = {( Va., f{Ja.): IX E r, Va. and f{Ja. as in (6.4) and (6.5)}
then (r, <1» is an analytic manifold.
Proof Since r is homeomorphic to G it must be connected. Fix IX = (a,f(a))
in r; it is left to the reader to show that f{Ja is a homeomorphism of'V a onto
f(Da). Suppose. that f3 = (b, f(b)) E r with Va (\ V p # 0 and compute
f{Ja. 0 f{Jf- 1. Sincef: Db  C is one-one there is an analytic function g: 2  Db'
where Q = f(D b ), such that f(g(w)) = w for all w in Q. Since f{Jp( Vp) = 2
it follows that f{J{3-1(w) = (g(w), w); thus f{Ja 0 f{J{3-1(w) = f{Ja(g(w), w) = w for
each w in f{Jp( Va. (\ Vp). In particular f{Ja 0 f{J{3- 1 is analytic. II
Henceforward, whenever the graph of an analytic function with non-
vanishing derivative is considered as an analytic manifold, it will be assumed
that it has the analytic structure given in the preceding proposition.
6.7 Theorem. If(, p) is the Riemann surface of a complete analytic function
and<1> = {(V, p): V is open in, p is one-one on V}, then (31.. <1» is an analytic
manifold.
Proof It follows from Theorem 5.15 that each point of fYl is contained in an
open set on which p is one-one and that p is a homeomorphism there.
Furthermore, if (V, p) and (V, p) E <D and V (\ V =1= D then p 0 (pi V) - 1 is
the identity map. (The notation pi V is used to denote the restriction of p to
V.) Since  is connected it is an analytic surface. II
6.8 Definition. Let (X, <1» and (Q, 'Y) be analytic manifolds and let f: X  Q
be a continuous function; let a E X and IX = f(a). The functionf is analytic at
a if for any patch (A, ) in 0/ which contains IX there is a patch (V, f{J) in <1>
which contains a such that:
(i) f(V) c A;
(ii)  0 f 0 f{J - 1 is analytic on f{J( V) C C.

Analytic Manifolds 237
The function is analytic on X if it is analytic at each point of X.
The condition that (U, cp) can be found such that a E U and f( U) c A
is a consequence of the continuity of.! (Proposition 4.9(c)). The heart of the
definition is the requirement that  0 f 0 cp - 1 be an analytic function from
cp( U) c C into C.
For two given analytic surfaces there may be many analytic functions
from one to the other or there may be very few. Clearly every constant
function is analytic; but there may be no other analytic functions. For
example, if X = C and l is a bounded region in the plane then Liouville's
Theorem implies there are no non-constant analytic functions from X into
{l. Also, suppose that f: Coo  C is an analytic function; then f(C oo ) is com-
pact so that the restriction of f to C is a bounded analytic function on C.
Again, Liouville's Theorem says that each such f is a constant function. On
the other hand, if p is a polynomial and a E C then both p(z) and P (  )
z-a
are analytic functions from Coo to Coo. In fact, these are practically the only
analytic functions from Coo to Coo (Exercise 7).
If (X, <1» is an analytic surface then there are many analytic functions
defined on open subsets of X. For example, if (U, qJ) E <1> then qJ: U  C is
analytic. It follows (Proposition 6.10 below) that f 0 qJ: U  C is analytic
for any analytic function f: cp( U)  C.
Before proving some of the basic properties of analytic functions on
manifolds, one further example will be given. This example is stated as a
theorem and justifies the terminology "complete analytic function".
6.9 Theorem. Let ff be a complete analytic function with Riemann Surface
(, p). If ff: f!Jt  C is defined by
ff(z, [f]z) = fez)
then.ff is an analytic function.
Proof Fix (X = (a, [fL) in f!Jt and let D be a disk about a on whichfis defined
and analytic. Let U be the component of p -l(D) which contains (X; so (U, p)
is a coordinate patch. Let p -1 denote the inverse of p: U  p( U). We must
show that :F 0 p - 1 is analytic on p( U) c C. But for z in p( U),
:F 0 P -l(Z) = ff(z,j(z)) = f(z);
that is, ff 0 p - 1 = f which is analytic. II
The next several results are generalizations of theorems about analytic
functions defined on regions in the plane.
6.10 Proposition. Suppose (X, <1», (Y, lfl», and (Z, 1:) are analytic manifolds
and f: X - Y and g: Y  Z are analytic functions; then g 0 f: X  Z is an
analytic function.
The proof is left to the reader.
6.11 Theorem. Let (X, <1» and (0, 'Y) be analytic manifolds and let f and g be

238 Analytic Continuation and Riemann Surfaces
analytic functions from X into ft If {x E X: f(x) = g(x)} has a limit point in X
thenf = g.
Proof Define the subset A of X by
A = {x:fand g agree on a neighborhood of x}.
This set A will be shown to be non-empty and the reader will be required to
prove that A is both open and closed in X. By hypothesis there is a point
a in X such that for every neighborhood U of a there is a point x in U with
x =1= a and f(x) = g(x). It is easy to conclude that f(a) = g(a) = 0:. If
(A, y;) E 'Y and 0: E A then there is a patch (U, g;) in <I> such that f( U) and g( U)
are contained in A with both y; 0 fog; - 1 and y; 0 g 0 g; - 1 analytic in a disk D
about Z 0 = g;( 0:). But the hypothesis gives that z 0 is a limit point of {z ED:
y; 0 fog; -1(Z) = y; 0 g 0 g; -1(Z)} = F. In fact, if f(x) = g(x) then g;(f(x)) E F.
Thus y; 0 fog; -l(Z) = y; 0 g 0 g; -l(Z) for all z in D; or f(x) = g(x) for all x
in U f1 g; -leD). Hence a E A and A =1= D. II
6.12 Maximum Modulus Theorem. Let (X, <1» be an analytic manifold and
let f: X  C be an analytic function. If there is a point a E X and a neighborhood
U of a such that If(a) I > If(x)/ for all x in U then f is a constant function.
The proof is left to the reader.
The Maximum Modulus Theorem allows us to generalize Liouville's
Theorem in the following way.
6.13 Liouyille's Theorem. If (X, <1» is a compact analytic manifold then there
is no non-constant analytic function from X into C.
6.14 Open Mapping Th.eorem. Let (X, <1» and (0, 'Y) be analytic manifolds
and let f: X  0 be a non-constant analytic function. If U is an open subset of
X then f( U) is open in o.
Proof Let U be an open subset of X and let 0: E f( U). If a E U such that
0: = f(a) and (A, y;) E 'Y which contains 0:, then let (V, g;) E $ such that f(V)
c A and Y; 0 fog; -1 is analytic. Let W = U n V; then W is open and so
g;( W) is an open subset of the plane. Since f is not a constant function it
follows from Theorem 6.11 that Y; 0 fog; - 1 is not constant. Hence, the Open
Mapping Theorem for functions of a complex variable implies that y;(f( W))
= Y; 0 fog; -1(g;( W)) is open in C. But then f( W) = Y; -1(y;(f( W)) is open
and 0: E f( W) C f( U). So f( U) must be open. II
6.15 Definition. If (X, $) and (0, 'Y) are analytic manifolds, an isomorphism
of X onto 0 is an analytic functionf: X  0 which is one-one and onto. If
an isomorphism exists then (X, $) is said to be isomorphic to (0, 'Y).
If f: X  0 is an isomorphism then f is an open mapping by (6.14). It
follows that f-l: 0  X is a homeomorphism. Is f-l also analytic? The
answer is yes and the reader is asked to prove the next proposition.
6.16 Proposition. If f: X  0 is an isomorphism then f-l: 0  X is also an
isomorphism.

Analytic Manifolds 239
Recall that the Riemann Mapping Theorem states that if G is a simply
connected region in the plane and G i= C, then G is isomorphic to the open
unit disk if both are considered as analytic surfaces. Also recall that Proposi-
tion 6.3( c) states that if (X, <1» is an analytic manifold and h: X  Q is a
homeomorphism of X onto the topological space Q, then h induces an
analytic structure on Q; denote this structure by <I> 0 h - 1. Suppose Q already
has an analytic structure 'Y. It is easy to see that <I> 0 h -1 == 'Y iff h is analytic;
that is, iff h is an isomorphism from (X, <1» onto (0, 'Y). .
As an example let X == C and Q == {z: Izi < I}, and define h: X  Q by
z
h(z) = I I '
1+ z
Then h is a homeomorphism of C onto Q, but it is clearly not analytic.
So using h and the analytic structure on C, a structure can be induced on Q
which is completely unrelated to its natural structure. For example, with this
induced structure Q will have no bounded non-constant analytic functions.
Consider the following situation: let G be a region in the plane and let
f: G  C be an analytic function with non-vanishing derivative. Let (g, D)
be a function element such that g(D) c G and j'(g(z)) == z for all z in D.
(That is, g is a "local" inverse of f) If ff is the complete analytic function
obtained from (g, D) and (&t, p) is its Riemann surface, let us examine
whether &t and the graph of f are isomorphic analytic manifolds. (The
analytic structure for the graph of f was introduced in Proposition 6.6.)
The answer to this question is yes provided that the domain "of f is not
restricted. To illustrate what can go wrong let G == {z: Izi < I} and let f be
the exponential function e Z . There ff consists of all germs of branches of the
logarithm (Exercise 5.3); so &t is rather large and complicated. However,
{(z, e Z ): Z E G} is a simple copy of the disk G. The difficulty arises because
the domain of e Z has been artificially restricted. If instead G is the whole
complex plane then ff and the graph of G are indeed isomorphic analytic
surfaces (see Exercise 5.3).
6.17 Definition. Let f: G  C be an analytic function with non-vanishing
derivative. If a E G and ex == f(a), let (g, D) be a function element such that
ex E D and f(g(z)) == z for all z in D. If ff is the complete analytic function
obtained from (g, D) then ff is called the complete analytic function of local
inverses for f
There are two questions that arise in connection with this definition.
First, does the definition of the complete analytic function of local inverses
for f depend on the choice of the function element? Could we have started
with another local inverse and still have obtained the same complete analytic
function? Second, does ff contain the germ of every local inverse off? The
answer to each of these questions is given in the following proposition; it
is "yes".
6.18 Proposition. Let f be an analytic function with non-vanishing derivative
on a region G. Let a and bEG, ex == f(a), f3 == f(b); and let o and 1 be disks

240
Analytic Continuation and Riemann Surfaces
about rx and (3 respectiDely such that there are analytic junctions go: o  C
and gt: t - C H'ith go(rx) == a, gl«(3) == b, f(go(')) == , for all , in o,
f(g 1 (,n == 'for all , in  l' Then there is a path a in .( G) .(ron1 rx to f3 such
that (g l'  1) is the continuation of (g 0' o) along a.
Proof: Since G is connected there is a path y in G from a to b. For 0 < t < 1
Jet Dt be a disk about yet) such that Dt c G and on which f is one-one. Let
a == f 0 y and Jet t be a disk about aCt) such that t c feD,). FinaJJy, let
gt: t  C be an analytic function such that
f(grC')) == 'for' in t
grCa(t)) == yet)
Claim. {(gt, t)} is an analytic continuation along a. To show this fix t and
let S be chosen so that yes) Ef-l(t) n Dt whenever Is-tl < S. Now fix s
y
a
-- -......... D
/' " c
/ "
/ \
/ ,.......--" \
I/''' \
y/ " I
/\ \ I
I \ / \/
I \ ( J 1
\ '- \ y(s)/ ,// ,
......... _/ ""'"
\ -- /
//D!>
......... ./
..........--..-
.,...---.........
/'" .......--
/ / "'-
/ / \ \
/ I \ c
/ , ,"
\ __ - /( B)}
/ \ a( 5) .} /
/ \. --" /
/ -_/
/
/
I
I
\
\
"
.........
........
......
\
\
I
I
I
I
/
/
I
/1 j(Dc)
./
..,/
with Is- t/ < S and let B be a disk about yes) such that B c J-l(t) n Ds
n Dt. So f(B) is an open set containing a(s) == J(y(s)) and .f(B) c f(Dt).
By definition gsCJ(z)) == z for z in B; thus f(gsC')) == , for all , in f(B). But
f(B) c t which gives that f(gt(')) == , for all , in f(B). But for' in f(B)
both gsC') and grC') are in f-l(t) n Ds n Dt and J is one-one here. Hence
g(') == grC') for all , inf(B); alternately, [gs]a(s) == [gt]a(s) whenever Is - t/ < S.
This substantiates the claim. II
Recall that if (9£, p) is the Riemann surface of a complete analytic func-
tion ff, the symbol ff is also used to denote the analytic function ff:
f!l --* C defined by g;(z, [fL) == (z) (Theorem 6.9).
6.19 Proposition. Let f be an analytic function on a region G which has a nOI1-
vanishing derivative, let ;Y; be the complete analytic function of local inverses

Analytic Manifolds 241
of f, and let (2l, p) be the Riemann surface of ff. If ff(2l) == G and p(2l) ==
f(G) then
7(Z, [gL) == (g(z), z)
defines an isomorphism between the analytic manifold (Jlt and graph (f).
Before proving this proposition we must show that under the same
hypothesis each member of ff is a local inverse of f This provides a partial
converse to Proposition 6.18.
6.20 Lemma. Let f, G, ff and ((Jlt, p) be as in the preceding proposition.
If [g]a E ff then there is a disk D about a on which g is defined and such that
f(g(z» = z for all z in D.
Proof Fix [g]a in ff (so (a, [g]a) E (Jlt); then, by hypothesis, g(a) == ff(a, [g]a) E
G. If b == f(g(a» then there is a disk B about b and an analytic function
h: B  C such that h(b) == g(a) andf(h(z» = z for all z in B. From Propo-
sition 6.18, [h]b E ff. Also a = pea, [g]a) E p((Jlt) = f( G). According to Theorem
5.11 there is a path y in f(G) from a to b such that [h]b is the continuation
along y of [g]a. Let {(gp Dt)} be a continuaion along y such that [g O]a = [g]a
and [g l]b = [h]b. Define a subset T of [0, 1] by
T = {t: f(glz» = z for all z in Dt}.
We want to show that T == [0, 1]. In fact, once this is proved it follows that
o E T so th(lt (g, D) must be a local inverse of f
Since T contains 1 it is non-empty; it must be shown that T is both open
and closed in [0, 1]. For any number t in [0, 1] let 8 > 0 such that [gs]y(s) =
[gt]y(s) whenever Is- t/ < 8. If t E T then f(gs(z» == f(gt(z» = z for all z
in Ds n Dt and Is-tl < 8. It follows that (t-8, t+8) c Tand so Tis open.
If t E T- then there is an s in T such that Is-tl < 8. For z in Ds n Dt we
have that f(grCz» = f(gs(z» = t so that t E T. That is, T is closed. II
Proof of Proposition 6.19. It follows from the preceding lemma that (g(a), a) E
graph (f) if (a, [gL) E (Jlt. Thus, 7 does indeed map (Jlt into graph (f).
Suppose (a, f(a» E graph (f) and a = f(a). If (g, D) is a function element
such that a E D, g(a) == ct, and f(g(z» = z for aII z in D, then [g]a E ff and
T(a, [g]a) == (a, f(ct». That is T((Jlt) == graph (f). To show that T is one-one
let (a, [gL) and (b, [h]b) E (Jlt such that T(a, [gL) == T(b, [h]b); that is, (g(a), a) =
(h(b), b). Thus, a == band g(a) = h(b) == a. Moreover, Lemma 6.20 implies
that
6.21
f(g(z» = f(h(z»
for z in a neighborhood of a. But.f'(ct) -# 0, so thatfis one-one in a neigh-
borhood of , = ct. It follows from (6.21) that [g]a = [h];.( and therefore, 7 is
one-one.
It remains to show that 7 is analytic. This is actually an easy argument
once the question to be answered is made explicit. So fix (a, [g]a) in &l and
put a = g(a). Let  be a disk about ct on which f is one-one and let D be a
disk about a on which g is defined and such that D c f(D.). Let U = {("

242
Analytic Continuation and Riemann Surfaces
.,,-,
I '--_
/ "-
/ '\
/' \
/ \
// \
I . (a, [g]a) I
I I
, I
\ /
\ /
, /
" ./
............. .,..-""
---
T
....... ----.........
........
/'
/
/
I . «(X, [(ex))
I
\
\
" ,,/
........ ,.....
----
" U
'\
\
\
/
/
/
/

p
11
f()): ELl} and define rp: UC by rp(, .r()) =f(); so (U, cp) is a co-
ordinate patch on graph (f) (Proposition 6.6). Also N(f, D) = {(z, [gJz):
zED} gives that (N(g, D), p) is a coordinate patch on f!Jl (Theorem 6.7)
containing (a, [g]a), and satisfying r(N(g, D)) c U. Hence to complete the
proof it must be shown that rp 0 r 0 p -1 is an analytic function on D. This is
trivial. In fact, if ZED then
rp 0 TOp - 1 (z) = rp 0 T( Z, [g ]z)
= rp(g(z), z)
- ,.,.
- ..,
that is, rp 0 TOp - 1 is the identity function on D. II
If G is the punctured plane and fez) = zn for some n or if G = C and
fez) = e Z then the hypothesis of Proposition 6. 19 is satisfied. Let us examine
this a little more closely for the case where fez) = Z2, Z E G = C - {O}. So
f!Jl is isomorphic to the graph of Z2; let r = {(z, Z2): z -# O}. Now T: :Ji  r
is defined by rea, [g]a) = (g(a), a). RecaIl that ff: PA  C is defined by
ff(a, [gL) = g(a). For this case ff acts like the square root function. In other
words, we have found a natural domain of definition of zt. The corresponding
function on r would project (z, Z2) to its first coordinate.
Even though we have shown that f!Jl (a very abstract object) is equivalent
to a less abstract object (the graph r), this is stilI somewhat dissatisfying.
After all, the graph is a subset of C 2 which is beyond our geometric intuition.

Analytic Manifolds
243
Plane J
Plane 2
*
*
Therefore, we would like to have a more geometric picture of the Riemann
surface. Consider two copies of the plane that have been slit along the
negative real axis. So imagine the planes as having two negative real axes
and label them * and  as shown in the figure. The space X we will describe
will be the union of the two planes but where the two *-axes are identified
and the two -axes are identified. So if a curve in Plane 1 approaches the
*-axis and hits it at - x then it exits in Plane 2 at - x on the *-axis. For the
point - 1 on the *-axis a typical neighborhood would consist of a half
disk about - 1 above the *-axis in Plane 1 and half a disk about - 1 belo"'
the *-axis in Plane 2. This is a representation of the Riemann surface of local
inverses for Z2 (the Riemann surface of  i for short). To see this define a
map k: X -,?-!!1 as follows. If z is in Plane I, z not on the negative real axis,
let h(z) == (z, [g]z) where g is the principal branch of the square root. If z
is in Plane 2 but not on the negative real axis let h(z) == (z, [g]z) where - g
is the principal branch of the square root. It remains to define h(z) for z on
the *-axis and the -axis. This we leave to the reader along with the proof
that the resulting function h is an isomorphism (the space X has a natural
analytic structure).
In the case fez) == zn we can carry out the same construction, but here n
copies of the plane are req uired. If fez) == e Z the same ideas are again em-
ployed but now it is necessary to use an infinite number of planes indexed by
all the integers. In the case of the surface for Z1/", a curve which passes
through the negative real axis of one plane exits through the negative real
axis of the next one. If it is in the n-th plane, then it exits through the negative
axis of the first plane. For the surface of log z, a curve can continue hopping
from one plane to the next and will never return to the plane where it started
unless it "retraces its steps".
Exercises
1. Show that an analytic manifold is locally compact. That is, prove that if
a E X and U is an open neighborhood of a then there is an open neighborhood
V of a such that V - C U and V - is compact.

244 Analytic Continuation and Riemann Surfaces
2. Which of the following are analytic manifolds? What is its analytic
structure if it is a manifold? (a) A cone in 1R3. (b) {(Xl' X2, X3) E 1R3: xi+x
+ X = 1 or xi + X > 1 and X 3 = o}
3. The following is a generalization of Proposition 6.3(b). Let (X,) be an
analytic manifold, let Q be a topological space, and suppose there is a con-
tinuous function h of X onto Q that is locally one-one (that is, if x E X
there is an open set U such that X E U and h is one-one on U). If (U, cp) E <1>
and h is one-one on U let  = h( U) and let y;:  ---+ C be defined by .p( w) =
cp 0 (hi U) -1( w). Let qr be the collection of all such pairs (, .p). Prove that
(0, qr) is an analytic manifold and h is an analytic function from X to Q.
4. Let T = {z: Izi = I} x {z: Izi = I}; then T is a torus. (This torus is
homeomorphic to the usual hollow doughnut in 1R3.) If wand w' are complex
numbers such that 1m (wlw') '# 0 then wand w', considered as elements of
the vector space Cover IR, are linearly independent. So each z in C can be
uniquely represented as z = tw + t' w'; t, t' in IR. Define h: C  T by h(tw +
tw') = (e 2nit , e 2nit '). Show that h induces an analytic structure on T. (Use
Exercise 3.) (b) If w, w' and " " are two pairs of complex numbers such that
1m (wlw') '# 0 and 1m ('I") '# 0, define a(s' +s"') = (e 2ni s, e 2nls ') and
7(tW+t'w') = (e 2nit , e 2nit '). Let G = {tw+t'w': 0 < t < 1,0 < t' < I} and
Q = {s' +s"': 0 < s < 1, 0 < s' < I}; show that both a and 7 are one-one
on G and Q respectively. (Both G and Q are the interiors of parallelograms.)
If<1>t and <1>0' are the analytic structures induced on T by 7 and a respectively,
and if the identity map of (T, <1>t) into (T, <1>0') is analytic then show that the
function f: G ---+ Q defined by f = a-I 0 7 is analytic. (To say that the
identity map of (T, <1>t) into (T, <1>0') is analytic is to say that <1>t and <1>0' are
equivalent structures.) (c) Let w = 1, w' = i, , = 1, " = oc where 1m oc '# 0;
define a, 7, G, Q and f as in part (b). Show that <1>t and <1>0' are equivalent
analytic structures if and only if oc = i. (Hint: Use the Cauchy-Riemann
equations.) (d) Can you generalize part (c)? Conjecture a generalization?
5. (a) Letfbe a meromorphic function defined on C and supposefhas two
independent periods wand w'. That is, f(z) = f(z+nw+n'w') for all z in C
and all integers nand n', and 1m (wlw') i= o. Using the notation of Exercise
4(a) show that there is an analytic function F: T  Coo such that f = F 0 h.
(For an example of a meromorphic function with two independent periods
see Exercise VIII. 3.2(g).)
(b) Prove that there is no non-constant entire function with two indepen-
dent periods.
6. Show that an analytic surface is arcwise connected.
7. Suppose that f: Coo -> Coo is an analytic function.
(a) Show that either f = 00 orf-I( (0) is a finite set.
(b) If f t; 00, let a I' . . . , an be the points in C where f takes on the
value 00. Show that there are polynomials Po, PI' . . . , Pn such that
n ( 1 )
j(z) = Po(z) +  Pk
 Z - a k
k=l
for z in C.

Covering Spaces 245
(c) If f is one-one, show that either j{z) = az+b (some a, b in C) or
a .
fez) = -- + b (some a, b, c In C).
z-c
8. Furnish the details of the discussion of the surface for z at the end of
this section.
9. Let G = {z: -  < Re z < } and definej: G -+ iC byf(z) = sin z. Give
a discussion for f similar to the discussion of .Jz at the end of this section.
7. Covering spaces
In this section the concept of a covering space will be introduced and
some of its elementary properties will be deduced. One byproduct of this
study is the fact that two closed curves in the punctured plane are homotopic
iff they have the same winding number about the origin.
Intuitively, a topological space X is a covering space for the topological
space 2 if X can be wrapped around Q in such a way that it can be easily
unwrapped. What is meant by "wrapping" one space around another?
This seems to indicate that we want a function from X onto 2. To say that
it must be easily unwrapped must mean that we can find an inverse for the
function.
7.1 Definition. If Q is a topological space then a covering space of 2 is a pair
(X, p) where X is a connected topological space and p is a continuous function
of X onto Q such that: for each w in Q there is a neighborhood Ll of w such
that each component of p -teLl) is open, and p maps each of these components
homeomorphically onto Ll. Such an open set Ll is called fundamental and Ll
is properly covered.
Both (C, exp) and (C - {O}, zn) are covering spaces of the punctured
plane; also, each open disk in the punctured plane is fundamental. If r =
{z: Izi = I} and p:   r is defined by pet) = exp (27Tit), then (, p) is a
covering space of r. Every proper arc in r is fundamental.
The following is a list of properties of covering spaces. Their proof is
left to the reader.
7.2 Proposition. Let (X, p) be a covering space of Q.
(a) p is an open mapping of X onto Q.
(b) If x E X then there is an open neighborhood U of x on vhich p is a
homeomorphism.
(c) Every fundamental open set is connected.
(d) If Q is locally arcwise connected then so is X.
In light of part (b) of the preceding proposition it is natural to ask if
every locally one-one function p of X onto 12 makes (X, p) a covering space of
Q. The answer is no. For example, let X = {z E C: z =f. 0, 0 < arg z < 57T/4},
p(z) = Z2, and let Q = p(X) = C - {O}; then p is locally one-one. Let r =
{g: Ig-iJ < r} for any r, 0 < r < I. It is easy to see that p-l(r) consists

246 Analytic Continuation and Riemann Surfaces
of two components. One of these (the one in the first quadrant) is mapped
homeomorphicaIIy onto r' while the other is not. In fact, g = i is not in the
image of this second component.
One of the most important properties of covering spaces is the fact that
a curve in Q can be lifted to a curve in X.
7.3 Definition. Let (X, p) be a covering space of Q and let y be a path in Q.
A path y in X is caIIed a lifting of y if p 0 Y = y.
A useful way of understanding what a lifting is is to consider the following
diagrams. If I = [0, 1] and the path y is given then we have the following
mapping diagram:
x
p
I
) Q
y
To say that y can be lifted is to say that the diagram can be completed in
such a way that it is a commutative diagram:
x
p
I
. u
y
that is, one can go from one place in the diagram to another without being
concerned about which path is taken.
It is an important property of covering spaces that every path may be
lifted when the base space is locally arcwise connected. Actually a stronger
result which will be of use later can be proed.
7.4 Theorem. Let (X, p) be a covering space of the space Q. If F: [0, 1] x [0, 1]
-)- Q is a continuous function with F(O, 0) = Wo and if Xo is any point in X with
p(x 0) = wo, then there is a unique continuous function F: [0, 1] x [0, 1] -+ X
such that F(O, 0) = Xo and p 0 F = F.
Before giving the proof of this theorem let us state an important corollary.
7.5 Corollary. Let (X, p) be a covering space of the space Q. If y is a path in Q
with initial point Wo and p(xo) = wo, then there is a unique lifting y of y with
initial point x o.

Covering Spaces 247
Proof Define F: [0, 1] x [0, 1] -+ Q by F(s, t) = y(s); so F is continuous and
F(O, 0) = Wo. According to Theorem 7.4 there is a unique function £:
[0, 1] x [0, 1] -+ X such that £(0, 0) = xo and p 0 £ = F. Let yes) = Pes, 0);
then y has initial point xo and is a lifting of y. To prove the uniqueness of y,
suppose a is also a path in X with initial point x 0 and which lifts y. Define
K: [0, 1] x [0, 1] -+ X by K(s, t) = a(s). Then K: (0, 0) = xo and p 0 R(s, t) =
p 0 a(s) = yes) = F(s, t). By the uniqueness part of Theorem 7.4, £ = K.
Thus yes) = Pes, 0) = K(s, 0) = a(s). II
Proof of Theorem 7.4. Let {O = So < Sl < ... < sn = I} and {O = to < t 1
< . . . < t n = I} be partitions off [0, 1] such that for 0 < i, j < n -1,
F([Si' Si+ 1] x [t j, t j+ 1])
is ontained in a fundamental open set ij in Q. (Verify that this can be done.)
Now Wo = F(O, O)EOO. Let U oo be the component p-1(00) which
contains xo. Since pi U 00 is a homeomorphism of U 00 onto OO, it is possible
to define £: [0, s 1] x [0, t 1] -+ X by
- 1
F(s, t) = (pi U 00) - 0 F(s, t).
Now extend £to [0, S2]X[0, t 1 ] as follows. £({Sl}X[O, t 1 ]) is connected
(Why 1) and, since F( {s 1 } X [0, t d) c  10, it is contained in p - 1 (1 0). Let
U 10 be the component of p-1(10) which contains F({Sl}X[O, t 1 ]). Then
pi U 1 0 is a homeomorphism; define
- 1
F(s, t) = (pi U 1 0) - 0 F(s, t)
for (s, t) in [s l' S2] x [0, t 1]. This gives a continuous function £ on [0, S2] x
[0, t d. (The domain can be written as the union of two closed sets, on each
of these sets £ is continuous, and £ agrees on their intersection; hence, £ is
continuous on their union.) Continuing this process leads to a continuous
function £: [0, 1] x [0, 1] -+ X such that p 0 £ = F and £(0, 0) = xo. Since
at each stage of this construction the definition of F is unique (because p is
a homeomorphism on each Uij), it follows that £ is unique. II
The next result is called the Monodromy Theorem. To distinguish this
from the theorem of the same name which was obtained in 93, the present
version is referred to as the "abstract" theorem. Later it will be shown how
the original theorem can be deduced from this abstract one.
7.6 Abstract Monodromy Theorem. Let (X, p) be a covering space of Q and
let y and a be two paths in Q with the same initial and final points. Let y and
fj be paths in X with the same initial points such that y and a are liftings of y
and a respectively. If Y"'-l a (FEP) in Q then y and a have the same final
points and y "'-I a (FEP) in X.
Note. Although we have not defined the concept of FEP homotopy between
two curves in an arbitrary topological space, the definition is similar to that
given for curves in a region of the plane (Definition IV. 6.11').
Proof Let Wo and WI be the initial and final points, respectively, of y and u.

248 Analytic Continuation and Riemann Surfaces
Let Xo E P -1(wO) such that y(O) = a(O) = xo. By hypothesis there is a
continuous function F: [0, 1] x [0, 1] -)- Q such that F(O, t) = Wo, F(I, t) =
Wb F(s, 0) = jl(S), and F(s, 1) = a(s) for all sand t in [0, 1]. According to
Theorem 7.4 there is a unique continuous function F: [0, 1] x [0, 1]  X
such that F(O, 0) = Xo and poF= F. Now F({O}x[O, 1]) = {wo} and
po F = F implies that F({O}x[O, 1]) C p-l(w O )' But each component of
p -1(wO) consists of a single point (Exercise 4) and F( {O} x [0, 1]) is connected.
Therefore F(O, t) = Xo for all t. Similarly, there is a point Xl such that
F(I, t) = Xl for all t and p(x l ) = WI'
By the uniqueness of y and the fact that s  F(s, 0) is a path with initial
point Xo which lifts y, it must be that yes) = F(s, 0). Similarly, a(s) = F(s, 1).
Therefore y(l) = a(l) = Xl = F(I, t) for all t, and F demonstrates that
y r'-I a(FEP) in X. II
In order to show that the Monodromy Theorem can be deduced from
the preceding version, it is necessary to first prove a lemma. This preliminary
result is actually the Monodromy Theorem for a disk and the reader is
asked to supply an elementary proof.
7.7 Lemma. Let (g, A) be a function element and let B be a disk such that
A C Band (g, A) admits unrestricted analytic continuation in B. If' y is a closed
curve in B with y(O) = y(l) = a in A and {(gt, At,)} is an analytic continuation
of (g, A) along y then [g O]a = [g da.
The next theorem will facilitate the deduction of the Monodromy Theorem
from the Abstract Monodromy Theorem. Additionally, it has so'me interest
by itself.
7.8 Theorem. Let (f, D) be a function element which admits unrestricted
continuation in the region G, and let  be the component of the sheaf(f/(G), p)
that contains (zo, [!]zo).(or some Zo in D. Then (, p) is a covering space ofG.
Proof. Let B be any disk such that BeG and let OIl be the component of
p -1(B) which is contained in . The proof will be completed by showing
that p maps OIl homeomorphically onto B.
Fix (a, [g]a) in 011; then
7.9 Claim. (z, [h]z) E OIl iff z E Band [h]z is the continuation of [g]a along
some curve in B.
In fact, if (z, [h]z) is such a point then there is a curve y in p -1(B) (c f/(B))
from (a, [g]a) to (z, [h]z) (Theorem 5.10). Thus (z, [h]z) must belong to the
same componen of p -1(B) as does (a, [g]a); that is, (z, [h]z) E OIl. For the
converse, let (z, [h]z) E 011; since OIl is pathwise connected (Proposition 5.7)
there is a path in OIl from (a, [g]a) to (z, [h]z). But this implies that [h]z is the
continuation of [g]a along a path in p( OIl) c B (Theorem 5.10). So claim 7.9
has been shown.
Since (f, D) admits unrestricted continuation in G and [g]a is a con-
tinuation of [!]zo (z 0 in D), it is a trivial matter to see that [g]a admits un-
restricted continuation in B. In view of (7.9) this gives that p( OIl) = B.
It only remains to prove that plOll is one-one. This amounts to showing

Covering Spaces 249
that if (b, [h]b) and (b, [k]b) E 0Jt then [h]b = [kJb. But since 0Jt is arcwise
connected, this is exactly the conclusion of Lemma 7.7. II
Let us retain the notation of the preceding theorem. Fix a in D and let
y and a be paths in G from a to a point z = b. Suppose that {(ft, Dt)} and
{(gt, Bt)} are continuations of (f, D) along y and a respectively; so [/oJa =
[g O]a = [/]a. Now yet) = (y(t), [ft]y(t») and aCt) = (a(t), [gt]a(t») are paths in 
(see the proof of Theorem 5.10) with the same initial point (a, [/]a). More-
over p 0 y = y and p 0 a = a; so y and a are the unique liftings of y and a to
. According to the Abstract Monodromy Theorem, if y 1"'--.1 a(FEP) in G
then y and a have the same final point. That is, (b, [/l]b) = y(l) = a(l) =
(b, [gdb) so that [/db = [gl]b. This is precisely the conclusion of Theorem 3.6.
For another application of the Abstract Monodromy Theorem we wish
to prove that closed curves in the punctured plane are homotopic iff they
have the same winding number about the origin. To do this let r = {z:
Izi = I}; as we observed at the beginning of this section, if pet) = exp (21Tit)
then (IR, p) is a covering space of r. If y is any rectifiable curve in C - {O}
it is easy to see that y is homotopic (in C - {O}) to the curve a defined by
a(t) = y(t)l/y(t)1 (Exercise IV. 6.4). So assume that Iy(t)/ = 1 for all t.
Similarly, we can assume that y(O) = 1.
Let y be the unique curve in IR such that y(O) = 0 and yet) = exp (21Tiy(t)).
Since y is rectifiable it is easy to see that y is also rectifiable. Also
1 f dZ
n(y; 0) = ----: -
21Tl z
y
1
1 f dy(t)
-- -
21Ti y(t)
o
1
=  f d exp (21Tiy(t))
21Ti y(t)
o
1
= f dy(t);
o
so
7.10
n(y,O) = y(l)
since y(O) = O.
So if a is also a closed rectifiable curve with la(t)/ = 1, a(O) = 0 = a(l)
and n(y; 0) = n(a,O) = n then a(l) = y(l) = n, where a is the unique lifting
of a to IR such that a(O) = O. Let F: [0, 1] x [0, 1] -+ r be defined by
F(s, t) = exp {21Ti[1 - t)u(s) + ty(s)] }
then F(O, t) = 1 = F(I, t) (Why?) and F demonstrates that y 1"'--.1 a.

250 Analytic Continuation and Riemann Surfaces
Notice that the rectifiability of y and a was only used to define the winding
number of y and a about the origin. It is possible to extend the definition of
winding number to non-rectifiable curves.
7.11 Definition. If y is any closed curve in C - {O} with y(O) = y(l) = 1,
let Yl (t) = y(t)l/y(t)1 and let l' be the unique curve in  such that 1'(0) = 0
and Yl (t) = exp (27Tiy(t)); the winding number o.f y about the origin is
n(y; 0) = 1'(1).
In view of (7.10) this definition agrees with the former definition for
rectifiable curves.
7.12 Theorem. Let y and a be two closed curves in C - {O} such that a(O) =
y(O) = 1; then y  a in C - {O} iff n(y; 0) = n( a; 0).
Proof: It was shown above that if n(y; 0) = n( a; 0) then y  a. Conversely,
if y  a then the Abstract Monodromy Theorem implies that the liftings l'
and a such that 1'(0) = 0'(0) = 0 have the same end point. That is, n(y; 0) =
n(a; 0). _
Exercises
1. Suppose that (X, p) is a covering space of 12 and (12, 7T) is a covering space
of Y; prove that (X, 7T 0 p) is also a covering space of Y.
2. Let (X, p) and (Y, a) be covering spaces of 12 and A respectively. Define
pXa: Xx Y12xA by (pxa) (x, y) = (p(x), a(y)) and show that (Xx Y,
p X a) is a covering space of 12 x A.
3. Let (12, ) be an analytic manifold and let (X, p) be a covering space of 12.
Show that there is an analytic structure <I> on X such that p is an analytic
function from (X, <1» to (12, ).
4. Let (X, p) be a covering space of 12 and let W E 12. Show that each com-
ponent of p -1( w) consists of a single point and p -1( w) has no limit points in
X.
5. Let 12 be a pathwise connected space and let (X, p) be a covering space of
12. If WI and Wz are points in 12, show that p -1(w 1 ) and p -1(wZ) have the same
cardinality. (Hint: Let y be a path in 12 from WI to Wz; if Xl E p-l(Wl) and
l' is the lifting of y with initial point XI = 1'(0), let f(x 1) = 1'(1). Show that
f is a one-one map of p -l(Wl) onto p -l(wZ).)
6. In this exercise all spaces are regions in the plane.
(a) Let (G,f) be a covering of 12 and suppose thatfis analytic; show that
if 12 is simply connected then f is one-one. (Hint: If fez 1) = fez z) let y be a
path in G from z 1 to z z and consider a certain analytic continuation along
f 0 y; apply the Monodromy Theorem.)
(b) Suppose that (G 1 ,fl) and (Gz,fz) are coverings of the region 12 such
that both 11 and Iz are analytic. Show that if G 1 is simply connected then
there is an analytic function I: G 1  G z such that (G 1 , I) is a covering of
G z and 11 = Iz 0 f. That is the diagram is commutative.

Covering Spaces
251
f
· G 2
G 1
12
(c) Let (Gl,fl)' (Gz,fz) and 0 be as in part (b) and, in addition, assume
that both G 1 and G z are simply connected. Show that there is a one-one
analytic function mapping G 1 onto G z .
7. Let G and 0 be regions in the plane and suppose that f: G  £2 is an
analytic function such that (G,f) is a covering space of O. Show that for every
region 0 1 contained in 2 which is simply connected there is an analytic
function g: 21  G such thatf(gl(w)) = W for all W in 0 1 .
8. What is a simply connected covering space of the figure eight?
9. Give two nonhomeomorphic covering spaces of the figure eight that are
not simply connected.
10. Prove that the closed curve in Exercise IV.6.8 is not homotopic to zero
in the doubly punctured plane.

Chapter X
Harmonic Functions
In this chapter harmonic functions will be studied and the Dirichlet
Problem will be solved. The Dirichlet Problem consists in determining all
regions G such that for any continuous function f: oG  IR there is a con-
tinuous function u: G-  IR such that u(z) = f(z) for z in oG and u is
harmonic in G. Alternately, Vie are asked to determine all regions G such
that Laplace's Equation is solvable with arbitrary boundary values.
1. Basic properties of harmonic functions
We begin by recalling the following definition and giving some examples
of harmonic functions.
1.1 Definition. If G is an open subset of C then a function u: G  IR is
harmonic if u has continuous second partial derivatives and
02U 02U
-+-=0
OX2 oy2 ·
This equation is called LAPLACE'S EQUATION.
We also review the following facts about harmonic functions.
(1) (Theorem 111.2.29) A function f on a region G is analytic iff Re f = u
and 1m f = v are harmonic functions which satisfy the Cauchy-Riemann
equations.
(2) (Theorem VIII.2.2(j)) A region G is simply connected iff for each
harmonic function u on G there is a harmonic function v on G such that
f = u+iv is analytic on G.
1.2 Definition. Iff: G  C is an analytic function then u = Re f and v = Imf
are called harmonic conjugates.
With this terminology, Theorem VIII.2.2(j) becomes the statement that
every harmonic function on a simply connected region has a harmonic
conjugate. If u is a harmonic function on G and D is a disk that is
contained in G then there is a harmonic function v on D such that u + iv is
analytic on D. In other words, each harmonic function has a harmonic
conjugate locally. Finally note that if v] and V2 are both harmonic
conjugates of u then i(v] - v 2 )=(u+ ivl)-(u+ iv 2 ) is an analytic function
whose range is contained in the imaginary axis; hence v] = V2 + c, for some
constant c.
1.3 Proposition. If u: G  R is harmonic then u is infinitely differentiable.
Proof. Fix Zo = xo+iyo in G and let S be chosen such that B(zo;S) c G.
252

Basic properties of harmonic functions 253
Then u has a harmonic conjugate v on B(z 0 ;8). That is, f = u + iv is analytic
and hence infinitely differentiable on B(z 0 ;8). It now follows that u is
infinitely differentiable. II
The preceding proposition gives a property that harmonic functions share
with analytic functions. The next result is the analogue of the Cauchy
Integral Formula.
1.4 Mean Value Theorem. If u: G  R is a harmonic function and B(a; r)
is a closed disk contained in G, then
27t
u(a) =  J u{a+reiO) dB
27T
o
Proof Let D be a disk such that B(a; r) c D c G and let f be an analytic
function on D such that u = Re j: I t is easy to deduce from Cauchy's Integral
Formula that
27t
I(a) =  J f(a+rei(J) dB.
21T
o
By taking the real part of each side of this equation we complete the proof.1I
I n order to study this property of harmonic functions we isolate it.
1.5 Definition. A continuous function u: G !R has the Mean Value Property
(MVP) if whenever B(a; r) c G
27t
u(a) =  J u(a+rei(J) dB.
21T
o
In the following section it will be shown that any continuous function
defined on a region that has the MVP must be a harmonic function. One
of the main tools used in showing this is the following analogue of the
Maximum Modulus Theorem for harmonic functions.
1.6 Maximum Principle (First Version). Let G be a region and suppose that
u is a continuous real valued function 011 G "'ith the MVP. If there is a point
a in G such that u(a) > u(z) for all z ill G then u is a constant function.
Proof Let the set A be defined by
A = {z E G: u( z) = u( a) }.
Since u is continuous the set A is closed in G. If z 0 E A let r be chosen such
that B(z 0 ;r) c G. Suppose there is a point b in B(z 0 ;r) such that u(b) -1= u(a);
then, u(b) < u(a). By continuity, u(z) < u(a) = u(zo) for all z in a neighbor-
hood of b. In particular, if p = Izo-bl and b = zo+pei, 0 < f3 < 21T then

254 Harmonic Functions
there is a proper interval I of [0, 21T] such that f3 E I and u(z 0 + pe i8 ) < u(z 0)
for all () in I. Hence, by the MVP
2lt
u(zo) =  f u(zo+pei8)d{) < u(zo),
21T
o
a contradiction. So B(zo ;r) c A and A is also open. By the connectedness
of G, A = G. II
1.7 Maximum Principle (Second Version). Let G be a region and let u and v
be two bounded continuous real valued functions on G that have the MVP. If
for each point a in the extended boundary aooG,
limsupu(z) < liminfv(z)
za :a
then either u(z) < v(z) for all z in G or u = v.
Proof Fix a in 000G and for each S > 0 let GlJ = G n B(a;S). Then according
to the hypothesis,
o > lim [sup{u(z): Z E GlJ}-inf{v(z): z E GlJ}]
6-+ 0
= lim [sup{u(z): Z E GlJ}+sup{ -v(z): Z E GlJ}]
6-+ 0
> lim sup {u(z) - v(z): z E GlJ}.
6-+ 0
So lim sup [u(z) - v(z)] < 0 for each a in 0ooG. So it is sufficient to prove the
z-+a
theorem under the assumption that v(z) = 0 for all z in G. That is, assume
1.8
lim sup u(z) < 0
z-+a
for all a in aooG and show that either u(z)<O for all z in G or u = O. By
virtue of the first version of the Maximum Principle, it suffices to show
that u(z) < 0 for all z in G.
Suppose that u satisfies (1.8) and there is a point b in G with u(b»O.
Let £ > 0 be chosen so that u(b) > £ and let B = {z E G: u(z) > £}. If
a E a oo G then (1.8) implies there is a 8 = 8 (a) such that u(z) < £ for all z in
G n B (a; 8). Using the Lebesgue Covering Lemma, a 8 can be found that
is independent of a. That is, there is a 8 > 0 such that if z E G and
d(z, aooG)< 8 then u(z)< £. Thus,
B c {z E G: d( z, () 00 G) > S}.
This gives that B is bounded in the plane; since B is clearly closed, it is
compact. So if B =1= 0, there is a point z 0 in B such that u(z 0) > u(z) for all Z
in B. Since u(z) < € for Z in G - B, this gives that u assumes a maximum
value at a point in G. So u must be constant. But this constant must be
u(z 0) which is positive and this contradicts (1.8). II

Basic properties of harmonic functions 255
The follo\ving corollary is a useful special case of the Maximum Principle.
1.9 Corollary. Let G be a bounded region and suppose that w: G -   is a
continuous function that satisfies the MVP on G. If w(z) = 0 for all z in aG
then w(z) = 0 for all z in G.
Proof First take w = u and v == 0 in Theorem 1.7. So w(z) < 0 for all z or
w(z) - O. Now take w = v and II = 0 in (1. 7); so either w(z) > 0 for all z or
w(z) = o. Since both of these hold, w - o. II
Even though Theorem 1.7 is called the Maximum Principle, it is also a
Minimum Principle. For the sake of completeness, a Minimum Principle
corresponding to Theorem 1.6 is stated below. It can be proved either by
appealing to (1. 7) or by considering the function - u and appealing to (1.6).
1.10 Minimum Principle. Let G be a region and suppose that u is a continuous
real valued function on G 'with the MVP. If there is a point a in G such that
u(a) < u(z) for all z in G then u is a constant function.
Exercises
ou ou
1. Show that if u is harmonic then so are U x = -- and u y
ox oy.
2. If u is harmonic, show that f = U x - iu y is analytic.
n
3. Let p(x, y) == L ak,xky' for all x, y in .
k,I=O
Show that p is harmonic iff:
(a) k(k-l)ak.I-2+1(1-I)ak-2,1 == Ofor2 < k, / < n;
(b) an _ 1 , I == an, I == 0 for 2 < I < n;
(c) ak,n-l == ak,n == 0 for 2 < k < n.
4. Prove that a nonconstant harmonic function on a region is an open map.
(Hint: Use the fact that the connected subsets of IR are intervals.)
5. Iffis analytic on G andf(z) # 0 for any z show that u == log/II is harmonic
on G.
6. Let u be harmonic in G and suppose B(a;R) c G. Show that
u(a) = 7T2 f f u(x, y) dx dy.
B(a;R)
7. For Izi < 1 let
u(z) = 1m [ G + ;YJ.
Show that u is harmonic and lim u(re i8 ) == 0 for all B. Does this violate
r-+ 1 -
Theorem 1.7? Why?
8. Let u:G   be a function with continuous second partial derivatives
and define VCr, 6) == u(r cos 6, r sin 6).
(a) Show that

256
Harmonic Functions
r 2 [ fPU + a 2 u J = ,2 a 2 u + , au + a 2 u
ox 2 oy2 or 2 or 08 2
o ( OU ) 02 U
= r or r or + 082 .
So if 0 rt G then u is harmonic iff
r  ( r 0 U ) + 0 2 u = O.
or or 08 2
(b) Let u have the property that it depends only on Izi and not arg z. That
is, u(z) = cp(lzl). Show that u is harmonic iff u(z) = a log Izi + b for some
constan ts a and b.
9. Let u:G  IR be harmonic and let A = {z E G: ux(z) = uy(z) = O}; that
is, A is the set of zeros of the gradient of u. Can A have a limit point in G?
10. State and prove a Schwarz Reflection Principle for harmonic functions.
11. Deduce the Maximum Principle for analytic functions from Theorem
1.6.
2. Harmonic functions on a disk
Before studying harmonic functions in the large it is necessary to study
them locally. That is, we must study these functions on disks. The plan is to
study harmonic functions on the open unit disk {z: Izi < I} and then inter-
pret the results for arbitrary disks. Of basic importance is the Poisson kernel.
2.1 Definition. The function
00
Pr(8) = L rlnleinO,
n= - 00
for 0 < r < 1 and - 00 < e < 00, is called the Poisson kernel.
Let z :::: re i 0 0 < r < 1. then
, - ,
1 + re iO
1 iO = (1 +z)(1 +Z+Z2 + · · .)
-re
00
= 1+2 Lz n
n=1
00
1 + 2 L r n e in 0
n=1
Hence,
( l+re iO ) 00
Re iO = 1 + 2 L r" cos n8
1 - re n = 1
00
= 1 + L rn(e inO + e- in 0)
n=1
= P_(f})

Harmonic functions on a disk
l+re i9 l+rei9-re-i9-r2
Also '9 = i9 2 so that
1 - rei 11 - re I
2.2 P (0) = l-r 2 2 = Re ( 1 +re:: )
r 1-2r cos O+r l-re
2.3 Proposition. The Poisson kernel satisfies the following:
257
'It
(a) 2 f Pr(O) dO = 1;
-n
(b) Pr{O) > 0 for ai, 6, Pre - 0) = Pr{O), and Pr is periodic in 0 with period
21T;
(c) Pr{O) < PreS) if 0 < S < 1 0 1 < 1T;
(d) for each 8 > 0, lim Pr(8) = 0 uniformly in 8 for 1T  181  S.
r"'1-
Proof. (a) For a fixed value of r, 0 < r < 1, the series (2.1) converges
uniformly in O. So
ft ft
 f Pr(O)dO = t r lnl  f ein9 dO = 1
21T 11= - ex> 21T
-ft -n
(b) From equation (2.2), Pr{O) = (1-r 2 )ll-re i9 1-2 > 0 since r < 1.
The rest of (b) is an equally trivial consequence of (2.2).
(c) Let 0 < S < 0 < 1T and define f: [S, 0]  IR by f{t) = Pr{t). Using
(2.2), a routine calculation shows that f'{t) < 0 so that f{S) > f{O).
(d) We must show that
lim [sup {Pr(8): S < 1 8 1 < 1T}] = 0
,....1 -
But according to part (c), Pr{O) < PreS) if 3 < 1 0 1 < 1T; so it suffices to show
that lim PreS) = O. But, again, this is a trivial consequence of equation (2.2).1I
r"'1-
Before going to the applications of the Poisson kernel, the reader should
take time to consider the significance of Proposition 2.3. Think of Pr{O) not
as a function of rand 0 but as a family of functions of 0, indexed by r. As r
approaches 1 these functions converge to zero uniformly on any closed
subinterval of [ -1T, 1T] which does not contain 0 = 0 (part d). Nevertheless,
part (a) is still valid. So as r approaches 1, the graph of Pr becomes closer to
the 0 axis for 0 away from zero but rises sharply near zero so that 2.3{a) is
maintained.
The next theorem states that the Dirichlet Problem can be solved for the
unit disk.
2.4 Theorem. Let D = {z: Izl < I} and suppose that f: aD  IR is a continuous
function. Then there is a continuous function u:D -  IR such that
(a) u{z) = f{z) for z in aD;
(b) u is harmonic in D.

258
Moreover u is unique and is defined by the formula
Harmonic Functions
2.5
7t
'0 1 f .
u(re ' ) = - P,(8- t)f(e ,t ) dt
27T
-7t
for 0 < r < 1, 0 < e < 27T.
Proof Define u: [)  [R by letting u(re i8 ) be as in (2.5) if 0 < r < 1 and
letting u(e i8 ) = f(e i8 ). Clearly u satisfies part (a); it remains to show that u
is continuous on D- and harmonic in D.
(i) u is harmonic in D. If 0 < r < I then
7t
. I f [ 1 +rei(8-t) J .
u(re '8 ) = 2 - Re '(8-t) f(e ,t ) dt
7T I - re'
-n
7t
{ I f it [ 1 +rei(8-t) J }
= Re 27T f(e) l-re i (8-t) dt .
-n
7t
_ { I f it [ e it + re i 8 J }
- Re _ 2 f(e) 't '8 dt ·
7T e ' - rei
-n
So define g:D  C by
7t
I f . [ eit+z J
g(z) = 27T f(e 't ) eit _ z dt.
-1t
Since u = Re g we need only show that g is analytic. But this is an easy
consequence of Exercise IV.2.2.
(ii) u is continuous on D-. Since u is harmonic on D it only remains to
show that u is continuous at each point of the boundary of D. To accomplish
this we make the following
2.6 Claim. Given IX in [-7T, 7T] and € > 0 there is a p, 0 < p < 1, and an arc
A of cD about ei\X such that for p < r < I and e i8 in A,
lu(re i8 ) - f(ei\X) I < €
Once claim 2.6 is proved the continuity of u at ei\X is immediate since f is a
continuous function.
To avoid certain notational difficulties, the claim will only be proved for
IX = O. (The general case can be obtained from this one by an argument
which involves a rotation of the variables.) Since f is continuous at z = 1
there is a 8 > 0 such that
2.7
If(e i8 ) - f(I)/
1
< -€
3

Harmonic functions on a disk 259
if 101 < 8. Let M == max {If(e i8 ) I : 181 < 7T}; from Proposition 2.3 (d) there
is a number p, 0 < p < 1, such that
2.8
E
Pr(O) < 3M
for p < r < I and 101 > i8. Let A be the arc {e i8 :181 < i8}. Then ife i8 EA
and p < r < I,
7t
u( re i9)-f(1) =  f Pr(O-t)f(eit) dt-f(l)
27T
-1t
I f . 1 f .
== 27T Pr(O-t)[f(elt)-f(I))dt+ 27T Pr(8-t)[f(e lt )-f(1))dt.
It I <8 It I 8
If It I > 8 and 1 8 1 < i 8 then It- 81 > i8; so from (2.7) and (2.8) it follows that
lu(re i9 )-f(1)1 < ! E+2M (  ) == E.
3 3M
This proves Claim 2.6.
Finally, to show that u is unique, suppose that v is a continuous function
on D- which is harmonic on D and v(e i8 ) == f(ei8) for all O. Then u-v is
harmonic in D and (u-v) (z) == 0 for all z in oDe It follows from Corollary
1.9 that u-v = 0.11
2.9 Corollary. If u : D -  IR is a continuous function that is harmonic in D
then
7t
'8 1 f .
u(re l ) = - Pr(8 - t)u(e lt ) dt
27T
-1t
for 0 < r < I and all 8. Moreover, u is the real part of the analytic function
7t
I f eit + z .
f(z) = - 't u(e lt ) dt.
27T el-z
-1t
Proof The first part of the corollary is a direct consequence of the theorem.
The second part follows from the fact that f is an analytic function (Exercise
IV.2.2) and formula (2.2). II
2.10 Corollary. Let a E C, p > 0, and suppose h is a continuous real valued
function on {z: Iz - al = p}; then there is a unique continuous function
w:B(a; p) -+ [R such that w is harmonic on B(a; p) and w(z) = h(z) for Iz-al
= p.
Proof: Considerf(e i8 ) = h(a + pe i8 ); thenfis continuous on oDe If u: D-  [R
is a continuous function such that u is harmonic in D and u(e i8 ) = f(e i8 ) then

260 Harmonic Functions
it is an easy matter to show that w(z) = u( z p a) is the desired function on
R( a; p). II
It is now possible to give the promised converse to the Mean Value
Theorem.
2.11 Theorem. If u: G   is a continuous function which has the MVP then
u is harmonic.
Proof Let a E G and choose p such that R(a; p) c G; it is sufficient to show
that u is harmonic on B(a; p). But according to Corollary 2.10 there is a
continuous function w: R(a; p)   which is harmonic in B(a; p) and
w(a+ pe i8 ) = u(a+ peW) for all 8. Since u - w satisfies the MVP and
(u - w)(z) = 0 for Iz - al = p, it follows from Corollary 1.9 that u = w in
B(a; p); in particular, u must be harmonic. II
To prove the above theorem we used Corollary 2.10, which concerns
functions harmonic in an arbitrary disk. It is desirable to derive a formula
for the Poisson kernel of an arbitrary disk; to do this one need only make a
change of variables in the formula (2.2).
If R > 0 then substituting r/ R for r in the middle of (2.2) gives
R 2 _ r 2
R 2 -2rR cos 8+r 2
2.12
for 0 < r < R and all 8. So if u is continuous on R(a; R) and harmonic in
B(a; R) then
2.13
7t
1 f [ R2 - r 2 ]
u(a+re i6 ) = - 2 (8 ) 2 u(a+Re it ) dt
27T R -2rR cos -t +r
-7t
Now (2.12) can also be written
R 2 _ r 2
IRe it _re i8 12
and R-r < IRe it -re i8 1 < R+r. Therefore
R-r R2_r 2 R+r
-< <-
R+r - R 2 -2rR cos (8-t)+r 2 - R-r.
If u > 0 then equation (2.13) yields the following.
2.14 Harnack's Inequality. If u: R(a; R)   is continuous, harmonic in
B(a; R), and u > 0 then for 0 < r < R and all 8
R-r . R+r
-- u(a) < u(a+re I8 ) < - u(a)
R+r R-r
Before proceeding, the reader is advised to review the relevant definitions
and properties of the metric space C( G, ) (Section VII. 1 ).

Harmonic functions on a disk 261
2.15 Definition. If G is an open subset of C then Har( G) is the space of
harmonic functions on G. Since Har( G) c C (G, ) it is given the metric that
it inherits from C (G, ).
2.16 Harnack's Theorem. Let G be a region. (a) The metric space Har(G) is
complete. (b) If {un} is a sequence in Har(G) such that U 1 < U2 < . . . then
either un(z)  00 uniformly 011 compact subsets of G or {un} converges in
Har(G) to a harmonic function.
Proof (a) To show that Har(G) is complete, it is sufficient to show that it is
a closed subspace of C(G, ). So let {un} be a sequence in Har(G) such that
Un  U in C(G, ). Then (Lemma IV.2.7) it follows that U has the MVP and
so, by Theorem 2.11, u must be harmonic.
(b) We may assume that U 1 > 0 (if not, consider {un - U 1 }). Let u(z)
= sup {un(z): n > I} for each Z in G. So for each z in G one of two possi-
bilities occurs: u(z) = 00 or u(z) E  and un(z)  u(z).
Define
2.17
A = {ZEG:U(Z) = oo}
B = {z E G: u( z) < oo};
then G = A u B and A n B = D. We will show that both A and B are open.
If a E G, let R be chosen such that B(a; R) c G. By Harnack's inequality
R-Iz-al R+ Iz-al
I I un(a) < un(z) < I I un(a)
R+z-a R-z-a
for all z in B(a; R) and all n > 1. If a E A then un(a)  00 so that the left half
of (2.17) gives that un(z)  00 for all z in B(a; R). That is, B(a; R) c A and
so A is open. In a similar fashion, if a E B then the right half of (2.17) gives
that u(z) < 00 for Iz - al < R. That is B is open.
Since G is connected, either A = G or B = G. Suppose A = G; that is
u = 00. Again if B(a; R) c G and 0 < p < R then M = (R-p)(R+p)-t > 0
and (2.17) gives that M un(a) < un(z) for Iz - al < p. Hence un(z)  00
uniformly for z in B(a; p). In other words, we have shown that for each a in
G there is a p > 0 such that un(z)  00 uniformly for Iz-al < p. From this
it is easy to deduce that un(z)  00 uniformly for z in any compact set.
Now suppose B = G, or that u(z) < 00 for all z in G. If p < R then, as
above, there is a constant N, which depends only on a and p such that
M un(a) < un(z) < N un(a) for Iz - al < p and all n. So if m < n
o < un(z) - um(z) < N un(a) - M um(a)
< C[un(a) - um(a)]
for some constant C. Thus, {un(z)} is a uniformly Cauchy sequence on
B(a; p). It follows that {un} is a Cauchy sequence in Har( G) and so, by part
(a), must converge to a harmonic function. Since un(z)  u(z), u is this
harmonic function. II
It is possible to give .alternate proofs of Harnack's Theorem. One involves

262 Harmonic Functions
applying Dini's Theorem (Exercise VII.l.6). Another involves using the
Monotone Convergence Theorem from measure theory to obtain that u has
the MVP. However, both these approaches necessitate proving that the
function u is continuous. This is rather easy to accomplish by appealing to
(2.17) and the fact that un(z)  u(z) for all z; these facts imply that
R-Iz-al R+ Iz-al
I I u( a) < u( z) < I I u( a)
R+z-a R-z-a
Hence
-2Iz-al 2lz-al
I I u( a) < u( z ) - u( a) < I I u( a) ;
R+z-a R-z-a
or
2 Iz-al
lu(z)-u(a)1 < I I u(a)
R- z-a
So as z  a, it is clear that u(z)  u(a).
Exercises
1. Let D = {z: Izi < I} and suppose thatf:D-  C is a continuous function
such that both Re f and 1m f are harmonic. Show that
1t
'0 1 f .
f(rel ) = - f(elt)pr(O - t) dt
27T
-7t
for all re iO in D. Using Definition 2.1 show that f is analytic on D iff
1t
f f( eit)eint dt = 0
-1t
for all n > 1.
2. In the statement of Theorem 2.4 suppose that f is piecewise continuous
on oD. Is the conclusion of the theorem still valid? If not, what parts of the
conclusion remain true?
3. Let D = {z: I z I < I}, T = 0 D = {z: I z I = I}
(a) Show that if g:D- c is a continuous function and gr:TC is
defined by gr(z) = g(rz) then gr(z)  g(z) uniformly for z in T as r  1-.
(b) If f:T  C is a continuous function define J:D-  C by J(z) = fez)
for z in T and
1t
j(re iO ) = 2 1 7T f f(eit)Pr(f} - t) dt
-1t
(So Rej and Imj are harmonic in D). Define.fr: T C by .fr(z) = j(rz).
Show that for each r < 1 there is a sequence {Pn(z,Z)} of polynomials in z
and z such thatPn(z,Z).fr(z) uniformly for z in T. (Hint: Use Definition
2.1.)

Subharffionic and superharffionic functions 263
(c) Weierstrass approximation theorem for T. If f: T C is a continuous
function then there is a sequence {Pn (z, i)} of polynomials in z and z such
that Pn(z,i)f(z) uniformly for z in T.
(d) Suppose g: [0, I]C is a continuous function such that g(O) = g(I).
Use part (c) to show that there is a sequence {Pn} of polynomials such that
Pn(t)g(t) uniformly for t in [0, I].
( e ) Weierstrass approximation theorem for [0, 1]. If g: [0, I] C is a
continuous function then there is a sequence {P n } of polynomials such
that Pn(t)g(t) uniformly for t in [0, I]. (Hint: Apply part (d) to the
function get) + (I - t) g(l) + tg(O).)
(f) Show that if the function g in part (e) is real valued then the
polynomials can be chosen with real coefficients.
4. Let G be a simply connected region and let r be its closure in Coo;
000G = r-G. Suppose there is a. homeomorphism cp of r onto D-(D
- {z: Izi < I}) such that cp is analytic on G.
(a) Show that cp(G) = D and cp(oooG) = oDe
(b) Show that if I: 0 00 G   is a continuous function then there is a
continuous function u: r   such that u(z) = I(z) for z in 000G and u is
harmonic in G.
(c) Suppose that the function 1 in part (b) is not assumed to be con-
tinuous at 00. Show that there is a continuous function u: G-  IR such that
u(z) == I(z) for z in oG and u is harmonic in G (see Exercise 2).
5. Let G be an open set, a E G, and Go = G - {a}. Suppose that u is a har-
monic function on Go such that lim u(z) exists and is equal to A. Show that
z-+a
if U:G   is defined by/U(z) = u(z) for z =1= a and U(a) = A then U is
harmonic on G.
6. Let I: {z:Re z = O}  IR be a bounded continuous function and define
u:{z:Re z>O}  IR hy
00
. 1 f )(I(it)
U(X+1Y) = - 2 ( )2 dt.
7T )( + y- t
-00
Show that u is a bounded harmonic function on the right half plane such that
for c in IR, f(ic) = lim u(z).
z-+ ic
7. Let'D={z:lzl<l} and supposef:aD1R is continuous except for a
jump discontinuity at z = I. Define u: DIR by (2.5). Show that u is
harmonic. Let v be a harmonic conjugate of u. What can you say about
the behavior of vCr) as rI-? What about v(re IO ) as rl- and (}O?
3. Suhharmonic and superharmonic functions
In order to solve the Dirichlet Problem generalizations of harmonic
functions are introduced. According to Theorem 2.11, a function is harmonic
exactly when it has the MVP. With this in mind, the choice of terminology in
the next definition becomes appropriate.

264 Harmonic Functions
3.1 Definition. Let G be a region and let cp: G   be a continuous function.
cP is a subharmonic function if whenever B(a; r) c G,
2n
<p(a) <  J cp(a + re i8 ) dO.
27T
o
cp is a superharmonic function if whenever B(a; r) c G,
21t
<p(a) >  J cp(a + re i8 ) dO.
27T
o
The first comment that should be made is that cp is superharmonic iff - cp
is subharmonic. Because of this, only the results on subharmonic functions
will be given and it will be left to the reader to state the analogous result for
superharmonic functions. Nevertheless, we will often quote results on
superharmonic functions as though they had been stated in detail.
In the definition of a subharmonic function cp it is possible to assume
only that cp is upper semi-continuous. However this would make it necessary
to use the Lebesgue Integral in the definition instead of the Riemann Integral.
So it is assumed that cp is continuous when cP is subharmonic even though
there are certain technical advantages that accrue if only upper semi-
continuity is assumed.
Clearly every harmonic function is subharmonic as well as superharmonic.
In fact, according to Theorem 2.11, u is harmonic iff u is both subharmonic
and superharmonic. If CPt and CP2 are subharmonic then so is at CPt + a 2 CP2
if at, a2 > o.
It is interesting to see which of the results on harmonic functions also
hold for subharmonic functions. One of the most important of these is the
Maximum Principle.
3.2 Maximum Principle (Third Version). Let G be a region and let cp: G  
be a subharmonic function. If there is a point a in G with cp(a) > cp(z) for all z
in G then cP is a constant function.
The proof is the same as the proof of the first version of the Maximum
Principle. (Notice that only the Minimum Principle holds for superharmonic
functions. )
The second version of the Maximum Principle can also be extended, but
here both subharmonic and superharmonic functions must be used.
3.3 Maximum Principle (Fourth Version). Let G be a region and let cP and if;
be bounded real valued functions defined on G such that cp is subharmonic and
\fI is superharmonic. If for each point a in aooG
lim sup cp(z) < lim inf (z),
z-+a
z-+a
then either cp(z) < (z)for all z in G or cp =  and cp is harmonic.

Subharmonic and superharmonic functions 265
Again, the proof is identical to that of Theorem 1.7 and will not be
repeated here.
Notice that we have not excluded the possibility that a subharmonic
function may assume a minimum value. Indeed, this does happen. For
example, cp(x, y) = x 2 + y2 is a subharmonic function and it assumes a
minimum at the origin. This failure of the Minimum Principle is due to the
fact that if u has the MVP then so does - u; however, if cp is subharmonic
then - cp is never subharmonic unless it is harmonic.
When we say that a function satisfies the Maximum Principle, we refer
to the third version. That is, we suppose that it does not assume a maximum
value in G unless it is constant.
3.4 Theorem. Let G be a region and cp: G  [R a continuous function. Then cP is
subharmonic iff for every region G 1 contained in G and every harmonic function
u 1 on G l, cp - U 1 satisfies the Maximum Principle on G 1.
Proof Suppose that cp is subharmonic and G t and U t are as in the statement
of the theorem. Then cp - Ul is clearly subharmonic and must satisfy the
Maximum Principle.
N ow suppose cp is continuous and has the stated property; let B( a, r) c G.
According to Corollary 2.10 there is a continuous function u: B( a, r)  IR
which is harmonic in B(a; r) and u(z) = cp(z) for Iz - al = r. By hy-
pothesis, cp - u satisfies the M.aximum Principle. But (cp - u)( z) = 0 for
Iz - al = r. So cp < u and
2ft
cp ( a ) < u ( a) = 2 1 17 J U (a + re i/J) d ()
o
21t
- - f cp(a + re iO ) dO.
2 1 17
o
Therefore cp is subharmonic. II
3.5 Corollary. Let G be a region and cp: G IR a continuous function; then cp
is subharmonic iff for every bounded region G) such that G)- c G and for
every continuous function u): G)-  [R that is harmonic in G) and satisfies
cp(z) S u)(z) for z on JG),cp(z) < u)(z) for z in G).
3.6 Corollary. Let G be a region and CPt and CP2 subharmonic functions on
G; if cp(z) = max {CPl (z), CP2(Z)} for each z in G then cP is a subharmonic
function.
Proof Let G l be a region such that G 1 c G and let U 1 be a continuous
function on G 1 which is harmonic on G l with cp(z) < ul(z) for all z in OGle
Then both CPl(Z) and CP2(Z) < ul(z) on oG l . From Corollary 3.5 we get that
CPl(Z) and CP2(Z) < u 1 (z) for all z in G l . So cp(z) < u 1 (z) for z in G h and,
again by Corollary 3.5, cP is subharmonic. II

266 Harmonic Functions
3.7 Corollary. Let q; be a subharmonic function on a region G and let
B(a; r) c G. Let q;' be the function defined on G by:
(i) q;'(z) = q;(z) if z E G - B(a; r);
(ii) q;' is the continuous function on B(a; r) which is harmonic in B(a; r)
and agrees 1vith q;(z) for Iz - aj = r.
Then q;' is subharmonic.
The proof is left to the reader.
As was mentioned at the beginning of this section, one of the purposes
in studying subharmonic functions is that they enter into the solution of the
Dirichlet Problem. Indeed, the fourth version of the Maximum Principle
gives an insight into how this occurs. If G is a region and u: G - -+  is a
continuous function (G- = the closure in Coo) which is harmonic in G, then
q;(z) < u(z) for all z in G and for all subharmonic functions q; which satisfy
lim sup q;(z) < u(a) for all a in 0ooG. Since u is itself such a subharmonic
Z-Q
function we arrive at the trivial result that
3.8 u(z) = sup {q;(z):cp is subharmonic and lim supq;(z) < u(a)forallain 0ooG}.
Z-Q
Although this is a trivial statement, it is nevertheless a beacon that points
the way to a solution of the Dirichlet Problem. Equation (3.8) says that if
f: a 00 G  is a continuous function and if f can be extended to a function
u that is harmonic on G, then u can be obtained from a set of sub-
harmonic functions which are defined solely in terms of the boundary
val ues f. This leads to the following definition.
3.9 Definition. If G is a region and f: 0 00 G -+  is a continuous function then
the Perron Family, &(j G), consists of all subharmonic functions q;: G -+ 
such that
lim sup q;(z) < f(a)
Z-Q
for all a in 0ooG.
Since f is continuous, there is a constant M such that I/(a) I < M for all
a in 0 00 G. So the constant function - M is in &(f, G) and the Perron Family
is never empty.
If u: G- -+  is a continuous function which is harmonic in G and
f = uloG then (3.8) becomes
3.10
u(z) = sup {q;(z): q; E &(f, G)}
for each z in G. Conversely, if f is given and u is defined by (3.10) then u
must be the solution of the Dirichlet Problem with boundary values .f; that
is, provided the Dirichlet Problem can be solved. In order to show that
(3.10) is a solution two questions must be answered affirmatively.
(a) Is u harmonic in G?
(b) Does lim u(z) = f(a) for each a in oooG?
Z-Q

Subharmonic and superharmonic functions 267
The first question can always be answered "Yes" and this is shown in
the next theorem. The second question sometimes has a negative answer and
an example will be given which demonstrates this. However, it is possible to
impose geometrical restrictions on G which guarantee that the answer to
(b) is always yes for any continuous functionf This will be done in the next
section.
3.11 Theorem. Let G be a region andf: (}ooG -7- [R a continuous function; then
u(z) == sup {g{z): fP E &(f, G)} defines a harmonic .function u on G.
Proof Let I/(a)j < M for all a E {} ooG. The proof begins by noting that
3.12 fP(z) < M for all z in G, fP in &(f, G)
This follows because, by definition, lim sup fP(z) < M whenever fP E f?lJ(f, G);
z-+a
so (3.12) is a direct consequence of the Maximum Principle.
Fix a in G and let B(a; r) c G. Then u(a) == sup {fP(a): fP E f?lJ(f, G)};
so there is a sequence {fPn} in f?lJ( f, G) such that u(a) == lim fPn(a). Let
<D n == max {fP l' . . . , fPn}; by Corollary 3.6 <D n is su bharmonic. Let <D  be the
subharmonic function on G such that <D(z) == <Dn(z) for z in G-B(a; r) and
<D  is harmonic on B(a; r) (Corollary 3.7). It is left to the reader to verify the
following statements:
3.13 <D :::; <D+ 1
3.14 fPn < <D n < <D: z
3.15 <D  E f?lJ(f, G).
Because of(3.15), <D(a) < u(a); from (3.14) and the choice of {fPn}, this gives
that
3.16
u(a) == lim <D :Z(a).
Moreover, statement (3.12) gives that <D < M for all n; so using (3.13),
Harnack's Theorem implies that there is a harmonic function U on B(a; r)
such that V(z) == lim <D(z) uniformly for z in any proper subdisk of B(a; r). It
follows from (3.15) and (3.16) that U < u and V(a) == u(a), respectively.
Now let Zo E B(a; r) and let {n} be a sequence in f?lJ(f, G) such that
u(z 0) == lim n(z 0).
Let Xn == max {fPn, n}' X n == max {Xl' . . ., Xn}, and let X be the sub-
harmonic function \vhich agrees with X n off B(a; r) and is harmonic in
B(a; r). As above, this leads to a harmonic function U 0 on B(a; r) such that
U 0 < u and V o(zo) == u(zo). But <Dn < X n so that <D < X. Hence
V < V o < u and U(a) == Uo(a) == u(a). Therefore V- V o is a negative
harmonic function on B(a; r) and (V - U o)(a) == O. By the Maximum
Principle, U == U 0; so U(z 0) == u(z 0). Since z 0 was arbitrary, u == U in
B(a; r). That is, u is harmonic on every disk contained in G. _
3.17 Definition. Let G be a region and let f: 000G -7-  be a continuous

268 Harmonic Functions
function. The harmonic function u obtained in the preceding theorem is
called the Perron Function associated with f
The next step in solving the Dirichlet Problem is to prove that for each
point a in 000G lim u(z) exists and equalsj(a). As was mentioned earlier, this
z-+a
does not always hold. The following example illustrates this phenomenon.
Let G = {z:O < Izi < I}, T= {z:lzl = I}; so 8G = Tu {O}. Define
I: oG  IR by I(z) = 0 if z E T and 1(0) = 1. For 0 < E < 1 let uE(z) = (log
Izl) (log E) -1; then U E is harmonic in G, uE(z) > 0 for z in G, uE(z) = 0 for
z in T, and uE(z) = 1 if Izi = E. Suppose that v E f?lJ(f, G); since III < 1,
Iv(z)1 < 1 for all z in G. If R E = {z: E < Izi < I} then lim sup v(z) < uE(a)
z-+a
for all a in oRE; by the Maximun1 Principle, v(z) < uE(z) for all z in Rc Since
€ was arbitrary this gives that for each z in G, v(z) < lim uE(z) = O. Hence
E-+ 0
the Perron function associated with I is the identically zero function, and
the Dirichlet Problem cannot be solved for the punctured disk. (Another
proof of this is available by using Exercise 2.5 and the Maximum Principle.)
Exercises
1. Which of the following functions are subharmonic? superharmonic?
harmonic? neither subharmonic nor superharmonic? (a) cp(x, y) = x 2 + y2;
(b) cp(x, y) = x 2 _y2; (c) cp(x, y) = x 2 +y; (d) cp(x, y) = x 2 -y; (e) cp(x, y)
= X+y2; (f) cp(x, y) = x-y2.
2. Let Subhar(G) and Superhar(G) denote, respectively, the sets of sub-
harmonic and superharmonic functions on G.
(a) Show that Subhar(G) and Superhar(G) are closed subsets of C(G; IR).
(b) Does a version of Harnack's Theorem hold for subharmonic and
superharmonic functions?
3. If G is a region and if I: 0 00 G  IR is a continuous function let U f be the
Perron Function associated with! This defines a map T:C(oooG; 1R)Har(G)
by T(f) = ufo Prove:
(a) Tis linear (i.e., T(al/ l +a2/2) = a 1 T(/I)+a 2 T(/l)).
(b) Tis positive (i.e., iff(a) > 0 for all a in 000G then T(f)(z) > 0 for all
z in G).
(c) T is continuous. Moreover, if {J;,} is a sequence in C(oooG; IR) such
that In .f uniformly then T(ln)  T(f) uniformly on G.
(d) If the Dirichlet Problem can be solved for G then T is one-one. Is the
converse true?
4. In the hypothesis of Theorem 3.11, suppose only that I is a bounded
function on 0ooG; prove that the conclusion remains valid. (This is useful if
G is an unbounded region and g is a bounded continuous function on oG.
If we define I: 0 00 G  IR by I(z) = g(z) for z in oG and I( (0) = 0 then the
conclusion of Theorem 3.11 remains valid. Of course there is no reason to
expect that the harmonic function will have predictable behavior near 00-
we could have assigned any value to I( (0). However, the behavior near points
of 8G can be studied with hope of success.)

The Dirichlet Problem 269
5. Let G be a region and/: 000G   a continuous function. Define V(f, G)
to be the family of all superharmonic functions if; on G such that lim inf
z-+a
(z) > f(a). If v: G  IR is defined by v(z) = inf {if;(z): if; E V(f, G)}, prove
that v is harmonic on G. If u is the Perron Function associated with I, show
that u(z) < v(z). Prove that lim u(z) = f(a) for all a in 000G iff u(z) = v(z)
z-+Q
for all z. Can you give a condition in terms of u and v which is necessary and
sufficient that lim u(z) = f(a) for an individual point a in 0ooG?
z-+a
6. Show that the requirement that G I is bounded in Corollary 3.5 is
necessary.
7. If j: G is analytic and cp:  IR is subharmonic, show that cpo j is
subharmonic if j is one-one. What happens if j'(z)=1=0 for all z in G?
4. The Dirichlet Problem
4.1 Definition. A region G is called a Dirichlet Region if the Dirichlet Problem
can be solved for G. That is, G is a Dirichlet Region if for each continuous
functionf: 000G  IR there is a continuous function u: G-  R such that u is
harmonic in G and u(z) = .f(z) for all z in 0ooG.
We have already seen that a disk is a Dirichlet Region, but the
punctured disk is not. In this section, we will see conditions that are
sufficient for a region to be a Dirichlet Region. The first step in this
direction is to suppose that there are functions which can be used to
restrict the behavior of the Perron Functions near the boundary.
For a set G and a point a in 0ooG, let G(a; r) = G n B(a; r) for all r > o.
4.2 Definition. Let G be a region and let a E 000 G. A barrier for G at a is a
family {tfr: r > O} of functions such that:
(a) , is defined and supernarmonic on G (a; r) with 0 < r(z) < I;
(b) lim ,(z) = 0;
z-+Q
(c) lim ,(z) = 1 for w in G n {w: Iw-al = r}.
z-+w
The following observation is useful: if (fI, is defined by letting (fI, = if;, on
G(a; r) and (fI,(z) = 1 for z in G-B(a; r), then (fI, is superharmonic. (Verify!)
So the functions (fI "approach" the function which is one everywhere but
z = a, where it is zero. The second observation which must be made is that
if G is a Dirichlet Region then there is a barrier for G at each point of 0ooG.
In fact, if aEoooG (a# (0) and f(z) = Iz-al(I+lz-al}-t for z# 00
with f(oo) = 1, then f is continuous on 0ooG; so there is a continuous
function u: G-  IR such that u is harmonic on G and u(z) = fez) for z in
0ooG. In particular, u(a) = 0 and a is the only zero of u in G- (Why?)
Let c, = inf {u(z):lz-al = r, ZEG} = min {u(z):/z-al = r, ZEG-} > O.
1
Define ,: G(a; r)  IR by if;,(z) = - min {u(z), c,}. It is left to the reader to
c,
check that {if;,} is a barrier.

270
The next result provides a converse to the above facts.
4.3 Theorem. Let G be a region and let a E 000G such that there is a barrier for
(i at a. Iff: 000G  IR is continuous and u is the Perron Function associated
with f then
Harmonic Functions
lim u(z) = f(a)
za
Proof Let {if;r: r > O} be a barrier for G at a and for convenience assume
a i= 00; also assume that f(a) = 0 (otherwise consider the function f -.r(a)).
Let € > 0 and choose 8 > 0 such that If(w) I < € whenever w E 000G and
Iw-al < 28; let if; = if;. Let t/J:GIR be defined by t/J(z) = if;(z) for z in
G(a; 8) and t/J(z) = 1 for z in G-B(a; 8). Then t/J is superharmonic. If
If(w) I < M for all w in 0ooG, then -Mt/J-€ is subharmonic.
4.4 Claim. - Mt/J- € is in f!IJ(f, G).
If WE 0ooG-B(a; 8) then lim sup [-Mt/J(z)-€] = -M-E <few). Because
zw
tfr(z) > 0, it follows that lim sup [-Mtfr(z)-€] < -€ for all win 0ooG. In
zw
particular, if WE 000G () B(a; 8) then lim sup [-Mtfr(Z)-E] < -E <few) by
zw
the choice of 8. This substantiates Claim 4.4. Hence
4.5
-Mtfr(z)-€ < u(z)
for all z in G.
A similar analysis yields
lim inf [Mtfr(z) + E] > lim sup fjJ(z)
zw
zw
for all fjJ in f!IJ(f, G) and w in 0ooG. By the fourth version of the Maximum
Principle, fjJ(z) < Mtfr(z) + € for fjJ in f!IJ(f, G) and z in G. Hence
u(z) < Mtfr(Z)+E;
or, combining thIS with (4.5),
4.6 -Mtfr(z)-€ < u(z) < Mtfr(Z)+E
for all z in G. But lim tfr(z) = lim if;(z) = 0; since E was arbitrary, (4.6) gives
that za za
lim u(z) = 0 = f(a).
za
This completes the proof. II
Notice that the purpose of the barrier was to construct the function .fr
which "squeezed" u down to zero.
4.7 Corollary. A region G is a Dirichlet Region iff there is a barrier for G at
each point of 0ooG.
The above corollary is not the solution to the problem of characterizing
Dirichlet Regions. True, it gives a necessary and sufficient condition that a
region be a Dirichlet Region and this condition is formally weaker than the
definition. However, there are aesthetic and practical difficulties with Corol-
lary 4.7.. One difficulty is that the condition in (4.7) is not easily verified.

The Dirichlet Problem 271
Another difficulty is that it is essentially the same type of condition as the
definition; both hypothesize the existence of functions with prescriqed
boundary behavior.
What is desired? Both tradition and aesthetics dictate that we strive for
a topological-geometric condition on G which is necessary and sufficient
that G be a Dirichlet Region. Such conditions are usually easy to verify for
a given region, and the equivalence of a geometric property and an analytic
one is the type of beauty after which most mathematicians strive. At the
present time no such equivalence is known and we must be content with
sufficient conditions.
4.8 Lemma. Let G be a region in C and let S be a closed connected subset of
Coo such that 00 E Sand S n 000G = {a}. If Go is the component of Coo - S
which contains G then Go is a simply connected region in the plane.
Proof Let Go, G l' . . . be the components of Coo - S with G eGo; note that
each G n is a region in C. If z E 000G n then G n U {z} is connected (Exercise
11.2.1). Since G n is a component it follows that 000G n c S. By Lemma
00
11.2.6 G n U S ( = G; u S) is connected and, consequently, so is U (G n U S)
n=l
= Coo - Go. In virtue of Theorem VIII 3.2(c), Go is simply connected. II
4.9 Theorem. Let G be a region in C and suppose that a E 000G such that the
component of Coo - G which contains a does not reduce to a point. Then G has a
barrier at a.
Proof Let S be the component of Coo - G such that a E S. By considering an
appropriate Mobius transformation if necessary, we may assume that a = 0
and 00 E S. Let Go be the component of Coo - S which contains G. The
preceding lemma gives that Go is simply connected; since 0 i Go there is a
branch t of log z defined on Go. In particular t is defined on G. For r > 0,
let tr(z) = t(z/r) = t(z) -log r for z in G(O; r). So - C:.( G(O; r)) is a subset
of the right half plane. Now let C r = G n {z: Izi = r}; then C r is the union
of at most a countable number of pairwise disjoint open arcs Yk in {z: Izi = r}.
But - tr(Yk) = (ia k , if3k) = {it: ak < t < f3k} for k > 1. Hence
00
- t r ( C r ) = U (iak' if3k)
k=l
and these intervals are pairwise disjoint. Furthermore, the length of Yk is
r(f3 k - ak); so
4.10
00
L (f3k - a k ) < 21T.
k=l
Now if log is the principal branch of the logarithm then
( z - ia k )
hk(z) = 1m log .
Z - lfJ k

272 Harmonic Functions
is harmonic in the right half piane and 0 < hk(z) < 71' for Re z > 0 (see
Exercise 111.3.19). Moreover
4.11
/3k
hk(x+iy) = f 2 (X )2 dt
x + y-t
(Xk
if x > O. From (4.11) it follows that
00
n f x
L hk(x+iy) < 2 2 dt = 71'.
k=l x +(y-t)
-00
00
Since each h k > 0, Harnack's Theorem gives that h = L h k is harmonic in
the right half plane. Hence k= 1
1
r(z) = - h ( - tr(z))
7T
is harmonic in G(O; r). It will be shown that {t/1r} is a barrier at a.
Fix r > 0; then lim Re [- tr(z)] = + 00. So it suffices to show that
zo
h(z) O as Re z  + 00. Using (4.11) and (4.10) it follows that for x > 0,
00
h(x+iy) = 2: hk(x+iy)
k=l
00 /3k
-  f 1/ x dt
6 1 +(y-tfX)2
(Xk
1 00
< - 2: «(3k-a.k)
x k=l
27T
<-
- .
x
So, indeed, lim hex + iy) = 0 uniformly in y; this gives that lim t/1r(z) = o.
x + 00 zo
To prove that lim r(z) = 1 for w in G with Irt'l = r, it is sufficient to
prove that zw
4.12
lim h(z) = 71' if C'Lk < C < f3k for some k
zic
So fix k > 1 and fix c in (C'Lk, f3k). The following will be proved.
4.13 Claim. There are numbers C'L and f3 such that C'L < C'Lk < f3k < f3 and if
( z- iC'L )
u( z) = 1m log . ,
z - ZC'Lk
( z- if3k )
v(z) = 1m log z-if3

The Dirichlet Problem 273
then x > 0 and C'Lk < Y < f3k implies 0 < hex + iy) - hk(x + iy) < u(x + iy)
+v(x+iy).
Once 4.13 is established, Equation 4.12 is proved as follows. From Exercise
111.3.19,
. ( y-f3k ) ( Y-f3 )
V(X+lY) = arctan x -arctan  ·
so if x+iy  ie, e < f3k < f3, then v(x+iy)  o.
Similarly u(x+iy)  0 as x+iy  ie, with C'L < C'Lk < e.
Hence, Claim 4.13 yields
4.14
lim [h(z)-hk(z)] = O.
But
( y-C'L k ) ( y-f3k )
hk(x+ iy) = arctan x - arctan x '
so lim hk(z) = 7T; this combined with (4.14) implies Equation (4.12).
zic
It remains to substantiate Claim 4.13; we argue geometrically. Recall
(Exercise 111.3.19) that h j(z) is the angle in the figure. Consider all the
intervals (iC'L j, if3 j) lying above (iC'Lk' if3k) and translate them downward along
the imaginal'Y axis, keeping them above (iC'Lk' if3k) until their endpoints
coincide and such that one of the endpoints coincides with iflk. Since
"L(f3 j - C'L j) < 27T there is a number f3 < (f3k + 27T) such that each of the tras-
lated intervals lies in (if3k' if3). Now if z = x + iy, x > 0 and C'Lk < Y < f3k,
i{3 j
z
ij

274 Harmonic Functions
then the angle h j(z) increases as the interval (ia j, if3 j) is translated downward.
Hence ak < 1m z < f3k implies
4.15
Ih j(z) < v(z),
j
where v is as in the statement of the claim and the sum is over all j such that
a j > f3k. By performing a similar upward translation of the intervals (ia j'
if3 j) with f3 j < ak, there is a number a < (ak - 27T) such that the translates
lie in the interval (ia, iak)' So if u is as in the claim and ak < 1m Z < f3k,
4.16
Ih j(z) < u(z)
j
where the sum is over all j with f3 j < ak' By combining (4.15) and (4.16) the
claim is established. II
4.17 Corollary. Let G be a region such that no component of Coo - G reduces
to a point,. then G is a Dirichlet Region.
4.18 Corollary. A simply connected region is a Dirichlet Region.
Proof. If G i= C the result is clear since Coo - G has only one component.
If G = C then the result is trivial. II
Theorem 4.9 has no converse as the following example illustrates. Let
1 > r 1 > r2 > . . . with r n  0; for each n let Yn be a proper closed arc of
00
the circle Izl = r n with length V(Yn). Put G = B(O; 1)- [U {Ym} U {O}] and
00 n=l
suppose that lim V(Yn)/r n = 27T. So Coo - G = {O} U U {Yn} U {z: Izi > I}.
n=l
According to Theorem 4.9 there is a barrier at each point of () 00 G = 8G with
the possible exception of zero. We will show that there is also a barrier at zero.
m
If r n - 1 > r > r n and if m > n, let Bm = B(O; r)- U {Yj}. Let h m be the
j=n
continuous function on B;;' which is harmonic on Bm with hm(z) = 1 for
m
Izi = rand hm(z) = 0 for z in U {y j}. Then {h m } is a decreasing sequence of
j=n
positive harmonic functions on G(O; r); by Harnack's Theorem {h m } con-
verges to a harmonic function on G(O; r) which is also positive (Why?)
Since lim h(z) = 1 for Iwl = r, we need only show that lim h(z) = O. Let k m
zw zo
be the harmonic function on B(O; r m ) which is 0 on {Ym} and 1 on {z: Izi
= r m} - {Ym} (this does not have continuous boundary values, only piecewise
continuous boundary values which are sufficient-see Exercise 2.2). Then
o < h < k m on B(O; r m ) and
21t
km(O) =  f km(r me iO ) dB
27T
o
=  ( 27T- V(Ym) )
27T r m

Green's Function 275
Since V(Ym]  217, km(O)  0; it follows that h(z)  0 as z  O. Thus, G has
r m
a barrier at zero.
Exercises
1. Let G = B(O; I) and find a barrier for G at each point of the boundary.
2. Let G = C - (00, 0] and construct a barrier for each point of ° 00 G.
3. Let G be a region and a a point in 000G such that there is a harmonic
function u: G  IR with Jim u(z) = 0 and lim inf u(z) > 0 for all w in 0ooG,
z-+a
z-+w
lV #- a. Show that there is a barrier for G at a.
4. This exercise asks for an easier proof of a special case of Theorem 4.9.
Let G be a bounded region and let a E oG such that there is a point b with
[a, b] n G- = {a}. Show that G has a barrier at a. (Hint: Consider the
transformation (z - a)(z - b) -1.)
5. Green's Function
In this section Green's Function is introduced and its existence is dis-
cussed. Green's Function plays a vital role in differential equations and other
fields of analysis.
5.1 Definition. Let G be a region in the plane and let a E G. A Green's
Function of G }t'ith singularity at a is a function ga: G  IR with the
properties:
(a) ga is harmonic in G - {a};
(b) G(z) = ga(z) + log Iz-al is harmonic in a disk about a;
(c) lim ga(z) = 0 for each w in 0ooG.
z-+w
For a given region G and a point a in G, ga need not exist. However, if it
exists, it is unique. In fact if h a has the same properties, then, from (b),
h a - ga is harmonic in G. But (c) implies that lim [h a (z) - ga ( Z )] = 0 for
zw
every w in JooG; so ha = ga by virtue of the Maximum Principle.
A second observation is that a Green's Function is positive. In fact, ga is
harmonic in G- {a} and hm g(z) = + 00 since ga(Z) + log Iz-al is harmonic
z-+a
at z = a. By the Maximum Principle, ga(z) > 0 for all z in G - {a}.
Given this observation it is easy to see that C has no Green's Function
with a singularity at zero (or a singularity at any point, for that matter). In
fact, suppose go is the Green's Function with singularity at zero and put
g = - go; so g(z) < 0 for all z. We will show g must be a constant function,
which is a contradiction. To do this, it is sufficient to show that if 0 =1= z 1
i= z 2 =1= 0 then g(z 2) < g(z 1). If € > 0 then there is a 8 > 0 such that

276 Harmonic Functions
/g(Z)-g(Zl)/ < € if IZl-zl < 8; so g(z) < g(ZI)+€ if Iz-zll < 8. Let
r > IZl -z21 > 8; then
g( Z 1) + E I z - Z 1
hr(z) == ( 8 ) log I r
log -
r
is harmonic in C - {z I}. It is left to the reader to check that g(z) < hr(z)
for Z on the boundary of the annulus A == {z: 8 < Iz - Z 11 < r}. By the Maxi-
mum Principle, g(z) < hr(z) for z in A; in particular, h r (z2) > g(Z2). Letting
r  00 we get
g(Z2) < lim h r (z2) == g(Zl)+E;
roo
since € was arbitrary, g(Z2) < g(z 1) and g must be a constant function.
When do Green's Functions exist?
5.2 Theorem. If G is a bounded Dirichlet Region then for each a in G there is
a Green's Function on G with singularity at a.
Proof. Define f: oG  IR by fez) == log .Iz-al, and let u:G-  IR be the
unique continuous function which is harmonic on G and such that u(z) == fez)
for z in oG. Then ga(z) == u(z) -log Iz - al is easily seen to be the Green's
Function. II
This section will close with one last result which says that Green's
Functions are conformal invariants.
5.3 Theorem. Let G and Q be regions such that there is a one-one analytic
function f of G onto Q; let a E G and (X == f(a). If ga and Yex are the Green's
Functions for G and Q with singularities a and (X respectively, then
ga(z) == y(f(z)).
Proof. Let cp: G  IR be defined by cp == Yex 0 f. To show that cp == ga it is
sufficient to show that cp has the properties of the Green's Function with
singularity at z == a. Clearly cp is harmonic in G - {a}. If w E 000 G then
lim cp(z) == 0 will follow if it can be shown that lim cp(zn) == 0 for any sequence
zw
{zn} in G with Zn  w. But {f(zn)} is a sequence in Q and so there is a sub-
sequence {znk} such thatf(znk)  w in n- (closure in Coo). So Yex(f(znk))  o.
Since this happens for any convergent subsequence of {f(zn)} it follows that
lim cp(zn) == lim Yex(f(zn)) == O. Hence lim cp(z) == 0 for every w in 0ooG.
zw
Finally, taking the power series expansion of f about z == a,
f( z) == ct + A 1 (z - a) + A 2 (z - a)2 +. . .;
or
f( z) - ct == (z - a)[ Al + A 2 (z - a) +. · .].
Hence
5.4
Ioglf(z)-ctl == loglz-al +h(z),

Green's Function 277
where h(z) == log IAt +A 2 (z-a)+...1 is harmonic near z == a since Al 1= o.
Suppose that Yclw) == (w)-loglw-o:l where  is a harmonic function
on f2. Using (5.4)
cp(z) == (f(z)) -log/fez) - 0:1
== [(r(z)) - h(z)] -loglz - al.
Since  0 1- h is harmonic near z == a, cp(z) + log Iz - al is harmonic near
z == a. II
Exercises
I. (a) Let G be a simply connected region, let a E G, and let I: G  D == {z:
Izi < I} be a one-one analytic function such that I(G) == D and I(a) == o.
Show that the Green's Function on G with singularity at a is ga(z) == -log
If(z)/.
(b) Find the Green's Functions for each of the following regions:
(i) G == C - (00, 0]; (ii) G == {z :Re z > O}; (iii) G == {z: 0 < 1m z < 27T}.
2. Let ga be the Green's Function on a region G with singularity at z == a.
Prove that if  is a positive superharmonic function on G - {a} with lim inf
z-+a
[(z) + log Iz- alJ > - 00, then ga(z) < (z) for z 1= a.
3. This exercise gives a proof of the Riemann Mapping Theorem where it is
assumed that if G is a simply connected region, G 1= C, then: (i) Coo - G is
connected, (ii) every harmonic function on G has a harmonic conjugate,
(iii) if a €f G then a branch of log(z - a) can be defined.
(a) Let G be a bounded simply connected region and let a E G; prove that
there is a Green's Function ga on G with singularity at a. Let u(z) == ga(z)
+ loglz- al and let v be the harmonic conjugate of u. If cp == u+ iv let
fez) == eilX(z-a)e-CP(z) for a real number 0:. (So lis analytic in G.) Prove that
If(z) 1 == exp ( - ga(z)) and that lim If(z) 1 == 1 for each w in 8G (Compare this
z-+w
with Exercise 1). Prove that for 0 < r < 1, C r == {z:/f(z)1 == r} consists of
a finite number of simple closed curves in G (see Exercise VI.l.3). Let G r
be a component of {z:/f(z)1 < r} and apply Rouche's Theorem to get that
fez) = 0 and fez) - W o == 0, IWol < r, have the same number of solutions in
Gr. Prove that I is one-one on Gr- From here conclude that I( G) = D == {z:
Izl < I} and f'(a) > 0, for a suitable choice of 0:.
(b) Let G be a simply connected region with G 1= C, but assume that G
is unbounded and 0, 00 E 0ooG. Let t be a branch of log z on G, a E G, and
ex = tea). Show that t is one-one on G and fez) 1= 0: + 27Ti for any z in G.
Prove that cp(z) == [t(Z)-0:-27Ti]-1 is a conformal map of G onto a bounded
simply connected region in the plane. (Show that t omits all values in a
neighborhood of 0: + 27Ti.)
(c) Combine parts (a) and (b) to prove the Riemann Mapping Theorem.
4. (a) Let G be a region such that oG = y is a simple continuously differen-

278 Harmonic Functions
tiable closed curve. If f:8G  [R is continuous and g(z, a) = ga(z) is the
Green's Function on G with singularity at a, show that
5.5
f (3
h(a) = fez)  (z, a) ds
on
y
is a formula for the solution of the Dirichlet Problem with boundary values f;
where og is the derivative of g in the direction of the outward normal to y and
on
ds indicates that the integral is with respect to arc length. (Note: these con-
cepts are not discussed in this book but the formula is sufficiently interesting
so as to merit presentation.) (Hint: Apply Green's formula
ff[UV-VU]dXdY = f[ U :: -v :: ] ds
o 00
with Q = G- {z: Iz-al < 8}, 8 < dCa, {y}), u = h, v = ga(z) = g(z, a).)
(b) Show that if G = {z: Izl < I} then (5.5) reduces to equation (2.5).

Chapter XI
Entire Functions
To begin this chapter, let us recall the Weierstrass Factorization Theorem
for entire functions (VII. 5.14). Let f be an entire function with a zero of
n1ultiplicity m > 0 at z == 0; let {an} the zeros off, an "# 0, arranged so that
a zero of multiplicity k is repeated in this sequence k times. Also assume
that la 11 < la 2 1 < . . . . If {Pn} is a sequence of integers such that
0.1
 ( r ) pn + 1
L- <00
n=l lanl
for every r > 0 then
0.2
00
P(z) == IT Epn(z/a n )
n=l
converges uniformly on compact subsets of the plane, where
0.3
( Z 2 zP )
Ep(z) = (1 - Z) exp z + 2 + · · · + p
for p > 1 and
Eo(z) == l-z
Consequently
0.4
fez) == zm eg(z) P(z)
where g is an entire function. An interesting line of investigation begins if we
ask the questions: What properties off can be deduced if g and P are assumed
to have certain "nice" properties? Can restrictions be imposed on f which
will imply that g and P have particular properties? The plan that will be
adopted in answering these questions is to assume that g and P have certain
characteristics, deduce the implied properties off, and then try to prove the
converse of this implication.
How to begin? Clearly the first restriction on g in thIS program is to
suppose that it is a polynomial. It is equally clear that such an assumption
must impose a growth condition on eg(z). A convenient assumption on P is
that all the integers Pn are equal. From equation (0.1), we see that this is to
assume that there is an integer P > 1 such that
00
L lanl- P < 00;
n=l
that is, it is an assumption on the growth rate of the zeros of f In the first
279

280 Entire Functions
section of this chapter Jensen's Formula is deduced. Jensen's Formula says
that there is a relation between the growth rate of the zeros of I and the
growth of M(r) = sup {1/(re iO )/: 0 < e < 27T} as r increases. In succeeding
sections we study the growth of the zeros ofl and the growth of M (r). Finally,
the chapter culminates in the beautiful factorization theorem of Hadamard
which shows an intimate relation between the growth rate of M(r) and these
assumptions on g and P.
1. Jensen's Formula
If I is analytic in an open set containing B(O; r) and I doesn't vanish in
B(O; r) then log III is harmonic there. Hence it has the Mean Value Property
(X. 1.4); that is .
1.1
21t
log 1/(0)1 =  f log I/(re iO ) I dB.
27T
o
Suppose I has exactly one zero a = rei on the circle Izl = r. If g(z) = I(z)
(z - a) -1 then (1.1) can be applied to g to obtain
21t
log Ig(O)1 =  f [log I/(reiO)/-log /re iO - rei1J dO
27T
o
Since log Ig(O) I = log I/(O)I-Iog r, it will follow that (1.1) remains valid
where f has a single zero on /zl = r, if it can be shown that
21t
1 f '0'
27T log /re l - rel/ dB = log r;
o
alternately, if it can be shown that
21t
flog II-e i8 1 d8 = O.
o
But this follows from the fact that
2n
flog (sin 2 28) d8 = - 41r log 2
o
(Exercise V. 2.2(h)). So (1.1) remains valid if fhas a single zero on /zl = r;
by induction, (1.1) is valid as long as/has no zeros in B(O; r).
The next step is to examine what happens if I has zeros inside B(O; r).
In this case, log I/(z) I is no longer harmonic so that the MVP is not present.
1.2 Jensen's Formula. Let f be an analytic function on a region containing

Jensen's Formula 281
B(O; r) and suppose that a l' . . . , an are the zeros of f in B(O; r) repeated
according to multiplicity. if 1(0) # 0 then
21t
log 1/(0)1 = -  log C;kl ) + L flOg I I(reiO) 1 dO.
o
Proof If Ibl < 1 then the map (z-b) (l-bz)-l takes the disk B(O; 1) onto
itself and maps the boundary onto itself. Hence
r 2 (z - ak)
2 -
r - akz
maps B(O; r) onto itself and takes the boundary to the boundary. Therefore
n 2 -
F(z) = I(z) T1 r -ak z
k= 1 r(z-ak)
is analytic in an open set containing B(O; r), has no zeros in B(O; r), and
I F(z) I == I/(z) I for Izi == r. So (1.1) applies to F to give
21t
log 1£(0)1 =  f log If(re i8 ) I dB.
21T
o
However
F(O) = 1(0) Ii ( -  )
k = 1 ak
so that Jensen's Formula results. II
If the same methods are used but the MVP is replaced by Corollary X. 2.9,
log If(z) I can be found for z # ak, 1 < k < n.
1.3 Poisson-Jensen Formula. Let f be analytic in a region which contains
B(O; r) and let aI' . . . , an be the zeros of j' in B(O; r) repeated according to
multiplicity. If Izi < rand fez) # 0 then
21t
log I/(z) 1 = -  log r 2 -iikz +  f Re ( re:+z ) log If(re i8 ) I dB.
6 r(z-a k ) 21T reI -z
o
Exercises
I. In the hypothesis of Jensen's Formula, do not suppose that f(O) =1= o.
Show that if f has a zero at z == 0 of multiplicity m then
21t
log I:O) + m log r = - I log ( - I  I) +  f log If(re i8 ) I dO.
k = 1 ak 27T
o

282 Entire Functions
2. Let f be an entire function, M(r) = sup {If(reiO)I: 0 < e < 27T}, n(r) =
the number of zeros of lin B(O; r) counted according to multiplicity. Suppose
that 1(0) = 1 and show that n(r) log 2 < log M (2r).
3. In Jensen's Formula do not suppose thatl is analytic in a region containing
B(O; r) but only that I is meromorphic with no pole at z = O. Evaluate
27t
_1_ f log I f(reiO) I de.
27T
o
4. (a) Using the notation of Exercise 2, prove that
r
f n ( )
net) r
t dt = 6 log IOkl
o
where a1, . . . , an are the zeros of f in B(O; r).
(b) Let I be meromorphic without a pole at z = 0 and let n(r) be the
number of zeros of fin B(O; r) minus the number of poles (each counted
according to multiplicity). Evaluate
r
f nt) dt.
o
5. Let D = B(O; I) and suppose thatf: D  C is an analytic function which
is bounded.
(a) If {an} are the non-zero zeros of fin D counted according to multi-
plicity, prove that L(I-lanD < 00. (Hint: Use Proposition VII. 5.4).
(b) If 1 has a zero at z = 0 of multiplicity m > 0, prove that I(z) =
zm B(z) exp ( - g(z)) where B is a Blaschke Product (Exercise VII. 5.4) and g
is an analytic function on D with Re g (z) > -log M (M = sup {If(z)l:
Izi < I}).
2. The genus and order of an entire function
2.1 Definition. Let f be an entire function with zeros {a l , a 2 , . . .}, repeated
according to multiplicity and arranged such that lall < lazl < . . . . Then
1 is of finite rank if there is an integer p such that
2.2
00
L /a n l-(p+1) < 00.
n=1
If p is the smallest integer such that this occurs, thenl is said to be 0.( rank p;
a function with only a finite number of zeros has rank O. A function is of
infinite rank if it is not of finite rank.

The genus and order of an entire function 283
From equation (0.1) it is seen that iff has finite rankp then the canonical
product P in (0.4) can be taken to be
2.3
00
P(z) = n Ep(z/a n ).
n=1
Notice that iff is of finite rank and p is any integer larger than the rank
of f, then (2.2) remains valid. So there is a second canonical product (2.3),
and this shows that the factorization (0.4) off is not unique. However, if the
product P is defined by (2.3) where p is the rank of f then the factorization
(0.4) is unique except that g may be replaced by g + 27Tmi for any integer m.
2.4 Definition. Letfbe an entire function of rankp with zeros {aI' a2, . . .}.
Then the product defined in (2.3) is said to be in standard form for f If f is
understood then it will be said to be in standard form.
2.5 Definition. An entire function f has .finite genus if f has finite rank and if
fez) = zm eg(z) P(z),
where P is in standard form, and g is a polynomial. If p is the rank of f
and q is the degree of the polynomial g, then [..t = max (p, q) is called the
genus off
Notice that the genus of f is a well defined integer because once P is in
standard form, then g is uniquely determined up to adding a multiple of 27Ti.
In particular, the degree of g is determined.
2.6 Theorem. Let f be an entire function of genus [..t. For each positive number
a there is a number ro such that for Izl > ro
If(z) 1 < exp (alzI JL + 1)
Proof Since f is an entire function of genus [..t
00
fez) = zm eg(z) n EJL(z/a n ),
n=1
where g is a polynomial of degree < [..t. Notice that if Izi < 1- then
2.7 log IEJL(z) I = Re {log (1- z) + z+. . . + zJL/ [..t}
= Re {- fL 1 zlt+1 - fL2 zlt+ 2 -. · .}
< I z IJL+1 {  + J:L +.. . }
[..t + 1 [..t + 2
< IzIJL+ 1(1 +-!-+(-!-)2 +. . .)
= 2 IzIJL+ 1
Also
so that
IEJL(Z) I < (1 + Izl) exp (Izl +. . . + IzIJL/ fL ),
log IEJL(z)/ < log (1 + Izl)+ Iz/ +. . .+ IzIJL/ fL .

284
Hence,
Entire Functions
r log IE,.(z)/ - 0
z IzIJL+ 1 -
So if A > 0 then there is a number R > 0 such that
2.8 log I EJL(z) I < AlzjJL+ 1, Izi > R.
But on {z: t < Izi < R} the function \z\-(JL+ 1) log I EJL(z) \ is continuous
except at z = + 1, where it tecds to - 00. Hence there is a constant B > 0
such that
2.9 log IEJL(z) I < BlzIJL+ 1, 1- < Izi < R.
Combining (2.7), (2.8), and (2.9) gives that
2.10 log IEJL(z) I < M IzIJL+ 1
for all z in C, where M = max {2, A, B}.
Since ]anl-(JL+ 1) < 00, an integer N can be chosen so that
00
2: la n l-(/l+1) < 4 '
n=N+ 1
But, using (2.10),
2.11
00
2:
n=N+l
 Z JL+ 1 ex
log IEJL(z/a n ) I < M L - < - IzIJL+ 1.
n = N + 1 an 4
Now notice that in the derivation of (2.8), A could be chosen as small as
desired by taking R sufficiently large. So choose , 1 > 0 such that
ex
log IE/l(z) I < 4N Izl/l+1, for Izi > '1'
If r 2 = max {la 1 1 '1' la 2 1 rJ, · · · , laNI 'I} then
N
2: log !E/l(z/an)1 <  I z l/l+ 1 for Izi > '2'
n=1
Combining this with (2.11) gives that
2.12
00
log I P(z) I = 2: log I E/l(z/a n ) 1 <  /zl/l+ 1
n=l
for Izi > '2. Since g is a polynomial of degree < fL,
1 . m log Izl + Ig(z) I _
1m I I JL+ 1 - o.
z 00 Z
So there is an'3 > 0 such that m log Izi + Ig(z)1 < 1- ex IzIJL+ 1. Together with
(2.12) this yields
log I/(z) 1 < ex IzIJL+ 1

The genus and order of an entire function 285
for Izi > ro == max {r 2 , r 3 }. By taking the exponential of both sides, the
desired inequality is obtained. II
r
The preceding theorem says that by restricting the rate of growth of the
zeros of the entire function I(z) == zm exp g(z)P(z) and by requiring that g
be a pofynomial, then the growth of M(r) == max {1/(reio)l: 0 < 8 < 27T} is
dominated by exp (exlzIJL+ 1) for some fL and any ex > o.
We wish to prove the converse to this result.
2.13 Definition. An entire function I is of finite order if there is a positive
constant a and an ro > 0 such that I/(z)1 < exp (Izla) for Izi > roo If/is not
of finite order then 1 is of infinite order.
If 1 is of finite order then the number A == inf {a: I/(z) 1 < exp (Izla) for
Izi sufficiently large} is called the order 01 f
Notice that if I/(z) 1 < exp (Izla) for Izi > ra > 1 and b > a then I/(z) 1 <
exp (izi b). The next proposition is an immediate consequence of this obser-
vation.
2.14 Proposition. Let j' be an entire lunction 01 finite order A. II € > 0 then
I/(z)1 < exp (lzl).+£) lor all z with Izi sufficiently large; and a z can be found,
with Izi as large as dsired, such that I/(z) 1 > exp (lzl).-£).
Although the definition of order seems a priori weaker than the con-
clusion of Theorem 2.6, they are, in fact, equivalent. The reader is asked to
show this for himself in Exercise 3.
So it is desirable to know if every function of finite order has finite genus
(a converse of Theorem 2.6). That this is in fact the case is a result of
Hadamard's Factorization Theorem, proved in the next section.
The proof of the next proposition is left to the reader.
2.15 Proposition. Let f be an entire lunction of order A and let M(r) == max
{1/(z)\: Izi == r}; then
. log log M (r)
A == hm sup I
r-+ 00 og r
Consider the function f(z) == exp (e Z ); then If(z) 1 == exp (Re e Z ) == exp
(e" cos 8) if z == re iO . Hence M(r) == exp (e r ) and
log log M(r)
log r
r
== log r '
thus, I is of infinite order. On the other hand if g(z) == exp (zn), n > 1, then
Ig(z)1 == exp (Re zn) == exp (r n cos m8). Hence M(r) == exp (r n ) and so
log log M(r)
log r
== n;
thus g is of order n. For further examples see Exercise 7.
Using this terminology, Theorem 2.6 can be rephrased as follows
2.16 Corollary. Iffis an entire function offinite genus JL thenfis offinite order
A < fL + 1.

286
Exercises
Entire Functions
1. Let I(z) = Icnz n be an entire function of finite genus fL; prove that
lim c n (n!)I / (JL+l) = o.
noo
(Hint: Use Cauchy's Estimate.)
2. Let 11 and 12 be entire functions of finite orders Al and A 2 respectively.
Show that I = 11 +12 has finite order A and A < max (AI' A 2 ). Show that
A = max (AI' A 2 ) if Al i= A 2 and give an example which shows that A < max
(AI' A 2 ) with 1 i= o.
3. Suppose I is an entire function and A, B, a are positive constants such
that there is a r 0 with I/(z) 1 < exp (A Izi a + B) for IzJ > r o. Show that 1 is of
fini te order < a.
4. Prove that if I is an entire function of order A then I' also has order A.
5. Let I(z) = Lcnz n be an entire function and define the number a by
-lo g I c I
I . . f n
a = 1m In
noo nlogn
(a) Show that if I has finite order then a > o. (Hint: If the order of 1 is "
and (3 > A show that ICnl < r- n exp (r P ) for sufficiently large r, and find the
maximum value of this expression.)
(b) Suppose that 0 < ex < 00 and show that for any € > 0, € < a, there
is an integer p such that Ic n l 1/n < n-(IX-E) for n > p. Conclude that for
Izi = r > 1 there is a constant A such that
If(z) 1 < Ar P + n ( n:-' Y
(c) Let p be as in part (b) and let N be the largest integer < (2r)I / (IX-E).
Take r sufficiently large so that N > p and show that
 ( :_E ) n < 1 and i ( n:.:: . ) n < B exp ((2r)1/(a-.) log r)
m=N+ 1 n n=p+ 1
where B is a constant which does not depend on r.
(d) Use parts (b) and (c) to show that if 0 < a < 00 then 1 has finite
order A and A < a-I.
(e) Prove that 1 is of finite order iff a > 0, and if I has order A then
A = a-I.
6. Find the order of each of the following functions: (a) sin z ; (b) cos z;
00
(c) cosh 7 (d) L n-anzn where a > O. (Hint: For part (d) use Exercise 6.)
n = 1
7. Letl 1 andf2 be entire functions of finite order AI' A 2 ; show thatl = 11/2
has finite order A < max (A l' A 2 ).
8. Let {an} be a sequence of non-zero complex numbers. Let p = inf {a:
L lanl- a < oo}; the number p is called the exponent of convergence of {an}.

Hadamard Factorization Theorem 287
(a) If I is an entire function of rank p then the exponent of convergence
p of the non-zero zeros of I satisfies: p < p < p + 1.
(b) If pf = the exponent of convergence of {an} then for every E > 0,
L lanl-(P+l) < 00 and L lanl-(P-l) = 00.
(c) Let I be an entire function of order A and let {a l' a2, . . .} be the non-
zero zeros of I counted according to multiplicity. If p is the exponent of
convergence of {an} prove that p < A. (Hint: See the proof of (3.5) in the
next section.)
00
(d) Let P(z) = TI Ep(z/a:J) be a canonical product of rank p, and let p
n = 1
be the exponent of convergence of {alJ}. Prove that the order of P is p.
(Hint: If A is the order of P, p < A; assume that la 11 < la21 < . . . and fix z,
Izi > 1. Choose N such that lanl < 2 Izi if n < Nand lanl > 2 Izi if n > N
+ 1. Treating the cases p < p + 1 and p = p + 1 separately, use (2.7) to show
that for some E > o.
n= 1 log Ep ( :J < A IzIP+E.
Prove that for Izi > -!-, log I Ep(z)/ < B IzlP where B is a constant independent
of z. Use this to prove that
 log Ep (  ) < C IZ/P+E
for some constant C independent of z.)
9. Find the order of the following entire functions:
00
(a) I(z) = TI (1- a"z), 0 < lal < 1
n = 1
(b) I(z) = D ( 1 - :J
(c) I(z) = [r(z)]-I.
3. Hadamard Factorization Theorem
I n this section the converse of Corollary 2.16 is proved; that is each
function of finite order has finite genus. Since a function of finite genus can
be factored in a particularly pleasing way this gives a factorization theorem.
3.1 Lemma. Let I be a non-constant entire lunction 01 order A vith 1(0) = 1,
and let {at, a 2 , . . .} be the zeros 01 I counted according to multiplicity and
arranged so that latl < la 2 1 < . . . . II an integer p > A-I then
d P [ 1'(z) J 00 1
dz P I(z) = -p! ;S (an-z)p+l
for z "# at, a2, . . . .

288 Entire Functions
Proof Let n = n(r) = the number of zeros of I in B(O; r); according to the
Poisson-Jensen formula
27t
log Ij(z) I = -  log r;-iikz + 2 1 f Re ( re::+z ) log I/(re i8 )1 dB
k = 1 r z - ak) 7T re - z
o
for Izl < r. Using Exercise 1 and Leibniz's rule for differentiating under an
integral sign this gives
f'(z) * ( ) -1  - ( 2 - ) -1
j(z) = 6 Z-Ok + 6 Ok r -Ok Z
27t
+  f 2rei8(rei8 - z) - 2 log I/(re i8 )/ dB
27T
o
for Izi < rand z =I aI' . . . , an. Differentiating p times yields:
3.2
d P [ /'(Z) ] _ _ ,* ( _ ) -p-l + ,* -P+1 ( 2_ - ) -P-1
d P f - p. L a k z p. L ak r akz
z (z) k=1 k=1
27t
+(p+ I)!  f 2rei8(rei8 -Z)-p-2 log I/(re i8 )1 dB.
27T
o
Now as r -+ 00, n(r) - 00 so that the result will follow if it can be shown that
the last two summands in (3.2) tend to zero as r -)- 00.
To see that the second sum converges to zero let r > 21zl; then lakl < r
gives Ir2-akzl > -!-r 2 so that (/akl Ir2-akzl-1)P+1 < (2Ir)P+1. Hence the
second summand is dominated by n(r) (21 r)P+ 1. But it is an easy consequence
of Jensen's Formula (see Exercise 1.2) that log 2 n(r) < log M(r). Sjnce I is
of order '\, for any e > 0 and r sufficiently large
log 2 n(r) r-(P+ 1) < log [M(r)] r-(P+ 1)
< r O '+£) -(p+ 1)
But p+l > ,\ so that e may be chosen with ('\+e)-(p+l) < O. Hence
n(r) (2Ir)P+ 1 -+ 0 as r -+ 00; that is, the second summand in (3.2) converges
to zero.
To show that the integral in (3.2) converges to zero notice that
27t
f rei8(rei8_z)-r2 de = 0
o
since this integral is a multi pIe of the integral of (w - z) - P - 2 around the
circle Iwl = r and this function has a primitive. So the value of the Integral
in (3.2) remains unchanged if we substitute log Ifl-Iog M(r) for log III.

Hadamard Factorization Theorem 289
So for 21z1 < r, the absolute value of the integral in (3.2) is dominated by
27t
3.3 (p + I)! 2 P + 3 r -(p+ 1)  f [log M(r) -log I/(re i8 )/] dB.
27T
o
But according to Jensen's Formula,
21t
L flOg If(re i8 )/ dO > 0
o
since 1(0) = 1. Also log M (r) < rA. + £ for sufficiently large r so that (3.3) is
dominated by
(p + I)! 2 P + 3 r A.+£-(P+ 1)
As before, E can be chosen so that rA.+£-(P+ 1)  0 as r  00. II
Note that the preceding lemma implicitly assumes that I has infinitely
many zeros. However, if I has only a finite number of zeros then the sum in
Lemma 3.1 becomes a finite sum and the lemma remains valid.
3.4 Hadamard's Factorization Theorem. If I is an entire lunction 01 finite
order ,\ then I has finite genus JL < '\.
Proof Let p be the largest integer less than or equal to '\; so p < ,\ < p + 1.
The first step in the proof is to show that I has finite rank and that the rank
is not larger than p. So let {a l , a 2 , . . .} be the zeros of I counted according
to multiplicity and arranged such that la 1 1 < la21 < . . . . It must be shown
that
3.5
00
L lanl-(P+ 1) < 00.
n=l
Th.ere is no loss in generality in assuming that 1(0) = 1. Indeed, if I has
a zero at the origin of multiplicity m and M(r) = max {1/(z)/: Izi = r} then
for any E > 0 and Izi = r
log I/(z)z-ml < log [M(r)r- m )
< rA.+£ -m log r
< rA. + 2£
if r is sufficiently large. So I(z)z-m is an entire function of order ,\ with no
zero at the origin. Since multiplication by a scalar does not affect the order,
the assumption that 1(0) = 1 is justified.
Let n(r) = the number of zeros of f in B(D; r). It follows (Exercise 1.2)
that [log 2] n(r) < log M(r). Since I has order '\, log M(r) < rA.+-!-£ for any
E > D so that lim n(r)r-(A.+£) = O. Hence n(r) < rA.+£ for sufficiently large r.
r-+ 00
Since lall < la 2 1 < . . ., k < n(lakl) < /aklA.+£ for all k larger than some
integer k o. Hence,
lakl-(P+ 1) < k-(P+ 1/)..+£)

290 Entire Functions
for k > kat So if E is chosen with A + E < P + 1 (recall that A < P + 1) then
I lakl-(P+ 1) is dominated by a convergent series; (3.5) now follows.
Let fez) = P(z) exp (g(z)) where P is a canonical product in standard
form. Hence for z =I a k
f'(z) , P'(z)
fez) = g (z) + P(z)
Using Lemma 3.1 gives that
(j) d P [ P'(Z) ]
-pI "" (a n -z)-(P+1) = g(p+l)(Z) + - -
6t dz P P(z)
However it is easy to show that
d P [ P'(Z) ] = _p!  (an-z)-(p+l)
dz P P(z) 6t
for z =1= ab a2, . . . . Hence g(P+ 1) = 0 and g must be a polynomial of degree
< po So the genus off < p < A. II
As an application of Hadamard's Theorem a special case of Picard's
Theorem can be proved. This theorem is proved in full generality in the next
chapter.
3.6 Theorem. Let f be an entire function of finite order, then f assumes each
complex number with one possible exception.
Proof. Suppose there are complex numbers a and {3, a =1= (3, such thatf(z) =I a
andf(z) =I (3 for all z in C. So f - a is an 'entire function that never vanishes;
hence there is an entire function g such that fez) - a = exp g(z). Since f has
finite order, so doesf-a; by Hadamard's Theorem g must be a polynomial.
But exp g(z) never assumes the value (3 - a and this means that g(.z) never
assumes the value log ({3 - a), a contradiction to the Fundamental Theorem
of Algebra. II
One might ask how many times f assumes a given value a. If g is a
polynomial of degree n > 1, then every a is assumed exactly n times. How-
ever f = e 9 assumes each value (with the exception of zero) an infinite number
times. Since the order of e 9 is n (see Exercise 2.5) the next result lends some
confusion to this problem; the confusion will be alleviated in the next chapter.
3.7 Theorem. Let f be an entire function of finite order A where A is not an
integer; then f has infinitely many zeros.
Proof. Suppose fhas only a finite number of zeros {a 1 , a2, . . . , an} counted
according to multiplicity. Then fez) = e 9 (z)(z - at) . . . (z - an) for an entire
function g. By Hadamard's Theorem, g is a polynomial of degree < A. But
it is easy to see that f and e 9 have the same order. Since the order of e 9 is the
degree of g, A must be an integer. This completes the proof. II

Hadamard Factorization Theorem 291
3.8 Corollary. Iff is an entire function of order ,\ and ,\ is not an integer then I
assumes each complex value an infinite number of times.
Proof If a Ef(C), apply the preceding theorem to I-a. II
Exercises
I. Let f be analytic in a region G and suppose that I is not identically zero.
Let Go = G- {z: fez) = O} and define h: Go   by h(z) = log /I(z)/.
ah . oh f'
Show that - - 1- = - on Go.
ox oy f
2. Refer to Exercise 2.8 and show that if '\1 =1= '\2 then ,\ = max ('\1' '\2).
3. (a) Let f and g be entire functions of finite order ,\ and suppose that
f(a n ) = g(a n ) for a sequence {an} such that L lanl-().+ 1) = 00. Show that
1= g.
(b) Use Exercise 2.9 to show that iff, g and {an} are as in part (a) with
L lanl-().+£) = 00 for some € > 0 then 1= g.
(c) Find all entire functions I of finite order such that f(log n) = n.
(d) Give an example of an entire function with zeros {log 2, log 3, . . .}

Chapter XII
The Range of an Analytic Function
In this chapter the range of an analytic function is investigated. A generic
problem of this type is the following: Let ff be a family of analytic functions
on a region G which satisfy some property P. What can be said about f( G)
for eachfin :F? Are the setsf(G) uniformly big in some sense? Does there
exist a ball B(a; r) such thatf(G) ::) B(a; r) for each fin ff? Needless to say,
the answers to such questions depend on the property P that is used to
define ff.
In fact there are a few theorems of this type that have already been
encountered. For example, the Casorati-Weierstrass Theorem says that if
G = {z: 0 < Iz - al < r} and ff is the set of analytic functions on G with
an essential singularity at z = a, then for each S, 0 < S < r, and each f in
:F f(ann (a; 0; S» is dense in C (V. 1.21). Recall (Exercise V. 1.13) that iff is
entire and f(l/z) has a pole at z = 0, then f is a polynomial. So iff is not a
polynomial thenf(l/z) has an essential singularity at z = O. So as a corollary
to the Casorati- Weierstrass Theorem, f(C) is dense in C for each entire
function (if f is a polynomial then f(C) = C).
This chapter will culminate in the Great Picard Theorem that sub-
stantially improves the Casorati- Weierstrass Theorem. Indeed, it states that
if f has an essential singularity at z = a then f(ann (a; 0; S» is equal to the
entire plane with possibly one point deleted. Moreover, f assumes each of
the values in this punctured disk an infinite number of times. (See Exercise
V. 1.10.) As above, this yields that f(C) is also the whole plane, with one
possible point deleted, whenever f is an entire function. This is known as the
Little Picard Theorem. However, this latter result will be obtained inde-
pendently.
Before these theorems of Picard are proved, it is necessary to obtain
further results about the range of an analytic function-which results are of
interest in themselves.
1. Bloch's Theorem
To fit the result referred to in the title of this section into the general
questions posed in the introduction, let D = B(O; 1) and let :F be the family
of all functions f analytic on a region containing D - such that f(O) = 0
andf'(O) = 1. How "big" canj'(D) be? Put another way: becausef'(O) =
1 '1= 0, f is not constant and so feD) is open. That is, feD) must contain a
disk of positive radius. As a consequence of Bloch's Theorem, there is a
positive constant B such thatf(G) contains a disk of radius Bfor each/in:Fo
292

Bloch's Theorem 293
1.1 Lemma. Let f be analytic in D = {z: Izi < I} and suppose that f(O) = 0,
f'(O) == 1, and If(z) 1 < M for all z in D. Then M > 1 andf(D)  B(O; 116M).
Proof Let 0 < r < 1 and fez) = z + a2z2 +. . . ; according to Cauchy's
Estimate lanl < Mlr n for n > 1. So 1 = la 1 1 < M. If Izi = (4M)-1 then
00
If(z) 1 > Izi - L lanznl
n=2
00
> (4M)-1 - L M(4M)-n
n=2
= (4M)-I_(16M-4)-1
> (6M)-1
since M > 1.
Suppose Iwl < (6M) -1 ; it will be shown that g(z) = fez) - w has a zero.
In fact, for Izi = (4M)-1, If(z)-g(z)1 = Iwl < (6M)-1 < If(z)l. So, by
Rouch6's Theorem, f and g have the same number of zeros in B(O; 114M).
Sincef(O) = 0, g(zo) = 0 for some zo; hencef(D)  B(O; 116M). II
1.2 Lemma. Suppose g is analytic on B(O; R), g(O) = 0, Ig'(O)1 = JL > 0, and
Ig(z) I < M for all z, then
g(B(O; R»  B (0; z )
Proof Let fez) = [Rg' (0)] -1 g(Rz) for Izi < 1; then f is analytic on D =
{z: Izi < 1 },f(O) = O,f'(O) = 1, and If(z) 1 < MIJLR for all z in D. According
to the preceding lemma, feD)  B(O; JLRI6M). If this is translated in terms
of the original function g, the lemma is proved. II
1.3 Lemma. Let f be an analytic function on the disk B(a; r) such that
If'(z) - f'(a)1 < If'(a)1 for all z in B(a; r), z =I a; thenf is one-one.
Proof Suppose Zl and Z2 are points in B(a; r) and Zl =I Z2. If y is the line
segment [z 1, z 2] then an application of the triangle inequality yields
If(Zl)-f(zz)1 = IIf'(z)dzl
y
> IIf'(a) dzl-II [f'(z)-f'(a)] dzl
"I Y
> If'(a)llzl -Zzl - Ilf'(z)-f'(a)lldzl.
y
Using the hypothesis, this gives If(zl)-f(z2)1 > 0 so thatf(zl) =l=f(Z2) and
f is one-one. II
1.4 Bloch's Theorem. Let f be an analytic function on a region containing the
closure of the disk D = {z: Izi < I} and satisfying f(O) = 0, .{"(O) = 1. Then
there is a disk 8 c D on which f is one-one and such that 1(8) contains a disk
of radius 1/72.

294 The Range of an Analytic Function
Proof Let K(r) = max {If'(z)l: Izi = r} and let her) = (1- r)K(r). It is
easy to see that h: [0, 1] -+ !R is continuous, h(O) = 1, h(l) = O. Let ro =
sup {r: her) = I}; then hero) = 1, ro < 1, and her) < 1 if r > ro (Why?).
Let a be chosen with lal = ro and If' (a) I = K(r o ); then
1.5 /f'(a)1 = (l- r O)-I.
Now if Iz-al < t (l- r o) = Po, Izi < ! (1 +ro); since ro < t (1 +ro), the
definition of r 0 gives
1.6 /f'(z)1 < K(t(1 + r 0))
= h(t(1 +ro)) [1-t(1 +ro)]-1
< [1 - t( 1 + r 0)] - 1
= 1/ Po
for /z-al < Po. Combining (1.5) and (1.6) gives
/f'(z) -f'(a) I < If'(z)1 + If'(a)/
< 3/2po.
According to Schwarz's Lemma, this implies that
1f'(z)-j'(a)1 < 3l z -al
2p
for z in B(a; Po). Hence if z E S = B(a; 1-Po),
1f'(z)-f'(a)1 <  = If'(a) I
2po
By Lemma 1.4, f is one-one on S.
I t remains to show that f( S) contains a disk of radius 1/72. For this
define g: B(O; !Po) -+ C by g(z) = f(z+a)-f(a) then g(O) = 0, Ig'(O)1 =
/f'(a)/ = (2po) -1. If z E B(O; !Po) then the line segment y = [a, z + a] lies
in S c B(a; Po). So by (1.6) ·
Ig(z) I = If f'(w) dwl
y
1
< -izi
Po
< !.
Applying Lemma 1.2 gives that
geBCO; !Po))  B(O; a)
where
a=
Gpor(r
60)
1
72

Bloch'8 Theorem
If this is translated into a statement about f, it yields that
295
f(S) ::J B (f(a); 7 ) · .
1.7 Corollary. Let f be an analytic function on a region containing B(O; R);
1
then f(B(O; R)) contains a disk of radius 72 Rlf' (0)1.
Proof Apply Bloch's theorem to the function g(z) == [f(Rz) - f(O)]/Rf' (0)
(the result is trivial if f'(O) == 0, so it may be assumed that f'(O) =I 0). II
1.8 Definition. Let  be the set of all functions f analytic on a region con-
taining the closure of the disk D == {z: Izi < I} and satisfying f(O) == 0,
f'(O) == 1. For each fin  let {j(f) be the supremum of all numbers r such
that there is a disk Sin D on whichfis one-one and such thatf(S) contains
a disk of radius r. ( So f3(f) > 7 ) · Bloch's constant is the number B defined
by
B == inf {{j(f):fE }.
According to Bloch's Theorem, B > . If one considers the function
72
fez) == z then clearly B < 1. However, better estimates than these are
known. In fact, it is known that .43 < B < .47. Although the exact value
of B remains unknown, it has been conjectured that
rG)r C )
B==
(1 +J3)t r G)
A related constant is defined as follows.
1.9 Definition. Let  be as in Definition 1.8. For eachf in :F define A(f) ==
sup {r: feD) contains a disk of radius r}. Landau's constant L is defined by
L == inf {A(f):fE }.
Clearly L > B and it is easy to see that L < 1. Again the exact value of
L is unknown but it can be proved that .50 < L < .56. In particular, L > B.
1.10 Proposition. Iff is analytic on a region containing the closure of the disk
D == {a: Izi < I} and f(O) == 0, f'(O) == 1; then feD) contains a disk of radius
L.
Proof The proof will be accomplished by showing that feD) contains a disk
of radius A = A(f). For each n there is a point CX n inf(D) such that B ( cx n ; A - )
c feD). Now (Xn Ef(D) C f(D-) and this last set is compact. So there is a

296 The Range of an Analytic Function
point a inf(D-) and a subsequence {a nk } such that a nk  a. It is easy to see
that we may assume that a = lim an. If /w-al < A, choose no such that
/w-a/ < A-l/no. There is an integer n 1 > no such that
1
lan-al < A - - - Iw-al
no
for n > n 1 . Hence
Iw-anl < Iw-al + la-ani
1
<A--
no
1
<A--
n
ifn > n 1 . That is wEB(a n ; A-lln) cj(D). Since w was arbitrary it follows
that B(a; A) c j(D). _
1.11 Corollary. Let f be analytic on a region that contains B (0; R); then
f(B(O;R)) contains a disk of radius Rlf'(O)IL.
Exercises
1. Examine the proof of Bloch's Theorem to prove that L > 1/24.
2. Suppose that in the statement of Bloch's Theorem it is only assumed that
j is analytic on D. What conclusion can be drawn? (Hint: Consider the
functionsh(z) = s-lf(sz), 0 < s < 1.) Do the same for Proposition 1.10.
2. The Little Picard Theorem
The principal result of this section generalizes Theorem XI. 3.6. However,
before proceeding, a lemma is necessary. ..
2.1 Lemma. Let G be a simply connected region and suppose that f is an
analytic function on G that does not assume the values 0 or 1. Then there is
an analytic function g on G such that
j(z) = -exp (hr cosh [2g(z)])
for z in G.
Proof Since f never vanishes there is a branch t of log j'(z) defined on G;
that is e t = f Let F(z) = (271'i) -1 t(z); if F(a) = n for some integer n then
f(a) = exp (271'in) = 1, which cannot happen. Hence F does not assume any
integer values. Since F cannot assume the values 0 and 1, it is possible to
define
H(z) =  F(z) -  F(z)-l.
Now H(z) # 0 for any z so that it is possible to define a branch of g of
10gH on G. Hence cosh(2g) + 1 = -!(e 29 +e-- 29 )+ 1 = -!(e g +e- 9 )2 =

Schottky's Theorem 297
I
t(H+ I/H)2 = 2F = ---: t. But this gives I = e t = exp [7Ti+7Ti cosh (2g)] =
7TI
-exp [7Ti cosh (2g)]. II
Suppose I and g are as in the lemma, n is a positive integer, and m is any
integer. If there is a point a in G with g(a) = + log (In+ In--i) +-! im7T,
then 2 cosh[2g(a)] = e 2g (a)+e- 2g (a) = eim1t(J n +Jn - I):t2+e-im1t(Jn+
In l):t 2 = (- l)m[(Jn + J n - 1)2 + (In - In- 1)2] = (-I)m[2(2n -I)]; or
cosh [2g(a)] = (-I)m(2n-I). Therefore I(a) = -exp [( -1)m(2n-I)7Ti] and,
since (2n - I) must be odd,/(a) = I. Hence g cannot assume any of the values
{ + log (J+J n-I )+tim7T: n > I, m = 0, + I, . . .}.
These points form the vertices of a grid of rectangles in the plane. The height
of an arbitrary rectangle is
Itim7T-ti(m+ 1)7T1 = t7T < J3.
The width is log ( In+ I +In)-log (In+J n-l ) > O. Now cp(x) = log
(Jx-+ r +Jx')-log (J x +J x- f) is a decreasing function so that the width
of any rectangle < cp(l) = log (I +J2) < log e = 1. So the diagonal of the
rectangle < 2. This gives the following.
2.2 Lemma. Let G, f, and g be as in Lemma 2.1. Then g(G) contains no disk
o.f radius I.
2.3 Little Picard Theorem. If f is an entire function that omits two values
then f is a constant.
Proof If I(z) # a and I(z) # b for all z then (I-a) (b - a) -1 omits the
values 0 and I. So assume that/(z) # 0 and/(z) # I for all z. According to
Lemma 2.2, this gives an entire function g such that g(C) contains no disk
of radius I. Moreover, if I is not a constant function then g is not constant
so there is a point Zo with g'(zo) # O. By considering g(z+zo) if necessary,
it may be supposed that g'(O) # O. But according to Corollary 1.11,
geBCO; R» contains a disk of radius LR/g '(0)1. If R is chosen sufficiently large
this gives that g(C) does contain a disk of radius I-a contradiction. So I
must be constant. II
Exercises
I. Show that if f is a meromorphic function on C such that Coo - f(C) has
at least three points then f is a constant. (Hint: What if 00  f(C)?)
2. For each integer n > I determine all meromorphic functions f and g on
C such that jn + gn = 1.
3. Schottky's Theorem
Let f be a function defined on a simply connected region containing the
disk B(O; I) and suppose that I never assumes the values 0 and I. Let us
examine the proof of Lemma 2.1. If t is any branch of log f let

298
The Range of an Analytic Function
1
F=-t.
21Ti '
B = JF-  F-l,
g = a branch of log H.
There are two places in this scheme wnt:re we are allowed a certain amount
of latitude; namely, in picking the functions t and g which are branches of
log I and log H, respectively. For the proof of Schottky's Theorem below
specify these branches by requiring
3.1 0 < 1m t(O) < 21T,
3.2 0 < 1m g(O) < 21T.
3.3 Schottky's Theorem. For each a and p, U< a < 00 and 0 < {3 < 1, there is
a constant C (a,{3) such th at if f is an analytic function on some simply
connected region containing B (0; 1) that omits the values 0 and 1, and such
that If(O)1 < a; then If(z)1 < C(a,{3) for Izi < {3.
Proof It is only necessary to prove this theorem for 2 < a < 00. The proof
is accomplished by looking at two cases.
Case 1. Suppose -t < 1/(0)1 < a. Recalling the functions F, H, and g in
Lemma 2.1 (and rediscussed at the beginning of this section), (3.1) gives
I
IF(O)/ = 21T Ilogf 1(0)1 + i 1m t(O) 1
I
< -log a+ I;
21T
I
Let CoCa) = -log a+ 1. Also
21T
3.4 IJ F(O) + JF(O)-II < IJ F(O) I + /JF(O)-I/
= exp (t log I/(O)/) + exp (-!- log IF(O) - IIJ
= IO)lt + IF(O)-ll t
< C o (a)1- + [Co(a) + I]t
Let C 1 (a) = C o (a)-1- +[Co(a)+ Il!. Now if IH(O)j > 1 then (3.2) and (3.4) give
Ig(O) I = /logl B(O) 1+ i 1m g(O) I
< log IB(O)I +21T
< log C t (a)+21T.
If I H (0) I < I then in a similar fashion..
Ig(O) I < -log I B(O) I + 21T
= log CHO)I ) + 21T
= log IJ £(0) + J £(0)-11 + 21T
< log C t (a)+21T.

Schottky's Theorem
299
Let C 2 (a) = log C 1 (a)+27T.
If lal < 1 then Corollary 1.11 implies that g(B(a; I-laD) contains a disk
of radius
3.5 L(l-laD Ig'(a)l.
On the other hand, Lemma 2.2 says that geBCO; 1» contains no disk of
radius 1. Hence, the expression (3.5) must be less than 1; that is,
3.6 Ig'(a)1 < [L(l-la/)]-l for lal < 1.
If lal < 1, let y be the line segment [0, a]; then
Ig(a) I < Ig(O) I + Ig(a)- g(O) I
< Cicx)+/I g'(z) dzl
"I
< C 2 (a) + lal max {/g'(z)/: z E [0, a]}
Using (3.6) this gives
lal
Ig(a) I < C 2 (cx) + L(l-laJ)
If C 3 (a, fJ) = C 2 ((X)+fJ[L(1-fJ)]-1 then this gives
Ig(z) I < C 3( (x, fJ)
if Izl < fJ. Consequently if Izi < fJ,
I/(z) I = lexp [7Ti cosh 2g(z)]1
< exp [7Tlcosh 2g(z)/]
< exp [7Te 2Ig (z)l]
< exp [7Te 2C3 (cx,P)];
define C 4 (a, fJ) = exp {7T exp [2C 3 ((X, fJ)]}.
Case 2. Suppose 0 < 1/(0)1 < t. In this case (I-f) satisfies the conditions
of Case 1 so that 11- I(z) I < C 4 (2, fJ) if Izi < fJ. Hence I/(z) I < 1 + C 4 (2, fJ).
If we define
C((X, fJ) = max {C 4 ((X, fJ), 1 + C 4 (2, fJ)},
the theorem is proved. II
3.7 Corollary. Let I be analytic on a simply connected region containing
B(O; R) and suppose that I omits the values 0 and 1. If C( a, fJ) is the constant
obtained in Schottky's Theorem and 1/(0)1 < a then I/(z) I < C((X, fJ) for
Izl < fJR.
Proof Consider the function/(Rz), Izi < 1.11
What Schottky's Theorem (and the Corollary that follows it) says is that
a certain family of functions is uniformly bounded on proper subdisks of
B(O; 1). By Montel's Theorem, it follows that this family is normal. It is
this observation which will be of use in proving the Great Picard Theorem
in the next section.

300
4. The Great Picard Theorem
The Range of an Analytic Function
The main tool used in the proof of Picard's Theorem is the following
result.
4.1 Montel-Caratheodory Theorem. If :F is the family of all analytic
functions on a region G that do not assume the values 0 and 1, then :F is
normal in C ( G, Coo)
Proof Fix a point Zo in G and define the families  and £ by
 == {J'E:F: If(zo)! < I},
£ == {fE:F: If(zo)! > I};
so :F ==  u :R. It will be shown that  is normal in B(G) and that :R is
normal in C(G, Coo) (that 00 is a Jimit of a sequence in £ is easily seen by
considering constant functions). To show that  is normal in B(G), Montel's
Theorem is invoked; that is, it is sufficient to show that  is locally bounded.
If a is any point in G let y be a curve in G from Zo to a; let Do, D 1 , . . . , Dn
be disks in G with centers Zo, ZI, . . . , Zn == a on {y} and such that Zk-l
and Zk are in D k - 1 n Dk for 1 < k < n. Also assume that D; c G for
o < k < n. We now apply Schottky's Theorem to Do. It follows that there
is a constant Co such that !f(z) I < Co for = in Do and f in . (If Do ==
B(z 0; r) and R > r is such that B(z 0; R) c G then, according to Corollary
3.7, If(z) I < C(I, (3) for Z in Do andfin  whenever {1 is chosen with r < {1R).
In particular If(ZI)1 < Co so that Schottky's l"heorem gives that  is
uniformly bounded by a constant CIon D 1. Continuing, we have that  is
uniformly bounded on Dn. Since a was arbitrary, this gives that  is locally
bounded. By Montel's Theorem,  is normal in H(G).
Now consider £ == {f E :F: If(zo)1 > I}. If f E :R then 1/1 is analytic
on G because f never vanishes. Also Ilf never vanishes and never assumes
the value 1; moreover 1(1/1) (zo)1 < 1. Hence £ == {Ilf: fE £} c  and
- .
:R is normal in B(G). So if {h} is a sequence in :R there is a subsequence
{h k } and an analytic function h on G such that {Ilj;,k} converges in H(G)
to h. According to Corollary VII. 2.6 (Corollary to Hurwitz's Theorem),
either h = 0 or h never vanishes. If h = 0 it is easy to see that hk(z)  00
uniformly on compact subsets of G. If h never vanishes then Ilh is analytic
and it follows that fnk(z)  Ilh(z) uniformly on compact subsets of G. II
4.2 Great Picard Theorem. Suppose an analytic function f has an essential
singularity at z == a. Then in each neighborhood of a f assumes each complex
number, with one possible exception, an infinite number of times.
Proof. For the sake of simplicity suppose that f has an essential singularity
at z == o. Suppose that there is an R such that there are two numbers not in
{f(z): 0 < Izi < R}; we will obtain a contradiction. Again, we may suppose
that fez) =1= 0 and fez) =1= 1 for 0 < Izi < R. Let G == B(O; R) - {O} and
define fl1: G  C by In(z) == f(zJn). So each In is analytic and no In assumes
the value U or 1. According to the preceding theorem, {h} is a normal
family in C(G, Coo).

The Great Picard Theorem 301
Let {Ink} be a subsequence of {In} such that Ink -> cp uniformly on {z:
Izi = tR}, where cp is either analytic on G or cp = 00. If cp is analytic, let
M = max {lcp(z)l: Izi = tR}; then If(z/nk) I = Ilnk(z) I < Ilnk(z)-cp(z)1 +
Icp(z) I < 2M for n k sufficiently large and Izj = tR. Thus If(z)1 < 2M for
Izi = R/2nk and for sufficiently large nk. According to the Maximum Modulus
Principle, f is uniformly bounded on concentric annuli about zero. This
gives that f is bounded by 2M on a deleted neighborhood of zero and, so,
z = 0 must be a removable singularity. Therefore cp cannot be analytic and
must be identically infinite.
It is left to the reader to show that if cp = 00 then f must have a pole at
zero.
So at most one complex number is never assumed. If there is a complex
number w which is assumed only a finite number of times then by taking a
sufficiently small disk, we again arrive at a punctured disk in which f fails to
assume two values. II
An alternate phrasing of this theorem is the following.
4.3 Corollary. If f has an isolated singularity at z = a and if there are two
complex numbers that are not assumed infinitely often by f then z = a is either
a pole or a removable singularity.
In the preceding chapter it was shown that an entire function of order
A, where A is not an integer, assumes each value infinitely often (Corollary
XI.3.8). Functions of the form e g , for g a polynomial, assume each value
infinitely often, although there is one excepted value-namely, zero. The
Great Picard Theorem yields a general result along these lines (although
an exceptional value is possible), so that the following result is not
comparable with Corollary XI.3.8).
4.4 Corollary. If f is an entire function that is not a polynomial then f
assumes every complex number, with one exception, an infinite number of
times.
Proof. Consider the function g(z) = f(1 / z). Since f is not a polynomial, g
has an essential singularity at z = 0 (Exercise V.1.13). The result now
follows from the Great Picard Theorem. .
Notice that Corollary 4.4 is an improvement of the Little Picard Theorem.
Exercises
I. Let f be analytic in G = B (0; R) - {O} and discuss all possible values of
the integral
 f f'(z) dz
21Ti fez) - a
y
where y is the circle Izi = r < R and a is any complex number. If it is
assumed that this integral takes on certain values for certain numbers a,
does this imply anything about the nature of the singularity at z = O?
2. Show that if f is a one-one entire function then fez) = az + b for some
constants a and b, a:;60.

Appendix A
Calculus for Complex Valued Functions
on an Interval
In this Appendix we would like to indicate a few results for functions
defined on an interval, but whose values are in C rather than fR. If f: [a, b]
-+ C is a given function then one can easily study its calculus type properties
by considering the real valued functions Re f and 1m f. For example, the
fact that for a complex number z = x+iy
max (lxI, Iyl) < Izi = J x 2 + y2 < 2 max (lxi, Iyl),
easily allows us to show thatfis continuous iff Refand Imfare continuous.
However we sometimes wish to have a property defined and explored directly
in terms of f without resorting to the real and imaginary parts of f. This is
the case with the derivative of f.
A.I Definition. A function f: [a, b] -+ C is differentiable at a point x in (a, b)
if the limit
l' f(x+h)-f(x)
lm h
h-+ 0
exists and is finite. The value of this limit is denoted by f'(x). For the points
x = a or b we modify this definition by taking right or left sided limits. If f
is differentiable at each point of [a, b] then we say that f is a differentiable
function and we obtain a new function f': [a, b] -+ C which is called the
derivative of f.
The next Proposition has a trivial proof which we leave to the reader.
A.2 Proposition. A function f: [a, b] -+ C is differentiable iff' Re f and 1m fare
differentiable. Also, f'(x) = (Re f)'(x) + i(lm f)'(x) for all x in [a, b].
Of course it makes no sense to talk of the derivative of a complex val ued
function being positive; accordingly, the geometrical significance of the
derivative of a real valued function has no analogue for complex valued
functions. However the reader is invited to play a game by assuming that
Re j' and 1m f have positive or negative derivatives, and then interpret these
conditions for f.
One fact remains true for derivatives and this is the consequence of a
vanishing derivative.
A.3 Proposition. If a function f: [a, b] -+ C is differentiable and j"(x) = 0 for
all x then f is a constant.
303

304
Appendix A
Proof. If f'(x) = 0 for all x then (Re f)' (x) = (1m f)' (x) = 0 for all x. It
follows that Re f and 1m f are constant and, hence, so is f.
One important theorem about the derivative of a real valued function
which is not true for complex valued functions is the Mean Value Theorem.
In fact, if f(x) = x 2 + ix 3 it is easy to show that
f(b)-f(a) = .f'(c) (b-a)
for some point c in [a, b] only when a = b.
One of the principal applications of the Mean Value Theorem for
derivatives is the proof of the Chain Rule. In lig1: of the discussion in the
preceding paragraph one might well doubt the validity of the Chain Rule
for complex valued functions. The Chain Rule tells us how to calculate the
derivative of the composition of two differentiable functions; this leads to
two different situations. First suppose that f: [a,b]C is differentiable
and let g: [c,d][a,b] also be differentiable. Then f(g(t))=Ref(g(t))+
ilmf(g(t)); from here the Chain Rule follows by applying the Chain Rule
from Calculus. In the second case the result still holds. Let G be an open
subset of C such thatf([a,b])cG and suppose h:GC is analytic. We
wish to show that hof is differentiable and calculate (hof)'. Since the proof
of this Chain Rule follows the line of argument used to prove the Chain
Rule for the composition of two analytic functions (Proposition 111.2.4) we
will not repeat it here. We summarize this discussion in the following.
A.4 Proposition. Let f: [a, b] --+ C be a differentiable function.
(a) If g: [c, d] --+ [a, b] is differentiable then fog is differentiable and
(f 0 g)'(t) = f'(g(t))g'(t).
(b) If G is an open subset of C containing f([a, b]) and h: G --+ C is an
analytic function then h 0 f is differentiable and (h 0 f)'(x) = h'(f(x))f'(x).
To discuss integral calculus for complex valued functions we adopt a
somewhat different approach. We define the integral in terms of the real and
imaginary parts of the function.
A.5 Definition. Iff: [a, b] --+ C is a continuous function, we define the integral
ft
of f over [a, b] by
b b b
f f(x)dx = f Ref(x)dx+i f lmf(x)dx.
a 0 0
If the reader wishes to see a direct development of the integral he need
only work through Section IV. 2 of the text with yet) = t for all t. However,
this hardly seems worthwhile.
Besides the additivity of the integral the only result which interests us is
the Fundamental Theorem of Calculus.
Recall that if F: [a, b] --+ C is a function and f = F' then F is called a
primitive off.

Appendix A 305
A.6 Fundamental Theorem of Calculus. A continuous function f: [a, b]  C
has a primitive and any t}VO primitives differ by a constant. If F is any primitive
of f then
b
J f(x)dx = F(b)-F(a)
o
Proof If g and h are primitives of Refand Imfthen F = g+ih is a primitive
of f The result now easily follows.

Appendix B
Suggestions for Further Study
and Bibliographical Notes
GENERAL
The theory of analytic functions of one complex variable is a vast one.
The books by Ahlfors [1], Caratheodory [9], Fuchs [17], Heins [24], Hille
[26], Rudin [41], Saks and Zygmund [42], Sansone and Gerretsen [43], and
Veech [46] treat some topics not covered in this book. In addition they
contain material which further develops some of the topics discussed here.
We have not touched upon the theory of functions of several complex
variables. The book by Narasimhan [37] contains an elementary introduc-
tion to functions of several complex variables. Also Cartan [10] contains an
introduction to the subject. The book by Whittaker and Watson [47]
contains some very classical analysis and several bibliographical com-
ments. Finally the two volume work by P6lya and Szego [39] should be
looked at by every student. These books contain problems on analysis with
the solutions in the back.
CHAPTER III
 1. A more thorough treatment of power series and infinite series in
general can be seen in the book by Knopp [28].
2. There are several ways to define an analytic function. Some books
(for example, Ahlfors [1]) define a function to be analytic if it has a
derivative at every point in an open subset of the plane. Other books (for
example, Cartan [10] ) define a function to be analytic in an open subset of
the plane if at every point of this open set the function has a power series
expansion. This latter approach has one advantage in that it is the
standard way of defining a function to be analytic in several variables.
In many ways the study of analytic function theory can be considered
as the study of the logarithm function. This will become more evident in
the remainder of the book.
3. More information concerning Mobius transformations can be ob-
tained from the book by Caratheodory [9].
CHAPTER IV
3. See the paper by Burdick and Lesley [8] for more on uniqueness
theorems.
307

308
Appendix B
4 and 5. Cauchy's Theorem first appeared in the treatise [11]. How-
ever Cauchy's original statement was far different from the one that
appears in this book. Cauchy proved his theorem under the assumption
that the function f is differentiable and that the derivative is continuous on
and inside a simple closed smooth curve. Goursat [20, 21] removed the
assumption thatf' is continuous but retained the assumption that the curve
over which the integral is to be taken is a simple closed smooth curve.
Pringsheim [40] introduced the method of proof that is used by many
today. He first proved the theorem for triangles (the method used to prove
Goursat's Theorem in 8) and then approximated the contours by poly-
gons. The role of the winding number in Cauchy's theorem and the
extension to a system of curves such that the sum of the winding numbers
with respect to every point outside of the region of analyticity is zero,
seems to have first been observed by Artin [4]. The proof of Theorem
IV. 5.4 is due to Dixon [13].
CHAPTER V
For more examples of the use of residues to calculate integrals see the
books by Lindelof [31] and Mitrinovic [35]. An interesting paper is the one
by Boas and Friedman [7].
3. The reference for Glicksberg's statement of Rouche's Theorem is
[ 18].
CHAPTER VI
The original paper of Phragmen and Lindelof [38] is still worth reading.
CHAPTER VII
 1. Much of the material in this section can be done in a more general
setting. See for example the books by Kelley [27] and Dugundji [15]. .
2. Montel's book [36] on normal families is well worth reading. In this
treatise he explores several applications of the theory of normal families to
problems in complex analysis.
4. There is a wealth of material on conformed mappings. Caratheodory
[9] has some additional information. Also the books by Bergman [5],
Goluzin [19], and Sansone and Gerretsen, vol. II [43] have extensive
treatments. It is also possible to use Hilbert space techniques to construct
conformal maps. See Bergman [5] and the second volume of Hille [26].
7. For more information on the gamma function look at the book of
Artin [3]. Also the paper [30] contains more information about the gamma
function. An interesting survey article is one by Davis [12].
8. The book by Edwards [16] gives a complete exposition of the
Reimann zeta hypothesis from an historical point of view. This book

Appendix B 309
examines Riemann's original paper point by point and fully explicates his
results. There is a result of Beurling (see the book by Donoghue [14]) that
gives an equivalent formulation of the Riemann zeta hypothesis in terms of
functional analysis.
CHAPTER VIII
The reference to Grabiner's treatment of Runge's Theorem is [22].
There are several other proofs of Runge's Theorem. One proof is by "pole
pushing"; this was used in the earlier edition of this book and also appears
in [42]. A proof using functional analysis appears in Rudin's book [41].
CHAPTER IX
3. An interesting paper on the monodromy theorem is [45].
6. The book by Springer [44] gives a readable introduction to the
theory of Riemann surfaces. A more advanced treatment is [2].
7. An excellent treatment of covering spaces can be found in Massey
[33].
CHAPTER X
Further results on harmonic functions can be found in Helms [25]. This
area of harmonic functions has been extended to functions of more than
two variables. In addition the Dirichlet problem can be formulated and
solved in this more general setting.
CHAPTER XI
The theory of entire functions is one of the largest branches of analytic
function theory. The book by Boas [6] is a standard reference.
CHAPTER XII
The book by Hayman [23] contains many generalizations of the theo-
rems presented in this chapter. Also the paper by MacGregor [32] contains
many applications and additional results. This paper also contains an
interesting bibliography.
There are essentially two ways of proving Picard's Theorem. The
elementary approach used in this chapter is based on the treatment found
in Landau's book [29]. The other treatment uses the modular function and
can be found in [1] or [46},

References
[1] L. V. AHLFORS, Complex Analysis, McGraw-Hill Book Co. (1966).
[2] L. V. AHLFORS and L. SARlO, Riemann Surfaces, Princeton University Press (1960).
[3] E. ARTIN, The Gamma Function, Holt, Reinhart, and Winston (1964).
[4] E. ARTIN, Collected Papers, Addison-Wesley Publishing Co. (1965).
[5] S. BERGMAN, The Kernel Function and Conformal Mapping, American Mathematical
Society (1970).
{6] R. P. BOAS, Entire Functions, Academic Press (1954).
[7] H. P. BOAS and E. FRIEDMAN, A simplification of certain contour integrals, Amer. Math.
Monthly, 84 (1977), 467-468.
[8] D. BURDICK AND F. D. LESLEY, Some uniqueness theorems for analytic functions, Amer.
Math. Monthly, 82 (1975), 152-155.
[9] C. CARArnEODORY, Theory of Functions (2 vols.), Chelsea Publishing Co. (1964).
[10] H. CARTAN, Elementary Theory of Analytic Functions of One qr Several Complex Vari-
ables, Addison-Wesley Publishing Co. (1963).
[II] A. CAUCHY, Memoire sur les Integrales Definies entre des Limites lmaginaires, Bure Freres
(1825).
[12] PmLIP J. DAVIS, Leonhard Euler's Integral: A historical profile of the gamma junction,
Amer. Math. Monthly 66 (1959), 849-869.
[13] JOHN D. DIXON, A brief proof of Cauchy's integral theorem, Proc. Amer. Math. Soc., 29
(1971), 625-626.
[14] W. F. DoNOGHUE, Distributions and Fourier Transforms, Academic Press (1969).
[15] J. DUGUNDn, Topology, Allyn and Bacon (1966).
[16] H. M. EDWARDS, Riemann's Zeta Function, Academic Press (1974).
[17] W. H. J. FUCHS, Topics in the Theory of Functions of One Complex Variable, D. Van
Nostrand Co. (1967).
[18] I. GLICKSBERG, A remark on Rouche's theorem, Amer. Math. Monthly, 83 (1976), 186.
[19] G. M. GOLUZIN, Geometric Theory of Functions of a Complex Variable, American
Mathematical Society (1969).
[20] E. GOURSAT, Demonstration du Theoreme de Cauchy, Acta Math., 4 (1884), 197-200.
[21] E. GOURSAT, Sur la Definition General des Fonctions Analytiques d'apres Cauchy, Trans.
Amer. Math. Soc., 1 (1900), 14-16.
[22] S. GRABINER, A short proof of Runge's theorem, Amer. Math. Monthly, 83 (1976),
807-808.
[23] W. K. HAYMAN, Meromorphic Functions, Oxford at the Clarendon Press (1964).
[24] M. HEINS, Selected Topics in the Classical Theory of Functions of a Complex Variable,
Holt, Reinhart, and Winston (1962).
[25] L. L. HELMS, Introduction to Potential Theory, Wiley-Interscience (1969).
[26] E. HILLE, Analytic Function Theory (2 vots.), Ginn and Co. (1959).
[27] J. L. KELLEY, General Topology, Springer-Verlag (1975).
[28] K. KNopp, Infinite sequences and series. Dover Publications (1956).
[29] E. LANDAU, Darste/lung und BegrUndung einiger neuerer Ergebnisse der Funktionentheorie,
Springer-Verlag (1929).
[30] R. LEIPNIK AND R. OBERG, Subvex functions and Bohr's uniqueness theorem, Amer. Math.
Monthly, 74 (1967) 1093-1094.
[31] E. LINDEWF, Le Calcul des Residues et ses Applications ala tJJeorie des Fonetions, Chelsea
Publishing Co. (1947).
[32] T. H. MAcGREGOR, Geometric Problems in Complex Analysis, Amer. Math. Monthly 79
(1972), 447-468. ..
[33] W. MASSEY, Algebraic Topology: An Introduction, Springer-Verlag (1977).
[34] CHARLES A. McCARTIIY, The Cayley-Hamilton Theorem, Amer. Math. Monthly 82
(1974), 3391.
[35] D. S. MITRINOVIC, Calculus of Residues, P. Noordhoff (1966).
[?6] P. MONTEL, Lelions sur les series de polynomes, Gauthier-Villars (1910).
[37] R. NARASIMHAN, Several Complex Variables, The University of Chicago Press (1971).
[38] E. PHRAGMEN AND E. LINDEWF, Sur une extension d'un prineipe c/assique de I'analyse et
sur quelques proprietes des fonetions monogeues dans Ie voisinage d'un point s;ngu/;er,
Acta Math. 31 (1908), 381-406.
311

312
References
[39] G. POLYA AND G. SZEGO, Problems and Theorems in Analysis (2 vols.), Spnnger-Verlag
(vol. I, 1972; vol. 2, 1976).
[40] A. PIuNGSHEIM, Uber den Goursat'schen Beweis des Cauchy'schen Integralsatzes, Trans.
Amer. Math. Soc., 2 (1901), 413-421.
[41] W. RUDIN, Real and Complex Analysis, McGraw-Hili Book Co. (1966).
[42] S. SAKS AND A. ZYGMUND, Analytic Functions, Monografie Matematyczne (1952).
[43] G. SANSONE and J. GERRETSEN, Lectures on the Theory of Functions of a Complex Variable
(2 vols.), P. Noordhoff (vol. 1, 1960; vol. 2,1969).
[44] G. SPRINGER, Introduction to Riemann Surfaces, Addison-Wesley Publishing Co. (1957).
[45] DAVID STYER and C. D. MINDA, The use of the monodromy theorem, Amer. Math.
Monthly, 81 (1974),639--642.
[46] W. A. VEECH, A Second Course in Complex Analysis, W. A. Benjamin, Inc. (1967).
[47] E. WHITTAKER and G. N. WATSON, A Course of Modern Analysis, Cambridge University
Press (1962).

Abel's Theorem 74
absolute value 2
absolutely convergent product 166
absolutely convergent series 30, 106
analytic continuation along a path 214
- along a chain of disks 216
- of a germ 215
analytic function 34, 236
analytic manifold 234
analytic structure 234
analytic surface 234
angle between two paths 45
arc 229
arcwise connected 230
argument 4
argument principle 123
Arzela-Ascoli Theorem 148
barrier 269
base space 228, 232
Bernoulli numbers 76
Bessel function 122
beta function 186
Blaschke product 173
Bloch's constant 295
Bloch's Theorem 293
Bohr-Mollerup Theorem 179
boundary 13
bounded function 12
branch of the logarithm 39, 40
Cantor's Theorem 19
Caratheodory's inequality 133
Casorati- Weierstrass Theorem 109,
III
Cauchy's estimate 73
Cauchy's Integral Formula 84
Cauchy-Riemann equations 41
Cauchy sequence 18
Cauchy's Theorem
- first version 85
- second version 89
- third version 90
- fourth version 94
INDEX
Cayley-Hamilton Theorem 87
Chain of disks 216
chain rule 34
Change of parameter 64
closed ball 11
closed curve 66
closed map 99
closed set 12, 222
closure 13
compact 20, 224
complete analytic function 215, 216
- of local inverses 239
complete metric space 18
component 16
conformal mapping 46
conformally equivalent 160
conjugate 2
connected 14, 224
continuous function 24, 224
convergent sequence 18
convergent series 30, 106
convex function 134
convex set 89, 134
coordinate patch 234
cover 20
covering space 245
critical strip 193
cross ratio 48
curve 64
OeMoivre's Formula 5
dense 13
diameter of a set 19
differentiable function 33
dilation 47, 56
Dini's Theorem 150
Dirichlet problem 252, 269
Dirichlet region 269
distance between a point and a set 25
distance between two sets 27
distance function 11
elementary factor 168
empty set 12
313

314
entire function 77
equicontinuous 148
equivalence of paths 64
essen tial singularity 105, III
Euler's constant 75, 177, 185
Euler's Theorem 193
exponent of convergence 286
exponential function 32
exponential series 32
extended boundary 129
extended plane 8
FEP homotopic 93
f.i.p. 21
fiber 228
final point 229
finite genus 283
finite intersection property 21
finite order 285
finite rank 282
finitely generated ideal 208
fixed ideal 209
free ideal 209
function element 214
function of bounded variation 58
functional equation of the gamma
function 178
of the zero function 192
fundamental set 245
Fundamental Theorem of Algebra 77,
100
gamma function 176
Gaussian psi function 186
Gauss's Formula 178
genus 283
geometric series 30
germ 214
Goursat's Theorem 100
Great Picard Theorem 300
greatest common divisor 174
Green's function 275
Hadamard's Factorization Theorem
289
Hadamard's Three Circles Theorem
137
Hardy's Theorem 138
harmonic conjugate 42, 252
Index
harmonic function 41, 252
Harnack's Inequality 260
Harnack's Theorem 261, 268
Hausdorff space 224
Heine-Borel Theorem 23
holomorphic function 126, 151
homeomorphism 163, 202
homologous to zero 95
homomorphism 6
homotopic closed curves 88
homotopic to zero 89
Hurwitz's Theorem 152
ideal 174
ideal generated by !/ 208
imaginary part 2
Independence of Path Theorem 93
index 81
infinite order 285
infinite product 164
infinite rank 282
ini tial point 229
integration around a branch point 119
interior 13
Intermediate Value Theorem 27
inversion 47
isolated singularity 103
isomorphism 238
Jensen's Formula 280
Jordan Curve Theorem 213
Landau's Constant 295
Laplace's Equation 252
Laurent Series Development 107
Lebesgue's Covering Lemma 21
left side of a circle 53
Leibniz's Rule 68, 73
lifting 246
limit inferior of a function 129
- of a sequence 30
limit point 18, 222
limit superior of a function 129
- of a sequence 30
line integral 63
linear fractional transformation 47
Liouville's Theorem 77, 123, 238
Lipschitz function 25
Little Picard Theorem 297

Index
locally bounded 153
locally arcwise connected 230
locally Lipschitz 154
logarithmically convex function 135
MVP 253, 260
maximal ideal 174
Maximum Modulus Theorem,
- first version 79, 128, 238
- second version 128
- third version 129
Maximum Principle for harmonic
functions
- first version 253
- second version 254
- third version 264
- fourth version 264
mean value property 253,260
Mean Value Theorem 253
meromorphic function 123
metric space II
metrisable space 223
Minimum Principle 129, 255
Mittag-Leffler's Theorem 205
Mobius transformation 47
Monodromy Theorem 219, 221, 247
Montel-Caratheodory Theorem 300
Montel's Theorem 153
Morera's theorem 86
multiplicity of a zero 76
neighborhood system 226
normal set of functions 146
normal subgroup 57
open ball II
open cover 20
open map 99
Open Mapping Theorem 99, 238
open set, 12, 222
order 285
orientation 52
Orientation Principle 53
parallelogram law 3
partial fractions 106
path 45, 229
pathwise connected 230
31S
periodic function 38
Perron family 266
Perron function 268
Phragmen-Lindelof Theorem 138
Picard's Great Theorem 300
Picard's Little Theorem 297
Poisson-Jensen Formula 281
Poisson Kernel 256
pole 105, 111
polygon 15
polynomially convex hull 200
power series 30
prime ideal 174
primitive 65, 94
principal branch of the loagrithm 40
principal ideal 208
projection map 228
proper ideal 174
properly covered 245
punctured disk 103
radius of convergence 31
rank 282
real part 2
rectifiable path 62
region 40
regular function 151
relative topology 225
relatively prime 208
removable singularity 103, III
residue 112
Residue Theorem 112
Riemann's Functional Equation 192
Riemann Hypothesis 193
Riemann Mapping Theorem 160, 277
Riemann Surface 232
Riemann Zeta Function 187
right side of a circle 53
roots of unity 5
rotation 47
Rouche's Theorem 125
Runge's Theorem 198
Schottky's Theorem 298
Schwarz Reflection Principle 211, 256
Schwarz's Lemma 130
sequentially compact 21
sheaf of germs 228
simple group 57

316
simple root 98
simply connected 93, 202
singular part 105
singularity at infinity III
stalk 228
standard form 283
star shaped set 89
stereographic projection 9
subharmonic function 264
superharmonic function 264
symmetric points 50
Symmetry Principle 52
terminal point 229
topological space 221
topology induced by a neighborhood
system 227
total boundedness 22
total variation 58
trace of a path 62, 229
translation 47
Index
triangle inequality 3, 11
triangular path 86
trivial zeros 193
uniform convergence 28, 29
uniformly continuous 25
uniformly convergent integral 154
unrestricted analytic continuation 219
Vitali's Theorem 154
Wallis's Formula 176
Weierstrass Approximation Theorem
263
Weierstrass Factorization Theorem
170, 207
Weierstrass M-test 29
Weierstrass Pe Function 207
Weierstrass Zeta Function 207
winding number 81, 250

LIST OF SYMBOLS
C,R 1 Yo "-I Y1 88
z,lzl 2 y--O 89
argz 4 yO 95
cis (} 4 Res(f; a) 112
Coo 8 lim inf f( z ) 129
0 za
12 limsup f(z) 129
B(S) 12 za
A- 13 C(G,Q) 142
intA 13 p(f,g) 143
aA 13 H(G) 151
0 13 M(G) 155
[z, w] 15 p.(f) 158
lim f(x) = w 24 f£(f),2:(g) 174
xa 5(A)
d( x, A) 25 174
d( A, B) 27 ', II' 175
f= u-limfn 29 K 201
lim inf an 30  (z) 207
lim sup an 30 G* 210,213
GL 2 (C) 57 (f, G) 214
SL 2 (C) 57 [f]o 214
SU 2 57 ff y 225
v( y ; P) 58 N(f,D) 228
V(y) 58 AI 228
(a,[f]a)
f: f dy 60 ( U, <p) 234
Jyf 63 (X, ) 234
fyfldzl 64 Har(G) 261
(!J (f,G) 266
n(y;a) 81
317

Graduate Texts in Mathematics
continued from page ii
48 SACHs/WU. General Relativity for Mathematicians.
49 GRUENBERG/WEIR. Linear Geometry. 2nd ed.
50 EDWARDS. Fermat's Last Theorem.
51 KLINGENBERG. A Course in Differential Geometry.
52 HARTSHORNE. Algebraic Geometry.
53 MANIN. A Course in Mathematical Logic.
54 GRA VER!W ATKINS. Combinatorics with Emphasis on the Theory of Graphs.
55 BROWN/PEARCY. Introduction to Operator Theory I: Elements of Functional
Analysis.
56 MASSEY. Algebraic Topology: An Introduction.
57 CROWELL/Fox. Introduction to Knot Theory.
58 KOBLITZ. p-adic Numbers, p-adic Analysis, and Zeta-Functions.
59 LANG. Cyclotomic Fields.
60 ARNOLD. Mathematical Methods in Classical Mechanics.
61 WHITEHEAD. Elements of Homotopy Theory.
62 KARGAPOLOV/MERZLJAKOV. Fundamentals of the Theory of Group.
63 BOLLOBAS. Graph Theory.
64 EDWARDS. Fourier Series. Vol. I. 2nd ed.
65 WELLS. Differential Analysis on Complex Manifolds. 2nd ed.
66 WATERHOUSE. Introduction to Affine Group Schemes.
67 SERRE. Local Fields.
68 WEIDMANN. Linear Operators in Hilbert Spaces.
69 LANG. Cyclotomic Fields II.
70 MASSEY. Singular Homology Theory.
71 FARKAS/KRA. Riemann Surfaces.
72 STILLWELL. <Classical Topology and Combinatorial Group Theory.
73 HUNGERFORD. Algebra.
74 DA VENPORT. Multiplicative Number Theory. 2nd ed.
75 HOCHSCHILD. Basic Theory of Algebraic Groups and Lie Algebras.
76 lIT AKA. Alge braic Geometry.
77 HECKE. Lectures on the Theory of Algebraic Numbers.
78 BURRIS/SANKAPPANA VAR. A Course in Universal Algebra.
79 WALTERS. An Introduction to Ergodic Theory.
80 ROBINSON. A Course in the Theory of Groups.
81 FORSTER. Lectures on Riemann Surfaces.
82 BOTT/Tv. Differential Forms in Algebraic Topology.
83 WASHINGTON. Introduction to Cyclotomic Fields.
84 IRELAND/RoSEN. A Classical Introduction Modern Number Theory.
85 EDWARDS. Fourier Series. Vol. II. 2nd ed.
86 v AN LINT. Introduction to Coding Theory.
87 BROWN. Cohomology of Groups.
88 PIERCE. Associative Algebras.
89 LANG. Introduction to Algebraic and Abelian Functions. 2nd ed.
90 BRNDSTED. An Introduction to Convex Polytopes.
91 BEARDON. On the Gumetry of Discrete Groups.
92 DIESTEL. Sequences and Series in Banach Spaces.

93 DUBROVIN/FoMENKO/NoVIKOV. Modem Geometry - Methods and Applications
V 01. I.
94 WARNER. Foundations of Differentiable Manifolds and Lie Groups.
95 SHIRYAYEV. Probability, Statistics, and Random Processes.
96 ZEIDLER. Nonlinear Functional Analysis and Its Applications I: Fixed Points
Theorem.