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.

Size: px
Start display at page:

Download "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."

Transcription

1 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 problems depend not on the exact shape of the objects involved, but rather on the way they are put together. For example, the square and the circle have many properties in common: they are both one dimensional objects (from a topological point of view) and both separate the plane into two parts, the part inside and the part outside. In other words, topology is concerned with the qualitative rather than quantitative aspects of geometric objects. The fundamental objects in topology are topological spaces and continuous functions ; both were defined in more or less their current form by Felix Hausdorff in Like the concept of a group in algebra, topological spaces are very useful for unifying different parts of mathematics: they show up naturally in analysis, geometry, algebra, etc. Most mathematicians therefore end up using both ideas and results from topology in their research. On the other hand, topologist nowadays do not study all possible topological spaces instead, they focus on specific classes such as 3-dimensional manifolds. In the course, we will look at the most important definitions and results from basic point set topology and elementary algebraic topology. Our textbook will be the second edition of Topology by James Munkres, but I will not present things in exactly the same order. Most of the homework questions, however, will be from the textbook. Metric spaces. The goal of today s class is to define topological spaces. Since it took people some time to find a good definition, let us try to retrace at least a small portion of this process. One concern of 19th century mathematics was to create rigorous foundations for analysis. This lead to the study of continuous and differentiable functions on subsets of the real line R and of Euclidean space R n. Here the notion of distance between points plays an important role: for example, a function f : R R is continuous if, for every x R and every real number ε > 0, one can find another real number δ > 0 such that f(y) f(x) < ε for every y R with y x < δ. By abstracting from the properties of distance in Euclidean space, people arrived at the idea of a metric space. Definition 1.1. Let X be a set. A metric on X is a function d: X X R with the following three properties: (a) One has d(x, y) 0 for every x, y X, with equality if and only if x = y. (b) d is symmetric, meaning that d(x, y) = d(y, x). (c) The triangle inequality: d(x, z) d(x, y) + d(y, z) for every x, y, z X. The pair (X, d) is then called a metric space. The name of the triangle inequality comes from the fact that, in a triangle in Euclidean space, the length of each side is smaller than the sum of the lengths of the two other sides. Drawing pictures in the plane can be useful to visualize what is going on but keep in mind that things like straight line or triangle do not make actually make sense in a general metric space. The only notions that make sense are those that can expressed in terms of distances between points. One such 1

2 2 notion, which is also useful in Euclidean space, is that of an open ball : if x 0 X is a point, and r > 0 a positive real number, the open ball of radius r and center x 0 is the set B r (x 0 ) = { x X d(x0, x) < r }. We can get some idea of what a given metric space looks like by visualizing open balls of different radii. Here are some examples of metric spaces: Example 1.2. Euclidean space R n with the usual notion of distance. Denote the points of R n in coordinates by x = (x 1, x 2,..., x n ), and define the length» x = x x2 n. Then the distance between two points x, y R n is given by» d(x, y) = x y = (x 1 y 1 ) (x n y n ) 2. It may seem pretty obvious that this satisfies the axioms for a metric, but let us make sure. In the first condition, d(x, y) 0 is clear from the definition; moreover, d(x, y) = 0 if and only if x i y i = 0 for every i = 1,..., n if and only if x = y. The second condition is also clear since (x i y i ) 2 = (y i x i ) 2. Checking that the third condition holds requires a little bit more work. We first prove the following inequality for lengths: (1.3) x + y x + y. After taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, where x y = x 1 y x n y n is the dot product. inequality in analysis, we obtain and therefore x y x y, x + y 2 x x y + y 2 = ( x + y ) 2, which proves (1.3). Returning to the third condition, we now have From the Cauchy-Schwarz d(x, z) = x z = (x y) + (y z) x y + y z = d(x, y) + d(y, z), and so the triangle inequality holds and d is a metric. Example 1.4. Another metric on R n is given by setting d(x, y) = max 1 i n x i y i. Unlike before, it takes almost no effort to verify all three axioms. The open balls in this metric are now actually open cubes. Example 1.5. Let X R 2 be the union of all the vertical lines x 1 = n and all the horizontal lines x 2 = n, for n Z. The taxicab metric on X is defined by setting d(x, y) = x 1 y 1 + x 2 y 2. Here is the proof of the triangle inequality: d(x, z) = x 1 z 1 + x 2 z 2 x 1 y 1 + y 1 z 1 + x 2 y 2 + y 2 z 2 = d(x, y) + d(y, z).

3 3 Example 1.6. Another interesting example is the railroad metric on R 2. Choose a point P R 2 in the plane, and define x y if the three points x, y, P are collinear, d(x, y) = x P + y P otherwise. To see the analogy with railroads, think of P as being the capital city of a country, in which all railroad lines go through the capital. I will leave it as an exercise to show that this defines a metric. Example 1.7. On an arbitrary set X, one can define the trivial metric 0 if x = y, d(x, y) = 1 if x y. In this case, open balls of radius 0 < r < 1 consist of only one point. The usual ε-δ-definition of continuity carries over to the setting of metric spaces. Suppose that (X, d X ) and (Y, d Y ) are two metric spaces. Definition 1.8. A function f : X Y is said to be continuous if, for every point x X and every real number ε > 0, one can find a real number δ > 0 such that d Y ( f(x), f(x ) ) < ε for every x X with d X (x, x ) < δ. More graphically, the condition says that f should map the entire open ball B δ (x) into the open ball B ε ( f(x) ). Equivalently, we can look at the preimage f 1 (B ε ( f(x) ) ) = { x X f(x ) B ε ( f(x) ) }, and the condition is that it should contain an open ball of some radius δ > 0 around the point x. Sets that contain an open ball around any of their points are called open ; this is the same use of the word open as in open intervals. The precise definition is the following. Definition 1.9. Let X be a metric space. A subset U X is called open if, for every point x U, there is some r > 0 such that B r (x) U. Note that the empty set is considered to be open: the condition in the definition is vacuous in that case. It is also obvious that X itself is always open. The following lemma shows that open balls as defined above are indeed open. Lemma In a metric space X, every open ball B r (x 0 ) is an open set. Proof. By picture. If x B r (x 0 ) is any point, then d(x, x 0 ) < r, and so the quantity δ = r d(x, x 0 ) is positive. Intuitively, δ is the distance from the point x 0 to the boundary of the ball. Now B δ (x) B r (x 0 ); indeed, if y B δ (x), then we have by virtue of the triangle inequality. d(y, x 0 ) d(y, x) + d(x, x 0 ) < δ + d(x, x 0 ) = r It is clear from the definition that if {U i } i I is any family of open subsets of X, indexed by some set I, then the union U i = { x X x Ui for some i I } i I

4 4 is again open. intersection Similarly, given finitely many open subsets U 1,..., U n X, the U 1 U n = { x X x Ui for every i = 1,..., n } is also open. In fact, if x U 1 U n, then x U i ; but U i is open, and so B ri (x) U i for some r i > 0. Now if we set r = min(r 1,..., r n ), then B r (x) U 1 U n, proving that the intersection is again an open set. Open sets can be used to give a criterion for continuity that does not depend on the actual values of the metric. Proposition Let f : X Y be a function between two metric spaces. Then f is continuous if and only if f 1 (U) is open for every open subset U Y. Proof. The proof is straightforward. Suppose first that f is continuous. Given an open set U Y, we need to show that the preimage f 1 (U) is again open. Take an arbitrary point x f 1 (U). Since f(x) U, and U is open, we can find ε > 0 with B ε ( f(x) ) U. By definition of continuity, there exists δ > 0 such that f ( B δ (x) ) B ε ( f(x) ) U; but then B δ (x) f 1 (U), and so f 1 (U) is an open set. To prove the converse, suppose that f satisfies ( the condition in the statement. Given x 0 X and ε > 0, the open ball B ε f(x0 ) ) is an open subset of Y by Lemma 1.10; its preimage ( f 1 ( B ε f(x0 ) )) is therefore an open subset of X. Since it contains the point x 0, it has to contain an open ball around x 0 ; but this means exactly that f ( B δ (x 0 ) ) B ε ( f(x0 ) ) for some δ > 0. In other words, f is continuous. The proposition shows that we can decide whether or not a function is continuous without knowing the metric; all we have to know is which subsets of X and Y are open. This makes continuity a topological notion, in the sense we talked about at the beginning of class. Topological spaces. We now come to the definition of topological spaces, which are the basic objects in topology. Rather than by a metric (which is something quantitative), a topological space is described by giving a collection of open sets (which is something qualitative). These open sets should behave in the same way as open sets in a metric space with respect to taking unions and intersections, and so we use those properties as axioms. Definition Let X be a set. A topology on X is a collection T of subsets of X with the following three properties: (a) T and X T. (b) If {U i } i I is a family of subsets of X with U i T for every i I, then U i T. i I (c) If U T and V T, then U V T.

5 5 The sets in T are called open, and the pair (X, T ) is called a topological space. By induction, the property in the third condition can easily be extended to all finite intersections: if U 1,..., U n T, then also U 1 U n T. Example Every metric space (X, d) is naturally a topological space: the socalled metric topology consists of all subsets that are open in the sense of Definition 1.9. We have already checked that all three conditions in the definition are satisfied. Note that different metric spaces can give rise to the same topological space. We will see many additional examples of topological spaces next time. Lecture 2: August 27 Today, we are going to look at many additional examples of topological spaces, to become familiar with the definition from last time. Let me first point out that Hausdorff s original definition contained the following additional condition, known as the Hausdorff axiom. Definition 2.1. A topological space (X, T ) is said to be Hausdorff if, for every pair of distinct points x, y X, there are open sets U, V T with x U, y V, and U V =. One often says that the two points x and y can be separated by open sets. The metric topology on a metric space (X, d) is always Hausdorff: if x, y X are two distinct points, then d(x, y) > 0; now the open balls of radius r = d(x, y)/2 around x and y are disjoint open sets separating x and y. (Indeed, if there was a point z B r (x) B r (y), then we would have d(x, z) < r and d(y, z) < r; by the triangle inequality, this would mean that 2r = d(x, y) < d(x, z) + d(z, y) = 2r, which is absurd.) Since most of our intuition is derived from metric spaces such as R n, the Hausdorff axiom looks very natural. The reason for not making it part of the definition nowadays is that certain classes of topologies most notably the ones used in algebra do not satisfy the Hausdorff axiom. Now on to some examples of topological spaces. We first observe that any set X can be made into a topological space in the following way. Example 2.2. Let X be a set. The trivial topology on X is the topology {, X}; in view of the conditions, it is the smallest possible topology. The discrete topology on X is the topology in which every subset of X is open; it is the largest possibly topology. Neither of these is very interesting. Here is a small example of a topological space where the Hausdorff axiom does not hold. Example 2.3. The Sierpiński space is the two-element set {0, 1}, with topology given by {, {1}, {0, 1} }. It is not a Hausdorff space, because the two points 0 and 1 cannot be separated by open sets in fact, the only open set containing the point 0 is {0, 1}. Every subset of a topological space can itself be made into a topological space; this is similar to the fact that every subset of a metric space is again a metric space.

6 6 Example 2.4. Let (X, T ) be a topological space. Given a subset Y X, we can put a topology on Y by intersecting the open sets in T with the subset Y. More precisely, the subspace topology on Y is defined to be T Y = { U Y U T }. You will easily be able to verify that this really is a topology. Note that unless Y T, the sets in T Y are not usually open in X; to avoid confusion, people sometimes use the expression open relative to Y for the sets in T Y. The notion of basis. In the examples above, we described each topological space by saying which sets belonged to the topology. Since this can be a little cumbersome, people often use a more efficient way of presenting this information: a basis. Here is the definition. Definition 2.5. Let (X, T ) be a topological space. A basis for the topology is a collection B of subsets of X with two properties: (1) Every set in B is open, hence B T. (2) Every set in T can be written as the union of sets in B. This usage of the word basis is different from the one in linear algebra, because a given open set is allowed to be a union of sets in B in many different ways. Example 2.6. Let (X, d) be a metric space. The collection of all open balls B = { B r (x 0 ) x0 X and r > 0 } is a basis for the metric topology: by definition, every open set can be written as a union of open balls; conversely, every open ball is an open set. Someone raised the question of whether the empty set is a union of open balls. The answer is yes: it is the union of zero many open balls. Another (and more efficient) choice of basis would be B = { B r (x 0 ) x0 X and r Q (0, ) }, using only those open balls whose radius is a rational number. Example 2.7. Let X be a set. The collection of all one-point subsets of X is a basis for the discrete topology. If we are given only the basis, we can recover the topology by taking all possible unions of sets in B. Here the following notation is convenient: given a collection C of subsets of X, define C = U X U C to be the union of all the members of C. If C is empty, let us agree that C is the empty set. The following result allows us to specify a topology on a set X in terms of a basis. Proposition 2.8. Let B be a collection of subsets of X with the following properties: (1) B = X; (2) for every U, V B, the intersection U V can be written as a union of elements of B. Then ß T (B) = C C B is a topology on X, and B is a basis for this topology.

7 7 Proof. Let us verify that T (B) is a topology on X. Since X = B and =, both the empty set and X itself are open. Moreover, any set in B is open, because U = {U}. It is obvious from the definition that arbitrary unions of open sets are again open. To check the condition on intersections, observe first that the intersection of any two sets in B is open: by assumption, it can be written as a union of sets in B. Now let U 1 = C 1 = V and U 2 = C2 = V C 1 be two arbitrary open sets; then U 1 U 2 = V W V C 1 W C 2 W C 2 W is a union of open sets, and therefore open. This shows that T (B) is a topology; that B is a basis is obvious, because every set in B is open, and every open set is a union of sets in B. The topology T (B) is sometimes called the topology generated by the basis B. From now on, we will usually describe topologies in terms of bases. Ordered sets and the order topology. A nice class of examples comes from linearly ordered sets. Definition 2.9. A relation < on a set X is called a linear order if it has the following properties: (a) For any pair of x, y X with x y, either x < y or y < x. (b) The relation x < x is never satisfied for any x X. (c) If x < y and y < z, then x < z. Given a linear order on X, we define x y to mean x < y or x = y. The three conditions together imply that, for every pair of elements x, y X, exactly one of the three relations x < y, y < x, x = y holds. We can therefore visualize a linear order by thinking of the elements of X as being lined up in increasing order from left to right. Example The usual order relation x < y on R is a linear order. Example The set {A, B,..., Z} of all uppercase letters is linearly ordered by the alphabetic order relation. Example The dictionary order on R 2 = R R is the following relation: (x 1, x 2 ) < (y 1, y 2 ) x 1 < y 1, or x 1 = y 1 and x 2 < y 2 You can easily check that this is a linear order. Given a linear order < on a set X, we can define open intervals (a, b) = { x X a < x < b } and open rays (a, ) = { x X a < x }, (, a) = { x X x < a }

8 8 just as in the case of the real numbers. As the word open suggests, they form the basis for a topology on X, the so-called order topology. Proposition Let < be a linear order on a set X, and let B be the collection of all open intervals, all open rays, and X itself. Then B is a basis for a topology on X. Proof. We have to check that the assumptions of Proposition 2.8 are satisfied. Since X B, we have B = X. Moreover, it is easy to see that the intersection of any two sets in B is again in B. According to Proposition 2.8, B is a basis for a topology on X. After class, somebody asked me whether we really needs the set X in B. The answer is yes, but only when X has exactly one element; as soon as X has at least two elements a < b, one has X = (, b) (a, ). Example Since R is both a metric space and a linearly ordered set, it has two topologies: the metric topology and the order topology. In fact, both have the same open sets, and are therefore equal. Let us prove this. If a set U is open in the metric topology, then it is a union of open balls; but every open ball B r (x 0 ) is also an open interval (x 0 r, x 0 +r), and so U is open in the order topology. Conversely, all open intervals and open rays are clearly open sets in the metric topology, and so every open set in the order topology is also open in the metric topology. Example What do open sets look like in the dictionary topology on R 2? The product topology. Let X and Y be two topological spaces. Their cartesian product X Y = { (x, y) x X and y Y } can again be made into a topological space in a natural way. Proposition The collection of all sets of the form U V, where U is an open subset of X and V is an open subset of Y, is a basis for a topology on X Y. Proof. Note that X Y belongs to our collection of sets, and that we have (U 1 V 1 ) (U 2 V 2 ) = (U 1 U 2 ) (V 1 V 2 ). The assertion therefore follows from Proposition 2.8. The topology in the proposition is called the product topology on X Y. Example Consider the real line R with its standard topology. The product topology on R R is the same as the metric topology; this can be proved in the same way as in Example 2.14 Lemma If B is a basis for the topology on X, and if C is a basis for the topology on Y, then B C = { B C B B and C C } is a basis for the product topology on X Y. Proof. By definition, every open set in X Y is a union of open sets of the form U V, with U open in X and V open in Y. It is therefore enough to show that U V can be written as a union of sets in B C. Since B is a basis for the topology on X, we have U = U i i I

9 9 for some collection {U i } i I of sets in B; for the same reason, V = j J V j for some collection {V j } j J of sets in C. This means that U V = i I j J is a union of sets in B C, as required. U i V j Closed sets, interior, and closure. Here are a few additional definitions that are useful when talking about general topological spaces. Definition Let X be a topological space. A subset A X is called closed if its complement X \ A is open. The word closed is used in the same way as in closed intervals, and is supposed to mean something like closed under taking limits ; this usage comes from analysis, where a subset A R is called closed if the limit of every convergent sequence in A also belongs to A. We shall come back to this point at the beginning of next class. Obviously, = X \ X and X = X \ are closed sets which makes those two sets both open and closed. The basic rules of set theory also imply that arbitrary intersections and finite unions of closed sets are again closed. The reason is that X \ A i = \ A i ), i I i I(X and that a union of open sets is again open. In fact, one could define topological spaces entirely in terms of closed sets. Definition Let Y X be a subset. The interior of Y is defined to be int Y = U; U Y open it is the largest open subset contained in Y. The closure of Y is defined to be A = A; it is the smallest closed set containing Y. A Y closed Intuitively, when we take the interior of a set, we are throwing away all points that lie at the edge of the set; when we take the closure, we add every possible point of this kind.

10 10 Lecture 3: September 3 Let me begin today s class by talking about closed sets again. Recall from last time that a subset A X of a topological space is called closed if its complement X \ A is open. We also defined the closure of an arbitrary subset Y X to be the smallest closed subset containing Y ; more precisely, Y = A A Y closed is the intersection of all closed sets containing Y. Intuitively, taking the closure means adding all those points of X that lie at the edge of Y ; the goal is to understand this operation better. Example 3.1. In a Hausdorff space X, every one-point set {x} is closed. We have to convince ourselves that X \ {x} is an open set. Let y X \ {x} be an arbitrary point. Since X is Hausdorff, we can find two disjoint open sets U and V with x U and y V. Clearly, V X \ {x}; this shows that X \ {x} is a union of open sets, and therefore open. Example 3.2. Let Y be a subset of a topological space X. Then a set A Y is closed in the subspace topology on Y if and only if A = Y B for some closed set B X. Note that this is not a definition, but a (very easy) theorem. Here is the proof: A is closed relative to Y if and only if Y \ A is open relative to Y if and only if Y \ A = Y U for some open set U X if and only if A = Y (X \ U). (The last step is easiest to understand by drawing a picture.) But if U is open, X \ U is closed, and so we get our result. As I mentioned last time, the word closed comes from analysis, where it means something like closed under taking limits. To help make the definition more concrete, let us now discuss the relationship between closed sets and limit points. If x X is a point in a topological space, an open set containing x is also called a neighborhood of x. We usually think of a neighborhood as being a small open set containing x but unless X is a metric space, this does not actually make sense, because we do not have a way to measure distances. Definition 3.3. Let Y be a subset of a topological space X. A point x X is called a limit point of Y if every neighborhood of x contains at least one point of Y other than x itself. Note that a point x Y may be a limit point of Y, provided that there are enough other points of Y nearby. An isolated point, however, is not considered to be a limit point. The following theorem describes the closure operation in terms of limit points. Theorem 3.4. Let Y be a subset of a topological space X. The closure of Y is the union of Y and all its limit points. Proof. Let us temporarily denote by Y the union of Y and all its limit points. To prove that Y = Y, we have to show two things: Y Y, and Y is closed. Since Y contains Y, this will be enough to give us Y = Y. Let us first prove that Y Y. Of course, we only have to argue that every limit point x of Y belongs to Y. The proof is by contradiction: if x Y, then the open

11 11 set X \ Y is a neighborhood of x, and therefore has to contain some point of Y ; but this is not possible because Y (X \ Y ) =. Next, let us show that Y is closed, or in other words, that X \ Y is open. Since a union of open sets is open, it will be enough to prove that for every x X \ Y, some neighborhood of x is contained in X \Y. Now x is clearly not a limit point of Y, and because of how we defined limit points, this means that some neighborhood U of x does not contain any point of Y other than possibly x itself. Since we also know that x Y, we deduce that U Y =. But then no point of U can be a limit point of Y (because U is open), and so U X \ Y. Sequences and limits. In metric spaces, the property of being closed can also be expressed in terms of convergent sequences. Let X be a metric space, and suppose that x 1, x 2,... is a sequence of points of X. We say that the sequence converges to a point x X, or that x is the limit of the sequence, if for every ε > 0, one can find an integer N such that d(x n, x) < ε for every n N. Note that a sequence can have at most one limit: if x is another potential limit of the sequence, the triangle inequality implies that d(x, x ) d(x, x n ) + d(x n, x ); as the right-hand side can be made arbitrarily small, d(x, x ) = 0, which means that x = x. In view of how the metric topology is defined, we can rephrase the condition for convergence topologically: the sequence x 1, x 2,... converges to x if and only if every open set containing x contains all but finitely many of the x n. This concept now makes sense in an arbitrary topological space. Definition 3.5. Let x 1, x 2,... be a sequence of points in a topological space. We say that the sequence converges to a point x X if, for every open set U containing x, there exists N N such that x n U for every n N. In that case, x is called a limit of the sequence. You should convince yourself that if x is a limit of a sequence x 1, x 2,..., then it is also a limit point of the subset {x 1, x 2,... }. (Question: What about the converse?) Unlike in metric spaces, limits are no longer necessarily unique. Example 3.6. In the Sierpiński space, both 0 and 1 are limits of the constant sequence 1, 1,..., because {0, 1} is the only open set containing the point 0. In a Hausdorff space, on the other hand, limits are unique; the proof is left as an exercise. Lemma 3.7. In a Hausdorff space X, every sequence of points has at most one limit. The following result shows that in a metric space, closed really means closed under taking limits. Proposition 3.8. Let X be a metric space. The following two conditions on a subset Y X are equivalent: (a) Y is closed in the metric topology.

12 12 (b) Y is sequentially closed: whenever a sequence x 1, x 2,... of points in Y converges to a point x X, one has x Y. Proof. Suppose first that Y is closed. Let x 1, x 2,... be a sequence of points in Y that converges to a point x X; we have to prove that x Y. This is pretty obvious: because Y is closed, the complement X\Y is open, and if we had x X\Y, then all but finitely many of the x n would have to lie in X \ Y, which they don t. Now suppose that Y is sequentially closed. To prove that Y is closed, we have to argue that X \Y is open. Suppose this was not the case. Because of how we defined the metric topology, this means that there is a point x X \ Y such that no open ball B r (x) is entirely contained in X \ Y. So in each open ball B 1/n (x), we can find at least one point x n Y. Now I claim that the sequence x 1, x 2,... converges to x: indeed, we have d(x n, x) < 1/n by construction. Because x X \ Y, this contradicts the fact that Y is sequentially closed. This also gives us the following description of the closure: if Y X is a subset of a metric space, then the closure Y is the set of all limit points of convergent sequences in Y. Unfortunately, Proposition 3.8 does not generalize to arbitrary topological spaces; you can find an example in this week s homework. Closed sets are always sequentially closed the first half of the proof works in general but the converse is not true. What made the second half of the proof work is that every point in a metric space has a countable neighborhood basis: for every point x X, there are countably many open sets U 1 (x), U 2 (x),..., such that every open set containing x contains at least one of the U n (x). In a metric space, we can take for example U n (x) = B 1/n (x). Topological spaces with this property are said to satisfy the first countability axiom. So Proposition 3.8 is true (with the same proof) in every topological space where the first countability axiom holds. If this axiom does not hold in X, then there are simply too many open sets containing a point x X to be able to describe closed sets in terms of sequences (which are by definition countable). Note. If X is first countable, then the collection B = { U n (x) x X and n 1 } is a basis for the topology on X. A stronger version of this condition is that X should have a basis consisting of countably many open sets; such spaces are said to satisfy the second countability axiom. Continuous functions and homeomorphisms. As suggested in the first lecture, we define continuous functions by the condition that the preimage of every open set should be open. Definition 3.9. Let (X, T X ) and (Y, T Y ) be two topological spaces. A function f : X Y is called continuous if for every U T Y. f 1 (U) = { x X f(x) U } TX

13 13 If the topology on Y is given in terms of a basis B, then it suffices to check the condition for U B; the reason is that ( ) f 1 U = f 1 (U). U C We could have just as well defined continuity used closed sets; the reason is that U C f 1 (Y \ A) = { x X f(x) A } = X \ f 1 (A). We have already seen that the topological definition is equivalent to the ε-δ one in the case of metric spaces; so we already know many examples of continuous functions from analysis. To convince ourselves that the topological definition is useful, let us prove some familiar facts about continuous functions in this setting. The first one is that the composition of continuous functions is again continuous. Lemma If f : X Y and g : Y Z are continous, then so is their composition g f. Proof. Let U Z be an arbitrary open set. Since g is continuous, g 1 (U) is open in Y ; since f is continous, (g f) 1 (U) = f 1( g 1 (U) ) is open in X. This proves that g f is continuous. In analysis, we often encounter functions that are defined differently on different intervals. Here is a general criterion for checking that such functions are continuous. Proposition 3.11 (Pasting lemma). Let X = A B, where both A and B are closed sets of X. Let f : A Y and g : B Y be two continuous functions. If f(x) = g(x) for every x A B, then the function f(x) if x A, h: X Y, h(x) = g(x) if x B is well-defined and continuous on X. Proof. We can prove the continuity of h by showing that the preimage of every closed set in Y is closed. So let C Y be closed. We have h 1 (C) = { x X h(x) C } = { x A f(x) C } { x B g(x) C } = f 1 (C) g 1 (C). Now f is continous, and so f 1 (C) is closed in the subspace topology on A; but because A is itself closed in X, this means that f 1 (C) is also closed in X. The same goes for g 1 (C), and so h 1 (C) is a closed set. Example Let us consider the example of a product X Y of two topological spaces (with the product topology). Denote by p 1 : X Y X and p 2 : X Y Y the projections to the two coordinates, defined by p 1 (x, y) = x and p 2 (x, y) = y. Then both p 1 and p 2 are continuous. This is easy to see: for instance, if U X is an open subset, then p 1 (U) = U Y is open by definition of the product topology.

14 14 Proposition A function f : Z X Y is continuous if and only if the two coordinate functions are continuous. f 1 = p 1 f : Z X and f 2 = p 2 f : Z Y Proof. One direction is easy: if f is continous, then f 1 and f 2 are compositions of continous functions, hence continuous. For the other direction, we use the definition. A basis for the product topology is given by sets of the form U V, with U X and V Y both open. Then f 1 (U V ) = { z Z f1 (z) U and f 2 (z) V } = f1 1 1 (U) f2 (V ) is the intersection of two open sets, hence open. Lecture 4: September 8 Homeomorphisms. As I mentioned in the first lecture, the purpose of topology is to look at qualitative properties of geometric objects that do not depend on the exact shape of an object, but more on how the object is put together. We formalized this idea by definiting topological spaces; but what does it mean to say that two different topological spaces (such as a circle and a square) are really the same? Definition 4.1. Let f : X Y be a bijective function between topological spaces. If both f and the inverse function f 1 : Y X are continuous, then f is called a homeomorphism, and X and Y are said to be homeomorphic. Intuitively, think of X as being made from some elastic material (like a balloon), and think of stretching, bending, or otherwise changing the shape of X without tearing the material. Any Y that you get in this way will be homeomorphic to the original X. Note that the actual definition is both more precise and more general, since we are allowing arbitrary functions. Suppose that f : X Y is a homeomorphism. For each open set U X, we are assuming that its inverse image under f 1 : Y X is open in X; but because f is bijective, this is the same as the image of U under f. In other words, a homeomorphism is a bijective function f : X Y such that f(u) is open if and only if U is open. We therefore get a bijective correspondence not only between the points of X and Y, but also between the open sets in both topologies. So any question about the topology of X or Y will have the same answer on both sides; we may therefore think of X and Y as being essentially the same topological space. Example 4.2. The real numbers R are homemorphic to the open interval (0, 1). One possible choice of homeomorphism is the function f : R (0, 1), f(x) = ex e x + 1 Both f and the inverse function f 1 (y) = log(y) log(1 y) are continuous. Example 4.3. Consider the function f : [0, 1) S 1, f(t) = (cos t, sin t) that takes the interval (with the subspace topology from R) to the unit circle (with the subspace topology from R 2 ). It is bijective and continuous, but not a homeomorphism: [0, 1/2) is open in [0, 1), but its image is not open in S 1.

15 15 Example 4.4. Let us classify the letters of the English alphabet A B C D E F G H I J K L M N O P Q R S T U V W X Y Z up to homeomorphism. Here we think of each letter as being made from line segments in R 2 ; the topology is the subspace topology. By inspection, there are eight homeomorphism classes, depending on the number of loops and line segments in each letter: B A R P Q D O C G I J L M N S U V W Z E F T Y H K X For example, W can be bent to make I, and so the two are homeomorphic. On the other hand, there is no homeomorphism between T and I: if we remove the crossing point, we are left with three intervals in the case of T, but removing one point from I produces at most two intervals. (Think about how one can say this in terms of the topology on each letter.) Topological manifolds. In the remainder of today s class, I want to introduce three additional examples of topological spaces. The first one is topological manifolds. A manifold is a space X that locally looks like Euclidean space: if you sit at any point of X, and only look at points nearby, you may think that you are in R n. Here is the precise definition. Definition 4.5. An n-dimensional topological manifold is a Hausdorff topological space X with the following property: every point x X has a neighborhood that is homeomorphic to an open subset in R n. In geometry, people look at other classes of manifolds that are obtained by working with a smaller class of functions. For example, if a function and its inverse function are both differentiable, it is called a diffeomorphism; differentiable manifolds are defined by replacing homeomorphic by diffeomorphic in the above definition. In algebraic geometry, there is a similar definition with polynomials. At this point, somebody asked why we need the Hausdorff condition; the answer is that we do not want to allow something like taking two copies of R and gluing them together along R \ {0}. (More about this example later on, when we discuss quotient spaces.) Later in the semester, we will show that an open subset in R n can never be homeomorphic to an open subset in R m for m n; this means that the dimension of a manifold really is a well-defined notion. Example 4.6. The square and the circle are both one-dimensional manifolds; a homeomorphism between them is given by drawing the square inside the circle and projecting one to the other from their common center. Example 4.7. The n-sphere S n = { (x 0, x 1,..., x n ) R n+1 x x x 2 n = 1 }, with the subspace topology coming from R n+1, is an n-dimensional manifold. Intuitively, this is clear; let me prove it for n = 2 by using stereographic projection. The plane z = 1 is tangent to the sphere at the south pole; given any point (x, y, z) not equal to the north pole (0, 0, 1), we can see where the line connecting (0, 0, 1) and (x, y, z) intersects the plane z = 1. In this way, we get a bijection f : S 2 \ {(0, 0, 1)} R 2.

16 16 It is easy to work out the formulas to see that f and its inverse are continuous. The points on the line are parametrized by (0, 0, 1) + t(x, y, z 1), with t R; the intersection point with the plane has 1 + t(z 1) = 1 or t = 2 1 z, which means that Å ã 2x f(x, y, z) = 1 z, 2y. 1 z One can show in a similar manner that f 1 is continuous. Since we can also do stereographic projection from the south pole, every point of S 2 has a neighborhood that is homeomorphic to R 2. Example 4.8. The inverse function theorem from analysis gives us one way to define manifolds. Suppose that f : R 2 R is a continuously differentiable function. The inverse function theorem says that if f(x 0, y 0 ) = 0, and if the partial derivative f/ y does not vanish at the point (x 0, y 0 ), then all nearby solutions of the equation f(x, y) = 0 are of the form y = ϕ(x) for a continously differentiable function ϕ: (x 0 ε, x 0 + ε) R with ϕ(x 0 ) = y 0. This function ϕ gives us a homeomorphism between a small neighborhood of the point (x 0, y 0 ) in the set f 1 (0) and an open interval in R. This shows that f 1 (0) is a one-dimensional manifold, provided that at least one of the two partial derivatives f/ x or f/ y is nonzero at every point of f 1 (0). Example 4.9. If M 1 and M 2 are manifolds of dimension n 1 and n 2, respectively, then their product M 1 M 2 (with the product topology) is a manifold of dimension n 1 + n 2. The proof is left as an exercise. For instance, the product S 1 S 1 is a two-dimensional manifold called the torus. An important general problem is to classify manifolds (or more general topological spaces) up to homeomorphism. In general, this is only possible if we impose sufficiently many other conditions (such as connectedness or compactness) to limit the class of topological spaces we are looking at. We will come back to this problem later in the semester. Quotient spaces and the quotient topology. In geometry, it is common to describe spaces by cut-and-paste constructions like the following. Example If we start from the unit square and paste opposite edges (with the same orientation), we get the torus. If we start from the closed unit disk in R 2 and collapse the entire boundary into a point, we obtain S 2. To make a Möbius band, we take a strip of paper, twist one end by 180, and then glue the two ends together. We can make a torus with two holes by taking two copies of the torus, removing a small disk from each, and then pasting them together along the two boundary circles. In each of these cases, the result should again be a topological space. To formalize this type of construction, we start with a topological space X and an equivalence relation on it; intuitively, tells us which points of X should be glued together. (Recall that an equivalence relation is the same thing as a partition of X into disjoint subsets, namely the equivalence classes; two points are equivalent if and

17 17 only if they are in the same equivalence class.) What we want to do is to build a new topological space in which each equivalence class becomes just one point. To do this, we let X/ be the set of equivalence classes; there is an obvious function p: X X/, which takes a point x X to the equivalence class containing x. Now there is a natural way to make X/ into a topological space. Proposition The collection of sets T = { U X/ p 1 (U) is open in X } defines a topology on X/, called the quotient topology. Proof. We have to check that the three conditions in the definition of topology are satisfied. First, p 1 ( ) = and p 1 (X/ ) = X, and so both and X/ belong to T. The conditions about unions and intersections follow from the set-theoretic formulas ( ) p 1 U i = p 1 (U i ) and p 1 (U V ) = p 1 (U) p 1 (V ) i I i I and the definition of T. With this definition, p becomes a continuous function. In fact, the quotient topology is the largest topology with the property that p is continous. Even when X is Hausdorff, the quotient X/ is not necessarily Hausdorff. Example Let us go back to the example of the line with two origins, made by gluing together two copies of R along R \ {0}. Here we can take X = {0, 1} R, and define the equivalence relation so that (0, t) (1, t) for every t 0. Most equivalence classes have two points, namely {(0, t), (1, t)} with t 0, except for {(0, 0)} and {(1, 0)}. The quotient space X/ is not Hausdorff (because the two equivalence classes {(0, 0)} and {(1, 0)} cannot be separated by open sets), but every point has a neighborhood homeomorphic to R. In fact, it is an interesting problem of finding conditions on X and that will guarantee that X/ is Hausdorff. This does happen in real life: I work in algebraic geometry, but in one of my papers, I had to spend about a page on proving that a certain quotient space was again Hausdorff. The most useful property of the quotient topology is the following. Theorem Let f : X Y be a continous function that is constant on equivalence classes: whenever x 1 x 2, one has f(x 1 ) = f(x 2 ). Then f induces a function f : X/ Y, which is continuous for the quotient topology on X/. If Y is Hausdorff, then X/ is also Hausdorff. Proof. The proof is left as an exercise. Product spaces and the product topology. We have already seen that the product of two topological spaces is again a topological space. Now we want to deal with the general case where we allow an arbitrary (and possibly infinite) number of

18 18 factors. So let (X i, T i ) be a collection of topological spaces, indexed by a (possibly infinite) set I. Consider the cartesian product X = i I X i = { (x i ) i I xi X i for every i I }, whose elements are all (generally infinite) families of elements x i X i, one for each i I. It is not completely obvious that X has any elements at all at least, this does not follow from the usual axioms of set theory. In addition to the Zermelo- Fraenkel axioms, one needs the so-called axiom of choice, which says that if X i for every i I, then X. Note. The axiom of choice claims that one can simultaneously choose one element from each of a possibly infinite number of nonempty sets. The problem is that we cannot just choose the elements arbitrarily, because we do not have enough time to make infinitely many choices. This axiom may seem very natural, but it has a large number of strange consequences. For example, you may have heard of the Banach-Tarski paradox: the axiom of choice implies that one can divide the threedimensional unit ball into finitely many pieces, and then put them back together in a different way and end up with a ball of twice the radius. This kind of thing lead to many arguments about the validity of the axiom, until it was proved that the axiom of choice is logically independent from the other axioms of set theory. Nowadays, most people assume the axiom of choice since it makes it easier to prove interesting theorems. We want to make X into a topological space. There are two different ways of generalizing the definition from the case of two factors. Definition The box topology on X is the topology generated by the basis ß U i U i T i for every i I. i I It is not hard to see that this is indeed a basis for a topology: it contains X, and since ( ) ( ) U i V i = U i V i, i I i I i I the intersection of any two basic open sets is again a basic open set. It it clear from the definition that the coordinate functions p j : X X j, p j ((x i ) i I ) = x i are continuous functions. The box topology is a perfectly good topology on X, but when I is infinite, it has a very large number of open sets, which leads to certain pathologies. (For example, it usually does not satisfy the first or second countability axiom.) We can get a better topology by putting some finiteness into the definition. Definition The product topology on X is the topology generated by the basis ß U i U i T i for every i I, and U i = X i for all but finitely many i I. i I

19 19 The difference with the box topology is that we are now allowed to specify only finitely many coordinates in each basic open set. The idea behind the product topology is that every set of the form p j (U) should be open (since we want p j to be continuous), and that finite intersections of open sets need to be open (since we want to have a topology). In fact, one can show that the product topology is the smallest topology on X that makes all the coordinate functions p j : X X j continous. Theorem If we give X the product topology, then a function f : Y X is continuous if and only if f i = p i f : Y X i is continous for every i I. Proof. The proof is the same as in the case of two factors. This nice result fails for the box topology. For that reason, we almost always use the product topology when talking about infinite products of topological spaces. Example Let X be the product of countably many copies of R, indexed by the set {1, 2,... }. The function f : R X, f(t) = (t, t,... ) is not continuous for the box topology, because ( Å f 1 1 n nã ), 1 = {0} is not open in R. n=1 Lecture 5: September 10 Now that we have seen several examples of topological spaces, it is time to begin our study of topology. The definition of a topological space is very broad, and there is not much that one can say in general. Instead, topologists focus on certain additional properties of topological spaces and try to prove interesting results about spaces that have those properties. The first two important properties that we are going to consider are connectedness and compactness. In a sense, they are generalizations of two important results from calculus, namely the intermediate value theorem and the maximum value theorem. Both have to do with a continuous function f : [a, b] R defined on a closed interval [a, b] R. The intermediate value theorem says that f takes on every value that lies between the values at the two endpoints: for every r between f(a) and f(b), there is some x [a, b] with f(x) = r. The maximum value theorem says that f has a maximum value: there is some x 0 [a, b] such that f(x 0 ) f(x) for every x [a, b]. In calculus, these results are usually viewed as properties of continuous functions; but they also reflect two properties of closed intervals in R, namely connectedness and compactness. Connectedness. Let X be a topological space. A pair of open sets U, V X with U V = X and U V = is called a separation of X, because it separates the points of X into two groups that have nothing to do with each other. Note that U = X \ V is both open and closed; a separation of X is therefore the same thing as a subset U X that is open and closed and not equal to or X. Definition 5.1. A topological space X is called connected if it has no separation.

20 20 Equivalently, X is connected if the only subsets that are both open and closed are and X itself. Connectedness depends only on the topology of X; if two topological spaces are homeomorphic, then they are either both connected or both not connected. Example 5.2. The three-point space {a, b, c} with the topology { }, {a}, {b}, {a, b}, {a, b, c} is connected, because {a, b, c} is the only open set containing the point c. Example 5.3. The space R \ {0} is not connected, because (, 0) and (0, ) form a separation. Example 5.4. The rational numbers Q (with the subspace topology coming from R) are not connected. In fact, the only connected subspaces of Q are the points, and so Q is what is called totally disconnected. To see why, suppose that X Q contains at least two points a < b. Let c be an irrational number with a < c < b; then X (, c) and X (c, ) form a separation of X. Example 5.5. The Cantor set is also totally disconnected. The real numbers R are an important example of a connected topological space. This is the content of the following theorem. Theorem 5.6. R is connected. Proof. The argument we are going to give depends on the following important property of real numbers: If a set of real numbers A R is bounded from above, then there is a well-defined least upper bound sup A. By definition, sup A is the smallest real number with the property that x sup A for every x A. Now let us assume that R is not connected and derive a contradiction. Let R = A B be a separation, and choose a point a A and b B; without loss of generality, we may suppose that a < b. Now we will find a point s in the interval [a, b] where A and B touch each other, and get a contradiction by studying what happens at that point. Using the least upper bound property, define s = sup ( A [a, b] ). Since R = A B, the point s should lie either in A or in B, but we will see in a moment that neither s A nor s B can be true. Let us first consider the case s A. Then s < b, because b B; now A is open, and so it has to contain an open interval of the form (a 1, a 2 ) with a 1 < s < a 2 < b. This contradicts the fact that s is an upper bound for the set A [a, b]. The other possibility is that s B. Here a < s, because a A; now B is open, and so it has to contain an open interval of the form (b 1, b 2 ) with a < b 1 < s < b 2. Now any x A [a, b] satisfies x s, and therefore s < b 1. This shows that b 1 is also an upper bound for the set A [a, b], contradicting the fact that s is the least upper bound. The same proof shows that any interval (closed or open) and any half-interval (closed or open) is also connected. Note that the argument breaks down for Q precisely because the rational numbers do not have the least upper bound property.

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

Connectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ). 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.

More information

Topological properties

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

More information

Maths 212: Homework Solutions

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

More information

CHAPTER 7. Connectedness

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

More information

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 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

More information

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  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

More information

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

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,

More information

Course 212: Academic Year Section 1: Metric Spaces

Course 212: Academic Year Section 1: Metric Spaces Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........

More information

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, 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

More information

Metric spaces and metrizability

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

More information

2 Metric Spaces Definitions Exotic Examples... 3

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..........................................

More information

1 The Local-to-Global Lemma

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.

More information

Some Background Material

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

More information

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. (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

More information

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

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

More information

Metric Spaces Lecture 17

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 =

More information

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

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.

More information

4 Countability axioms

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

More information

Introductory Analysis I Fall 2014 Homework #5 Solutions

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

More information

Part III. 10 Topological Space Basics. Topological Spaces

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.

More information

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

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

More information

2. Prime and Maximal Ideals

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

More information

Metric Spaces and Topology

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

More information

MATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION. Problem 1

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

More information

Introduction to Topology

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

More information

ON SPACE-FILLING CURVES AND THE HAHN-MAZURKIEWICZ THEOREM

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

More information

Set, functions and Euclidean space. Seungjin Han

Set, functions and Euclidean space. Seungjin Han Set, functions and Euclidean space Seungjin Han September, 2018 1 Some Basics LOGIC A is necessary for B : If B holds, then A holds. B A A B is the contraposition of B A. A is sufficient for B: If A holds,

More information

MA651 Topology. Lecture 9. Compactness 2.

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

More information

Introduction to Dynamical Systems

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

More information

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

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

More information

Chapter 2 Metric Spaces

Chapter 2 Metric Spaces Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics

More information

3. The Sheaf of Regular Functions

3. The Sheaf of Regular Functions 24 Andreas Gathmann 3. The Sheaf of Regular Functions After having defined affine varieties, our next goal must be to say what kind of maps between them we want to consider as morphisms, i. e. as nice

More information

STRONGLY CONNECTED SPACES

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

More information

1. Continuous Functions between Euclidean spaces

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

More information

Solve EACH of the exercises 1-3

Solve EACH of the exercises 1-3 Topology Ph.D. Entrance Exam, August 2011 Write a solution of each exercise on a separate page. Solve EACH of the exercises 1-3 Ex. 1. Let X and Y be Hausdorff topological spaces and let f: X Y be continuous.

More information

Introduction to Real Analysis Alternative Chapter 1

Introduction to Real Analysis Alternative Chapter 1 Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces

More information

The Fundamental Group and Covering Spaces

The Fundamental Group and Covering Spaces Chapter 8 The Fundamental Group and Covering Spaces In the first seven chapters we have dealt with point-set topology. This chapter provides an introduction to algebraic topology. Algebraic topology may

More information

Math General Topology Fall 2012 Homework 1 Solutions

Math General Topology Fall 2012 Homework 1 Solutions Math 535 - General Topology Fall 2012 Homework 1 Solutions Definition. Let V be a (real or complex) vector space. A norm on V is a function : V R satisfying: 1. Positivity: x 0 for all x V and moreover

More information

NOTES FOR MAT 570, REAL ANALYSIS I, FALL Contents

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.

More information

A LITTLE REAL ANALYSIS AND TOPOLOGY

A LITTLE REAL ANALYSIS AND TOPOLOGY A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set

More information

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.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

More information

Real Projective Space: An Abstract Manifold

Real Projective Space: An Abstract Manifold Real Projective Space: An Abstract Manifold Cameron Krulewski, Math 132 Project I March 10, 2017 In this talk, we seek to generalize the concept of manifold and discuss abstract, or topological, manifolds.

More information

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31

2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31 Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15

More information

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

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:

More information

Fourth Week: Lectures 10-12

Fourth Week: Lectures 10-12 Fourth Week: Lectures 10-12 Lecture 10 The fact that a power series p of positive radius of convergence defines a function inside its disc of convergence via substitution is something that we cannot ignore

More information

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers

Theorems. Theorem 1.11: Greatest-Lower-Bound Property. Theorem 1.20: The Archimedean property of. Theorem 1.21: -th Root of Real Numbers Page 1 Theorems Wednesday, May 9, 2018 12:53 AM Theorem 1.11: Greatest-Lower-Bound Property Suppose is an ordered set with the least-upper-bound property Suppose, and is bounded below be the set of lower

More information

1 k x k. d(x, y) =sup k. y k = max

1 k x k. d(x, y) =sup k. y k = max 1 Lecture 13: October 8 Urysohn s metrization theorem. Today, I want to explain some applications of Urysohn s lemma. The first one has to do with the problem of characterizing metric spaces among all

More information

2. Introduction to commutative rings (continued)

2. Introduction to commutative rings (continued) 2. Introduction to commutative rings (continued) 2.1. New examples of commutative rings. Recall that in the first lecture we defined the notions of commutative rings and field and gave some examples of

More information

Chapter 2. Metric Spaces. 2.1 Metric Spaces

Chapter 2. Metric Spaces. 2.1 Metric Spaces Chapter 2 Metric Spaces ddddddddddddddddddddddddd ddddddd dd ddd A metric space is a mathematical object in which the distance between two points is meaningful. Metric spaces constitute an important class

More information

Topology Math Conrad Plaut

Topology Math Conrad Plaut 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

More information

MA651 Topology. Lecture 10. Metric Spaces.

MA651 Topology. Lecture 10. Metric Spaces. MA65 Topology. Lecture 0. Metric Spaces. This text is based on the following books: Topology by James Dugundgji Fundamental concepts of topology by Peter O Neil Linear Algebra and Analysis by Marc Zamansky

More information

3 COUNTABILITY AND CONNECTEDNESS AXIOMS

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

More information

MORE ON CONTINUOUS FUNCTIONS AND SETS

MORE ON CONTINUOUS FUNCTIONS AND SETS Chapter 6 MORE ON CONTINUOUS FUNCTIONS AND SETS This chapter can be considered enrichment material containing also several more advanced topics and may be skipped in its entirety. You can proceed directly

More information

MAS331: Metric Spaces Problems on Chapter 1

MAS331: Metric Spaces Problems on Chapter 1 MAS331: Metric Spaces Problems on Chapter 1 1. In R 3, find d 1 ((3, 1, 4), (2, 7, 1)), d 2 ((3, 1, 4), (2, 7, 1)) and d ((3, 1, 4), (2, 7, 1)). 2. In R 4, show that d 1 ((4, 4, 4, 6), (0, 0, 0, 0)) =

More information

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

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

More information

Rose-Hulman Undergraduate Mathematics Journal

Rose-Hulman Undergraduate Mathematics Journal Rose-Hulman Undergraduate Mathematics Journal Volume 17 Issue 1 Article 5 Reversing A Doodle Bryan A. Curtis Metropolitan State University of Denver Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj

More information

01. Review of metric spaces and point-set topology. 1. Euclidean spaces

01. Review of metric spaces and point-set topology. 1. Euclidean spaces (October 3, 017) 01. Review of metric spaces and point-set topology Paul Garrett garrett@math.umn.edu http://www.math.umn.edu/ garrett/ [This document is http://www.math.umn.edu/ garrett/m/real/notes 017-18/01

More information

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 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

More information

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

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

More information

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, 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

More information

*Room 3.13 in Herschel Building

*Room 3.13 in Herschel Building MAS3706: Topology Dr. Zinaida Lykova School of Mathematics, Statistics and Physics Newcastle University *Room 3.13 in Herschel Building These lectures concern metric and topological spaces and continuous

More information

Ordinary differential equations. Recall that we can solve a first-order linear inhomogeneous ordinary differential equation (ODE) dy dt

Ordinary differential equations. Recall that we can solve a first-order linear inhomogeneous ordinary differential equation (ODE) dy dt MATHEMATICS 3103 (Functional Analysis) YEAR 2012 2013, TERM 2 HANDOUT #1: WHAT IS FUNCTIONAL ANALYSIS? Elementary analysis mostly studies real-valued (or complex-valued) functions on the real line R or

More information

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend

More information

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

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

More information

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3

Contents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3 Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability

More information

Measures. Chapter Some prerequisites. 1.2 Introduction

Measures. Chapter Some prerequisites. 1.2 Introduction Lecture notes Course Analysis for PhD students Uppsala University, Spring 2018 Rostyslav Kozhan Chapter 1 Measures 1.1 Some prerequisites I will follow closely the textbook Real analysis: Modern Techniques

More information

Math 117: Topology of the Real Numbers

Math 117: Topology of the Real Numbers Math 117: Topology of the Real Numbers John Douglas Moore November 10, 2008 The goal of these notes is to highlight the most important topics presented in Chapter 3 of the text [1] and to provide a few

More information

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set

Analysis Finite and Infinite Sets The Real Numbers The Cantor Set Analysis Finite and Infinite Sets Definition. An initial segment is {n N n n 0 }. Definition. A finite set can be put into one-to-one correspondence with an initial segment. The empty set is also considered

More information

(x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2.

(x 1, y 1 ) = (x 2, y 2 ) if and only if x 1 = x 2 and y 1 = y 2. 1. Complex numbers A complex number z is defined as an ordered pair z = (x, y), where x and y are a pair of real numbers. In usual notation, we write z = x + iy, where i is a symbol. The operations of

More information

Algebraic Geometry. Andreas Gathmann. Class Notes TU Kaiserslautern 2014

Algebraic Geometry. Andreas Gathmann. Class Notes TU Kaiserslautern 2014 Algebraic Geometry Andreas Gathmann Class Notes TU Kaiserslautern 2014 Contents 0. Introduction......................... 3 1. Affine Varieties........................ 9 2. The Zariski Topology......................

More information

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, 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

More information

Math Topology I: Topological Spaces and the Fundamental Group

Math Topology I: Topological Spaces and the Fundamental Group Math 131 - Topology I: Topological Spaces and the Fundamental Group Taught by Clifford Taubes Notes by Dongryul Kim Fall 2015 In 2015, Math 131 was taught by Professor Clifford Taubes. We met on Mondays,

More information

2. Metric Spaces. 2.1 Definitions etc.

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

More information

Immerse Metric Space Homework

Immerse Metric Space Homework Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps

More information

Principles of Real Analysis I Fall I. The Real Number System

Principles of Real Analysis I Fall I. The Real Number System 21-355 Principles of Real Analysis I Fall 2004 I. The Real Number System The main goal of this course is to develop the theory of real-valued functions of one real variable in a systematic and rigorous

More information

Countability. 1 Motivation. 2 Counting

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

More information

Mathematics for Economists

Mathematics for Economists Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples

More information

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

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

More information

B 1 = {B(x, r) x = (x 1, x 2 ) H, 0 < r < x 2 }. (a) Show that B = B 1 B 2 is a basis for a topology on X.

B 1 = {B(x, r) x = (x 1, x 2 ) H, 0 < r < x 2 }. (a) Show that B = B 1 B 2 is a basis for a topology on X. Math 6342/7350: Topology and Geometry Sample Preliminary Exam Questions 1. For each of the following topological spaces X i, determine whether X i and X i X i are homeomorphic. (a) X 1 = [0, 1] (b) X 2

More information

ter. on Can we get a still better result? Yes, by making the rectangles still smaller. As we make the rectangles smaller and smaller, the

ter. on Can we get a still better result? Yes, by making the rectangles still smaller. As we make the rectangles smaller and smaller, the Area and Tangent Problem Calculus is motivated by two main problems. The first is the area problem. It is a well known result that the area of a rectangle with length l and width w is given by A = wl.

More information

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

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

More information

MAS3706 Topology. Revision Lectures, May I do not answer enquiries as to what material will be in the exam.

MAS3706 Topology. Revision Lectures, May I do not answer  enquiries as to what material will be in the exam. MAS3706 Topology Revision Lectures, May 208 Z.A.Lykova It is essential that you read and try to understand the lecture notes from the beginning to the end. Many questions from the exam paper will be similar

More information

Problem Set 2: Solutions Math 201A: Fall 2016

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

More information

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.

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

More information

Chapter 1 The Real Numbers

Chapter 1 The Real Numbers Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus

More information

LECTURE 6. CONTINUOUS FUNCTIONS AND BASIC TOPOLOGICAL NOTIONS

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

More information

Math 341: Convex Geometry. Xi Chen

Math 341: Convex Geometry. Xi Chen Math 341: Convex Geometry Xi Chen 479 Central Academic Building, University of Alberta, Edmonton, Alberta T6G 2G1, CANADA E-mail address: xichen@math.ualberta.ca CHAPTER 1 Basics 1. Euclidean Geometry

More information

0. Introduction 1 0. INTRODUCTION

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

More information

1 Differentiable manifolds and smooth maps

1 Differentiable manifolds and smooth maps 1 Differentiable manifolds and smooth maps Last updated: April 14, 2011. 1.1 Examples and definitions Roughly, manifolds are sets where one can introduce coordinates. An n-dimensional manifold is a set

More information

METRIC SPACES KEITH CONRAD

METRIC SPACES KEITH CONRAD METRIC SPACES KEITH CONRAD 1. Introduction As calculus developed, eventually turning into analysis, concepts first explored on the real line (e.g., a limit of a sequence of real numbers) eventually extended

More information

CLASS NOTES FOR APRIL 14, 2000

CLASS NOTES FOR APRIL 14, 2000 CLASS NOTES FOR APRIL 14, 2000 Announcement: Section 1.2, Questions 3,5 have been deferred from Assignment 1 to Assignment 2. Section 1.4, Question 5 has been dropped entirely. 1. Review of Wednesday class

More information

Real Analysis - Notes and After Notes Fall 2008

Real Analysis - Notes and After Notes Fall 2008 Real Analysis - Notes and After Notes Fall 2008 October 29, 2008 1 Introduction into proof August 20, 2008 First we will go through some simple proofs to learn how one writes a rigorous proof. Let start

More information

Math 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015

Math 320-2: Midterm 2 Practice Solutions Northwestern University, Winter 2015 Math 30-: Midterm Practice Solutions Northwestern University, Winter 015 1. Give an example of each of the following. No justification is needed. (a) A metric on R with respect to which R is bounded. (b)

More information

If X is a compact space and K X is a closed subset, then K is

If X is a compact space and K X is a closed subset, then K is 6. Compactness...compact sets play the same role in the theory of abstract sets as the notion of limit sets do in the theory of point sets. Maurice Frechet, 1906 Compactness is one of the most useful topological

More information

University of Sheffield. School of Mathematics and Statistics. Metric Spaces MAS331/6352

University of Sheffield. School of Mathematics and Statistics. Metric Spaces MAS331/6352 University of Sheffield School of Mathematics and Statistics Metric Spaces MAS331/635 017 18 1 Metric spaces This course is entitled Metric spaces. You may be wondering what such a thing should be. We

More information

Lecture 2: Vector Spaces, Metric Spaces

Lecture 2: Vector Spaces, Metric Spaces CCS Discrete II Professor: Padraic Bartlett Lecture 2: Vector Spaces, Metric Spaces Week 2 UCSB 2015 1 Vector Spaces, Informally The two vector spaces 1 you re probably the most used to working with, from

More information

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi

Real Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.

More information

AN EXPLORATION OF THE METRIZABILITY OF TOPOLOGICAL SPACES

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

More information

In N we can do addition, but in order to do subtraction we need to extend N to the integers

In N we can do addition, but in order to do subtraction we need to extend N to the integers Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need

More information