What is wrong with this proof of the following incorrect theorem? P(A U B) ⊆ P(A) U P(B) let W ∈ P(A U B), then W ⊆ A U B. Let x ∈ W, then x ∈ A U B Case 1: suppose x∈A. Since x∈W and x∈A, W⊆A. W ∈ P(A) W ∈ P(A) U P(B) Case 2: suppose x∈B. Since x∈W and x∈B, W⊆B. W ∈ P(B) W ∈ P(A) U P(B) Therefor W ∈ P(A) U P(B). Hence, P(A U B) ⊆ P(A) U P(B)
btw, P(A) means the power set of A
What is your understanding of a power set? State the definition.
set of all subsets
when it says w is in A, you never talk about little w
what is little w
oh that's a typo. w and W are the same. I just forgot to capitalize it.
that line does not make sense to me \(x\in W, W\in A, W\subset A\)
are you trying to prove this or find what is wrong with the proof?
>.< that's also a typo. It was supposed to be Since x∈W and x∈A, W⊆A.
let me edit the question real quick
but P(A U B) ⊆ P(A) U P(B) is an incorrect theorem. I'm supposed to find where the mistake is.
sec
P(A) U P(B) ⊆ P(A U B) is true but, P(A U B) ⊆ P(A) U P(B) is false
yah yah I see
ok :D
x in A and x in W does not imply W subset of A, W could have more than A in it
ah I see
|dw:1399094955260:dw|
Like this perhaps?
well take \(\{1,2,3,4,5,\}\cup \{6,5,7,8,9\}\) Let \(W = {\{4,5,6\}}\) then let \(x\in W\) then \(x\in A\) but \(W\cancel\subset A\)
so yes like that:)
ok makes more sense now. Thank you (^.^)b
npz
Join our real-time social learning platform and learn together with your friends!