Chapter 5 Sets

# 5.2 Subsets

Learning Objectives

By the end of this section, you will be able to:

- Represent subsets and proper subsets symbolically
- Compute the number of subsets of a set
- Apply concepts of subsets and equivalent sets to finite and infinite sets

The rules of Major League Soccer (MLS) allow each team to have up to 30 players on their team. However, only 18 of these players can be listed on the game day roster, and of the 18 listed, 11 players must be selected to start the game. How the coaches and general managers form the team and choose the starters for each game will determine the success of the team in any given year.

The entire group of 30 players is each team’s set. The group of game day players is a subset of the team set, and the group of 11 starters is a subset of both the team set and the set of players on the game day roster.

Set [latex]A[/latex] is a subset of set [latex]B[/latex] if every member of set [latex]A[/latex] is also a member of set [latex]B[/latex]. Symbolically, this relationship is written as [latex]A \subseteq B[/latex].

Sets can be related to each other in several different ways: they may not share any members in common, they may share some members in common, or they may share all members in common. In this section, we will explore the way we can select a group of members from the whole set.

Every subset is also a subset of itself, [latex]B \subseteq B[/latex].

Recall the set of flatware in our kitchen drawer from Section 5.1, [latex]F= \{ \text{fork, spoon, knife, meat thermometer, can opener} \}[/latex]. Suppose you are preparing to eat dinner, so you pull a fork and a knife from the drawer to set the table. The set [latex]D= \{ \text{knife, fork} \}[/latex]is a subset of set [latex]F[/latex] because every member or element of set [latex]D[/latex] is also a member of set [latex]F[/latex]. More specifically, set [latex]D[/latex] is a proper subset of set [latex]F[/latex], because there are other members of set [latex]F[/latex] not in set [latex]D[/latex]. This is written as [latex]D \subset F[/latex]. The only subset of a set that is not a proper subset of the set would be the set itself.

The empty set or null set, [latex]\emptyset[/latex], is a proper subset of every set except itself.

Graphically, sets are often represented as circles. In the following graphic, set [latex]A[/latex] is represented as a circle completely enclosed inside the circle representing set [latex]B[/latex], showing that set [latex]A[/latex] is a proper subset of set [latex]B[/latex]. The element [latex]x[/latex] represents an element that is in both set [latex]A[/latex] and set [latex]B[/latex].

Example 1

Set [latex]L[/latex] is a set of reading materials available in a shop at the airport, [latex]L = \{ \text{newspaper, magazine, book} \}[/latex]. List all the subsets of set [latex]L[/latex].

**Step 1:** It is best to begin with the set itself, as every set is a subset of itself. In our example, the cardinality of set [latex]L[/latex] is [latex]n(L)=3[/latex]. There is only one subset of set [latex]L[/latex] that has the same number of elements of set [latex]L: \{ \text{newspaper, magazine, book} \}[/latex].

**Step 2:** Next, list all the proper subsets of the set containing [latex]n(L)-1[/latex] elements. In this case, [latex]3-1=2[/latex]. There are three subsets that each contain two elements: [latex]\{ \text{newspaper, magazine} \}[/latex], [latex]\{ \text{newspaper, book} \}[/latex], and [latex]\{ \text{magazine, book} \}[/latex].

**Step 3:** Continue this process by listing all the proper subsets of the set containing [latex]n(L)-2[/latex] elements. In this case, [latex]3-2=1[/latex]. There are three subsets that contain one element: [latex]\{ \text{newspaper} \}[/latex], [latex]\{ \text{magazine} \}[/latex], and [latex]\{ \text{book} \}[/latex].

**Step 4:** Finally, list the subset containing 0 elements, or the empty set: [latex]\{ \}[/latex].

Exercise 1

Consider the set of possible outcomes when you flip a coin, [latex]S = \{ \text{heads, tails} \}[/latex]. List all the possible subsets of [latex]S[/latex].

**Solution**

[latex]\{ \text{heads, tails} \}[/latex]; [latex]\{ \text{heads} \}[/latex]; [latex]\{ \text{tails} \}[/latex]; and [latex]\emptyset[/latex]

Example 2

Consider the set of common political parties in the United States, [latex]P= \{ \text{Democratic, Green, Libertarian, Republican} \}[/latex]. Determine if the following sets are proper subsets of [latex]P[/latex].

a) [latex]M=\{ \text{Democratic, Republican} \}[/latex]

[latex]M[/latex] is a proper subset of [latex]P[/latex], written symbolically as [latex]M \subset P[/latex] because every member of [latex]M[/latex] is a member of set [latex]P[/latex], but [latex]P[/latex] also contains at least one element that is not in [latex]M[/latex].

b) [latex]G=\{ \text{Green} \}[/latex]

[latex]G[/latex] is a single member proper subset of [latex]P[/latex], written symbolically as [latex]G \subset P[/latex], because Green is a member of set [latex]P[/latex], but [latex]P[/latex] also contains other members (such as Democratic) that are not in [latex]G[/latex].

c) [latex]V=\{ \text{Republican, Libertarian, Green, Democratic} \}[/latex]

[latex]V[/latex] is a subset of [latex]P[/latex], because every member of [latex]V[/latex] is also a member of [latex]P[/latex], but it is not a proper subset of [latex]P[/latex] because there are no members of [latex]V[/latex] that are not also in set [latex]P[/latex]. We can represent the relationship symbolically as [latex]V \subseteq P[/latex], or more precisely, set [latex]V[/latex] is equal to set [latex]P[/latex], [latex]V=P[/latex].

Exercise 2

Consider the set of generation I legendary Pokémon, [latex]L= \{ \text{Articuno, Zapdos, Moltres, Mewtwo} \}[/latex]. Give an example of a proper subset containing:

a) one member.

b) three members.

c) no members.

**Solution**

a) A set could contain any one of the following: [latex]\{ \text{Articuno} \}[/latex], [latex]\{ \text{Zapdos} \}[/latex], [latex]\{ \text{Moltres} \}[/latex], or [latex]\{ \text{Mewtwo} \}[/latex].

b) Any of the following combinations of three members would work: [latex]\{ \text{Articuno, Zapdos, Mewtwo} \}[/latex], [latex]\{ \text{Articuno, Moltres, Mewtwo} \}[/latex], or [latex]\{ \text{Zapdos, Moltres, Mewtwo} \}[/latex].

c) The empty set represented as [latex]\{ \}[/latex] or [latex]\emptyset[/latex].

Example 3

Consider the subsets of a standard deck of cards:

[latex]S=\{ \text{spades, hearts, diamonds, clubs} \}[/latex]; [latex]R= \{ \text{hearts, diamonds} \}[/latex]; [latex]B= \{ \text{spades, clubs} \}[/latex]; [latex]C=\{ \text{clubs} \}[/latex].

Express the relationship between the following sets symbolically.

(a) Set [latex]S[/latex] and set [latex]B[/latex].

[latex]B \subset S[/latex]. [latex]B[/latex] is a proper subset of [latex]S[/latex].

(b) Set [latex]C[/latex] and set [latex]B[/latex].

[latex]C \subset B[/latex]. [latex]C[/latex] is a proper subset of [latex]B[/latex].

(c) Set [latex]R[/latex] and set [latex]R[/latex].

[latex]R \subseteq R[/latex] or [latex]R=R[/latex]. [latex]R[/latex] is a subset itself but not a proper subset of itself because [latex]R[/latex] is equal to itself.

Exercise 3

# Exponential Notation

So far, we have figured out how many subsets exist in a finite set by listing them. Recall that in Example 1, when we listed all the subsets of the three-element set [latex]L = \{ \text{newspaper, magazine, book} \}[/latex], we saw that there are eight subsets. In Exercise 1, we discovered that there are four subsets of the two-element subset, [latex]S = \{ \text{heads, tails} \}[/latex]. A one-element set has two subsets, the empty set and itself. The only subset of the empty set is the empty set itself. But how can we easily figure out the number of subsets in a very large finite set? It turns out that the number of subsets can be found by raising 2 to the number of elements in the set, using exponential notation to represent repeated multiplication. For example, the number of subsets of the set [latex]L = \{ \text{newspaper, magazine, book} \}[/latex] is equal to [latex]2^{3}=2 \cdot 2 \cdot 2=8[/latex]. Exponential notation is used to represent repeated multiplication, [latex]b^{n}=b \cdot b \cdot b \cdot ... \cdot b[/latex], where [latex]b[/latex] appears as a factor [latex]n[/latex] times.

## Formulas

The number of subsets of a finite set [latex]A[/latex] is equal to 2 raised to the power of [latex]n(A)[/latex], where [latex]n(A)[/latex] is the number of elements in set [latex]A[/latex].

[latex]\text{Number of Subsets of Set } A=2^{n(A)}[/latex]

The number of proper subsets of a finite set [latex]A[/latex] is equal to 2 raised to the power of [latex]n(A)[/latex] minus 1, where [latex]n(A)[/latex] is the number of elements in set [latex]A[/latex].

[latex]\text{Number of Proper Subsets of Set } A=2^{n(A)}-1[/latex]

Note that [latex]2^{0}=1[/latex], so this formula works for the empty set also.

Example 4

Find the number of subsets of each of the following sets.

a) The set of top five scorers of all time on the New Orleans Saints football team: [latex]S= \{ \text{Morten Anderson, Will Lutz, John Carney, }[/latex]

[latex]\text{Doug Brien, Alvin Kamara} \}[/latex]

[latex]n(S)=5[/latex]. So the total number of subsets of [latex]S[/latex] is [latex]2^{5}=2 \cdot 2 \cdot 2 \cdot 2 \cdot 2=32[/latex].

b) The set of the four musicians from Louisiana: [latex]A= \{ \text{Fats Domino, Tim McGraw, Harry Connick, Jr., }[/latex]

[latex]\text{Lil Wayne} \}[/latex]

[latex]n(A)=4[/latex]. So the total number of subsets of [latex]A[/latex] is [latex]2^{4}=16[/latex].

c) [latex]R= \{ \text{onion, bell pepper, celery} \}[/latex]

[latex]n(R)=3[/latex]. So the total number of subsets of [latex]R[/latex] is [latex]2^{3}=8[/latex].

Exercise 4

# Equivalent Subsets

In the early seventeenth century, the famous astronomer Galileo Galilei found that the set of natural numbers and the subset of the natural numbers consisting of the set of square numbers, [latex]n^{2}[/latex], are equivalent. Upon making this discovery, he conjectured that the concepts of less than, greater than, and equal to did not apply to infinite sets.

Sequences and series are defined as infinite subsets of the set of natural numbers by forming a relationship between the sequence or series in terms of a natural number, [latex]n[/latex]. For example, the set of even numbers can be defined using set builder notation as [latex]\{a | a=2n \text{ where } n \text{ is a natural number} \}[/latex]. The formula in this case replaces every natural number with two times the number, resulting in the set of even numbers, [latex]\{2, 4, 6,... \}[/latex]. The set of even numbers is also equivalent to the set of natural numbers.

Example 5

Using natural numbers, multiples of 3 are given by the sequence [latex]\{3, 6, 9, ... \}[/latex]. Write this set using set builder notation by expressing each multiple of 3 using a formula in terms of a natural number, [latex]n[/latex].

[latex]\{ m | m=3n \text{ where } n \text{ is a natural number} \}[/latex] or [latex]\{ m | m=3n \text{ where } n \in \mathbb{N} \}[/latex]. In this example, [latex]m[/latex] is a multiple of 3 and [latex]n[/latex] is a natural number. The symbol [latex]\in[/latex] is read as “is a member or element of.” Because there is a one-to-one correspondence between the set of multiples of 3 and the natural numbers, the set of multiples of 3 is an equivalent subset of the natural numbers.

Exercise 5

Using natural numbers, multiples of 5 are given by the sequence [latex]\{5, 10, 15, ... \}[/latex]. Write this set using set builder notation by associating each multiple of 5 in terms of a natural number, [latex]n[/latex].

**Solution**

[latex]\{m | m=5n \text{ where } n \in \mathbb{N} \}[/latex]

Example 6

A fast-food restaurant offers a deal where you can select two options from the following set of four menu items for $6: a chicken sandwich, a fish sandwich, a bowl of gumbo, or 10 chicken nuggets. Javier and his friend Michael are each purchasing lunch using this deal. Create two equivalent, but not equal, subsets that Javier and Michael could choose to have for lunch.

The possible two-element subsets are [latex]\{ \text{chicken sandwich, fish sandwich} \}[/latex], [latex]\{\text{chicken sandwich, gumbo} \}[/latex], [latex]\{\text{chicken sandwich, chicken nuggets}\}[/latex], [latex]\{\text{fish sandwich, gumbo}\}[/latex], [latex]\{\text{fish sandwich, chicken nuggets}\}[/latex], and [latex]\{\text{gumbo, chicken nuggets}\}[/latex]. One possible solution is that Javier picked the set [latex]\{\text{chicken sandwich, chicken nuggets}\}[/latex], while Michael chose the [latex]\{\text{gumbo, chicken nuggets}\}[/latex]. Because Javier and Michael both picked two items, but not exactly the same two items, these sets are equivalent but not equal.

Exercise 6

Serena and Venus Williams walk into the same restaurant as Javier and Michael, but they order the same pair of items, resulting in equal sets of choices. If Venus ordered a fish sandwich and a bowl of gumbo, what did Serena order?

**Solution**

Serena also ordered a fish sandwich and gumbo because for the two sets to be equal, they must contain the exact same items: [latex]\{\text{fish sandwich, gumbo}\} = \{\text{fish sandwich, gumbo}\}[/latex]

Example 7

A high school volleyball team at a small school consists of the following players: [latex]\{\text{Angie, Brenda, Colleen, Estella, Maya, Maria, Penny, Shantelle}\}[/latex]. Create two possible equivalent starting line-ups of six players that the coach could select for the next game.

There are actually 28 possible ways that the coach could choose his starting line-up. Two such equivalent subsets are [latex]\{\text{Angie, Brenda, Maya, Maria, Penny, Shantelle}\}[/latex] and [latex]\{\text{Angie, Brenda, Colleen, Estella, Maria, Shantelle}\}[/latex]. Each subset has six members, but they are not identical, so the two sets are equivalent but not equal.

Exercise 7

Consider the same group of volleyball players from above: [latex]\{\text{Angie, Brenda, Colleen, Estella, Maya, Maria, Penny, Shantelle}\}[/latex]. The team needs to select a captain and an assistant captain from their members. List two possible equivalent subsets that they could select.

**Solution**

There are multiple possible solutions. Each set must contain two players, but both players cannot be the same, otherwise the two sets would be equal, not equivalent. For example, [latex]\{\text{Maria, Shantelle}\}[/latex] and [latex]\{\text{Angie, Maria}\}[/latex].

### Media Attributions

- 5.2 01 © OpenStax Contemporary Math is licensed under a CC BY (Attribution) license