Home » Blog » Proving some relations between given sets

# Proving some relations between given sets

Let Prove or disprove the following.

1. .
2. .
3. .
4. .
5. .
6. .
7. .
8. .
9. .

1. False.
These sets are not equal since they do not contain the same elements (since and ).
2. False.
Since contains an element (e.g. 1) that is not contained in , we have . (Again, this is asking us to observe that .)
3. False.
Again, but ; hence, .
4. True.
Proof. By definition of we have . Since , we have .∎
5. False.
Since , but , we have .
6. False.
The element is in , but is not in . Hence, .
7. True.
Proof. To show , we must show that every element in is also in , and that (so that is a proper subset). First, the only two elements of are the sets and . Since each of these sets is contained in by definition of , we have . Finally, since the set , but , we see that the inclusion is proper. Hence, . ∎
8. False.
Again, the problem is emphasizing the difference between an element and the set that contains that element. In this case and is not an element of (even though and are elements of , the set containing the sets and is not).
9. True.
Proof. By the definition of we have . Since , we have . ∎

1. Tesuji says:

For part e) {1,2} is an element of {{1},{2},{1,2}}. So it should be true.
And thanks too for your work.

2. Tesuji says:

For\: part\: \left ( d \right ), \: \left \{ 1,2\right\left\right \} is\: an\: element\: of\: \left \{\left \{1\left\right \},\left \{2\left\right \},\left \{1,2\left\right\}\left. \right \}. So\: it\: should\: be\: true.

• Tesuji says:

For part d) {1,2} is an element of {{1},{2},{1,2}}. So it should be true

• Tesuji says:

3. Anonymous says:

For part g, I think you accidentally wrote set C instead of set D starting halfway through the answer. Also, thanks for your work. Really well done.

• RoRi says:

Fixed now. Thanks for letting me know!

• The same aplies to part h.

• RoRi says:

Argh. Thanks! One day all of the typos and errors will get found and corrected…