Math 117: Topology of the Real Numbers


 Madlyn Rogers
 1 years ago
 Views:
Transcription
1 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 additional topics on metric spaces, in the hopes of providing an easier transition to more advanced books on real analysis, such as [2]. 1 Open and closed sets If a and b are real numbers with a < b, we let (a, b) = {x R : a < x < b}, [a, b] = {x R : a x b}. Moreover, if x R and ɛ > 0, we let N(x; ɛ) = {y R : x y < ɛ}, N (x; ɛ) = {y R : 0 < x y < ɛ}. Definition. A set S R is open if whenever x S, there exists ɛ > such that N(x; ɛ) S. A set S R is closed if R S is open. Thus, for example, (a, b) is open while [a, b] is closed. Definition. Suppose S R. Then the interior of S is The boundary of S is int(s) = {x S : N(x; ɛ) S for some ɛ > 0 }. bd(s) = R (int(s) int(r S)). Clearly, S is open if and only if S = int(s). Note also that R is the disjoint union of int(s), int(r S) and bd(s). Proposition 1.1. S is closed if and only if bd(s) S. Proof: : Suppose that S is closed. Then R S is open so int(r S) = R S. Thus S = int(s) bd(s), and bd(s) S. : Suppose that bd(s) S. Then int(s)bd(s) S, so R S (R S). Hence int(r S) = R S and S is closed. 1
2 Proposition 1.2. The empty set and the whole space R are open. The union of an arbitrary collection of open sets is open. The intersection of a finite collection of open sets is open. Proof: We leave it to the reader to check that the empty set and the whole space R are open. Suppose that {U α : α A} is a collection of open sets and that U = {U α : α A}. If x U, then x U α for some α A. Hence there is an ɛ > 0 such that N(x; ɛ) U α. But then N(x; ɛ) U, and this shows that U is open. Suppose that {U 1,..., U m } is a finite collection of open sets and that U = U 1 U m. If x U, then x U i for every i, 1 i m. Hence for each i, 1 i m, there exists ɛ i > 0 such that N(x; ɛ i ) U i. Let ɛ = min(ɛ 1,..., ɛ m ), and note that ɛ > 0 since the minimum of a finite number of positive numbers is positive. Then N(x; ɛ) U i for every i, 1 i m. Hence N(x; ɛ) U and U is open. Proposition 1.3. The empty set and the whole space R are closed. The intersection of an arbitrary collection of closed sets is closed. The union of a finite collection of closed sets is closed. Proof: Once again it is easy to see that the empty set and the whole space R are closed. Suppose that {C α : α A} is a collection of closed sets and that C = {C α : α A}. Then U α = R C α is open, and by the previous theorem U = {U α : α A} is open. It follows from the De Morgan laws that R U = R {U α : α A} = (R U α ) = {C α : α A} = C. Hence C is closed. Suppose that {C 1,..., C m } is a finite collection of open sets and that C = C 1 C m. Then U i = R C i is open and by the previous theorem, U = U 1 U m is also open. It follows from the De Morgan laws that R U = R (U 1 U m ) = (R U 1 ) (R U m ) = C 1 C m = C, 2
3 and hence C is closed. The preceding propositions allow one to check whether many subsets of R are open or closed. For example, consider the subset Z R. Since R Z is the union of the intervals (n, n + 1) for n Z, we see that R Z is open, and hence Z is closed. On the other hand we claim that the rationals Q R is neither open nor closed. Equivalently, neither Q nor R Q is open. If Q were open there would exist ɛ > 0 such that ( ɛ, ɛ) Q. But then there would exist n N such that ( 1/n, 1/n) Q. Since multiplication by n takes Q to itself, it would then follow that ( 1, 1) Q. This is impossible, because we have seen that ( 1, 1) is uncountable while Q is countable. To show that R Q is not open, we use: Proposition 1.4. Any nonempty open interval (a, b) contains a rational number r. Proof: In proving this, we can assume without loss of generality (WOLOG) that 2 < a < b. (Indeed, we could arrange this by replacing (a, b) by (a + n, b + n) for some n N.) By the Archimedean property of R, we know that N is not bounded above, so we can choose n N such that n > 1/(b a) Then 1/n < b a. We let S = {m N : m/n > a}, a set which is nonempty because of the Archimedean property once again. (There exists m N such that m > na.) Since N is wellordered, S contains a least element m, which must be 2. Then m 1 n a m n 1 n a m n a + 1 n < b. Hence r = m/n is a rational number such that r (a, b). Suppose now that R Q were open. Then it would contain a nonempty open interval (a, b) in contradiction to the previous proposition. We conclude that R Q cannot be open. Definition. Suppose S R. Then a point x R is an accumulation point of S if for every ɛ > 0, N (x; ɛ) S. Proposition 1.5. If x R is an accumulation point of S R, then for every ɛ > 0, N (x; ɛ) S is infinite. Proof: If x is an accumulation point of S, there exists a point x 1 N (x; ɛ) S. Let ɛ 1 = x 1 x. Then there exists a point x 2 N (x; ɛ 1 ) S N (x; ɛ) S, and we let ɛ 2 = x 2 x. Continuing in this fashion, we get an infinite collection of distinct points {x 1, x 2, x 3,...} in N (x; ɛ) S. We let S denote the set of accumulation points of S. For example, if S = {1, 1/2, 1/3, 1/4,...}, the only accumulation point of S is the point 0. In this case, S = {0}. 3
4 Proposition 1.6. A subset S of R is closed if and only if S S. Proof: : Suppose that S is closed and x S. If x R S, then N(x; ɛ) R S for some ɛ > 0. But the x / S. : Suppose that S S. If x R S, then x / S and hence x / S, so N (x; ɛ) S = for some ɛ > 0. But then N(x; ɛ) R S for some ɛ > 0. Thus R S) is open and S is closed. The Cantor set. We start with C 0 = [0, 1]. We then let [ C 1 = 0, 1 ] [ ] 2 3 3, 1 = C ( C ) 0, 3 [ C 2 = 0, 1 ] [ 2 9 9, 1 ] [ 2 3 3, 7 ] [ ] 8 9 9, 1 = C ( C ) 1, 3 and so forth. Thus for each n N, we let C n = C n 1 3 ( C ) n 1. 3 Note that all of the sets C n are closed. The intersection C = {C n : n N} is also closed, and called the Cantor set. How long is the Cantor set? To answer this question, we carry out the calculation: Length of ([0, 1] C) = = 1 3 n=1 2 n 3 n = 1 ( ) (2/3) = 1. Thus we see that the Cantor set has length (or measure) zero. The Cantor set also enjoys many other interesting properties. For example, it can be shown that every point of the Cantor set is an accumulation point; thus C = C. A proof of this fact can be found in [2]; see pages 36,37. This source also provides a proof that the Cantor set has uncountably many points. 2 Compactness Suppose that S is a subset of R. We say that a collection U = {U α : α A} is an open cover of S if 1. each U α is open, and 2. S {U α : α A}. 4
5 Definition. A subset K R is compact if whenever {U α : α A} is an open cover of K, then K U α1 U αm, for some finite subset {α 1,..., α m } A. In other words, K is compact if any open cover of K has a finite subcover. Here are some examples of compact and noncompact sets. First, any finite subset of R is compact. Next, the set N of natural numbers is not compact, because {(0, n) : n N} is an open cover of N, but it has no finite subcover. Indeed, if N (0, n 1 ) (0, n 2 ) (0, n m ) for some finite m, then we could let N = max(n 1,..., n m ). Since (0, n i ) (0, N), we would then have N (0, N) but this would contradict the fact that N is unbounded (which follows from the Archimedean property of the real numbers. Similarly, the interval (0, 1] = {x R : 0 < x 1} is not compact. Indeed if we let ( ) 1 U n = n, 2, then (0, 1] {U n : n N}. Note that n < m U n U m. Thus if it were the case that it would follow that (0, 1] U n1 U nm, (0, 1] U N, where N = max(n 1,..., n m ). But by the Archemedean Property of R, there exists an element m N such that 0 < 1/m < 1/N and hence it is not the case that (0, 1] ((1/N), 2). A subset K R is said to be bounded if K N(x; R) for some R > 0. Proposition 2.1. If a subset of R is compact, it is closed and bounded. Proof: Suppose that K is a compact subset of R. For n N, the set U n = ( n, n) is open. Moreover, {Un : n N} = R. Thus U = {U n : n N} is an open cover of K. Since K is compact, it must have a finite subcover {U n1,..., U nm }, so K U n1 U nk. Let N = max(n 1,..., n m ). Then K ( N, N) and hence K is bounded. Suppose now that K is compact and x bd(k) K. Let ( U n =, x 1 ) (x + 1n ) n,. Then K {U n : n N} = R {x}. 5
6 Thus U = {U n : n N} is an open cover of K. Since K is compact, it must have a finite subcover Let N = max(n 1,..., n m ). Then {U n1,..., U nm }, so K U n1 U nk. K (, x 1 N ) (x + 1N ), and hence (x ɛ, x + ɛ) R K, for ɛ 1 N. This contradicts the assumption that x bd(k). Hence bd(k) K, and K is closed. Proposition 2.2. Any nonempty finite closed interval [a, b] is compact. The argument (following [2]) is based upon: Nesting Lemma. Suppose that {I n : n N} is a decreasing nested sequence of nonempty closed intervals in R, Then {I n : n N} is nonempty. I 1 I 2 I n I n+1. Proof of Lemma: Suppose that I n = [a n, b n ] and let S = {a n : n N}. S is nonempty and since a n b 1, it is bounded above. Thus S has a least upper bound x. Since x is an upper bound, a n x for all n. Since x is a least upper bound and a n a n+k b n+k b n, it follows that x b n, for all n. Thus x [a n, b n ], for every n, and x lies in the intersection. Proof of Proposition 2.2: We assume that U = {U α : α A} is an open cover of [a, b] with no finite subcover. We can divide the interval I 1 = [a, b] into two equal intervals [ [a, b] = a, a + b ] [ ] a + b 2 2, b. At least one of the two subintervals cannot be covered by a finite subcollection of U; otherwise the original interval could be so covered. Let I 2 = [a 2, b 2 ] be one of the two subintervals, chosen so that it cannot be covered by a finite subcollection of U. We divide I 2 into two intervals of equal length I 2 = [a 2, b 2 ] = [ a 2, a ] 2 + b 2 2 [ a2 + b 2 2, b 2 ]. 6
7 Once again, at least one of the two subintervals, say I 3 cannot be covered by a finite subcollection of U. We continue in a similar fashion, thereby obtaining a decreasing nested sequence of nonempty intervals I 1 I 2 I n I n+1 with Length(I n+1 ) = 1 2 Length(I n) such that no I n is covered by a finite subcover of U. By the Lemma, {I n : n N} contains some element x. Let U α be an element of U which contains x. Since U α is open there exists ɛ > 0 such that (x ɛ, x + ɛ) U α. But then I n (x ɛ, x + ɛ) U α for n sufficiently large. This contradicts the fact that I n was not covered by a finite subcover of U = {U α : α A}. Proposition 2.3. If S is a closed subset of a compact set K, then S is also compact. Proof: Let U = {U α : α A} be an open cover of S. Then {U α : α A}{R S} is an open cover of K. It must have a finite subcover But then {U α1,..., U αk, R S}. {U α1,..., U αk } is a finite subset of U which covers S. Hence S is compact. Putting the last three propositions together gives us the key theorem regarding compactness: HeineBorel Theorem. A subset of R is compact if and only if it is closed and bounded. Proof: The implication follows from Proposition 2.1. Conversely, if K a closed bounded subset of R, then K is a closed subset of [ N, N] for some N N. Proposition 2.2 implies that [ N, N] is compact, and Proposition 2.3 implies that K is compact. As a corollary, we get: BolzanoWeierstrass Theorem. Any bounded infinite subset of R must have an accumulation point. Proof: Suppose that S is an infinite subset of R which has no accumulation point. Then since S contains all its accumulation points, it must be closed. Since it also bounded, it must also be compact. For each x S there is an open neighborhood N(x) of x such that N(x) S = {x}. Thus we have an open cover {N(x) : x S} of S. Since S is compact, this cover must have a finite subcover, S N(x 1 ) N(x 2 ) N(x m ), 7
8 for some m N. But then we would have S = {x 1,..., x m }, a finite set, a contradiction. 3 The dot product If x = (x 1...., x n ) and y = (y 1...., y n ) are elements of R n, we define their dot product by x y = x 1 y x n y n. The dot product satisfies several key axioms: 1. it is symmetric: x y = y x; 2. it is bilinear: (ax + x ) y = a(x y) + x y; 3. and it is positivedefinite: x x 0 and x x = 0 if and only if x = 0. We define the length of x by x = x x. Note that the length of x is always 0. CauchySchwarz Theorem. The dot product satisfies Sketch of proof: Expand the inequality and simplify to obtain which simplifies to or 1 x y 1. (1) x y 0 (x(y y) y(x y)) (x(y y) y(x y)) 0 (x x)(y y) 2 2(x y) 2 (y y) + (y y)(x y) 2, (x y) 2 (y y) (x x)(y y) 2, (x y) 2 x 2 y 2. Taking the square root yields the CauchySchwarz inequality(1). The importance of the CauchySchwarz inequality is that it allows us to define angles between vectors x and y in R n. Given an number t [ 1, 1], there is a unique angle θ such that θ [0, π] and cos θ = t. Thus we can define the angle between two nonzero vectors x and y in R n by requiring that θ [0, π] and cos θ = x y x y. 8
9 Thus we can say that two vectors vectors x and y in R n are perpendicular or orthogonal if x y = 0. This provides much of the intuition for dealing with vectors in R n. Corollary of CauchySchwarz Theorem. If u, v R n, then u + v u + v. Proof: It suffices to check that or u + v 2 ( u + v ) 2 u 2 + 2u v + v 2 u u v + v 2. But this follows immediately from the CauchySchwarz inequality. 4 Topology of metric spaces Definition 4.1. A metric space is a set X together with a function d : X X R such that 1. d(x, y) 0 and d(x, y) = 0 x = y, 2. d(x, y) = d(y, x), and 3. d(x, z) d(x, y) + d(y, z). The last of these conditions is known as the triangle inequality. Example 1. The most basic example is X = R with d : R R R defined by d(x, y) = x y. Example 2. The example needed for multivariable calculus is X = R n with d : R n R n R defined by d(x, y) = x y, the length of x y being defined as in the preceding section. We call this metric the standard metric on R n. In verifying that this really is a metric space, the only difficulty is checking the triangle inequality. But this follows from the Corollary in the preceding section when u = x y and v = y z. Of course, this example includes the previous one as a special case. Example 3. Let S be a subset of R n. If x and y are elements of S, we let d(x, y) be the distance from x to y in R n. This provides numerous additional examples of metric spaces. 9
10 Further examples can be found in the text [1], 15. If (X, d) is a metric space and ɛ > 0 is given the ɛneighborhood N(x; ɛ) of a point x X is N(x; ɛ) = {y X : d(x, y) < ɛ}, while the deleted ɛneighborhood N(x; ɛ) of x is N (x; ɛ) = {y X : d(x, y) < ɛ, y x}. Definition 4.2. A subset U of X is said to be open if x U N(x; ɛ) U, for some ɛ > 0. A subset C of X is closed if its complement X C is open. A subset K X is bounded if K N(x; R) for some R > 0. For example, the set N(x; R) = {y X : d(x, y) < R} is open whenever R > 0. To see this it suffices to show that But y N(x; R) N(y; R d(x, y)) N(x; R). z N(y; R d(x, y)) d(y, z) < R d(x, y) It follows that the set d(x, z) < d(x, y) + d(y, z) < R d(x, z) < R z N(x : R). X N(x; R) = {y X : d(x, y) R} is closed. It is useful to become familiar with which sets in R 2 are open and closed. Thus the open ball of radius R about any given point (x 0, y 0 ) R 2, N((x 0, y 0 ); R) = {(x, y) R 2 : (x x 0 ) 2 + (y y 0 ) 2 < R 2 }, is an open subset of R 2 by the argument given in the preceding paragraph. However, it is not a closed subset of R 2 because the point (1, 0) lies in R 2 N((x 0, y 0 ); R), but there is no open neighborhood about (1, 0)) which is entirely contained in R 2 N((x 0, y 0 ); R). Similarly, one can show that the closed ball B((x 0, y 0 ); R) = {(x, y) R 2 : (x x 0 ) 2 + (y y 0 ) 2 R 2 } is closed but not open. 10
11 If (a, b) and (c, d) are nonempty open intervals, the Cartesian product (a, b) (c, d) is open but not closed. If [a, b] and [c, d] are nonempty closed intervals, [a, b] [c, d] is closed but not open. The metric d of a metric space (X, d) can be restricted to any subset S X, making S into a metric space in its own right. This gives rise to the notion of an open subset of S. (Note that for x S, the ɛneighborhoods of x in S are just the intersections N(x; ɛ) S, where N(x; ɛ) is an ɛneighborhood of x in X.) Proposition 4.1. Let (X, d) be a metric space and let S be a subset of X. Then a subset U of S is open if and only if U = V S, where V is open in X. Proof: Suppose that V is an open subset of X and U = V S. If x V S, then since V is open in X, there exists an ɛ > 0 such that N(x; ɛ) V. But then N(x; ɛ) S V S = U. So U is open in S. Conversely, if U is an open subset of S, then for x U S, there exists an ɛ x > 0 such that N(x; ɛ x ) S U. We let V = {N(x; ɛ x ) : x U S}. Then V is an open subset of X and V S = U. Much of the theory of open and closed sets can be generalized to metric spaces. Thus, for example, we have: Proposition 4.2. If (X, d) is a metric space, the empty set and the whole space X are open. The union of an arbitrary collection of open sets is open. The intersection of a finite collection of open sets is open. The proof is virtually the same as the proof given in 1. Definition. We say that a subset K of a metric space (X, d) is compact if every open cover of K has a finite subcover. 5 The HeineBorel Theorem for R n The HeineBorel Theorem for R we have proven above is actually a special case of: HeineBorel Theorem for R n. A subset of R n with the standard metric is compact if and only if it is closed and bounded. The proof we gave before actually extends from R to R n. First we need to show that a compact subset K of R n is bounded. If not we can construct a collection of open sets, U = {U n : n N}, U n = N(0; n), which covers K and has no finite subcover. 11
12 Next we must show that a compact subset K of R n is closed. If K is not closed there exists x R n K which lies in K. In this case, we can construct a collection of open sets, U = {U n : n Z}, U n = N(x; 2 n ), which covers K but has no finite subcover. Finally, we must show that if K is a closed bounded subset of R n, K is compact. For this we need a modification of our earlier nesting lemma. We say that I R n is a closed ncube if I = [a 1, b 1 ] [a n, b n ], with b 1 a 1 = = b n a n. We say that the length of the closed ncube is b 1 a 1. Nesting Lemma. Suppose that {I k : k N} is a decreasing nested sequence of nonempty closed ncubes in R n, Then {I n : n N} is nonempty. Proof of Lemma: Suppose that Then for each j, 1 j n, I 1 I 2 I n I n+1. I k = [a k,1, b k,1 ] [a k,n, b k,n ]. [a 1,j, b 1,j ] [a 1,j, b 1,j ] [a 1,j, b 1,j ] is a nested sequence of intervals. By the earlier nesting lemma, there exists a point x j {[a k,j, b k,j ] : k N}. Then the point (x 1,..., x n ) lies in {I n : n N}. Once we have this Nesting Lemma, we can prove that for any M > 0, the closed unit ncube I 1 = [ M, M] [ M, M] of length 2M is compact by a modification of the argument we gave before. Suppose that U = {U α : α A} is an open cover of I 1 with no finite subcover. We can divide ti 1 = [a, b] by the coordinate hyperplanes into 2 n closed cubes of length M. At least one of these cubes I 2 cannot be covered by a finite subcollection of U; otherwise the original interval could be so covered. We then divide I 2 into 2 n closed cubes of length M/2. Once again, at least one of these cubes, say I 3 cannot be covered by a finite subcollection of U. We continue in a similar fashion, thereby obtaining a decreasing nested sequence I 1 I 2 I n I n+1 with Length(I n+1 ) = 1 2 Length(I n) 12
13 such that no I n is covered by a finite subcover of U. By the new Nesting Lemma, {I n : n N} contains some element (x 1,..., x n ). Let U α be an element of U which contains x. Since U α is open there exists ɛ > 0 such that But then (x 1 ɛ, x 1 + ɛ) (x n ɛ, x n + ɛ) U α. I n (x 1 ɛ, x 1 + ɛ) (x n ɛ, x n + ɛ) U α for n sufficiently large. This contradicts the fact that I n was not covered by a finite subcover of U = {U α : α A}. Hence the ncube I 1 = [ M, M] [ M, M] is compact. Finally, if K is any closed bounded subset of R n, then K is a closed subset of [ M, M] [ M, M] for some M > 0. The proof of Proposition 2.3 now shows that K is compact. BolzanoWeierstrass Theorem for R n. Any bounded infinite subset of R n must have an accumulation point. This follows from the Compactness Criterion, once we have the HeineBorel Theorem for R n. References [1] Steven R. Lay, Analysis: with an introduction to proof, Pearson Prentice Hall, Upper Saddle Riven, NJ, [2] W. Rudin, Principles of mathematical analysis, Third edition, McGraw Hill, New York,
Lecture Notes on Metric Spaces
Lecture Notes on Metric Spaces Math 117: Summer 2007 John Douglas Moore Our goal of these notes is to explain a few facts regarding metric spaces not included in the first few chapters of the text [1],
More informationMath 117: Infinite Sequences
Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence
More informationMath 117: Continuity of Functions
Math 117: Continuity of Functions John Douglas Moore November 21, 2008 We finally get to the topic of ɛ δ proofs, which in some sense is the goal of the course. It may appear somewhat laborious to use
More information1 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 informationThe HeineBorel and ArzelaAscoli Theorems
The HeineBorel and ArzelaAscoli Theorems David Jekel October 29, 2016 This paper explains two important results about compactness, the Heine Borel theorem and the ArzelaAscoli theorem. We prove them
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationProblem 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 informationTheorems. Theorem 1.11: GreatestLowerBound 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: GreatestLowerBound Property Suppose is an ordered set with the leastupperbound property Suppose, and is bounded below be the set of lower
More informationThat is, there is an element
Section 3.1: Mathematical Induction Let N denote the set of natural numbers (positive integers). N = {1, 2, 3, 4, } Axiom: If S is a nonempty subset of N, then S has a least element. That is, there is
More informationIndeed, if we want m to be compatible with taking limits, it should be countably additive, meaning that ( )
Lebesgue Measure The idea of the Lebesgue integral is to first define a measure on subsets of R. That is, we wish to assign a number m(s to each subset S of R, representing the total length that S takes
More informationChapter 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 informationIntroduction to Proofs
Real Analysis Preview May 2014 Properties of R n Recall Oftentimes in multivariable calculus, we looked at properties of vectors in R n. If we were given vectors x =< x 1, x 2,, x n > and y =< y1, y 2,,
More informationA 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 informationReal 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 informationMATH 31BH Homework 1 Solutions
MATH 3BH Homework Solutions January 0, 04 Problem.5. (a) (x, y)plane in R 3 is closed and not open. To see that this plane is not open, notice that any ball around the origin (0, 0, 0) will contain points
More informationMetric 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 informationMaths 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 informationCHAPTER 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
More information2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α.
Chapter 2. Basic Topology. 2.3 Compact Sets. 2.31 Definition By an open cover of a set E in a metric space X we mean a collection {G α } of open subsets of X such that E α G α. 2.32 Definition A subset
More informationLecture 2: A crash course in Real Analysis
EE5110: Probability Foundations for Electrical Engineers JulyNovember 2015 Lecture 2: A crash course in Real Analysis Lecturer: Dr. Krishna Jagannathan Scribe: Sudharsan Parthasarathy This lecture is
More informationSequences. 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 informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationMAT 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 informationAnalysis 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 onetoone correspondence with an initial segment. The empty set is also considered
More informationMath 5210, Definitions and Theorems on Metric Spaces
Math 5210, Definitions and Theorems on Metric Spaces Let (X, d) be a metric space. We will use the following definitions (see Rudin, chap 2, particularly 2.18) 1. Let p X and r R, r > 0, The ball of radius
More informationCOUNTABLE PRODUCTS ELENA GUREVICH
COUNTABLE PRODUCTS ELENA GUREVICH Abstract. In this paper, we extend our study to countably infinite products of topological spaces.. The Cantor Set Let us constract a very curios (but usefull) set known
More informationAdvanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010
Advanced Calculus: MATH 410 Real Numbers Professor David Levermore 5 December 2010 1. Real Number System 1.1. Introduction. Numbers are at the heart of mathematics. By now you must be fairly familiar with
More informationContents 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 information7 Complete metric spaces and function spaces
7 Complete metric spaces and function spaces 7.1 Completeness Let (X, d) be a metric space. Definition 7.1. A sequence (x n ) n N in X is a Cauchy sequence if for any ɛ > 0, there is N N such that n, m
More informationSome 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 informationQuick 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
More information1 Lecture 4: Set topology on metric spaces, 8/17/2012
Summer JumpStart Program for Analysis, 01 SongYing Li 1 Lecture : Set topology on metric spaces, 8/17/01 Definition 1.1. Let (X, d) be a metric space; E is a subset of X. Then: (i) x E is an interior
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by BW 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 informationCLASS 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 informationLecture 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 informationChapter 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 informationDefinition 2.1. A metric (or distance function) defined on a nonempty set X is a function d: X X R that satisfies: For all x, y, and z in X :
MATH 337 Metric Spaces Dr. Neal, WKU Let X be a nonempty set. The elements of X shall be called points. We shall define the general means of determining the distance between two points. Throughout we
More informationMid Term1 : Practice problems
Mid Term1 : Practice problems These problems are meant only to provide practice; they do not necessarily reflect the difficulty level of the problems in the exam. The actual exam problems are likely to
More informationAdvanced Honors Calculus, I and II (Fall 2017 and Winter 2018) Volker Runde
Advanced Honors Calculus, I and II (Fall 27 and Winter 28) Volker Runde April 23, 28 Contents Introduction 3 The Real Number System and FiniteDimensional Euclidean Space 4. The Real Line..................................
More informationSets, Functions and Metric Spaces
Chapter 14 Sets, Functions and Metric Spaces 14.1 Functions and sets 14.1.1 The function concept Definition 14.1 Let us consider two sets A and B whose elements may be any objects whatsoever. Suppose that
More informationSet, 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 informationMETRIC 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 informationPart 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 informationChapter II. Metric Spaces and the Topology of C
II.1. Definitions and Examples of Metric Spaces 1 Chapter II. Metric Spaces and the Topology of C Note. In this chapter we study, in a general setting, a space (really, just a set) in which we can measure
More informationMA651 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 informationM17 MAT2521 HOMEWORK 6
M17 MAT2521 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationLebesgue Measure on R n
CHAPTER 2 Lebesgue Measure on R n Our goal is to construct a notion of the volume, or Lebesgue measure, of rather general subsets of R n that reduces to the usual volume of elementary geometrical sets
More informationIntroduction 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 informationAnalysis3 lecture schemes
Analysis3 lecture schemes (with Homeworks) 1 Csörgő István November, 2015 1 A jegyzet az ELTE Informatikai Kar 2015. évi Jegyzetpályázatának támogatásával készült Contents 1. Lesson 1 4 1.1. The Space
More informationTopological 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 information2 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 informationAN 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 informationEC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 1: Preliminaries
EC 521 MATHEMATICAL METHODS FOR ECONOMICS Lecture 1: Preliminaries Murat YILMAZ Boğaziçi University In this lecture we provide some basic facts from both Linear Algebra and Real Analysis, which are going
More informationMath 3202: 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 informationIntroduction to Topology
Introduction to Topology Randall R. Holmes Auburn University Typeset by AMSTEX Chapter 1. Metric Spaces 1. Definition and Examples. As the course progresses we will need to review some basic notions about
More informationFunctional Analysis. Franck Sueur Metric spaces Definitions Completeness Compactness Separability...
Functional Analysis Franck Sueur 20182019 Contents 1 Metric spaces 1 1.1 Definitions........................................ 1 1.2 Completeness...................................... 3 1.3 Compactness......................................
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 19912 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 informationMATH 202B  Problem Set 5
MATH 202B  Problem Set 5 Walid Krichene (23265217) March 6, 2013 (5.1) Show that there exists a continuous function F : [0, 1] R which is monotonic on no interval of positive length. proof We know there
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory Winter 2018 Supplement A: Mathematical background A.1 Extended real numbers The extended real number
More informationMAT 544 Problem Set 2 Solutions
MAT 544 Problem Set 2 Solutions Problems. Problem 1 A metric space is separable if it contains a dense subset which is finite or countably infinite. Prove that every totally bounded metric space X is separable.
More informationMathematics II, course
Mathematics II, course 20132014 Juan Pablo Rincón Zapatero October 24, 2013 Summary: The course has four parts that we describe below. (I) Topology in Rn is a brief review of the main concepts and properties
More informationMH 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 informationLecture Notes DRE 7007 Mathematics, PhD
Eivind Eriksen Lecture Notes DRE 7007 Mathematics, PhD August 21, 2012 BI Norwegian Business School Contents 1 Basic Notions.................................................. 1 1.1 Sets......................................................
More informationReal Analysis Chapter 4 Solutions Jonathan Conder
2. Let x, y X and suppose that x y. Then {x} c is open in the cofinite topology and contains y but not x. The cofinite topology on X is therefore T 1. Since X is infinite it contains two distinct points
More informationChapter 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 informationconverges as well if x < 1. 1 x n x n 1 1 = 2 a nx n
Solve the following 6 problems. 1. Prove that if series n=1 a nx n converges for all x such that x < 1, then the series n=1 a n xn 1 x converges as well if x < 1. n For x < 1, x n 0 as n, so there exists
More information2 Topology of a Metric Space
2 Topology of a Metric Space The real number system has two types of properties. The first type are algebraic properties, dealing with addition, multiplication and so on. The other type, called topological
More informationChapter 3. Topology of the Real Numbers.
3.1. Topology of the Real Numbers 1 Chapter 3. Topology of the Real Numbers. 3.1. Topology of the Real Numbers. Note. In this section we topological properties of sets of real numbers such as open, closed,
More informationReal Analysis. July 10, These notes are intended for use in the warmup camp for incoming Berkeley Statistics
Real Analysis July 10, 2006 1 Introduction These notes are intended for use in the warmup camp for incoming Berkeley Statistics graduate students. Welcome to Cal! The real analysis review presented here
More informationBased on the Appendix to B. Hasselblatt and A. Katok, A First Course in Dynamics, Cambridge University press,
NOTE ON ABSTRACT RIEMANN INTEGRAL Based on the Appendix to B. Hasselblatt and A. Katok, A First Course in Dynamics, Cambridge University press, 2003. a. Definitions. 1. Metric spaces DEFINITION 1.1. If
More informationAppendix B Convex analysis
This version: 28/02/2014 Appendix B Convex analysis In this appendix we review a few basic notions of convexity and related notions that will be important for us at various times. B.1 The Hausdorff distance
More informationFrom now on, we will represent a metric space with (X, d). Here are some examples: i=1 (x i y i ) p ) 1 p, p 1.
Chapter 1 Metric spaces 1.1 Metric and convergence We will begin with some basic concepts. Definition 1.1. (Metric space) Metric space is a set X, with a metric satisfying: 1. d(x, y) 0, d(x, y) = 0 x
More informationADVANCE TOPICS IN ANALYSIS  REAL. 8 September September 2011
ADVANCE TOPICS IN ANALYSIS  REAL NOTES COMPILED BY KATO LA Introductions 8 September 011 15 September 011 Nested Interval Theorem: If A 1 ra 1, b 1 s, A ra, b s,, A n ra n, b n s, and A 1 Ě A Ě Ě A n
More informationANALYSIS WORKSHEET II: METRIC SPACES
ANALYSIS WORKSHEET II: METRIC SPACES Definition 1. A metric space (X, d) is a space X of objects (called points), together with a distance function or metric d : X X [0, ), which associates to each pair
More informationClass Notes for MATH 255.
Class Notes for MATH 255. by S. W. Drury Copyright c 2006, by S. W. Drury. Contents 0 LimSup and LimInf Metric Spaces and Analysis in Several Variables 6. Metric Spaces........................... 6.2 Normed
More informationSystems of Linear Equations
Systems of Linear Equations Math 108A: August 21, 2008 John Douglas Moore Our goal in these notes is to explain a few facts regarding linear systems of equations not included in the first few chapters
More informationWe 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 informationA Glimpse into Topology
A Glimpse into Topology by Vishal Malik A project submitted to the Department of Mathematical Sciences in conformity with the requirements for Math 430 (2034) Lakehead University Thunder Bay, Ontario,
More informationIntroduction to Dynamical Systems
Introduction to Dynamical Systems FranceKosovo 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 informationMath 421, Homework #7 Solutions. We can then us the triangle inequality to find for k N that (x k + y k ) (L + M) = (x k L) + (y k M) x k L + y k M
Math 421, Homework #7 Solutions (1) Let {x k } and {y k } be convergent sequences in R n, and assume that lim k x k = L and that lim k y k = M. Prove directly from definition 9.1 (i.e. don t use Theorem
More informationReal Analysis Notes. Thomas Goller
Real Analysis Notes Thomas Goller September 4, 2011 Contents 1 Abstract Measure Spaces 2 1.1 Basic Definitions........................... 2 1.2 Measurable Functions........................ 2 1.3 Integration..............................
More informationIn 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 information11691 Review Guideline Real Analysis. Real Analysis.  According to Principles of Mathematical Analysis by Walter Rudin (Chapter 14)
Real Analysis  According to Principles of Mathematical Analysis by Walter Rudin (Chapter 14) 1 The Real and Complex Number Set: a collection of objects. Proper subset: if A B, then call A a proper subset
More informationMath 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 informationRoseHulman Undergraduate Mathematics Journal
RoseHulman 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.rosehulman.edu/rhumj
More informationClass Notes for MATH 454.
Class Notes for MATH 454. by S. W. Drury Copyright c 2002 2015, by S. W. Drury. Contents 1 Metric and Topological Spaces 2 1.1 Metric Spaces............................ 2 1.2 Normed Spaces...........................
More informationNOTES 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 informationMath LM (24543) Lectures 01
Math 32300 LM (24543) Lectures 01 Ethan Akin Office: NAC 6/287 Phone: 6505136 Email: ethanakin@earthlink.net Spring, 2018 Contents Introduction, Ross Chapter 1 and Appendix The Natural Numbers N and The
More informationSection 2: Classes of Sets
Section 2: Classes of Sets Notation: If A, B are subsets of X, then A \ B denotes the set difference, A \ B = {x A : x B}. A B denotes the symmetric difference. A B = (A \ B) (B \ A) = (A B) \ (A B). Remarks
More information4 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 information3 Hausdorff and Connected Spaces
3 Hausdorff and Connected Spaces In this chapter we address the question of when two spaces are homeomorphic. This is done by examining two properties that are shared by any pair of homeomorphic spaces.
More informationMath 4317 : Real Analysis I MidTerm Exam 1 25 September 2012
Instructions: Answer all of the problems. Math 4317 : Real Analysis I MidTerm Exam 1 25 September 2012 Definitions (2 points each) 1. State the definition of a metric space. A metric space (X, d) is set
More informationWeek 5 Lectures 1315
Week 5 Lectures 1315 Lecture 13 Definition 29 Let Y be a subset X. A subset A Y is open in Y if there exists an open set U in X such that A = U Y. It is not difficult to show that the collection of all
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITEDIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITEDIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More informationEssential Background for Real Analysis I (MATH 5210)
Background Material 1 Essential Background for Real Analysis I (MATH 5210) Note. These notes contain several definitions, theorems, and examples from Analysis I (MATH 4217/5217) which you must know for
More informationMATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The BolzanoWeierstrass theorem.
MATH 409 Advanced Calculus I Lecture 7: Monotone sequences. The BolzanoWeierstrass theorem. Limit of a sequence Definition. Sequence {x n } of real numbers is said to converge to a real number a if for
More information