Complex Analysis
3/5
()
About this ebook
Related to Complex Analysis
Related ebooks
Applied Partial Differential Equations Rating: 0 out of 5 stars0 ratingsIntroduction to Analysis Rating: 4 out of 5 stars4/5Fundamentals of Modern Mathematics: A Practical Review Rating: 0 out of 5 stars0 ratingsIntroduction to the Theory of Abstract Algebras Rating: 0 out of 5 stars0 ratingsVector Spaces and Matrices Rating: 0 out of 5 stars0 ratingsTrigonometry Rating: 5 out of 5 stars5/5Elementary Matrix Algebra Rating: 3 out of 5 stars3/5Understanding Proof: Explanation, Examples and Solutions Rating: 0 out of 5 stars0 ratingsAn Introduction to Analysis Rating: 5 out of 5 stars5/5Introduction to Real Analysis Rating: 3 out of 5 stars3/5Complex Variables Rating: 0 out of 5 stars0 ratingsBasic Abstract Algebra: For Graduate Students and Advanced Undergraduates Rating: 4 out of 5 stars4/5Linear Algebra Rating: 1 out of 5 stars1/5Fundamental Concepts of Abstract Algebra Rating: 5 out of 5 stars5/5Sets, Sequences and Mappings: The Basic Concepts of Analysis Rating: 0 out of 5 stars0 ratingsBasic Methods of Linear Functional Analysis Rating: 0 out of 5 stars0 ratingsElementary Point-Set Topology: A Transition to Advanced Mathematics Rating: 5 out of 5 stars5/5An Introduction to Mathematical Modeling Rating: 5 out of 5 stars5/5Brownian Motion, Martingales, and Stochastic Calculus Rating: 0 out of 5 stars0 ratingsInformation Theory and Statistics Rating: 0 out of 5 stars0 ratingsAdvanced Trigonometry Rating: 2 out of 5 stars2/5Methods of Applied Mathematics Rating: 3 out of 5 stars3/5Elementary Number Theory Rating: 3 out of 5 stars3/5A Course on Group Theory Rating: 4 out of 5 stars4/5Differential Topology: First Steps Rating: 0 out of 5 stars0 ratingsFoundations of Modern Analysis Rating: 1 out of 5 stars1/5The Number System Rating: 0 out of 5 stars0 ratingsA Bridge to Advanced Mathematics Rating: 1 out of 5 stars1/5
Mathematics For You
The Little Book of Mathematical Principles, Theories & Things Rating: 3 out of 5 stars3/5Basic Math & Pre-Algebra For Dummies Rating: 4 out of 5 stars4/5Quantum Physics for Beginners Rating: 4 out of 5 stars4/5Standard Deviations: Flawed Assumptions, Tortured Data, and Other Ways to Lie with Statistics Rating: 4 out of 5 stars4/5Mental Math Secrets - How To Be a Human Calculator Rating: 5 out of 5 stars5/5What If?: Serious Scientific Answers to Absurd Hypothetical Questions Rating: 5 out of 5 stars5/5My Best Mathematical and Logic Puzzles Rating: 4 out of 5 stars4/5Calculus Made Easy Rating: 4 out of 5 stars4/5Algebra - The Very Basics Rating: 5 out of 5 stars5/5Algebra II For Dummies Rating: 3 out of 5 stars3/5The Golden Ratio: The Divine Beauty of Mathematics Rating: 5 out of 5 stars5/5Real Estate by the Numbers: A Complete Reference Guide to Deal Analysis Rating: 0 out of 5 stars0 ratingsThe Everything Guide to Algebra: A Step-by-Step Guide to the Basics of Algebra - in Plain English! Rating: 4 out of 5 stars4/5Limitless Mind: Learn, Lead, and Live Without Barriers Rating: 4 out of 5 stars4/5Calculus For Dummies Rating: 4 out of 5 stars4/5Algebra I Workbook For Dummies Rating: 3 out of 5 stars3/5Mental Math: Tricks To Become A Human Calculator Rating: 5 out of 5 stars5/5The Math of Life and Death: 7 Mathematical Principles That Shape Our Lives Rating: 4 out of 5 stars4/5The Everything Everyday Math Book: From Tipping to Taxes, All the Real-World, Everyday Math Skills You Need Rating: 5 out of 5 stars5/5ACT Math & Science Prep: Includes 500+ Practice Questions Rating: 3 out of 5 stars3/5The New York Times Book of Mathematics: More Than 100 Years of Writing by the Numbers Rating: 0 out of 5 stars0 ratingsPre-Calculus For Dummies Rating: 5 out of 5 stars5/5How to Calculate Quickly: Full Course in Speed Arithmetic Rating: 4 out of 5 stars4/5Relativity: The special and the general theory Rating: 5 out of 5 stars5/5Painless Algebra Rating: 0 out of 5 stars0 ratingsHow Math Explains the World: A Guide to the Power of Numbers, from Car Repair to Modern Physics Rating: 3 out of 5 stars3/5How to Solve It: A New Aspect of Mathematical Method Rating: 4 out of 5 stars4/5
Reviews for Complex Analysis
3 ratings0 reviews
Book preview
Complex Analysis - John M. Howie
1
What Do I Need to Know?
John M. Howie CBE, MA, DPhil, DSc, Hon D.Univ., FRSE¹
(1)
School of Mathematics and Statistics, Mathematical Institute, University of St Andrews, North Haugh, St Andrews, Fife, KY16 9SS, UK
Introduction
Complex analysis is not an elementary subject, and the author of a book like this has to make some reasonable assumptions about what his readers know already. Ideally one would like to assume that the student has some basic knowledge of complex numbers and has experienced a fairly substantial first course in real analysis. But while the first of these requirements is realistic the second is not, for in many courses with an applied
emphasis a course in complex analysis sits on top of a course on advanced (multi-variable) calculus, and many students approach the subject with little experience of ϵ−δ arguments, and with no clear idea of the concept of uniform convergence. This chapter sets out in summary the equipment necessary to make a start on this book, with references to suitable texts. It is written as a reminder: if there is anything you don’t know at all, then at some point you will need to consult another book, either the suggested reference or another similar volume.
Given that the following summary might be a little indigestible, you may find it better to skip it at this stage, returning only when you come across anything unfamiliar. If you feel reasonably confident about complex numbers, then you might even prefer to skip Chapter 2 as well.
1.1 Set Theory
You should be familiar with the notations of set theory. See [9, Section 1.3].
If A is a set and a is a member, or element, of A we write a ∈ A, and if x is not an element of A we write x ∉ A. If B is a subset of A we write B ⊆ A (or sometimes A ⊇ B). If B ⊆ A but B ≠ A, then B is a proper subset of A. We write B ⊂ A, or A ⊃ B.
Among the subsets of A is the empty set , containing no elements at all.
Sets can be described by listing, or by means of a defining property. Thus the set {3, 6, 9, 12} (described by listing) can alternatively be described as {3x : x ∈ {1, 2, 3, 4}} or as {x ∈ {1, 2,... , 12} : 3 divides x}.
The union A ∪ B of two sets is defined by:
The intersection A ∩ B is defined by
The set A \ B is defined by
In the case where B ⊆ A this is called the complement of B in A.
The cartesian product A × B of two sets A and B is defined by
1.2 Numbers
See [9, Section 1.1].
The following notations will be used:
ℕ = {1, 2, 3,...}, the set of natural numbers;
ℤ = {0, ±1, ±2,...}, the set of integers;
ℚ = {p/q : p, q ∈ ℤ, q ≠ 0}, the set of rational numbers;
ℝ, the set of real numbers.
It is not necessary to know any formal definition of ℝ, but certain properties are crucial. For each a in ℝ the notation |a|, the absolute value, or modulus, of a, is defined by
If U is a subset of ℝ, then U is bounded above if there exists K in ℝ such that u ≤ K for all u in U, and the number K is called an upper bound for U. Similarly, U is bounded below if there exists L in ℝ such that u ≥ L for all u in U, and the number L is called a lower bound for U. The set U is bounded if it is bounded both above and below. Equivalently, U is bounded if there exists M > 0 such that |u| ≤ M for all u in U.
The least upper bound K for a set U is defined by the two properties
(i)
K is an upper bound for U;
(ii)
if K′ is an upper bound for U, then K′ ≥ K.
The greatest lower bound is defined in an analogous way.
The Least Upper Bound Axiom for ℝ states that every non-empty subset of ℝ that is bounded above has a least upper bound in ℝ. Notice that the set ℚ does not have this property: the set {q ∈ ℚ : q² < 2} is bounded above, but has no least upper bound in ℚ. It does of course have a least upper bound in ℝ, namely .
The least upper bound of a subset U is called the supremum of U, and is written sup U. The greatest lower bound is called the infimum of U, and is written inf U.
We shall occasionally use proofs by induction: if a proposition ℙ(n) concerning natural numbers is true for n = 1, and if, for all k ≥ 1 we have the implication ℙ(k) ⇒ ℙ(k + 1), then ℙ(n) is true for all n in ℕ. The other version of induction, sometimes called the Second Principle of Induction, is as follows: if ℙ(1) is true and if, for all m > 1, the truth of ℙ(k) for all k < m implies the truth of ℙ(m), then ℙ(n) is true for all n.
One significant result that can be proved by induction (see [9, Theorem 1.7]) is
Theorem 1.1 (The Binomial Theorem)
For all a, b, and all integers n ≥ 1,
Here
Note also the Pascal Triangle Identity
(1.1)
EXERCISES
1.1.
Show that the Least Upper Bound Axiom implies the Greatest Lower Bound Axiom: every non-empty subset of ℝ that is bounded below has a greatest lower bound in ℝ.
1.2.
Let the numbers q1, q2, q3,... be defined by
Prove by induction that
1.3.
Let the numbers f1, f2, f3,... be defined by
Prove by induction that
where .
[This is the famous Fibonacci sequence. See [2].]
1.3 Sequences and Series
See [9, Chapter 2].
A sequence (an)n∈ℕ, often written simply as (an), has a limit L if an can be made arbitrarily close to L for all sufficiently large n. More precisely, (an) has a limit L if, for all ϵ > 0, there exists a natural number N such that |an − L| < ϵ for all n > N. We write (an) → L, or limn→∞ an = L. Thus, for example, ((n + 1)/n) → 1. A sequence with a limit is called convergent; otherwise it is divergent.
A sequence (an) is monotonic increasing if an + 1 ≥ an for all n ≥ 1, and monotonic decreasing if an + 1 ≤ an for all n ≥ 1. It is bounded above if there exists K such that an ≤ K for all n ≥ 1. The following result is a key to many important results in real analysis:
Theorem 1.2
Every sequence (an) that is monotonic increasing and bounded above has a limit. The limit is sup {an : n ≥ 1}.
A sequence (an) is called a Cauchy sequence¹ if, for every ϵ > 0, there exists a natural number N with the property that |am − an| < ϵ for all m, n > N. The Completeness Property of the set ℝ is
Theorem 1.3
Every Cauchy sequence is convergent.
A series determines a sequence (SN) of partial sums, where . The series is said to converge, or to be convergent, if the sequence of partial sums is convergent, and limN → ∞ SN is called the sum to infinity, or just the sum, of the series. Otherwise the series is divergent. The Completeness Property above translates for series into
Theorem 1.4 (The General Principle of Convergence)
If for every ϵ > 0 there exists N such that
for all m > n > N, then is convergent.
For series of positive terms there are two tests for convergence.
Theorem 1.5 (The Comparison Test)
Let and be series of positive terms.
(i)
If converges and if xn ≤ an for all n, then also converges.
(ii)
If diverges and if xn ≥ an for all n, then also diverges.
Theorem 1.6 (The Ratio Test)
Let be a series of positive terms.
(i)
If limn→∞(an+1/an) = l < 1, then converges.
(ii)
If limn→∞(an+1/an) = l > 1, then diverges.
In Part (i) of the Comparison Test it is sufficient to have xn ≤ kan for some positive constant k, and it is sufficient also that the inequality should hold for all n exceeding some fixed number N. Similarly, in Part (ii) it is sufficient to have (for some fixed N) xn ≥ kan for some positive constant k and for all n > N. In the Ratio Test it is important to note that no conclusion at all can be drawn if limn→∞(an+1/an) = 1.
Theorem 1.7
The geometric series converges if and only if |r| < 1. Its sum is a / (1 − r).
Theorem 1.8
The series is convergent if and only if k > 1.
A series of positive and negative terms is called absolutely convergent if is convergent. The convergence of in fact implies the convergence of , and so every absolutely convergent series is convergent. The series is called conditionally convergent if is convergent and is not.
Theorem 1.9
For a power series there are three possibilities:
(a)
the series converges for all x; or
(b)
the series converges only for x = 0; or
(c)
there exists a real number R > 0, called the radius of convergence, with the property that the series converges when |x| < R and diverges when |x| > R.
We find it convenient to write R = ∞ in Case (a), and R = 0 in Case (b).
Two methods of finding the radius of convergence are worth recording here:
Theorem 1.10
Let be a power series. Then:
(i)
the radius of convergence of the series is limn→∞ |an/an+1|, if this limit exists;
(ii)
the radius of convergence of the series is 1/[limn→∞ |an|¹/n], if this limit exists.
We shall also encounter series of the form . These cause no real difficulty, but it is important to realise that convergence of such a series requires the separate convergence of the two series and . It is not enough that should exist. Consider, for example, , where for all N, but where it would be absurd to claim convergence.
1.4 Functions and Continuity
See [9, Chapter 3].
Let I be an interval, let c ∈ I, and let f be a real function whose domain dom f contains I, except possibly for the point c. We say that limx → c f(x) = l if f(x) can be made arbitrarily close to l by choosing x sufficiently close to c. More precisely, limx → c f(x) = l if, for every ε > 0, there exists δ > 0 such that |f(x) − l| < ϵ for all x in dom f such that 0 < |x − c| < δ. If the domain of f contains c, we say that f is continuous at c if limx → c f(x) = f(c). Also, f is continuous on I if it is continuous at every point in I.
The exponential function exp x, often written ex, is defined by the power series . It has the properties
The logarithmic function log x, defined for x > 0, is the inverse function of ex:
It has the properties
The following limits are important. (See [9, Section 6.3].)
(1.2)
(1.3)
The circular functions cos and sin, defined by the series
(1.4)
have the properties
(1.5)
(1.6)
(1.7)
(1.8)
(1.9)
All other identities concerning circular functions can be deduced from these, including the periodic properties
and the location of the zeros: cos x = 0 if and only if x = (2n + 1)π/2 for some n in ℤ; and sin x = 0 if and only if x = nπ for some n in ℤ.
The remaining circular functions are defined in terms of sin and cos as follows:
Remark 1.11
It is not obvious that the functions defined by the series (1.4) have any connection with the adjacent over hypotenuse
and opposite over hypotenuse
definitions one learns in secondary school. They are, however, the same. For an account, see [9, Chapter 8].
The inverse functions sin−1 and tan−1 need to be defined with some care. The domain of sin−1 is the interval [−1, 1], and sin−1 x is the unique y in [−π/2, π/2] such that sin y = x. Then certainly sin(sin−1 x) = x for all x in [−1, 1], but we cannot say that sin−1 (sin x) = x for all x in ℝ, for sin−1 (sin x) must lie in the interval [−π/2, π/2] whatever the value of x. Similarly, the domain of tan−1 is ℝ, and tan−1 x is defined as the unique y in the open interval (−π/2, π/2) such that tan y = x. Again, we have tan(tan−1(x)) = x for all x, but tan−1 (tan x) = x only if x ∈ (−π/2, π/2).
The hyperbolic functions are defined by
(1.10)
Equivalently,
(1.11)
By analogy with the circular functions, we define
EXERCISES
1.4
Use the formulae (1.5) – (1.9) to show that
1.5
a)
Use the formulae (1.5) – (1.9) to obtain the formula
and deduce that
b)
Hence show that
1.6
Deduce from (1.8) and (1.9) that
1.7
Define the sequence (an) by
Prove by induction that, for all n ≥ 1,
1.5 Differentiation
See [9, Chapter 4].
A function f is differentiable at a point a in its domain if the limit
exists. The value of the limit is called the derivative of f at a, and is denoted by f′(a). A function is differentiable in an interval (a, b) if it is differentiable at every point in (a, b).
The function f′(x) is alternatively denoted by
where y = f(x).
Theorem 1.12 (The Mean Value Theorem)
If f is continuous in [a, b] and differentiable in (a, b), and if x ∈ (a, b), then there exists u in (a, b) such that
Moreover, if f′ exists and is continuous in [a, b], then
where ϵ(x) → 0 as x → a.
Corollary 1.13
Let f be continuous in [a, b] and differentiable in (a, b), and suppose that f′(x) = 0 for all x in (a, b). Then f is a constant function.
The following table of functions and derivatives may be a useful reminder:
Recall also the crucial techniques of differential calculus. Here u and v are differentiable in some interval containing x.
The Linearity Rule. If f(x) = ku(x) + lv(x), where k, l are constants, then
The Product Rule. If f(x) = u(x)v(x), then
The Quotient Rule. If f(x) = u(x)/v(x) (where v(x) ≠ 0) then
The Chain Rule. If f(x) = u(v(x)), then
We shall have cause to deal with higher derivatives also. A function f may have a derivative f′ that is differentiable, and in this case we denote the derivative of f′ by f″. The process can continue: we obtain derivatives f‴, f(4),... , f(n), .... (Obviously the transition from dashes to bracketed superscripts is a bit arbitrary: if we write f(n) (n ≥ 0)
, then by f(0), f(1), f(2) and f(3) we mean (respectively) f,