Set Theory: Power sets of Unions

Click For Summary

Homework Help Overview

The discussion revolves around the proposition regarding power sets and unions in set theory, specifically examining the relationship between the power set of a union of two sets and the union of their power sets.

Discussion Character

  • Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • Participants explore the validity of the statement $$P(A \cup B) \subseteq P(A) \cup P(B)$$ and discuss the logical steps involved in proving or disproving it. There is a focus on the misuse of quantifiers and the implications of set membership.

Discussion Status

Participants are actively questioning the reasoning behind the original poster's proof attempt, particularly the logical conclusions drawn from the definitions of power sets. Some guidance has been provided regarding the identification of counterexamples and the importance of correctly applying logical quantifiers.

Contextual Notes

There is mention of the original poster's experience level, indicating that this is their first course on the subject, which may influence their understanding of the concepts being discussed.

WWCY
Messages
476
Reaction score
15

Homework Statement


I'm having issues understanding a mistake that I'm making, any assistance is appreciated! I know a counterexample but my attempt at proving the proposition is what's troubling me.

Prove or disprove
$$P(A \cup B) \subseteq P(A) \cup P(B) $$

Homework Equations

The Attempt at a Solution


Let ##C## be an particularly, arbitrarily picked element of element of ##P(A \cup B)##
Then by definition of a powerset
$$C \subseteq A \cup B$$
This means that
$$\forall x \in C, \ x \in A \cup B$$
$$\forall x \in C, \ x \in A \ \text{or} \ x \in B \ \ \ \ ^{**} $$
$$\forall x \in C, \ x \in A \ \text{or} \ \ \ \forall x \in C , x \in B \ \ \ \ ^{**}$$

Then ##C \subseteq A## or ##C \subseteq B ## and thus ##C \in P(A) \ \text{or} \ C \in P(B)## and ##C \subseteq P(A) \cup P(B)##. The bits I left the asterisks were where I felt I made some error.

But, in a proof of a similar problem: ##P(A \cap B) \subseteq P(A) \cap P(B) ##, I wrote
$$\forall x \in C, \ x \in A \cap B$$
$$\forall x \in C, \ x \in A \ \text{and} \ \forall x \in C, x \in B $$
Then ##C \subseteq A## and ##C \subseteq B ##, and thus ##C \in P(A) \ \text{and} \ C \in P(B)##, and ##C \subseteq P(A) \cap P(B)##. This gave me the right answer.

Why did the first one give me the wrong answer while the second one gave a right one?

PS It would be nice if the explanation isn't too technical as it's my first course on the subject. Thanks!
 
Physics news on Phys.org
WWCY said:

Homework Statement


I'm having issues understanding a mistake that I'm making, any assistance is appreciated! I know a counterexample but my attempt at proving the proposition is what's troubling me.

Prove or disprove
$$P(A \cup B) \subseteq P(A) \cup P(B) $$

Homework Equations

The Attempt at a Solution


Let ##C## be an particularly, arbitrarily picked element of element of ##P(A \cup B)##
Then by definition of a powerset
$$C \subseteq A \cup B$$
This means that
$$\forall x \in C, \ x \in A \cup B$$
$$\forall x \in C, \ x \in A \ \text{or} \ x \in B \ \ \ \ ^{**} $$
$$\forall x \in C, \ x \in A \ \text{or} \ \ \ \forall x \in C , x \in B \ \ \ \ ^{**}$$

Then ##C \subseteq A## or ##C \subseteq B ## and thus ##C \in P(A) \ \text{or} \ C \in P(B)## and ##C \subseteq P(A) \cup P(B)##. The bits I left the asterisks were where I felt I made some error.

But, in a proof of a similar problem: ##P(A \cap B) \subseteq P(A) \cap P(B) ##, I wrote
$$\forall x \in C, \ x \in A \cap B$$
$$\forall x \in C, \ x \in A \ \text{and} \ \forall x \in C, x \in B $$
Then ##C \subseteq A## and ##C \subseteq B ##, and thus ##C \in P(A) \ \text{and} \ C \in P(B)##, and ##C \subseteq P(A) \cap P(B)##. This gave me the right answer.

Why did the first one give me the wrong answer while the second one gave a right one?

PS It would be nice if the explanation isn't too technical as it's my first course on the subject. Thanks!

You can't start with ##C \subseteq A \cup B## and conclude that ##C \subseteq A## or ##C \subseteq B##.

You should be able to find a counterexample to that.

Or, draw a Venn diagram. For example, with disjoint ##A## and ##B##.
 
Thanks for your response!

PeroK said:
You can't start with ##C \subseteq A \cup B## and conclude that ##C \subseteq A## or ##C \subseteq B##.

You should be able to find a counterexample to that.

Or, draw a Venn diagram. For example, with disjoint ##A## and ##B##.
Ah, I see it now. Was my mistake down to the misuse of quantifiers?
 
WWCY said:
Thanks for your response!

Ah, I see it now. Was my mistake down to the misuse of quantifiers?

The mistake is either one of logic or of dissociating the use of quantifiers from basic logic. The false steps should be easy to find if you follow the "proof" through with an example.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
5K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 8 ·
Replies
8
Views
2K