Which of the following are Hausdorff?

  • Thread starter Thread starter sa1988
  • Start date Start date
sa1988
Messages
221
Reaction score
23

Homework Statement



Which of the following topologies are Hausdorff (if any)?

{∅, {a,b} }

{∅, {a}, {a,b} }

{∅, {b}, {a,b} }

{∅, {a}, {b}, {a,b} }

Homework Equations



Definitions:

A neighbourhood U of x is an open set U⊂X such that xϵU

A topological space is Hausdorff if for each pair x, y of distinct points in X there exist neighbourhoods U of x and V of y which are disjoint.

The Attempt at a Solution

[/B]

Another description I've seen for the Hausdorff property is that for some two subsets U and V in X, the intersection of U and V is the empty set.

Looking at the given topologies, it seems that only the last one is Hausdorff. One can take {a} and {b} and see that their intersection is ∅. .

Hoping I'm correct with this? I just wanted to put it by the physics forum crowd because topology is a new and potentially worrying subject I've taken on at university, with a lot of new definitions and terminology being thrown around at quite a fast pace!

Thanks :oldsmile:
 
Physics news on Phys.org
You are on the right track, but it might help to write out your reasoning. i.e. If you believe the first 3 are not Hausdorff, you should be able to say why, in symbols. You can use you "other description" to do so. i.e. Why (in symbols) do you believe the first isn't Hausdorff? Prove it!
 
And yes topology definitions are going to come at you hard and fast.
braceyourself.jpg
 
  • Like
Likes sa1988
dkotschessaa said:
You are on the right track, but it might help to write out your reasoning. i.e. If you believe the first 3 are not Hausdorff, you should be able to say why, in symbols. You can use you "other description" to do so. i.e. Why (in symbols) do you believe the first isn't Hausdorff? Prove it!

Alright, I'd say for the topologies ##\tau_n ## in the above question statement,
for ##n=[1,3] ## and taking any ##U, V \subset \tau## where ##U \not= V## and ##U, V \not= \emptyset##,
##U \cap V \not= \emptyset## for all ## U, V##, hence ##\tau_1, \tau_2, \tau_3## are not Hausorff

whereas for ##\tau_4## there exists ## U, V \subset \tau## such that ##U \cap V = \emptyset##, hence ##\tau_4## is Hausdorff.
 
Try to prove that a finite space is Hausdorff if and only if it is discrete. That's a fun exercise.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top