7.1 Sets, Subsets, Disjoint Sets, and Set Notation

7.1 Sets, Subsets, Disjoint Sets, and Set Notation

Logic and Sets constitutes approximately 15% of the CLEP College Mathematics examination (~9 questions). Set theory provides the foundational mathematical language for organizing data, analyzing probability sample spaces, defining function domains, and evaluating deductive arguments. Mastering set definitions, element membership, subset calculations, and notation distinctions delivers immediate point gains on exam day.

---

1. Set Definitions and Element Membership

A set is a well-defined collection of distinct objects, referred to as elements or members of the set. "Well-defined" means there is an unambiguous criterion that determines whether any given object belongs to the collection.

+-----------------------------------------------------------------------------+
|                      SET MEMBERSHIP NOTATION CONVENTIONS                    |
|                                                                             |
|   Symbol      Meaning                  Example                              |
|   ------      -------                  -------                              |
|     in        "is an element of"       5 in {1, 3, 5, 7}  (True)            |
|    notin      "is not an element of"   4 notin {1, 3, 5, 7}  (True)         |
|      |        Cardinality (size)       |{1, 3, 5, 7}| = 4                   |
+-----------------------------------------------------------------------------+

Core Properties of Sets

1. Unordered: The order in which elements are listed is irrelevant: ${1, 2, 3} = {3, 1, 2} = {2, 3, 1}$.
2. Distinct Elements (No Duplicates): Repeated listings do not create new elements: ${a, b, b, c} = {a, b, c}$.
3. Cardinality ($|S|$ or $n(S)$): The number of distinct elements contained in a finite set $S$. For example, if $S = {2, 4, 6, 8, 10}$, then $|S| = 5$.

---

2. Methods of Defining Sets: Roster vs. Set-Builder Notation

There are two primary methods for specifying sets on the CLEP exam:

Roster (Tabular / List) Notation

Elements are listed explicitly inside curly braces, separated by commas. An ellipsis ($\dots$) indicates an established pattern continuing indefinitely.

• Finite set: $A = {2, 3, 5, 7, 11, 13}$
• Infinite set: $B = {0, 3, 6, 9, 12, \dots}$

Set-Builder (Property) Notation

Elements are defined by stating a variable and a governing mathematical condition: ${x \mid P(x)}$ (read as "the set of all $x$ such that property $P(x)$ is true"). The vertical bar "$\mid$" or colon ":" represents "such that."

• Example: $S = {x \in \mathbb{Z} \mid -3 \le x < 4}$
• Converting $S$ to roster form: $S = {-3, -2, -1, 0, 1, 2, 3}$

Standard Mathematical Number Sets

+-----------------------------------------------------------------------------+
|                     NESTED HIERARCHY OF NUMBER SYSTEMS                      |
|                                                                             |
|   [ REAL NUMBERS (R) ]                                                      |
|   +---------------------------------------------------+-----------------+   |
|   | RATIONAL NUMBERS (Q)                              | IRRATIONALS (I) |   |
|   |   +-------------------------------------------+   |  sqrt(2), pi    |   |
|   |   | INTEGERS (Z)                              |   |  e, sqrt(7)     |   |
|   |   |   +-----------------------------------+   |   |                 |   |
|   |   |   | WHOLE NUMBERS (W)                 |   |   |                 |   |
|   |   |   |   +---------------------------+   |   |   |                 |   |
|   |   |   |   | NATURAL NUMBERS (N)       |   |   |   |                 |   |
|   |   |   |   |   {1, 2, 3, 4, ...}       |   |   |   |                 |   |
|   |   |   |   +---------------------------+   |   |   |                 |   |
|   |   |   |   | 0                         |   |   |   |                 |   |
|   |   |   +-----------------------------------+   |   |                 |   |
|   |   |   | -1, -2, -3, ...                   |   |   |                 |   |
|   |   +-------------------------------------------+   |                 |   |
|   |   | 1/2, -3/4, 0.333..., 2.75                     |                 |   |
|   +---------------------------------------------------+-----------------+   |
+-----------------------------------------------------------------------------+

---

3. The Universal Set and the Empty Set

The Universal Set ($U$)

The universal set $U$ contains all possible elements under consideration in a particular mathematical context. All sets within that discussion are subsets of $U$.

The Empty Set (Null Set: $\emptyset$ or ${}$)

The empty set is the unique set containing no elements. Its cardinality is strictly zero: $|\emptyset| = 0$.

[!CAUTION] Critical CLEP Traps Regarding the Empty Set:

• $\emptyset = {}$ (Both symbols denote the empty set).
• ${\emptyset} \neq \emptyset$ because ${\emptyset}$ is a singleton set of cardinality $1$ whose lone element is the empty set.
• ${0} \neq \emptyset$ because ${0}$ is a singleton set containing the number zero ($|{0}| = 1$).
• The empty set is a subset of every set: $\emptyset \subseteq A$ for every set $A$.

---

4. Subsets vs. Proper Subsets

Understanding the distinction between subsets ($\subseteq$) and proper subsets ($\subset$) is essential for the exam.

+-----------------------------------------------------------------------------+
|                         SUBSET DEFINITIONS AT A GLANCE                      |
|                                                                             |
|   Relation            Notation          Formal Condition                    |
|   --------            --------          ----------------                    |
|   Subset              A subset-eq B     Every element in A is also in B     |
|   Proper Subset       A subset B        A subset-eq B AND A != B            |
|   Set Equality        A = B             A subset-eq B AND B subset-eq A     |
+-----------------------------------------------------------------------------+

Subset ($A \subseteq B$)

Set $A$ is a subset of set $B$ if every element belonging to $A$ also belongs to $B$: $A \subseteq B \iff \forall x (x \in A \implies x \in B)$

• Every set is a subset of itself: $A \subseteq A$ (Reflexive property).
• The empty set is a subset of every set: $\emptyset \subseteq A$.

Proper Subset ($A \subset B$ or $A \subsetneq B$)

Set $A$ is a proper subset of set $B$ if $A \subseteq B$ and $A \neq B$. This requires that $B$ contains at least one element not present in $A$: $A \subset B \iff (A \subseteq B) \land (\exists y \in B \text{ such that } y \notin A)$

• No set is a proper subset of itself: $A \not\subset A$.
• The empty set $\emptyset$ is a proper subset of any non-empty set $B$ ($|B| \ge 1$).

Element ($\in$) vs. Subset ($\subseteq$) Distinction

• Element Membership ($\in$): Connects an individual item to a set (e.g., $3 \in {1, 2, 3}$ is True; ${3} \in {1, 2, 3}$ is False).
• Subset Relation ($\subseteq$): Connects two sets (e.g., ${3} \subseteq {1, 2, 3}$ is True; $3 \subseteq {1, 2, 3}$ is False).

---

5. Calculating the Number of Subsets

For any finite set $S$ containing $n$ distinct elements ($|S| = n$):

$\text{Total Number of Subsets} = 2^n$ $\text{Total Number of Proper Subsets} = 2^n - 1$ $\text{Total Number of Non-Empty Subsets} = 2^n - 1$ $\text{Total Number of Non-Empty Proper Subsets} = 2^n - 2$

Combinatorial Proof / Logic

Each of the $n$ elements has two independent choices: it is either included in the subset or excluded from the subset. By the Fundamental Counting Principle: $\underbrace{2 \times 2 \times 2 \times \dots \times 2}_{n \text{ times}} = 2^n$

Exhaustive Subset Listing for $S = {a, b, c}$ ($n = 3$ elements)

$S$ has $2^3 = 8$ total subsets:

1. Cardinality 0 (1 subset): $\emptyset$
2. Cardinality 1 (3 subsets): ${a}, {b}, {c}$
3. Cardinality 2 (3 subsets): ${a, b}, {a, c}, {b, c}$
4. Cardinality 3 (1 subset): ${a, b, c}$

• Proper subsets: All of the above except ${a, b, c}$ ($8 - 1 = 7$ proper subsets).

---

6. Disjoint Sets and Set Equality

Disjoint Sets (Mutually Exclusive Sets)

Two sets $A$ and $B$ are disjoint if they have no elements in common. Their intersection is the empty set: $A \text{ and } B \text{ are disjoint} \iff A \cap B = \emptyset$

• Example: $E = {2, 4, 6, 8}$ (even positive integers) and $O = {1, 3, 5, 7}$ (odd positive integers) are disjoint because $E \cap O = \emptyset$.

Set Equality ($A = B$)

Two sets $A$ and $B$ are equal if and only if they contain precisely the same elements. Formally: $A = B \iff A \subseteq B \text{ and } B \subseteq A$

---

7. Worked Examples

Worked Example 1: Set-Builder Conversion and Subset Counts

Problem: Let $A = {x \in \mathbb{Z} \mid -1 \le x < 4}$. Determine:

1. The roster notation for set $A$.
2. The cardinality $|A|$.
3. The total number of subsets of $A$.
4. The total number of proper subsets of $A$.

Solution:

1. Identify integers satisfying $-1 \le x < 4$: $x \in {-1, 0, 1, 2, 3}$.
2. The cardinality is $|A| = 5$.
3. Total subsets $= 2^n = 2^5 = 32$.
4. Proper subsets $= 2^n - 1 = 2^5 - 1 = 31$.

Worked Example 2: Evaluating Truth of Set Statements

Problem: Given set $T = {0, {1, 2}, 3}$, classify each statement as True or False:

• Statement A: $0 \in T$
• Statement B: ${1, 2} \in T$
• Statement C: $1 \in T$
• Statement D: ${0, 3} \subseteq T$
• Statement E: ${{1, 2}} \subseteq T$

Solution:

• Statement A: True. $0$ is an explicit element of $T$.
• Statement B: True. The set ${1, 2}$ is listed directly as a single member inside $T$.
• Statement C: False. $1$ is an element of ${1, 2}$, but not a standalone element of $T$.
• Statement D: True. Both $0$ and $3$ are elements of $T$, so ${0, 3} \subseteq T$.
• Statement E: True. The singleton set containing ${1, 2}$ is a subset of $T$ because its element ${1, 2} \in T$.

---

8. Common CLEP Traps & Strategic Checkpoints

• Trap 1: Confusing Natural Numbers with Whole Numbers: $\mathbb{N} = {1, 2, 3, \dots}$ excludes zero, whereas $\mathbb{W} = {0, 1, 2, \dots}$ includes zero. If a problem states $x \in \mathbb{N}$, zero is NOT a valid value.
• Trap 2: Forgetting the Empty Set in Subset Counts: When listing subsets, students frequently omit $\emptyset$. Remember that $\emptyset$ is always 1 of the $2^n$ subsets.
• Trap 3: Subtracting 1 vs. Subtracting 2:
  • Proper subsets $= 2^n - 1$ (excludes the set itself).
  • Non-empty subsets $= 2^n - 1$ (excludes the empty set).
  • Non-empty proper subsets $= 2^n - 2$ (excludes both the set itself and the empty set).
• Trap 4: Disjoint Sets vs. Empty Sets: Disjoint sets are not empty; they simply share no common elements (e.g., ${1, 2}$ and ${3, 4}$ are non-empty but disjoint).