Consider a set Note that every element in set A is also found in set B, however, the reverse is not true (B contains elements 4, 5 and 6 which are not in A)
Consider another case, Again, we can see that every element in set A is also found in set B and similarly, everything in B cannot be found in set A. B contains negative and odd integers, which are not in A.
To describe this phenomena, mathematicians defined subsets:
Suppose A and B are sets. If every element in A is an element of B, then A is a subset of B and we denote this as
If B is not a subset of A, as in the above cases, then there exists at least one element, say
e.g.1. but since
e.g.2.
e.g.3. since and Hint: look at what sets y is in
Every set is a subset of itself :
e.g.1.
e.g.2.
e.g.3.
Likewise, the empty set ( ) is a subset of every set (i.e. , where B is any set). To understand this, let’s look at the following case:
Set A = { 1, 2, …., 10} has the numbers 1 to 10 as elements. We can remove 10 from set A and the remaining set will be A = { 1, 2, …, 9}. Again, we can remove element 9 from the set and we’ll have A = {1, 2, …, 8}. We can continue doing this until we have set A = { 1 }. When we remove the last element, 1, from the set, we will be left with A = {}. This is the empty set.
Hence every element that contains at least one element (i.e. a nonempty set), can have all its elements removed until only the empty set is left. In this sense, we can think of the empty set as reaching the “simplest possible form” for the set.
If we start with the empty set, there is nothing to remove. So we are at “simplest form” for our set.
We can also imagine that we start with the empty set before we add elements into a set. Thus we say every set has a the empty set as a subset.
To determine the subsets of a set, we know two already: the empty set and the set itself. To determine the additional subsets, let’s look at some examples:
e.g.1. List the all the subsets of
Since C has three elements, namely 1, 2 and {0,3} then the subsets of C are:
So the additional subsets are made by taking each element and forming single subsets, then combining the elements with all possible combinations.
e.g.2 List the all the subsets of
D has three elements: Q, 2, and { }. So we know we can make single subsets out of each element, then we can match the elements in different combinations to make the other subsets:
Note: In both of the above examples, we had 3 elements in the sets C and D. This resulted in 8 subsets (i.e. )
e.g.3. List the all the subsets of
Since E has 1 element, , so the possible subsets are:
e.g.4.
Since set F has one element, the empty set, hence has subsets:
Note: Again, in the above examples, we had one element in sets E and F which resulted in 2 subsets: the empty set and the set containing the one element (i.e. )
We can see that there is a common method of determining how many subsets a finite set will have:
Look at the following examples to understand the difference between a subsets and the elements of a set:
e.g.1. For , we can conclude the following:
 Since 2 is an element of set G (2 is listed as the first element of set G)

Since set { 1 } is an element of G ({ 1 } is listed as the second element of set G)

Since set { 1 } is a subset of G

Since 2 is not a set, hence cannot be a subset

Since the empty set is a subset of every set

Since every finite set is a subset of itself

G has 4 subsets. We know we have 4 subsets, namely because
e.g.2. For , we can conclude the following:
 Since { } is an element of H (namely, the first element of set H)
 Since { } is the empty set and we know the empty set is the subset of every set. Furthermore, { } is explicitly a subset of H
 Since Every set is a subset of itself
 Since is an element of H (namely, the second element of set H)
 Since is not an element of H. However, is an element of which is still not in H.
 Since is not a subset of H, however
Lastly, note that is a set, not an element.
[…] Subsets […]
[…] 0.2 Subsets […]