Boundary union and intersection problems

[STEMucator]

Homework Statement

Let A, C \subseteq ℝⁿ with boundaries B(A) and B(C) respectively. Prove or disprove :

B(AUC) O B(A)UB(C)

and

B(A\capC) O B(A)\capB(C)

Where O represents each of these symbols : \subseteq, \supseteq, =

Homework Equations

I know that double inclusion is going to cut the work required by 33% :)?

The Attempt at a Solution

I guess I'll try to start with the case B(AUC) \subseteq B(A)UB(C) ( Since intuitively I know the boundary simply can't get bigger when I union two sets, so I have a feeling that testing for \supseteq is going to flop ).

So suppose x \in B(A \cup C) then we know x is a boundary point of AUC, that is : \forall δ>0, \exists P \in (A \cup C) \wedge Q \in (ℝ^n - A \cup C) | P, Q \in N_δ(x)

Now how to proceed from here I'm not sure, any pointers would be great!

 

[jbunniii]

OK, you've established that every neighborhood N_\delta(x) contains points of A \cup C.

Is it possible for both of the following statements to be false?

* Every neighborhood N_\delta(x) contains points of A
* Every neighborhood N_\delta(x) contains points of C

 

[STEMucator]

OK, you've established that every neighborhood N_\delta(x) contains points of A \cup C.

Is it possible for both of the following statements to be false?

* Every neighborhood N_\delta(x) contains points of A
* Every neighborhood N_\delta(x) contains points of C

Case #1 : B(AUC) \subseteq B(A)UB(C). So we know that x is a boundary point of AUC, that is \forall δ>0, \exists P_1 \in (A \cup C) \wedge P_2 \in (ℝ^n - A \cup C) | P_1, P_2 \in N_δ(x).

So we want to show either x is in B(A) or x is in B(C). To show this, consider \forall δ'>0, \exists Q_1 \in A \wedge Q_2 \in (ℝ^n - A) | Q_1, Q_2 \in N_δ(x)..

Let Q₁ = P₁, if Q₁ \in AUC then Q₁ \inA.

Let Q₂ = P₂, if Q₂\in (ℝⁿ-A) ( By De Morgans laws of course ) then Q₂\in (ℝⁿ-A)

This is finally sufficient to show that x\inB(A) or x\inB(C) through similar argument.

 

[STEMucator]

Is this good so far or?

 

[jbunniii]

So we want to show either x is in B(A) or x is in B(C). To show this, consider \forall δ'>0, \exists Q_1 \in A \wedge Q_2 \in (ℝ^n - A) | Q_1, Q_2 \in N_δ(x)..

It's not necessarily true that every neighborhood of x contains a point of A.

Here is an example:

A = [0,1]
C = [2,3]
A\cup C = [0,1]\cup [2,3]
Let x = 3. Then x \in B(A \cup C), but N_1(x) contains no point of A.

However, consider my earlier hint. I claim that at least one of these must be true:

* Every neighborhood N_\delta(x) contains points of A
or
* Every neighborhood N_\delta(x) contains points of B

I recommend that you start by proving this claim. Then you can proceed knowing that one of the sets, A or B, has the desired property.

 

[STEMucator]

It's not necessarily true that every neighborhood of x contains a point of A.

Here is an example:

A = [0,1]
C = [2,3]
A\cup C = [0,1]\cup [2,3]
Let x = 3. Then x \in B(A \cup C), but N_1(x) contains no point of A.

However, consider my earlier hint. I claim that at least one of these must be true:

* Every neighborhood N_\delta(x) contains points of A
or
* Every neighborhood N_\delta(x) contains points of B

I recommend that you start by proving this claim. Then you can proceed knowing that one of the sets, A or B, has the desired property.

Sorry about that, had to step out for a bit. So I want to prove no matter what point x is in the boundary, the neighborhood of that x will contain points from A and points from C?

 

[jbunniii]

Sorry about that, had to step out for a bit. So I want to prove no matter what point x is in the boundary, the neighborhood of that x will contain points from A and points from C?

No, it won't necessarily contain points from both.

What you need to be able to say is this:

"Choose a point x in the boundary of the union. Every neighborhood of x contains points from A."

or

"Choose a point x in the boundary of the union. Every neighborhood of x contains points from B."

Which one of these statements is true will depend on x and on the sets. And it doesn't matter which one is true. What's important is that at least one of them has to be true for any given x. See if you can prove that. I also have to take off for a while, will check in again later this evening. Good luck in the meantime!

 

[STEMucator]

No, it won't necessarily contain points from both.

What you need to be able to say is this:

"Choose a point x in the boundary of the union. Every neighborhood of x contains points from A."

or

"Choose a point x in the boundary of the union. Every neighborhood of x contains points from B."

Which one of these statements is true will depend on x and on the sets. And it doesn't matter which one is true. What's important is that at least one of them has to be true for any given x. See if you can prove that. I also have to take off for a while, will check in again later this evening. Good luck in the meantime!

I managed to figure these out. Turns out the subset condition held, but the superset and therefore equivalence both failed.

I actually have a slightly more interesting exercise the prof gave me and I have some of it done already, but it's the one I'm interested in and I'm stuck again :P.

Would you care to have a look at it so I don't have to make ANOTHER thread for no reason.

 

[jbunniii]

I managed to figure these out. Turns out the subset condition held, but the superset and therefore equivalence both failed.

I actually have a slightly more interesting exercise the prof gave me and I have some of it done already, but it's the one I'm interested in and I'm stuck again :P.

Would you care to have a look at it so I don't have to make ANOTHER thread for no reason.

Sure, I'll take a look. But please create a new thread for it, if it's a new problem.