3.7. Completeness#

The material in this section is primarily based on [1, 14].

Recall from Sequences that in a Cauchy sequence, the points become increasingly closure to each other. We showed that every convergent sequence is a Cauchy sequence. However not every Cauchy sequence is a convergent sequence in a general metric space. This is an important issue to be examined in this section. There are metric spaces where every Cauchy sequence is also convergent. Such metric spaces are known as complete metric spaces.

In the remainder of this section, \((X,d)\) and \((Y, \rho)\) shall denote metric spaces.

3.7.1. Complete Metric Spaces#

Definition 3.46 (Complete metric space)

A metric space \((X,d)\) is called complete if all of its Cauchy sequences converge in the space.

In other words, \(X\) is complete if every Cauchy sequence \(\{ x_n \}\) of \(X\) converges to a point \(x \in X\).

Example 3.19 (Complete metric spaces)

  1. \(\RR^n\) with the standard metric \(d(x,y) = | x-y|\) is complete.

  2. The Euclidean space \(\RR^n\), with the standard Euclidean metric (\(\ell_2\) distance), is complete.

Example 3.20 (The metric space of bounded functions)

Let \(X\) be a non-empty set. Let \(B(X)\) be the set of bounded (total) functions on \(X\).

for any \(f, g \in B(X)\), define \(D : B(X) \times B(X) \to \RR\) as:

\[ D(f, g) \triangleq \sup \{ | f(x) - g(x)| \ST x \in X \}. \]

Since both \(f\) and \(g\) are bounded, hence \(D(f,g)\) is a real number. Thus \(\dom D = B(X) \times B(X)\). We claim that \(D\) is a metric:

  1. \(D(f,g)\) is nonnegative as it is the supremum of nonnegative numbers.

  2. \(D(f, f) = \sup \{ | f(x) - f(x)| \} = 0\). Also, if \(D(f,g)=0\) then \(f(x)=g(x) \Forall x \in X\). Thus, \(f=g\).

  3. By definition: \(D(f, g) = D(g, f)\).

  4. For the triangle inequality, we proceed as follows:

    Let \(f,g,h \in B(X)\). For each \(x \in X\), we have:

    \[ |f(x) - g(x)| \leq | f(x) - h(x)| + |h(x) - g(x)| \leq D(f,h) + D(h, g). \]

    Now, taking the supremum on the L.H.S. over all \(x \in X\), we get:

    \[ D(f,g) \leq D(f,h) + D(h, g). \]

Next, we establish that \((B(X), D)\) is a complete metric space. Towards this, introduce a zero function \(z: X \to \RR\) as \(z(x) = 0\).

  1. Let \(\{ f_n\}\) be a Cauchy sequence of \(B(X)\).

  2. Thus, for every \(\epsilon > 0\), there exists \(n_0\) such that \(D(f_n, f_m) < \epsilon\) for all \(m,n > n_0\).

  3. In particular, note that, by definition, \(|f_n(x) - f_m(x)| \leq D(f_n, f_m)\) for every \(x \in X\).

  4. Thus, for any \(x \in X\), \(|f_n(x) - f_m(x)| < \epsilon\) for all \(m,n>n_0\).

  5. Thus, \(\{ f_n(x)\}\) is a Cauchy sequence of real numbers at each \(x = X\).

  6. Since, \(\RR\) is complete, hence \(\{ f_n(x)\}\) converges at each \(x = X\).

  7. We define a new function \(f: X \to \RR\) as \(f(x) = \lim f_n(x)\) for each \(x=X\).

  8. Since \(|f_n(x) - f_m(x)| < \epsilon\) for all \(m,n>n_0\), hence \(|f_n(x) - f(x)| \leq \epsilon\) for all \(n > n_0\) and all \(x \in X\).

  9. Thus, \(|f(x)| \leq \epsilon + |f_n(x)|\) for all \(x \in X\).

  10. Thus, since \(f_n\) is bounded, hence \(f\) is also bounded.

  11. Thus, \(f \in B(X)\).

  12. Finally, \(D(f_n, f) = \sup \{ |f_n(x) - f(x)|\}\).

  13. Since \(|f_n(x) - f(x)| \leq \epsilon\) for all \(x \in X\), hence, taking the supremum on the L.H.S., \(D(f_n, f) \leq \epsilon\).

  14. Since \(D(f_n, f) \leq \epsilon\) for all \(n > n_0\), hence \(\lim f_n = f\).

  15. Thus, every Cauchy sequence in \(B(X)\) converges in \(B(X)\).

  16. Thus, \((B(X), D)\) is a complete metric space.

3.7.2. Closed Subsets#

Theorem 3.58

Let \((X,d)\) be a complete metric space. Then a subset \(A\) of \(X\) is closed if and only if \((A, d)\) is a complete metric space in its own right.

Proof. Let \(A\) be closed.

  1. Let \(\{ x_n \}\) be a Cauchy sequence of \(A\).

  2. Then, \(\{ x_n \}\) is a Cauchy sequence of \(X\) (since \(A \subseteq X\)).

  3. Thus, \(\{ x_n \}\) is convergent, since \(X\) is complete.

  4. Let \(\lim x_n = x\).

  5. Since \(A\) is closed and \(\{ x_n \}\) of \(A\) is convergent, hence \(x \in A\) due to Theorem 3.33.

  6. Thus, every Cauchy sequence of \(A\) converges in \(A\).

  7. Thus, \((A,d)\) is complete.

Let \(A\) be complete. We shall show that it contains all its closure points.

  1. Let \(x \in X\) be a closure point of \(A\).

  2. By Theorem 3.31, there is a sequence \(\{x_n\}\) of \(A\) that converges to \(x\), i.e., \(\lim x_n = x\).

  3. Since \(\{ x_n \}\) converges in \(X\), hence \(\{ x_n \}\) is a Cauchy sequence of \(X\) due to Proposition 3.19.

  4. But then, \(\{ x_n \}\) is a Cauchy sequence of \(A\).

  5. Since, \(A\) is complete, hence \(\{ x_n \}\) converges in \(A\).

  6. Thus, \(x \in A\).

  7. Thus, \(A\) contains all its closure points. \(A\) is closed.

Recall that the diameter of a set is defined to be the supremum of distances between all pairs of points of the set.

Theorem 3.59

Let \((X, d)\) be a complete metric space. Let \(\{A_n\}\) be a sequence of closed, nonempty subsets of \(X\) such that \(A_{n+1} \subseteq A_{n}\) for each \(n\) and

\[ \lim_{n \to \infty} \diam A_n = 0. \]

Then the intersection \(\bigcap_{n=1}^{\infty}A_n\) consists of precisely one point.

This result is due to G. Cantor. A similar result was seen in nested interval property for real line.

Proof. Define:

\[ A = \bigcap_{n=1}^{\infty}A_n. \]

We shall first prove that \(A\) cannot have more than one point.

  1. Assume \(x, y \in A\).

  2. Thus, \(x,y \in A_n \Forall n\).

  3. Thus, \(0 \leq d(x,y) \leq \diam A_n \Forall n\).

  4. But then, \(\lim_{n \to \infty} \diam A_n = 0\) implies that \(d(x, y) = 0\).

  5. But, \(d(x,y) = 0 \implies x = y\) as \(d\) is a metric (Identity of indiscernibles).

  6. Thus, if \(x,y \in \bigcap_{n=1}^{\infty}A_n\), then \(x=y\).

  7. Thus, \(A\) contains at most one point.

We now show that \(A\) cannot be empty.

  1. For each \(n\) choose \(x_n \in A_n\). It is possible due to axiom of choice.

  2. Since \(A_{n+p} \subseteq A_n\), hence \(d(x_{n+p}, x_n) \leq \diam A_n\) holds for every \(n, p\).

  3. Thus, \(\{x_n\}\) is a Cauchy sequence of \(X\).

  4. Since \(X\) is complete, \(\{x_n\}\) is convergent.

  5. Hence, the limit \(x = \lim_{n\to\infty} x_n\) exists and \(x \in X\).

  6. Since \(x_m \in A_n\) for all \(m \geq n\), hence \(x\) is a closure point of \(A_n\) for each \(n\) (Theorem 3.31).

  7. But since \(A_n\) is closed, hence \(x \in A_n\) for each \(n\).

  8. Thus, \(x \in A\).

3.7.3. Nowhere Dense Sets#

Definition 3.47 (Nowhere dense/Rare)

A subset \(A\) of \((X,d)\) is nowhere dense if its closure has an empty interior; i.e.,

\[ \interior \closure A = \EmptySet. \]

It is also called a rare set.

Theorem 3.60

\(A\) is nowhere dense if and only if \(X \setminus (\closure A)\) is dense in \(X\).

Proof. Let \(B = \closure A\).

Recall from Theorem 3.15 that:

\[\begin{split} \begin{aligned} &X \setminus (\interior B) = \closure (X \setminus B)\\ \iff & \interior B = X \setminus (\closure (X \setminus B)). \end{aligned} \end{split}\]

Now,

\[\begin{split} \begin{aligned} & \interior \closure A = \EmptySet \\ \iff & \interior B = \EmptySet \\ \iff & X \setminus (\closure (X \setminus B)) = \EmptySet\\ \iff & \closure (X \setminus B) = X\\ \iff & \closure (X \setminus (\closure A)) = X\\ \iff & X \setminus (\closure A) \text{ is dense in $X$}. \end{aligned} \end{split}\]

Example 3.21

The set of integers \(\ZZ\) is nowhere dense in \(\RR\).

Corollary 3.1

If a set is open and dense, then its complement is rare (nowhere dense).

Proof. Let \(A\) be open and dense.

  1. \(B = X \setminus A\) is closed.

  2. Thus, \(\closure B = B\).

  3. Hence, \(X \setminus (\closure B) = X \setminus B = A\).

  4. But \(A\) is dense, hence \(B\) must be nowhere dense due to Theorem 3.60.

Theorem 3.61

The complement of a rare (nowhere dense) set is dense.

Proof. Let \(A \subseteq X\) be rare (nowhere dense).

  1. The interior of its closure is empty.

  2. Thus, its closure \(\closure A\) contains no open sets.

  3. Thus, \(A\) contains no open sets.

  4. Thus, every open set in \(X\) intersects with \(X \setminus A\).

  5. Thus, \(X \setminus A\) is dense.

Proposition 3.20

The subset of a rare (nowhere dense) set is rare.

Proof. Let \(A \subseteq B\) and \(B\) be nowhere dense. Now

\[ A \subseteq B \implies \closure A \subseteq \closure B \implies \interior \closure A \subseteq \interior \closure B. \]

Since \(B\) is nowhere dense, hence \(\interior \closure B\) is empty. This in turn implies that \(\interior \closure A\) is empty. Thus, \(A\) is nowhere dense.

Proposition 3.21

The boundary of a closed set is nowhere dense (rare).

Proof. Let \(A\) be closed. Thus, \(A = \closure A\). Since \(\boundary A = \closure A \setminus \interior A\), hence \(\boundary A \subseteq A\) for a closed set.

  1. Assume \(\boundary A\) has a nonempty interior.

  2. Let \(x\) be an interior point of \(\boundary A\).

  3. Since \(x \in \boundary A \subseteq A\), hence \(x\) is an interior point of \(A\).

  4. But boundary of \(A\) doesn’t includes its interior points.

  5. Hence, a contradiction.

  6. Thus, \(\boundary A\) has an empty interior.

  7. Finally \(\interior \closure \boundary A\) = \interior \boundary A = \EmptySet\( since \)\boundary A$ is closed.

  8. Thus, \(\boundary A\) is rare.

3.7.4. Cantor Set#

Definition 3.48 (Cantor set)

Cantor set \(C\) is a subset of \([0,1]\). It is constructed as follows:

  1. Let \(C_0 = [0,1]\).

  2. Trisect \(C_0\) into \([0, \frac{1}{3}], (\frac{1}{3}, \frac{2}{3}) , [\frac{2}{3}, 1]\).

  3. Remove the middle open interval \((\frac{1}{3}, \frac{2}{3})\) and form \(C_1 = [0, \frac{1}{3}]\cup [\frac{2}{3}, 1]\).

  4. Note that \(C_1\) is a disjoint union of \(2=2^1\) closed intervals.

  5. Trisect each closed interval of \(C_1\) and remove the middle open interval from each one of the trisections in an identical manner.

  6. Let \(C_2 = [0, \frac{1}{9}] \cup [\frac{2}{9}, \frac{1}{3}] \cup [\frac{2}{3}, \frac{7}{9}] \cup [\frac{8}{9}, 1]\).

  7. Note that \(C_2\) is a union of \(4=2^2\) disjoint closed intervals each of length \(\frac{1}{9} = \frac{1}{3^2}\).

  8. Inductively build \(C_{n+1}\) from \(C_n\) using this procedure.

  9. Note that \(C_n\) is a union of \(2^n\) disjoint closed intervals of length \(\frac{1}{3^n}\) each.

  10. When \(C_{n+1}\) is constructed from \(C_n\), we get \(2^{n+1}\) disjoint intervals of length \(\frac{1}{3^{n+1}}\) each.

  11. Clearly \(C_{n+1} \subseteq C_{n}\) by construction for all \(n\).

  12. Define the Cantor set as:

    \[ C \triangleq \bigcap_{n=1}^{\infty} C_n. \]

We next discuss different properties of the Cantor set.

Property 3.1 (Characterization in ternary expansions)

Consider the set \(E \subset [0,1]\) whose every element has a ternary (base 3) expansion of only 0s and 2s; i.e., for every \(x \in E\), we have a representation:

\[ x = .d_1 d_2 d_3 \dots \text{ where } d_i \in \{0, 2 \} \]

Then, \(E=C\). In other words:

\[ C = E \triangleq \left \{ \sum_{n=1}^{\infty} \frac{d_n}{3^n}, \text{ where } d_n \in \{ 0, 2\} \right \}. \]

Proof. In the ternary (base 3), representation, each number \(x\in[0, 1]\) can be written as:

\[ x = .d_1 d_2 d_3 \dots \text{ where } d_i \in \{0, 1, 2 \} \]

such that

\[ x = \sum_{i=1}^{\infty} \frac{d_i}{3^i}. \]

For example

\[ 1 = .2222222... = 2 \sum_{i=1}^{\infty} \frac{1}{3^i} = 2\frac{1/3}{2/3} = 2\frac{1}{2} = 1. \]

It is possible that a number has two different ternary expansions. We can see that \(\frac{1}{3} \in C_k\) for every \(k\). Hence, \(\frac{1}{3} \in C\).Interestingly,

\[ \frac{1}{3} = .1 = .022222... . \]

has two different ternary representations. One is a finite representation, and the other is an infinite representation involving only 0s and 2s. We say that \(\frac{1}{3} \in C\) as it has a ternary representation consisting of only 0s and 2s.

We have to prove two things:

  1. \(E \subseteq C\). Every number in \([0,1]\) which has a ternary expansion containing only 0s and 2s belongs to \(C\).

  2. \(C \subseteq E\). Every number in \(C\) has a ternary expansion containing only of 0s and 2s.

Note that if \(A = [a, a + \frac{1}{3^n}]\) is a closed interval contained in \(C_n\) then:

  1. \([a, a + \frac{1}{3^{n+1}}]\) is the first closed interval drawn from \(A\) in \(C_{n+1}\).

  2. \([a+ \frac{2}{3^{n+1}}, a + \frac{1}{3^{n}}]\) is the second closed interval drawn from \(A\) in \(C_{n+1}\).

\(E \subseteq C\)

  1. Let \(x = .d_1 d_2 \dots\) with \(d_i \in \{0, 2\}\).

  2. Start with \(A_0 = [0,1]\).

  3. Given \(A_0\):

    1. If \(d_1 = 0\), then let \(A_1\) be the first closed interval drawn from \(A_0\) : \([0, \frac{1}{3}]\) contained in \(C_1\).

    2. Otherwise, if \(d_1 = 2\), then let \(A_1\) the second closed interval drawn from \(A_0\) : \([\frac{2}{3}, 1]\) contained in \(C_1\).

  4. Given \(A_{n-1} = [a, a + \frac{1}{3^{n-1}}]\),

    1. If \(d_n = 0\), then let \(A_n\) be the first closed interval drawn from \(A_{n-1}\) contained in \(C_n\).

    2. Otherwise (if \(d_n = 2\)), then let \(A_n\) be the second closed interval drawn from \(A_{n-1}\) contained in \(C_n\).

  5. Inductively, we can keep picking closed interval \(A_n\) contained in \(C_n\) for every digit in the ternary expansion of \(x\).

  6. Thus, \(x \in C\).

\(C \subseteq E\)

  1. For every \(x \in C\), we can construct a ternary expansion as follows.

  2. If \(x \in [0, \frac{1}{3}]\), then \(d_1 = 0\).

  3. Otherwise if \(x \in [\frac{2}{3}, 1]\), then \(d_1 = 2\).

  4. Subsequently, whenever the first closed interval is chosen, then \(d_n = 0\) and whenever the second closed interval is chosen, then \(d_n = 2\).

  5. Thus, \(x\) has a ternary expansion consisting entirely of 0s and 2s.

  6. Thus, \(x \in E\).

Property 3.2

Cantor set doesn’t contain any open interval.

Proof. Note that the total length of disjoint closed intervals in \(C_n\) is \(\frac{2^n}{3^n} = \left ( \frac{2}{3} \right )^n\).

  1. Assume that there is an open interval \((a,b) \subseteq C\).

  2. Then, the length of the interval is \(b-a > 0\).

  3. But then there exists an \(n\) such that \(\left ( \frac{2}{3} \right )^n < b - a\).

  4. Then, for all \(k \geq n\), \((a,b)\) cannot be contained in \(C_k\).

  5. We arrive at a contradiction.

Property 3.3

Cantor set has an empty interior.

Proof. Assume \(C\) has a nonempty interior and \(x \in \interior C\).

  1. Then there is a neighborhood \((x - \epsilon , x + \epsilon) \subset C\).

  2. But, \(C\) doesn’t contain any open intervals.

  3. We arrive at a contradiction.

Thus, \(C\) has an empty interior.

Property 3.4

Cantor set is a closed nowhere dense subset of \(\RR\).

Proof. \(C\) is an (infinite) intersection of closed sets. Hence \(C\) is closed. \(\closure C = C\). \(C\) has an empty interior. Thus, \(C\) is nowhere dense.

Property 3.5

The total length of the removed intervals from \([0,1]\) to get \(C\) equals 1.

Proof. At the n-th step, we remove \(2^{n-1}\) open intervals of length \(3^{-n}\) each.

Thus, total length removed in n-th step is \(\frac{1}{2} \left ( \frac{2}{3} \right )^n\).

Thus, total length removed is:

\[ \sum_{n=1}^{\infty} \frac{1}{2} \left ( \frac{2}{3} \right )^n = \frac{1}{2} \frac{2/3}{1 - 2/3} = 1. \]

Property 3.6

Cantor set is uncountable. In particular:

\[ \card {C} = \card {2^{\Nat}} = \card{\RR} = \mathfrak{c}. \]

Recall that \(\mathfrak{c}\) denotes the cardinality of the continuum (Definition 1.84). The notation \(2^{\Nat}\) was introduced in Theorem 1.17 to describe power sets. Theorem 1.16 established that

\[ 2^{\Nat} \sim \Power(\Nat) \sim \RR. \]

Proof. Recall that two sets are called equivalent (\(A \sim B\)) if there is a bijective mapping between them.

Recall from Property 3.1 that:

\[ C = \left \{ \sum_{n=1}^{\infty} \frac{d_n}{3^n}, \text{ where } d_n \in \{ 0, 2\} \right \}. \]
  1. Thus, each \(x \in C\) can be identified with a sequence \(d : \Nat \to \{ 0, 2\}\) given by \(d = \{ d_n \}\).

  2. Thus, we have a bijective mapping between \(C\) and the set \(\{0, 2\}^{\Nat}\).

  3. Thus, \(C \sim \{0, 2\}^{\Nat}\).

  4. This, in turn can be identified with a sequence \(c : \Nat \to \{0, 1\}\) where \(c = \{ c_n \}\) with \(c_n = 0\) if \(d_n = 0\) and \(c_n = 1\) if \(d_n = 2\).

  5. This gives us a bijective mapping between \(\{0, 2\}^{\Nat}\) and \(\{0, 1\}^{\Nat}\).

  6. Recall that \(2^{\Nat} = \{0, 1\}^{\Nat}\) with \(2 = \{0, 1\}\) (Theorem 1.17).

  7. Thus \(C \sim 2^{\Nat}\) and

    \[ \card C = \card 2^{\Nat} = \card \RR = \mathfrak{c}. \]

3.7.5. Meager Sets#

Definition 3.49 (Meager set)

A union of countably many rare (nowhere dense) sets is said to be of first category or a meager set.

In other words, a subset \(A\) is called meager (or of first category) if there exists a sequence \(\{ A_n \}\) of nowhere dense subsets such that

\[ A = \bigcup_{n=1}^{\infty} A_n. \]

Definition 3.50 (Co-meager set)

The complement of a meager set is called co-meager.

Definition 3.51 (Non-meager set)

A subset that is not meager is said to be non-meager or of second category.

Example 3.22

Consider the metric space \(\RR\).

  1. Singleton sets are rare (nowhere dense) in \(\RR\) as they are closed and their interior is empty.

  2. The set of natural numbers \(\Nat\) is rare since it is closed and its interior is empty (no open intervals in \(\Nat\)).

  3. The set \(\QQ\) is not rare since its closure is entire \(\RR\). It is meager since it is a countable union of rare singleton sets.

  4. The set of irrational numbers \(\II\) is co-meager as \(\II = \RR \setminus \QQ\).

  5. The set \(\RR\) is non-meager.

Theorem 3.62

The subset of a meager set is meager.

Proof. Let \(A\) be a meager set and let \(B \subseteq A\). Then,

\[ A = \bigcup_{n=1}^{\infty} A_n \]

where \(A_n\) are rare (nowhere dense).

But then

\[ B = B \cap A = B \cap \bigcup_{n=1}^{\infty} A_n = \bigcup_{n=1}^{\infty} A_n \cap B. \]

Since subset of a nowhere dense set is nowhere dense, hence \(B_n = A_n \cap B\) are nowhere dense. Hence

\[ B = \bigcup_{n=1}^{\infty} B_n \]

is meager (as it is a countable union of nowhere dense sets).

Theorem 3.63

The union of countably many meager sets is meager.

Proof. Recall from Theorem 1.10 that countable union of countable sets is countable.

  1. Let \(\{M_n\}\) be a countable collection of meager sets.

  2. Then, each \(M_n\) is a countable union of rare sets.

  3. Write \(M_n\) as \(\bigcup_i A_{n, i}\).

  4. Thus,

    \[ M = \bigcup_n M_n = \bigcup_n \bigcup_i A_{n, i} = \bigcup_{n, i} A_{n, i}. \]
  5. The family \(\{ A_{n, i} \}\) is countable.

  6. Thus, \(M\) is a countable union of rare sets.

  7. Thus, \(M\) is meager.

Corollary 3.2

Since co-meager sets are complements of meager sets:

  1. Superset of a co-meager set is co-meager.

  2. Countable intersection of co-meager sets is co-meager.

3.7.6. Baire Category Theorem#

Theorem 3.64 (Baire category theorem)

A (nonempty) complete metric space is non-meager in itself.

In other words:

  • A (nonempty) complete metric space is not a countable union of rare sets.

Proof. Our proof strategy is following:

  1. For contradiction, we assume that \(X\) is meager with \(X = \bigcup_i A_i\).

  2. We form a Cauchy sequence from points \(x_i \notin A_i\).

  3. Since \(X\) is complete, we claim its convergence \(x = \lim x_i\).

  4. We further show that the limit point \(x\) cannot belong to any \(A_i\).

Let us assume that \(X\) is a complete metric space which is meager in itself; i.e., there exists a countable collections of rare sets (rare in \(X\)) such that \(X\) is their union.

\[ X = \bigcup_{k=1}^{\infty} A_k \]

where \(A_k\) are rare (nowhere dense); i.e. \(\interior \closure A_k = \EmptySet\).

Recall from Theorem 3.60 that \(B_k = X \setminus \closure A_k\) are dense in \(X\). Also, \(B_k\) are open since they are complement of closed sets. Also, recall from Theorem 3.23 that a dense set has a nonempty intersection with every nonempty open set.

  1. \(B_1 = X \setminus \closure A_1\) is a nonempty open set.

  2. Thus, there exists an interior point \(x_1\) in \(B_1\) with an open ball \(B(x_1, \epsilon_1) \subseteq B_1\) where we can make \(\epsilon_1 < \frac{1}{2}\).

  3. \(B_2\) is nonempty, open and dense. Thus, \(C_2 = B_2 \cap B\left (x_1, \frac{\epsilon_1}{2}\right)\) is nonempty and open.

  4. Thus, we can choose \(x_2 \in C_2\) such that \(x \in B(x_2, \epsilon_2) \subseteq C_2\) with \(\epsilon_2 \leq \frac{\epsilon_1}{2}\).

  5. Proceeding inductively in this manner, we obtain a sequence \(\{ x_n \}\) such that

    \[ x_n \in B(x_n, \epsilon_n) \subseteq B_n \cap B\left (x_{n-1}, \frac{\epsilon_{n-1}}{2} \right). \]
  6. We have \(A_n \cap B(x_n, \epsilon_n) = \EmptySet\). \(\epsilon_n \leq \frac{\epsilon_{n-1}}{2}\) with \(\epsilon_1 < \frac{1}{2}\).

  7. By definition, \(x_m \in B\left (x_n, \frac{\epsilon_n}{2} \right)\) for every \(m > n\).

  8. Thus, \(d(x_m, x_n) < \frac{\epsilon_n}{2}\) for every \(m > n\).

  9. Since \(\epsilon_1 < \frac{1}{2}\), hence \(\epsilon_n < \frac{1}{2^{n+1}}\).

  10. Thus, \(d(x_m, x_n) \to 0\) as \(m,n \to \infty\).

  11. Thus, \(\{x_n\}\) is a Cauchy sequence.

  12. Since \(X\) is complete, hence every Cauchy sequence is convergent.

  13. Thus there exists \(x \in X\) such that \(x = \lim x_n\). To which \(A_k\) does \(x\) belong then?

  14. Fix some \(n \in \Nat\). For every \(m>n\) we have:

    \[ d(x, x_n) \leq d(x, x_m) + d(x_n, x_m) < d(x, x_m) + \frac{\epsilon_n}{2}. \]
  15. Thus taking the limit \(m \to \infty\) leading to \(d(x, x_m) \to 0\), we get

    \[ d(x, x_n) \leq \frac{\epsilon_n}{2} < \epsilon_n. \]
  16. Hence \(x \in B(x_n, \epsilon_n)\) for all \(n \in \Nat\).

  17. Since \(A_n \cap B(x_n, \epsilon_n) = \EmptySet\), hence \(x \notin A_n\) for all \(n\).

  18. But then \(x \notin X\) since \(X = \bigcup_n A_n\). A contradiction.

  19. Hence, \(X\) must be non-meager.

Theorem 3.65

If \((X, d)\) is complete and \(X = \bigcup_{n=1}^{\infty} A_n\), then at least one \(A_n\) is non-rare; i.e., \(\interior \closure A_n \neq \EmptySet\) for some \(n\).

Proof. If every \(A_n\) were rare, then \(X\) would be a meager set. But as per Baire category theorem, \(X\) must be non-meager since it is complete.

Hence, at least one \(A_n\) would be non-rare.

Proposition 3.22

The set of irrational numbers is non-meager.

Proof. Recall that \(\RR = \QQ \cup \II\) where \(\II\) is the set of irrational numbers.

  1. \(\RR\) is complete. Hence \(\RR\) is non-meager.

  2. \(\QQ\) is meager as it is a countable union of singletons which are rare sets.

  3. Countable union of meager sets is meager.

  4. Thus, if \(\II\) was meager, then \(\RR\) would be meager which is not true.

  5. Hence, \(II\) must be non-meager.

Theorem 3.66 (Interior of a meager set)

A meager set has an empty interior in a complete metric space.

Proof. Let \(M \subseteq X\) be meager. Then, we can write \(M\) as

\[ M = \bigcup_{n=1}^{\infty} A_n \]

such that \(A_n\) are rare in \(X\).

Let \(B_n = X \setminus \closure A_n\). Then \(B_n\) are dense, nonempty and open in \(X\). Hence \(B_n \cap U\) is nonempty and open for every nonempty open set \(U \subseteq X\).

  1. Let \(U\) be an arbitrary nonempty open set in \(X\).

  2. There exists \(x_1 \in B_1 \cap U\) such that \(x_1 \in B(x_1, \epsilon_1) \subseteq B_1 \cap U\) where \(\epsilon_1 < \frac{1}{2}\).

  3. \(B_2\) is dense and open so \(C_2 = B_2 \cap B\left(x_1, \frac{\epsilon_1}{2}\right)\) is nonempty and open.

  4. We can choose a point \(x_2 \in B(x_2, \epsilon_2) \subseteq C_2\) where \(\epsilon_2 \leq \frac{\epsilon_1}{2}\).

  5. Proceeding in this manner, we choose points

    \[ x_n \in B(x_n, \epsilon_n) \subseteq B_n \cap B\left (x_{n-1}, \frac{\epsilon_{n-1}}{2}\right) \]

    to form a sequence \(\{ x_n \}\).

  6. The sequence \(\{ x_n \}\) is Cauchy, \(X\) is complete, hence \(x = \lim x_n\) exists in \(X\).

  7. Also, \(x \in B(x_n, \epsilon_n)\) for all \(n\).

  8. In particular \(x \in B(x_1, \epsilon_1) \subseteq U\) and \(x \in B(x_n, \epsilon_n) \subseteq B_n\).

  9. Thus, \(x \in B_n \cap U\) for all \(n\).

  10. Thus,

    \[\begin{split} \begin{aligned} & x \in U \cap \left ( \bigcap_{n} B_n \right )\\ & \implies x \in U \cap \left ( \bigcap_{n} (X \setminus \closure A_n) \right )\\ & \implies x \in U \cap \left ( X \setminus \left ( \bigcup_{n} (\closure A_n) \right ) \right )\\ & \implies x \in U \cap \left ( X \setminus \left ( \bigcup_{n} A_n \right ) \right )\\ & \implies x \in U \cap ( X \setminus M ). \end{aligned} \end{split}\]
  11. Thus, \(U\) has a nonempty intersection with \(X \setminus M\).

  12. Since \(U\) is arbitrary, hence \(X \setminus M\) intersects with every nonempty open set in \(X\).

  13. Thus, \(X \setminus M\) is dense in \(X\) (Theorem 3.23).

  14. Thus, \(M\) has an empty interior (Theorem 3.24).

Corollary 3.3

If a set in a complete metric space has a non-empty interior, then it is not meager.

Example 3.23

\(\QQ\) in \(\RR\)

  1. The set \(\QQ\) is meager in \(\RR\).

  2. \(\RR\) is complete.

  3. The interior of \(\QQ\) in \(\RR\) is empty.

  4. The closure of \(\QQ\) is \(\RR\).

  5. Thus, while a meager set may have an empty interior, its closure need not have an empty interior. This is different from rare sets whose closure has an empty interior.

\(\QQ\) in \(\QQ\)

  1. \(\QQ\) by itself is not a complete metric space.

  2. Singletons are rare sets in \(\QQ\).

  3. Thus, \(\QQ\) is meager in \(\QQ\) as it is a countable union of rare sets.

  4. However, the interior of \(\QQ\) is not empty. In fact it is whole of \(QQ\).

  5. Theorem 3.66 does not apply since \(\QQ\) is not a complete metric space.

Theorem 3.67

The set \([0,1]\) is uncountable.

Proof. We prove this using Baire category theorem.

  1. \([0,1]\) is a complete metric space with the standard metric.

  2. Assume \([0,1]\) to be countable.

  3. Then, \([0,1] = \{ x_n \}_{n \in \Nat}\) is an enumeration of \([0,1]\).

  4. The singleton set \(\{x_n \}\) is rare in \([0,1]\).

  5. Then \([0,1]\) being a countable union of rare sets would be meager.

  6. But Baire category theorem says that a complete metric space is non-meager.

  7. We have a contradiction.

  8. Thus, \([0,1]\) must be uncountable.

3.7.7. Baire Spaces#

Definition 3.52 (Baire space)

A metric space is called a Baire space if every nonempty open set is not a meager set.

Theorem 3.68

Every complete metric space is a Baire space.

Proof. Let \(A\) be a nonempty open subset of a complete metric space \((X,d)\). If it was meager, then it would have an empty interior (Theorem 3.66). Thus, it must be non-meager.

Hence \(X\) is a Baire space.

Theorem 3.69 (Characterization of Baire space)

For a metric space \(X\), the following statements are equivalent:

  1. \(X\) is a Baire space.

  2. Every countable intersection of open dense sets is also dense.

  3. If \(X = \bigcup_{n=1}^{\infty} F_n\) and each \(F_n\) is a closed set, then the open set \(\bigcup_{n=1}^{\infty} \interior F_n\) is dense.

Proof. (1) \(\implies\) (2)

  1. Assume \(X\) is a Baire space.

  2. Let \(\{ A_n\}\) be a sequence of open dense sets in \(X\).

  3. Let \(A = \bigcap_{n=1}^{\infty}A_n\). We need to show that \(A\) is dense.

  4. We will show that \(A\) has a nonempty intersection with every nonempty open set of \(X\). Thus, claim that \(A\) is dense due to Theorem 3.23.

  5. Let \(\OOO \subseteq X\) be an arbitrary nonempty open set.

  6. Assume, for contradiction that \(A \cap \OOO = \EmptySet\).

  7. Then, \(X = X \setminus \EmptySet = X \setminus (A \cap \OOO) = (X \setminus A) \cup (X \setminus O)\).

  8. Thus,

    \[\begin{split} \begin{aligned} \OOO &= X \cap \OOO = ((X \setminus A) \cup (X \setminus O)) \cap \OOO = (X \setminus A) \cap \OOO\\ &= \left (X \setminus \left ( \bigcap_{n=1}^{\infty}A_n \right ) \right) \cap \OOO\\ &= \bigcup_{n=1}^{\infty} ((X \setminus A_n) \cap \OOO). \end{aligned} \end{split}\]
  9. Due to Corollary 3.1, \(X \setminus A_n\) are rare.

  10. Due to Proposition 3.20, \((X \setminus A_n) \cap \OOO\) are rare.

  11. Thus, \(\OOO\) being a countable union of rare sets, is meager.

  12. But, in a Baire space, every nonempty open set is not meager.

  13. We have a contradiction.

  14. Thus, \(A \cap \OOO\) must be nonempty.

  15. Thus, \(A\) has a nonempty intersection with every nonempty open set in \(A\).

  16. Thus, \(A\) is dense in \(X\).

(2) \(\implies\) (3)

  1. We assume that every countable intersection of open dense sets is dense.

  2. Let \(\{ F_n \}\) be a sequence of closed sets in \(X\) satisfying \(X = \bigcup_{n=1}^{\infty} F_n\).

  3. Let \(A_n = \interior F_n\) and let \(A = \bigcup_{i=1}^{\infty} A_n\). By definition, \(A\) is open.

  4. Since \(F_n\) is closed, hence \(E_n = F_n \setminus (\interior F_n)\) is its boundary.

  5. Due to Proposition 3.21, \(E_n\) is rare.

  6. Thus, the set \(E = \bigcup_{n=1}^{\infty}E_n\) is a meager set.

  7. Since \(E_n\) is closed and rare, hence \(X \setminus E_n\) is open and dense (Theorem 3.61).

  8. By our hypothesis (2), the set

    \[ X \setminus E = X \setminus \left ( \bigcup_{n=1}^{\infty}E_n \right ) = \bigcap_{n=1}^{\infty} (X \setminus E_n) \]

    is also a dense set as it is a countable intersection of open dense sets \(X \setminus E_n\).

  9. Now, notice that:

    \[\begin{split} \begin{aligned} X \setminus A &= X \setminus \left ( \bigcup_{i=1}^{\infty} A_n \right)\\ &= \bigcup_{n=1}^{\infty} F_n \setminus \left ( \bigcup_{i=1}^{\infty} (\interior F_n) \right)\\ &\subseteq \bigcup_{n=1}^{\infty} [F_n \setminus (\interior F_n)]\\ &= \bigcup_{n=1}^{\infty} E_n\\ &= E. \end{aligned} \end{split}\]
  10. And \(X \setminus A \subseteq E\) implies \(X \setminus E \subseteq A\).

  11. Since \(X \setminus E\) is dense, hence \(A\) is also dense.

(3) \(\implies\) (1). We need to show that every nonempty open set is non-meager.

  1. Let \(V\) be a nonempty open set. Assume \(V\) to be meager.

  2. Then \(V\) is a countable union of rare sets:

    \[ V = \bigcup_{n=1}^{\infty} A_n \]

    where \(A_n\) are rare, thus \(\interior \closure A_n = \EmptySet\).

  3. We can write \(X\) as:

    \[\begin{split} \begin{aligned} X &= (X \setminus V) \cup V\\ &= (X \setminus V) \cup A_1 \cup A_2 \cup \dots\\ &= (X \setminus V) \cup (\closure A_1) \cup (\closure A_2) \cup \dots. \end{aligned} \end{split}\]

    The last expression is correct since \(\closure A_n \subseteq X\).

  4. In this form, \(X\) is a countable union of closed sets.

  5. By our hypothesis (3), the open set:

    \[ (\interior (X \setminus V)) \cup (\interior (\closure A_1)) \cup (\interior (\closure A_2)) \cup \dots = \interior (X \setminus V) \]

    is dense in \(X\). Here, we used the fact that \(A_n\) are rare.

  6. Since \(\interior (X \setminus V) \subseteq X \setminus V\), hence \(X \setminus V\) is also dense in \(X\).

  7. In particular \(V \cap (X \setminus V) \neq \EmptySet\) since a dense set has a nonempty intersection with every nonempty open set (Theorem 3.23).

  8. But this is impossible since \(V \cap (X \setminus V) = \EmptySet\).

  9. Thus, \(V\) cannot be not a meager set.

  10. We have established that any nonempty open \(V\) is not a meager set.

  11. Hence, \(X\) is a Baire space.

3.7.8. Completion#

Theorem 3.70

Let \((X, d)\) be a metric space and let \((Y, \rho)\) be a complete metric space. If \(f : X \to Y\) with \(A = \dom f\) is a uniformly continuous function on \(A\) then \(f\) has a unique uniformly continuous extension to the closure of \(A\).

Proof. If a sequence \(\{x_n\}\) of \(A\) converges to a closure point \(x = \lim x_n\), then the sequence \(\{f(x_n)\}\) of \(Y\) converges to some limit \(y = \lim f(x_n)\).

  1. Let \(x \in \closure A\).

  2. There exists a sequence \(\{ x_n \}\) of \(A\) such that \(\lim x_n = x\).

  3. Consider the sequence \(\{ f (x_n) \}\) of \(Y\).

  4. Choose \(\epsilon > 0\).

  5. Since \(f\) is uniformly continuous on \(A\), hence there exists \(\delta > 0\) such that \(\rho(f(x), f(y)) < \epsilon\) whenever \(d(x,y)< \delta\).

  6. Since \(\{ x_n \}\) is convergent and hence Cauchy, we can pick \(n_0\) such that \(d(x_m, x_n) < \delta\) for all \(m, n > n_0\).

  7. Thus, \(\rho(f(x_m), f(x_n)) < \epsilon\) for all \(m, n > n_0\).

  8. Thus, \(\{ f(x_n) \}\) is a Cauchy sequence of \(Y\).

  9. Since \(Y\) is complete, hence every sequence converges.

  10. Thus, there is a limit \(y = \lim f(x_n)\).

For any sequence \(\{x_n\}\) of \(A\) converging to \(x = \lim x_n\), the corresponding sequence \(\{f(x_n)\}\) of \(Y\) has the same limit.

  1. Assume that \(x = \lim x_n = \lim y_n\) where \(\{x_n \}\) and \(\{ y_n\}\) are two different sequences converging to \(x\).

  2. Let \(u = \lim f(x_n)\) and \(v = \lim f(y_n)\). We claim that \(u = v\).

  3. Consider the sequence \(\{ z_n \}\) defined as \(z_{2n} = x_n\) and \(z_{2n-1} = y_n\).

  4. It is easy to show that \(\{z_n \}\) converges to \(x\).

  5. Then, \(\lim f(z_n)\) exists in \(Y\).

  6. If a sequence converges, then all its subsequences converge to the same limit.

  7. Thus, \(\lim f(x_n) = \lim f(y_n) = \lim f(z_n)\).

  8. Thus, \(u = v\).

  9. Therefore \(\lim f(x_n)\) is independent of the choice of sequence \(\{ x_n \}\) as long as \(x = \lim x_n\).

We define a function \(f^* : X \to Y\) with \(\dom g = \closure A\) given the function \(f : X \to Y\) with \(\dom f = A\) as:

\[ f^*(x) = \lim f(x_n) \]

where \(\{x_n\}\) is any sequence converging to \(x \in \closure A\); i.e., \(x = \lim x_n\).

\(f^*\) is well defined since \(\lim f(x_n)\) is independent of the choice of the sequence \(\{ x_n \}\) converging to \(x \in \closure A\).

We next establish that \(f^*\) is uniformly continuous.

  1. Let \(\epsilon > 0\).

  2. We can choose \(\delta > 0\) such that \(\rho(f(x), f(y)) < \epsilon\) whenever \(d(x,y) < \delta\) for any \(x,y \in A\).

  3. Now let, \(x,y \in \closure A\) satisfying \(d(x,y) < \delta\).

  4. Let \(\{x_n\}\) and \(\{y_n\}\) be convergent sequences of \(A\) with \(\lim x_n = x\) and \(\lim y_n = y\).

  5. Then \(\lim d(x_n, y_n) = d(x, y)\) due to Theorem 3.34.

  6. Since \(d(x,y) < \delta\), we can pick \(n_0\) such that \(d(x_n, y_n) < \delta\) for all \(n > n_0\).

  7. But since \(x_n, y_n \in A\) and \(f\) is uniformly continuous, we have, \(\rho(f(x_n), f(y_n)) < \epsilon\) for all \(n > n_0\).

  8. Since \(\{f(x_n)\}\) and \(\{f(y_n)\}\) are convergent sequences of \(Y\), hence \(\lim \rho(f(x_n), f(y_n)) = \rho(f(x), f(y))\) again due to Theorem 3.34.

  9. Thus, \(\rho(f(x), f(y)) \leq \epsilon\).

  10. Thus, \(f^*\) is uniformly continuous on \(\closure A\).

Definition 3.53 (Completion of a metric space)

A complete metric space \((Y, \rho)\) is called a completion of a metric space \((X, d)\) if there exists an isometry \(f: (X, d) \to (Y, \rho)\) with \(\dom f = X\) such that \(f(X)\) is dense in \(Y\).

If we think of \(X\) and \(f(X)\) as identical (up to an isometry), then we can think of \(X\) as a subset of \(Y\).

Theorem 3.71

Any two completions of a metric space are isometric.

Proof. Let \((Y_1, \rho_1)\) and \((Y_2, \rho_2)\) be two different completions of \((X,d)\).

  1. Then there are isometries \(f : X \to Y_1\) and \(g : X \to Y_2\) with \(\dom f = \dom g = X\).

  2. \(g\) is an isometry with \(\dom g = X\) and \(\range g = g(X)\).

  3. \(f^{-1}\) is an isometry with \(\dom f^{-1} = f(X)\) and \(\range f^{-1} = X\).

  4. Then, \(h = g \circ f^{-1}\) is an isometry from \(Y_1\) to \(Y_2\) with \(\dom h = f(X)\) and \(\range h = g(X)\).

  5. \(f(X)\) is dense in \(Y_1\). Hence \(\closure f(X) = Y_1\).

  6. \(h\) is uniformly continuous (since it is an isometry).

  7. \(Y_2\) is complete.

  8. Then, due to Theorem 3.70, there exists a uniformly continuous extension \(h^*\) of \(h\) to all of \(Y_1\).

We have established that \(h^*\) is uniformly continuous.

We next show that \(h^*\) is an isometry.

  1. Let \(u,v \in Y_1\) and \(z = h^*(u)\) and \(w = h^*(v)\).

  2. There is a sequence \(\{ x_n \}\) of \(X\) such that \(\lim f(x_n) = u\).

  3. There is a sequence \(\{ y_n \}\) of \(X\) such that \(\lim f(y_n) = v\).

  4. Let \(u_n = f(x_n)\) and \(v_n = g(y_n)\).

  5. Let \(z_n = g(u_n)\) and \(w_n = g(y_n)\).

  6. We have \(\lim z_n = z\) and \(\lim w_n = w\).

  7. Since \(f\) is an isometry, hence \(d(x_n, y_n) = \rho_1(u_n, v_n)\).

  8. Since \(g\) is an isometry, hence \(d(x_n, y_n) = \rho_2(z_n, w_n)\).

  9. Thus, \(\rho_1(u_n, v_n) = \rho_2(z_n, w_n)\).

  10. Taking limits, we get \(\rho_1(u, v) = \rho_2(z, w)\).

  11. Thus, \(h^*\) is an isometry.

  12. Since it is an isometry, hence it is injective.

We next show that \(h^*\) is surjective (onto).

  1. Let \(v \in Y_2\).

  2. There exists a sequence \(\{ x_n \}\) such that \(\lim g(x_n) = v\).

  3. There exists \(u \in Y_1\) such that \(\lim f(x_n) = u\).

  4. Let \(f(x_n) = u_n\) and \(g(x_n) = v_n\).

  5. Then, \(h(u_n) = (g \circ f^{-1})(u_n) = g(x_n) = v_n\).

  6. Thus, \(h^*(u_n) = v_n\).

  7. Then, since \(h^*\) is uniformly continuous, \(\lim u_n = u\) \implies \(\lim h^*(u_n) = \lim v_n = v = h^*(u)\).

  8. Thus, for every \(v \in Y_2\), there exists \(u \in Y_1\) such that \(h^*(u) = v\).

  9. Thus, \(h^*(u)\) is surjective.

Together since \(h^*\) is an isometric which is onto, hence \(Y_1\) and \(Y_2\) are isometric.

Remark 3.10

If \(f : (X, d) \to (Y, \rho)\) is an isometry with \(\dom f = X\) and \(Y\) is a complete metric space, then \(\closure f(X)\) is a completion of \(X\).

Proof. Let Z = \(\closure f(X)\). Then \(Z\) is a closed subset of \(Y\). By Theorem 3.58, \((Z, \rho)\) is a complete subspace.

Now define \(g : (X, d) \to (Z, \rho)\) as:

\[ g(x) = f(x). \]

Then, \(g\) is an isometry and \(g(X)\) is dense in \(Z\). Thus, \(Z\) is a completion of \(X\).

Theorem 3.72

Every metric space has a unique (up to an isometry) completion.

Proof. We prove this theorem by constructing a metric space which is a completion of a given metric space.

  1. Let \((X,d)\) be a metric space.

  2. Fix an element \(a \in X\).

  3. Now, for every \(x \in X\), we introduce a function \(f_x : X \to \RR\) defined as:

    \[ f_x(y) = d(x,y) - d(y,a) \Forall y \in X. \]

    Note that \(\dom f_x = X\).

  4. From the triangular inequality we have:

    \[ |f_x(y)| = |d(x,y) - d(y,a) | \leq d(x,a) \Forall y \in X. \]
  5. Thus, for a given \(x\) and fixed \(a\), the parametrized function \(f_x\) is bounded by \(d(x,a)\).

  6. Thus, \(f_x \in B(X)\), the space of bounded functions from \(X\) to \(\RR\).

  7. We established in Example 3.20 that the metric space \(B(X)\) is a complete metric space.

We next show that the mapping \(f: X \to B(X)\) given by \(x \mapsto f_x\) is an isometry. Recall that the distance between two functions \(g, h \in B(X)\) is given by:

\[ D(g, h) = \sup\{ | g(x) - h(x) | \ST x \in X\}. \]

Now for some \(x,z \in X\) with corresponding function \(f_x , f_z \in B(X)\), for any \(y \in X\), we have:

\[\begin{split} \begin{aligned} |f_x(y) - f_z(y)| &= | d(x, y) - d(y, a) - [d(z,y) - d(y,a)] |\\ &= |d(x,y) - d(z,y) | \leq d(x, z). \end{aligned} \end{split}\]

At the same time:

\[ |f_x(z) - f_z(z)| = | d(x, z) - d(z, z)| = d(x, z). \]

Thus,

\[ D(f_x, f_z) = \sup\{ | f_x(y) - f_z(y) | \ST y \in X\} = d(x, z). \]

Thus, \(f\) is an isometry. Since \((B(X), D)\) is a complete metric space, hence as per Remark 3.10, \((\closure f(X), D)\) is a completion of \(X\).

We have already established in Theorem 3.71 that any two completions of \(X\) are isometric to each other. Thus, the completion is unique up to an isometry.

3.7.9. Isometries#

Theorem 3.73 (Isometries preserve closed sets)

Let \((X, d)\) and \((Y, \rho)\) be complete metric spaces. Let \(f : (X, d) \to (Y, \rho)\) be an isometry. Let \(C \subset X\) be a closed set in \(X\). Then, \(f(C)\) is closed.

Proof. 1. Let \(\{ y_n \}\) be a convergent sequence of \(f(C)\).

  1. Let \(y = \lim y_n\).

  2. Recall that an isometric is injective.

  3. Thus, \(y_n = f(x_n)\) for some \(x_n \in C\) for every \(n\).

  4. Since \(\{ y_n \}\) is convergent, hence \(\{ y_n \}\) is Cauchy.

  5. Now, for any \(m,n \in \Nat\)

    \[ d(x_m, x_n) = \rho(y_m, y_n) \]

    as \(f\) is isometric.

  6. Thus, \(\{ x_n \}\) is a Cauchy sequence of \(C\).

  7. Since \(X\) is complete, hence every Cauchy sequence converges.

  8. Let \(x = \lim x_n\).

  9. Since \(C\) is closed, hence \(x \in C\).

  10. By continuity of \(f\), we have \(f(x) = y\).

  11. Thus, \(y = f(x) \in f(C)\).

  12. Thus, every convergent sequence of \(C\) converges in \(C\).

  13. Thus, \(f(C)\) is closed.