By simple geometry, note that ρ(x,y)≤d(x,y)≤nρ(x,y) for x,y∈Rn. Thus properties of ρ (such as sequence convergence, sequences being Cauchy, the topology generated by the metric) are brought to d immediately by this inequality. Note that the constant n is the only obstruction, and it is exactly what fails in infinite dimensions (since n→∞ as n→∞).
It is easy to show the metric topology generated by ρ coincides perfectly with the product topology on Rn. By the inequality from before, the metric topology generated by d also coincides with the product topology on Rn.
Note that neither metric generalizes cleanly to infinite products, since both may take the value ∞. Instead, given any metric d on a space X, define the standard bounded metric
d(x,y)=min{d(x,y),1}.
This induces the same topology as d, so boundedness is not a topological property; it depends on the choice of metric. Truncating in this way costs nothing topologically and is what makes the infinite constructions below well-defined.
We now generalize the square metric to Rω. The most direct approach is the uniform metric
ρ(x,y)=n∈Z+sup{d(xn,yn)},
replacing max with sup and truncating the distances above by 1. The topology this induces is the uniform topology. Alternatively, we may define the product metric
D(x,y)=n∈Z+sup{d(xn,yn)/n},
which is the same as the uniform metric, but damps the nth coordinate so that later coordinates are less “important.” Fittingly, it is the metric that produces the product topology on Rω.
These metrics can be placed on the space YX, the set of functions f:X→Y. Then the product metric sets the mode of convergence to pointwise on this function space, whereas the uniform metric sets the mode to uniform convergence.
In defining metrics on function spaces, consider the space B(X,Y) of bounded functions f:X→Y. We may define the sup metric
ρ(f,g)=x∈Xsup{d(f(x),g(x))}.
Note that we do not need to use the bounded metric d, since the functions are already bounded above, and so sup works out of the box. In general, note that the relationship between the uniform and sup metrics are simply ρ(f,g)=min{ρ(f,g),1}.
Note that the product topology is strictly coarser than the uniform topology, which is strictly coarser than the box topology.
Let (X,d) be a metric space. A sequence (xn)⊆X is said to be Cauchy if, for any ε>0, there is some N∈Z+ such that d(xm,xn)<ε for every m,n≥N. We say the metric space X is complete if every Cauchy sequence converges.
[7.1.3]Theorem(Equivalence of Convergent Sequences and Cauchy Sequences in Metric Spaces)#
In a complete metric space (X,d), a sequence converges if and only if it is Cauchy.
This fact is important in analysis since, in complete metric spaces, we can demonstrate a sequence converges if it is Cauchy, without needing a candidate for the limit.
[7.1.4]Theorem(Closed Subspace of Complete Metric Space is Complete)#
A closed subspace of a complete metric space is complete.
Proof.
Of course, a subspace topology derived from the metric topology is metric. Consider any Cauchy sequence contained in the closed subspace. It necessarily converges to a limit point of the closed subspace, but closed spaces contain all their limit points, and so the Cauchy sequence converges to a point in the closed subspace. Thus the closed subspace is complete. ❦
[7.1.5]Theorem(Complete if Every Cauchy Sequence has Accumulation Point)#
A metric space (X,d) is complete if every Cauchy sequence has a convergent subsequence.
Proof.
Suppose if (xn)⊆X is a Cauchy sequence with a subsequence xnk→x. For any ε>0, note there is some N1∈Z+ such that d(xn,xnk)<ε/2 for every n,nk≥N1, since the sequence is Cauchy. Moreover, there is some N2∈Z+ such that d(xnk,x)<ε/2 for every nk≥N2 by definition of convergence. Thus, for any n≥max{N1,N2}, we have that
d(xn,x)≤d(xn,xnk)+d(xnk,x)<ε/2+ε/2=ε.
Since all Cauchy sequences are convergent, the space is complete. ❦
[7.1.6]Theorem(Euclidean Space is Complete in its Standard Metrics)#
Euclidean space is complete under the standard and square metrics.
Proof.
Let (Rn,ρ) be Euclidean space endowed with the square metric. For any Cauchy sequence xn in this metric space, there is some N∈Z+ such that ρ(xm,xn)<1 for every m,n≥N. Then choose a number
Note then that xn is fully contained in [−M,M]n. Note this box is compact, and so xn has a convergent subsequence by sequential compactness. Thus Cauchy sequences converge and so the space is complete.
Finally, for (Rn,d), note that a sequence converges if and only if it converges with respect to ρ, and the same for the sequence being Cauchy. ❦
[7.1.7]Theorem(Sequence in Product Space Converges iff. Components Converge)#
Let {Xλ}λ∈Λ be an arbitrary collection of spaces with X=∏λ∈ΛXλ its product. Then a sequence xn→x in the product space if and only if πλ(xn)→πλ(x) for every λ∈Λ.
Proof.
(⟹): Note that πλ is continuous for every λ∈Λ, so the image of xn under each projection maps to the projection of x.
(⟸): Let xn be some sequence such that there exists some x∈X for which πλ(xn)→πλ(x) for every λ∈Λ. Let U be any basic open neighborhood of x. By definition, we have that there exist indices {λk}k=1n such that
U=k=1⋂nπλ−1(Uλ),
where Uλk⊆Xλk is open. For each k∈{1,…,n}, there is some Nk∈Z+ such that πλk(xn)∈πλk(Uλ) for every n≥Nk. Choosing N=max{Nk}k=1n, note that xn∈U for every n≥N, completing the proof. ❦
The metric space (Rω,D), with D(x,y)=supn∈Z+{d(x,y)/n} is complete.
Proof.
Suppose xn is Cauchy in this metric space. Note that
d(πn(xn),πn(yn))≤nD(x,y),
and so πn(xn) is a Cauchy sequence in (R,d) for each n∈Z+. This metric space is complete, and so the projections of the sequence converge. By the previous theorem, this means xn converges. ❦
[7.1.9]Example(Completeness is not a Topological Property)#
Note that R is complete in its usual metric. Now consider the subspace (−1,1) with the same metric, d(x,y)=∣x−y∣. But note the Cauchy sequence xn=1−1/n converges to 1, which is outside of this interval. Thus this space is not complete, even though (−1,1)≅R. Thus completeness is not a topological property.
Let (Y,d) be a metric space, together with an induced bounded metric d(x,y)=min{d(x,y),1}. Let YX be the space of functions {f∣f:X→Y}. Then we define the uniform metric
Note that if X is an indexing set, the space YX is the set of sequences in Y indexed by X. Then the uniform metric defined for sequences coincides with the uniform metric defined in terms of functions. Of course, this is all true because a sequence is truly a function from the indexing set into Y.
[7.1.12]Theorem(Criterion for Complete Metric Space Under Unifom Metric)#
Suppose (Y,d) is a complete metric space. Then the metric space (YX,ρ) is complete as well.
Proof.
Let (fn)n∈Z+ be a Cauchy sequence in YX, where each fn:X→Y. For a fixed x∈X, consider the sequence (fn(x))n∈Z+ in Y. Fix 1≥ε>0, and let N∈Z+ such that ρ(fm,fn)<ε for every m,n≥N. Then, for any m,n≥N, note that
and so (fn(x)) is Cauchy. Since Y is complete, we know this sequence converges. Thus, for every x∈X, define f(x) as the value (fn(x)) converges to.
Finally, we show fn→f in YX. Fix some ε>0, then note there is some N∈Z+ such that ρ(fm,fn)<ε for every m,n≥N. Fix n and let m→∞, then note that by the limit comparison theorem and continuity of the metric, ρ(f,fn)≤ε. Thus fn→f.
If ε were chosen to be greater than 1 in either case, the bounded metric ρ would evaluate to 1, making the proceeding statements trivial. ❦
Now, when defining YX for Y a metric space, let X be a topological space. The set YX is not different, but we may now consider subsets that we were unable to do before.
[7.1.13]Definition(Space of Continuous and Bounded Functions)#
Let X be a topological space and Y be a metric space. The space of continuous maps, denoted C(X,Y)⊆YX, is given by
C(X,Y)={f∣f:X→Y is continuous}.
Similarly, the space of bounded maps, denoted B(X,Y)⊆YX, is given by
B(X,Y)={f∣f:X→Y is bounded}.
Recall that a map f:X→Y, with Y a metric space, is said to be bounded if f(X) is contained in a single ball.
Let X be a topological space and (Y,d) a metric space. Then the spaces C(X,Y) and B(X,Y) are closed.
Proof.
Note these spaces are metric, so sequences probe limit points. We show that any sequences contained in these spaces converge inside the space.
Let (fn) be a sequence of functions in C(X,Y), meaning each fn:X→Y is continuous, such that fn→f. Note that convergence in this space is uniform convergence, so f is automatically continuous and so f∈C(X,Y). Since fn→f, for any ε>0 there is some N∈Z+ such that ρ(fn,f)<ε. Then, for any x∈X, note that
d(fn(x),f(x))<ρ(fn,f)<ε.
Note that ε is an upper bound for d(fn(x),f(x)) for everyx∈X, independent of ε. Thus fn→f uniformly, and so f is continuous, meaning f∈C(X,Y) and so the space is closed.
Now let (fn) be a sequence of bounded functions in B(X,Y), meaning there is some εn>0 for each fn:X→Y such that fn(X)⊆Bεn(0). Note that for ε=1, there is some N∈Z+ such that d(fn,f)<1 for every n≥N. Note then that
d(0,f)≤d(0,fn)+d(fn,f)≤εn+1
for every n≥N. Thus f∈BεN+1(0), meaning f∈B(X,Y). Thus the space is closed, completing the proof. ❦
If (Y,d) is a metric space, one can define another metric, the sup metric, on the set B(X,Y) of bounded functions X→Y by the equation
d∞(f,g)=x∈Xsup{d(f(x),g(x))}.
Note that this metric is well defined since f(X)∪g(X) is bounded above, and so d(f(x),g(x)) is bounded above for all x∈X. In fact, the sup metric may be put on all other bounded sets. The sup metric is almost identical to the uniform metric, in which ρ(f,g)=min{d∞(f,g),1}.
Thus ∣φa(x)∣≤∣d(x0,a)∣ for every x∈X, meaning φa is bounded and so φa∈B(X,R). Finally, define the map
Φa:X→B(X,R)Φa(x)=φa(x).
Note that B(X,R), where R takes the Euclidean metric, is complete with the sup metric. We show Φa is an isometry. Note that an isometry between metric spaces automatically constitutes an embedding, completing the proof.
Let (X,d) be any metric space. Let h:X→Y be an isometric embedding into a complete metric space. Then the space h(X) is a complete metric space in Y, which we call the completion.
A classic result is that the completion of Q under the metric d(x,y)=∣x−y∣ is R equipped with the standard Euclidean metric. Using the isometric embedding Φ into the complete space B(Q,R), we map any a∈Q to the function φa∈B(Q,R) defined by φa(x)=∣x−a∣−∣x∣ (where x∈Q).
Consider, for example, a Cauchy sequence (an)⊆Q that approximates 2. In Q, this sequence has no limit. However, the sequence of their images Φ(an)=φan is Cauchy in B(Q,R). Because B(Q,R) is complete, this sequence of functions must converge uniformly. Indeed, φan(x)=∣x−an∣−∣x∣ converges uniformly to the function f(x)=∣x−2∣−∣x∣. This limit function f is a well-defined bounded function in B(Q,R), but it is not in the image Φ(Q). The “hole” at 2 has thus materialized as a concrete boundary point of Φ(Q) in the function space.
Repeating this process for every Cauchy sequence in Q fills in all such holes. The closure of the image of Q is therefore exactly:
Φ(Q)={fr(x)=∣x−r∣−∣x∣:r∈R}.
This closed subspace of B(Q,R) is, by definition, the completion of Q. Note that this abstract space of functions is structurally identical to R. The image of R under this isometry is precisely Φ(Q), and so there is a surjective isometry between them. Since a surjective isometry is a perfect equivalence of metric spaces, we safely identify the completion of Q directly with R.
A completion effectively fills the holes in a metric space caused by Cauchy sequences that fail to converge. A Cauchy sequence consists of points that get arbitrarily close to one another; geometrically, it ought to converge to a limit. When a space is incomplete, it simply lacks the points that these sequences are aiming at. The completion process adjoins exactly these missing limit points. By embedding X isometrically into the humongous complete function space B(X,R), we force the missing limit functions to exist. Thus we patch the holes of X and guarantee that every Cauchy sequence in the new space converges.
Let (X,d) be a metric space. Suppose that, for some ε>0, every ε-ball in X has compact closure. Show that X is complete.
Proof.
Let (xn) be any Cauchy sequence. There exists some N∈Z+ such that d(xm,xn)<ε/2 for every m,n≥N. Then there exists finitely many closed ε-balls whose union contains x1,…,xN−1. Adjoin to this list of balls a single ball of radius ε containing all xN,xN+1,…. Let this list be {U1,…,Un}, and note that {U1,…,Un} still covers the sequence. Since each closure of the finitely many sets is compact, the set U=⋃k=1nUk is compact. Since xn is contained in the compact set U, and compactness is equivalent to sequential compactness in metrizable spaces, we have that xn admits a convergent subsequence. Thus xn is a convergent sequence, making X complete. ❦
Let (X,dX) and (Y,dY) be metric spaces, with Y complete. Let A⊆X. Show that, for any uniformly continuous f:A→Y, there exists a unique, uniformly continuous extension to g:A→Y.
Proof.
Let x∈A∖A. Then there exists a sequence (xn) in A such that xn→x. By uniform continuity of f, for any ε>0 there exists a δ>0 such that
dX(x1,x2)<δ⟹dY(f(x1),f(x2))<ε
for every x1,x2∈A. There is some N∈Z+ such that dX(xm,xn)<δ for every m,n≥N, and so dY(f(xm),f(xn))<ε for every m,n≥N. Since ε is arbitrary, we have that f(xn) is Cauchy in the complete space Y. Thus f(xn)→yx.
Now suppose (zn) is some other sequence in A such that zn→x. Fix ε>0. Once again, by uniform continuity, there exists a δ>0 such that
dX(zn,xn)<δ⟹dY(f(zn),f(xn))<ε
for every n∈Z+. Since zn→x and xn→x, note that dX(zn,xn)→0, and so dY(f(zn),f(xn))→0. Since f(xn)→yx, we have that f(zn)→yx.
Define a function g:A→Y such that g∣A=f and g∣A∖A(x)=yx, where yx is chosen as per before. Note that any sequence tending to the same point x in A∖A has the same limit point yx in the image, and so g is well-defined. We prove this function is uniformly continuous.
Fix ε>0. By the uniform continuity of g∣A=f, there exists δ>0 such that
dX(x1,x2)<δ⟹dY(g(x1),g(x2))<ε
for every x1,x2∈A. We show this δ works for all points in A. Indeed, suppose u,v∈A are such that dX(u,v)<δ. There exist sequences (un) and (vn) in A such that un→u and vn→v. Because the metric dX is continuous, limn→∞dX(un,vn)=dX(u,v)<δ. Thus, there exists some N∈Z+ such that dX(un,vn)<δ for every n≥N.
Applying the uniform continuity of g∣A to these sequence elements, we find that dY(g(un),g(vn))<ε for every n≥N. By the construction of g, we know g(un)→g(u) and g(vn)→g(v). Taking the limit as n→∞ and using the continuity of the metric dY, we obtain dY(g(u),g(v))≤ε. Since ε>0 was arbitrary, we conclude that g is uniformly continuous on A.
Recall that continuous functions preserve limits. g does this, since for every sequence xn→x, we define g(x) such that g(xn)→g(x). If g∣A∖A were defined in any other way, the resulting function would not be continuous. Thus g is the unique, uniformly continuous extension of f. ❦
Note that d(xm,xn) can be made arbitrarily small since C<1 (and so Cm−Cn→0 as m,n→∞). Thus there is some N∈Z+ such that d(xm,xn)<ε for every m,n≥N. Thus the sequence is Cauchy and thus convergent, and so xn→x∗. We show x∗ is our desired fixed point.
Note that f is C-Lipschitz and thus continuous, so f(xn)→f(x∗). Of course, d(f(xn),xn)→0, and so they converge to the same limit. Thus x∗=f(x∗).
Finally, we show x∗ is the unique fixed point. Suppose x′∈X is another fixed point. Then note d(f(x∗),f(x′))=d(x∗,x′)≤Cd(x∗,x′). Then either C=0, in which there is only one unique fixed point by inspection, or d(x∗,x′)=0 (and so x∗=x′), completing the proof. ❦