Completeness is a property of metric spaces. Before discussing the completeness of a metric space, it is essential to know about the Cauchy sequence within a metric space.
Let (X, d) be a metric space with d as a metric, if {xn} be a sequence in X. Then {xn} is a Cauchy sequence if and only if for every ε > 0, there exist a positive integer no, where the value of no depends on ε, that is, no = no(ε) such that;
∀ m, n ≥ no ⇒ d(xm, xn) ≤ ε
A significant result is associated with the Cauchy sequences: “every convergent sequence in a metric space is a Cauchy sequence”. However, this result does not ensure the convergence of a Cauchy sequence. Later on, we see that the completeness of a metric space proves this thing.
With this definition of the Cauchy sequence, we shall define the completeness of a metric space.
Table of Contents: |
Definition of Completeness
A metric space (X, d) is a complete metric space if and only if every Cauchy sequence in X converges to a point in X.
A complete metric space ⇔ Every Cauchy sequence converges within X |
We can note the following points:
- A complete metric space suggests that if d(xm, xn) → 0 as m, n → ∞, then there exist xo in X such that d(xn, xo) → 0 as n → ∞, that is, the sequence {xn} converges to xo in X.
- Every Cauchy sequence in a complete metric space has a convergent subsequence. Since a sequence is convergent if it has a convergent subsequence.
Completeness of Real Metric Space R
A real metric space (R, d) where d is the usual metric space such that d(x, y) = |x – y| ∀ x, y ∈ R, is complete. |
To prove this, we must show that every Cauchy sequence in R converges to a point in R. Let us consider {xn} be a Cauchy sequence in R, we can choose the ε > 0 as ε = 1/2q, for this ∃ nq ∈ N such that
m, n ≥ nq ⇒ d(xm, xn) < 1/(2q + 1) ⇒ |xm – xn| < 1/(2q + 1) ∀ n, m ≥ no and xm, xn ∈ X
Then we can have, |xn – xnq| < 1/(2q + 1)
If Iq is the closed interval such that nq ∈ Iq
where Iq = [xnq – 2–q, xnq + 2–q] and since |xnq – xnq + 1| < 1/(2q + 1)
we get, Iq + 1 ⊂ Iq
The length of Iq = 2/2q = 1/2q – 1 → 0 if q → ∞, that means, |Iq| → 0 as k → ∞.
Hence by the Nested Interval theorem,
“I1, I2, I3, …, In, … be a collection of nested closed intervals such that I1 ⊇ I2 ⊇ I3 ⊇ …. ⊇ In ⊇ …, then the intersection of this collection is non-empty and equal to a singleton set.”
Thus, the intersection of all Iq consists of exactly one point of R, say s.
So s ∈ Iq ∀ q ∈ N such that
|s – xnq| < 1/(2q + 1)
Hence for all n ≥ nq, we have
|xn – s| = |xn – xnq – s + xnq| ≤ |xn – xnq | + |s – xnq| < 1/(2q + 1) + 1/(2q + 1) = 1/2q
⇒ |xn – s| < 1/2q
From the above, it follows that the Cauchy sequence {xn} converges to the point s in R.
Thus, every Cauchy sequence in R converges to a point in R.
Therefore, R is complete.
Related Articles
Solved Examples on Completeness
Example 1:
Let X = C[0, 1] be the space of all continuous functions defined on the closed interval [0, 1]. Show that the metric space (X, d), where d(f, g) = Max 0 ≤ x ≤ 1 |f(x) – g(x)| ∀ f, g ∈ X is complete.
Solution:
Let {fn(x)} be a Cauchy Sequence in the metric space (X, d). Then for a given ε > 0, there exist no ∈ N depending on ε such that
m, n ≥ no ⇒ d(fm, fn) < ε ∀ m, n ≥ no
⇒ Max 0 ≤ x ≤ 1 |fm(x) – fn(x)| < ε ; ∀ m, n ≥ no and ∀ f, g ∈ X
⇒ |fm(x) – fn(x)| < ε ; ∀ m, n ≥ no and ∀ x ∈ [0, 1]
Hence, by Cauchy’s Principle of uniform convergence, “Let {fn} be sequence of real-valued function over a set E then it will be uniformly convergent on E if and only if for a given ε > 0, ∈ no ∈ N such that for n, m ≥ no ⇒ |fm(x) – fn(x)| < ε; ∀ m, n ≥ no and ∀ x ∈ E.”
Therefore, the sequence {fn} converges to f in X as n → ∞.
Now, fix n and let m → ∞, we have
|fn(x) – f(x)| < ε ; ∀ n ≥ no and ∀ x ∈ [0, 1]
⇒ Max 0 ≤ x ≤ 1 |fn(x) – f(x)| < ε ; ∀ n ≥ no and ∀ x ∈ [0, 1]
⇒ d(fn, f) < ε ; ∀ n ≥ no
Thus, the Cauchy sequence {fn} converges to f in metric space (X, d). (X, d) is complete.
Example 2:
A metric space (X, d) with d as a discrete metric is complete.
Solution:
Let {xn} be a Cauchy sequence in metric space (X, d). Then we can choose ε = 1/2 > 0 accordingly there exist no depending on ε such that
For n, m ≥ no ⇒ d(xm, xn) < ½
⇒ d(xm, xn) = 0 ∀ n, m ≥ no (since d is a discrete metric)
⇒ xn = xn + 1 = xn + 2 = … = x (say)
Therefore, d(xn, x) = 0 < 1/2 ∀ n ≥ no
That means the Cauchy sequence {xn} converges to a point x in X.
Thus, every Cauchy sequence in (X, d) converges which makes (X, d) a complete metric space.
Frequently Asked Questions on Completeness
What is meant by the Completeness of a metric space?
If every Cauchy sequence within the metric space converges to a point in the given set, the metric space is said to be complete.
Are closed metric spaces complete?
Let (X,d) be a complete metric space, and let (Y, d) be a subspace of X. Y is complete if and only if Y is closed. So, yes, a closed metric space is considered complete if it is considered a subspace of a complete metric space.
How to prove the completeness of any metric space?
To prove the completeness of a metric space, we shall show that every Cauchy sequence in that metric space converges to a point in it.
Is R a complete metric space?
A real metric space (R, d) where d is the usual metric space such that d(x, y) = |x – y| ∀ x, y ∈ R, is complete. We can prove the completeness of R by showing that every Cauchy sequence in R converges in R.
Comments