-1

I have no idea how to work on the following proof. Any Suggestions?

Prove that for any sets A and B, if P(A) ∪ P(B) = P(A ∪ B) then either A ⊆ B or B ⊆ A.

Thanks

geek4079
  • 131

2 Answers2

2

Suppose there exists $ a \in A, a \notin B $ and $ b \notin A, b \in B $ (contradictory to the hypothesis).

Then $ \{a,b\} \in P(A\cup B) $, but $ \{a,b\} \notin P(A) \cup P(B) $ and it's a contradiction.

Jytug
  • 3,169
0

We have $A \cup B \in P(A \cup B) = P(A) \cup P(B)$. Therefore $A \cup B \in P(A)$ or $A \cup B \in P(B)$.

Say, for instance, that it's the first. Then $B \subseteq A \cup B \subseteq A$.

In the second case, we likewise prove $A \subseteq B$.

Mike
  • 66