xn→x in X when d(xn,x)→0. A map f:X→Y between metric spaces is continuous at a when
∀ε>0, ∃δ>0,dX(x,a)≤δ⟹dY(f(x),f(a))≤ε;
equivalently (same proof as on R), f(xn)→f(a) for every sequence xn→a. f is Lipschitz with constant k when dY(f(x),f(y))≤kdX(x,y) always — then uniformly continuous, hence continuous.
Examples
Example 4.2
R with ∣x−y∣; Rn with any of
d1(x,y)=i∑∣xi−yi∣,d2(x,y)=(i∑(xi−yi)2)1/2,d∞(x,y)=imax∣xi−yi∣;
the set C([a,b]) of continuous functions with the sup distance d∞(f,g)=sup[a,b]∣f−g∣ (finite: f−g is bounded); any set with the discrete distance (d(x,y)=1 for x=y). Distances coming from norms are the subject of Chapter 5.
Example 4.10 (Open and closed sets recognized by continuity)
The global characterization (Theorem 4.6) is the everyday tool for topological bookkeeping. In R2: the set {(x,y):x2+y2<1, y>x3} is open — it is g−1((−∞,1))∩h−1((0,+∞)) for the continuous g(x,y)=x2+y2 and h(x,y)=y−x3, an intersection of two open preimages. In (C([0,1]),d∞): the set of functions with f(0)=f(1) and ∫01f=0 is closed — the preimage of {(0,0)} under the continuous map f↦(f(0)−f(1), ∫01f) into R2 (each coordinate is 1-Lipschitz, as in Exercise 4.3). The method never draws a picture: exhibit a continuous map, read the set as a preimage, quote the theorem.
Example 4.11 (A closed set defined by infinitely many conditions)
In (C([0,1]),d∞), the set
L={f:∣f(x)−f(y)∣≤∣x−y∣ for all x,y}
of 1-Lipschitz functions is closed, although it is cut out by uncountably many conditions: for each fixed pair (x,y), the map f↦∣f(x)−f(y)∣−∣x−y∣ is continuous (evaluations are 1-Lipschitz), so each single condition defines a closed set, and L is the intersection of this family — an arbitrary intersection of closed sets is closed. The same template certifies closedness for monotone functions, convex functions, functions bounded by a fixed g: uniform limits inherit every property expressible as a family of closed pointwise constraints. What uniform limits do not automatically inherit — differentiability, for one — is exactly what Chapter 10 must labour for.