Chapter 1 ยท Introduction

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.

Setsโ†’$\cup$, $\cap$, $'$ and their lawsโ†’Power set $2^n$โ†’$A\times B$โ†’Relationsโ†’Equivalenceโ†’Functionsโ†’One-one, ontoโ†’$g\circ f$
๐ŸŽฏ By the end of this chapter you canโ€ฆ
  • 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?

Set $n(A)=3$, $n(B)=3$. The readouts show $2^9=512$ relations and $3^3=27$ functions, a share of $5.27\%$; let Play run and the simulated share settles near $5\%$ โ€” roughly one random relation in twenty is a function. Each row of the grid must contain exactly one dot, and a random row of three cells has exactly one dot with probability $\tfrac38$; three rows together: $\left(\tfrac38\right)^3\approx0.053$. You will meet both counts properly in Theorems 1.4 and 1.7.
Teaser โ€” How Rare is a Function?

A relation from $A$ to $B$ is any choice of dots in the grid of pairs $(a,b)$: row $a$, column $b$. It is a function exactly when every row has exactly one dot โ€” each element of $A$ gets one image. Press Play: the lab draws random relations, checks each row, and keeps a tally of how many were functions. Change the sizes of $A$ and $B$ and compare the tally with the exact share $n^m/2^{mn}$.

33
relations $2^{mn}$โ€”
functions $n^m$โ€”
exact shareโ€”
simulationโ€”

Sections in this chapter

๐ŸŽฏ Chapter mixed test JEE Main ยท MCQJEE Main ยท Numerical

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)$

Sets $x^2-3x-4=(x-4)(x+1)\le0\iff-1\le x\le4$: $A=[-1,4]$. $|x|\lt2\iff-2\lt x\lt2$: $B=(-2,2)$.
Intersect Both conditions: $-1\le x\lt2$ โ€” closed at $-1$ (from $A$), open at $2$ (from $B$).
Answer (A) $[-1,2)$.
โฑ Shortcut (B) is $A\cup B$. For intervals, the intersection takes the larger left end and the smaller right end, each with its own bracket.

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.

All $4^3=64$ functions (Theorem 1.7).
One-one $4\cdot3\cdot2=24$ (Theorem 1.9).
Answer $64-24=40$.

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$

Union $n(T\cup C)=50-8=42$; both: $30+25-42=13$ (Theorem 1.3).
Exactly one $n(T\cup C)-n(T\cap C)=42-13$.
Answer (B) $29$.
โฑ Shortcut Exactly one $=n(T)+n(C)-2\,n(T\cap C)=55-26=29$. (A) is "both", (D) is "at least one".

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.

Composites $(f\circ g)(x)=(2x-3)^2+1=4x^2-12x+10$; $\ (g\circ f)(x)=2(x^2+1)-3=2x^2-1$.
Equation $2x^2-12x+11=0$; discriminant $144-88=56\gt0$, so there are two real roots, $x=3\pm\tfrac{\sqrt{14}}{2}$.
Answer Their sum is $\dfrac{12}{2}=6$.
โฑ Shortcut The sum of the roots of $ax^2+bx+c=0$ is $-\tfrac ba$ (Chapter 2) โ€” but check the discriminant first, since the question asks for real $x$.

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

Equivalence $a\,R\,b$ means $a^2$ and $b^2$ leave the same remainder on division by $5$ โ€” "same remainder" is reflexive, symmetric and transitive.
Remainders of squares $0^2,1^2,2^2,3^2,4^2$ leave remainders $0,1,4,4,1$: only $0$, $1$, $4$ occur. Classes: $\{a: 5\mid a\}$, $\{a\equiv\pm1\}$, $\{a\equiv\pm2\}$ (mod $5$).
Answer (C) $3$.
โฑ Shortcut (A) is the number of classes of "$a-b$ divisible by $5$". Squaring merges $a$ with $-a$.

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.

Equation $2^a-2^b=112$ with $a=n(A)\gt b=n(B)$: $2^b\left(2^{a-b}-1\right)=112=2^4\times7$.
Match $2^{a-b}-1$ is odd, so it must be $7$ and $2^b=16$: $b=4$, $a-b=3$, $a=7$.
Answer $7+4=11$.
Check $2^7-2^4=128-16=112$ โœ“.

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

Rewrite $f(x)=(x+1)^2-1$, and on the domain $x+1\ge0$.
One-one $(x_1+1)^2=(x_2+1)^2$ with $x_1+1,\ x_2+1\ge0$ gives $x_1=x_2$.
Onto For $y\ge-1$, $x=-1+\sqrt{y+1}\ge-1$ is in the domain and $f(x)=y$.
Answer (D).
โฑ Shortcut The domain starts exactly at the vertex $x=-1$ and the codomain exactly at the minimum value $-1$: half a parabola onto its full range is always 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.

Partitions Equivalence relations correspond to partitions (Theorem 1.5). Count partitions of $\{1,2,3,4\}$ by block sizes.
Count $4$: $1$ way. $3+1$: $4$ ways (choose the single). $2+2$: $3$ ways ($\{1,2\}\{3,4\}$, $\{1,3\}\{2,4\}$, $\{1,4\}\{2,3\}$). $2+1+1$: $6$ ways (choose the pair). $1+1+1+1$: $1$ way.
Answer $1+4+3+6+1=15$.
โฑ Shortcut For a $3$-element set the count is $5$; remember $1,2,5,15$ for $n=1,2,3,4$.
โœ… Before you start
This is the first chapter of the course, so it needs only Class 10 mathematics: the number systems (natural numbers, integers, rationals, reals), factorising quadratics and solving quadratic equations, the meaning of $|x|$ as a distance, and solving simple inequalities โ€” in particular, that $(x-a)(x-b)\le0$ means $x$ lies between $a$ and $b$, and $|x-a|\lt r$ means $a-r\lt x\lt a+r$. Comfort with powers of $2$ ($2^5=32$, $2^{10}=1024$) will speed up the counting. If you have not yet read the welcome page, start there: it explains how the quick checks, predictions, speed drills and Exam corners in every section work.