Note that I used (i)-(viii) instead of (a)-(h) to label the statements. Everything else should be exactly the same as in the textbook.
Proposition (Basic properties of open and closed sets)
Let (X,d) be a metric space.
Let E be a subset of X. Then E is open if and only if E=int(E). In other words, E is open if and only if for every x∈E, there exists an r>0 such that B(x,r)⊆E.
Let E be a subset of X. Then E is closed if and only if E contains all its adherent points. In other words, E is closed if and only if for every convergent sequence (xn)n=m∞ in E, the limit limn→∞xn of that sequence also lies in E.
For any x0∈X and r>0, then the ball B(x0,r) is an open set. The set {x∈X∣d(x,x0)≤r} is a closed set. (This set is sometimes called the closed ball of radius r centered at x0.)
Any singleton set {x0}, where x0∈X, is automatically closed.
If E is a subset of X, then E is open if and only if the complement X∖E:={x∈/X∣x∈/E} is closed.
If E1,…,En is a finite collection of open sets in X, then E1∩E2∩⋯∩En is also open. If F1,…,Fn is a finite collection of closed sets in X, then F1∪F2∪⋯∪Fn is also closed.
If {Eα}α∈I is a collection of open sets in X (where the index set I could be finite, countable, or uncountable), then the union ⋃α∈IEα:={x∈X∣x∈Eα for some α∈I} is also open. If {Fα}α∈I is a collection of closed sets in X, then the intersection ⋂α∈IFα:={x∈X∣x∈Fα for all α∈I} is also closed.
If E is any subset of X, then int(E) is the largest open set which is contained in E; in other words, int(E) is open, and given any other open set V⊆E, we have V⊆int(E). Similarly E is the smallest closed set which contains E; in other words, E is closed, and given any other closed set K⊇E, K⊇E.
Proof.
"⟹"
Assume E is open. By definition, this means that ∂E∩E=∅.
First, notice that E⊇int(E) by definition of int(E) (check this!). For the reverse inclusion, let x∈E. Recall that int(E),ext(E),∂EpartitionX; that is, the three sets are disjoint and their union is all of X:
X=int(E)∪ext(E)∪∂E.
Since x∈E, we know that x∈/ext(E) (check this!). Because ∂E∩E=∅ and x∈E, this means that x∈/∂E. Thus, x∈int(E).
This shows that E⊆int(E), so E=int(E) by double-inclusion.
"⟸"
Assume E=int(E). By definition, we need to check that ∂E∩E=∅. We have
∂(E)∩E=∂(E)∩int(E)=∅,
where in the last step, we used the fact that int(E),ext(E),∂E partition X.
"⟹"
Assume E is closed. This means that ∂E⊆E. We know that the set of adherent points of E satisfies E=E∪∂E (this is Proposition 1.2.10 in the textbook), so because both E⊆E and ∂E⊆E, their union E⊆E also.
"⟸"
Assume that E⊆E. By Proposition 1.2.10 again, we know E∪∂E⊆E. In particular, ∂E⊆E, so E is closed by definition,
By part (i), we need to show that for all y∈B(x0,r), there exists s>0 such that B(y,s)⊆B(x0,r). (It's a little confusing, but in (i), I replaced E with B(x0,r), x0 with y, and r with s.)
Let s=r−d(x0,y) (draw a picture to see where I got this from). Then if z∈B(y,s),
d(z,x)≤d(z,y)+d(y,x0)<s+d(x0,y)=r.
In other words, d(z,x0)<r, which means z∈B(x0,r). Thus, B(y,s)⊆B(x0,r), so B(x0,r) is open.
For brevity, I will denote K(x0,r):={x∈X∣d(x,x0)≤r}. We'll use (ii): let (xn)n=m∞ be a sequence of elements in K(x0,r) which converges to x′∈X. We need to show that x′∈K(x0,r). Since xn∈K(x0,r), we have
d(x′,x0)≤d(x′,xn)+d(xn,x0)≤d(x′,xn)+r.
Lastly, because xnn→∞x′, we can send n→∞ to get d(x′,x0)≤r.
(I used the following fact from 131A: if ann→∞a and an≤L for all n, then a≤L.)
We'll use (ii). Let (xn)n=m∞ be a sequence of elements in {x0} which converges to x′∈X. Since xn∈{x0}, this means that xn=x0 for all n, i.e., (xn)n=m∞ is a constant sequence. Thus, xnn→∞x0∈{x0}, so {x0} is closed.
"⟹"
Assume E is open. Suppose (xn)n=m∞ is a sequence of elements in X∖E which converges to x0∈X. We need to show that x0∈X∖E. If x0∈E, then because E is open, there exists r>0 such that B(x0,r)⊆E. But because xnn→∞x0, there exists n≥m such that xn∈B(x0,r). This means xn∈E∩(X∖E)=∅, which is a contradiction.
"⟸"
Assume X∖E is closed. We will show that ∂E∩E=∅. Let x0∈∂E. By definition, this means that for all r>0, we have B(x0,r)∩(X∖E)=∅. But this is exactly what it means for x0∈X∖E=X∖E.
Let x0∈E1∩⋯∩En. For each 1≤i≤n, x0∈Ei, so because Ei is open, there exists ri>0 such that B(x0,ri)⊆Ei. Let r=min{r1,…,rn}>0 (this is where we use the fact that we have a finite intersection). Then for each 1≤i≤n,
B(x0,r)⊆B(x0,ri)⊆Ei.
Thus, B(x0,r)⊆E1∩⋯∩En, so E1∩⋯∩En is open.
For the second statement, we can use (v) by taking complements. Note that
X∖(F1∪⋯∪Fn)=(X∖F1)∩⋯∩(X∖Fn).
By (v), X∖F1,…,X∖Fn are all open sets, so the first statement (where we plug in Ei=X∖Fi) implies that X∖(F1∪⋯∪Fn) is open. By (v) again, F1∪⋯∪Fn is closed.
Let x0∈⋃α∈IEα. By definition, this means there exists α∈I such that x0∈Eα. Since this Eα is open, there exists r>0 such that
B(x0,r)⊆Eα⊆α∈I⋃Eα,
so ⋃α∈IEα is open.
As in the proof of (vi), we can prove the second statement by using (v) and taking complements.
X∖α∈I⋂Fα=α∈I⋃(X∖Fα)
is a union of open sets, hence open by the first statement. By (v), this means ⋂α∈IFα is closed.
First, we show that int(E) is open. Let x0∈int(E) so that there exists r>0 such that B(x0,r)⊆E. By (iii), B(x0,r) is an open set, so given any y∈B(x0,r), there exists s>0 so that
B(y,s)⊆B(x0,r)⊆E,
so y∈int(E). Thus, B(x0,r)⊆int(E), so int(E) is open.
Now, assume V⊆E, where V is an open set. Then for any x0∈V, there exists r>0 so that
B(x0,r)⊆V⊆E,
so x0∈int(E). Thus, V⊆int(E).
Next, we show that E is a closed set. Let (xn)n=m∞ be a sequence of elements in E which converges to x0∈E. We need to show that x0∈E, which means we need to find a sequence of elements in E which converges to x0. Since xn∈E, we know that for any r>0, B(x,r)∩E=∅. In particular, if r=n1, then there exists xn∈E such that xn∈B(x,n1). The sequence (xn)n=m∞ also converges to x0:
d(xn,x0)≤d(xn,xn)+d(xn,x0)≤n1+d(xn,x0).
Sending n→∞ (as we did in the proof of (iii)), the right-hand side tends to 0, so xnn→∞x0. This shows that x0∈E, so E is closed.
Lastly, if K is a closed set such that K⊇E. Let x0∈E. Then there exists a sequence (xn)n=m∞ of elements in E such that xnn→∞x0. But because E⊆K, this means (xn)n=m∞ is also a sequence of elements in K which converges to x0, so x0∈K=K. Thus, E⊆K.
□
Remark.
It's important in (vi) (but not in (vii)) that the number of open/closed sets is finite. Here are two counter-examples from (R,∣⋅∣).
Let En=(−n1,n1). Then
n=1⋂∞En={0},
which is not an open set. Indeed, these sets are equal since 0∈En for all n≥1, and if x0∈⋂n=1∞En, then x0 satisfies
−n1<x0<n1⟺∣x0∣<n1.
If x0=0, then if n0 is large enough, we have ∣x0∣<n01<∣x0∣, which is not possible. Thus, it must be the case that x0=0, which proves that the two sets above are equal.
(Notice how I didn't mention that {0} is closed. In general, a set can be open, closed, both open and closed, or neither open nor closed. In other words, {0} being closed doesn't tell you whether or not it's open.)
Fn=[−1+n1,1−n1] gives another counter-example (exercise below).
Exercise 1.
Let Fn=[−1+n1,1−n1]. Compute ⋃n=1∞Fn and show that it is not closed (which is not the same as showing that it's open).