DOCSLIB.ORG

METRIC SPACES and SOME BASIC TOPOLOGY

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
METRIC SPACES and SOME BASIC TOPOLOGY Chapter 3 METRIC SPACES and SOME BASIC TOPOLOGY Thus far, our focus has been on studying, reviewing, and/or developing an under- standing and ability to make use of properties of U U1. The next goal is to generalize our work to Un and, eventually, to study functions on Un. 3.1 Euclidean n-space The set Un is an extension of the concept of the Cartesian product of two sets that was studied in MAT108. For completeness, we include the following De¿nition 3.1.1 Let S and T be sets. The Cartesian product of S and T , denoted by S T,is p q : p + S F q + T . The Cartesian product of any ¿nite number of sets S1 S2 SN , denoted by S1 S2 SN ,is j b ck p1 p2 pN : 1 j j + M F 1 n j n N " p j + S j . The object p1 p2pN is called an N-tuple. Our primary interest is going to be the case where each set is the set of real numbers. 73 74 CHAPTER 3. METRIC SPACES AND SOME BASIC TOPOLOGY De¿nition 3.1.2 Real n-space,denotedUn, is the set all ordered n-tuples of real numbers i.e., n U x1 x2 xn : x1 x2 xn + U . Un U U U U Thus, _ ^] `, the Cartesian product of with itself n times. nofthem Remark 3.1.3 From MAT108, recall the de¿nition of an ordered pair: a b a a b . def This de¿nition leads to the more familiar statement that a b c d if and only if a bandc d. It also follows from the de¿nition that, for sets A, B and C, A B C is, in general, not equal to A B C i.e., the Cartesian product is not associative. Hence, some conventions are introduced in order to give meaning to the extension of the binary operation to more that two sets. If we de¿ne ordered triples in terms of ordered pairs by setting a b c a b c this would allow us to claim that a b c x y z if and only if a x, b y, and c z. With this in mind, we interpret the Cartesian product of sets that are themselves Cartesian products as “big” Cartesian products with each entry in the tuple inheriting restrictions from the original sets. The point is to have helpful descriptions of objects that are described in terms of n-tuple. Addition and scalar multiplication on n-tuple is de¿ned by x1 x2xn y1 y2 yn x1 y1 x2 y2xn yn and : x1 x2 xn :x1:x2 :xn ,for: + U, respectively. The geometric meaning of addition and scalar multiplication over U2 and U3 as well as other properties of these vector spaces was the subject of extensive study in vector calculus courses (MAT21D on this campus). For each n, n o 2, it can be shown that Un is a real vector space. De¿nition 3.1.4 A real vector space Y is a set of elements called vectors,with given operations of vector addition : Y Y Y and scalar multiplication : U Y Y that satisfy each of the following: 3.1. EUCLIDEAN N-SPACE 75 1. 1v1wv w + Y " v w w v commutativity 2. 1u1v1wu v w + Y " u v w u v w associativity 3. 200 + Y F 1vv + Y " 0 v v 0 v zero vector 4. 1vv + Y " 2 v v + Y F v v v v 0 negatives 5. 1D1v1wD + U F v w + Y " D v w D v D w distribu- tivity 6. 1D1< 1wD < + U F w + Y " D < w D< w associativity 7. 1D 1<1wD< + U F w + Y " D < w D w< w distribu- tivity 8. 1vv + Y " 1 v v 1 v multiplicative identity n Given two vectors, x x1 x2xn and y y1 y2 yn in U ,theinner product (also known as the scalar product) is ;n x y x j y j j1 n and the Euclidean norm (ormagnitude)ofx x1 x2 xn + U is given by Y X T X;n b c W 2 x x x x j . j1 The vector space Un together with the inner product and Euclidean norm is called Euclidean n-space. The following two theorems pull together the basic properties that are satis¿ed by the Euclidean norm. Theorem 3.1.5 Suppose that x y z + Un and : + U. Then (a) x o 0 (b) x 0 % x 0 (c) :x : x and 76 CHAPTER 3. METRIC SPACES AND SOME BASIC TOPOLOGY (d) x y n x y . Excursion 3.1.6 Use Schwarz’s Inequality to justify part (d). For x x1 x2 xn n and y y1 y2 yn in U , x y 2 Remark 3.1.7 It often helps to take our observations back to the setting that is U1 U2 “once removed” from . For the case , the statement given in part (d) of the theorem relates to the dot product of two vectors: For G x1 x2 and @ y1 y2, we have that G @ x1 y1 x2 y2 which, in vector calculus, was shown to be equivalent to G @ cosA where A is the angle between the vectors G and @. Theorem 3.1.8 (The Triangular Inequalities) Suppose that x x1 x2 xN , N y y1 y2yN and z z1 z2 zN are elements of U . Then (a) x y n x y i.e., ;N 1 2 ;N 1 2 ;N 1 2 2 n 2 2 x j y j x j y j j1 j1 j1 where 12 denotes the positive square root and equality holds if and only if either all the x j are zero or there is a nonnegative real number D such that y j Dx j for each j, 1 n j n N and (b) x z n x y y z i.e., ;N 1 2 ;N 1 2 ;N 1 2 2 2 2 x j z j n x j y j y j z j j1 j1 j1 3.2. METRIC SPACES 77 where 12 denotes the positive square root and equality holds if and only if there is a real number r, with 0 n r n 1, such that y j rxj 1 rz j for each j, 1 n j n N. Remark 3.1.9 Again, it is useful to view the triangular inequalities on “familiar ground.” Let G x1 x2 and @ y1 y2. Then the inequalities given in The- orem 3.1.8 correspond to the statements that were given for the complex numbers i.e., statements concerning the lengths of the vectors that form the triangles that are associated with ¿nding G @ and G @. Observe that, for C x y : x2 y2 1 and I x : a n x n b where a b, the Cartesian product of the circle C with I, C I, is the right circular cylinder, U x y z : x2 y2 1 F a n z n b and the Cartesian product of I with C, I C, is the right circular cylinder, V x y z : a n x n b, y2 z2 1 If graphed on the same U3-coordinate system, U and V are different objects due to different orientation on the other hand, U and V have the same height and radius which yield the same volume, surface area etc. Consequently, distinguishing U from V depends on perspective and reason for study. In the next section, we lay the foundation for properties that place U and V in the same category. 3.2 Metric Spaces In the study of U1 and functions on U1 the length of intervals and intervals to de- scribe set properties are useful tools. Our starting point for describing properties for sets in Un is with a formulation of a generalization of distance. It should come as no surprise that the generalization leads us to multiple interpretations. De¿nition 3.2.1 Let S be a set and suppose that d : S S U1.Thendissaid to be a metric (distance function) on S if and only if it satis¿es the following three properties: d e (i) 1x1y x y + S S " dx y o 0 F dx y 0 % x y , 78 CHAPTER 3. METRIC SPACES AND SOME BASIC TOPOLOGY d e (ii) 1x1y x y + S S " dy x dx y (symmetry), and d e (iii) 1x1y1z x y z + S " dx z n dx y dy z (triangle inequal- ity). De¿nition 3.2.2 A metric space consists of a pair S d–a set, S, and a metric, d, on S. Remark 3.2.3 There are three commonly used (studied) metrics for the set UN . For x x1 x2xN and y y1 y2 yN , we have: T3 b c UN N 2 d where d x y j1 x j y j , the Euclidean metric, 3 UN N D where D x y j1 x j y j , and n n N n n U d* where d*x y max x j y j . 1n jnN Proving that d, D,andd* are metrics is left as an exercise. Excursion 3.2.4 Graph each of the following on Cartesian coordinate systems 1. A x + U2 : d0 x n 1 2. B x + U2 : D0 x n 1 3.2. METRIC SPACES 79 3. C x + U2 : d*0 x n 1 ***For (1), you should have gotten the closed circle with center at origin and radius one for (2), your work should have led you to a “diamond” having vertices at 1 0, 0 1, 1 0,and0 1 the closed shape for (3) is the square with vertices 1 1, 1 1, 1 1,and1 1.*** Though we haven’t de¿ned continuous and integrable functions yet as a part of this course, we offer the following observation to make the point that metric spaces can be over different objects.
Load more

Recommended publications
  • Interval Notation and Linear Inequalities
    CHAPTER 1 Introductory Information and Review Section 1.7: Interval Notation and Linear Inequalities Linear Inequalities Linear Inequalities Rules for Solving Inequalities: 86 University of Houston Department of Mathematics SECTION 1.7 Interval Notation and Linear Inequalities Interval Notation: Example: Solution: MATH 1300 Fundamentals of Mathematics 87 CHAPTER 1 Introductory Information and Review Example: Solution: Example: 88 University of Houston Department of Mathematics SECTION 1.7 Interval Notation and Linear Inequalities Solution: Additional Example 1: Solution: MATH 1300 Fundamentals of Mathematics 89 CHAPTER 1 Introductory Information and Review Additional Example 2: Solution: 90 University of Houston Department of Mathematics SECTION 1.7 Interval Notation and Linear Inequalities Additional Example 3: Solution: Additional Example 4: Solution: MATH 1300 Fundamentals of Mathematics 91 CHAPTER 1 Introductory Information and Review Additional Example 5: Solution: Additional Example 6: Solution: 92 University of Houston Department of Mathematics SECTION 1.7 Interval Notation and Linear Inequalities Additional Example 7: Solution: MATH 1300 Fundamentals of Mathematics 93 Exercise Set 1.7: Interval Notation and Linear Inequalities For each of the following inequalities: Write each of the following inequalities in interval (a) Write the inequality algebraically. notation. (b) Graph the inequality on the real number line. (c) Write the inequality in interval notation. 23. 1. x is greater than 5. 2. x is less than 4. 24. 3. x is less than or equal to 3. 4. x is greater than or equal to 7. 25. 5. x is not equal to 2. 6. x is not equal to 5 . 26. 7. x is less than 1. 8.
    [Show full text]
  • Interval Computations: Introduction, Uses, and Resources
    Interval Computations: Introduction, Uses, and Resources R. B. Kearfott Department of Mathematics University of Southwestern Louisiana U.S.L. Box 4-1010, Lafayette, LA 70504-1010 USA email: [email protected] Abstract Interval analysis is a broad field in which rigorous mathematics is as- sociated with with scientific computing. A number of researchers world- wide have produced a voluminous literature on the subject. This article introduces interval arithmetic and its interaction with established math- ematical theory. The article provides pointers to traditional literature collections, as well as electronic resources. Some successful scientific and engineering applications are listed. 1 What is Interval Arithmetic, and Why is it Considered? Interval arithmetic is an arithmetic defined on sets of intervals, rather than sets of real numbers. A form of interval arithmetic perhaps first appeared in 1924 and 1931 in [8, 104], then later in [98]. Modern development of interval arithmetic began with R. E. Moore’s dissertation [64]. Since then, thousands of research articles and numerous books have appeared on the subject. Periodic conferences, as well as special meetings, are held on the subject. There is an increasing amount of software support for interval computations, and more resources concerning interval computations are becoming available through the Internet. In this paper, boldface will denote intervals, lower case will denote scalar quantities, and upper case will denote vectors and matrices. Brackets “[ ]” will delimit intervals while parentheses “( )” will delimit vectors and matrices.· Un- derscores will denote lower bounds of· intervals and overscores will denote upper bounds of intervals. Corresponding lower case letters will denote components of vectors.
    [Show full text]
  • Chapter 7 Separation Properties
    Chapter VII Separation Axioms 1. Introduction “Separation” refers here to whether or not objects like points or disjoint closed sets can be enclosed in disjoint open sets; “separation properties” have nothing to do with the idea of “separated sets” that appeared in our discussion of connectedness in Chapter 5 in spite of the similarity of terminology.. We have already met some simple separation properties of spaces: the XßX!"and X # (Hausdorff) properties. In this chapter, we look at these and others in more depth. As “more separation” is added to spaces, they generally become nicer and nicer especially when “separation” is combined with other properties. For example, we will see that “enough separation” and “a nice base” guarantees that a space is metrizable. “Separation axioms” translates the German term Trennungsaxiome used in the older literature. Therefore the standard separation axioms were historically named XXXX!"#$, , , , and X %, each stronger than its predecessors in the list. Once these were common terminology, another separation axiom was discovered to be useful and “interpolated” into the list: XÞ"" It turns out that the X spaces (also called $$## Tychonoff spaces) are an extremely well-behaved class of spaces with some very nice properties. 2. The Basics Definition 2.1 A topological space \ is called a 1) X! space if, whenever BÁC−\, there either exists an open set Y with B−Y, CÂY or there exists an open set ZC−ZBÂZwith , 2) X" space if, whenever BÁC−\, there exists an open set Ywith B−YßCÂZ and there exists an open set ZBÂYßC−Zwith 3) XBÁC−\Y# space (or, Hausdorff space) if, whenever , there exist disjoint open sets and Z\ in such that B−YC−Z and .
    [Show full text]
  • General Topology
    General Topology Tom Leinster 2014{15 Contents A Topological spaces2 A1 Review of metric spaces.......................2 A2 The definition of topological space.................8 A3 Metrics versus topologies....................... 13 A4 Continuous maps........................... 17 A5 When are two spaces homeomorphic?................ 22 A6 Topological properties........................ 26 A7 Bases................................. 28 A8 Closure and interior......................... 31 A9 Subspaces (new spaces from old, 1)................. 35 A10 Products (new spaces from old, 2)................. 39 A11 Quotients (new spaces from old, 3)................. 43 A12 Review of ChapterA......................... 48 B Compactness 51 B1 The definition of compactness.................... 51 B2 Closed bounded intervals are compact............... 55 B3 Compactness and subspaces..................... 56 B4 Compactness and products..................... 58 B5 The compact subsets of Rn ..................... 59 B6 Compactness and quotients (and images)............. 61 B7 Compact metric spaces........................ 64 C Connectedness 68 C1 The definition of connectedness................... 68 C2 Connected subsets of the real line.................. 72 C3 Path-connectedness.......................... 76 C4 Connected-components and path-components........... 80 1 Chapter A Topological spaces A1 Review of metric spaces For the lecture of Thursday, 18 September 2014 Almost everything in this section should have been covered in Honours Analysis, with the possible exception of some of the examples. For that reason, this lecture is longer than usual. Definition A1.1 Let X be a set. A metric on X is a function d: X × X ! [0; 1) with the following three properties: • d(x; y) = 0 () x = y, for x; y 2 X; • d(x; y) + d(y; z) ≥ d(x; z) for all x; y; z 2 X (triangle inequality); • d(x; y) = d(y; x) for all x; y 2 X (symmetry).
    [Show full text]
  • Multidisciplinary Design Project Engineering Dictionary Version 0.0.2
    Multidisciplinary Design Project Engineering Dictionary Version 0.0.2 February 15, 2006 . DRAFT Cambridge-MIT Institute Multidisciplinary Design Project This Dictionary/Glossary of Engineering terms has been compiled to compliment the work developed as part of the Multi-disciplinary Design Project (MDP), which is a programme to develop teaching material and kits to aid the running of mechtronics projects in Universities and Schools. The project is being carried out with support from the Cambridge-MIT Institute undergraduate teaching programe. For more information about the project please visit the MDP website at http://www-mdp.eng.cam.ac.uk or contact Dr. Peter Long Prof. Alex Slocum Cambridge University Engineering Department Massachusetts Institute of Technology Trumpington Street, 77 Massachusetts Ave. Cambridge. Cambridge MA 02139-4307 CB2 1PZ. USA e-mail: [email protected] e-mail: [email protected] tel: +44 (0) 1223 332779 tel: +1 617 253 0012 For information about the CMI initiative please see Cambridge-MIT Institute website :- http://www.cambridge-mit.org CMI CMI, University of Cambridge Massachusetts Institute of Technology 10 Miller’s Yard, 77 Massachusetts Ave. Mill Lane, Cambridge MA 02139-4307 Cambridge. CB2 1RQ. USA tel: +44 (0) 1223 327207 tel. +1 617 253 7732 fax: +44 (0) 1223 765891 fax. +1 617 258 8539 . DRAFT 2 CMI-MDP Programme 1 Introduction This dictionary/glossary has not been developed as a definative work but as a useful reference book for engi- neering students to search when looking for the meaning of a word/phrase. It has been compiled from a number of existing glossaries together with a number of local additions.
    [Show full text]
  • Calculus Terminology
    AP Calculus BC Calculus Terminology Absolute Convergence Asymptote Continued Sum Absolute Maximum Average Rate of Change Continuous Function Absolute Minimum Average Value of a Function Continuously Differentiable Function Absolutely Convergent Axis of Rotation Converge Acceleration Boundary Value Problem Converge Absolutely Alternating Series Bounded Function Converge Conditionally Alternating Series Remainder Bounded Sequence Convergence Tests Alternating Series Test Bounds of Integration Convergent Sequence Analytic Methods Calculus Convergent Series Annulus Cartesian Form Critical Number Antiderivative of a Function Cavalieri’s Principle Critical Point Approximation by Differentials Center of Mass Formula Critical Value Arc Length of a Curve Centroid Curly d Area below a Curve Chain Rule Curve Area between Curves Comparison Test Curve Sketching Area of an Ellipse Concave Cusp Area of a Parabolic Segment Concave Down Cylindrical Shell Method Area under a Curve Concave Up Decreasing Function Area Using Parametric Equations Conditional Convergence Definite Integral Area Using Polar Coordinates Constant Term Definite Integral Rules Degenerate Divergent Series Function Operations Del Operator e Fundamental Theorem of Calculus Deleted Neighborhood Ellipsoid GLB Derivative End Behavior Global Maximum Derivative of a Power Series Essential Discontinuity Global Minimum Derivative Rules Explicit Differentiation Golden Spiral Difference Quotient Explicit Function Graphic Methods Differentiable Exponential Decay Greatest Lower Bound Differential
    [Show full text]
  • Calculus Formulas and Theorems
    Formulas and Theorems for Reference I. Tbigonometric Formulas l. sin2d+c,cis2d:1 sec2d l*cot20:<:sc:20 +.I sin(-d) : -sitt0 t,rs(-//) = t r1sl/ : -tallH 7. sin(A* B) :sitrAcosB*silBcosA 8. : siri A cos B - siu B <:os,;l 9. cos(A+ B) - cos,4cos B - siuA siriB 10. cos(A- B) : cosA cosB + silrA sirrB 11. 2 sirrd t:osd 12. <'os20- coS2(i - siu20 : 2<'os2o - I - 1 - 2sin20 I 13. tan d : <.rft0 (:ost/ I 14. <:ol0 : sirrd tattH 1 15. (:OS I/ 1 16. cscd - ri" 6i /F tl r(. cos[I ^ -el : sitt d \l 18. -01 : COSA 215 216 Formulas and Theorems II. Differentiation Formulas !(r") - trr:"-1 Q,:I' ]tra-fg'+gf' gJ'-,f g' - * (i) ,l' ,I - (tt(.r))9'(.,') ,i;.[tyt.rt) l'' d, \ (sttt rrJ .* ('oqI' .7, tJ, \ . ./ stll lr dr. l('os J { 1a,,,t,:r) - .,' o.t "11'2 1(<,ot.r') - (,.(,2.r' Q:T rl , (sc'c:.r'J: sPl'.r tall 11 ,7, d, - (<:s<t.r,; - (ls(].]'(rot;.r fr("'),t -.'' ,1 - fr(u") o,'ltrc ,l ,, 1 ' tlll ri - (l.t' .f d,^ --: I -iAl'CSllLl'l t!.r' J1 - rz 1(Arcsi' r) : oT Il12 Formulas and Theorems 2I7 III. Integration Formulas 1. ,f "or:artC 2. [\0,-trrlrl *(' .t "r 3. [,' ,t.,: r^x| (' ,I 4. In' a,,: lL , ,' .l 111Q 5. In., a.r: .rhr.r' .r r (' ,l f 6. sirr.r d.r' - ( os.r'-t C ./ 7. /.,,.r' dr : sitr.i'| (' .t 8. tl:r:hr sec,rl+ C or ln Jccrsrl+ C ,f'r^rr f 9.
    [Show full text]
  • Assignment 5
    Differential Topology Assignment 5 Exercise 1: Classification of smooth 1-manifolds Let M be a compact, smooth and connected 1−manifold with boundary. Show that M is either diffeomorphic to a circle or to a closed interval [a; b] ⊂ R. This then shows that every compact smooth 1−manifold is build up from connected components each diffeomorphic to a circle or a closed interval. To prove the result, show the following steps: 1. Consider a Morse function f : M ! R. Let B denote the set of boundary points of M, and C the set of critical points of f. Show that M n (B[C) consists of a finite number of connected 1−manifolds, which we will call L1;:::;LN ⊂ M. 2. Prove that fk = fjLk : Lk ! f(Lk) is a diffeomorphism from Lk to an open interval f(Lk) ⊂ R. 3. Let L ⊂ M be a subset of a smooth 1−dimensional manifold M. Show that if L is diffeomorphic to an open interval in R, then there are at most two points a, b 2 L such that a, b2 = L. Here, L is the closure of L. 4. Consider a sequence (Li1 ;:::;Lik ) 2 fL1;:::;LN g. Such a sequence is called a chain if for every j 2 f1; : : : ; k − 1g the closures Lij and Lij+1 have a common boundary point. Show that a chain of maximal length m contains all of the 1−manifolds L1;:::;LN defined above. 5. To finish the proof, we will need a technical lemma. Let g :[a; b] ! R be a smooth function with positive derivative on [a; b] n fcg for c 2 (a; b).
    [Show full text]
  • DISTANCE SETS in METRIC SPACES 2.2. a = I>1
    DISTANCE SETS IN METRIC SPACES BY L. M. KELLY AND E. A. NORDHAUS 1. Introduction. In 1920 Steinhaus [lOjO) observed that the distance set of a linear set of positive Lebesgue measure contains an interval with end point zero (an initial interval). Subsequently considerable attention was de- voted to this and related ideas by Sierpinski [9], Ruziewicz [8], and others. S. Piccard in 1940 gathered together many of these results and carried out an extensive investigation of her own concerning distance sets of euclidean subsets, particularly linear subsets, in a tract entitled Sur les ensembles de distances (des ensembles de points d'un espace euclidien) [7]. Two principal problems suggest themselves in such investigations. First, what can be said of the distance set of a given space, and secondly, what can be said of the possible realizations, in a specified class of distance spaces, of a given distance set (that is, of a set of non-negative numbers including zero). The writers mentioned above have been principally concerned with the first problem, although Miss Piccard devotes some space to the second. In [4] efforts were made to improve and extend some of her results concerning the latter problem. By way of completing a survey of the literature known to us, we observe that Besicovitch and Miller [l ] have examined the influence of positive Carathéodory linear measure on distance sets of subsets of E2, while Coxeter and Todd [2] have considered the possibility of realizing finite distance sets in spaces with indefinite metrics. Numerous papers of Erdös, for example [3], contain isolated but interesting pertinent results.
    [Show full text]
  • Notes on Metric Spaces
    Notes on Metric Spaces These notes introduce the concept of a metric space, which will be an essential notion throughout this course and in others that follow. Some of this material is contained in optional sections of the book, but I will assume none of that and start from scratch. Still, you should check the corresponding sections in the book for a possibly different point of view on a few things. The main idea to have in mind is that a metric space is some kind of generalization of R in the sense that it is some kind of \space" which has a notion of \distance". Having such a \distance" function will allow us to phrase many concepts from real analysis|such as the notions of convergence and continuity|in a more general setting, which (somewhat) surprisingly makes many things actually easier to understand. Metric Spaces Definition 1. A metric on a set X is a function d : X × X ! R such that • d(x; y) ≥ 0 for all x; y 2 X; moreover, d(x; y) = 0 if and only if x = y, • d(x; y) = d(y; x) for all x; y 2 X, and • d(x; y) ≤ d(x; z) + d(z; y) for all x; y; z 2 X. A metric space is a set X together with a metric d on it, and we will use the notation (X; d) for a metric space. Often, if the metric d is clear from context, we will simply denote the metric space (X; d) by X itself.
    [Show full text]
  • Lecture 3 Vector Spaces of Functions
    12 Lecture 3 Vector Spaces of Functions 3.1 Space of Continuous Functions C(I) Let I ⊆ R be an interval. Then I is of the form (for some a < b) 8 > fx 2 Rj a < x < bg; an open interval; <> fx 2 Rj a · x · bg; a closed interval; I = > fx 2 Rj a · x < bg :> fx 2 Rj a < x · bg: Recall that the space of all functions f : I ¡! R is a vector space. We will now list some important subspaces: Example (1). Let C(I) be the space of all continuous functions on I. If f and g are continuous, so are the functions f + g and rf (r 2 R). Hence C(I) is a vector space. Recall, that a function is continuous, if the graph has no gaps. This can be formulated in di®erent ways: a) Let x0 2 I and let ² > 0 . Then there exists a ± > 0 such that for all x 2 I \ (x0 ¡ ±; x0 + ±) we have jf(x) ¡ f(x0)j < ² This tells us that the value of f at nearby points is arbitrarily close to the value of f at x0. 13 14 LECTURE 3. VECTOR SPACES OF FUNCTIONS b) A reformulation of (a) is: lim f(x) = f(x0) x!x0 3.2 Space of continuously di®erentiable func- tions C1(I) Example (2). The space C1(I). Here we assume that I is open. Recall that f is di®erentiable at x0 if f(x) ¡ f(x0) f(x0 + h) ¡ f(x0) 0 lim = lim =: f (x0) x!x0 x ¡ x0 h!0 h 0 exists.
    [Show full text]
  • Topology: the Journey Into Separation Axioms
    TOPOLOGY: THE JOURNEY INTO SEPARATION AXIOMS VIPUL NAIK Abstract. In this journey, we are going to explore the so called “separation axioms” in greater detail. We shall try to understand how these axioms are affected on going to subspaces, taking products, and looking at small open neighbourhoods. 1. What this journey entails 1.1. Prerequisites. Familiarity with definitions of these basic terms is expected: • Topological space • Open sets, closed sets, and limit points • Basis and subbasis • Continuous function and homeomorphism • Product topology • Subspace topology The target audience for this article are students doing a first course in topology. 1.2. The explicit promise. At the end of this journey, the learner should be able to: • Define the following: T0, T1, T2 (Hausdorff), T3 (regular), T4 (normal) • Understand how these properties are affected on taking subspaces, products and other similar constructions 2. What are separation axioms? 2.1. The idea behind separation. The defining attributes of a topological space (in terms of a family of open subsets) does little to guarantee that the points in the topological space are somehow distinct or far apart. The topological spaces that we would like to study, on the other hand, usually have these two features: • Any two points can be separated, that is, they are, to an extent, far apart. • Every point can be approached very closely from other points, and if we take a sequence of points, they will usually get to cluster around a point. On the face of it, the above two statements do not seem to reconcile each other. In fact, topological spaces become interesting precisely because they are nice in both the above ways.
    [Show full text]