1
$\begingroup$
  1. Prove that every compact set in Hausdorff space is closed.

  2. Let $(X,\tau)$ be Hausdorff space and $A,B$ compact, disjont subsets of $(X,\tau)$. Prove that exist two disjoint sets $V,W$ open in $(X,\tau)$, so $A \subset V$, $B \subset W$.

I'have got an idea with 1.

Let K be a compact set in Hausdorff space $(X,\tau )$ and let $a \not\in K$.

$\forall x \in K$ we choose a pair of disjoint open sets $V (x), W(x) \in \tau$ : $a \in V (x)$ and $x \in W(x)$. Because of K compactness, we can choose $x_1, . . . , x_n \in K$ : $K \subset W(x_1) \ \cup . . . \cup \ W(x_n) = W$. Then $V = V (x_1) \cap . . . \cap V (x_n)$ is a neighbourhood of $ a $ disjoint with $W$, so with $K$ as well. Therefore $a \not\in K$, and finally $\overline{K} = K$

Is this correct? Actually I don't have idea about 2nd part. I think this proof might be useful.

$\endgroup$
4
$\begingroup$

HINT: Your argument for (1) is correct. You can indeed use the same idea for (2). Note that (1) essentially proves the special case of (2) in which $A=\{a\}$ for some $a\in X$. In general, then, you can separate each $a\in A$ from $B$ with disjoint open sets. And then?

$\endgroup$
  • $\begingroup$ Well, generally speaking, I think I can replace point $a$ with $A$ set. $\endgroup$ – MatJ Nov 11 '14 at 22:11
  • $\begingroup$ @MatJ: Yes, but how? Specifically, how can you adapt your argument for (1)? HINT: Think of $B$ as taking the place of the point $a$ in (1), and $A$ as taking the place of $K$. $\endgroup$ – Brian M. Scott Nov 11 '14 at 22:15
0
$\begingroup$

Why at the end of your proof do you write $a\notin K$? Don't you assume that at the beginning? And how do you conclude that $\bar K = K$? It is certainly true, but maybe it's easier to reason that $X\setminus K$ is open, since you have just demonstrated that around any point $a\in X\setminus K$ has an open nbhd $V$ which doesn't intersect $K$ (as it doesn't intersect $W$).

For (2) you can use the hint suggested above by Brian.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.