given a set A, is A = ∪P(A)? Note: ∪P(A) is the union of the power set of A
Yeah.
You mean the union of the subsets of \(A\)?
Yes, that's clearly going to be \(A\).
oops yeah the union of the subsets of A
ok but how would you prove it though?
You can do the full proof, but A is just a union of its subsets. Quite intuitive.
Try something a bit more difficult. Like show that the cardinality of a set and its power set differ.
Let a be in \(A\), then \(\{a\}\subset A\) so \(\ a \in \large\cup_{\small B\in P(A)}B\) Let \(a\in \cup_{\small B\in P(A)}B\) then \(a\in B\) for some \(B\subset A\) so \(a\in A\)
Try this one, suppose \(A\) is countably infinite, show that \(P(A)\) is uncountably infinite.
so \(\cup_{\small B\in P(A)}B\subset A\) and \(A \subset \cup_{\small B\in P(A)}B\) so \(A=\cup_{\small B\in P(A)}B\)
Hint: Use diagonalization
if you just need problems to solve, go solve mine:)
I'd rather do a simple proof. :D thanks guys
Join our real-time social learning platform and learn together with your friends!