TOPOLOGY, LIMITS OF COMPLEX NUMBERS. Contents 1. Topology and limits of complex numbers 1

Similar documents
Cardinality of Accumulation Points of Infinite Sets

code V(n,k) := words module

INTEGRATION OVER NON-RECTANGULAR REGIONS. Contents 1. A slightly more general form of Fubini s Theorem

LESSON 2: THE INCLUSION-EXCLUSION PRINCIPLE

SOLUTIONS FOR PROBLEM SET 4

Outline. Sets of Gluing Data. Constructing Manifolds. Lecture 3 - February 3, PM

18 Completeness and Compactness of First-Order Tableaux

Class 8 - Sets (Lecture Notes)

Lecture 2. 1 Nondeterministic Communication Complexity

Sets. Definition A set is an unordered collection of objects called elements or members of the set.

With Question/Answer Animations. Chapter 6

From a Ball Game to Incompleteness

To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2

2.2. Special Angles and Postulates. Key Terms

SOLITAIRE CLOBBER AS AN OPTIMIZATION PROBLEM ON WORDS

Permutations and codes:

The tenure game. The tenure game. Winning strategies for the tenure game. Winning condition for the tenure game

Solutions to the problems from Written assignment 2 Math 222 Winter 2015

Similarly, the point marked in red below is a local minimum for the function, since there are no points nearby that are lower than it:

11.7 Maximum and Minimum Values

2.1 Partial Derivatives

NON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday

σ-coloring of the Monohedral Tiling

Exam 2 Summary. 1. The domain of a function is the set of all possible inputes of the function and the range is the set of all outputs.

The next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following:

RAINBOW COLORINGS OF SOME GEOMETRICALLY DEFINED UNIFORM HYPERGRAPHS IN THE PLANE

Simple permutations and pattern restricted permutations

A GRAPH THEORETICAL APPROACH TO SOLVING SCRAMBLE SQUARES PUZZLES. 1. Introduction

Introduction to Computational Manifolds and Applications

Game Theory and Randomized Algorithms

Monotone Sequences & Cauchy Sequences Philippe B. Laval

Constructions of Coverings of the Integers: Exploring an Erdős Problem

A variation on the game SET

Equilateral k-isotoxal Tiles

Non-overlapping permutation patterns

Compound Probability. Set Theory. Basic Definitions

25 C3. Rachel gave half of her money to Howard. Then Howard gave a third of all his money to Rachel. They each ended up with the same amount of money.

Aesthetically Pleasing Azulejo Patterns

Teacher s Notes. Problem of the Month: Courtney s Collection

18.204: CHIP FIRING GAMES

Low-Latency Multi-Source Broadcast in Radio Networks

Functions of several variables

Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings

Modular Arithmetic. Kieran Cooney - February 18, 2016

Permutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.

Axiom A-1: To every angle there corresponds a unique, real number, 0 < < 180.

Stanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011

CIS 2033 Lecture 6, Spring 2017

Principle of Inclusion-Exclusion Notes

CHAPTER 3. Parallel & Perpendicular lines

CS1802 Week 6: Sets Operations, Product Sum Rule Pigeon Hole Principle (Ch )

Asymptotic behaviour of permutations avoiding generalized patterns

Pattern Avoidance in Unimodal and V-unimodal Permutations

1. The empty set is a proper subset of every set. Not true because the empty set is not a proper subset of itself! is the power set of A.

DVA325 Formal Languages, Automata and Models of Computation (FABER)

Maxima and Minima. Terminology note: Do not confuse the maximum f(a, b) (a number) with the point (a, b) where the maximum occurs.

Solutions for the Practice Questions

Problem 2A Consider 101 natural numbers not exceeding 200. Prove that at least one of them is divisible by another one.

Definitions and claims functions of several variables

CS1802 Week 6: Sets Operations, Product Sum Rule Pigeon Hole Principle (Ch )

Project Maths Geometry Notes

C.2 Equations and Graphs of Conic Sections

In how many ways can we paint 6 rooms, choosing from 15 available colors? What if we want all rooms painted with different colors?

Notes on Mathematical Education in Leningrad (St. Petersburg)

Name Period GEOMETRY CHAPTER 3 Perpendicular and Parallel Lines Section 3.1 Lines and Angles GOAL 1: Relationship between lines

Notes for Recitation 3

Cutting a Pie Is Not a Piece of Cake

Public Key Encryption

Permutations with short monotone subsequences

Yale University Department of Computer Science

Tile Number and Space-Efficient Knot Mosaics

Surreal Numbers and Games. February 2010

The ternary alphabet is used by alternate mark inversion modulation; successive ones in data are represented by alternating ±1.


Introduction to Coding Theory

SETS OBJECTIVES EXPECTED BACKGROUND KNOWLEDGE 1.1 SOME STANDARD NOTATIONS. Sets. MODULE - I Sets, Relations and Functions

I.M.O. Winter Training Camp 2008: Invariants and Monovariants

The Classification of Quadratic Rook Polynomials of a Generalized Three Dimensional Board

ON SPLITTING UP PILES OF STONES

Two-person symmetric whist

The topic for the third and final major portion of the course is Probability. We will aim to make sense of statements such as the following:

arxiv: v1 [math.co] 8 Oct 2012

Goldbach Conjecture (7 th june 1742)

CMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013

Edge-disjoint tree representation of three tree degree sequences

Student Outcomes. Classwork. Exercise 1 (3 minutes) Discussion (3 minutes)

Sequences. like 1, 2, 3, 4 while you are doing a dance or movement? Have you ever group things into

MATH 105: Midterm #1 Practice Problems

Calculus II Fall 2014

Students use absolute value to determine distance between integers on the coordinate plane in order to find side lengths of polygons.

X = {1, 2,...,n} n 1f 2f 3f... nf

How to Do Trigonometry Without Memorizing (Almost) Anything

8.2 Union, Intersection, and Complement of Events; Odds

An elementary study of Goldbach Conjecture

Assignment 2. Due: Monday Oct. 15, :59pm

Section 15.3 Partial Derivatives

Permutations. = f 1 f = I A

Three Pile Nim with Move Blocking. Arthur Holshouser. Harold Reiter.

BRITISH COLUMBIA SECONDARY SCHOOL MATHEMATICS CONTEST, 2006 Senior Preliminary Round Problems & Solutions

G.2 Slope of a Line and Its Interpretation

Transcription:

TOPOLOGY, LIMITS OF COMPLEX NUMBERS Contents 1. Topology and limits of complex numbers 1 1. Topology and limits of complex numbers Since we will be doing calculus on complex numbers, not only do we need to know how to do arithmetic on complex numbers, we also need to understand how to take limits in complex numbers. Fortunately, the situation is very similar to what happens in R. For example, suppose z 1, z 2,..., z n,... is an infinite sequence of complex numbers. We say that this sequence converges to the complex number w if lim z n w = 0, n and write lim z n = w if this is the case. Notice that in this definition, the numbers n z n w are all real, so this definition is not circular. One can easily check that z n w if and only if Re z n Re w, Im z n Im w. Therefore, evaluating limits of sequences of complex numbers is, in practice, the same thing as evaluating the limits of two sequences of real numbers. Geometrically, a sequence of numbers z n in the complex plane approaches a limit w if and only if the points z n get closer and closer to w. Example. Suppose z n = n n + 1 + sin n n i. Then Re z n = n n + 1 has limit 1, and sin n n has limit 0, so z n 1. As a matter of fact, since z 1 z 2 is just equal to the distance of z 1, z 2 from each other in the complex plane, taking absolute values of complex numbers gives the same distance function as ordinary Euclidean distance in R 2. If you have heard of a metric space before, the function d(z 1, z 2 ) = z 1 z 2 defines a metric on C. If you haven t heard of metrics before, intuitively speaking, a metric provides a way to measure distance on a set. Metrics must satisfy certain axioms, which we omit here, and one can prove a variety of fairly general facts about metric spaces. This is often covered in a topology or real analysis class. Since the absolute value on C defines a metric on C, we can talk about various topological notions on C, like open sets, closed sets, compactness, connectedness, etc. Again, all of these notions are defined in the more general setting of a topological space, which is covered in a first class on topology, but we do not assume prior knowledge of that subject here. Instead we will just give the specific definitions and properties (omitting proofs if they are long) that we need. Suppose z 0 is a fixed complex number and r an integer. Then the open disc or open ball centered at z 0 of radius r is the set of complex numbers 1

2 TOPOLOGY, LIMITS OF COMPLEX NUMBERS D r (z 0 ) = {z C z z 0 < r}. Geometrically, an open ball centered at z 0 is just an open disc centered at z 0 in the complex plane. Notice that the inequality z z 0 < r is strict; this is in contrast to a closed ball centered at z 0 of radius r, which is the set of complex numbers D r (z 0 ) = {z C z z 0 r}. This is just a closed disc of radius r in the complex plane centered at z 0. Notice that the closed disc contains all of its boundary points, while the open disc contains none of its boundary points. We will repeatedly use open and closed discs for the remainder of this class, so that is why we use shorthand notation for these sets. Let Ω be a subset of C. Given any z 0 Ω, we call z 0 an interior point of Ω if there exists some r 0 > 0 such that D r0 (z 0 ) Ω. Intuitively, z 0 is an interior point of Ω if it belongs to Ω but does not lie on its boundary. For example, one quickly checks that any point on the boundary of a closed disc is not an interior point, because any open ball centered at such a point will always contain points outside the closed disc. If Ω is a subset of C such that every point of Ω is an interior point, then we call Ω an open set. If Ω is a subset of C such that C Ω (the complement of Ω in C) is open, then we call Ω an closed set. Intuitively speaking, open sets contain none of the points on their boundary, while closed sets contain all of the points on their boundary. Both the empty set and all of C are considered both open and closed. Open discs are open sets. Indeed, given any point z 0 in an open disc Ω of radius r, we can find some r 0 small such that D r0 (z 0 ) Ω. (For example, choose r 0 to be half the difference of the distance of z 0 from the center of Ω and r.) Sets like Re z > c, Im z > c where c is a constant real number are open sets. Closed discs are closed sets. Indeed, it is obvious that the complement of a closed disc is open. Sets like Re z c, Im z c are closed sets. Finite collections of single points are closed. Obviously, there are some infinite collections of single points which are not closed. There are many sets which are neither open nor closed. For example, the open disc of radius 1 centered at 0 together with 1 is neither open nor closed. There is an alternate characterization of closed sets which is frequently useful. Let Ω be any subset of C. If z n is a sequence of points in Ω converging to some point z C with z n z for all n, then we call z a limit point of Ω. Intuitively, a limit point of a set is a point which can be approximated arbitrarily closely by other points in that set. Notice that a limit point of Ω may or may not be a point of Ω itself. Then one can show that a closed set Ω is a set which contains all of its limit points (indeed, this is done in introductory topology classes). In other words, any point which can be approximated arbitrarily closely by elements of a closed set must belong to the closed set itself. More generally, if Ω is any set, then the union of Ω with all of its limit points is called the closure of Ω, and is written Ω. Again, many properties of the closure of a set are proven in an introductory topology class. For

TOPOLOGY, LIMITS OF COMPLEX NUMBERS 3 example, one can show that the closure of any set Ω is closed (hence the name), and that it is also the smallest closed set containing Ω, in the sense that it is the intersection of all closed sets containing Ω. The boundary of a set Ω is the closure of Ω minus its interior, and is often written Ω. Example. Consider the open disc D = D 1 (0) of radius 1 centered at the origin. This set is evidently not closed. Notice that the sequence of points 0, 1/2, 2/3, 3/4,... in D has limit point 1, which is not in D. The closure of D is the closed disc of radius 1 centered at the origin. Let Ω be any set in C. We say that Ω is bounded if there exists some real number M such that z < M for all z Ω. In other words, no part of Ω gets infinitely far from the origin. Alternately, Ω is bounded if we can find a (large) disc which contains all of Ω. Also, if Ω is bounded, then we define the diameter to be the supremum of z 1 z 2 as z 1, z 2 Ω. In other words, the diameter of Ω is the smallest real number which upper bounds the distances of any two points in Ω. A closed disc of radius r has diameter 2r, since any two points in such a disc are separated by a distance at most 2r, and and the distance of 2r is actually achieved by points on opposite ends of a diameter of the disc. The diameter of a set does not actually have to be achieved as the distance between two points in that set. For example, an open disc of radius r also has diameter 2r, but there are no two points in such a disc whose distance is equal to 2r. Nevertheless, we can find points in the disc whose distances get arbitrarily close to 2r. If Ω is both closed and bounded, then we call Ω compact. Compact sets have many special and useful properties, which are again proven in introductory topology classes. We list them here without proof. Let U α be a collection of open sets whose union contains a compact set Ω. Then there exists a finite subcollection of the U α whose union contains Ω. (This is often phrased as saying that any open cover of a compact set contains a finite subcover. This property is usually taken as the definition of a compact set.) If Ω is a compact set in C, then any sequence of points in Ω contains a subsequence which converges to some point in Ω. (This is Theorem 1.2 of the text.) A property which we will make use of in a few weeks is the following: suppose we have a nested sequence of non-empty compact sets K 1 K 2 K 3... with diam(k n ) 0 as n. Then there exists a unique point w contained in every K n. For a proof, see the text (Proposition 1.4). We will show that each of the three properties fails for suitable choices of non-compact sets. For example, let Ω be the open disc of radius 1 centered at 0. Then consider the open cover of Ω consisting of the discs D (n 1)/n (0) of

4 TOPOLOGY, LIMITS OF COMPLEX NUMBERS radius 1 1/n centered at 0. Every point of Ω lies in one of these discs, so this does indeed form an open cover, but there is no finite subcover, because any finite subcover will contain a disc of largest radius 1 1/k, say, and then any point of Ω of distance between 1 1/k and 1 will not lie in this finite subcover. This argument fails for the closed disc of radius 1 since then the collection of open sets D (n 1)/n (0) does not contain any of the points on the boundary of Ω. It is easy to think of a sequence of points in the open disc Ω above which has no subsequence converging to a point of Ω. For example, 0, 1/2, 2/3, 3/4,... works, as the only possible limit point of this sequence is 1, which does not lie in Ω. Finally, it is possible to have a nested sequence of open sets with diameter approaching 0 whose intersection contains no points. For example, let U n = (0, 1/n) (0, 1/n). These are nested open sets whose diameter approaches 0, but there is no point inside each of these sets. There is one final important topological definition which we will frequently use. Let Ω be an open set. We call Ω connected if it is not possible to find two disjoint, non-empty open sets Ω 1, Ω 2 Ω such that Ω = Ω 1 Ω 2. Intuitively speaking, a connected set contains a single piece (the proper term is connected component ). Alternately, we say that an open set Ω in C is path-connected if given any two points z 1, z 2 Ω, we can find a path connecting z 1 to z 2 contained entirely in Ω. (Formally speaking, a path is a continuous function γ : [0, 1] C, and its graph is the path connecting z 1 to z 2.) For open sets in C, the properties of being connected and pathconnected are equivalent. As a matter of fact, the property of an open set Ω being connected is equivalent to the fact that any two points in Ω can be joined by a path consisting only of horizontal and vertical line segments. It is possible to define a notion of connectedness for arbitrary sets, but for our purposes we will only need to know what connected means for closed sets. A closed set Ω C is connected if it is impossible to find two non-empty disjoint closed sets Ω 1, Ω 2 C such that Ω = Ω 1 Ω 2. Open and closed discs are connected. The half-planes Re z > c, Im z > c are connected. However, the set consisting of points z such that Re z > 1 or Re z < 0 is not connected. The annulus 1 < z < 2 is connected. The interiors of polygons are connected. We will very frequently find ourselves studying functions defined on an open connected non-empty set Ω. For the rest of this class, we will call an open connected set in C a region of C. Be aware that outside of this class, it is entirely possible that a region can refer to a set which might not be open (or, more rarely, not connected)! But for the entirety of this class (and in the textbook), a region will always be an open connected non-empty set in C. This concludes the topology which we will need. Even though there is a lot we are skimming over, an intuitive grasp of the definitions and familiarity with the examples

TOPOLOGY, LIMITS OF COMPLEX NUMBERS 5 listed above (try to think of a few other examples which illustrate these definitions on your own) should be sufficient for this class.