Perfect Sets are Uncountable

Theorem

If PR is perfect then P is uncountable.

Proof

We'll use the Nested Compact Set Property to show this, but let's prove it by contradiction.

Let P be perfect and for the sake of contradiction let P be countable (obviously it can't be infinite since then any point is isolated, so then P wouldn't be perfect). Then:

P={x1,x2,x3,}

We'll construct a sequence of compact subsets KnP such that we'll have x1K2, x2K3, and so on. Some care should be taken to show that each Kn is nonempty, but using the Nested Compact Set Property to produce an:

xn=1KnP

that cannot be on the list {x1,x2,x3,}.

Let I1 be a closed interval that contains x1. Then x1 is not an endpoint of I1 so then x1 is not isolated so y1x1 where y1P such that y1I1.

then let I2 is the closed subinterval centered on y2 of I1. Namely if I1=[a,b] let:

ε=min{y1a,by1,|x1y1|}

then the interval I2=[y1ε2,y1+ε2] has the desired properties.

Repeat this process. Because y1 is not isolated then y2 in the interior of I2 and we can say y2x2. Now construct I3 centered on y2 and small enough so that x2I3 and I3I2. Observe that I3P because the set contains y2.

Carrying out the construction inductively, the result is a sequence of In's that are closed where:

  1. In+1In
  2. xnIn+1
  3. InP

To finis the proof we let Kn=InP. For each nN we have Kn is closed because it is the intersection of closed sets, and bounded because it is contained in the bounded set In. Hence Kn is compact, so by construction then Kn is not empty and Kn+1Kn. Thus using the Nested Compact Set Property then:

n=1Kn

But since each KnP and since xnIn+1 then n=1Kn= which is our contradiction.