Study guide
7.1 Sets, Subsets, Disjoint Sets, and Set Notation
CLEP College Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Structure, TI-30XS Calculator & Study Strategy
1.1 CLEP College Mathematics Overview, Exam Format & TI-30XS Calculator 1.2 Scoring, Diagnostic Assessment & Study Plan (ACE 50 Benchmark)
2 Chapter 2: Numbers and Number Theory
2.1 The Real Number System, Properties & Operations 2.2 Divisibility, Prime Factorization, Factors, and Multiples 2.3 Unit Conversion, Scientific Notation, Numerical Precision & Absolute Value
3 Chapter 3: Equations, Inequalities & Linear Systems
3.1 Linear Equations, Linear Inequalities & Absolute Value Equations 3.2 Systems of Linear Equations & Coordinate Graphing Methods
4 Chapter 4: Functions, Graphs & Growth Models
4.1 Function Notation, Domain, Range & Evaluation 4.2 Function Graphs, Transformations, Reflections & Symmetries 4.3 Linear vs. Exponential Growth, Logarithms & Applied Modeling
5 Chapter 5: Commercial Math & Interest Calculations
5.1 Percents, Percent Change, Markups, Discounts, Taxes & Profit/Loss 5.2 Simple Interest and Compound Interest 5.3 Continuous Compounding & Effective Annual Yield (APY vs. APR)
6 Chapter 6: Present/Future Value, Annuities & Loan Applications
6.1 Present Value and Future Value of Cash Flows and Ordinary Annuities 6.2 Loans, Mortgages, Credit Cards & Amortization Concepts
7 Chapter 7: Logic and Sets
7.1 Sets, Subsets, Disjoint Sets, and Set Notation 7.2 Set Operations (Union, Intersection, Complement) & Venn Diagrams 7.3 Logical Statements, Connectives, Conditionals & Truth Tables 7.4 Converses, Inverses, Contrapositives, Equivalence & Valid Arguments
8 Chapter 8: Data Analysis and Statistics
8.1 Data Visualizations: Tables, Bar/Line Graphs, Pie Charts & Histograms 8.2 Measures of Central Tendency: Mean, Median & Mode 8.3 Measures of Dispersion: Range, Quartiles, IQR & Boxplots 8.4 Standard Deviation & The Normal Distribution (Empirical Rule)
9 Chapter 9: Counting and Probability
9.1 Fundamental Counting Principle, Permutations & Combinations 9.2 Basic Probability, Sample Spaces, Complementary Events & Odds 9.3 Compound Probability: Addition Rule, Multiplication Rule & Conditional Probability 9.4 Expected Value and Applied Probabilistic Decision-Making
10 Chapter 10: Geometry and Measurement
10.1 Lines, Angles, Parallel and Perpendicular Line Relationships 10.2 Triangles, Similarity, Congruence & The Pythagorean Theorem 10.3 Quadrilaterals, Polygons, Perimeter & Area 10.4 Circles (Circumference, Area, Arcs, Sectors) & 3D Geometry
7.1 Sets, Subsets, Disjoint Sets, and Set Notation
Key Takeaways Explain This Topic AI
A set is a well-defined collection of distinct objects (elements); membership is denoted by x ∈ A x \in A x ∈ A and non-membership by x ∉ A x \notin A x ∈ / A .
Sets can be specified using Roster notation (explicitly listing elements inside braces) or Set-Builder notation ( { x ∣ P ( x ) } \{x \mid P(x)\} { x ∣ P ( x )} ), where element order and duplicates do not change the set.
The empty set ∅ = { } \emptyset = \{\} ∅ = { } contains zero elements ( ∣ ∅ ∣ = 0 |\emptyset| = 0 ∣∅∣ = 0 ) and is a subset of every set ( ∅ ⊆ A \emptyset \subseteq A ∅ ⊆ A ), whereas the singleton set { ∅ } \{\emptyset\} { ∅ } contains one element ( ∣ { ∅ } ∣ = 1 |\{\emptyset\}| = 1 ∣ { ∅ } ∣ = 1 ).
For any finite set with n n n elements, the total number of subsets is 2 n 2^n 2 n , the number of proper subsets is 2 n − 1 2^n - 1 2 n − 1 , and the number of non-empty proper subsets is 2 n − 2 2^n - 2 2 n − 2 .
Two sets A A A and B B B are disjoint if their intersection is empty ( A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ ), and two sets are equal ( A = B A = B A = B ) if and only if each is a subset of the other ( A ⊆ B A \subseteq B A ⊆ B and B ⊆ A B \subseteq A B ⊆ A ).
Last updated: August 2026
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
Unordered: The order in which elements are listed is irrelevant: { 1 , 2 , 3 } = { 3 , 1 , 2 } = { 2 , 3 , 1 } \{1, 2, 3\} = \{3, 1, 2\} = \{2, 3, 1\} { 1 , 2 , 3 } = { 3 , 1 , 2 } = { 2 , 3 , 1 } .
Distinct Elements (No Duplicates): Repeated listings do not create new elements: { a , b , b , c } = { a , b , c } \{a, b, b, c\} = \{a, b, c\} { a , b , b , c } = { a , b , c } .
Cardinality ( ∣ S ∣ |S| ∣ S ∣ or n ( S ) n(S) n ( S ) ): The number of distinct elements contained in a finite set S S S . For example, if S = { 2 , 4 , 6 , 8 , 10 } S = \{2, 4, 6, 8, 10\} S = { 2 , 4 , 6 , 8 , 10 } , then ∣ S ∣ = 5 |S| = 5 ∣ 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 } A = \{2, 3, 5, 7, 11, 13\} A = { 2 , 3 , 5 , 7 , 11 , 13 }
- Infinite set: B = { 0 , 3 , 6 , 9 , 12 , … } B = \{0, 3, 6, 9, 12, \dots\} B = { 0 , 3 , 6 , 9 , 12 , … }
- Set-Builder (Property) Notation
Elements are defined by stating a variable and a governing mathematical condition: { x ∣ P ( x ) } \{x \mid P(x)\} { x ∣ P ( x )} (read as "the set of all x x x such that property P ( x ) P(x) P ( x ) is true" ). The vertical bar " ∣ \mid ∣ " or colon ":" represents "such that."
Example: S = { x ∈ Z ∣ − 3 ≤ x < 4 } S = \{x \in \mathbb{Z} \mid -3 \le x < 4\} S = { x ∈ Z ∣ − 3 ≤ x < 4 }
Converting S S S to roster form: S = { − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 } S = \{-3, -2, -1, 0, 1, 2, 3\} S = { − 3 , − 2 , − 1 , 0 , 1 , 2 , 3 }
Standard Mathematical Number Sets
Symbol Name Formal Description Roster Representation
N \mathbb{N} N Natural Numbers Positive counting integers { 1 , 2 , 3 , 4 , 5 , … } \{1, 2, 3, 4, 5, \dots\} { 1 , 2 , 3 , 4 , 5 , … }
W \mathbb{W} W Whole Numbers Natural numbers including zero { 0 , 1 , 2 , 3 , 4 , … } \{0, 1, 2, 3, 4, \dots\} { 0 , 1 , 2 , 3 , 4 , … }
Z \mathbb{Z} Z Integers Positive, negative whole numbers and zero { … , − 2 , − 1 , 0 , 1 , 2 , … } \{\dots, -2, -1, 0, 1, 2, \dots\} { … , − 2 , − 1 , 0 , 1 , 2 , … }
Q \mathbb{Q} Q Rational Numbers Ratios of integers with non-zero denominator { p q ∣ p , q ∈ Z , q ≠ 0 } \{\frac{p}{q} \mid p, q \in \mathbb{Z}, q \neq 0\} { q p ∣ p , q ∈ Z , q = 0 }
I \mathbb{I} I Irrational Numbers Non-terminating, non-repeating decimals { 2 , π , e , 5 , … } \{\sqrt{2}, \pi, e, \sqrt{5}, \dots\} { 2 , π , e , 5 , … }
R \mathbb{R} R Real Numbers All rational and irrational numbers combined Q ∪ I = ( − ∞ , ∞ ) \mathbb{Q} \cup \mathbb{I} = (-\infty, \infty) Q ∪ I = ( − ∞ , ∞ ) +-----------------------------------------------------------------------------+
- | 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 U U )
The universal set U U U contains all possible elements under consideration in a particular mathematical context. All sets within that discussion are subsets of U U U .
The Empty Set (Null Set: ∅ \emptyset ∅ or { } \{\} { } )
The empty set is the unique set containing no elements. Its cardinality is strictly zero: ∣ ∅ ∣ = 0 |\emptyset| = 0 ∣∅∣ = 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 1 1 whose lone element is the empty set.
{ 0 } ≠ ∅ \{0\} \neq \emptyset { 0 } = ∅ because { 0 } \{0\} { 0 } is a singleton set containing the number zero ( ∣ { 0 } ∣ = 1 |\{0\}| = 1 ∣ { 0 } ∣ = 1 ).
The empty set is a subset of every set: ∅ ⊆ A \emptyset \subseteq A ∅ ⊆ A for every set A A 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 ⊆ B A \subseteq B A ⊆ B )
Set A A A is a subset of set B B B if every element belonging to A A A also belongs to B B B : A ⊆ B ⟺ ∀ x ( x ∈ A ⟹ x ∈ B ) A \subseteq B \iff \forall x (x \in A \implies x \in B) A ⊆ B ⟺ ∀ x ( x ∈ A ⟹ x ∈ B )
Every set is a subset of itself: A ⊆ A A \subseteq A A ⊆ A (Reflexive property).
The empty set is a subset of every set: ∅ ⊆ A \emptyset \subseteq A ∅ ⊆ A .
Proper Subset ( A ⊂ B A \subset B A ⊂ B or A ⊊ B A \subsetneq B A ⊊ B )
Set A A A is a proper subset of set B B B if A ⊆ B A \subseteq B A ⊆ B and A ≠ B A \neq B A = B . This requires that B B B contains at least one element not present in A A A : A ⊂ B ⟺ ( A ⊆ B ) ∧ ( ∃ y ∈ B such that y ∉ A ) A \subset B \iff (A \subseteq B) \land (\exists y \in B \text{ such that } y \notin A) A ⊂ B ⟺ ( A ⊆ B ) ∧ ( ∃ y ∈ B such that y ∈ / A )
No set is a proper subset of itself: A ⊄ A A \not\subset A A ⊂ A .
The empty set ∅ \emptyset ∅ is a proper subset of any non-empty set B B B ( ∣ B ∣ ≥ 1 |B| \ge 1 ∣ B ∣ ≥ 1 ).
Element ( ∈ \in ∈ ) vs. Subset ( ⊆ \subseteq ⊆ ) Distinction
Element Membership ( ∈ \in ∈ ): Connects an individual item to a set (e.g., 3 ∈ { 1 , 2 , 3 } 3 \in \{1, 2, 3\} 3 ∈ { 1 , 2 , 3 } is True; { 3 } ∈ { 1 , 2 , 3 } \{3\} \in \{1, 2, 3\} { 3 } ∈ { 1 , 2 , 3 } is False).
Subset Relation ( ⊆ \subseteq ⊆ ): Connects two sets (e.g., { 3 } ⊆ { 1 , 2 , 3 } \{3\} \subseteq \{1, 2, 3\} { 3 } ⊆ { 1 , 2 , 3 } is True; 3 ⊆ { 1 , 2 , 3 } 3 \subseteq \{1, 2, 3\} 3 ⊆ { 1 , 2 , 3 } is False).
5. Calculating the Number of Subsets
For any finite set S S S containing n n n distinct elements ( ∣ S ∣ = n |S| = n ∣ S ∣ = n ): Total Number of Subsets = 2 n \text{Total Number of Subsets} = 2^n Total Number of Subsets = 2 n Total Number of Proper Subsets = 2 n − 1 \text{Total Number of Proper Subsets} = 2^n - 1 Total Number of Proper Subsets = 2 n − 1 Total Number of Non-Empty Subsets = 2 n − 1 \text{Total Number of Non-Empty Subsets} = 2^n - 1 Total Number of Non-Empty Subsets = 2 n − 1 Total Number of Non-Empty Proper Subsets = 2 n − 2 \text{Total Number of Non-Empty Proper Subsets} = 2^n - 2 Total Number of Non-Empty Proper Subsets = 2 n − 2
Combinatorial Proof / Logic
Each of the n n n elements has two independent choices: it is either included in the subset or excluded from the subset. By the Fundamental Counting Principle: 2 × 2 × 2 × ⋯ × 2 ⏟ n times = 2 n \underbrace{2 \times 2 \times 2 \times \dots \times 2}_{n \text{ times}} = 2^n n times 2 × 2 × 2 × ⋯ × 2 = 2 n
Exhaustive Subset Listing for S = { a , b , c } S = \{a, b, c\} S = { a , b , c } ( n = 3 n = 3 n = 3 elements)
S S S has 2 3 = 8 2^3 = 8 2 3 = 8 total subsets:
- Cardinality 0 (1 subset): ∅ \emptyset ∅
- Cardinality 1 (3 subsets): { a } , { b } , { c } \{a\}, \{b\}, \{c\} { a } , { b } , { c }
Cardinality 2 (3 subsets): { a , b } , { a , c } , { b , c } \{a, b\}, \{a, c\}, \{b, c\} { a , b } , { a , c } , { b , c }
Cardinality 3 (1 subset): { a , b , c } \{a, b, c\} { a , b , c }
Proper subsets: All of the above except { a , b , c } \{a, b, c\} { a , b , c } ( 8 − 1 = 7 8 - 1 = 7 8 − 1 = 7 proper subsets).
- 6. Disjoint Sets and Set Equality
- Disjoint Sets (Mutually Exclusive Sets)
Two sets A A A and B B B are disjoint if they have no elements in common. Their intersection is the empty set: A and B are disjoint ⟺ A ∩ B = ∅ A \text{ and } B \text{ are disjoint} \iff A \cap B = \emptyset A and B are disjoint ⟺ A ∩ B = ∅
Example: E = { 2 , 4 , 6 , 8 } E = \{2, 4, 6, 8\} E = { 2 , 4 , 6 , 8 } (even positive integers) and O = { 1 , 3 , 5 , 7 } O = \{1, 3, 5, 7\} O = { 1 , 3 , 5 , 7 } (odd positive integers) are disjoint because E ∩ O = ∅ E \cap O = \emptyset E ∩ O = ∅ .
Set Equality ( A = B A = B A = B )
Two sets A A A and B B B are equal if and only if they contain precisely the same elements. Formally: A = B ⟺ A ⊆ B and B ⊆ A A = B \iff A \subseteq B \text{ and } B \subseteq A A = B ⟺ A ⊆ B and B ⊆ A
- 7. Worked Examples
- Worked Example 1: Set-Builder Conversion and Subset Counts
Problem: Let A = { x ∈ Z ∣ − 1 ≤ x < 4 } A = \{x \in \mathbb{Z} \mid -1 \le x < 4\} A = { x ∈ Z ∣ − 1 ≤ x < 4 } . Determine:
The roster notation for set A A A .
The cardinality ∣ A ∣ |A| ∣ A ∣ .
The total number of subsets of A A A .
The total number of proper subsets of A A A .
Solution:
Identify integers satisfying − 1 ≤ x < 4 -1 \le x < 4 − 1 ≤ x < 4 : x ∈ { − 1 , 0 , 1 , 2 , 3 } x \in \{-1, 0, 1, 2, 3\} x ∈ { − 1 , 0 , 1 , 2 , 3 } .
The cardinality is ∣ A ∣ = 5 |A| = 5 ∣ A ∣ = 5 .
Total subsets = 2 n = 2 5 = 32 = 2^n = 2^5 = 32 = 2 n = 2 5 = 32 .
Proper subsets = 2 n − 1 = 2 5 − 1 = 31 = 2^n - 1 = 2^5 - 1 = 31 = 2 n − 1 = 2 5 − 1 = 31 .
Worked Example 2: Evaluating Truth of Set Statements
Problem: Given set T = { 0 , { 1 , 2 } , 3 } T = \{0, \{1, 2\}, 3\} T = { 0 , { 1 , 2 } , 3 } , classify each statement as True or False:
- Statement A: 0 ∈ T 0 \in T 0 ∈ T
- Statement B: { 1 , 2 } ∈ T \{1, 2\} \in T { 1 , 2 } ∈ T
- Statement C: 1 ∈ T 1 \in T 1 ∈ T
- Statement D: { 0 , 3 } ⊆ T \{0, 3\} \subseteq T { 0 , 3 } ⊆ T
- Statement E: { { 1 , 2 } } ⊆ T \{\{1, 2\}\} \subseteq T {{ 1 , 2 }} ⊆ T
Solution:
Statement A: True. 0 0 0 is an explicit element of T T T .
Statement B: True. The set { 1 , 2 } \{1, 2\} { 1 , 2 } is listed directly as a single member inside T T T .
Statement C: False. 1 1 1 is an element of { 1 , 2 } \{1, 2\} { 1 , 2 } , but not a standalone element of T T T .
Statement D: True. Both 0 0 0 and 3 3 3 are elements of T T T , so { 0 , 3 } ⊆ T \{0, 3\} \subseteq T { 0 , 3 } ⊆ T .
Statement E: True. The singleton set containing { 1 , 2 } \{1, 2\} { 1 , 2 } is a subset of T T T because its element { 1 , 2 } ∈ T \{1, 2\} \in T { 1 , 2 } ∈ T .
8. Common CLEP Traps & Strategic Checkpoints
Trap 1: Confusing Natural Numbers with Whole Numbers: N = { 1 , 2 , 3 , … } \mathbb{N} = \{1, 2, 3, \dots\} N = { 1 , 2 , 3 , … } excludes zero, whereas W = { 0 , 1 , 2 , … } \mathbb{W} = \{0, 1, 2, \dots\} W = { 0 , 1 , 2 , … } includes zero. If a problem states x ∈ N x \in \mathbb{N} x ∈ 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 2^n 2 n subsets.
Trap 3: Subtracting 1 vs. Subtracting 2:
Proper subsets = 2 n − 1 = 2^n - 1 = 2 n − 1 (excludes the set itself).
Non-empty subsets = 2 n − 1 = 2^n - 1 = 2 n − 1 (excludes the empty set).
Non-empty proper subsets = 2 n − 2 = 2^n - 2 = 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 } \{1, 2\} { 1 , 2 } and { 3 , 4 } \{3, 4\} { 3 , 4 } are non-empty but disjoint).