Let and be subsets of with boundaries , respectively.

Prove or disprove:

I haven't gotten to look much at boundaries yet, so I could use a hand.

Printable View

- September 15th 2010, 08:50 AMRuntyProve or disprove using boundary points
Let and be subsets of with boundaries , respectively.

Prove or disprove:

I haven't gotten to look much at boundaries yet, so I could use a hand. - September 15th 2010, 10:52 AMPlato
- September 16th 2010, 11:19 AMRunty
I'm afraid that doesn't help that much, or at least I don't know how to use that information. The source material we were given relating to boundaries is very scant on details and has no practice problems to speak of.

The question itself, frankly, is not very clear on what it's looking for. - September 16th 2010, 11:26 AMPlato
- September 17th 2010, 08:07 AMRunty
Okay, so far I've gotten this through Plato's suggestions (which I'm assuming are meant to disprove each equality):

#1: and , so it is disproven.

#2: and , so it is disproven.

Am I on the right track, or did I make a mistake somewhere? I really can't be sure because of how little information I've been able to obtain on boundaries.

EDIT: Made a mistake with notation on second answer. I put in the symbols for union instead of intersection. Fixed.