Does Every Nonempty Proper Subset of R^n Have a Nonempty Boundary?

  • Thread starter Thread starter redyelloworange
  • Start date Start date
  • Tags Tags
    Intro Topology
redyelloworange
Messages
19
Reaction score
0

Homework Statement


Prove that every nonempty proper subset of Rn has a nonempty boundry.

The Attempt at a Solution



First of all, I let S be an nonempty subset of Rn and S does not equal Rn.

I tried to go about this in 2 different ways:

1) let x be in S and show that B(r,x) ∩ S ≠ ø and B(r,x) ∩ Sc≠ ø. I figured this wouldn't work with just one x in S. Or perhaps, I thought I should use induction on the number of elements in S?
2) Assume that bdS is empty and find a contradiction. However, I wasn't able to figure out a contradiction here. Unless, this implies that S equals Rn, then that's a contradiction. But I'm not quite sure it implies that. I think that this is the proof you use to show that Rn and the empty set are the only 2 that are both open and closed.

Thanks for your help! =)

Homework Statement


Homework Equations


The Attempt at a Solution

 
Last edited:
Physics news on Phys.org
What's the definition of boundry?
 
bd(S) = {x in Rn s.t. B(r,x)∩ S ≠ ø and B(r,x) ∩ Sc≠ ø for every r>0}
 
Take a point x in S and a point y in S^C and consider the line t*x+(1-t)*y for t in [0,1].
 
Well you could assume the contrary and first prove that S must be closed and similarly that S must be open. Now which are the only sets in a connected space with that property?
 
river_rat said:
Well you could assume the contrary and first prove that S must be closed and similarly that S must be open. Now which are the only sets in a connected space with that property?

Redyelloworange is aware of that, he mentions that he thinks the goal is to prove that the n-dimensional reals are connected under the usual topolgy:
I think that this is the proof you use to show that Rn and the empty set are the only 2 that are both open and closed.
 
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