Chapter 1 โ Sets, Relations and Functions
Sets, the relations between their elements, and the functions that send one set into another are the language in which every other unit of JEE Main mathematics is written. This chapter builds that language and the counting that comes with it.
In the 1870s the German mathematician Georg Cantor asked a question that sounds almost childish: when do two collections have "the same number" of things? For finite collections you can count, but Cantor wanted an answer that also works for infinite ones, and he found it in pairing: two sets are the same size if their elements can be matched one-to-one, with nothing left over on either side. With that one idea he showed that there are exactly as many even numbers as natural numbers, but strictly more real numbers than either. The ideas he used โ sets, subsets, pairings, one-one and onto maps โ became within a few decades the foundation on which all of modern mathematics is written.
They are also the foundation of a great deal of modern technology. A table in a database is a relation; a search that joins two tables builds a Cartesian product and keeps the pairs that satisfy a condition; a hash function that files records into storage slots is a deliberately many-one function. In JEE Main the unit appears directly in one or two questions โ a Venn-diagram count, the number of relations or functions of a given kind, a check of reflexive, symmetric and transitive, the domain or range of a formula, a composite function โ and indirectly everywhere: the domain of a function in calculus, an event in probability, a locus in coordinate geometry are all sets. Section 1.1 builds sets, their algebra, and relations up to equivalence relations; Section 1.2 turns to functions, the special relations that give every input exactly one output.
- write a set in roster and set-builder form, tell $\in$ from $\subseteq$, and count subsets and the elements of a power set ($2^n$);
- form unions, intersections, differences and complements, prove identities with the laws of the algebra of sets (De Morgan, distributive), and test a claimed identity with a Venn diagram;
- count with $n(A\cup B)=n(A)+n(B)-n(A\cap B)$ and its three-set form, including "exactly one", "none" and least-possible-overlap questions;
- work with ordered pairs, Cartesian products and relations, and count relations ($2^{mn}$) and reflexive or symmetric relations on a finite set;
- decide whether a relation is reflexive, symmetric, transitive or an equivalence relation, find its equivalence classes, and build the smallest equivalence relation containing given pairs;
- find the domain and range of a real function, and decide whether a function is one-one or many-one and onto or into;
- count all, one-one, onto and bijective functions between finite sets ($n^m$, $3^m-3\cdot2^m+3$, $n!$);
- form composite functions with their domains, use the properties of composition, and handle repeated composites and simple functional equations;
- solve JEE Main multiple-choice and numerical-answer problems on the whole unit.
Let $n(A)=n(B)=3$. Pick a relation from $A$ to $B$ completely at random (each of the $9$ pairs in or out with equal chance). About how likely is it to be a function?
Sections in this chapter
Sets and Relations
Sets and their representation, union, intersection and complement with their laws, power sets, counting with Venn diagrams, Cartesian products, types of relations and equivalence relations.
Functions
Functions, domain, codomain and range; one-one, many-one, onto and into functions and how many there are; composition of functions.
Eight problems that mix both sections, in no particular order โ just as they come in the paper, where nothing tells you which idea a question needs. Answer each one and press Submit (NTA marking: $+4$ correct, $-1$ wrong, $0$ unanswered), or press โฑ Take as a timed test for the real-exam experience: $8$ questions at the JEE Main pace of $2.4$ minutes each, with the NTA question palette.
E1. JEE Main ยท MCQ Let $A=\{x\in\mathbb{R}: x^2-3x-4\le0\}$ and $B=\{x\in\mathbb{R}: |x|\lt2\}$. Then $A\cap B$ is (A) $[-1,2)$ (B) $(-2,4]$ (C) $[-1,2]$ (D) $(-1,2)$
E2. JEE Main ยท Numerical Let $n(A)=3$ and $n(B)=4$. Find the number of functions from $A$ to $B$ that are not one-one. Give the answer to the nearest integer.
E3. JEE Main ยท MCQ In a class of $50$ students, $30$ like tea, $25$ like coffee and $8$ like neither. The number of students who like exactly one of the two drinks is (A) $13$ (B) $29$ (C) $34$ (D) $42$
E4. JEE Main ยท Numerical Let $f(x)=x^2+1$ and $g(x)=2x-3$. Find the sum of all real numbers $x$ for which $(f\circ g)(x)=(g\circ f)(x)$. Give the answer to the nearest integer.
E5. JEE Main ยท MCQ On $\mathbb{Z}$, define $a\,R\,b$ if $a^2-b^2$ is divisible by $5$. Then $R$ is an equivalence relation, and the number of its equivalence classes is (A) $5$ (B) $2$ (C) $3$ (D) infinitely many
E6. JEE Main ยท Numerical The power set of a set $A$ has $112$ more elements than the power set of a set $B$. Find $n(A)+n(B)$. Give the answer to the nearest integer.
E7. JEE Main ยท MCQ The function $f:[-1,\infty)\to[-1,\infty)$, $f(x)=x^2+2x$, is (A) one-one but not onto (B) onto but not one-one (C) neither one-one nor onto (D) a bijection
E8. JEE Main ยท Numerical Find the number of equivalence relations on the set $\{1,2,3,4\}$. Give the answer to the nearest integer.