Chapter 5 Sets

# 5.1 Basic Set Concepts

Learning Objectives

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

- Represent sets in a variety of ways
- Represent well-defined sets and the empty set with proper set notation
- Compute the cardinal value of a set
- Differentiate between finite and infinite sets
- Differentiate between equal and equivalent sets

# Sets and Ways to Represent Them

Think back to your kitchen organization. If the drawer is the set, then the forks and knives are elements in the set. Sets can be described in a number of different ways: by roster, by set-builder notation, by interval notation, by graphing on a number line, and by Venn diagrams. Sets are typically designated with capital letters. The simplest way to represent a set with only a few members is the **roster** (or *listing*) **method**, in which the elements in a set are listed, enclosed by curly braces and separated by commas. For example, For example, if [latex]F[/latex] represents our set of flatware, we can represent [latex]F[/latex] by using the following set notation with the roster method:

[latex]F=\{ \text{fork, spoon, knife, meat thermometer, can opener} \}[/latex]

Example 1

Write a set consisting of your three favorite snow cone flavors and label it with a capital [latex]S[/latex].

There are many possible answers depending on what your three favorite snow cone flavors are, but any answer must list three different flavors separated by commas, such as the following:

[latex]S=\{ \text{wild cherry, blue raspberry, green apple} \}[/latex]

Exercise 1

Write a set consisting of four cities in Louisiana and label it with a capital [latex]C[/latex].

**Solution**

possible solution: [latex]C=\{ \text{Lake Charles, New Orleans, Baton Rouge, Shreveport} \}[/latex]

All the sets we have considered so far have been well-defined sets. A well-defined set clearly communicates whether an element is a member of the set or not. The members of a well-defined set are fixed and do not change over time. Consider the following question. What are your top 10 songs of 2021? You could create a list of your top 10 favorite songs from 2021, but the list your friend creates will not necessarily contain the same 10 songs. So, the set of your top 10 songs of 2021 is not a well-defined set. On the other hand, the set of the letters in your name is a well-defined set because it does not vary (unless of course you change your name). The NFL wide receiver Chad Johnson famously changed his name to Chad Ochocinco to match his jersey number of 85.

Example 2

#### For each of the following collections, determine if it represents a well-defined set.

(a) The group of all past governors of Louisiana.

The group of all past governors of Louisiana is a well-defined set, because you can clearly identify if any individual was or was not a member of that group. For example, Britney Spears is not a member of this set, but Huey P. Long is a member of this set.

(b) A group of old cats.

A group of old cats is not a well-defined set because the word old is ambiguous. Some people might consider a seven-year-old cat to be old, while others might think a cat is not old until it is 13 years old. Because people can disagree on what is and what is not a member of this group, the set is not well-defined.

Exercise 2

On January 20, 2021, Kamala Harris was sworn in as the first woman vice president of the United States of America. If we were to consider the set of all women vice presidents of the United States of America prior to January 20, 2021, this set would be known as an empty set; the number of people in this set is 0, since there were no women vice presidents before Harris. The empty set, also called the null set, is written symbolically using a pair of braces, [latex]\{ \}[/latex], or a zero with a slash through it, [latex]\emptyset[/latex].

Note: The set containing the number 0, [latex]\{ 0 \}[/latex] is a set with one element in it. It is not the same as the empty set, [latex]\{ \}[/latex], which does not have any elements in it. Symbolically: [latex]\{ 0 \} \neq \{ \}[/latex].

Example 3

Represent each of the following sets symbolically.

a) The set of prime numbers less than 2.

A prime number is a natural number greater than 1 that is only divisible by one and itself. Since there are no prime numbers less than 2, this set is empty, and we can represent it symbolically as follows: [latex]\{ \}[/latex] or [latex]\emptyset[/latex]. These two different symbols for the empty set can be used interchangeably.

b) The set of types of penguins that naturally reside in Louisiana.

The set of types of penguins and the set of animals that reside in Louisiana do not intersect, so the set of penguins that also reside naturally in Louisiana is empty, and we can represent it symbolically as [latex]\{ \}[/latex] or [latex]\emptyset[/latex].

Exercise 3

Represent the set of all numbers divisible by 0 symbolically.

**Solution**

[latex]\{ \}[/latex] or [latex]\emptyset[/latex]

For larger sets that have a natural ordering, sometimes an ellipsis is used to indicate that the pattern continues. It is common practice to list the first three elements of a set to establish a pattern, write the ellipsis, and then provide the last element. Consider the set of all lowercase letters of the English alphabet, [latex]A[/latex].

This set can be written symbolically as [latex]A= \{ a, b, c, ..., z \}[/latex].

The sets we have been discussing so far are finite sets. They all have a limited or fixed number of elements. We also use an ellipsis for infinite sets, which have an unlimited number of elements, to indicate that the pattern continues. For example, in set theory, the set of natural numbers, which is the set of all positive counting numbers, is represented as [latex]\mathbb{N}= \{ 1, 2, 3, ... \}[/latex].

Notice that for this set, there is no element following the ellipsis. This is because there is no largest natural number; you can always add one more to get to the next natural number. Because the set of natural numbers grows without bound, it is an infinite set.

Example 4

Write the set of even natural numbers including and between 2 and 100, and label it with a capital [latex]E[/latex].

Include an ellipsis.

Write the label, [latex]E[/latex], followed by an equal sign and then a bracket.

[latex]E= \{[/latex]

Write the first three even numbers separated by commas, beginning with the number 2 to establish a pattern.

[latex]E= \{2, 4, 6[/latex]

Next, write the ellipsis followed by a comma and the last number in the list, 100.

[latex]E= \{2, 4, 6, ..., 100[/latex]

Finally, write the closing bracket to complete the set.

[latex]E= \{ 2, 4, 6, ... 100 \}[/latex]

Exercise 4

Our number system is made up of several different infinite sets of numbers. The set of integers, [latex]\mathbb{Z}[/latex], is another infinite set of numbers. It includes all the positive and negative counting numbers and the number zero. There is no largest or smallest integer.

Example 5

Write the set of integers using the roster method and label it with a [latex]\mathbb{Z}[/latex].

**Step 1:** As always, we write the label and then the opening bracket. Because the negative numbers are infinite, to represent that the pattern continues without bound to the left, we must use an ellipsis as the first element in our list.

**Step 2:** We place a comma and follow it with at least three consecutive integers separated by commas to establish a pattern.

**Step 3:** Add an ellipsis to the end of the list to show that the set of integers continues without bound to the right.

Complete the list with a closing bracket. The set of integers may be represented as follows: [latex]\mathbb{Z} = \{ ..., -2, -1, 0, 1, 2, ... \}[/latex].

Exercise 5

A shorthand way to write sets is with the use of set builder notation, which is a verbal description or formula for the set. For example, the set of all lowercase letters of the English alphabet, [latex]A[/latex], written in set builder notation is:

[latex]A= \{ x | x \text{ is a lowercase letter of the English alphabet.} \}[/latex]

This is read as “Set [latex]A[/latex] is the set of all elements [latex]x[/latex] such that [latex]x[/latex] is a lowercase letter of the English alphabet.”

Example 6

Using set builder notation, write the set [latex]K[/latex] of all types of king cake filling. Explain what the notation means.

The verbal description of the set is “Set [latex]K[/latex] is the set of all elements [latex]k[/latex] such that [latex]k[/latex] is a king cake filling.” This set can be written in set builder notation as follows: [latex]K= \{ k | k \text{ is a king cake filling.} \}[/latex]

Exercise 6

Example 7

The state fruit of Louisiana is a strawberry. Consider the set of letters in the word “strawberry.” Determine the best way to represent this set, and then write the set using either the roster method or set builder notation, whichever is more appropriate.

Because the letters in the word “strawberry” consist of a small finite set, the best way to represent this set is with the roster method. Choose a label to represent the set, such as [latex]S[/latex].

[latex]S = \{ s, t, r, a, w, b, e, y \}[/latex].

Notice that the letter “r” is only represented one time. This occurs because when representing members of a set, each unique element is only listed once no matter how many times it occurs. Duplicate elements are never repeated when representing members of a set.

Exercise 7

# Computing the Cardinal Value of a Set

Almost all the sets most people work with outside of pure mathematics are finite sets. For these sets, the cardinal value or cardinality of the set is the number of elements in the set. For finite set [latex]A[/latex], the cardinality is denoted symbolically as [latex]n(A)[/latex]. For example, a set that contains four elements has a cardinality of 4.

How do we measure the cardinality of infinite sets? The “smallest” infinite set is the set of natural numbers, or counting numbers, [latex]\mathbb{N} = \{ 1, 2, 3, ... \}[/latex]. This set has a cardinality of [latex]\aleph_0[/latex] (pronounced “aleph-null”). All sets that have the same cardinality as the set of natural numbers are countably infinite. This concept, as well as notation using aleph, was introduced by mathematician Georg Cantor, who once said, “A set is a Many that allows itself to be thought of as a One.”

Example 8

Write the cardinal value of each of the following sets in symbolic form.

(a) [latex]S = \{ \text{shrimp, crab, oysters, redfish, flounder} \}[/latex]

There are 5 distinct elements in set [latex]S[/latex]: shrimp, crab, oysters, redfish and flounder. Therefore, the cardinal value of set [latex]S[/latex] is 5 and written symbolically as [latex]n(S)=5[/latex].

(b) The empty set.

Because the empty set does not have any elements in it, the cardinality of the empty set is zero. Symbolically we write this as [latex]n(\emptyset)=0[/latex].

Exercise 8

Now that we have learned to represent finite and infinite sets using both the roster method and set builder notation, we should also be able to determine if a set is finite or infinite based on its verbal or symbolic description. One way to determine if a set is finite or not is to determine the cardinality of the set. If the cardinality of a set is a natural number, then the set is finite.

Example 9

Classify each of the following sets as infinite or finite.

a) [latex]E = \{2, 4, 6, 8, 10 \}[/latex]

[latex]n(E)=5[/latex]. Since 5 is a natural number, the set is finite.

b) [latex]A[/latex] is the set of lowercase letters of the English alphabet, [latex]A= \{a, b, c, ..., z \}[/latex]

[latex]n(A)=26[/latex]. Since 26 is a natural number, the set is finite.

c) [latex]\mathbb{Q} = \{ \frac{p}{q} | p \text{ and } q \text{ are integers and } q \neq 0 \}[/latex]

Set [latex]\mathbb{Q}[/latex] is the set of rational numbers or fractions. Because the set of integers is a subset of the set of rational numbers and the set of integers is infinite, the set of rational numbers is also infinite. There is no smallest or largest rational number.

Exercise 9

# Equal versus Equivalent Sets

When speaking or writing, we tend to use *equal* and *equivalent* interchangeably, but there is an important distinction between their meanings. Consider a new Ford Escape Hybrid and a new Toyota RAV4 Hybrid. Both cars are hybrid electric sport utility vehicles; in that sense, they are equivalent. They will both get you from place to place in a relatively fuel-efficient way. In this example we are comparing the single member set {Toyota RAV4 Hybrid} to the single member set {Ford Escape Hybrid}. Since these two sets have the same number of elements, they are also equivalent mathematically, meaning they have the same cardinality. But they are not equal, because the two cars have different looks and features and probably even handle differently. Each manufacturer will emphasize the features unique to their vehicle to persuade you to buy it; if the SUVs were truly equal, there would be no reason to choose one over the other.

Now consider two Honda CR-Vs that are made with exactly the same parts on the same assembly line within a few minutes of each other—these SUVs are equal. They are identical to each other, containing the same elements without regard to order, and the only differentiator when making a purchasing decision would be varied pricing at different dealerships. The set {Honda CR-V} is equal to the set {Honda CR-V}. Symbolically, we represent equal sets as [latex]A=B[/latex] and equivalent sets as [latex]A \sim B[/latex].

Now, let us consider a Toyota dealership that has 10 RAV4s on the lot, 8 Prii, 7 Highlanders, and 12 Camrys. There is a one-to-one relationship between the set of vehicles on the lot and the set consisting of the number of each type of vehicle on the lot. Therefore, these two sets are equivalent, but not equal. The set {RAV4, Prius, Highlander, Camry} is equivalent to the set {10, 8, 7, 12} because they have the same number of elements.

Note: If two sets are equal, they are also equivalent, because equal sets also have the same cardinality.

Example 10

Determine if the following pairs of sets are equal, equivalent, or neither.

a) [latex]E = \{ 2, 4, 6, 8, 10 \}[/latex] and [latex]F=\{ \text{fork, spoon, knife, meat thermometer, can opener} \}[/latex]

Sets [latex]E[/latex] and [latex]F[/latex] both have a cardinal value of 5, but the elements in these sets are different. So the two sets are equivalent, but they are not equal: [latex]E \sim F[/latex].

b) The empty set and the set of prime numbers less than 2.

The set of prime numbers consists of the set of counting numbers greater than one that can only be divided evenly by one and itself. The set of prime numbers less than 2 is an empty set, since there are no prime numbers less than 2. Therefore, these two sets are equal (and equivalent).

c) The set of vowels in the word *lagniappe* and the set of consonants in the word *lagniappe*.

The set of vowels in the word *lagniappe* is [latex]\{ a, i, e \}[/latex] and the set of consonants in the word *lagniappe* is [latex]\{ l, g, n, p \}[/latex]. The cardinal value of these two sets is [latex]n( \{ a, i, e \} )=3[/latex] and [latex]n( \{l, g, n, p \} )=4[/latex], respectively. Because the cardinality of the two sets differs, they are not equivalent. Further, their elements are not identical, so they are also not equal.

Exercise 10

Determine if the following pairs of sets are equal, equivalent, or neither.

a) Set [latex]B= \{b, a, k, e \}[/latex] and set [latex]A= \{a, b, e, k \}[/latex]

b) Set [latex]B= \{b, a, k, e \}[/latex] and set [latex]F= \{f, l, a, k, e \}[/latex]

c) Set [latex]B= \{b, a, k, e \}[/latex] and set [latex]C= \{c, a, k, e \}[/latex]

**Solution**

a) Set [latex]B[/latex] is equal to set [latex]A[/latex], [latex]B=A[/latex]

b) neither

c) Set [latex]B[/latex] is equivalent to set [latex]C[/latex], [latex]B \sim C[/latex]