DOCSLIB.ORG

Lecture 17: October 27 Complete Metric Spaces. Our Topic This Week Is the Space C(X, Y ) of Continuous Functions Between Two Topological Spaces X and Y

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lecture 17: October 27 Complete Metric Spaces. Our Topic This Week Is the Space C(X, Y ) of Continuous Functions Between Two Topological Spaces X and Y 1 Lecture 17: October 27 Complete metric spaces. Our topic this week is the space C(X, Y ) of continuous functions between two topological spaces X and Y . Understanding the space of all continuous functions can be very useful, for example to find interesting examples of continuous functions. This topic actually belongs more to analysis than to topology, but since it involves several results from general topology as well, it seems like a good way to finish our discussion of general topology. Before we get to the space of continuous functions, however, we have to return for a moment to the subject of metric spaces and introduce the important concept of completeness. Let (X, d) be a metric space. We saw earlier that the metric topology on X is first countable – the open balls with radius in Q form a neighborhood basis at every point – and that many properties of subsets can therefore be detected by looking at sequences: a subset A X is closed iffit is sequentially closed; a subset A X is compact iffit is sequentially⊆ compact; etc. ⊆ In analysis, an important problem is to decide whether a given sequence in a metric space converges. Typically, one does not know what the limit is – more often than not, the whole point of trying to show that the sequence converges is so that one can be sure that there is a limit. The notion of a “Cauchy sequence”, which you have probably already seen in your analysis course, was introduced to deal with this problem: proving that a sequence converges without knowing what the limit is. Definition 17.1. A sequence of points xn X is called a Cauchy sequence if, for every ε>0, one can find an integer N such∈ that d(x ,x ) <ε for all m, n N. n m ≥ Intuitively, a Cauchy sequence is one where the points xn huddle closer and closer together as n gets large. Of course, not every Cauchy sequence actually converges: in the metric space Q, any sequence that converges to an irrational number in R is a Cauchy sequence without limit in Q. Definition 17.2. A metric space (X, d) is called complete if every Cauchy sequence in X has a limit in X. So R is complete, but Q is not; this is the reason why analysts prefer to work with real numbers instead of rational numbers. There is a general construction for “completing” a metric space, similar to the way is which R can be obtained from Q. The result is that, given an arbitrary metric space (X, d), there is a complete metric space (X,ˆ dˆ) that contains X has a dense subset. Roughly speaking, the idea is to define an equivalence relation on the set of Cauchy sequences in X:two Cauchy sequences x and y are equivalent if d(x ,y ) 0 as n . The points n n n n → →∞ of Xˆ are the equivalence classes of Cauchy sequences; there is a natural metric dˆ on Xˆ, and after some checking, one finds that (X,ˆ dˆ) is complete. If you have not seen this construction in a course on analysis, have a look at Theorem 43.7 or at Exercise 43.9 in Munkres’ book. Example 17.3. Completeness of a metric space is a property of the metric, not of the topology: R and (0, 1) are homeomorphic as topological spaces, but whereas R is complete, (0, 1) is not. 2 Example 17.4. Every compact metric space is complete. To see why, suppose that x X is a Cauchy sequence. Being a metric space, X is also sequentially compact, n ∈ and so the sequence has a convergent subsequence xn(k) with x =limxn(k). k →∞ Now that we have a potential limit, we can easily show that the entire sequence xn converges to x.Fixε>0; then since xn is a Cauchy sequence, we can find N such that d(x ,x ) < ε for every n, m N. Using the triangle inequality, we get n m 2 ≥ ε ε d(x ,x) d(x ,x )+d(x ,x) < + = ε n ≤ n n(k) n(k) 2 2 for n N, by choosing k large enough so that n(k) N and d(x ,x) < ε . ≥ ≥ n(k) 2 The converse of this last result is not true: in the Euclidean metric, R is com- plete but not compact. Let us try to figure out what extraadditional condition (besides completeness) is needed to ensure that a metric space is compact. From the definition of compactness in terms of open coverings, we already know that every compact metric space has to be bounded; in fact, the following stronger form of boundedness holds. Definition 17.5. A metric space (X, d) is called totally bounded if, for every r>0, it is possible to cover X by finitely many open balls of radius r. Example 17.6. Let X be an infinite set, with the metric d(x, y)=1ifx = y, and d(x, y)=0ifx = y.ThenX is bounded, but not totally bounded. Theorem 17.7. A metric space is compact if and only if it is complete and totally bounded. Proof. We have already seen that every compact metric space is complete and totally bounded. Let us prove that the converse holds. Suppose that (X, d)isa complete metric space that is totally bounded. In a metric space, compactness is equivalent to sequential compactness, and so it suffices to show that every sequence in X has a convergent subsequence. Since X is complete, it suffices moreover to find a subsequence that is Cauchy. Let x X be a sequence of points. By assumption, we can cover X by finitely n ∈ many open balls of radius 1; evidently, at least one of these balls must contain xn for infinitely many n N. Call this ball U1, and let ∈ J1 = n N xn U1 , ∈ ∈ which is an infinite set. Similarly, we can cover X by finitely many open balls of 1 radius 2 ;sincethesetJ1 is infinite, at least one of these balls must contain xn for infinitely many n J . Call this ball U , and let ∈ 1 2 J = n J x U , 2 ∈ 1 n ∈ 2 which is again infinite. Continuing in this way, we obtain a nested sequence J1 ⊇ J2 J3 of infinite subsets of N, such that xn U1 Uk whenever n Jk. ⊇ ⊇··· ∈ ∩···∩ ∈ Now we can choose a suitable subsequence xn(k) of our original sequence. Pick any element n(1) J1; then pick an element n(2) J2 with n(2) >n(1), which exists because J is∈ infinite; then pick an element n(3)∈ J with n(3) >n(2); and 2 ∈ 3 so on. In this way, we obtain a subsequence xn(k) of the original sequence, with the property that x U U n(k) ∈ 1 ∩···∩ k 3 for every k =1, 2,.... This sequence is obviously Cauchy: whenever k , both 1 ≤ xn(k) and xn() belong to the open ball Uk of radius k , and so 2 d(x ,x ) . n(k) n() ≤ k This subsequence converges because X is complete; the conclusion is that X is sequentially compact, and therefore compact. Function spaces. Given two nonempty sets X and Y , we can consider the space Fun(X, Y ) of all functions f : X Y . Since a function is uniquely determined by its values f(x) for x X, it is clear→ that ∈ Fun(X, Y )=Y X = Y x X ∈ is simply the Cartesian product, indexed by X, of several copies of Y : a function f : X Y corresponds to the element f(x) of the product. → x X Now suppose that X and Y are topological spaces;∈ we are interested in the subset C(X, Y )= f : X Y f is continous Fun(X, Y ) → ⊆ of all continuous functions. There are several ways of making Fun(X, Y ) and C(X, Y ) into topological spaces; each is useful in certain situations. The simplest way is to use the product topology on Y X . The product topology is given by a basis; let us see what the usual basic open sets look like in terms of functions. Take finitely many points x1,...,xn X, and finitely many open sets U1,...,Un Y ; the corresponding basic open set∈ is ⊆ B(x ,...,x ,U ,...,U )= f : X Y f(x ) U for every i =1,...,n . 1 n 1 n → i ⊆ i Example 17.8. When does a sequence of functions fn : X Y converge to another function f : X Y in this topology? For every x X →and every neighborhood U of f(x), the→ basic open set B(x, U) is a neighborhood∈ of f, and therefore has to contain all but finitely many of the f . In other words, f (x) U for all but n n ∈ finitely many n, which means that the sequence fn(x) Y converges to f(x) Y . So convergence in this topology is the same as pointwise∈ convergence. ∈ Definition 17.9. The product topology on Fun(X, Y )=Y X is called the topology of pointwise convergence. The disadvantage of this topology is that the subspace C(X, Y ) is not closed, because the pointwise limit of continuous functions may fail to be continuous. Example 17.10. Let X =[0, 1] and Y = R, and consider the sequence of functions n n fn :[0, 1] R, fn(x)=x .Sincex 0 for x<1, the sequence converges pointwise→ to the function → 0ifx<1, f :[0, 1] R,f(x)= → 1ifx = 1, which is no longer continuous.
Load more

Recommended publications
  • FUNCTIONAL ANALYSIS 1. Metric and Topological Spaces A
    FUNCTIONAL ANALYSIS CHRISTIAN REMLING 1. Metric and topological spaces A metric space is a set on which we can measure distances. More precisely, we proceed as follows: let X 6= ; be a set, and let d : X×X ! [0; 1) be a map. Definition 1.1. (X; d) is called a metric space if d has the following properties, for arbitrary x; y; z 2 X: (1) d(x; y) = 0 () x = y (2) d(x; y) = d(y; x) (3) d(x; y) ≤ d(x; z) + d(z; y) Property 3 is called the triangle inequality. It says that a detour via z will not give a shortcut when going from x to y. The notion of a metric space is very flexible and general, and there are many different examples. We now compile a preliminary list of metric spaces. Example 1.1. If X 6= ; is an arbitrary set, then ( 0 x = y d(x; y) = 1 x 6= y defines a metric on X. Exercise 1.1. Check this. This example does not look particularly interesting, but it does sat- isfy the requirements from Definition 1.1. Example 1.2. X = C with the metric d(x; y) = jx−yj is a metric space. X can also be an arbitrary non-empty subset of C, for example X = R. In fact, this works in complete generality: If (X; d) is a metric space and Y ⊆ X, then Y with the same metric is a metric space also. Example 1.3. Let X = Cn or X = Rn. For each p ≥ 1, n !1=p X p dp(x; y) = jxj − yjj j=1 1 2 CHRISTIAN REMLING defines a metric on X.
    [Show full text]
  • Course 221: Michaelmas Term 2006 Section 3: Complete Metric Spaces, Normed Vector Spaces and Banach Spaces
    Course 221: Michaelmas Term 2006 Section 3: Complete Metric Spaces, Normed Vector Spaces and Banach Spaces David R. Wilkins Copyright c David R. Wilkins 1997–2006 Contents 3 Complete Metric Spaces, Normed Vector Spaces and Banach Spaces 2 3.1 The Least Upper Bound Principle . 2 3.2 Monotonic Sequences of Real Numbers . 2 3.3 Upper and Lower Limits of Bounded Sequences of Real Numbers 3 3.4 Convergence of Sequences in Euclidean Space . 5 3.5 Cauchy’s Criterion for Convergence . 5 3.6 The Bolzano-Weierstrass Theorem . 7 3.7 Complete Metric Spaces . 9 3.8 Normed Vector Spaces . 11 3.9 Bounded Linear Transformations . 15 3.10 Spaces of Bounded Continuous Functions on a Metric Space . 19 3.11 The Contraction Mapping Theorem and Picard’s Theorem . 20 3.12 The Completion of a Metric Space . 23 1 3 Complete Metric Spaces, Normed Vector Spaces and Banach Spaces 3.1 The Least Upper Bound Principle A set S of real numbers is said to be bounded above if there exists some real number B such x ≤ B for all x ∈ S. Similarly a set S of real numbers is said to be bounded below if there exists some real number A such that x ≥ A for all x ∈ S. A set S of real numbers is said to be bounded if it is bounded above and below. Thus a set S of real numbers is bounded if and only if there exist real numbers A and B such that A ≤ x ≤ B for all x ∈ S.
    [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]
  • Be a Metric Space
    2 The University of Sydney show that Z is closed in R. The complement of Z in R is the union of all the Pure Mathematics 3901 open intervals (n, n + 1), where n runs through all of Z, and this is open since every union of open sets is open. So Z is closed. Metric Spaces 2000 Alternatively, let (an) be a Cauchy sequence in Z. Choose an integer N such that d(xn, xm) < 1 for all n ≥ N. Put x = xN . Then for all n ≥ N we have Tutorial 5 |xn − x| = d(xn, xN ) < 1. But xn, x ∈ Z, and since two distinct integers always differ by at least 1 it follows that xn = x. This holds for all n > N. 1. Let X = (X, d) be a metric space. Let (xn) and (yn) be two sequences in X So xn → x as n → ∞ (since for all ε > 0 we have 0 = d(xn, x) < ε for all such that (yn) is a Cauchy sequence and d(xn, yn) → 0 as n → ∞. Prove that n > N). (i)(xn) is a Cauchy sequence in X, and 4. (i) Show that if D is a metric on the set X and f: Y → X is an injective (ii)(xn) converges to a limit x if and only if (yn) also converges to x. function then the formula d(a, b) = D(f(a), f(b)) defines a metric d on Y , and use this to show that d(m, n) = |m−1 − n−1| defines a metric Solution.
    [Show full text]
  • DEFINITIONS and THEOREMS in GENERAL TOPOLOGY 1. Basic
    DEFINITIONS AND THEOREMS IN GENERAL TOPOLOGY 1. Basic definitions. A topology on a set X is defined by a family O of subsets of X, the open sets of the topology, satisfying the axioms: (i) ; and X are in O; (ii) the intersection of finitely many sets in O is in O; (iii) arbitrary unions of sets in O are in O. Alternatively, a topology may be defined by the neighborhoods U(p) of an arbitrary point p 2 X, where p 2 U(p) and, in addition: (i) If U1;U2 are neighborhoods of p, there exists U3 neighborhood of p, such that U3 ⊂ U1 \ U2; (ii) If U is a neighborhood of p and q 2 U, there exists a neighborhood V of q so that V ⊂ U. A topology is Hausdorff if any distinct points p 6= q admit disjoint neigh- borhoods. This is almost always assumed. A set C ⊂ X is closed if its complement is open. The closure A¯ of a set A ⊂ X is the intersection of all closed sets containing X. A subset A ⊂ X is dense in X if A¯ = X. A point x 2 X is a cluster point of a subset A ⊂ X if any neighborhood of x contains a point of A distinct from x. If A0 denotes the set of cluster points, then A¯ = A [ A0: A map f : X ! Y of topological spaces is continuous at p 2 X if for any open neighborhood V ⊂ Y of f(p), there exists an open neighborhood U ⊂ X of p so that f(U) ⊂ V .
    [Show full text]
  • Chapter 7. Complete Metric Spaces and Function Spaces
    43. Complete Metric Spaces 1 Chapter 7. Complete Metric Spaces and Function Spaces Note. Recall from your Analysis 1 (MATH 4217/5217) class that the real numbers R are a “complete ordered field” (in fact, up to isomorphism there is only one such structure; see my online notes at http://faculty.etsu.edu/gardnerr/4217/ notes/1-3.pdf). The Axiom of Completeness in this setting requires that ev- ery set of real numbers with an upper bound have a least upper bound. But this idea (which dates from the mid 19th century and the work of Richard Dedekind) depends on the ordering of R (as evidenced by the use of the terms “upper” and “least”). In a metric space, there is no such ordering and so the completeness idea (which is fundamental to all of analysis) must be dealt with in an alternate way. Munkres makes a nice comment on page 263 declaring that“completeness is a metric property rather than a topological one.” Section 43. Complete Metric Spaces Note. In this section, we define Cauchy sequences and use them to define complete- ness. The motivation for these ideas comes from the fact that a sequence of real numbers is Cauchy if and only if it is convergent (see my online notes for Analysis 1 [MATH 4217/5217] http://faculty.etsu.edu/gardnerr/4217/notes/2-3.pdf; notice Exercise 2.3.13). 43. Complete Metric Spaces 2 Definition. Let (X, d) be a metric space. A sequence (xn) of points of X is a Cauchy sequence on (X, d) if for all ε > 0 there is N N such that if m, n N ∈ ≥ then d(xn, xm) < ε.
    [Show full text]
  • Chapter 2 Metric Spaces and Topology
    2.1. METRIC SPACES 29 Definition 2.1.29. The function f is called uniformly continuous if it is continu- ous and, for all > 0, the δ > 0 can be chosen independently of x0. In precise mathematical notation, one has ( > 0)( δ > 0)( x X) ∀ ∃ ∀ 0 ∈ ( x x0 X d (x , x0) < δ ), d (f(x ), f(x)) < . ∀ ∈ { ∈ | X 0 } Y 0 Definition 2.1.30. A function f : X Y is called Lipschitz continuous on A X → ⊆ if there is a constant L R such that dY (f(x), f(y)) LdX (x, y) for all x, y A. ∈ ≤ ∈ Let fA denote the restriction of f to A X defined by fA : A Y with ⊆ → f (x) = f(x) for all x A. It is easy to verify that, if f is Lipschitz continuous on A ∈ A, then fA is uniformly continuous. Problem 2.1.31. Let (X, d) be a metric space and define f : X R by f(x) = → d(x, x ) for some fixed x X. Show that f is Lipschitz continuous with L = 1. 0 0 ∈ 2.1.3 Completeness Suppose (X, d) is a metric space. From Definition 2.1.8, we know that a sequence x , x ,... of points in X converges to x X if, for every δ > 0, there exists an 1 2 ∈ integer N such that d(x , x) < δ for all i N. i ≥ 1 n = 2 n = 4 0.8 n = 8 ) 0.6 t ( n f 0.4 0.2 0 1 0.5 0 0.5 1 − − t Figure 2.1: The sequence of continuous functions in Example 2.1.32 satisfies the Cauchy criterion.
    [Show full text]
  • 3 Limits of Sequences and Filters
    3 Limits of Sequences and Filters The Axiom of Choice is obviously true, the well-ordering theorem is obviously false; and who can tell about Zorn’s Lemma? —Jerry Bona (Schechter, 1996) Introduction. Chapter 2 featured various properties of topological spaces and explored their interactions with a few categorical constructions. In this chapter we’ll again discuss some topological properties, this time with an eye toward more fine-grained ideas. As introduced early in a study of analysis, properties of nice topological spaces X can be detected by sequences of points in X. We’ll be interested in some of these properties and the extent to which sequences suffice to detect them. But take note of the adjective “nice” here. What if X is any topological space, not just a nice one? Unfortunately, sequences are not well suited for characterizing properties in arbitrary spaces. But all is not lost. A sequence can be replaced with a more general construction—a filter—which is much better suited for the task. In this chapter we introduce filters and highlight some of their strengths. Our goal is to spend a little time inside of spaces to discuss ideas that may be familiar from analysis. For this reason, this chapter contains less category theory than others. On the other hand, we’ll see in section 3.3 that filters are a bit like functors and hence like generalizations of points. This perspective thus gives us a coarse-grained approach to investigating fine-grained ideas. We’ll go through some of these basic ideas—closure, limit points, sequences, and more—rather quickly in sections 3.1 and 3.2.
    [Show full text]
  • Metric Spaces
    Chapter 1. Metric Spaces Definitions. A metric on a set M is a function d : M M R × → such that for all x, y, z M, Metric Spaces ∈ d(x, y) 0; and d(x, y)=0 if and only if x = y (d is positive) MA222 • ≥ d(x, y)=d(y, x) (d is symmetric) • d(x, z) d(x, y)+d(y, z) (d satisfies the triangle inequality) • ≤ David Preiss The pair (M, d) is called a metric space. [email protected] If there is no danger of confusion we speak about the metric space M and, if necessary, denote the distance by, for example, dM . The open ball centred at a M with radius r is the set Warwick University, Spring 2008/2009 ∈ B(a, r)= x M : d(x, a) < r { ∈ } the closed ball centred at a M with radius r is ∈ x M : d(x, a) r . { ∈ ≤ } A subset S of a metric space M is bounded if there are a M and ∈ r (0, ) so that S B(a, r). ∈ ∞ ⊂ MA222 – 2008/2009 – page 1.1 Normed linear spaces Examples Definition. A norm on a linear (vector) space V (over real or Example (Euclidean n spaces). Rn (or Cn) with the norm complex numbers) is a function : V R such that for all · → n n , x y V , x = x 2 so with metric d(x, y)= x y 2 ∈ | i | | i − i | x 0; and x = 0 if and only if x = 0(positive) i=1 i=1 • ≥ cx = c x for every c R (or c C)(homogeneous) • | | ∈ ∈ n n x + y x + y (satisfies the triangle inequality) Example (n spaces with p norm, p 1).
    [Show full text]
  • Metric Spaces
    Empirical Processes: Lecture 06 Spring, 2010 Introduction to Empirical Processes and Semiparametric Inference Lecture 06: Metric Spaces Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and Operations Research University of North Carolina-Chapel Hill 1 Empirical Processes: Lecture 06 Spring, 2010 §Introduction to Part II ¤ ¦ ¥ The goal of Part II is to provide an in depth coverage of the basics of empirical process techniques which are useful in statistics: Chapter 6: mathematical background, metric spaces, outer • expectation, linear operators and functional differentiation. Chapter 7: stochastic convergence, weak convergence, other modes • of convergence. Chapter 8: empirical process techniques, maximal inequalities, • symmetrization, Glivenk-Canteli results, Donsker results. Chapter 9: entropy calculations, VC classes, Glivenk-Canteli and • Donsker preservation. Chapter 10: empirical process bootstrap. • 2 Empirical Processes: Lecture 06 Spring, 2010 Chapter 11: additional empirical process results. • Chapter 12: the functional delta method. • Chapter 13: Z-estimators. • Chapter 14: M-estimators. • Chapter 15: Case-studies II. • 3 Empirical Processes: Lecture 06 Spring, 2010 §Topological Spaces ¤ ¦ ¥ A collection of subsets of a set X is a topology in X if: O (i) and X , where is the empty set; ; 2 O 2 O ; (ii) If U for j = 1; : : : ; m, then U ; j 2 O j=1;:::;m j 2 O (iii) If U is an arbitrary collection of Tmembers of (finite, countable or f αg O uncountable), then U . α α 2 O S When is a topology in X, then X (or the pair (X; )) is a topological O O space, and the members of are called the open sets in X.
    [Show full text]
  • Banach and Fréchet Spaces of Functions 1. Function Spaces C K[A, B]
    (March 15, 2014) Banach and Fr´echetspaces of functions Paul Garrett [email protected] http:=/www.math.umn.edu/egarrett/ [This document is http://www.math.umn.edu/~garrett/m/fun/notes 2012-13/02 spaces fcns.pdf] Many familiar and useful spaces of continuous or differentiable functions, such as Ck[a; b], have natural metric structures, and are complete. Often, the metric d(; ) comes from a norm jj· jj, on the functions, meaning that d(f; g) = jjf − gjj where the norm itself has 8 jjfjj ≥ 0; with jjfjj = 0 only for f = 0 (positivity) > <> jjf + gjj ≤ jjfjj + jjgjj (triangle inequality) > :> jjα · fjj = jαj · jjfjj for α 2 C (homogeneity) A vector space with complete metric coming from a norm is a Banach space. Natural Banach spaces of functions are many of the most natural function spaces. Other natural function spaces, such as C1[a; b] and Co(R), are not Banach, but still have a metric topology and are complete: these are Fr´echetspaces, appearing as limits [1] of Banach spaces. These lack some of the conveniences of Banach spaces, but their expressions as limits of Banach spaces is often sufficient. o Other important spaces, such as compactly-supported continuous functions Cc (R) on R, or compactly- 1 supported smooth functions Cc (R) on R, are not reasonably metrizable at all. Some of these important spaces are expressible as colimits [2] of Banach or Fr´echet spaces, and such descriptions suffice for many applications. First, we look at some naturally occurring Banach and Fr´echet spaces. Our main point will be to prove completeness with the natural metrics.
    [Show full text]
  • Metric, Normed, and Topological Spaces
    Chapter 13 Metric, Normed, and Topological Spaces A metric space is a set X that has a notion of the distance d(x; y) between every pair of points x; y 2 X. A fundamental example is R with the absolute-value metric d(x; y) = jx − yj, and nearly all of the concepts we discuss below for metric spaces are natural generalizations of the corresponding concepts for R. A special type of metric space that is particularly important in analysis is a normed space, which is a vector space whose metric is derived from a norm. On the other hand, every metric space is a special type of topological space, which is a set with the notion of an open set but not necessarily a distance. The concepts of metric, normed, and topological spaces clarify our previous discussion of the analysis of real functions, and they provide the foundation for wide-ranging developments in analysis. The aim of this chapter is to introduce these spaces and give some examples, but their theory is too extensive to describe here in any detail. 13.1. Metric spaces A metric on a set is a function that satisfies the minimal properties we might expect of a distance. Definition 13.1. A metric d on a set X is a function d : X × X ! R such that for all x; y; z 2 X: (1) d(x; y) ≥ 0 and d(x; y) = 0 if and only if x = y (positivity); (2) d(x; y) = d(y; x) (symmetry); (3) d(x; y) ≤ d(x; z) + d(z; y) (triangle inequality).
    [Show full text]