MHB Proof of Sets: Proving (i) and (ii)

  • Thread starter Thread starter Mathick
  • Start date Start date
  • Tags Tags
    Proof Sets
Mathick
Messages
23
Reaction score
0
If $X$ is a set, then the power set $P(X)$ of a set is the set of all subsets of $X$.

I need to decide whether the following statements are true or false and prove it:
(i) If $Z = X \cup Y$ , then $P(Z) = P(X) \cup P(Y)$.

(ii) If $Z = X \cap Y$ , then $P(Z) = P(X) \cap P(Y)$.

By examples I think that (ii) is true but (i) is false. However, I have no idea how to prove it.

Note: Example which I used was: $X=\left\{a,b\right\}$ and $Y=\left\{b,c\right\}$.

(i) $Z = X \cup Y =\left\{a,b,c\right\}$ , so $P(Z) = \left\{\left\{\right\},\left\{a\right\},\left\{b\right\},\left\{c\right\},\left\{a,b\right\},\left\{a,c\right\},\left\{b,c\right\},\left\{a,b,c\right\}\right\}$ .

However, $P(X) \cup P(Y) = \left\{\left\{\right\},\left\{a\right\},\left\{b\right\},\left\{c\right\},\left\{a,b\right\},\left\{b,c\right\}\right\}$.

That's why I disagree with a statement (i).

(ii) $Z = X \cap Y =\left\{b\right\}$ , so $P(Z) = \left\{\left\{\right\},\left\{b\right\}\right\}$ . However, $P(X) \cap P(Y) = \left\{\left\{\right\},\left\{b\right\}\right\}$ as well.

That's why I think a statement (ii) is true.

I would be grateful for help!
 
Physics news on Phys.org
Mathick said:
That's why I disagree with a statement (i).
You are absolutely correct.

If $Z=X\cap Y$, then $A\subseteq Z\iff A\subseteq X\land A\subseteq Y$ for any $A$, which means that $A\in P(Z)\iff A\in P(X)\land A\in P(Y)\iff A\in P(X)\cap P(Y)$.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top