"

Sets and subsets

Sets and subsets

Now that we know what sets are, how they are represented, and which sets are the same, we can talk about another important relationship between them. That is, one set being the subset of another set. If we have a set, say SS, and a set, say QQ, then SS is a subset of QQ if every member of SS is also a member of QQ. So for example, if S={a,b,c}S=\{a, b,c\} and Q={a,b,c,d}Q=\{a, b, c, d\}, then SS is a subset of QQ.

Definition 3.2 (Subset). If SS and QQ are sets, and every member of SS is also a member of QQ, then SS is a subset of QQ (QQ is a superset of SS). In such cases, we write SQS \subseteq Q (or QSQ \supseteq S).

One thing that is important to note with the subset relation is that it does not exclude the possibility that two sets are the same. Indeed, there is a general fact concerning this matter. Namely, if SS and QQ are sets, and SQS \subseteq Q and QSQ \subseteq S, then S=QS=Q. In other words, if SS is a subset of QQ, and QQ is a subset of SS, then SS and QQ are identical.

Exercise 3.3. Explain why it is the case that if SS and QQ are sets, and SQS \subseteq Q and QSQ \subseteq S, then S=QS=Q.

Now if we wanted to specify explicitly that one set is a subset and not equal to another set, we can use the symbol \subset, which stands for ‘proper subset’. Proper subsets are just like subsets, except they come with the additional caveat that the two sets are not the same. In other words, SQS \subset Q is just a short way to say that SQS \subseteq Q and SQS \neq Q (it is not the case that S=QS = Q).

One thing that usually trips up people new to set theory (and sometimes, even those who aren’t) is differentiating between \in and \subseteq, that is, differentiating between one set being a member of another set, and one set being a subset of another set. It’s important to make sure you can distinguish between the two!

Exercise 3.4. Determine whether the following expressions are true or false. In each case, explain your reasoning.

  1. if S={1,7,3}S=\{1, 7, 3\} and Q={1,3}Q=\{1, 3\}, then QSQ \subseteq S;

  2. if S={1,7,3}S=\{1, 7, 3\} and Q={7,1,3}Q=\{7, 1, 3\}, then SQS \subseteq Q and QSQ \subseteq S;

  3. if S={a,b}S=\{a, b\}, and Q={{a,b}}Q=\{\{a, b\}\}, then SQS \in Q;

  4. if S={a,b}S=\{a, b\}, and Q={{a,b}}Q=\{\{a, b\}\}, then S=QS = Q;

  5. if S={a,b,{a,b,c}}S=\{a, b, \{a, b, c\}\}, and Q={a,b,c}Q=\{a, b, c\}, then QSQ \subseteq S;

  6. if S={h,f,{g,{f}}}S=\{h, f, \{g,\{f\}\}\} and Q={g,{f}}Q=\{g, \{f\}\}, then QSQ \subseteq S.

  7. if S={a,d,h}S=\{a, d, h\}, then SSS \subseteq S;

  8. if S={d,b,c}S=\{d, b, c\}, then SSS \subset S.

Finally, we must mention the case of \emptyset. Though it may sound a bit strange at first, \emptyset is a subset of every set, including itself! Why? Because all its members are members of every other set. Why? Because it has none! Thus, in general, for every set SS, S\emptyset \subseteq S. On the other hand, it is not the case that every set has \emptyset as its member. Some sets may, some sets may not. So for example, if we take S={{}}S=\{\{\emptyset\}\}, \emptyset is not a member of SS, but S\emptyset \subseteq S. Moreover, Q={}Q=\{\emptyset\} is a member of SS, and Q\emptyset \subseteq Q and Q\emptyset \in Q.

License

Icon for the Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License

Learning Logic Backwards Copyright © by Peter Susanszky is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License, except where otherwise noted.