👁 Preview — Study, Practice and Revise are open; mock tests and the rest of the syllabus unlock on subscription. Unlock all · ₹4,999
← Back to Algebra
Study mode

Operations on Sets

Study Practice Revise 🔒 Test
Learning objective
Learn basic set operations such as union, intersection, difference, and complement.

Operations on Sets

Understanding operations on sets is fundamental in algebra and discrete mathematics. This section covers the key operations: union, intersection, difference, and complement, along with important related concepts such as subsets, power sets, and set identities. These concepts are crucial for solving problems in entrance exams like NDA and are frequently tested in board exams.

1. Basic Set Operations

Let \( A \) and \( B \) be two sets. The following operations are defined:

  • Union (\( A \cup B \)): The set of all elements that belong to \( A \), or \( B \), or both.
    Formally, \( A \cup B = { x : x \in A \text{ or } x \in B } \).
  • Intersection (\( A \cap B \)): The set of all elements common to both \( A \) and \( B \).
    Formally, \( A \cap B = { x : x \in A \text{ and } x \in B } \).
  • Difference (\( A - B \)): The set of elements in \( A \) but not in \( B \).
    Formally, \( A - B = { x : x \in A \text{ and } x \notin B } \).

Example Diagram (Venn Diagram):

  +-------------------+  |       _______     |  |      /           |  |     /    A       |  |    /___________  |  |         B    /   |  |      _______/    |  +-------------------+

This diagram represents two overlapping sets \( A \) and \( B \). The union is the entire shaded area covering both circles, the intersection is the overlapping region, and the difference \( A - B \) is the part of \( A \) outside the overlap.

2. Complement of a Set

Given a universal set \( U \) that contains all elements under consideration, the complement of a set \( A \), denoted by \( A' \) or \( \overline{A} \), is the set of all elements in \( U \) that are not in \( A \). Formally,

\[A' = { x \in U : x \notin A }\]

Properties of Complement:

  • \( (A')' = A \)
  • \( A \cup A' = U \)
  • \( A \cap A' = \emptyset \)
  • De Morgan's Laws:
    \( (A \cup B)' = A' \cap B' \)
    \( (A \cap B)' = A' \cup B' \)

3. Subsets and Power Sets

A set \( A \) is a subset of set \( B \) (denoted \( A \subseteq B \)) if every element of \( A \) is also an element of \( B \). If \( A \subseteq B \) and \( A \neq B \), then \( A \) is a proper subset of \( B \) (denoted \( A \subset B \)).

The null set or empty set \( \emptyset \) is a subset of every set.

The power set of a set \( S \), denoted \( \mathcal{P}(S) \), is the set of all subsets of \( S \), including the empty set and \( S \) itself. If \( n(S) = k \), then

\[n(\mathcal{P}(S)) = 2^k\]

This is because each element can either be included or excluded from a subset, giving \( 2^k \) possible subsets.

4. Set Identities and Laws

Some important identities involving sets are:

  • Idempotent Laws: \( A \cup A = A \), \( A \cap A = A \)
  • Domination Laws: \( A \cup U = U \), \( A \cap \emptyset = \emptyset \)
  • Complement Laws: \( A \cup A' = U \), \( A \cap A' = \emptyset \)
  • Distributive Laws:
    \( A \cup (B \cap C) = (A \cup B) \cap (A \cup C) \)
    \( A \cap (B \cup C) = (A \cap B) \cup (A \cap C) \)
  • De Morgan's Laws: as given above

5. Additional Concepts

  • Symmetric Difference (\( A \oplus B \)): Elements in either \( A \) or \( B \) but not in both.
    \( A \oplus B = (A - B) \cup (B - A) \)
  • Cartesian Product (\( A \times B \)): The set of ordered pairs \( (a, b) \) where \( a \in A \) and \( b \in B \).

Exam Tips and Common Mistakes

  • Remember that the null set \( \emptyset \) is a subset of every set, but it is not an element of every set.
  • Sets do not consider repeated elements; \( {1, 5, 5, 9} = {1, 5, 9} \).
  • Power set cardinality grows exponentially with the number of elements.
  • Use Venn diagrams to visualize unions, intersections, and complements.
  • Check carefully when dealing with difference and symmetric difference operations.

Worked Examples

Example 1: Verifying Subset and Power Set Cardinality ★★

Problem: Let \( A = {1, 2, 3} \). Verify that the null set is a subset of \( A \), and find the number of elements in the power set \( \mathcal{P}(A) \).

Solution:

  1. The null set \( \emptyset \) has no elements, so trivially every element of \( \emptyset \) is in \( A \). Hence, \( \emptyset \subseteq A \).
  2. Since \( n(A) = 3 \), the power set \( \mathcal{P}(A) \) has \( 2^3 = 8 \) elements.
  3. Explicitly, \( \mathcal{P}(A) = { \emptyset, {1}, {2}, {3}, {1,2}, {1,3}, {2,3}, {1,2,3} } \).

Answer: The null set is a subset of \( A \), and \( n(\mathcal{P}(A)) = 8 \).

Example 2: Union and Intersection of Sets ★★

Problem: Given \( A = {2, 4, 6, 8} \) and \( B = {4, 8, 12} \), find \( A \cup B \) and \( A \cap B \).

Solution:

  1. \( A \cup B = {2, 4, 6, 8, 12} \) (all elements from both sets without repetition).
  2. \( A \cap B = {4, 8} \) (elements common to both sets).

Answer: \( A \cup B = {2, 4, 6, 8, 12} \), \( A \cap B = {4, 8} \).

Example 3: Finding the Complement of a Set ★★

Problem: Let \( U = {1, 2, 3, 4, 5, 6, 7, 8, 9} \), \( A = {1, 2, 3, 4} \), and \( B = {2, 4, 6, 8} \). Find \( (A \cup B)' \).

Solution:

  1. First find \( A \cup B = {1, 2, 3, 4, 6, 8} \).
  2. The complement \( (A \cup B)' = U - (A \cup B) = {5, 7, 9} \).

Answer: \( (A \cup B)' = {5, 7, 9} \).

Example 4: Cardinality of Intersection ★★★

Problem: If \( n(A) = 37 \), \( n(B) = 25 \), and \( n(A \cup B) = 50 \), find \( n(A \cap B) \).

Solution:

  1. Recall the formula: \( n(A \cup B) = n(A) + n(B) - n(A \cap B) \).
  2. Substitute values: \( 50 = 37 + 25 - n(A \cap B) \).
  3. Simplify: \( 50 = 62 - n(A \cap B) \Rightarrow n(A \cap B) = 62 - 50 = 12 \).

Answer: \( n(A \cap B) = 12 \).

Example 5: Maximum Intersection of Two Sets ★★★

Problem: If \( n(A) = 4 \) and \( n(B) = 3 \), what is the maximum value of \( n(A \cap B) \)?

Solution:

  1. The intersection cannot have more elements than the smaller set.
  2. Since \( n(B) = 3 \), the maximum \( n(A \cap B) = 3 \).

Answer: Maximum \( n(A \cap B) = 3 \).

Example 6: Symmetric Difference Cardinality ★★★

Problem: If set \( A \) has 5 elements and set \( B \) has 4 elements, what is the maximum number of elements in \( A \oplus B \) (symmetric difference)?

Solution:

  1. Recall: \( A \oplus B = (A - B) \cup (B - A) \).
  2. Maximum symmetric difference occurs when \( A \cap B = \emptyset \) (no common elements).
  3. Then, \( n(A \oplus B) = n(A) + n(B) = 5 + 4 = 9 \).

Answer: Maximum number of elements in \( A \oplus B \) is 9.

Formula Bank

  • Union: \( A \cup B = { x : x \in A \text{ or } x \in B } \)
  • Intersection: \( A \cap B = { x : x \in A \text{ and } x \in B } \)
  • Difference: \( A - B = { x : x \in A \text{ and } x \notin B } \)
  • Complement: \( A' = U - A = { x \in U : x \notin A } \)
  • Subset: \( A \subseteq B \iff \forall x (x \in A \Rightarrow x \in B) \)
  • Power Set Cardinality: If \( n(S) = k \), then \( n(\mathcal{P}(S)) = 2^k \)
  • Cardinality of Union: \( n(A \cup B) = n(A) + n(B) - n(A \cap B) \)
  • Symmetric Difference: \( A \oplus B = (A - B) \cup (B - A) \)
  • De Morgan's Laws:
    \( (A \cup B)' = A' \cap B' \)
    \( (A \cap B)' = A' \cup B' \)
Curated videos per subtopic
Top YouTube explainers, AI-ranked for your exam and language. Unlocks with subscription.
Unlock

Try Practice next.

Progress tracking is paywalled — subscribe to mark subtopics as understood and save your streak.

Go to practice →
Ask a doubt
Operations on Sets · 10 free messages
Ask me anything about this subtopic. You have 10 free messages this session — chat history isn't saved in preview.