What Is the Relationship Between Open Sets and Their Boundaries in Topology?

  • Thread starter Thread starter Design
  • Start date Start date
  • Tags Tags
    Closed Sets
Design
Messages
62
Reaction score
0

Homework Statement


Prove that if S is open and Sc is open then boundary of S must be empty

The Attempt at a Solution


S is open means boundary of S is a subset of Sc
Sc is open means boundary of Sc is a subset of S (By taking complement of both sides from the definition ?)

This means that they have the same boundary?

Don't know how to proceed from here

thanks
 
Physics news on Phys.org
Yes, S and S^C always have the same boundary. Show that by quoting the definition of 'boundary'.
 
For all r, B(r,x) intersection S = not empty and B(r,x) intersection S^C = not empty, Ok I see how i got this from definition of boundary for both of them. How do I explain the set is empty?
 
Design said:

Homework Statement


Prove that if S is open and Sc is open then boundary of S must be empty

The Attempt at a Solution


S is open means boundary of S is a subset of Sc
Sc is open means boundary of Sc is a subset of S (By taking complement of both sides from the definition ?)

This means that they have the same boundary?

Don't know how to proceed from here

thanks


I think you've pretty much done it -
S is open means the boundary of S is a subset of Sc, so the boundary is not in S.

Sc is open means boundary of Sc is a subset of S. Since you have shown that the boundary of Sc is equal to the boundary of S, this implies that the boundary of S is a subset of S, but S is open so this cannot be.
 
Design said:
For all r, B(r,x) intersection S = not empty and B(r,x) intersection S^C = not empty, Ok I see how i got this from definition of boundary for both of them. How do I explain the set is empty?

You already did that in the first post if you know boundary of S=boundary of S^C.
 
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