Understand the definition and types of sets including subsets and power sets.
Concept of Set
A set is a well-defined collection of distinct objects, called elements or members. Sets are fundamental in mathematics and provide the basis for many algebraic concepts.
Basic Definitions
Set and Elements: If an object \(x\) belongs to a set \(A\), we write \(x \in A\). If not, \(x \notin A\).
Notation: Sets are usually denoted by capital letters like \(A, B, C\), and elements are listed inside curly braces. For example, \(A = {1, 2, 3}\).
Roster Method: Listing all elements explicitly, e.g., \(B = {a, e, i, o, u}\).
Set-builder Notation: Describes elements by a property, e.g., \(C = {x : x \text{ is an even number}, 1 \leq x \leq 10}\).
Types of Sets
Empty (Null) Set: The set with no elements, denoted by \(\emptyset\) or \({}\). For example, the set of integers between 1 and 2 is \(\emptyset\).
Finite and Infinite Sets: A set with countable elements is finite, e.g., \(D = {1, 2, 3}\). Infinite sets have uncountable elements, e.g., the set of all integers \(\mathbb{Z}\).
Singleton Set: A set with exactly one element, e.g., \({5}\).
Equal Sets: Two sets \(A\) and \(B\) are equal if they have exactly the same elements, regardless of order or repetition. For example, \({1, 5, 9} = {9, 5, 1}\).
Equivalent Sets: Two sets are equivalent if they have the same number of elements, even if the elements differ. For example, \({1, 3, 5}\) and \({2, 4, 7}\) are equivalent sets.
Set Operations
Union (\(A \cup B\)): The set of elements in \(A\) or \(B\) or both.
Intersection (\(A \cap B\)): The set of elements common to both \(A\) and \(B\).
Difference (\(A - B\)): The set of elements in \(A\) but not in \(B\).
Complement (\(A'\)): Elements not in \(A\) but in the universal set \(U\).
Symmetric Difference (\(A \oplus B\)): Elements in \(A\) or \(B\) but not in both.
Relations Between Sets
Subset (\(A \subseteq B\)): Every element of \(A\) is also in \(B\).
Proper Subset (\(A \subset B\)): \(A\) is a subset of \(B\), but \(A \neq B\).
Superset (\(B \supseteq A\)): \(B\) contains every element of \(A\).
Power Set (\(\mathcal{P}(A)\)): The set of all subsets of \(A\), including \(\emptyset\) and \(A\) itself. If \(A\) has \(n\) elements, then \(\mathcal{P}(A)\) has \(2^n\) elements.
Cardinality and Applications
The cardinality of a set \(A\), denoted by \(n(A)\), is the number of elements in \(A\).
If \(A\) and \(B\) are finite sets, then the cardinality of their union is given by the formula: \[ n(A \cup B) = n(A) + n(B) - n(A \cap B) \]
The maximum number of elements in the symmetric difference \(A \oplus B\) is \(n(A) + n(B)\) when \(A\) and \(B\) are disjoint.
The Cartesian product \(A \times B\) is the set of ordered pairs \((a, b)\) where \(a \in A\) and \(b \in B\). The cardinality is \(n(A) \times n(B)\).
Important Properties
The null set \(\emptyset\) is a subset of every set.
Every set is a subset of itself.
If \(A \subseteq B\), then \(A \cup B = B\) and \(A \cap B = A\).
The power set of a set with \(n\) elements has \(2^n\) elements.
Common Mistakes to Avoid
Confusing equal sets with equivalent sets: Equal sets have the same elements; equivalent sets have the same number of elements.
Assuming the null set is an element of every set — it is a subset, not necessarily an element.
Misapplying formulas for union and intersection cardinalities.
Forgetting that repetition of elements does not change the set.
Connection to Board Exams
Questions on sets often test understanding of subsets, power sets, and cardinalities. Problems may ask to verify statements about sets, find the number of subsets, or compute intersections and unions. Clear knowledge of definitions and properties is essential to score well.
Worked Examples
Example 1: Verify the statements about the null set and power set
Problem: Consider the statements: 1. The null set is a subset of every set. 2. Every set is a subset of itself. 3. If a set has 10 elements, then its power set will have 1024 elements. Which are correct?
Solution: 1. The null set \(\emptyset\) has no elements, so it is trivially a subset of every set. True. 2. Every set contains all its elements, so it is a subset of itself. True. 3. The power set of a set with \(n\) elements has \(2^n\) elements. For \(n=10\), \(2^{10} = 1024\). True.
Answer: All three statements are correct.
Example 2: Are the sets equal or equivalent?
Problem: Given \(A = {1, 3, 5}\) and \(B = {2, 4, 7}\), and \(A = {1, 5, 9}\), \(B = {1, 5, 5, 9, 9}\), determine which statements are correct: 1. \(A\) and \(B\) are equivalent sets. 2. \(A\) and \(B\) are equal sets.
Solution: - For the first pair, \(A\) and \(B\) both have 3 elements, so they are equivalent but not equal. - For the second pair, \(B\) contains repeated elements, but sets ignore repetition. So \(B = {1, 5, 9}\) which is equal to \(A\). Thus, statement 1 is true for the first pair, and statement 2 is true for the second pair.
Answer: Both statements are correct.
Example 3: Find \(n(A \cap B)\) given \(n(A) = 37\), \(n(B) = 25\), and \(n(A \cup B) = 50\)
Solution: Using the formula: \[ n(A \cup B) = n(A) + n(B) - n(A \cap B) \] Substitute values: \[ 50 = 37 + 25 - n(A \cap B) \] \[ n(A \cap B) = 37 + 25 - 50 = 12 \]
Answer: \(n(A \cap B) = 12\)
Example 4: Maximum value of \(n(A \cap B)\) if \(n(A) = 4\) and \(n(B) = 3\)
Solution: The intersection cannot have more elements than the smaller set. So, maximum \(n(A \cap B) = \min(4, 3) = 3\).
Solution: First find \(A \cup B\): \[ A \cup B = {1, 2, 3, 4, 6, 8} \] The complement relative to \(U\) is: \[ (A \cup B)' = U - (A \cup B) = {5, 7, 9} \]
Answer: \((A \cup B)' = {5, 7, 9}\)
Example 6: Find \((A \times B) \cap (B \times A)\) where \(A = {1, 2, 5, 6}\) and \(B = {1, 2, 3}\)
Solution: The Cartesian products are: \[ A \times B = {(1,1), (1,2), (1,3), (2,1), (2,2), (2,3), (5,1), (5,2), (5,3), (6,1), (6,2), (6,3)} \] \[ B \times A = {(1,1), (1,2), (1,5), (1,6), (2,1), (2,2), (2,5), (2,6), (3,1), (3,2), (3,5), (3,6)} \] The intersection contains ordered pairs common to both: \[ (A \times B) \cap (B \times A) = {(1,1), (2,2)} \]
Answer: \({(1,1), (2,2)}\)
Formula Bank
Subset: \(A \subseteq B \iff \forall x (x \in A \Rightarrow x \in B)\)
Power set cardinality: If \(n(A) = n\), then \(n(\mathcal{P}(A)) = 2^n\)
Union cardinality: \(n(A \cup B) = n(A) + n(B) - n(A \cap B)\)
Complement: \(A' = U - A\), where \(U\) is the universal set
Symmetric difference: \(A \oplus B = (A - B) \cup (B - A)\)
Cartesian product cardinality: \(n(A \times B) = n(A) \times n(B)\)
Maximum intersection: \(n(A \cap B) \leq \min(n(A), n(B))\)
Curated videos per subtopic
Top YouTube explainers, AI-ranked for your exam and language. Unlocks with subscription.
