Home · Lessons · Mathematics

Mathematics

Sets

This lesson covers set definitions, notation, membership, empty and universal sets, subsets, cardinality, number types, and basic set operations.

In this lesson
  1. Basic Definitions and Concepts
  2. Basic Laws and Formulas
  3. Detailed Solved Examples
  4. Illustrative SVG Diagrams
  5. Comparison Tables
  6. CSCA Tips and Common Mistakes
  7. Additional Exercises with Solutions

Basic Definitions and Concepts

A set is a collection of well-defined objects called elements (Elements). Sets are denoted by capital letters (A, B, C...) and their elements are written inside curly braces { }.

Basic concepts

Types of number sets

SymbolNameDescription
\(\mathbb{N}\)Natural numbers\(\{1, 2, 3, \ldots\}\)
\(\mathbb{Z}\)Integers\(\{\ldots, -2, -1, 0, 1, 2, \ldots\}\)
\(\mathbb{Q}\)Rational numbers\(\left\{\frac{a}{b} \mid a, b \in \mathbb{Z}, b \neq 0\right\}\)
\(\mathbb{R}\)Real numbers\(\{x \mid x \text{ real number}\}\)

Reasoning and justification

Membership is denoted by \(\in\) because it is derived from the Latin "est" meaning "is", while \(\notin\) denies membership. The empty set \(\emptyset\) is so denoted because it contains no elements, and writing \(\{\}\) illustrates this visually. The universal set U depends on context; for instance, in the arithmetic of natural numbers U may be \(\mathbb{N}\), and in real numbers U may be \(\mathbb{R}\). The subset relation \(A \subseteq B\) means that A does not exceed B in content, and if the two sets are equal we write \(A = B\). The number of elements \(|A|\) is counted by the number of distinct elements only; repetitions are not counted.

Step-by-step solved examples

  1. Suppose \(A = \{1, 2, 3, 4, 5\}\) and \(B = \{3, 4, 5, 6, 7\}\). Determine whether \(2 \in A\), whether \(6 \in B\), and whether \(A \subseteq B\).
    Solution:
    Step 1: We check the membership of 2 in A. Since 2 appears in the list \(\{1, 2, 3, 4, 5\}\), we write \(2 \in A\).
    Step 2: We check the membership of 6 in B. Since 6 appears in \(\{3, 4, 5, 6, 7\}\), we write \(6 \in B\).
    Step 3: We check whether every element of A is in B. The element 1 is not in B, so the condition fails. Hence \(A \not\subseteq B\).
    Answer: \(2 \in A\), \(6 \in B\), and \(A \not\subseteq B\).
  2. Given that \(U = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}\) and \(A = {2, 4, 6, 8, 10}\) and \(B = {1, 3, 5, 7, 9}\). Find \(|A|\) and \(|B|\) and verify whether \(A \cap B = \emptyset\).
    Solution:
    Step 1: The number of elements of A is the number of elements in \({2, 4, 6, 8, 10}\), which is 5, so \(|A| = 5\).
    Step 2: The number of elements of B is the number of elements in \({1, 3, 5, 7, 9}\), which is 5, so \(|B| = 5\).
    Step 3: The intersection \(A \cap B\) is the set of elements common to A and B. There is no common number between the even and odd numbers in this range, so \(A \cap B = {}\), i.e., \(\emptyset\).
    Answer: \(|A| = 5\), \(|B| = 5\), and \(A \cap B = \emptyset\).

Common Errors

Test Tips

Basic Laws and Formulas

Basic Set Operations

OperationSymbolDefinition
UnionA ∪ B{x | x ∈ A or x ∈ B}
IntersectionA ∩ B{x | x ∈ A and x ∈ B}
DifferenceA − B{x | x ∈ A and x ∉ B}
ComplementA'{x | x ∈ U and x ∉ A}
Cartesian productA × B{(a,b) | a∈A, b∈B}

Important set laws

LawFormula
CommutationA ∪ B = B ∪ A
De Morgan's laws(A ∪ B)' = A' ∩ B'
(A ∩ B)' = A' ∪ B'
DistributionA ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
Counting principle (two sets)|A ∪ B| = |A| + |B| − |A ∩ B|
Counting principle (three sets)|A∪B∪C| = |A|+|B|+|C| − |A∩B|−|A∩C|−|B∩C| + |A∩B∩C|

Justification and reason for each rule

The union is defined to collect all elements belonging to either of the two sets without repetition, because an element present in both sets is counted only once in the resulting set.

The intersection is defined to select only the elements common to both sets, because an element must belong to both sets simultaneously to be considered part of the intersection.

The reason for defining the difference is that it removes from the first set all elements that belong to the second set, while retaining only those elements that belong exclusively to the first set, because the operation is non-commutative and depends on the order.

The reason for defining the complement is that it relies on a universal set U containing all possible elements in the context; the complement consists of everything in U that is not in A, ensuring that A together with its complement yields U.

The reason for defining the Cartesian product is that it forms all ordered pairs whose first element comes from A and second from B; it is fundamental for defining relations and functions between sets.

Step-by-step solved examples

  1. Let A = {1, 2, 3} and B = {3, 4, 5}. Compute A ∪ B.
    • Step 1: List all elements of A: 1, 2, 3.
    • Step 2: List all elements of B: 3, 4, 5.
    • Step 3: Combine the lists and remove duplicates: the element 3 appears in both sets, so it is written only once.
    • Step 4: The result is {1, 2, 3, 4, 5}.
  2. Let U = {1, 2, 3, 4, 5, 6} and A = {2, 4, 6}. Compute A'.
    • Step 1: List all elements of U: 1, 2, 3, 4, 5, 6.
    • Step 2: List all elements of A: 2, 4, 6.
    • Step 3: Remove the elements of A from U: 1, 3, 5 remain.
    • Step 4: The result is {1, 3, 5}.

Common Errors

Test Tips

  1. Draw a Venn diagram to illustrate the relationships among sets when solving problems involving union, intersection, or difference.
  2. Ensure the universal set U is clearly defined before computing the complement, as it is essential for correctness.
  3. Recall that the Cartesian product is non-commutative, so A × B ≠ B × A in general, unless A = B.

Detailed Solved Examples

Example 1: Basic Set Operations

In set theory, the basic operations on sets are defined as union, intersection, difference, and complement. These operations are used to describe the relationships between sets within a specified universal set.

If \( U = \{1,2,3,4,5,6,7,8,9\} \) is the universal set, and \( A = \{1,2,3,4,5\} \), \( B = \{4,5,6,7\} \), then we want to compute each of the following:

Solution:

  1. We compute \( A \cup B \): we collect all elements from \( A \) and \( B \) without repetition: \( \{1,2,3,4,5\} \cup \{4,5,6,7\} = \{1,2,3,4,5,6,7\} \).
  2. We compute \( A \cap B \): we take only the common elements: \( \{1,2,3,4,5\} \cap \{4,5,6,7\} = \{4,5\} \).
  3. We compute \( A - B \): we take what is in \( A \) but not in \( B \): \( \{1,2,3,4,5\} - \{4,5,6,7\} = \{1,2,3\} \).
  4. We compute \( A' \): we take what is in \( U \) but not in \( A \): \( \{1,2,3,4,5,6,7,8,9\} - \{1,2,3,4,5\} = \{6,7,8,9\} \).

Therefore:

Common Errors:

Test Tips:


Example 2: The Counting Principle (Word Problem)

The addition and subtraction principles in counting are used to calculate the number of elements in the union of two sets when there is overlap between them. This principle is known as the inclusion–exclusion principle for two sets, and it states that the number of elements in the union equals the sum of the numbers of elements in each set minus the number of elements in the intersection, to avoid double-counting the common elements.

In a school with \( 100 \) students, \( 60 \) study English, \( 50 \) study French, and \( 30 \) study both languages. We want to find the number of students who study neither language.

Solution:

  1. We denote the number of students who study English by \( |E| = 60 \).
  2. We denote the number of students who study French by \( |F| = 50 \).
  3. We denote the number of students who study both languages by \( |E \cap F| = 30 \).
  4. We calculate the number of students who study at least one language using the inclusion–exclusion principle: \( |E \cup F| = |E| + |F| - |E \cap F| = 60 + 50 - 30 = 80 \).
  5. We calculate the number of students who study no language by subtracting the number who study at least one language from the total number of students: \( 100 - |E \cup F| = 100 - 80 = 20 \).

Therefore, the number of students who study neither English nor French is \( 20 \) students.

Common Errors:

Test tips:


Example 3: De Morgan's Laws

De Morgan's laws in set theory relate the operations of complement, union, and intersection. The laws state that the complement of the union of two sets equals the intersection of their complements, and the complement of the intersection of two sets equals the union of their complements. These laws are fundamental in simplifying logical and set expressions, and are widely used in proofs and problem solving.

If \( A = \{1,2,3,4\} \), \( B = \{3,4,5,6\} \), and \( U = \{1,2,3,4,5,6,7\} \), then we want to verify the first De Morgan's law: \( (A \cup B)' = A' \cap B' \).

Solution:

  1. We compute \( A \cup B \): we collect all elements from \( A \) and \( B \) without repetition: \( {1,2,3,4} \cup {3,4,5,6} = {1,2,3,4,5,6} \).
  2. We compute the complement of \( A \cup B \) with respect to \( U \): \( (A \cup B)' = U - (A \cup B) = {1,2,3,4,5,6,7} - {1,2,3,4,5,6} = {7} \).
  3. We compute the complement of \( A \): \( A' = U - A = {1,2,3,4,5,6,7} - {1,2,3,4} = {5,6,7} \).
  4. We compute the complement of \( B \): \( B' = U - B = {1,2,3,4,5,6,7} - {3,4,5,6} = {1,2,7} \).
  5. We compute the intersection of \( A' \) and \( B' \): \( A' \cap B' = {5,6,7} \cap {1,2,7} = {7} \).
  6. We observe that \( (A \cup B)' = {7} \) and \( A' \cap B' = {7} \); therefore \( (A \cup B)' = A' \cap B' \) holds.

Thus, the first De Morgan's law is verified in this case.

Common mistakes:

Test tips:


Example 4: Cartesian product

The Cartesian product of two sets \( A \) and \( B \), denoted by \( A \times B \), is the set of all ordered pairs \( (a,b) \) where \( a \in A \) and \( b \in B \). The Cartesian product is used to represent relations between sets and is the basis for defining functions and coordinates in the plane. The number of elements in \( A \times B \) equals the product of the number of elements in \( A \) and the number of elements in \( B \), provided the sets are finite.

If \( A = {a,b} \) and \( B = {1,2,3} \), then we want to compute \( A \times B \) and its cardinality \( |A \times B| \).

Solution:

  1. We determine the elements of \( A \): \( a \) and \( b \).
  2. We determine the elements of \( B \): \( 1 \), \( 2 \), \( 3 \).
  3. We form all ordered pairs by taking each element of \( A \) and pairing it with each element of \( B \): - For \( a \): \( (a,1) \), \( (a,2) \), \( (a,3) \). - For \( b \): \( (b,1) \), \( (b,2) \), \( (b,3) \).
  4. We collect all the pairs: \( A \times B = \{(a,1), (a,2), (a,3), (b,1), (b,2), (b,3)\} \).
  5. We compute the number of elements in \( A \times B \): Since \( |A| = 2 \) and \( |B| = 3 \), we have \( |A \times B| = |A| \times |B| = 2 \times 3 = 6 \).

Therefore, \( A \times B = \{(a,1), (a,2), (a,3), (b,1), (b,2), (b,3)\} \) and \( |A \times B| = 6 \).

Common errors:

Test tips:


Example 5: Three-set problem

The inclusion–exclusion principle for three sets is used to find the number of elements in the union of three sets when there are pairwise and triple overlaps. The general formula is: \( |A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C| \). We subtract the pairwise intersections because they were counted twice in the individual sum, then add back the triple intersection because it was subtracted one time too many after removing the pairwise intersections.

In a survey of \( 50 \) people: \( 30 \) like chocolate (denoted by \( C \)), \( 25 \) like vanilla (\( V \)), \( 20 \) like strawberry (\( S \)), \( 12 \) like both chocolate and vanilla (\( C \cap V \)), \( 10 \) like both chocolate and strawberry (\( C \cap S \)), \( 8 \) like both vanilla and strawberry (\( V \cap S \)), and \( 5 \) like all three (\( C \cap V \cap S \)). We want to find the number of people who do not like any of these three flavors.

Solution:

  1. We identify the known values: \( |C| = 30 \), \( |V| = 25 \), \( |S| = 20 \), \( |C \cap V| = 12 \), \( |C \cap S| = 10 \), \( |V \cap S| = 8 \), \( |C \cap V \cap S| = 5 \).
  2. We calculate the number of people who like at least one flavor using the inclusion–exclusion principle for three sets: \( |C \cup V \cup S| = |C| + |V| + |S| - |C \cap V| - |C \cap S| - |V \cap S| + |C \cap V \cap S| \). Substitute the values: \( = 30 + 25 + 20 - 12 - 10 - 8 + 5 \). We compute stepwise: \( 30 + 25 = 55 \), \( 55 + 20 = 75 \), \( 75 - 12 = 63 \), \( 63 - 10 = 53 \), \( 53 - 8 = 45 \), \( 45 + 5 = 50 \). Therefore, \( |C \cup V \cup S| = 50 \).
  3. We calculate the number of people who do not like any flavor by subtracting the number who like at least one flavor from the total number of people surveyed: \( 50 - |C \cup V \cup S| = 50 - 50 = 0 \).

Therefore, the number of people who like neither chocolate, nor vanilla, nor strawberry is \( 0 \); that is, all respondents like at least one of the three flavors.

Common Errors:

Test tips:


Illustrative SVG Diagrams

Figure 1: Venn diagram of sets

The diagram shows two sets A and B that partially intersect. The common region represents the intersection A ∩ B, which consists of the elements belonging to both sets simultaneously. The region covered by either circle represents the union A ∪ B, which consists of the elements belonging to A or B or both. This relationship is fundamental in set theory and is used to calculate the number of elements in overlapping sets.

Reason: The visual diagram helps understand the relationships between sets without the need for manual counting, especially when the sets are large or not precisely defined.

Example 1: If A = {1, 2, 3, 4} and B = {3, 4, 5, 6}, then A ∩ B = {3, 4} and A ∪ B = {1, 2, 3, 4, 5, 6}. Solution: Step by step: First identify the common elements: 3 and 4 are present in both A and B → intersection = {3, 4}. Then collect all elements from A and B without repetition: from A: 1, 2, 3, 4; from B: 3, 4, 5, 6 → after removing duplicates: 1, 2, 3, 4, 5, 6 → union = {1, 2, 3, 4, 5, 6}.

Example 2: If A = {even numbers from 1 to 10} = {2, 4, 6, 8, 10} and B = {multiples of 3 from 1 to 10} = {3, 6, 9}, then A ∩ B = {6} and A ∪ B = {2, 3, 4, 6, 8, 9, 10}. Solution: Step by step: Find the numbers that are both even and multiples of 3: only 6 satisfies the condition → intersection = {6}. For the union: collect all elements from A and B: {2, 4, 6, 8, 10} ∪ {3, 6, 9} = {2, 3, 4, 6, 8, 9, 10} after removing the duplicate occurrence of 6.

Common errors:

Test tips: Be sure to mentally draw a Venn diagram when reading questions, and start by identifying the common elements before computing the union or intersection. Use the crossing-out method to avoid double counting in the union.


Figure 2: Representing sets on the number line

The figure illustrates the interval [-2, 3] on the number line, which includes all real numbers x such that -2 ≤ x ≤ 3. The closed circles at -2 and 3 indicate that the endpoints are included in the interval (a closed interval). This representation is essential for understanding inequalities and the domains of functions in mathematics.

Reason: The number line provides a clear visual representation of intervals, making it easier to determine whether a number belongs to a given interval, especially when dealing with absolute value or quadratic inequalities.

Example 1: Determine whether the number 0 belongs to the interval [-2, 3]. Solution: Step by step: We check the condition -2 ≤ 0 ≤ 3. Since -2 ≤ 0 is true and 0 ≤ 3 is true, the entire condition holds → the number 0 belongs to the interval.

Example 2: Does the number -2.5 belong to the interval [-2, 3]? Solution: Step by step: We check -2 ≤ -2.5 ≤ 3. Since -2.5 < -2, the first condition -2 ≤ -2.5 is false → the number -2.5 does not belong to the interval.

Common Errors:

Test Tips: When you see an interval of the form [a, b], remember that a is the lower bound and b is the upper bound, and both are included. Always verify the inequality from both ends: a ≤ x ≤ b.


Figure 3: The Difference A − B

The figure illustrates the difference A − B, which is the set of elements that belong to A but do not belong to B. In the diagram, the light blue region that does not overlap with the red circle represents this difference. This concept is essential for understanding exclusion in sets, and is used in probability and logic.

Reason: The difference A − B is not symmetric (i.e., A − B ≠ B − A in general), and understanding it helps avoid confusion between set operations, especially in questions involving conditions such as "in A but not in B".

Example 1: If A = {1, 2, 3, 4, 5} and B = {3, 4, 5, 6, 7}, then A − B = {1, 2}. Solution: Step by step: take each element of A and check whether it is not in B: 1 is not in B → accepted; 2 is not in B → accepted; 3 is in B → rejected; 4 is in B → rejected; 5 is in B → rejected. Hence A − B = {1, 2}.

Example 2: If A = {prime numbers less than 10} = {2, 3, 5, 7} and B = {odd numbers less than 10} = {1, 3, 5, 7, 9}, then A − B = {2}. Solution: Step by step: check each element in A: 2 is not odd → not in B → accepted; 3 is odd → in B → rejected; 5 is odd → in B → rejected; 7 is odd → in B → rejected. Hence A − B = {2}.

Common Errors:

Test Tips: When reading the phrase "in A but not in B", translate it directly into A − B. Do not reverse the operation, and always start from the first set mentioned (A) and check for exclusion of the second (B).


Figure 4: Cartesian product A × B

The diagram illustrates the Cartesian product A × B where A = {1, 2} and B = {x, y}. The Cartesian product is the set of all ordered pairs (a, b) such that a ∈ A and b ∈ B. In the diagram, the points on the grid represent these pairs: (1,x), (1,y), (2,x), (2,y). This concept is fundamental in defining relations and functions, and is used in probability and analytic geometry.

Reason: The Cartesian product determines the sample space for two independent experiments, and forms the basis for understanding coordinates in the plane, where the horizontal axis represents elements of A and the vertical axis represents elements of B.

Example 1: If A = {1, 2} and B = {x, y}, then A × B = {(1,x), (1,y), (2,x), (2,y)}. Solution: Step by step: take the first element of A, which is 1, and pair it with every element of B: (1,x) and (1,y). Then take the second element of A, which is 2, and pair it with every element of B: (2,x) and (2,y). Collect all pairs: {(1,x), (1,y), (2,x), (2,y)}.

Example 2: If A = {p, q} and B = {3, 4}, then A × B = {(p,3), (p,4), (q,3), (q,4)}. Solution: Step by step: take the first element of A, which is p, and pair it with every element of B: (p,3) and (p,4). Then take the second element of A, which is q, and pair it with every element of B: (q,3) and (q,4). Result: {(p,3), (p,4), (q,3), (q,4)}.

Common Errors:

Test tips: when computing A × B, start with the first element of A and pair it with all elements of B before moving to the next element of A. Ensure that the number of pairs equals |A| × |B|, where |A| and |B| are the numbers of elements in each set.

Comparison Tables

Comparison: Union vs Intersection

PropertyUnion (∪)Intersection (∩)
DefinitionElements in A or BElements in both A and B
Size of resultGreater than or equal to each setLess than or equal to each set
If A ⊆ BA ∪ B = BA ∩ B = A

Comparison: ∈ vs ⊆

Property∈ (belongs to)⊆ (subset)
MeaningElement in a setSet inside another set
Left-hand sideElement (lowercase letter)Set (uppercase letter)
Correct examplea ∈ {a,b,c}{a,b} ⊆ {a,b,c}

Explanation and details:

The union of two sets A and B is denoted by A ∪ B, and it is the set of all elements that belong to A or to B or to both. The mathematical definition is: \(A \cup B = {x \mid x \in A \lor x \in B}\). The reason for this definition is that the union collects all elements without repetition, so it does not matter from which set the element comes; it is enough that it exists in at least one of them.

Step-by-step solved example: Let A = {1,2,3} and B = {3,4,5}. We compute A ∪ B as follows:

  1. We take all elements of A: {1,2,3}
  2. We add the elements of B that are not yet in A: 4 and 5 (since 3 is already present)
  3. Result: {1,2,3,4,5}

Another example: Let A = {a,b} and B = {b,c}. Then A ∪ B = {a,b,c} because we collect a from A, b from both sets (written once), and c from B.

The intersection of A and B is denoted by A ∩ B, and it is the set of elements that belong to both A and B simultaneously. The mathematical definition is: \(A \cap B = \{x \mid x \in A \land x \in B\}\). The reason for this definition is that the intersection selects only the common elements, i.e., those that exist in both sets together, and excludes what is unique to only one of them.

Step-by-step solved example: Let A = {1,2,3} and B = {3,4,5}. We compute A ∩ B as follows:

  1. We check each element in A: is it in B?
  2. 1: not in B → ignore it
  3. 2: not in B → ignore it
  4. 3: present in B → add it to the result
  5. Result: {3}

Another example: Let A = {x, y, z} and B = {y, z, w}. Then A ∩ B = {y, z} because only these two elements belong to both sets.

If A is a subset of B, i.e., A ⊆ B, then every element of A is also in B. Therefore:

Worked example, step by step: Let A = {2, 4} and B = {1, 2, 3, 4, 5}. Since every element of A is in B, we have A ⊆ B.

  1. We compute A ∪ B: we combine {2, 4} with {1, 2, 3, 4, 5} → the result is {1, 2, 3, 4, 5} = B.
  2. We compute A ∩ B: we take the common elements: 2 and 4 are in B → the result is {2, 4} = A.

Another example: Let A = {p, q} and B = {p, q, r, s}. Then A ∪ B = {p, q, r, s} = B and A ∩ B = {p, q} = A.

The symbol ∈ means "belongs to" and is used to indicate whether an element is a member of a set. The left-hand side must be an element (usually a lowercase letter such as a, b, x), and the right-hand side a set (such as {a, b, c}). The reason for this convention is that ∈ is a relation between an element and a set, not between two sets.

Worked example, step by step: We verify whether 5 ∈ {1, 3, 5, 7}.

  1. We examine the left-hand element: 5 (which is an element).
  2. We examine the right-hand set: {1, 3, 5, 7}.
  3. We verify: Is 5 in the set? Yes, because it is one of the listed elements.
  4. Conclusion: The statement is true.

Another example: We check the truth of z ∈ {x, y, z}. The element z is in the set → the statement is true.

The symbol ⊆ means "subset of" and is used to determine whether every element of one set is contained in another set. The left-hand side must be a set (e.g., {a, b}), and the right-hand side must be another set (e.g., {a, b, c}). The reason for this requirement is that ⊆ is a relation between two sets, not between an element and a set.

Step-by-step solved example: We check the truth of {2, 4} ⊆ {1, 2, 3, 4, 5}.

  1. We take each element of the left-hand set: 2 and 4.
  2. We check whether 2 is in the right-hand set: Yes.
  3. We check whether 4 is in the right-hand set: Yes.
  4. Since all elements are present, the relation is true.

Another example: We check the truth of {a, b} ⊆ {a, b, c}. The element a is present, and b is present → the relation is true.

List of common errors:

Test tips:

CSCA Tips and Common Mistakes

In counting problems and set theory, it is essential to follow organized steps to ensure accuracy and avoid common mistakes. Below is a detailed explanation of the fundamental rules with step-by-step solved examples, a list of common errors and their corrections, and tips tailored for the CSCA exam.

Rule 1: Draw a Venn diagram for three sets

When solving counting problems involving three sets (A, B, C), always start by filling the triple intersection region (A∩B∩C) first, then proceed to the pairwise intersections (A∩B, A∩C, B∩C) while subtracting what has already been counted in the triple intersection, and finally fill the individual regions (A only, B only, C only). This ensures no double-counting or undercounting.

Reason: A Venn diagram visually represents the relationships among sets, and starting from the deepest intersection guarantees that each element is counted exactly once, in accordance with the inclusion–exclusion principle.

Example 1: In a group of 100 students, 40 study mathematics (A), 35 study physics (B), and 30 study chemistry (C). 15 study mathematics and physics (A∩B), 10 study mathematics and chemistry (A∩C), 8 study physics and chemistry (B∩C), and 5 study all three subjects (A∩B∩C). Find the number of students who study at least one subject.

Solution: Step by step

  1. Start with the triple intersection: |A∩B∩C| = 5
  2. Compute the net pairwise intersections (by subtracting the triple intersection):
    • |A∩B| net = 15 − 5 = 10
    • |A∩C| net = 10 − 5 = 5
    • Net |B∩C| = 8 − 5 = 3
  3. Calculate the individual regions (by subtracting what was counted in the intersections):
    • |A only| = 40 − (10 + 5 + 5) = 40 − 20 = 20
    • |B only| = 35 − (10 + 3 + 5) = 35 − 18 = 17
    • |C only| = 30 − (5 + 3 + 5) = 30 − 13 = 17
  4. Sum all regions:
    • Total = |A only| + |B only| + |C only| + net |A∩B| + net |A∩C| + net |B∩C| + |A∩B∩C|
    • = 20 + 17 + 17 + 10 + 5 + 3 + 5 = 77

Therefore, the number of students studying at least one subject is 77.

Rule 2: Number of subsets of a set with n elements

For a set containing n distinct elements, the number of all subsets (including the empty set and the set itself) equals 2ⁿ. This follows from the fact that each element has two choices: either it is included in the subset or it is not.

Reason:For each of the n elements, there are two independent possibilities (inclusion or exclusion), so the number of combinations is 2 × 2 × ... × 2 (n times) = 2ⁿ.

Example 2:Find the number of subsets of the set {a, b, c, d}.

Solution: Step by step

  1. Determine the number of elements: n = 4
  2. Apply the formula: number of subsets = 2ⁿ = 2⁴
  3. Calculate: 2⁴ = 2 × 2 × 2 × 2 = 16

Therefore, the number of subsets is 16.

This can be verified by listing: ∅, {a}, {b}, {c}, {d}, {a,b}, {a,c}, {a,d}, {b,c}, {b,d}, {c,d}, {a,b,c}, {a,b,d}, {a,c,d}, {b,c,d}, {a,b,c,d} — exactly 16 subsets.

Rule 3: Distinguish between ∈ and ⊆

The symbol ∈ is used to indicate whether an element belongs to a set, while ⊆ is used to indicate whether a set is a subset of another set (i.e., all its elements are contained in the larger set).

Reason:Confusing an element with a set leads to serious logical errors in proofs and calculations, especially in multiple-choice questions on the CSCA exam.

Example 3:Let the set A = {1, 2, {3, 4}}. Determine the truth of the following statements:

Solution: Step by step

  1. 2 ∈ A? Yes, because 2 is a direct element of A.
  2. {3, 4} ∈ A? Yes, because {3, 4} is a direct element of A (the set {3, 4} exists as an element).
  3. {3, 4} ⊆ A? No, because the elements 3 and 4 are not in A directly; rather, they are inside an element which is {3, 4}. Therefore, {3, 4} is not a subset of A.
  4. {{3, 4}} ⊆ A? Yes, because the only element of {{3, 4}} is {3, 4}, and this element is in A. Therefore, all elements of {{3, 4}} are in A.

Thus: 2 ∈ A is true, {3, 4} ∈ A is true, {3, 4} ⊆ A is false, {{3, 4}} ⊆ A is true.

Common Mistakes and Corrections

Mistake Correction
Confusing ∈ and ⊆ ∈ for elements, ⊆ for sets
Forgetting to subtract the intersection in the counting principle for two sets |A∪B| = |A| + |B| − |A∩B|
Confusing ∅ with {0} ∅ is an empty set containing no elements, whereas {0} is a set containing a single element, namely zero
Counting regions in a three-set Venn diagram without starting from the triple intersection Always start with |A∩B∩C|, then compute the pure pairwise intersections by subtracting the triple intersection, then the individual regions
Assuming the number of subsets is n² or n! The number of subsets is 2ⁿ only, no more and no less

Test tips


Additional Exercises with Solutions

Exercise 1: De Morgan's Law

De Morgan's Law defines the relationship between the complement of an intersection and the complement of a union, and between the complement of a union and the complement of an intersection. It states that the complement of the intersection of two sets equals the union of their complements, and the complement of the union of two sets equals the intersection of their complements. This law is fundamental in simplifying set expressions and is widely used in logic and programming.

Let the universal set be \( U = {1,2,3,4,5,6,7,8,9} \), and let the two sets be \( A = {2,4,6,8} \) and \( B = {1,2,3,4,5} \). We want to verify the equality \( (A \cap B)' = A' \cup B' \).

Solution:Step by step:

  1. We compute the intersection \( A \cap B \): the common elements between \( A \) and \( B \) are \( {2,4} \).
  2. We compute the complement of the intersection \( (A \cap B)' \): all elements in \( U \) that are not in \( {2,4} \), i.e., \( {1,3,5,6,7,8,9} \).
  3. We compute the complement of \( A \): \( A' = U \setminus A = {1,3,5,7,9} \).
  4. We compute the complement of \( B \): \( B' = U \setminus B = {6,7,8,9} \).
  5. We compute the union of the two complements \( A' \cup B' \): combining the elements from \( {1,3,5,7,9} \) and \( {6,7,8,9} \) without repetition gives \( {1,3,5,6,7,8,9} \).
  6. We observe that \( (A \cap B)' = {1,3,5,6,7,8,9} \) and \( A' \cup B' = {1,3,5,6,7,8,9} \); therefore the equality holds.

Thus we have proved that \( (A \cap B)' = A' \cup B' \) as stated by De Morgan's Law.

Common Errors:

Test Tips:


Exercise 2: Three-Set Problem

The Inclusion-Exclusion Principle is a powerful tool for calculating the number of elements in the union of several sets, especially when the sets overlap. For three sets \( A \), \( B \), \( C \), the principle states: \( |A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C| \). This principle avoids double-counting elements that belong to more than one set.

In a store, at least 80 customers bought one of the beverages: 40 bought coffee, 35 bought tea, 25 bought juice, 18 bought both coffee and tea, 12 bought both coffee and juice, 10 bought both tea and juice, and 5 bought all three. We want to find the number of customers who did not buy any beverage.

Solution:Step by step:

  1. We denote the sets: \( C \) for coffee, \( T \) for tea, \( J \) for juice.
  2. Given: \( |C| = 40 \), \( |T| = 35 \), \( |J| = 25 \), \( |C \cap T| = 18 \), \( |C \cap J| = 12 \), \( |T \cap J| = 10 \), \( |C \cap T \cap J| = 5 \).
  3. We calculate the number of customers who bought at least one beverage using the inclusion–exclusion principle for three sets:
  4. \( |C \cup T \cup J| = |C| + |T| + |J| - |C \cap T| - |C \cap J| - |T \cap J| + |C \cap T \cap J| \)
  5. Substituting the values: \( = 40 + 35 + 25 - 18 - 12 - 10 + 5 \)
  6. Sum of positives: \( 40 + 35 + 25 = 100 \)
  7. Sum of negatives: \( 18 + 12 + 10 = 40 \)
  8. Compute: \( 100 - 40 + 5 = 65 \)
  9. Thus, the number of customers who bought at least one beverage is 65.
  10. The total number of customers is 80, so the number who did not buy any beverage is: \( 80 - 65 = 15 \).

Thus, 15 customers did not purchase any of coffee, tea, or juice.

Common Errors:

Test Tips:


Exercise 3: The Cartesian Product

The Cartesian product of two sets \( A \) and \( B \), denoted by \( A \times B \), is the set of all ordered pairs \( (a,b) \) where \( a \in ∈ A \) and \( b \in ∈ B \). The number of elements in the Cartesian product equals the product of the number of elements in each set, i.e., \( |A \times B| = |A| \times |B| \). This concept is fundamental in defining relations and functions, and is used in probability and linear algebra.

After forming the Cartesian product, any subset of it can be regarded as a relation between the elements of \( A \) and \( B \). The number of subsets of a set with \( n \) elements is \( 2^n \); therefore, the number of subsets of \( A \times B \) is \( 2^{|A \times B|} \).

Given that \( |A| = 4 \) and \( |B| = 3 \). We want to compute \( |A \times B| \) and the number of subsets of \( A \times B \).

Solution:Step by step:

  1. We compute the number of elements in the Cartesian product: \( |A \times B| = |A| \times |B| = 4 \times 3 = 12 \).
  2. Thus, \( A \times B \) contains 12 elements (for example, if \( A = {a_1,a_2,a_3,a_4} \) and \( B = {b_1,b_2,b_3} \), then \( A \times B = {(a_1,b_1),(a_1,b_2),(a_1,b_3),(a_2,b_1),\dots,(a_4,b_3)} \)).
  3. We calculate the number of subsets of a set with 12 elements: \( 2^{12} \).
  4. We compute \( 2^{12} = 4096 \).
  5. Therefore, the number of subsets of \( A \times B \) is 4096.

Common errors:

Test tips:


Exercise 4: Practical Application

The inclusion–exclusion principle for two sets states that \( |A \cup B| = |A| + |B| - |A \cap B| \). This principle avoids counting common elements twice when calculating the number of elements in the union. It is widely used in real-world problems involving overlapping properties or skills, such as practicing two or more sports.

In a class of 40 students, 25 students play football, 20 students play basketball, and 15 students play both sports. We want to find the number of students who play neither sport.

Solution:Step by step:

  1. We denote the sets: \( F \) for students who play football, \( B \) for students who play basketball.
  2. Given: \( |F| = 25 \), \( |B| = 20 \), \( |F \cap B| = 15 \).
  3. We calculate the number of students who play at least one sport using the inclusion–exclusion principle for two sets:
  4. \( |F \cup B| = |F| + |B| - |F \cap B| \)
  5. Substituting the values: \( = 25 + 20 - 15 \)
  6. We add: \( 25 + 20 = 45 \)
  7. We subtract: \( 45 - 15 = 30 \)
  8. Therefore, the number of students who play at least one sport is 30.
  9. The total number of students in the class is 40, so the number of students who do not play any sport is: \( 40 - 30 = 10 \).

Thus, 10 students play neither football nor basketball.

Common Errors:

Test Tips:


Exercise 5: The Absorption Law

The absorption law in set theory states that \( A \cap (A \cup B) = A \) and \( A \cup (A \cap B) = A \). This law expresses the idea that the intersection of a set with its union with any other set does not change the original set, and likewise the union of a set with its intersection with any other set. This law is used to simplify set expressions and logical proofs.

We want to prove that \( A \cap (A \cup B) = A \) using the double-inclusion method: we show that each side is a subset of the other.

Solution:Step by step:

  1. First we prove that \( A \cap (A \cup B) \subseteq A \):
  2. Take an arbitrary element \( x \in A \cap (A \cup B) \).
  3. By definition of intersection, this means that \( x \in A \) and \( x \in A \cup B \).
  4. From \( x \in A \), we directly conclude that \( x \in A \).
  5. Hence, every element of \( A \cap (A \cup B) \) is also an element of \( A \), so \( A \cap (A \cup B) \subseteq A \).
  6. Second we prove that \( A \subseteq A \cap (A \cup B) \):
  7. Take an arbitrary element \( x \in A \).
  8. Since \( x \in A \), it satisfies the membership condition for \( A \cup B \) (because \( x \in A \Rightarrow x \in A \cup B \)).
  9. Therefore, \( x \in A \) and \( x \in A \cup B \), which means by definition of intersection that \( x \in A \cap (A \cup B) \).
  10. Hence, every element of \( A \) is also an element of \( A \cap (A \cup B) \), so \( A \subseteq A \cap (A \cup B) \).
  11. Since we have proved that \( A \cap (A \cup B) \subseteq A \) and \( A \subseteq A \cap (A \cup B) \), the two sets are equal by definition of set equality.

Thus we have proved that \( A \cap (A \cup B) = A \).

Common errors:

Test tips:


Practise this lesson

Free · three languages · works offline

CSCA Academy — Independent CSCA exam preparation. الدروس · CSCA