32 Open and Closed Sets Practice

3.2.1

Question

a. Where in the proof for Union & Intersection of Collections of Open Sets (ii) does the assumption that the collection of open sets be finite get used?
b. Give an example of a countable collection of open sets {O1,O2,…} whose intersection ⋂n=1∞On is closed, not empty and not all of R.

Proof

a. It's the part where we have U1,…,Un. This is a finite list of n-elements, and later when we do ε=min(ε1,…,εn) we can only do this with a finite list.

b. Consider the collection:

O={[0,1n]|n∈N}

Here ⋂O={0} is clearly closed and ≠∅,≠R. Let's show the equality holds and that the resulting set is closed.

For the former, notice that for Oi=[0,1n] that it always has 0∈Oi for all i. We'll show that there are no other elements x∈Oi for all i. Assume for contradiction that one such value exists x≠0. Notice for all i that 0≤x≤1i. The right is a sequence and the left is too, so using the Squeeze Theorem then that implies (x)→0. But that implies that x=0 which is a contradiction.

Now to show it's closed, we just have to show that {0} contains it's limit points. The only limit points here are 0 which are already in the set.

☐

3.2.2

Question

Let:

A={(−1)n+2n:n∈N};B={x∈Q:0<x<1}

Answer the following for each set.
a. What are the limit points?
b. Is the set open? Closed?
c. Does the set contain any isolated points?
d. Find the closure of the set?

Proof

a. The limit points of A are just 1,−1 (you would intuitively take the limit of the sequence, but actually prove this via the definition). The limit points of B are any [0,1] points.

b. By intuition it seems that since A is a discrete set of points then it isn't open. It definitely isn't closed since 1∈A but −1∉A showing it's is not closed. It isn't open since if we say have x=2 for example, then any ϵ>0 has it that:

Vϵ(2)=(2−ϵ,2+ϵ)⊈A

Because the largest element in A is itself 2, so then 2+ϵ2∉A.

For B notice that it's similar to (0,1)⊆Q. Notice that because of this then the limit points 0,1∉B so then B is not closed. Is it open? Let x∈B be arbitrary. We want to choose some ϵ>0 such that any v∈Vϵ(x) has v∈B. This happens where:

|v−x|<ϵ−ϵ<v−x<ϵx−ϵ<v<x+ϵ

If we want v∈B then we need to show 0<x−ϵ⇒ϵ<x and x+ϵ<1⇒ϵ<1−x. Choose ϵ=min{1−x,x} such that ϵ>0 to make this happen (this works since x≠0,1 so we can always choose then minimum). But we can't ensure v∈Q even though we can use The Density of Q in R. The v is arbitrary, so then we could always find some v∈I where v∉B by construction. Thus B is not open.

c. A has infinitely many isolated points in the set {(−1)n+2n|n≠1}. B doesn't have isolated points since the set of limit points is a super-set of B.

d. A―=A∪{−1}. B―=(0,1)∪{0,1}=[0,1]⊆Q.

☐

3.2.3

Question

Decide whether the following sets are open, closed, or neither. If a set is not open, find a point in the set for which there is no ε-neighborhood contained in the set. If a set is not closed, find a limit point that is not contained in the set.
a. Q
b. N
c. R−{0}
d. {1+14+19+⋯+1n2:n∈N}
e. {1+12+13+⋯+1n:n∈N}

Proof

a. Q is not open since if we choose x=2 for example then for any ε>0 then since there's always some I between two rationals (see Suprema + Density Practice#1.4.1). Thus that irrational is not in Q by definition, so then Vε(2)⊈Q.

Q is not closed since the limit points of Q is R (this is the Axiom of completeness) are not all within Q (for example, 2).

b. N is not open since literally choosing say n=1 then any ε>0 gives that Vε(1)⊈N as say 1+ε2 is in the neighborhood but not the natural numbers.

N is closed since there are no limit points.

c. The set is open since we can set our ε-neighborhood to not include the missing 0. Namely, if we let x≠0 be arbitrary, then choose:

|p−x|<ε⇒−ε<p−x<ε⇒x−ε<p

But x−ε>0 so then p∈R as desired.

The set is not closed since the limit point 0 is not in the set by construction.

d. For some context we know that ∑1n2 is a convergent p=2 series, so then it is some limit point not in the set L.

Thus the set is not open since if we choose say x=1 then any Vε(1) will have real numbers between 1 and 1+14=54 that are not in the set.

The set is not closed since the limit point L is not in the set (if it was, then any future terms would have to be 0, but 1n2≠0 for any n).

e. For context we know that ∑1n is a divergent p=1 series, so then there are no limit points that aren't in the set.

The set is not open similar in the way that choosing x=1 lets Vε(x) have real numbers between 1 and 1+12=32 that are definitely not in the set.

The set is closed since there are no limit points for the set (as the sequence diverges, so every sequence diverges).

☐

3.2.4

Question

Let A≠∅ and bounded above so that s=sup(A) exists.
a. Show that s∈A―.
b. Can an open set contain its supremum?

Proof

a. It's enough to show either s∈A or s is a limit point of A. If s∈A then we are done so suppose s∉A. To show s is a limit point of A it goes to show every ε-neighborhood around s intersects A at a point other than s (which we don't have to worry about since s∉A).

Let ε>0. We'll show that A∩Vε(s) is non-empty by choosing an element a=s−ε2 and showing it's in this set.

First notice that a∈Vε(s) since |a−s|=|s−ε2−s|=|ε|2<ε. Also a<s so then since s is the suprema of A then a∈A (otherwise a>s which is a contradiction). Thus a∈A∩Vε(s).

b. Nope. We'll show it's impossible. Say some open set U exists such that s=supU∈U. Then since s∈U then ∃ε>0 such that Vε(s)⊆U. But that would imply that the points (s,s+ε)⊆U but clearly if s+ε∈U then that contradicts s being the supremum.

☐

3.2.5

Question
Closure implies Cauchy Sequences

A is Closed (Toplogical) ifff every Cauchy Sequence in A converges to a point in A.

Proof

(⇒): Suppose A is closed, so then A contains it's limit points. Let (xn)⊆A be a Cauchy Sequence. Then (xn) converges by being Cauchy. Say it converges to x, then since A is closed then x∈A as required since A contains its limit points, which are equivalent to the limits of the convergent sequences of A.

(⇐): Suppose ∀(xn)⊆A where (xn)→x (ie: the sequence (xn) is Cauchy because it converges) where x∈A. We need to show that A contains it's limit points.

Let ℓ be a limit point of A. We want to show that ℓ∈A. Since ℓ is a limit point of A then equivalently there is some sequence of points in A−{ℓ} where it converges to ℓ. Denote this sequence (an)∈A−{ℓ} where (an)→ℓ. then since all convergent sequences in A converge to a point in A then ℓ∈A.

☐

3.2.6

Question

Decide whether the following are statements are true or false. Provide counterexamples for those that are false, and supply proofs for those that are true.
a. An open set that contains every rational number must necessarily be all of R.
b. The Nested Interval Property remains true if the term "closed interval" is replaced by "closed set".
c. Every nonempty open set contains a rational number.
d. Every bounded infinite closed set contains a rational number.
e. The Cantor set is closed.

Proof

a. False. The set {x|x≠2}⊆R contains every rational number, but isn't all of R.

b. False. Let An=[n,∞). Then each An≠∅ and An+1⊆An but ⋂n=1∞An=∅

c. True. Any nonempty open set has some a∈A and since A is open then ∃ε>0 such that Vε(a)⊆A. Now clearly a−ε,a+ε are real numbers so since Q is dense in R then there is some rational number r such that a−ε<r<a+ε. Now that implies r∈Vε(a)⊆A so then r∈A, so A has some rational number.

d. False. Consider A={2+1n:n∈N}∪{2}. This set has the limit point of 2 which is in the set, so it's closed. Notice also A is bounded between 2+1 and 2. It's also infinite in size (countable infinite to be exact).

e. True. Take any limit point x of C. Then we can create a series of binary digits where 0 represents it being the the left set of Ci (for each cut i), and 1 for the right set. Then x is represented by some series of binary digits b1b2… where each bi is 0 or 1. Then convert each bi into either the left endpoint of the related set if it's a 0, or the right endpoint if it's a 1. If any bi should make the sequence ever equal x, then choose the opposite endpoints (since all the following bi's should be the same number, we should have all 0's or 1's to follow, so choosing the opposite endpoints should create a sequence that doesn't equal x but converges to x). As a result this sequence of numbers will never equal x but will converge to x, thus x∈C. Therefore, C is closed.

☐

3.2.7

Question

Given A⊆R let L be the set of all limit points of A.
a. Show that the set L is closed.
b. Argue that if x is a limit point of A∪L then x is a limit point of A. Use this observation to furnish a proof for Closure is the Smallest Closed Set.

Proof

a. Let ℓ be a limit point of L, so then ∃(xn)⊆L such that each xn∈L−{x} and then xn→ℓ. We need to show that ℓ∈L by showing it as a limit of a sequence of some an's. Now since (xn)⊆L then each xn is some limit point for A, namely ∀n∈N then ∃an∈A such that am→xn. Denote amn being am for the corresponding xn. We want to show that amn→ℓ as m→∞.

Let ε>0. As a result ε2>0 so then since am→xn and xn→ℓ then ∃N∈N such that for m,n>N then:

|amn−ℓ|≤|amn−xn|+|xn−ℓ|=ε2+ε2=ε

Thus amn→ℓ as desired, so then ℓ is a limit point for A so ℓ∈L.

b. Let's prove the lemma:

If x is a limit point of A∪L then x is a limit point of A.

Proof

Let x be a limit point of A∪L. Then ∃(xn)⊆A∪L where each xn∈(A∪L)−{x} while xn→x. Now we need to construct a sequence such that each element is in A−{x} while that sequence converges to x. The problem we'll face is that some of the xn's will be in L and not in A (since A may or may not be closed).

This is easy. Create a subsequence (xnk) such that for each n, you do the following:

Since this is a subsequence of a convergent sequence that converges to x then this subsequence must also converge to x, showing x is a limit point to A.

☐

The actual proof showing the smallest is seen at Closure is the Smallest Closed Set, which uses our lemma.

☐

3.2.8

Question

Suppose A is an Open Sets and B is a Closed (Toplogical) set. Determine if the following sets are definitely open, definitely closed, both, or neither.
a. A∪B―
b. A−B
c. (Ac∪B)c
d. (A∩B)∪(Ac∩B)
e. A―c∩Ac―

For all of these it's useful to use the Unions & Intersection of Closed Sets and the Union & Intersection of Collections of Open Sets properties, along with the complement/closure properties. Furthermore, since there are only two sets that are both open and closed then we should only have definitely closed or definitely open.

Proof

a. We know that A∪B―, by the definition of closure, is a closed set.

b. Notice that A−B=A∩Bc. Notice that since B is closed then Bc is open. Since A is open and B is open then their intersection must be open.

c. This is equivalent to (b).

d. Since A is open then Ac must be closed. Then Ac∩B must be closed as well, so then the whole set is definitely closed.

e. Note that by closure then A― is definitely closed, implying A―c is definitely open. Similarly Ac― is definitely open. Their intersection implies that the whole thing is definitely open.

☐

3.2.10

Question

Only one of the following three descriptions can be realized. Provide an example that illustrates the viable description and explain why the other two cannot exist.
i. A countable set contained in [0,1] with no limit points.
ii. A countable set contained in [0,1] with no isolated points.
iii. A set with an uncountable number of isolated points.

Proof

i. This one is impossible. Say some countable set A={an:n∈N}⊆[0,1] such that there are no isolated points. Then we can sort our an's into a sequence bn such that the sequence of bn's are increasing. Since bn≤1 for all n then the Monotone Convergence Theorem says that bn→x converges. But if x∈A then that would imply that eventually the bi=x which implies that A is finite and thus not countable. Thus x∉A implying that x is a limit point of A which is also a contradiction.

All bounded, countable sets have some limit point.

(alternatively one could use Balzano-Weierstrass Theorem to show there exists a convergent subsequence, implying a limit point).

ii. This one is possible. Use Q∩[0,1] has no isolated points while being countable.

iii. This one is impossible. Let A⊆R where x is some isolated point of A. From the definition then ∃ε>0 where Vε(x)∩A={x}. Consider the set of points unioning the Vε(x) for each isolated point x:

⋃λ∈set of iso. pts.{λ}=⋃λ(Vε(λ)∩A)

But via Cardinality Practice#1.5.6 suggests that since each {λ} is disjoint with one another (and are open subintervals) then their collection cannot exist. Hence A cannot exist.

☐

3.2.13

Question

Prove that the only sets that are both open and closed are R and the empty set ∅.

Proof

Notice that ∅c=R so then if we show that ∅ is closed and open, then R is both closed an open by Closed Implies Complement is Open (Vice Versa).

Notice that ∅ being open is vacuously true since there is no element x∈∅ such that we have to construct some ε-neighborhood within ∅.

Now to show that it is open; that ∅ has all of its limit points, notice that there are no limit points to ∅, so then ∅ is also vacuously open.

Now we should show that any set A that isn't one of these sets must exclusively be either open or closed. Assume for contradiction that the theorem doesn't hold, that instead A here is non-empty (and not R) but is both open and closed. Choose a∈A be an arbitrary element (which we can choose since A≠∅). Then because A is open then ∃ε>0 where Vε(a)⊆A.

Consider the cases that A could be:

⋃Vεi(a+εi−1)=(a,∞)⊆A

A similar process can be done for the negative numbers, giving that (−∞,a)⊆A. That means that since a∈A then A=R which is a contradiction.

☐

3.2.14

Question

A dual notion to the closure of a set is the interior of a set. The interior of E is denoted E∘ and is defined as:

E∘={x∈E:∃Vε(x)⊆E}

Results about closures and interiors possess a useful symmetry.
a. Show that E is closed iff E―=E. Show that E is open iff E∘=E.
b. Show that E―c=(Ec)∘ and similarly that (E∘)c=Ec―.

Proof

a. Let's do the first proof:

(⇒): Suppose E is closed, so then E contains its limit points. As a result then L⊆E and E―=E∪L=E.
(⇐): Suppose E―=E. Then E∪L=E so then L⊆E and thus E is closed (any x∈L implies x∈E).

For the second proof:

(⇒): Suppose E is open. Then we'll show any x∈E∘ implies x∈E and vice versa. Suppose x∈E∘. Then ∃ε>0 such that Vε(x)⊆E. Clearly x∈Vε(x) so then x∈E as desired. Similarly let x∈E. Since E is open then ∃ε>0 such that Vε(x)⊆E. Clearly then x∈E∘ as a result.

(⇐): Suppose E∘=E. To show E is open, then let x∈E be arbitrary. Then x∈E∘ by our given, so ∃Vε(x)⊆E. By definition of openness then E must be open.

b. For the first proof:

x∈E―c iff x∉E and x is not a limit point of E. x∈(Ec)∘ iff x∉E and ∃Vε(x)⊆Ec. All we have to show is that x is not a limit point is equivalent to ∃Vε(x)∈Ec, but the definitions give this equivalence (take the opposite of the Limit Point definition, and ignore the {x} case since x∉E).

For the second proof try using the finding above, where here D=Ec:

Ec―=D―=(D―c)c=((Dc)∘)c=(E∘)c

☐