Module 58: Sets, relations and functions · Lesson 58.1 · about 34 min
Sets, relations and functions
Sets and Venn diagrams, counting with inclusion and exclusion, relations and equivalence relations, functions and their domain and range, one-one and onto maps and how to count them, composition and inverse, and the special functions JEE loves: modulus, greatest integer, fractional part and signum.
Maths · Class 11 and 12 · about 34 minutes. By the end you will be able to count with Venn diagrams, test a relation for every property, find the domain and range of any function, count one-one and onto maps, and handle the greatest-integer and fractional-part functions.
1. Sets and Venn diagrams
A set is a well-defined collection. Write it as a list {1, 2, 3} or by a rule {x : x is a prime less than 10}. The empty set ∅ has no elements; a set with n elements has 2ⁿ subsets (its power set) and 2ⁿ − 1 proper subsets.
Operations: union A ∪ B, intersection A ∩ B, difference A − B (in A, not in B), complement A′ (in the universal set, not in A). De Morgan’s laws: (A ∪ B)′ = A′ ∩ B′ and (A ∩ B)′ = A′ ∪ B′.
Counting (inclusion and exclusion):
- n(A)
- number of elements in A
- Inclusion-exclusion
- add the singles, subtract the doubles, add back the triples
- Physical meaning
- Adding n(A) and n(B) counts the overlap twice; subtracting it once fixes the count. Every overlap problem is this idea repeated.
2. Relations
A relation from A to B is any subset of A × B. With n(A) = m and n(B) = n there are m·n ordered pairs, so 2^(mn) relations. A relation on A (from A to A) can be:
| Property | Means | Test |
|---|---|---|
| Reflexive | (a, a) for every a in A | all diagonal pairs present |
| Symmetric | (a, b) ⇒ (b, a) | every pair has its mirror |
| Transitive | (a, b) and (b, c) ⇒ (a, c) | every two-step chain closes |
| Equivalence | all three | splits A into disjoint classes |
“A relation with no pairs fails every test.” The empty relation on a non-empty set is not reflexive, but it is symmetric and transitive, because there is no pair that could break those rules. Exams test this edge case.
3. Functions
A function f: A → B gives each element of A (the domain) exactly one element of B (the codomain); the outputs actually used form the range.
Play with arrow diagrams. The counts under the picture are the formulas you need:
| From m elements to n elements | Number |
|---|---|
| All functions | |
| One-one (needs m ≤ n) | |
| Onto (needs m ≥ n) | |
| One-one and onto (m = n) |
Domain and range: a routine. For the domain, remove what breaks the formula: zero denominators, negative numbers under even roots, non-positive arguments of log, values outside [−1, 1] for sin⁻¹ and cos⁻¹. For the range, write y = f(x), solve for x, and ask which y give a valid x in the domain (or use the graph, or calculus for maxima and minima).
4. Composition and inverse
: first f, then g. It is usually not commutative. f has an inverse only if it is one-one and onto (a bijection); then , and the graph of f⁻¹ is the mirror image of f in the line y = x.
5. Special functions
| Function | Definition | Graph and range |
|---|---|---|
| Modulus |x| | x if x ≥ 0, −x if x < 0 | V shape; range [0, ∞) |
| Greatest integer [x] | largest integer ≤ x ([2.7] = 2, [−2.3] = −3) | steps; range all integers |
| Fractional part {x} | x − [x] | saw teeth; range [0, 1) |
| Signum sgn x | 1, 0 or −1 as x is positive, zero or negative | three pieces; range {−1, 0, 1} |
Useful facts: for integer n; if x is an integer, −1 otherwise; has period 1. Even functions satisfy f(−x) = f(x) (graph symmetric about the y-axis), odd ones f(−x) = −f(x) (symmetric about the origin). Every function is the sum of an even and an odd part.
- A set with n elements has 2ⁿ subsets; n(A ∪ B) = n(A) + n(B) − n(A ∩ B), and the three-set version.
- Relations from A to B: 2^(mn). Check reflexive, symmetric, transitive one at a time; equivalence = all three.
- Functions m → n: nᵐ in all, n!/(n − m)! one-one, Σ(−1)ᵏC(n, k)(n − k)ᵐ onto, n! bijections.
- Domain: remove zero denominators, negatives under even roots, non-positive log arguments.
- Only bijections have inverses; the inverse graph is the mirror in y = x.
- floors (also for negatives: [−2.3] = −3); {x} = x − [x] lies in [0, 1).
Check yourself
Sources
- NCERT Mathematics Class 11 (Sets; Relations and functions) and Class 12 (Relations and functions): topics followed, no text copied
- JEE Main and JEE Advanced 2026 syllabi: Sets, relations and functions
Your ticks stay in this browser. Save them as a file on the course home.
Updated 2026-11-22. Syllabus and exam patterns follow the official notices checked on 2026-11-22; they can change every year, so check the official exam website. All questions are original fibub work, not copied from past papers or books. Nothing you do here is sent anywhere.