Learning Objectives
- Understand the concept of sets and their representations
- Learn about types of sets (empty, finite, infinite, equal, subsets)
- Study operations on sets (union, intersection, difference, complement)
- Understand Venn diagrams and their applications
- Apply set theory to solve practical problems
Key Concepts
Sets and Representations
A set is a well-defined collection of distinct objects called elements or members. Notation: A = {1, 2, 3}. Element x belongs to set A: x ∈ A. Representations: (1) Roster (Tabular) form: List all elements — A = {2, 4, 6, 8}. (2) Set-builder form: A = {x : x is an even natural number less than 10}. Standard number sets: N (natural numbers), Z (integers), Q (rationals), R (real numbers).
Types of Sets
Empty set (φ or {}): Contains no elements. Example: {x : x2 = -1, x ∈ R}. Finite set: Has countable elements. Infinite set: Has uncountable elements (N, Z, R). Equal sets: A = B if they have exactly the same elements. Subset: A ⊆ B if every element of A is in B. Every set is a subset of itself. Empty set is a subset of every set. Power set P(A): Set of all subsets of A. If |A| = n, then |P(A)| = 2n.
Operations on Sets
Union (A ∪ B): {x : x ∈ A or x ∈ B}. Intersection (A ∩ B): {x : x ∈ A and x ∈ B}. Difference (A - B): {x : x ∈ A and x ∉ B}. Complement (A'): {x : x ∈ U and x ∉ A} where U is the universal set. Disjoint sets: A ∩ B = φ.
De Morgan's Laws: (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B'.
Important formula: n(A ∪ B) = n(A) + n(B) - n(A ∩ B). For three sets: n(A ∪ B ∪ C) = n(A) + n(B) + n(C) - n(A ∩ B) - n(B ∩ C) - n(A ∩ C) + n(A ∩ B ∩ C).
Properties of Set Operations
Commutative: A ∪ B = B ∪ A; A ∩ B = B ∩ A. Associative: (A ∪ B) ∪ C = A ∪ (B ∪ C). Distributive: A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C). Identity laws: A ∪ φ = A; A ∩ U = A. Complement laws: A ∪ A' = U; A ∩ A' = φ. Idempotent: A ∪ A = A; A ∩ A = A.
Summary
Sets are well-defined collections of objects. They can be represented in roster or set-builder form. Operations include union, intersection, difference, and complement. De Morgan's laws relate complement with union and intersection. The inclusion-exclusion principle counts elements in the union of sets.
Important Terms
- Set: Well-defined collection of distinct objects
- Power set: Set of all subsets; |P(A)| = 2n if |A| = n
- Universal set: Set containing all elements under consideration
- Disjoint sets: Sets with no common elements (A ∩ B = φ)
- De Morgan's Laws: (A ∪ B)' = A' ∩ B'; (A ∩ B)' = A' ∪ B'
- Subset: A ⊆ B means every element of A belongs to B
- Complement: All elements in universal set not in A
- Cardinality: Number of elements in a finite set
Quick Revision
- Empty set φ is subset of every set
- Power set of A with n elements has 2n elements
- n(A ∪ B) = n(A) + n(B) - n(A ∩ B)
- De Morgan's: (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B'
- A - B = A ∩ B' (set difference equals intersection with complement)
- If A ⊆ B then A ∩ B = A and A ∪ B = B
- Symmetric difference: A △ B = (A - B) ∪ (B - A)