lacunary - Mathnotes

Perfect Sets

Note \@{perfect-sets-reference-note}

This section was developed by following Rudin, Principles of Mathematical Analysis, Chapter 2.

Review the definition of a perfect set:

Theorem \@{non-empty-perfect-sets-in-rk-are-uncountable}

Let P be a nonempty perfect set in Rk. Then P is uncountable.

Proof \@{proof-of-non-empty-perfect-sets-in-rk-are-uncountable}

We know that P is infinite, because by definition, all points in perfect sets are limit points, and only infinite sets have limit points.

Suppose, for the sake of contradiction, that P is countable. Label the points of P as x1,x2,. We will construct a sequence of Vn of neighborhoods.

As a base step, let V1 be any neighborhood of x1; let V1={yRk| |yx1|<r} (note: subsequent Vn+1 aren't required to be neighborhoods of xn+1.) Then the closure V1 of V1 is V1={yRk| |yx1|r}.

For the inductive step, suppose as an induction hypothesis that we have some Vn that's been constructed such that VnP is not empty. Since every point of P is a limit point of P, we can make a neighborhood Vn+1 such that (i) Vn+1Vn, (ii) xnVn+1, (iii) Vn+1P is not empty. Now, Vn+1 satisfies our induction hypothesis, and since V1 does too, we have Vn defined for all n=1,2,3,.

For each n, let Kn=VnP. Since Vn is closed and bounded, Vn is compact. Since xnVn+1, no point of P lies in n=1Kn. Since KnP, this implies that n=1Kn is empty. But, each Kn is nonempty, by (iii), and Kn+1K, by (i). But the intersection of nonempty compact nested sets is nonempty, so we have a contradiction, so our provisional assumption that P is countable must be incorrect. Therefore, P is uncountable.

Corollary \@{every-interval-is-uncountable}

Every interval [a,b](a<b) is uncountable, and thus the set of all real numbers is uncountable as it contains uncountable subsets.

Referenced by (1 direct)

Direct references:

Separable Spaces

Theorem \@{euclidean-space-is-separable}

Rk is separable.

Proof \@{proof-of-euclidean-space-is-separable}

The points of Rk that have only rational coordinates are a subset of Rk, we'll call it Qk, countable and dense.

We know that the rationals are countable, and because n-tuples of countable elements are countable, Qk is countable.

To show Qk is dense, consider an arbitrary point p in Rk. Now, let ϵ>0. Since the the rationals are dense in the reals, we can pick a qQk with d(p,q)<ϵ, by picking rational approximations of the coordinates of p and forming q such that q is within ϵ of p, i.e.

|piqi|<ϵk|pq|<i=1k(piqi)2<kϵk=ϵ.

Base

Definition: Base \@{base}

A collection Vα of open subsets of X is said to be a base for X if the following is true: For every xX and every open set GX such that xG, we have xVαG for some α. In other words, every open set in X is the union of a subcollection of Vα.

Theorem \@{every-separable-metric-space-has-a-countable-base}

Every separable metric space has a countable base.

Proof \@{proof-of-every-separable-metric-space-has-a-countable-base}

Let X be a separable metric space, and let xGX, with G @open-set. Now, because X is separable, it by definition has a countable dense subset E. If xE, we can pick a rational δ>0 and let Nδ(x) be a neighborhood such that Nδ(x)G (δ must also be small enough such that this neighborhood is within G, which is possible because x is an interior point of G and we can pick a rational as close to any real as we'd like.) Now we have that xNδ(x)G, and since there are countably many xE and countably many neighborhoods with rational radius around each xE, there are countably many such neighborhoods in G. On the other hand, if xE, then x is a limit point of E, and thus there is pE as close as we'd like to x. Pick pE such that d(p,x)<δ for some rational δ such that xNδ(p)G. Again, since there are countably many such pE, with countably many neighborhoods of rational radius each, there are countably many such neighborhoods in G.

Now, if we let G be the union of all open sets GβX, then G is open, and let Vα be the union of all the Nr(q),qGE, with rQ, then every xG is in some Vα, and there are countably many Vα, so Vα is a countable base for X.

Theorem \@{every-metric-space-where-every-infinite-subset-has-a-limit-point-is-separable}

Let X be a metric space in which every infinite subset has a limit point. Then X is separable.

Proof \@{proof-of-every-metric-space-where-every-infinite-subset-has-a-limit-point-is-separable}

Let δ>0, and pick x1X. Now, continue picking xj+1 such that d(xi,xj+1)δ i.e. so that each new point is at least δ away from each existing point. Suppose this process continues infinitely; then the points {xi} are an infinite subset of X, and thus must have a limit point p. Now, because every neighborhood of p must contain infinitely many points in xi, we can let r=δ/2, Nrp be a neighborhood of p, and pick x,y{xi},Nrp. But, by the triangle inequality

d(x,y)d(x,p)+d(p,y)<δ/2+δ/2=δ

so d(x,y)<ϵ, which contradicts our assumption that {xi} could be an infinite set where all points were at least δ apart. Therefore, {xi} has only finitely many points, and X can be covered with finitely many open balls of radius δ (for if it couldn't be, we could always fit another point into {xi}.)

Now, if we let δ=1/n,n=1,2,3,, we can consider the set of points {xi}n as the finite set of points at least 1/n apart in X. The collection of all such points can be called {xin} and is dense in X: let p be a point in X. and Nrp,r>0 a neighborhood of p. If we pick n such that 1/n<r, then some {xi}n will be in Nrp, because if not, we would have a contradiction with the fact that shown above that no point in X is more than 1/n away from a point in {xi}n.

Since each {xi}n is finite, and there are countably many {xi}n, the {xin} is a countably dense subset of X and therefore X is separable.

Referenced by (1 direct)
Theorem \@{compact-metric-space-has-countable-base}

Every compact metric space has a countable base and is therefore separable.

Proof \@{proof-of-compact-metric-space-has-countable-base}

Let K be a compact metric space. Fix nN (any natural number will do,) then, consider the open cover {Gα}n of balls of radius 1/n centered at xK. Now, because K is compact, some finite {Vα}n{Gα}n covers K.

Now, consider the set of all balls for all n,

C=n=1{Vα}n

Because the union of a sequence of countable sets is countable, C is countable. To show C is a base for K, let G be an open subset of K, and let xG. Let ϵ>0 such that Bϵ(x)G. Pick natural n such that 1/n<ϵ/2. Then, x{Vα}n for some α, (because no point in K is more than 1/n away from the center of some {Vα}n and therefore C is a countable base of K. Since we can make ϵ as close to 0 as we like, the centers of {Vα}n are dense as well as countable, and are therefore a countable dense subset of K, so K is separable.

Theorem \@{infinite-subset-has-limit-point-implies-compact}

Let X be a metric space in which every infinite subset has a limit point. Then X is compact.

Proof \@{proof-of-infinite-subset-has-limit-point-implies-compact}

By Let X be a metric space in..., we know that X is separable and by Every separable metric space has a countable..., we know that X has a countable base. By the definition of base, we have that every open cover of X has a countable subcover {Gn},n=1,2,3,.

Suppose, for the sake of contradiction, that {Gn} has no finite subcollection that covers X. Let

Fn=(G1Gn)c.

Then, each Fn must be nonempty (otherwise a finite subcollection of {Gn} would cover X. However, since every point in X is in some Gn,

n=1Fn=.

Now, let E be a set with a point from each Fn. Since there are infinitely many Fn, E is an infinite subset of X, and therefore E has a limit point, p. Now, p must be in some open Gm, and so for some ϵ>0, Nϵ(p)Gm.

Now, note that each Fn+1Fn, because Fn+1 is formed by excluding all the points in Fn that are also in Gn+1. Because p is a limit point of E, Nϵp must contain infinitely many points of E. However, only finitely many points of E can be in Nϵ(p)Gm, because for n>=m, Fn contains no points in Gm. Therefore, p is not a limit point of E, and no such limit point can exist, contradicting our hypothesis that every infinite subset of X has a limit point. Therefore, E must be finite, and {Gn} must have a finite subcollection that covers X, meaning X is compact.

Definition: Condensation Point \@{condensation-point}

A point p in a metric space X is said to be a condensation point of a set EX if every neighborhood of p contains uncountably many points of E.

Example \@{condensation-point-example}

Let pR,ϵ>0 and let E=(p,p+ϵ). Then, for any 0<δ<ϵ let Nδ(p) be an open ball around p. Then, Nδ(p)E=(p,p+δ) is an open interval in E, and is therefore uncountable.

Theorem \@{condensation-points-of-an-uncountable-subset-of-rk-are-perfect}

Suppose ERk, with E uncountable, and let P be the set of all condensation points of E. Prove that P is perfect and that at most countably many points of E are not in P, that is, that PcE is at most countable.

Proof \@{proof-of-condensation-points-of-an-uncountable-subset-of-rk-are-perfect}

Let {Vn} be a countable base of Rk (see Rk is separable. and Every separable metric space has a countable...,) and let W be the union of those Vn for which EVn is at most countable. We will show that P=Wc.

Suppose pWc. Then p is in no Vn for which VnE is at most countable, that is, every neighborhood of p has uncountably many points in E, and thus pP.

Conversely, suppose pP. Suppose, for the sake of contradiction, that pW. Then pVn for some Vn where VnE is at most countable. But, since p is an interior point of this Vn, there is a neighborhood N(p)Vn, and since every neighborhood of p has uncountably many points in E, we have a contradiction, and thus our assumption that pW must be incorrect, and therefore pWc, and P=Wc. Furthermore, since W is a union of open sets, W is open, and Wc=P is closed.

Since W is open, only countably many Vn are required to cover it. Each of these Vn has at most countably many points in E, so W=Pc has at most countably many points in E, that is, there are at most countably many points of E that are not in P.

Now, to show all points in P are limit points of P, suppose pP. Let Nr(p),r>0 be a neighborhood of p. Then, Nr(p)E is uncountable. Now, since there are at must countably many points in E that are not in P, there are at most countably many points in (Nr(p)E)P, and therefore there must be uncountably many points in Nr(p)EP. Therefore, every neighborhood of p contains infinitely many points in P other than p, p is a limit point of P, and P is perfect.

Referenced by (1 direct)
Theorem \@{cantor-bendixson-theorem}

Every closed set in a separable metric space is the union of a (possibly empty) perfect set and a set which is at most countable.

Proof \@{proof-of-cantor-bendixson-theorem}

Let X be a separable metric space and EX be closed. If E is at most countable, then we are done.

Suppose that E is uncountable. Note that the proof of Suppose ERk, with E uncountable,... only uses the property that Rk is a separable metric space, and it therefore generalizes to any separable metric space. Thus E is the union of a perfect set - its condensation points, P, and a set that is at most countable, EP.

Corollary \@{countable-closed-set-has-isolated-points}

Every countable closed set set in Rk has isolated points.

Proof \@{proof-of-countable-closed-set-has-isolated-points}

Let E be a countable closed set in Rk. Suppose for contradiction that E has no isolated points. Then every point of E is a limit point of E, and thus E is perfect set. But, every nonempty perfect set in Rk is uncountable, a contradiction. Thus, our assumption that E has no isolated points is incorrect, and E must contain isolated points.

Theorem \@{open-set-in-r1-is-countable-union-of-disjoint-segments}

Every open set in R1 is the union of an at most countable union of disjoint segments.

Proof \@{proof-of-open-set-in-r1-is-countable-union-of-disjoint-segments}

Let E be an open set in R1. Let xE. Let a=inf{y:(y,x]E} and b=sup{y:[x,y)E}. Then, a<x<b, because E is open and thus x is an interior point of E and there is some neighborhood around x that is entirely within E. Let I(x)=(a,b). By construction, I(x) is connected. For all uI(x), I(u) must have the same end points as I(x), since if it extended beyond, our construction of I(x) would be contradicted. Also note that for all vEI(x), I(v)I(x)=, for if they intersected, they would form an open interval. Thus, each I(x),xE is either disjoint from all others or identical to some other I(y),yE, and E is the union of all such unique I.

Now, in each I, we can pick a rational number. Because the rationals are countable, we have at most countably many unique I, and E is their union.

Theorem: Special case of Blaire's theorem \@{baire-category-theorem-special-case}

If Rk=n=1Fn, where each Fn is a closed subset of Rk, then at least one Fn has a non-empty interior. Equivalently, If Gn is a dense open subset of Rk, for n=1,2,3,, then n=1Gn is not empty (in fact, it is dense in Rk.)

Proof \@{proof-of-baire-category-theorem-special-case}

First, note that since Rk=n=1Fn, every point in Rk is in some Fn, and so n=1Fnc must be empty.

Suppose, for the sake of contradiction, that no Fn has a non-empty interior, that is, every Fn is closed with an empty interior. Then, each Fnc is open. Moreover, since Fn has an empty interior, it has no points for which there exists a neighborhood that contains only points in Fn, that is, every neighborhood of each point of Fn contains a point in Fnc, so every point in Fn is a limit point of Fnc, and every point in Rk is either in Fnc or is a limit point of Fnc, so each Fnc is non-empty and dense in Rk.

As a base step, let x1 be some point in Rk, and let B1 be an open ball around x1. Since the interior of F1 is empty, B1F1c is not empty, and is open.

For the inductive step, suppose we have some Bn that's constructed such that BnFnc is non-empty and open. Then, we can pick a point xn+1BnFnc,xn+1xn, and make a ball Bn+1 around it such that Bn+1BnFnc, xnBn+1, and Bn+1Fn+1c is open and not empty. Now, since Bn+1 satisfies our induction hypothesis, and since B1 does as well, we have Bn defined for all n=1,2,3,.

Since the set of points {xn} is infinite (by induction) and bounded (all points are within B1,) it has a limit point p in Rk.. Now, suppose, for contradiction, that p is not in every Fnc. Then, for some N, p is not in FNc. Since pFNc and BN+1FNc, we have pBN+1. Since BN+1 is open and p is outside it, p is at some positive distance ε from any point qBN+1. But xnBnBN+1 for all n>N, so all these infinitely many points are at distance at least ε from p. Thus any neighborhood of p with radius less than ε contains at most finitely many points of {xn}, contradicting that p is a limit point.

Now, this means that pn=1Fnc, meaning n=1Fnc, a contradiction! Therefore, our supposition that every Fn has an empty interior must be incorrect, and some Fn must have a non-empty interior.