Questions
5 questions per paper
Difficulty
Medium
Importance
Fundamental pillar for Calculus and Algebra
Overview
Sets, Relations, and Functions form the bedrock of higher mathematics, providing the language for calculus, algebra, and probability. Mastery of these topics is essential for solving complex problems in JEE and other entrance exams where functions serve as the primary mechanism for modeling mathematical relationships.
Set Operations and Cardinality
Sets represent the fundamental collection of distinct objects, and their operations—union, intersection, and complement—are critical for solving counting and probability problems. Understanding Venn diagram logic is essential for efficiently managing multi-set intersection problems involving three or more variables.
- n(A U B) = n(A) + n(B) - n(A ∩ B)
- n(A U B U C) = n(A) + n(B) + n(C) - n(A ∩ B) - n(B ∩ C) - n(A ∩ C) + n(A ∩ B ∩ C)
- De Morgan's Laws: (A U B)' = A' ∩ B' and (A ∩ B)' = A' U B'
- Power set of a set with n elements has 2^n elements.
Types of Relations
A relation is a subset of the Cartesian product of two sets, but focus is primarily on relations on a set A. Exam questions frequently test the classification of relations into reflexive, symmetric, and transitive, which together define equivalence relations.
- Reflexive: (a, a) ∈ R for all a ∈ A
- Symmetric: (a, b) ∈ R implies (b, a) ∈ R
- Transitive: (a, b) ∈ R and (b, c) ∈ R implies (a, c) ∈ R
- Equivalence Relation: Must be reflexive, symmetric, and transitive.
Types of Functions
Functions map inputs from a domain to a codomain, with the concept of injectivity (one-to-one) and surjectivity (onto) being the most common assessment areas. Bijective functions are strictly required for a function to be invertible.
- Injective (One-to-One): f(x1) = f(x2) implies x1 = x2
- Surjective (Onto): Range = Codomain
- Even Function: f(-x) = f(x); Odd Function: f(-x) = -f(x)
- Vertical Line Test: Determines if a graph is a function.
Composition and Inverse Functions
The composition of functions (fog) and finding the inverse (f^-1) are high-yield areas for competitive exams. Calculating the domain and range of composite functions often requires careful analysis of the inner function's range becoming the outer function's domain.
- (fog)(x) = f(g(x))
- Inverse exists if and only if f is bijective
- f(f^-1(x)) = x and f^-1(f(x)) = x
- (g o f)^-1 = f^-1 o g^-1
Formula Sheet
n(A U B U C) = Σn(A) - Σn(A ∩ B) + n(A ∩ B ∩ C)
f(x) = y ⇔ f^-1(y) = x
Number of relations from A to B = 2^(n(A) * n(B))
Number of onto functions from set A to B (if |A|=m, |B|=n) = Σ(-1)^(n-r) * nCr * r^m
fog(x) ≠ gof(x) (In general)
Exam Tip
Always verify the domain and range before manipulating functions, as many 'traps' in JEE problems lie in values that make the expression undefined.
Common Mistakes
- Confusing symmetric relations with transitive relations when verifying equivalence classes.
- Neglecting to check the range of the inner function before finding the composition of two functions.
- Assuming every function is invertible without checking if it is a bijection.
More Revision Notes
Ready to test yourself?
Play topic-wise Sets, Relations & Functions questions in Aspirant Arcade — gamified MCQ practice.
Download Free