Compactness of [0, 1] in a specific topology

  • Thread starter Thread starter radou
  • Start date Start date
  • Tags Tags
    Specific Topology
radou
Homework Helper
Messages
3,148
Reaction score
8

Homework Statement



Let R have the topology consisting of all the sets A such that R\A is either countable or all of R. Is [0, 1] a compact subspace in this topology?

The Attempt at a Solution



If U covers R, if it consists of sets of type A such that R\A is finite, then [0, 1] is compact, since, if we take any set A from U, and if A doesn't cover [0, 1], then there's a finite number of points missing to cover [0, 1], let's say x1, ..., xn, and for each xi we can take a set Ai from U containing xi until we cover [0, 1], so we have a finite subcover (consisting of n+1 sets of U).

The interesting case is where R\A is countably infinite.

Let U be a cover for [0, 1] consisting of the following sets:

U1 = R\{1/n : n is a positive integer}
U2 = R\{1/(n+1) : n is a positive integer}
U3 = R\{1/(n+2) : n is a positive integer}, etc.

The family U covers [0, 1], right? But it doesn't have a finite subcover. Does this work?

Edit: by the way, Munkres says:

Definition. If Y is a subspace of X, a collection A of subsets of X is said to cover Y if the union of its elements contains Y.

Lemma 26.1. Let Y be a subspace of X, Then Y is compact if and only if every covering of Y by sets open in X contains a finite subcollection covering Y.

So I considered sets open in R, in the given topology. I hope there's no "subspace issue" I ignored here unwillingly.
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top