Welcome to your ultimate and comprehensive study guide for Sets and Functions. Set theory and functions form the language of modern mathematics, providing the structural basis for algebra, geometry, and advanced analysis. This chapter explores standard number sets, fundamental set operations, Venn diagrams, Cartesian products, binary relations, and various types of functions.
1. Standard Number Sets and Basic Operations
A set is a well-defined collection of distinct objects. In mathematics, we frequently work with standard number sets:
- N (Natural Numbers): {1, 2, 3, 4, …}
- W (Whole Numbers): {0, 1, 2, 3, 4, …}
- Z (Integers): {…, -3, -2, -1, 0, 1, 2, 3, …}
- Q (Rational Numbers): Numbers expressed in the form p/q where p, q ∈ Z and q ≠ 0.
- R (Real Numbers): The union of rational and irrational numbers (R = Q ∪ Q’).
2. Fundamental Operations on Sets
- Union (A ∪ B): The set containing all elements belonging to set A, set B, or both.
- Intersection (A ∩ B): The set containing only the common elements present in both set A and set B.
- Difference (A \ B or A – B): The set of elements belonging to A but not to B.
- Complement (A’ or Ac): The set of all elements in the universal set U that do not belong to A (U \ A).
- De Morgan’s Laws: For any sets A and B, (A ∪ B)’ = A’ ∩ B’ and (A ∩ B)’ = A’ ∪ B’.
3. Venn Diagrams and Set Laws
British mathematician John Venn introduced Venn diagrams to represent sets geometrically using rectangles for universal sets and closed geometric figures (circles) for subsets. Venn diagrams provide intuitive verification for commutative laws, associative laws, distributive laws, and De Morgan’s laws.
4. Cartesian Products and Binary Relations
- Ordered Pair: A pair of elements written in a specific order, denoted as (x, y), where (x, y) ≠ (y, x) unless x = y.
- Cartesian Product (A × B): The set of all ordered pairs (x, y) such that x ∈ A and y ∈ B.
- Binary Relation: Any subset R ⊂ A × B is called a binary relation from A into B. The set of first elements is the domain, and the set of second elements is the range.
5. Functions (Mappings) and Their Types
A relation f from set A to set B is called a function if every element of set A has one and only one unique image in set B (i.e., domain of f = A and no two distinct ordered pairs have the same first element).
- Into Function: At least one element in co-domain B is not an image of any element in A (Range ⊂ B).
- Onto (Surjective) Function: Every element of B is an image of at least one element in A (Range = B).
- One-to-One (Injective) Function: Distinct elements of A have distinct images in B.
- Bijective Function: A function that is both one-to-one and onto (one-to-one correspondence).
6. Step-by-Step Example: Set Operations and De Morgan’s Verification
Example: If U = {1, 2, 3, …, 10}, A = {2, 3, 5, 7}, and B = {3, 5, 8}, verify De Morgan’s Law: (A ∪ B)’ = A’ ∩ B’.
Step-by-Step Solution:
- Step 1: Find A ∪ B:
A ∪ B = {2, 3, 5, 7} ∪ {3, 5, 8} = {2, 3, 5, 7, 8}. - Step 2: Find L.H.S. (A ∪ B)’:
(A ∪ B)’ = U \ (A ∪ B) = {1, 2, 3, …, 10} \ {2, 3, 5, 7, 8} = {1, 4, 6, 9, 10}. - Step 3: Find A’ and B’:
A’ = U \ A = {1, 4, 6, 8, 9, 10}.
B’ = U \ B = {1, 2, 4, 6, 7, 9, 10}. - Step 4: Find R.H.S. (A’ ∩ B’):
A’ ∩ B’ = {1, 4, 6, 8, 9, 10} ∩ {1, 2, 4, 6, 7, 9, 10} = {1, 4, 6, 9, 10}. - Conclusion: Since L.H.S. = R.H.S., De Morgan’s Law is successfully verified.
Essential Conceptual Review Questions
Q1: What is the main difference between a binary relation and a function?
Answer: While every function is a binary relation, not every relation is a function. A relation becomes a function only if every element in the domain has one and only one unique image in the co-domain, meaning no two ordered pairs can share the same first element with different second elements.
Q2: When is a function classified as a bijective function?
Answer: A function is classified as bijective (one-to-one correspondence) if and only if it is both one-to-one (injective) and onto (surjective) simultaneously.