Topology, counter examples needed.

  • Thread starter Thread starter Tomer
  • Start date Start date
  • Tags Tags
    Counter Topology
Tomer
Messages
198
Reaction score
0

Homework Statement



I need two counter examples, that show the following two theorems don't/B] hold:
Let X be a topological space.

1. If from the closeness of any subset A in X follows compactness of A, then X is compact.
2. If from the compactness of a subset A in X follows closeness of A, then X is housdorff.

I proved the *opposite* theormes which do hold, but I cannot seem to find counter examples.

That means, I need to find a non-compact space, in which every closed subset is compact, and a non-housdorff space, in which every compact subset in closed.

Homework Equations



Are there any equations in Topology?

The Attempt at a Solution



I just tried to take for "1" spaces I know that are not compact, but then couldn't find a space in which every closed subset is a compact one...
In "2" I thought of non-hausdorff spaces I know, but couldn't directly see whether indeed every compact set is closed.

I'd really appreciate your help!

Thanks,
Tomer.
 
Last edited:
Physics news on Phys.org
You aren't going to be able to find a counter example to (1) because it is true. Every space is closed in itself. If it is true that every closed subset of A is compact, then A itself is compact because A is a closed subset of itself.
 
Last edited by a moderator:
Thanks a lot for the reply.
I see you're point :-) That is strange - in the task we were to prove the next theorem (part a):
If X is compact, it follows from the closeness of A that A is compact.

Then we need to give counter examples to show why the opposite doesn't hold. I translated the "opposite claim" correctly, right?

But I definitely agree with what you just said :-)
 
For (2), you might want to try the cocountable topology.
 
Thanks, I will! :-)
 
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