# Connectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).

Size: px
Start display at page:

Download "Connectedness. Proposition 2.2. The following are equivalent for a topological space (X, T )."

Transcription

1 Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results. Roughly speaking, a connected topological space is one that is in one piece. The way we will define this is by giving a very concrete notion of what it means for a space to be in two or more pieces, and then say a space is connected when this is not the case. We will also explore a stronger property called path-connectedness. A path-connected space is one in which you can essentially walk continuously from any point to any other point. Along the way we will see some novel proof techniques and mention one or two well-known results as easy corollaries. We will also have occasion to define one of the more novel standard spaces that topologists use, called the Topologist s Sine Curve. 2 Basic definitions and examples Recall that the notation A B (ie. instead of ) is used to denote a union in which A and B are disjoint. Definition 2.1. A topological space (X, T ) is said to be disconnected if there exist disjoint nonempty subsets A, B X such that X = A B, and A B = A B =. If (X, T ) is not disconnected, it is said to be connected. Just like with compactness we will often refer to subsets of topological spaces being connected, and in doing so we mean that the subset with its subspace topology is connected. Before going on, we state some of the many equivalent forms of this definition. The proof that these are all equivalent is basically immediate. Proposition 2.2. The following are equivalent for a topological space (X, T ). 1. (X, T ) is disconnected. 2. There exist nonempty, disjoint, open sets A, B X such that X = A B. 3. There exist nonempty, disjoint, closed sets A, B X such that X = A B. 4. There is a nontrivial clopen subset of X. That is, there is a subset A X that is both open and closed, and A is not X or. Proof. Exercise. X. A pair of sets A, B X witnessing that X is disconnected is often called a disconnection of 1

2 Without further ado, here are see some examples. These results should all feel true given your natural intuition about spaces being in one or more pieces, though some of their proofs are not obvious (and will follow from our subsequent discussions). Example R usual is connected, as is R n usual for all n, and even RN prod. 2. Any interval in R is connected (ie. any set of the form (a, b), (a, b], [a, b), or [a, b] for a < b R). 3. S 1 (the unit circle in R 2 ) is connected. 4. R 2 \ {(0, 0)} with its usual subspace topology is connected. 5. More generally, if A R 2 is countable, then R 2 \ A is connected. In particular, R 2 \ Q 2 is connected. (Careful, this is not the set of all points with both coordinates irrational; it is the set of points such that at least one coordinate is irrational.) 6. Any hyperconnected space is trivially connected. (Recall that a space is hyperconnected if any pair of nonempty open sets intersect.) In particular, for any set X, (X, T indiscrete ) is connected, as are (R, T ray ), (R, T 7 ) and any other particular point topology on any set, the co-countable and co-finite topologies on uncountable and infinite sets, respectively, etc. 7. R Sorgenfrey is disconnected. In fact any zero dimensional space (that is not indiscrete) is disconnected, as is easy to see. (Recall that a topological space is zero dimensional if it has a basis consisting of clopen sets.) 8. If X is a set with more than one point, (X, T discrete ) is disconnected. 9. ω + 1, ω 1 and ω are all disconnected, since in each space the minimal element of the order is clopen as a singleton. More generally, any well-order with its order topology is disconnected (provided that it contains more than one point). 10. R \ {0} (with its usual subspace topology) is disconnected. If you have been doing the exercises on the Big List, you will recognize that 0 (or indeed any real number) is a cut point of R usual. 11. R 2 \ {the x-axis} is disconnected. 12. R N box is disconnected, though it may not seem as though it should be. The collections of bounded and unbounded sequences form a disconnection. Checking this will be on the Big List. We prove the most important of these results first, and from its proof derive a much more general result without much difficulty. This proof should remind you, at least superficially, of the creeping along proof that [0, 1] is compact. 2

3 Theorem 2.4. R usual is connected. Proof. This is a proof by contradiction, so we begin by assuming that R is disconnected. Then there is an open subset X such that R \ X is also open, and both are nonempty. Let a X and b R \ X, and suppose without loss of generality that a < b. Define a subset A of X by: A := { x X : x < b } or in other words, A = X (, b]. Note that A is nonempty since a A, and clearly A is bounded above (by b, for example), so A has a least upper bound; call it p = sup A. Suppose p X, which in particular implies that p < b. Since X is open there is some ɛ > 0, which we may assume is less than b p, such that (p ɛ, p + ɛ) X. But then any t (p, p + ɛ) would be in A, contradicting the fact that p is an upper bound of A. This means p R \ X which by assumption is also open, and so again there is ɛ > 0 such that (p ɛ, p + ɛ) R \ X. But then any number t (p ɛ, p) would be a strictly smaller upper bound for A, contradicting the fact that p is the least upper bound of A. So in summation we have shown that p cannot be in X or in R \ X, which is certainly impossible. Not so hard, right? Examining this argument brings up an interesting question though: what properties of R usual did we actually use in the proof? It looks like we used the fact that the topology is generated by a metric, but if you think about it carefully you will discover that this was not actually necessary. For example when we assumed p X, we obtained an open subset U (which happened to be a metric ball) such that p U X, and found an element larger than p inside U. We were really using the fact that R is a dense linear order. We also made use of the ability to find a least upper bound of A. These observations lead us to the following definitions for a linear order. Definition 2.5. Let (L, ) be a linear order. (L, ) is called Dedekind complete if every nonempty subset of L that is bounded above has a least upper bound (all in the sense of ). (L, ) is said to have a gap if there exist elements a < b L such that (a, b) =. Conversely, (L, ) has no gaps if between every pair of elements of L there is another element of L. And these in turn lead us to the following theorem. Well, half of the following theorem. Theorem 2.6. Let (L, ) be a linear order, thought of as a topological space with its order topology. Then L is connected if and only if it is Dedekind complete and has no gaps. Proof. The ( ) direction of this proof is exactly the one we just gave for R. ( ). Exercise. 3

4 I present Theorem 2.6 not because it is of critical importance for us, but because it is a good illustration of how some topological properties get defined in the first place. We did a proof which looked simple, then stared at it until we were able to extract the precise conditions required to repeat the same argument in a more general context. We even got a nice surprise at the end, which is that we actually characterized connectedness in linear orders, instead of just finding condition that implies connectedness in linear orders. One direct benefit of Theorem 2.6 for us is that it lets us state the following result essentially for free. Theorem 2.7. A subspace of R is connected if and only if it is an interval. Proof. Exercise. This should be very easy given the previous result. Here is one thing to be cautious of though. This theorem implies that (0, 1) is connected, for example. When you think about (0, 1) you may think it is not Dedekind complete, since (0, 1) is bounded in R and yet has no upper bound in (0, 1). Remember, however, that (0, 1), when thought of as a linear order in isolation, has no upper bound. So, for example, the set { 1 1 n : n N } (0, 1) is unbounded in this order. The fact that it has no upper bound in (0, 1) does not break Dedekind completeness. Before we go on to talk about properties of connectedness and more complex connected spaces, we state the most useful alternative characterization of connectedness. This may not seem like the most useful way of thinking of connectedness yet, but it will after using it for a bit shortly. Proposition 2.8. A topological space (X, T ) is connected if and only if every continuous function f : X {0, 1} is constant (where {0, 1} has the discrete topology). Proof. This is quite simple. Note that a function that maps into {0, 1} is either constant or surjective. ( ). We prove this by contrapositive. If f : X {0, 1} is surjective, then f 1 ({0}) and f 1 ({1}) are disjoint, nonempty, open sets, and therefore form a disconnection of X. ( ). We also prove this by contrapositive. Suppose A, B X are disjoint, nonempty, open sets that form a disconnection of X. Define f : X {0, 1} by 0 x A f(x) = 1 x B Then it is easy to check that f is continuous and surjective. 4

5 3 Properties of connectedness We have an established series of tests to which we subject new topological properties, and connectedness should be no exception. Our first question should be whether connectedness is a topological invariant. It is, of course, and in fact we can even show more. Proposition 3.1. Let (X, T ) be connected, (Y, U) be a topological space, and suppose f : X Y is a continuous surjection. Then Y is connected. Proof. Suppose for the sake of contradiction that Y is disconnected. Then by Proposition 2.8 there exists a continuous surjection g : Y {0, 1}. But then g f : X {0, 1} is also a continuous surjection (check this!) contradicting the assumption that X is connected. Compactness also had this property. As we remarked then, a topologist would phrase the result of this proposition as continuous images of connected spaces are connected. See how little we had to do as a result of Proposition 2.8? Proposition 3.2. Connectedness is not hereditary. Proof. R usual is connected, but {0, 1} R is discrete with its subspace topology, and therefore not connected. Proposition 3.3. Let (X, T ) be a topological space, and let A, B X be connected subsets. Then neither A B nor A B need be connected. Proof. Consider the graphs of the functions f(x) = x 2 1 and g(x) = x 2 + 1, as subsets of R 2 usual. Both of these subsets are connected (being continuous images of R), but their intersection is the two-point discrete set {( 1, 0), (1, 0)}. The case for unions is even simpler. Simply take two different points in R usual. They are connected as singletons, but their union is a two-point discrete set. The previous result is not particulary interesting, but it leads us to somewhere nice. We just saw that a union of two connected sets need not be connected, but a union of connected sets that share a point in common is connected. This should be pretty intuitive, and it is another example of a proof made very easy by Proposition 2.8. Proposition 3.4. Let (X, T ) be a topological space, and suppose A = { A α : α I } is a nonempty collection of nonempty connected subsets of X, with the additional property that A = α I A α. Then A is connected. Proof. Fix a point a A. Now let f : A {0, 1} be a continuous function. Our goal is to show that f is constant. 5

6 Note that for each α I, the restriction of f to A α is also continuous and therefore constant since A α is connected. Pick two points x, y A. Then x A α and y A β for some α, β I. Then by the remark we just made, we have: f(x) = f(a) = f(y), since a A α and a A β. Since we can do this for any two points, it easily follows that f must be constant. This result is extremely useful for the issue of productivity. It basically lets you glue together connected sets and guarantees you will get a connected set at the end as long as all the pieces share a point. Proposition 3.5. Connectedness is finitely productive. Proof. As usual, we prove that a product of two connected spaces is connected, from which the general result follows inductively. During this argument, you are strongly encouraged to follow along with a picture of the case where X = Y = R usual. Let (X, T ) and (Y, U) be connected topological spaces, and we show that X Y with its product topology is connected. We will make use of the elementary fact that for all x X, Y {x} Y, and similarly for all y Y, X X {y} (where these subsets of X Y have their subspace topologies inherited from the product topology). Let f : X Y {0, 1} be a continuous function. We will show that f is constant by showing that f((x 1, y 1 )) = f((x 2, y 2 )) for all (x 1, y 1 ), (x 2, y 2 ) X Y. Fix two such points arbitrarily. Then note that A 1 = {x 1 } Y and A 2 = X {y 2 } are connected subsets of X Y (being homeomorphic to Y and X, respectively) that contain (x 1, y 1 ) and (x 2, y 2 ), respectively. Also note that (x 1, y 2 ) A 1 A 2. Therefore by Proposition 3.4, A 1 A 2 is a connected subset of X Y. Then f must be constant when restricted to A 1 A 2, and in particular this means that f((x 1, y 1 )) = f((x 2, y 2 )), as required. Corollary 3.6. R n usual is connected for all n > 1, as are all metric balls in these spaces. What about higher products? Well, there s good news. Proposition 3.7. Connectedness is productive. Proof. Exercise. This is not as scary as it looks. The proof is the same in spirit as the proof given above for finite products. There is just a bit more bookkeeping to do. 4 Some applications The first and most notable application of the theory we have built around connectedness is the following result. 6

7 Proposition 4.1. Let (X, T ) be a connected topological space and suppose f : X R usual is a continuous function. If a < b are two distinct numbers in f(x), then there is an x X such that a < f(x) < b. Proof. By proposition 3.1, f(x) is connected. By Theorem 2.7 this means f(x) is an interval, from which the result follows immediately. (Take a moment to think about how you can generalize the proposition. In particular, what sort of object can you put in place of R usual that keeps the result true?) This is a slightly more general version of a result with which you should already be very familiar... Corollary 4.2 (Intermediate Value Theorem). Let f : [a, b] R be a continuous function, such that f(a) < f(b). Then for every v (f(a), f(b)), there is a c (a, b) such that f(a) = v. From Proposition 2.2, we can see that if (X, T ) is a connected topological space and A X is a nonempty clopen subset, then it must be that A = X. A notable use of this technique can be found in complex analysis. We will briefly outline this below. We think of the complex plane as a topological space by identifying C with R 2 in the usual way. Definition 4.3. Let D C be an open, connected set. A function f : D C is called analytic if for every z D there is an ɛ > 0 such that f has a complex power series representation on B ɛ (z). Theorem 4.4. Let D C be an open, connected set, and let f : D C be an analytic function. Let A = { z D : f(z) = 0 } be its zero set. If A is non-discrete (as a topological subspace), then f(z) = 0 for all z D. Proof. We just sketch out the proof here. Define the set: { } B = z D : f (k) (z) = 0 for all k 0, (where by f (k) we mean the k th derivative of f). The proof actually shows that B = D (which obviously implies A = D since B A) in three steps. First show that B, then that B is both open and closed. Claim. B. Proof. This is actually the tricky part. Since A is not discrete as a subspace, there is a point z 0 A such that any open subset of C containing z 0 also contains other elements of A. Another way of saying this is that z 0 A \ {z 0 }. Since C is first countable, we can find a sequence {z n } n N in A \ {z 0 } that converges to z 0. Note that by definition of A, this means f(z 0 ) = f(z n ) = 0 for all n N. We show that z 0 B. 7

8 Suppose not. Then there is a least k N such that f (k) (z 0 ) 0. Since f analytic, it is equal to a complex power series f(z) = a n (z z 0 ) n, n=0 on some ɛ-ball around z 0, where a n = f (n) (z 0 ) n! are the usual Taylor series coefficients. By definition of k, we in fact have: f(z) = (z z 0 ) k g(z), where g is an analytic function such that g(z 0 ) 0. Now since z n z 0, there is some tail of this sequence inside the ɛ-ball around z 0 we are considering, and so for all n in this tail: 0 = f(z n ) = (z n z 0 ) k g(z n ). Since z n z 0 for all n, this means g(z n ) = 0 for all n in this tail of the sequence. But then we must have g(z 0 ) = 0 since g is continuous, which is a contradiction. Claim. B is open. Proof. Let z B. Then f (k) (z) = 0 for all k 0, and since f equals its Taylor series on an ɛ-ball around z, its Taylor series is identically zero on that ball. Claim. B is closed. Proof. This is essentially the same argument as the previous claim, but instead you show that D \ B is open. 5 Path-connectedness This property is in many ways even more intuitive than connectedness, since it formalizes the intuitive feeling of being able to walk from any point to any other point in a set. This gives us a useful proof technique. Definition 5.1. Let (X, T ) be a topological space. A path in X is a continuous function p : [0, 1] X. More specifically, given two points a, b X, a path p in X such that p(0) = a and p(1) = b is called a path from a to b. The image of a path is what you intuitively think of as a path: essentially a curve in X. Note that the image of a path is always connected, by Proposition 3.1 Definition 5.2. A topological space (X, T ) is called path-connected if for any distinct a, b X, there is a path from a to b. 8

9 An important thing to note is that we can glue paths together to get new paths. In other words if in a space (X, T ) we have a path p 1 from a to b, and a path p 2 from b to c, then we can easily glue them together to make a path from a to c, in the following way. Define p : [0, 1] X by: p 1 (2x) x [0, 1 2 p(x) = ] p 2 (2x 1) x [ 1 2, 1] p is simply the path in which we first follow p 1, then follow p 2, walking at twice the speed each time. Take a moment to convince yourself that this is well-defined, and that it is a path in X from a to c. Example R usual is path-connected. This is more or less immediate, since the closed interval between any two points is homeomorphic to [0, 1]. 2. R n usual is path-connected. To see this, note that any two points can be connected via a straight path to the origin. Gluing these two paths together makes a path from one point to the other. 3. R co-finite is path-connected. To see this most easily, let a, b R and let p : [0, 1] R co-finite be any injection such that p(0) = a and p(1) = b. Any closed subset of R co-finite is finite and so its preimage under p is a finite subset of [0, 1] and therefore closed, showing that p is continuous. (The set-theoretically minded reader will see something interesting happening here. This proof relied on the fact that p was injective. It would have still worked if p was finite-toone. But if X is a set with cardinality strictly less than the reals, such that there can be no injective or finite-to-one functions p : [0, 1] X, this proof cannot work. It turns out that such an infinite set with its co-finite topology will necessarily be connected but not path-connected. not path-connected.) For example, (N, T co-finite ) is connected hyperconnected, in fact but 4. Let M be the set of all 7 7 matrices with real coefficients. Think of M as R 49 usual in the natural way. Let L M be the collection of matrices all of whose elements have the same absolute value. That is: L = { A = (a ij ) M : a ij = a nm for all 1 i, j, m, n 7 } Then L is path-connected. Indeed, given any A L, let c be the common absolute value of its entries. Let p : [0, 1] R be a path from c to 0. Applying this path to each positive element of A, and a similar path from c to 0 to each negative entry of A, we can form a path joining A to the zero matrix. Therefore any two matrices can be joined by a path by gluing the paths that join each one to the zero matrix. 9

10 By now you may have guessed the following fact already. Proposition 5.4. Every path-connected topological space is connected. Proof. Suppose for the sake of contradiction that (X, T ) is path-connected but not connected. Then there is a nonempty open set A X such that X \ A is also open and nonempty. Let a A and b X \ A. Let p : [0, 1] X be a path from a to b. Then p([0, 1]), the image of the path, is a connected subset of X, but the sets p([0, 1]) A and p([0, 1]) (X \ A) form a disconnection of it, which is a contradiction. We already have an example illustrating that the converse is not true: (N, T co-finite ) is connected but not path-connected. The proof that it is not path-connected is a little lengthy, and we leave it for the Big List. Another much more important example of this is the following Example 5.5 (Topologist s Sine Curve). Be sure to draw a picture of this set. It is hard to understand without one. The Topologist s Sine Curve is a subspace S of R 2 usual defined as follows. Let f(x) = sin( π x ). S := { (x, f(x)) : 0 < x 1 } { (0, y) : 1 y 1 }. In other words, S is the graph of sin( π x ) from 0 up to and including and 1, along with a section of the y-axis between 1 and 1, inclusive. Note that S is a closed, bounded subset of R 2, and is therefore compact. Be sure to convince yourself it is closed. It is best to do this by convincing yourself that every convergent sequence from S converges to something in S (which is equivalent to being closed since R 2 is first countable). The section of the y-axis in S contains the limit points of the interesting convergent sequences from the graph part of S. S is connected. Clearly the two parts of S (the two parts in the definition of S above) are both path-connected, so the only hope of disconnecting S is to separate the two parts. However, any open set containing the y-axis part necessarily intersects the graph part. S is not path-connected, however. There are no paths from points in one part of S to the other part. Intuitively, a path that starts on the graph part is constrained to follow the graph, and in doing so can never get to the y-axis part. More technically, suppose p is a path from (1, 0) (in the graph part) to (0, 1) (in the y-axis part). In particular, this means p(1) = (0, 1). Then for each ɛ > 0 there should be a δ > 0 such that d(p(t), (0, 1)) < ɛ whenever 1 δ < t 1. But this is clearly impossible for an ɛ smaller than 2, given the oscillatory behaviour of sin( π x ). 10

### Metric spaces and metrizability

1 Motivation Metric spaces and metrizability By this point in the course, this section should not need much in the way of motivation. From the very beginning, we have talked about R n usual and how relatively

### Sequence convergence, the weak T-axioms, and first countability

Sequence convergence, the weak T-axioms, and first countability 1 Motivation Up to now we have been mentioning the notion of sequence convergence without actually defining it. So in this section we will

### CHAPTER 7. Connectedness

CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set

### Countability. 1 Motivation. 2 Counting

Countability 1 Motivation In topology as well as other areas of mathematics, we deal with a lot of infinite sets. However, as we will gradually discover, some infinite sets are bigger than others. Countably

### Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008

Math 541 Fall 2008 Connectivity Transition from Math 453/503 to Math 541 Ross E. Staffeldt-August 2008 Closed sets We have been operating at a fundamental level at which a topological space is a set together

### 1 The Local-to-Global Lemma

Point-Set Topology Connectedness: Lecture 2 1 The Local-to-Global Lemma In the world of advanced mathematics, we are often interested in comparing the local properties of a space to its global properties.

### STRONGLY CONNECTED SPACES

Undergraduate Research Opportunity Programme in Science STRONGLY CONNECTED SPACES Submitted by Dai Bo Supervised by Dr. Wong Yan-loi Department of Mathematics National University of Singapore Academic

### Nets and filters (are better than sequences)

Nets and filters (are better than sequences) Contents 1 Motivation 2 2 More implications we wish would reverse 2 3 Nets 4 4 Subnets 6 5 Filters 9 6 The connection between nets and filters 12 7 The payoff

### Def. A topological space X is disconnected if it admits a non-trivial splitting: (We ll abbreviate disjoint union of two subsets A and B meaning A B =

CONNECTEDNESS-Notes Def. A topological space X is disconnected if it admits a non-trivial splitting: X = A B, A B =, A, B open in X, and non-empty. (We ll abbreviate disjoint union of two subsets A and

### 1 Topology Definition of a topology Basis (Base) of a topology The subspace topology & the product topology on X Y 3

Index Page 1 Topology 2 1.1 Definition of a topology 2 1.2 Basis (Base) of a topology 2 1.3 The subspace topology & the product topology on X Y 3 1.4 Basic topology concepts: limit points, closed sets,

### After taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, inequality in analysis, we obtain.

Lecture 1: August 25 Introduction. Topology grew out of certain questions in geometry and analysis about 100 years ago. As Wikipedia puts it, the motivating insight behind topology is that some geometric

### Introductory Analysis I Fall 2014 Homework #5 Solutions

Introductory Analysis I Fall 2014 Homework #5 Solutions 6. Let M be a metric space, let C D M. Now we can think of C as a subset of the metric space M or as a subspace of the metric space D (D being a

### Topology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:

Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework

### Axioms of separation

Axioms of separation These notes discuss the same topic as Sections 31, 32, 33, 34, 35, and also 7, 10 of Munkres book. Some notions (hereditarily normal, perfectly normal, collectionwise normal, monotonically

### Topology, Math 581, Fall 2017 last updated: November 24, Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski

Topology, Math 581, Fall 2017 last updated: November 24, 2017 1 Topology 1, Math 581, Fall 2017: Notes and homework Krzysztof Chris Ciesielski Class of August 17: Course and syllabus overview. Topology

### POL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005

POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1

### MAT327 Big List. Ivan Khatchatourian Department of Mathematics University of Toronto. August 20, 2018

MAT327 Big List Ivan Khatchatourian Department of Mathematics University of Toronto August 20, 2018 This is a large, constantly growing list of problems in basic point set topology. This list will include

### CHAPTER 5. The Topology of R. 1. Open and Closed Sets

CHAPTER 5 The Topology of R 1. Open and Closed Sets DEFINITION 5.1. A set G Ω R is open if for every x 2 G there is an " > 0 such that (x ", x + ") Ω G. A set F Ω R is closed if F c is open. The idea is

### Metric Spaces Lecture 17

Metric Spaces Lecture 17 Homeomorphisms At the end of last lecture an example was given of a bijective continuous function f such that f 1 is not continuous. For another example, consider the sets T =

### 3 COUNTABILITY AND CONNECTEDNESS AXIOMS

3 COUNTABILITY AND CONNECTEDNESS AXIOMS Definition 3.1 Let X be a topological space. A subset D of X is dense in X iff D = X. X is separable iff it contains a countable dense subset. X satisfies the first

### The Axiom of Choice. Contents. 1 Motivation 2. 2 The Axiom of Choice 2. 3 Two powerful equivalents of AC 4. 4 Zorn s Lemma 5. 5 Using Zorn s Lemma 6

The Axiom of Choice Contents 1 Motivation 2 2 The Axiom of Choice 2 3 Two powerful equivalents of AC 4 4 Zorn s Lemma 5 5 Using Zorn s Lemma 6 6 More equivalences of AC 11 7 Consequences of the Axiom of

### We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.

### MATH 51H Section 4. October 16, Recall what it means for a function between metric spaces to be continuous:

MATH 51H Section 4 October 16, 2015 1 Continuity Recall what it means for a function between metric spaces to be continuous: Definition. Let (X, d X ), (Y, d Y ) be metric spaces. A function f : X Y is

Topology Math 467 2010 Conrad Plaut Contents Chapter 1. Background 1 1. Set Theory 1 2. Finite and Infinite Sets 3 3. Indexed Collections of Sets 4 Chapter 2. Topology of R and Beyond 7 1. The Topology

### MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets

MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets 1 Rational and Real Numbers Recall that a number is rational if it can be written in the form a/b where a, b Z and b 0, and a number

### Math 320-2: Final Exam Practice Solutions Northwestern University, Winter 2015

Math 30-: Final Exam Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A closed and bounded subset of C[0, 1] which is

### 2.23 Theorem. Let A and B be sets in a metric space. If A B, then L(A) L(B).

2.23 Theorem. Let A and B be sets in a metric space. If A B, then L(A) L(B). 2.24 Theorem. Let A and B be sets in a metric space. Then L(A B) = L(A) L(B). It is worth noting that you can t replace union

### AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES

AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES DUSTIN HEDMARK Abstract. A study of the conditions under which a topological space is metrizable, concluding with a proof of the Nagata Smirnov

### MH 7500 THEOREMS. (iii) A = A; (iv) A B = A B. Theorem 5. If {A α : α Λ} is any collection of subsets of a space X, then

MH 7500 THEOREMS Definition. A topological space is an ordered pair (X, T ), where X is a set and T is a collection of subsets of X such that (i) T and X T ; (ii) U V T whenever U, V T ; (iii) U T whenever

### MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017

MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A

### 6.2 Deeper Properties of Continuous Functions

6.2. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 69 6.2 Deeper Properties of Continuous Functions 6.2. Intermediate Value Theorem and Consequences When one studies a function, one is usually interested in

### Part III. 10 Topological Space Basics. Topological Spaces

Part III 10 Topological Space Basics Topological Spaces Using the metric space results above as motivation we will axiomatize the notion of being an open set to more general settings. Definition 10.1.

### Introduction to Proofs in Analysis. updated December 5, By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION

Introduction to Proofs in Analysis updated December 5, 2016 By Edoh Y. Amiran Following the outline of notes by Donald Chalice INTRODUCTION Purpose. These notes intend to introduce four main notions from

### 2. Prime and Maximal Ideals

18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let

### MA651 Topology. Lecture 9. Compactness 2.

MA651 Topology. Lecture 9. Compactness 2. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology

### Introduction to Dynamical Systems

Introduction to Dynamical Systems France-Kosovo Undergraduate Research School of Mathematics March 2017 This introduction to dynamical systems was a course given at the march 2017 edition of the France

### Topological properties

CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological

### Filters in Analysis and Topology

Filters in Analysis and Topology David MacIver July 1, 2004 Abstract The study of filters is a very natural way to talk about convergence in an arbitrary topological space, and carries over nicely into

### 5 Set Operations, Functions, and Counting

5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,

### NAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key

NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)

### P-adic Functions - Part 1

P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant

### 0. Introduction 1 0. INTRODUCTION

0. Introduction 1 0. INTRODUCTION In a very rough sketch we explain what algebraic geometry is about and what it can be used for. We stress the many correlations with other fields of research, such as

### Lecture 3: Sizes of Infinity

Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 3: Sizes of Infinity Week 2 UCSB 204 Sizes of Infinity On one hand, we know that the real numbers contain more elements than the rational

### UMASS AMHERST MATH 300 SP 05, F. HAJIR HOMEWORK 8: (EQUIVALENCE) RELATIONS AND PARTITIONS

UMASS AMHERST MATH 300 SP 05, F. HAJIR HOMEWORK 8: (EQUIVALENCE) RELATIONS AND PARTITIONS 1. Relations Recall the concept of a function f from a source set X to a target set Y. It is a rule for mapping

### Continuity. Chapter 4

Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of

### Introduction to Topology

Introduction to Topology Randall R. Holmes Auburn University Typeset by AMS-TEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about

### Part V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory

Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite

### 5.5 Deeper Properties of Continuous Functions

5.5. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 195 5.5 Deeper Properties of Continuous Functions 5.5.1 Intermediate Value Theorem and Consequences When one studies a function, one is usually interested

### CONSTRUCTION OF sequence of rational approximations to sets of rational approximating sequences, all with the same tail behaviour Deﬁnition 1.

CONSTRUCTION OF R 1. MOTIVATION We are used to thinking of real numbers as successive approximations. For example, we write π = 3.14159... to mean that π is a real number which, accurate to 5 decimal places,

### TOPOLOGY TAKE-HOME CLAY SHONKWILER

TOPOLOGY TAKE-HOME CLAY SHONKWILER 1. The Discrete Topology Let Y = {0, 1} have the discrete topology. Show that for any topological space X the following are equivalent. (a) X has the discrete topology.

### Linear Algebra, Summer 2011, pt. 2

Linear Algebra, Summer 2, pt. 2 June 8, 2 Contents Inverses. 2 Vector Spaces. 3 2. Examples of vector spaces..................... 3 2.2 The column space......................... 6 2.3 The null space...........................

### g 2 (x) (1/3)M 1 = (1/3)(2/3)M.

COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is

### Maths 212: Homework Solutions

Maths 212: Homework Solutions 1. The definition of A ensures that x π for all x A, so π is an upper bound of A. To show it is the least upper bound, suppose x < π and consider two cases. If x < 1, then

### 5. Connectedness. Corollary 5.4. Connectedness is a topological property.

5. Connectedness We begin our introduction to topology with the study of connectedness traditionally the only topic studied in both analytic and algebraic topology. C. T. C. Wall, 197 The property at the

### Week 6: Topology & Real Analysis Notes

Week 6: Topology & Real Analysis Notes To this point, we have covered Calculus I, Calculus II, Calculus III, Differential Equations, Linear Algebra, Complex Analysis and Abstract Algebra. These topics

### Continuity. Chapter 4

Chapter 4 Continuity Throughout this chapter D is a nonempty subset of the real numbers. We recall the definition of a function. Definition 4.1. A function from D into R, denoted f : D R, is a subset of

### 4 Countability axioms

4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said

### MATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION. Problem 1

MATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION ELEMENTS OF SOLUTION Problem 1 1. Let X be a Hausdorff space and K 1, K 2 disjoint compact subsets of X. Prove that there exist disjoint open sets U 1 and

### Notes on ordinals and cardinals

Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}

### NOTES FOR MAT 570, REAL ANALYSIS I, FALL Contents

NOTES FOR MAT 570, REAL ANALYSIS I, FALL 2016 JACK SPIELBERG Contents Part 1. Metric spaces and continuity 1 1. Metric spaces 1 2. The topology of metric spaces 3 3. The Cantor set 6 4. Sequences 7 5.

### Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product

### Assignment #10 Morgan Schreffler 1 of 7

Assignment #10 Morgan Schreffler 1 of 7 Lee, Chapter 4 Exercise 10 Let S be the square I I with the order topology generated by the dictionary topology. (a) Show that S has the least uppper bound property.

### Sequences. Chapter 3. n + 1 3n + 2 sin n n. 3. lim (ln(n + 1) ln n) 1. lim. 2. lim. 4. lim (1 + n)1/n. Answers: 1. 1/3; 2. 0; 3. 0; 4. 1.

Chapter 3 Sequences Both the main elements of calculus (differentiation and integration) require the notion of a limit. Sequences will play a central role when we work with limits. Definition 3.. A Sequence

### 1 Basic Combinatorics

1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set

### Economics 204 Summer/Fall 2017 Lecture 7 Tuesday July 25, 2017

Economics 204 Summer/Fall 2017 Lecture 7 Tuesday July 25, 2017 Section 2.9. Connected Sets Definition 1 Two sets A, B in a metric space are separated if Ā B = A B = A set in a metric space is connected

### Handout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1

22M:132 Fall 07 J. Simon Handout 2 (Correction of Handout 1 plus continued discussion/hw) Comments and Homework in Chapter 1 Chapter 1 contains material on sets, functions, relations, and cardinality that

### Error Correcting Codes Prof. Dr. P. Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore

(Refer Slide Time: 00:15) Error Correcting Codes Prof. Dr. P. Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore Lecture No. # 03 Mathematical Preliminaries:

### CHODOUNSKY, DAVID, M.A. Relative Topological Properties. (2006) Directed by Dr. Jerry Vaughan. 48pp.

CHODOUNSKY, DAVID, M.A. Relative Topological Properties. (2006) Directed by Dr. Jerry Vaughan. 48pp. In this thesis we study the concepts of relative topological properties and give some basic facts and

### Problem Set 2: Solutions Math 201A: Fall 2016

Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that

### Some Background Material

Chapter 1 Some Background Material In the first chapter, we present a quick review of elementary - but important - material as a way of dipping our toes in the water. This chapter also introduces important

### DR.RUPNATHJI( DR.RUPAK NATH )

Contents 1 Sets 1 2 The Real Numbers 9 3 Sequences 29 4 Series 59 5 Functions 81 6 Power Series 105 7 The elementary functions 111 Chapter 1 Sets It is very convenient to introduce some notation and terminology

### Notions such as convergent sequence and Cauchy sequence make sense for any metric space. Convergent Sequences are Cauchy

Banach Spaces These notes provide an introduction to Banach spaces, which are complete normed vector spaces. For the purposes of these notes, all vector spaces are assumed to be over the real numbers.

### Extension of continuous functions in digital spaces with the Khalimsky topology

Extension of continuous functions in digital spaces with the Khalimsky topology Erik Melin Uppsala University, Department of Mathematics Box 480, SE-751 06 Uppsala, Sweden melin@math.uu.se http://www.math.uu.se/~melin

### 2 Metric Spaces Definitions Exotic Examples... 3

Contents 1 Vector Spaces and Norms 1 2 Metric Spaces 2 2.1 Definitions.......................................... 2 2.2 Exotic Examples...................................... 3 3 Topologies 4 3.1 Open Sets..........................................

### Exam 2 extra practice problems

Exam 2 extra practice problems (1) If (X, d) is connected and f : X R is a continuous function such that f(x) = 1 for all x X, show that f must be constant. Solution: Since f(x) = 1 for every x X, either

### 1. Simplify the following. Solution: = {0} Hint: glossary: there is for all : such that & and

Topology MT434P Problems/Homework Recommended Reading: Munkres, J.R. Topology Hatcher, A. Algebraic Topology, http://www.math.cornell.edu/ hatcher/at/atpage.html For those who have a lot of outstanding

### Quick Tour of the Topology of R. Steven Hurder, Dave Marker, & John Wood 1

Quick Tour of the Topology of R Steven Hurder, Dave Marker, & John Wood 1 1 Department of Mathematics, University of Illinois at Chicago April 17, 2003 Preface i Chapter 1. The Topology of R 1 1. Open

### 8 Complete fields and valuation rings

18.785 Number theory I Fall 2017 Lecture #8 10/02/2017 8 Complete fields and valuation rings In order to make further progress in our investigation of finite extensions L/K of the fraction field K of a

### 1. Continuous Functions between Euclidean spaces

Math 441 Topology Fall 2012 Metric Spaces by John M. Lee This handout should be read between Chapters 1 and 2 of the text. It incorporates material from notes originally prepared by Steve Mitchell and

### Math 201 Topology I. Lecture notes of Prof. Hicham Gebran

Math 201 Topology I Lecture notes of Prof. Hicham Gebran hicham.gebran@yahoo.com Lebanese University, Fanar, Fall 2015-2016 http://fs2.ul.edu.lb/math http://hichamgebran.wordpress.com 2 Introduction and

### Metric Spaces and Topology

Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies

### The Lebesgue Integral

The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters

### MTG 5316/4302 FALL 2018 REVIEW FINAL

MTG 5316/4302 FALL 2018 REVIEW FINAL JAMES KEESLING Problem 1. Define open set in a metric space X. Define what it means for a set A X to be connected in a metric space X. Problem 2. Show that if a set

### ON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM

ON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM ALEXANDER KUPERS Abstract. These are notes on space-filling curves, looking at a few examples and proving the Hahn-Mazurkiewicz theorem. This theorem

### Proving languages to be nonregular

Proving languages to be nonregular We already know that there exist languages A Σ that are nonregular, for any choice of an alphabet Σ. This is because there are uncountably many languages in total and

### AN INTRODUCTION TO THE FUNDAMENTAL GROUP

AN INTRODUCTION TO THE FUNDAMENTAL GROUP DAVID RAN Abstract. This paper seeks to introduce the reader to the fundamental group and then show some of its immediate applications by calculating the fundamental

### LECTURE 6. CONTINUOUS FUNCTIONS AND BASIC TOPOLOGICAL NOTIONS

ANALYSIS FOR HIGH SCHOOL TEACHERS LECTURE 6. CONTINUOUS FUNCTIONS AND BASIC TOPOLOGICAL NOTIONS ROTHSCHILD CAESARIA COURSE, 2011/2 1. The idea of approximation revisited When discussing the notion of the

### Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers

Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Lecture 1 Real Numbers In these lectures, we are going to study a branch of mathematics called

### Slope Fields: Graphing Solutions Without the Solutions

8 Slope Fields: Graphing Solutions Without the Solutions Up to now, our efforts have been directed mainly towards finding formulas or equations describing solutions to given differential equations. Then,

### Austin Mohr Math 730 Homework. f(x) = y for some x λ Λ

Austin Mohr Math 730 Homework In the following problems, let Λ be an indexing set and let A and B λ for λ Λ be arbitrary sets. Problem 1B1 ( ) Show A B λ = (A B λ ). λ Λ λ Λ Proof. ( ) x A B λ λ Λ x A

### Short Introduction to Admissible Recursion Theory

Short Introduction to Admissible Recursion Theory Rachael Alvir November 2016 1 Axioms of KP and Admissible Sets An admissible set is a transitive set A satisfying the axioms of Kripke-Platek Set Theory

### 2. Metric Spaces. 2.1 Definitions etc.

2. Metric Spaces 2.1 Definitions etc. The procedure in Section for regarding R as a topological space may be generalized to many other sets in which there is some kind of distance (formally, sets with

### MAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9

MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended

### Then A n W n, A n is compact and W n is open. (We take W 0 =(

9. Mon, Nov. 4 Another related concept is that of paracompactness. This is especially important in the theory of manifolds and vector bundles. We make a couple of preliminary definitions first. Definition

### Math 3T03 - Topology

Math 3T03 - Topology Sang Woo Park April 5, 2018 Contents 1 Introduction to topology 2 1.1 What is topology?.......................... 2 1.2 Set theory............................... 3 2 Functions 4 3

### TOPOLOGY HW 2. x x ± y

TOPOLOGY HW 2 CLAY SHONKWILER 20.9 Show that the euclidean metric d on R n is a metric, as follows: If x, y R n and c R, define x + y = (x 1 + y 1,..., x n + y n ), cx = (cx 1,..., cx n ), x y = x 1 y

### {x : P (x)} P (x) = x is a cat

1. Sets, relations and functions. 1.1. Set theory. We assume the reader is familiar with elementary set theory as it is used in mathematics today. Nonetheless, we shall now give a careful treatment of

### Thus, X is connected by Problem 4. Case 3: X = (a, b]. This case is analogous to Case 2. Case 4: X = (a, b). Choose ε < b a

Solutions to Homework #6 1. Complete the proof of the backwards direction of Theorem 12.2 from class (which asserts the any interval in R is connected). Solution: Let X R be a closed interval. Case 1: