Skip to main content

Section The Closure of a Set

We have seen that the interior of a set is the largest open subset of that set. There is a similar result for closed sets. For example, let A=(0,1) in (R,dE). The set A is an open set, but if we union A with its limit points, we obtain the closed set C=[0,1]. Moreover, The set [0,1] is the smallest closed set that contains A. This leads to the idea of the closure of a set.

Definition 10.9.

The closure of a subset A of a metric space X is the set
A―=AβˆͺAβ€².
In other words, the closure of a set is the collection of the elements of the set and the limit points of the set β€” those points that are on the β€œedge” of the set. The importance of the closure of a set A is that the closure of A is the smallest closed set that contains A.

Proof.

Let X be a metric space and A a subset of X. To prove that A― is a closed set, we will prove that A― contains its limit points. Let x∈A―′. To show that x∈A―, we proceed by contradiction and assume that xβˆ‰A―. This implies that xβˆ‰A and xβˆ‰Aβ€². Since xβˆ‰Aβ€², there exists a neighborhood N of x that contains no points of A other than x. But AβŠ†A― and xβˆ‰A―, so it follows that N∩A=βˆ…. This implies that there is an open ball BβŠ†N centered at x so that B∩A=βˆ…. The fact that x∈A―′ means that B∩A― contains a point y in A― different from x. Since B∩A=βˆ…, we must have y∈Aβ€². But this, and the fact that B is a neighborhood of y, means that B must contain a point of A different than y. But B∩A=βˆ…, so we have reached a contradiction. We conclude that x∈A― and Aβ€•β€²βŠ†A―. This shows that A― is a closed set.
The proof that A― is the smallest closed subset of X that contains A is left for the next activity.

Activity 10.9.

Let (X,d) be a metric space, and let A be a subset of X.

(a)

What will we have to show to prove that A― is the smallest closed subset of X that contains A?

(b)

Suppose that C is a closed subset of X that contains A. To show that Aβ€•βŠ†C, why is it enough to demonstrate that Aβ€²βŠ†C?
One consequence of Theorem 10.10 is the following.
We can also characterize closed sets as sets that contain their boundaries.

Definition 10.12.

The boundary Bdry(A) of a subset A of a metric space X is the set of all boundary points of A.
The proof of Theorem 10.13 is left to Exercise 10.
Recall that a boundary point of a subset A of a metric space X is a point x∈X such that every neighborhood of x contains a point in A and a point in Xβˆ–A. The boundary points are those that are somehow β€œbetween” a set and its complement. For example if A=(0,1] in R, the boundary of A is the set {0,1}. We also have that A―=[0,1], Rβˆ–A=(βˆ’βˆž,0]βˆͺ(1,∞), and Rβˆ–A―=(βˆ’βˆž,0]βˆͺ[1,∞). Notice that Bdry(A)=Aβ€•βˆ©Rβˆ–A―. That this is always true is formalized in the next theorem.

Proof.

Let X be a metric space and A a subset of X. To prove Bdry(A)=Aβ€•βˆ©Xβˆ–A― we need to verify the containment in each direction. Let x∈Bdry(A) and let N be a neighborhood of x. Then N contains a point in A and a point in Xβˆ–A. We consider the cases of x∈A or xβˆ‰A.
  • Suppose x∈A. Then x∈A―. Also, xβˆ‰Xβˆ–A, so N must contain a point in Xβˆ–A different from x. That makes x a limit point of Xβˆ–A and so X∈Aβ€•βˆ©Xβˆ–A―.
  • Suppose xβˆ‰A. Then x∈Xβˆ–AβŠ†Xβˆ–A―. Also, xβˆ‰A, so N must contain a point in A different from x. That makes x a limit point of A and so X∈Aβ€•βˆ©Xβˆ–A―.
In either case we have x∈Aβ€•βˆ©Xβˆ–A― and so Bdry(A)βŠ†Aβ€•βˆ©Xβˆ–A―.
For the reverse implication, refer to the next activity.

Activity 10.10.

Let X be a metric space and A a subset of X. In this activity we prove that
Aβ€•βˆ©Xβˆ–Aβ€•βŠ†Bdry(A).
Let x∈Aβ€•βˆ©Xβˆ–A―.

(a)

What must be true about x, given that x is in the intersection of two sets?

(b)

Let N be a neighborhood of x. As we did in the proof of Theorem 10.14, we consider the cases x∈A and xβˆ‰A.
(i)
Suppose x∈A. Why must N contain a point in A and a point not in A? What does this tell us about x?
(ii)
Suppose xβˆ‰A. Why must N contain a point in A and a point not in A? What does this tell us about x?