Chapter 4 • Unit II

Exercise 4.2: Types of Sets

Comprehensive guide and practice questions for CBSE Class 11 Applied Mathematics curriculum (2026-27).

Comprehensive Concepts & Principles: Types of Sets

In set theory and CBSE Class 11 Applied Mathematics, sets are systematically classified according to the number and nature of elements they contain. Mastering these classifications is essential for analyzing categorical data, constructing database domain constraints, and evaluating logical boundary conditions.

Core Taxonomy of Sets:
  • 1. Empty Set (Null Set / Void Set): A set that contains no elements at all, denoted by the Greek symbol $\emptyset$ or empty braces $\{\}$.
    • Cardinality: $n(\emptyset) = 0$.
    • Critical Notation Alert: The set $\{\emptyset\}$ or $\{0\}$ is NOT an empty set; it is a singleton set containing one element!
  • 2. Singleton Set (Unit Set): A set containing exactly one element ($n(A) = 1$).
    • Example: $S = \{x : x \in \mathbb{N}, x^2 = 4\} = \{2\}$.
  • 3. Finite Set: A set that has a definite, countable number of elements (its cardinality $n(A) \in \mathbb{W}$).
    • Example: The set of days in a week ($n = 7$).
  • 4. Infinite Set: A set whose elements cannot be counted to a terminal end.
    • Examples: The set of all natural numbers $\mathbb{N}$, the set of all real numbers between 0 and 1, the set of points on a line segment.
  • 5. Equal Sets ($A = B$): Two sets $A$ and $B$ are equal if and only if they possess identical elements:
    $$A = B \iff (x \in A \iff x \in B)$$
  • 6. Equivalent Sets ($A \approx B$): Two finite sets are equivalent if they have the same cardinal number of elements:
    $$A \approx B \iff n(A) = n(B)$$
    • Golden Rule: All equal sets are equivalent, but equivalent sets are not necessarily equal!

Equal vs. Equivalent Sets Comparison

Feature Equal Sets ($A = B$) Equivalent Sets ($A \approx B$)
Criterion Identical elements Identical count of elements ($n(A) = n(B)$)
Example $\{1, 2, 3\} = \{3, 1, 2\}$ $\{1, 2, 3\} \approx \{a, b, c\}$
Bijection Trivially identical mapping Supports a one-to-one correspondence

Worked Benchmark Examples

Example 1 (Identifying Empty Sets):

State whether each of the following sets is Empty, Singleton, or neither:
(a) $A = \{x : x \in \mathbb{N}, 2 < x < 3\}$
(b) $B = \{x : x \in \mathbb{Z}, x^2 = 0\}$
(c) $C = \{x : x \text{ is an odd integer divisible by 2}\}$
(d) $D = \{\emptyset\}$

Show Step-by-Step Solution

• (a) $A$: Empty Set ($\emptyset$): There is no natural number strictly between 2 and 3.
• (b) $B$: Singleton Set ($\{0\}$): Only $x = 0$ satisfies $x^2 = 0$, and 0 is an integer. Cardinality is 1.
• (c) $C$: Empty Set ($\emptyset$): By definition, odd numbers leave a remainder of 1 when divided by 2; none are divisible by 2.
• (d) $D$: Singleton Set: $D$ contains exactly one element, which happens to be the symbol $\emptyset$. Its cardinality is $n(D) = 1$.

Example 2 (Equal vs. Equivalent Verification):

Given:
$A = \{x : x \text{ is a letter in the word 'WOLF'}\}$
$B = \{x : x \text{ is a letter in the word 'FLOW'}\}$
$C = \{1, 2, 3, 4\}$
State whether pairs $(A, B)$ and $(A, C)$ are Equal or Equivalent.

Show Step-by-Step Solution

• $A = \{W, O, L, F\}$, $n(A) = 4$.
• $B = \{F, L, O, W\}$, $n(B) = 4$.
• $C = \{1, 2, 3, 4\}$, $n(C) = 4$.
• Pair $(A, B)$: Equal ($A = B$) and Equivalent: Both sets have the exact same 4 letters.
• Pair $(A, C)$: Equivalent ($A \approx C$) but NOT Equal: Both sets share the same cardinal count of 4 elements, but their elements are completely different (letters vs numbers).

Previous: Ex 4.1 Chapter Hub Next: Ex 4.3