SETS in 40 Minutes Complete - JEE Mathematics

Sets: Definitions, Types, Operations, and Key Results

Definition and Basic Properties

A set is a well-defined collection of distinct objects, called elements. All elements in a set are different; no two elements are the same. Sets are denoted by capital letters and their elements are listed within curly brackets.

• Examples: $A = \{a, b, c\}$, $B = \{1, 2\}$, $C = \{A, B\}$ (a set can contain other sets as elements).
• Notation: $n(A)$ or $|A|$ denotes the number of elements in set $A$.
• Important Symbols:
  • $\exists$ : there exists
  • $\forall$ : for every…

Sets: Definitions, Types, Operations, and Key Results

Definition and Basic Properties

A set is a well-defined collection of distinct objects, called elements. All elements in a set are different; no two elements are the same. Sets are denoted by capital letters and their elements are listed within curly brackets.

• Examples: $A = \{a, b, c\}$, $B = \{1, 2\}$, $C = \{A, B\}$ (a set can contain other sets as elements).
• Notation: $n(A)$ or $|A|$ denotes the number of elements in set $A$.
• Important Symbols:
  • $\exists$ : there exists
  • $\forall$ : for every / for all
  • $\in$ : belongs to
  • $\notin$ : does not belong to
  • $\cap$ : intersection
  • $\cup$ : union
  • $\varnothing$ or $\phi$ : empty set

Cardinal Number and Order

The cardinal number (or order) of a set is the count of its elements. It is represented as $n(A)$, $|A|$, or sometimes as "order of $A$".

• If $A = \{1, 2, 3\}$, then $n(A) = 3$.
• Order, cardinal number, and mode of a set all refer to the number of elements.

Types of Sets

Sets are classified based on the number and nature of their elements. Each type has specific properties and representations.

• Empty Set (Null Set): Contains no elements. Denoted by $\varnothing$ or $\{\}$.
  • $n(\varnothing) = 0$
• Finite Set: Number of elements is countable.
• Infinite Set: Number of elements is not countable (e.g., set of natural numbers).
• Singleton Set: Contains exactly one element.
• Equivalent Sets: Two sets with the same number of elements, regardless of what the elements are.
• Equal Sets: Two sets with exactly the same elements.
• Key Points:
  • All equal sets are equivalent, but not all equivalent sets are equal.
  • $\{0\}$ is not an empty set; it contains one element, $0$.
  • $\{\varnothing\}$ is not empty; it contains the empty set as an element.

Subsets, Proper Subsets, and Supersets

A subset is a set whose elements all belong to another set. The concept of proper subsets and supersets is closely related.

• $A$ is a subset of $B$ ($A \subseteq B$) if every element of $A$ is also in $B$.
• Proper Subset: All subsets of $A$ except $A$ itself.
• Superset: If $A \subseteq B$, then $B$ is a superset of $A$.
• Special Subsets: The empty set and the set itself are always subsets.
• Number of Subsets: If $A$ has $n$ elements, number of subsets $= 2^n$.
• Number of Proper Subsets: $2^n - 1$.

Power Set

The power set of $A$, denoted $P(A)$, is the set of all subsets of $A$. It includes the empty set and $A$ itself.

• If $A = \{1, 2, 3\}$, then
  • $P(A) = \{\varnothing, \{1\}, \{2\}, \{3\}, \{1,2\}, \{1,3\}, \{2,3\}, \{1,2,3\}\}$
  • Number of elements in $P(A)$ is $2^n$ where $n = |A|$.
• Nested Power Sets: If power set is taken $r$ times, number of elements is $2^{2^{...^{2^n}}}$ ($2$ written $r$ times).

Set Operations: Union, Intersection, Difference, Symmetric Difference

Operations on sets allow combining or comparing sets in various ways.

• Union ($A \cup B$): All elements in $A$ or $B$ or both.
• Intersection ($A \cap B$): Elements common to both $A$ and $B$.
• Difference ($A - B$): Elements in $A$ but not in $B$.
• Symmetric Difference ($A \triangle B$): Elements in $A$ or $B$ but not in both; $A \triangle B = (A - B) \cup (B - A)$.
• Disjoint Sets: Sets with no common elements ($A \cap B = \varnothing$).

Universal Set and Complement

A universal set contains all elements under consideration for a particular discussion. The complement of a set $A$ (denoted $A'$ or $A^c$ or $A^{\dashv}$) is the set of all elements in the universal set that are not in $A$.

• If $U$ is the universal set and $A \subseteq U$, then $A'$ contains all elements of $U$ not in $A$.
• Notation: $A'$, $A^c$, $A^{\dashv}$ all represent the complement of $A$.

Venn Diagrams and Visual Representation

Venn diagrams are used to visually represent sets and their relationships. Sets are shown as circles within a rectangle representing the universal set.

• Overlapping Circles: Represent sets with common elements (intersection).
• Non-overlapping Circles: Represent disjoint sets.
• Shaded Regions: Used to indicate specific set operations (e.g., $A - B$, $A \cup B$, $A'$).

Key Formulas and Results

Several formulas are essential for solving problems involving sets, especially in probability and combinatorics.

• Number of Subsets: $2^n$ for a set with $n$ elements.
• Number of Proper Subsets: $2^n - 1$.
• Number of Subsets of $\varnothing$: $2^0 = 1$ (only the empty set itself).
• If $A$ has $m$ elements and $B$ has $n$ elements, and $A$ has $112$ more subsets than $B$:
  • $2^m = 2^n + 112$
  • $m - n = 3$, $n = 4$, $m = 7$
  • $m \times n = 28$
• Power Set Nested Formula: If power set is taken $r$ times, number of elements $= 2^{2^{...^{2^n}}}$ ($2$ written $r$ times).
• De Morgan’s Laws:
  • $(A \cup B)' = A' \cap B'$
  • $(A \cap B)' = A' \cup B'$
• Cardinality of Union (Two Sets):$$n(A \cup B) = n(A) + n(B) - n(A \cap B)$$
• Cardinality of Union (Three Sets):$$n(A \cup B \cup C) = n(A) + n(B) + n(C) - n(A \cap B) - n(B \cap C) - n(C \cap A) + n(A \cap B \cap C)$$
• Number of Elements Only in $A$ (not in $B$ or $C$):$$n(\text{only }A) = n(A) - n(A \cap B) - n(A \cap C) + n(A \cap B \cap C)$$
• Number of Elements Only in $B$ or $C$ derived similarly.
• Number of Elements in Exactly One Set:$$n(\text{exactly one}) = n(A) + n(B) + n(C) - 2[n(A \cap B) + n(B \cap C) + n(C \cap A)] + 3n(A \cap B \cap C)$$

Common Pitfalls and Misconceptions

Certain mistakes are frequent in set theory problems. Recognizing these helps avoid errors in exams.

• $\{0\}$ is not empty; it contains one element, $0$.
• $\{\varnothing\}$ is not empty; it contains the empty set as an element.
• All equal sets are equivalent, but not all equivalent sets are equal.
• The empty set is a subset of every set, including itself.
• A set is always a subset of itself.
• Number of subsets of the empty set is $1$ (the empty set itself).
• When counting proper subsets, do not include the set itself.
• In Venn diagrams, the universal set is always represented by a rectangle, and all other sets are circles within it.
• For symmetric difference, $A \triangle B = (A - B) \cup (B - A)$.
• In general, $A - B \neq B - A$.

Application in Probability and Combinatorics

Set theory forms the foundation for probability, permutations, combinations, relations, and functions. Many problems in these topics require direct application of set formulas and operations.

• Formulas for union, intersection, and complements are frequently used in probability calculations.
• Understanding subsets, power sets, and their counts is essential for combinatorial problems.
• Venn diagrams are crucial for visualizing and solving problems involving multiple sets and their relationships.