Simplifying Section 13 By Joseph Pang
|
|
- Sherman Cobb
- 5 years ago
- Views:
Transcription
1 1 Simplifying Section 13 By Joseph Pang Motivation: This is a study week, but actually it is a March Break taken place in February. Everyone always goes out, and have no time to do their BIG B43 Assignment 5, and at the end, people realize that the due date is coming soon and try to attempt the homework. However, they find that it is mission impossible to understand one single abstract concepts in Section 13. This handout is designed for this situation. If you are feeling panic rite now, relax, and read the handout before you proceed your work again. If you finish the homework during the study week, you can just take a look at the examples in the handout for preparing section 14. Let s Start! First and most important ideas we have to understand - neighborhood. First comes with formal definition and then simplified version: 1. Definition: Neighborhood of x, N (x;ε ) (Version 1) Let x and let ε > 0. A neighborhood of x is a set of the form N(x;ε ) = { y : x - y < ε }. The number ε is referred to as the radius of N(x;ε ). Basically, a neighborhood of x of radius ε is the open interval (x-ε, x +ε ) of length 2ε centered at x. Another way to look at it is that ε is the distance from the point x, so it also implies that ε > 0 and ε 0. The above saying leads to simplified version of neighborhood of x:
2 2 2. Definition: Neighborhood of x, N (x;ε ) Neighborhood of x is the interval ( x-ε, x +ε ) where ε > 0 Here is the picture about the definition: x-ε x x+ε NOTE: ε must not be equal to zero or it is just point x itself! The Neighborhood of x is usually talking about the shaded region above and this region MUST include x. But what is Deleted Neighborhood? 3. Definition: Deleted Neighborhood of x, N* (x;ε ) N* (x;ε ) = N (x;ε ) \ {x} In another word, a deleted neighborhood of x is the neighborhood that does not include x. Here is the picture of the definition: x x-ε x +ε Notice the shaded region does not cover the point x.
3 3 eady to understand the eal stuff! In this section 13, there are two basic definitions: Interior Point and Boundary Point. For Interior, first, I will offer a formal one and then an easy one. (This is your personal preference of which one you use.) Let S be an arbitrary set in the real line. 4. Definition: Interior point (Version 1) A point x is said to be interior to a subset A of if there exists an ε >0 such that (x-ε, x +ε ) A, that is, such that y x < ε ----> y A If x is interior to A, you can say that A is a neighborhood of x. Another way of saying it is that x is interior to A.The set of all interior points of A is called the interior of A. This results the simplify version of Interior point: 5. Definition: Interior point (Version 2) A point x A is called interior point of A if there exist a neighborhood of A completely contained in A. The set of all interior points of A is called the interior, denoted by int(a). Here is the picture: Suppose x 1 and x 2 both belongs to A and x 1 x 2 and ε ε 1 2
4 4 x 1 + ε 1 x x 1 + ε1 1 x 2 + ε 1 x x 2 + ε1 2 Note that the neighborhood is entirely lies in A. Example 1: egion of Set A Q has no interior points (i.e., it has empty interior), because every open interval contains an irrational number. Assuming a < b, the point a belongs to [a,b) but not to its interior, the interior of [a,b] is (a,b) (that will be explained later). After Interior, we have boundary point: 6. Definition: Boundary point A point b is called boundary point of A if every non-empty neighborhood of b intersects A and the complement of A. The set of all boundary points of S is called the boundary of A, denoted by bd(a). Here is the picture: Suppose x 1 and x 2 both belongs to A and x 1 x 2 and ε ε 1 2
5 5 egion of A c x ε x 1 x 1 + ε 1 ε x x ε1 x egion of Set A Notice that part of the region of the neighborhood intersects with set A and part of it intersects with A c. In short, that is N(x;ε ) A φ and also, N(x;ε ) A c φ Example 2: What is the boundary and the interior point of (0,4)? Prove each assertion. Here is the picture of the boundary points: Interval for (0,4) c ε ε 1 ε ε 1 egion for Set (0,4)
6 6 FIND THE BOUNDAY POINTS: The boundary of (0,4) is the set consisting of the two elements {0,4}. Every neighborhood of these two points contains points both from the interval (0,4) and from the complement of that interval. Therefore, both form the boundary. FIND THE INTEIO POINTS: Here is the picture for finding the interior points: x 4-x 0 x 4 Here I give an informal proof for the interior points. To find the interior point of (0,4), we have to apply the definition #1. Let S be the open interval of (0,4) and let x S. If ε = min {x, 4-x}, then we claim that N(x;ε ) S. Indeed for all y N(x;ε ) we have y - x < ε, so that -x - ε < y x < ε 4-x Thus, 0 < y < 5 and y belongs to S. It follows that every point in S is an interior point of S. So by definition of Interior point of version 2, we can conclude that S = int(s) You may ask why we have ε = min {x, 4-x}, the reason is that the we have smallest epsilon to ensure the neighborhood of x covers all the points in the set. If you look back Example 1, why the interior of [a,b] is (a,b)? Since a and b are boundary points of [a,b]! They are not part of the interior point of [a,b]. Now, we have to introduce another two main concepts: Open and Closed. In here I will give the definition of these two terms and follow by a corollary. 7. Definition: Open Set Let A. We say that A is an open set if, given any x A, we can always find an open interval (x-ε, x +ε ) which contains x, and which is a subset of A. In other words, x (x-ε, x +ε ) A From this, we can also say a set S is open if and only if A=int(A).
7 7 Well, you will also find there is a difference between our textbook on page 117 and in here. If you really want to use that, here is my interpretation of this definition. 8. Definition: Open Set (book + my interpretation) If bd(a) \ A, then A is said to be open. (book s definition) If bd(a) does not belong to A then A is said to be open. (my interpretation) Enough! How come there are so many different versions of Open set? EMEMBE, they are all equivalent, they just define it in different ways! The reason to offer so many versions is to give you more choice to understand one thing. You can choose whichever you feel comfortable with. Now, we have open and we should have closed too! First we start with book definition: 9. Definition: Closed (Version 1) A set A is said to be Closed it bd(a) A. (textbook s definition) What the heck does that mean? Let s visualize first (Using version 2 s definition): Suppose there is a subset S and a, b and a < b then, a Notice that a and b DOES belong to the set S. b Here is another definition of Closed that is useful for assignment purposes :
8 8 10. Definition: Closed (Version 2) A set A is called Closed if the complement of A, \A, is open. Here is the picture of the Closed (version 1) a b Now notice that a and b does not belong to the complement of A, so where does a and b belongs to? The only choice is a and b belongs to the Set A! This is what version 1 of Closed talk about! Therefore it tells you that both versions of definition are equivalent. You can find or feel there is obvious difference. For open, a and b must not belong to the set while for closed, a and b must belong to the set. Then your following question you will ask me, Do open and closed ha s relationship? The answer is the following.. ; -) 11. Theorem. For a subset A of i) A is open A c is closed. ii) A is closed A c is open. In terms of Solving assignment question, # 11 can do the following: 1. If you try to prove something open then show A c is closed. Here is the picture: egion of Set A egion of A c, show they are closed!
9 9 2. If you try to prove something closed then show A c is open. That is: egion of Set A egion of A c, show they are open! Let s look at two examples: Example 3 Let s look at two sets ( -3,3) and [4,7] To show (-3,3) is open, you have two choices, one is using definition #9 or you can use definition #7. In here, I will use definition #9 here. Notice that bd(-3,3) (-3,3), so we can conclude that (-3,3) is open. If you want to use theorem # 12 to show (-3,3) is open, then notice that 3, 3 (-3,3), and its complement is [-,-3] [3, ]. Hence (-3,3) is open. To show [4,7] is closed, you also have two choices, one is using definition # 10 and the other is using theorem # 12 (actually they are saying the same thing). Using definition # 10, first notice that 4,7 [4,7] and then its complement consists of the two open sets (-,4) and (7, ). So we can conclude that [4,7] is closed. The above definition and theorem on open and closed set is not good enough to help us to solve more sophisticated question, so we need to know some properties about them. 12. Open Set Properties i) The union of an arbitrary collection of open subsets in is open. ii) The intersection of any finite collection of open sets in is open.
10 10 Here is the Closed Set Properties 13. Closed Set Properties i) The intersection of an arbitrary collection of closed sets in is closed. ii) The union of any finite collection of closed sets in is closed. Example 4 For any set S. Let F denotes as the union of finite number of the closed sets contained in S. Show that F is a closed set. Proof: Given that F 1, F 2,., F n are closed in and let F:= F 1 F 2. F n. By the De Morgan identity the complement of F is given by F C C C = F F F C since each set F is open, it follows from (9) that i it F is closed. C n C F is open. Hence, by Theorem #12, C You will ask why F is open? Well, the answer is that from the example 3, the complement of any closed set is open, so it leads the above result. Getting Deep!! The most difficult concepts to understand in this section are accumulation point, isolated point and closure. First, I will give you definitions of accumulation point and isolated point, then offer two examples about the concept. 14. Definition: Accumulation Point (Version 1) Let A be a subset in. A point x is called an accumulation point of A if every N(x; ε ) contains at least one point of A distinct from x.
11 11 Here is the picture of this definition b-ε b b+ε Point in neighborhood egion of Set A The whole idea of accumulation is that there exist at least one point in (b-ε, b+ε ). Now, here is another version of accumulation point. 15. Definition: Accumulation Point (Version 2) Let A be a subset in. A point x is called an accumulation point of A if every N(x;ε ) contains infinitely many distinct points of A. The accumulation point of A denoted as A. These two definitions are equivalent. In fact, version 2 also tells you one important issue: a set cannot have an accumulation point unless it contains infinitely many points to begin with. But the converse is not true, for example the set of integer {1,2,3,.} is an infinite set with no accumulation points. Now here is the definition for isolated point. 16. Definition: Isolated Point (Our book s definition) If x A but x is not an accumulation point of A, then x is called an isolated point of A. What does that mean? Here is the interpretation:
12 12 Isolated point Accumulation point of S The following is the relationship between closed set and accumulation point. 17. elationship between Closed set and accumulation point Let A be a subset in. A set A is closed if and only if A contains all of its accumulation points. Example 5 Find the isolated and accumulation points, if any, for the set {1, 1/4, 1/6,1/12,.} {0} Here is the picture: 0 1/12 1/6 1/4 Infinitely many points approaching to 0 Analysis: emember 0 is not part of the set in the form x = 1 2n, and notice that the next element after 1/4 is 1/6, so there is no point between two points. If you take the neighborhood of 1/4, you find that they are empty interval. Also, if you take a neighborhood for 0 you will find many distinct point lying inside the neighborhood. Proof: Notice that every point except 0 is an isolated point. First it is easy to find a small enough 1 neighborhood for any point of the form x = that does not contain any point from the 2n
13 13 set but x = 1 2n. Therefore every point x = 1 2n is isolated. (Think about it, 1/4 is after 0 from the sequence, is there any point between these two points? Also, please look back definition 16 and its explanation below, we can t have accumulation unless its neighborhood contains infinitely many points.) On the other hand, if (-b, b) is any small neighborhood of 0, then if n is large enough, 1 x = 0. Notice that the neighborhood of 0 has many distinct points in its 2 n neighborhood, so 0 is not isolated and it is accumulation point of the set. Example 6: Denote that S is all the accumulation point of set S. Show (S ) S. That is show the accumulation of the accumulation point of S is the subset of the accumulation point of S. Proof For every x (S ), then x is an accumulation point of S. Since S is closed (by #13) then x must belong to S as every closed set contains all of its accumulation points. Hence, we can conclude that (S ) S. Now we come to the last point of the section Closure! We are almost done..! Here is the definition and associated properties of Closure. 18. Definition: Closure (Version 1) cl(a) = A A where A is the set of all accumulation points of A. If you like to think in terms of neighborhood, here is one for you: 19. Definition: Closure (Version 2) A point x is in cl(a) if and only if every neighborhood of x intersects A. Note x is not necessarily in the set A.
14 14 Here is the picture of the definition of Closure of Version 2 (for x does not belong to A but belongs to A ) Suppose we have set A which has a and b such that a < b then, a b isolated points c The holes are the points in interior that is missing. The black dots are isolated points. The vertical lines indicated the sequence approaching some arbitrary points c (note: C is not necessarily an element of A). Here is the picture of the definition of A (accumulation point of set A) a Here is the picture of the closure of A (cl(a) = A A b c a b isolated points c The effect of closure is very simple. It just adds in the boundary points and terminates the sequences and fills in the holes. That s all!
15 Properties of Closure i) cl(s) is a closed set. ii) S is closed iff S = cl S iii) cls = S bd S The proof # 16 can be found in the course handout Some Worked Proofs. Example 7 1 Find the closure of S = { : n Ν} 2n Solution First expand the sequence to see the clear picture. {1, 1/4, 1/6,1/12,.} {0}. and from the previous example, 0 is the accumulation point. So by the definition of closure of version 1, then cl(s) = S S and given that S is {0} so the answer is cl(s) = S {0}. eference 1. Apostol, T.M., Mathematical Analysis., Second Edition, Addison-Wesley, Philippines, Bartle,.G., Introduction to eal Analysis, Third Edition, John Wiley & Sons, New York, Berberian, Sterling K., A First Course in eal Analysis, First Edition, Springer Verlag, New York, Lay, Steven., Analysis With An Introduction to Proof, Third Edition, Prentice Hall, New Jersey, 2001.
16 16 5. udin, Walter., Principles of Mathematical Analysis, McGraw-Hill, New York, Interactive eal Analysis - Topology, 1/3/ Analysis Web Notes, 2/15/2003 That s it Folks! Hope this handout can help your assignment! Joseph Pang Thanks for Dr. Adrian Butscher s valuable opinion - The End of the handout -
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 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 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 information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationStudy skills for mathematicians
PART I Study skills for mathematicians CHAPTER 1 Sets and functions Everything starts somewhere, although many physicists disagree. Terry Pratchett, Hogfather, 1996 To think like a mathematician requires
More information5.5 Deeper Properties of Continuous Functions
200 CHAPTER 5. LIMIT AND CONTINUITY OF A FUNCTION 5.5 Deeper Properties of Continuous Functions 5.5.1 Intermediate Value Theorem and Consequences When one studies a function, one is usually interested
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 informationTopology. 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 informationThe discrete and indiscrete topologies on any set are zero-dimensional. The Sorgenfrey line
p. 1 Math 525 Notes on section 17 Isolated points In general, a point x in a topological space (X,τ) is called an isolated point iff the set {x} is τ-open. A topological space is called discrete iff every
More informationSTRONGLY 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 informationConsequences of the Completeness Property
Consequences of the Completeness Property Philippe B. Laval KSU Today Philippe B. Laval (KSU) Consequences of the Completeness Property Today 1 / 10 Introduction In this section, we use the fact that R
More informationAn Intuitive Introduction to Motivic Homotopy Theory Vladimir Voevodsky
What follows is Vladimir Voevodsky s snapshot of his Fields Medal work on motivic homotopy, plus a little philosophy and from my point of view the main fun of doing mathematics Voevodsky (2002). Voevodsky
More informationMath 730 Homework 6. Austin Mohr. October 14, 2009
Math 730 Homework 6 Austin Mohr October 14, 2009 1 Problem 3A2 Proposition 1.1. If A X, then the family τ of all subsets of X which contain A, together with the empty set φ, is a topology on X. Proof.
More informationAfter taking the square and expanding, we get x + y 2 = (x + y) (x + y) = x 2 + 2x y + y 2, inequality in analysis, we obtain.
Lecture 1: August 25 Introduction. Topology grew out of certain questions in geometry and analysis about 100 years ago. As Wikipedia puts it, the motivating insight behind topology is that some geometric
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 informationSolutions to Tutorial 7 (Week 8)
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 7 (Week 8) MATH2962: Real and Complex Analysis (Advanced) Semester 1, 2017 Web Page: http://www.maths.usyd.edu.au/u/ug/im/math2962/
More informationNotes on the Point-Set Topology of R Northwestern University, Fall 2014
Notes on the Point-Set Topology of R Northwestern University, Fall 2014 These notes give an introduction to the notions of open and closed subsets of R, which belong to the subject known as point-set topology.
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
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 information6.2 Important Theorems
6.2. IMPORTANT THEOREMS 223 6.2 Important Theorems 6.2.1 Local Extrema and Fermat s Theorem Definition 6.2.1 (local extrema) Let f : I R with c I. 1. f has a local maximum at c if there is a neighborhood
More informationCOMPLEX ANALYSIS TOPIC XVI: SEQUENCES. 1. Topology of C
COMPLEX ANALYSIS TOPIC XVI: SEQUENCES PAUL L. BAILEY Abstract. We outline the development of sequences in C, starting with open and closed sets, and ending with the statement of the Bolzano-Weierstrauss
More informationMathematics-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 informationHW 4 SOLUTIONS. , x + x x 1 ) 2
HW 4 SOLUTIONS The Way of Analysis p. 98: 1.) Suppose that A is open. Show that A minus a finite set is still open. This follows by induction as long as A minus one point x is still open. To see that A
More informationDefinition 2.1. A metric (or distance function) defined on a non-empty 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 non-empty 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 informationMath 101: Course Summary
Math 101: Course Summary Rich Schwartz August 22, 2009 General Information: Math 101 is a first course in real analysis. The main purpose of this class is to introduce real analysis, and a secondary purpose
More information106 CHAPTER 3. TOPOLOGY OF THE REAL LINE. 2. The set of limit points of a set S is denoted L (S)
106 CHAPTER 3. TOPOLOGY OF THE REAL LINE 3.3 Limit Points 3.3.1 Main Definitions Intuitively speaking, a limit point of a set S in a space X is a point of X which can be approximated by points of S other
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 informationTopology, 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 informationMath 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 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 informationWe set up the basic model of two-sided, one-to-one matching
Econ 805 Advanced Micro Theory I Dan Quint Fall 2009 Lecture 18 To recap Tuesday: We set up the basic model of two-sided, one-to-one matching Two finite populations, call them Men and Women, who want to
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 informationMATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets
MATH 521, WEEK 2: Rational and Real Numbers, Ordered Sets, Countable Sets 1 Rational and Real Numbers Recall that a number is rational if it can be written in the form a/b where a, b Z and b 0, and a number
More informationMath 110 (S & E) Textbook: Calculus Early Transcendentals by James Stewart, 7 th Edition
Math 110 (S & E) Textbook: Calculus Early Transcendentals by James Stewart, 7 th Edition 1 Appendix A : Numbers, Inequalities, and Absolute Values Sets A set is a collection of objects with an important
More informationLecture 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 informationOne-to-one functions and onto functions
MA 3362 Lecture 7 - One-to-one and Onto Wednesday, October 22, 2008. Objectives: Formalize definitions of one-to-one and onto One-to-one functions and onto functions At the level of set theory, there are
More informationP-adic Functions - Part 1
P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant
More informationCourse 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 informationarxiv: v1 [math.mg] 4 Jan 2013
On the boundary of closed convex sets in E n arxiv:1301.0688v1 [math.mg] 4 Jan 2013 January 7, 2013 M. Beltagy Faculty of Science, Tanta University, Tanta, Egypt E-mail: beltagy50@yahoo.com. S. Shenawy
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 informationCHAPTER 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 informationThe Lebesgue Integral
The Lebesgue Integral Brent Nelson In these notes we give an introduction to the Lebesgue integral, assuming only a knowledge of metric spaces and the iemann integral. For more details see [1, Chapters
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 information2. The Concept of Convergence: Ultrafilters and Nets
2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two
More informationThe Gauss-Jordan Elimination Algorithm
The Gauss-Jordan Elimination Algorithm Solving Systems of Real Linear Equations A. Havens Department of Mathematics University of Massachusetts, Amherst January 24, 2018 Outline 1 Definitions Echelon Forms
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 informationTheorems. 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 informationMA651 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 informationAssignment #2 COMP 3200 Spring 2012 Prof. Stucki
Assignment #2 COMP 3200 Spring 2012 Prof. Stucki 1) Construct deterministic finite automata accepting each of the following languages. In (a)-(c) the alphabet is = {0,1}. In (d)-(e) the alphabet is ASCII
More informationMath 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 informationConsequences of Continuity
Consequences of Continuity James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University October 4, 2017 Outline 1 Domains of Continuous Functions 2 The
More informationCM10196 Topic 2: Sets, Predicates, Boolean algebras
CM10196 Topic 2: Sets, Predicates, oolean algebras Guy McCusker 1W2.1 Sets Most of the things mathematicians talk about are built out of sets. The idea of a set is a simple one: a set is just a collection
More informationSupra β-connectedness on Topological Spaces
Proceedings of the Pakistan Academy of Sciences 49 (1): 19-23 (2012) Copyright Pakistan Academy of Sciences ISSN: 0377-2969 Pakistan Academy of Sciences Original Article Supra β-connectedness on Topological
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 informationExamples of metric spaces. Uniform Convergence
Location Kroghstræde 7, room 63. Main A T. Apostol, Mathematical Analysis, Addison-Wesley. BV M. Bökstedt and H. Vosegaard, Notes on point-set topology, electronically available at http://home.imf.au.dk/marcel/gentop/index.html.
More informationON 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 informationReal Analysis Prof. S.H. Kulkarni Department of Mathematics Indian Institute of Technology, Madras. Lecture - 13 Conditional Convergence
Real Analysis Prof. S.H. Kulkarni Department of Mathematics Indian Institute of Technology, Madras Lecture - 13 Conditional Convergence Now, there are a few things that are remaining in the discussion
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationLecture 4: Constructing the Integers, Rationals and Reals
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define
More informationSection 8.4 Closures of Relations
Section 8.4 Closures of Relations Definition: The closure of a relation R with respect to property P is the relation obtained by adding the minimum number of ordered pairs to R to obtain property P. In
More informationCountability. 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 informationSequence 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 informationLebesgue Measure and The Cantor Set
Math 0 Final year project Lebesgue Measure and The Cantor Set Jason Baker, Kyle Henke, Michael Sanchez Overview Define a measure Define when a set has measure zero Find the measure of [0, ], I and Q Construct
More informationImportant Properties of R
Chapter 2 Important Properties of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
More informationMath 3361-Modern Algebra Lecture 08 9/26/ Cardinality
Math 336-Modern Algebra Lecture 08 9/26/4. Cardinality I started talking about cardinality last time, and you did some stuff with it in the Homework, so let s continue. I said that two sets have the same
More informationLecture 2: A crash course in Real Analysis
EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 2: A crash course in Real Analysis Lecturer: Dr. Krishna Jagannathan Scribe: Sudharsan Parthasarathy This lecture is
More information2. 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 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 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 informationRough Sets. V.W. Marek. General introduction and one theorem. Department of Computer Science University of Kentucky. October 2013.
General introduction and one theorem V.W. Marek Department of Computer Science University of Kentucky October 2013 What it is about? is a popular formalism for talking about approximations Esp. studied
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 10/31/16
60.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Matroids and Greedy Algorithms Date: 0/3/6 6. Introduction We talked a lot the last lecture about greedy algorithms. While both Prim
More informationNOTIONS OF DIMENSION
NOTIONS OF DIENSION BENJAIN A. STEINHURST A quick overview of some basic notions of dimension for a summer REU program run at UConn in 200 with a view towards using dimension as a tool in attempting to
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 informationDiscrete Mathematics. (c) Marcin Sydow. Sets. Set operations. Sets. Set identities Number sets. Pair. Power Set. Venn diagrams
Contents : basic definitions and notation A set is an unordered collection of its elements (or members). The set is fully specified by its elements. Usually capital letters are used to name sets and lowercase
More informationFOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 2
FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 2 RAVI VAKIL CONTENTS 1. Where we were 1 2. Yoneda s lemma 2 3. Limits and colimits 6 4. Adjoints 8 First, some bureaucratic details. We will move to 380-F for Monday
More informationMAT 211, Spring 2015, Introduction to Linear Algebra.
MAT 211, Spring 2015, Introduction to Linear Algebra. Lecture 04, 53103: MWF 10-10:53 AM. Location: Library W4535 Contact: mtehrani@scgp.stonybrook.edu Final Exam: Monday 5/18/15 8:00 AM-10:45 AM The aim
More informationLecture Notes On THEORY OF COMPUTATION MODULE -1 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lecture Notes On THEORY OF COMPUTATION MODULE -1 UNIT - 2 Prepared by, Dr. Subhendu Kumar Rath, BPUT, Odisha. UNIT 2 Structure NON-DETERMINISTIC FINITE AUTOMATA
More informationEconomics 204 Fall 2012 Problem Set 3 Suggested Solutions
Economics 204 Fall 2012 Problem Set 3 Suggested Solutions 1. Give an example of each of the following (and prove that your example indeed works): (a) A complete metric space that is bounded but not compact.
More informationLECTURE 10: REVIEW OF POWER SERIES. 1. Motivation
LECTURE 10: REVIEW OF POWER SERIES By definition, a power series centered at x 0 is a series of the form where a 0, a 1,... and x 0 are constants. For convenience, we shall mostly be concerned with the
More informationSection 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.
Section 2.2 Set Operations Propositional calculus and set theory are both instances of an algebraic system called a Boolean Algebra. The operators in set theory are defined in terms of the corresponding
More informationLecture 3: Sizes of Infinity
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 3: Sizes of Infinity Week 2 UCSB 204 Sizes of Infinity On one hand, we know that the real numbers contain more elements than the rational
More information5.5 Deeper Properties of Continuous Functions
5.5. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 195 5.5 Deeper Properties of Continuous Functions 5.5.1 Intermediate Value Theorem and Consequences When one studies a function, one is usually interested
More informationWHAT IS A CHAOTIC ATTRACTOR?
WHAT IS A CHAOTIC ATTRACTOR? CLARK ROBINSON Abstract. Devaney gave a mathematical definition of the term chaos, which had earlier been introduced by Yorke. We discuss issues involved in choosing the properties
More information2.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 informationRose-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 informationReal Analysis on Metric Spaces
Real Analysis on Metric Spaces Mark Dean Lecture Notes for Fall 014 PhD Class - Brown University 1 Lecture 1 The first topic that we are going to cover in detail is what we ll call real analysis. The foundation
More informationSOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS
LE MATEMATICHE Vol. LVII (2002) Fasc. I, pp. 6382 SOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS VITTORINO PATA - ALFONSO VILLANI Given an arbitrary real function f, the set D
More informationTopology Homework Assignment 1 Solutions
Topology Homework Assignment 1 Solutions 1. Prove that R n with the usual topology satisfies the axioms for a topological space. Let U denote the usual topology on R n. 1(a) R n U because if x R n, then
More informationCHAPTER 0 PRELIMINARY MATERIAL. Paul Vojta. University of California, Berkeley. 18 February 1998
CHAPTER 0 PRELIMINARY MATERIAL Paul Vojta University of California, Berkeley 18 February 1998 This chapter gives some preliminary material on number theory and algebraic geometry. Section 1 gives basic
More informationCSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010
CSC 5170: Theory of Computational Complexity Lecture 9 The Chinese University of Hong Kong 15 March 2010 We now embark on a study of computational classes that are more general than NP. As these classes
More informationVector Spaces. 9.1 Opening Remarks. Week Solvable or not solvable, that s the question. View at edx. Consider the picture
Week9 Vector Spaces 9. Opening Remarks 9.. Solvable or not solvable, that s the question Consider the picture (,) (,) p(χ) = γ + γ χ + γ χ (, ) depicting three points in R and a quadratic polynomial (polynomial
More informationMath 4603: Advanced Calculus I, Summer 2016 University of Minnesota Homework Schedule
Math 4603: Advanced Calculus I, Summer 2016 University of Minnesota Homework Schedule Notations I will use the symbols N, Z, Q and R to denote the set of all natural numbers, the set of all integers, the
More informationMath 31 Lesson Plan. Day 5: Intro to Groups. Elizabeth Gillaspy. September 28, 2011
Math 31 Lesson Plan Day 5: Intro to Groups Elizabeth Gillaspy September 28, 2011 Supplies needed: Sign in sheet Goals for students: Students will: Improve the clarity of their proof-writing. Gain confidence
More informationMeasures. 1 Introduction. These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland.
Measures These preliminary lecture notes are partly based on textbooks by Athreya and Lahiri, Capinski and Kopp, and Folland. 1 Introduction Our motivation for studying measure theory is to lay a foundation
More informationProblems for Chapter 3.
Problems for Chapter 3. Let A denote a nonempty set of reals. The complement of A, denoted by A, or A C is the set of all points not in A. We say that belongs to the interior of A, Int A, if there eists
More informationRECOVERY OF NON-LINEAR CONDUCTIVITIES FOR CIRCULAR PLANAR GRAPHS
RECOVERY OF NON-LINEAR CONDUCTIVITIES FOR CIRCULAR PLANAR GRAPHS WILL JOHNSON Abstract. We consider the problem of recovering nonlinear conductances in a circular planar graph. If the graph is critical
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 informationIntroductory 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 informationSupplementary Notes on Inductive Definitions
Supplementary Notes on Inductive Definitions 15-312: Foundations of Programming Languages Frank Pfenning Lecture 2 August 29, 2002 These supplementary notes review the notion of an inductive definition
More information