No problem, glad we could help! And welcome to the site! :)

  • Thread starter Thread starter judelaw
  • Start date Start date
  • Tags Tags
    Closed Topology
judelaw
Messages
3
Reaction score
0
Let X be any infinite set. The countable closed topology is defined to be the topology having as its closed sets X and all countable subsets of X. Prove that this is indeed a topology on X.

Any help would be greatly appreciated. Thanks!
 
Physics news on Phys.org
Hi judelaw! :smile:

What have you already tried to solve this? For being a topology, you need to satisfy three axioms, which ones? And which ones are troubling you?
 
haha, like all of them?

I'm not really sure what countable subsets of X means. I sort of understand the definition of countable (exists a bijection between it and the set of natural numbers?), but I don't really know how to relate that to this problem.
 
First of all, what are the open sets in this (soon to be proved) topology?

1) Is the empty set an open set? Is X an open set?
2) Is a union of open sets an open set?
3) Is a finite intersection of open sets an open set?

or equivalently:

1) is the empty set and X closed sets?
2) Is a finite union of closed sets a closed set?
4) Is an intersection of closed sets a closed set?

Being countable means to be either finite or in bijection with the natural numbers. Any subset of a countable set is countable.
 
Well a subset of X is indeed countable if there exists a bijection between the subset and the naturals, or if the subset is finite.

Maybe some examples will help you: in \mathbb{R}, we have the following countable subsets: \mathbb{N}, \mathbb{Q}, {1,3,5,7,9,11,...}. While [0,1] or \mathbb{R}^+ are not countable.

So, what are the axioms that the closed sets must satisfy? Well, the first one is that the empty set and X are both closed. Can you show this?
 
Ah okay. I got it! I misunderstood "countable subsets. "

Thank you micromass and disregardthat!

And I just found a new website to frequent. :biggrin:
 
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