Relations & Functions is an important chapter in Class 12 Maths Chapter 1 and lays the foundation for higher-level topics like calculus , matrices , and mapping-based questions .
This chapter focuses on key concepts such as relations , types of functions (one-one, onto, invertible) , composition of functions , and properties of relations , explained using clear logic and proofs.
These NCERT Solutions for Class 12 Maths Chapter 1 – Relations & Functions include important board-level questions and are explained step by step in simple language to help students build strong conceptual clarity and score well in examinations.
NCERT Solutions for Class 12 Maths Chapter 1 – Relations & Functions
Q.
L e t r m A r m = r m R − { 3 } r m a n d r m B r m = r m R − { 1 } . r m C o n s i d e r r m t h e r m f u n c t i o n r m f : r m A → B r m d e f i n e d r m b y f ( x ) = x − 2 x − 3 . r m I s r m f r m o n e − o n e r m a n d r m o n t o ? r m J u s t i f y r m y o u r r m a n s w e r . L e t rm{ } A rm{ } = rm{ } R - \{ 3 \} rm{ } a n d rm{ } B rm{ } = rm{ } R - \{ 1 \} . rm{ } C o n s i d e r rm{ } t h e rm{ } f u n c t i o n rm{ } \\ f : rm{ } A \rightarrow B rm{ } d e f i n e d rm{ } b y { } f \left(\right. x \left.\right) = \frac{x - 2}{x - 3} . rm{ } I s rm{ } f rm{ } o n e - o n e rm{ } a n d rm{ } o n t o ? rm{ } \\ J u s t i f y rm{ } y o u r rm{ } a n s w e r . L e t r m A r m = r m R − { 3 } r m an d r m B r m = r m R − { 1 } . r m C o n s i d err m t h er m f u n c t i o n r m f : r m A → B r m d e f in e d r m b y f ( x ) = x − 3 x − 2 . r m I sr m f r m o n e − o n er m an d r m o n t o ? r m J u s t i f yr m yo u rr m an s w er .
Q.
Determine whether or not each of the definition of given below gives a binary operation. In the event that * is not a binary operation, give justification for this.
(i) On Z+ , define * by a * b = a − b
(ii) On Z+ , define * by a * b = ab
(iii) On R, define * by a * b = ab 2
(iv) On Z+ , define * by a * b = |a − b |
(v) On Z+ , define * by a * b = a
Q.
G i v e n t w o f u n c t i o n s f : N → N a n d g : N → N s u c h t h a t f ( x ) = x + 1 a n d g ( x ) = { x − 1 , i f x > 1 x + 1 , i f x < 1. \begin{array}{l}\mathrm{Given}\space \mathrm{two}\space \mathrm{functions}\space \mathrm{f} :\mathrm {N} \to \mathrm{N}\space \mathrm{and}\space \mathrm{g} : \mathrm{N} \to \mathrm{N}\space \mathrm{such\; that}\space \mathrm{f}(\mathrm{x})=\mathrm{x}+1\mathrm{\;and}\mathrm{\space}\mathrm{g}\left(\mathrm{x}\right)=\{\begin{array}{l}\mathrm{x}-1,\space\space\space\space\mathrm{\space}\mathrm{if \;x}\; > 1\\ \mathrm{x}+1,\space\space\space\space\mathrm{\space}\mathrm{if\;x}<\;1.\end{array}\end{array} Given two functions f : N → N and g : N → N such that f ( x ) = x + 1 and g ( x ) = { x − 1 , if x > 1 x + 1 , if x < 1. Show that
g o f gof g o f is onto but
f is not onto.
Q.
L e t f : R → R b e d e f i n e d a s f ( x ) = 10 x + 7. F i n d t h e f u n c t i o n g : R → R s u c h t h a t g o f = f o g = I R . \begin{array}{l}\mathrm{Let}\space \mathrm{f}:\mathrm{R}\to \mathrm{R}\space \mathrm{be}\space \mathrm{defined}\space \mathrm{as}\space \mathrm{f}\left(\mathrm{x}\right)=10\mathrm{x}+7.\mathrm{Find}\space \mathrm{the}\space \mathrm{function}\\ \mathrm{g}:\mathrm{R}\to \mathrm{R}\space \mathrm{such}\space \mathrm{that}\space \mathrm{go}\space \mathrm{f}=\mathrm{fog}={\mathrm{I}}_{\mathrm{R}}.\end{array} Let f : R → R be defined as f ( x ) = 10 x + 7. Find the function g : R → R such that go f = fog = I R .
Q.
L e t A = N × N a n d ∗ b e t h e b i n a r y o p e r a t i o n o n A d e f i n e d b y ( a , b ) ∗ ( c , d ) = ( a + c , b + d ) S h o w t h a t ∗ i s c o m m u t a t i v e a n d a s s o c i a t i v e . F i n d t h e i d e n t i t y e l e m e n t f o r ∗ o n A , i f a n y . \begin{array}{l}\mathrm{Let}\quad \mathrm{A}=\mathrm{N}\times \mathrm{Nand}*\mathrm{be}\quad \mathrm{the}\quad \mathrm{binary}\quad \mathrm{operation}\quad \mathrm{on}\quad \mathrm{A}\quad \mathrm{defined}\quad \mathrm{by}\\ (\mathrm{a},\quad \mathrm{b})*(\mathrm{c},\quad \mathrm{d})=(\mathrm{a}+\mathrm{c},\quad \mathrm{b}+\mathrm{d})\\ \mathrm{Show}\quad \mathrm{that}\quad *\mathrm{is}\quad \mathrm{commutative}\quad \mathrm{and}\quad \mathrm{associative}.\quad \mathrm{Find}\quad \mathrm{the}\mathrm{\quad }\\ \mathrm{identity}\quad \mathrm{element}\quad \mathrm{for}*\mathrm{onA},\quad \mathrm{if}\quad \mathrm{any}.\end{array} Let A = N × Nand ∗ be the binary operation on A defined by ( a , b ) ∗ ( c , d ) = ( a + c , b + d ) Show that ∗ is commutative and associative . Find the identity element for ∗ onA , if any .
Q.
Let * be the binary operation on N defined bya * b = H.C.F. of a and b . Is * commutative? Is * associative? Does there exist identity for this binary operation on N?
Q.
L e t ∗ b e t h e b i n a r y o p e r a t i o n o n N g i v e n b y a ∗ b = L . C . M . o f a a n d b . F i n d ( i ) 5 ∗ 7 , 20 ∗ 16 ( i i ) I s ∗ c o m m u t a t i v e ? ( i i i ) I s ∗ a s s o c i a t i v e ? ( i v ) F i n d t h e i d e n t i t y o f ∗ i n N ( v ) W h i c h e l e m e n t s o f N a r e i n v e r t i b l e f o r t h e o p e r a t i o n ∗ ? \begin{array}{l}\mathrm{Let}\quad *\quad \mathrm{be}\quad \mathrm{the}\quad \mathrm{binary}\quad \mathrm{operation}\quad \mathrm{on}\quad \mathrm{Ngiven}\quad \mathrm{by}\quad \mathrm{a}*\mathrm{b}=\mathrm{L}.\mathrm{C}.\mathrm{M}.\quad \mathrm{of}\quad \mathrm{a}\\ \mathrm{and}\quad \mathrm{b}.\quad \mathrm{Find}\\ \left(\mathrm{i}\right)\quad 5*7,20*16\\ \left(\mathrm{ii}\right)\quad \mathrm{Is}*\mathrm{commutative}?\\ \left(\mathrm{iii}\right)\quad \mathrm{Is}*\mathrm{associative}?\\ \left(\mathrm{iv}\right)\quad \mathrm{Find}\quad \mathrm{the}\quad \mathrm{identity}\quad \mathrm{of}*\mathrm{in}\quad \mathrm{N}\\ \left(\mathrm{v}\right)\quad \mathrm{Which}\quad \mathrm{element}\quad \mathrm{so}\quad \mathrm{f}\quad \mathrm{Narein}\quad \mathrm{vertible}\quad \mathrm{f}\quad \mathrm{or}\quad \mathrm{the}\quad \mathrm{operation}*?\end{array} Let ∗ be the binary operation on Ngiven by a ∗ b = L . C . M . of a and b . Find ( i ) 5 ∗ 7 , 20 ∗ 16 ( ii ) Is ∗ commutative ? ( iii ) Is ∗ associative ? ( iv ) Find the identity of ∗ in N ( v ) Which element so f Narein vertible f or the operation ∗ ?
Q.
C o n s i d e r t h e b i n a r y o p e r a t i o n a n d o n t h e s e t { 1 , 2 , 3 , 4 , 5 } d e f i n e d b y a a n d b = m i n { a , b } . W r i t e t h e o p e r a t i o n t a b l e o f t h e o p e r a t i o n a n d . \begin{array}{l}\mathrm{Consider}\space \mathrm{the}\space \mathrm{binary}\space \mathrm{operation}\space \mathrm{and} \space \mathrm{on}\space \mathrm{theset}\space \{1,\space 2,\space 3,\space 4,\space 5\}\\ \mathrm{definedby}\space\space\mathrm{a}\mathrm{and} \mathrm{b}=\mathrm{min}\{\mathrm{a},\mathrm{b}\}.\mathrm{Write}\space \mathrm{the}\space \mathrm{operation}\space \mathrm{table}\\ \mathrm{of}\space \mathrm{the}\space \mathrm{operation}\space \mathrm{and} .\end{array} Consider the binary operation and on theset { 1 , 2 , 3 , 4 , 5 } definedby a and b = min { a , b } . Write the operation table of the operation and .
Q.
F o r e a c h b i n a r y o p e r a t i o n ∗ d e f i n e d b e l o w , d e t e r m i n e w h e t h e r ∗ i s c o m m u t a t i v e o r a s s o c i a t i v e . ( i ) O n Z , d e f i n e a ∗ b = a − b ( i i ) O n Q , d e f i n e a ∗ b = a b + 1 ( i i i ) O n Q , d e f i n e a ∗ b = a b 2 ( i v ) O n Z + , d e f i n e a ∗ b = 2 a b ( v ) O n Z + , d e f i n e a ∗ b = a b ( v i ) O n R − { − 1 } , d e f i n e a ∗ b = a b + 1 \begin{array}{l}\mathrm{For}\quad \mathrm{each}\quad \mathrm{binary}\quad \mathrm{operation}*\mathrm{defined}\quad \mathrm{below},\quad \mathrm{determine}\\ \mathrm{whether}\quad *\mathrm{is}\quad \mathrm{commutative}\quad \mathrm{or}\quad \mathrm{associative}.\\ \hspace{0.17em}\hspace{0.17em}\mathrm{\hspace{0.17em}}\left(\mathrm{i}\right)\quad \mathrm{On}\quad \mathrm{Z},\quad \mathrm{definea}*\mathrm{b}=\mathrm{a}-\mathrm{b}\\ \mathrm{\hspace{0.17em}}\left(\mathrm{ii}\right)\mathrm{\quad }\mathrm{On}\quad \mathrm{Q},\quad \mathrm{definea}*\mathrm{b}=\mathrm{ab}+1\\ \left(\mathrm{iii}\right)\quad \mathrm{OnQ},\quad \mathrm{definea}*\mathrm{b}=\frac{\mathrm{ab}}{2}\\ \mathrm{\quad }\left(\mathrm{iv}\right)\quad {\mathrm{OnZ}}^{+},\quad \mathrm{definea}*\mathrm{b}={2}^{\mathrm{ab}}\\ \left(\mathrm{v}\right)\quad {\mathrm{OnZ}}^{+},\quad \mathrm{definea}*\mathrm{b}={\mathrm{a}}^{\mathrm{b}}\\ \left(\mathrm{vi}\right)\mathrm{\hspace{0.17em}}\mathrm{OnR}-\{-1\},\quad \mathrm{definea}*\mathrm{b}=\frac{\mathrm{a}}{\mathrm{b}+1}\end{array} For each binary operation ∗ defined below , determine whether ∗ is commutative or associative . ( i ) On Z , definea ∗ b = a − b ( ii ) On Q , definea ∗ b = ab + 1 ( iii ) OnQ , definea ∗ b = 2 ab ( iv ) OnZ + , definea ∗ b = 2 ab ( v ) OnZ + , definea ∗ b = a b ( vi ) OnR − { − 1 } , definea ∗ b = b + 1 a
Q.
L e t f : R − { − 4 3 } → R b e a f u n c t i o n d e f i n e d a s f ( x ) = 4 x 3 x + 4 . T h e i n v e r s e o f f i s m a p g : R a n g e f → R − { − 4 3 } g i v e n b y ( A ) g ( y ) = 3 y 3 − 4 y ( B ) g ( y ) = 4 y 4 − 3 y ( C ) g ( y ) = 4 y 3 − 4 y ( D ) g ( y ) = 3 y 4 − 3 y \begin{array}{l}\mathrm{Let}\hspace{0.17em}\hspace{0.17em}\mathrm{f}:\mathrm{R}-\{-\frac{4}{3}\}\to \mathrm{R}\quad \mathrm{be}\quad \mathrm{a}\quad \mathrm{function}\quad \mathrm{defined}\quad \mathrm{as}\quad \mathrm{f}\left(\mathrm{x}\right)\quad =\frac{4\mathrm{x}}{3\mathrm{x}+4}.\\ \mathrm{The}\quad \mathrm{inverse}\quad \mathrm{of}\quad \mathrm{f}\quad \mathrm{is}\quad \mathrm{map}\quad \mathrm{g}:\quad \mathrm{R}\quad \mathrm{ange}\quad \mathrm{f}\to \mathrm{R}-\{-\frac{4}{3}\}\quad \mathrm{given}\quad \mathrm{by}\\ \left(\mathrm{A}\right)\mathrm{\hspace{0.17em}}\mathrm{g}\left(\mathrm{y}\right)=\frac{3\mathrm{y}}{3-4\mathrm{y}}\left(\mathrm{B}\right)\mathrm{\hspace{0.17em}}\mathrm{g}\left(\mathrm{y}\right)=\frac{4\mathrm{y}}{4-3\mathrm{y}}\\ \left(\mathrm{C}\right)\mathrm{\hspace{0.17em}}\mathrm{g}\left(\mathrm{y}\right)=\frac{4\mathrm{y}}{3-4\mathrm{y}}\left(\mathrm{D}\right)\mathrm{g}\left(\mathrm{y}\right)=\frac{3\mathrm{y}}{4-3\mathrm{y}}\end{array} Let f : R − { − 3 4 } → R be a function defined as f ( x ) = 3 x + 4 4 x . The inverse of f is map g : R ange f → R − { − 3 4 } given by ( A ) g ( y ) = 3 − 4 y 3 y ( B ) g ( y ) = 4 − 3 y 4 y ( C ) g ( y ) = 3 − 4 y 4 y ( D ) g ( y ) = 4 − 3 y 3 y
Q.
L e t f : R → R b e d e f i n e d a s f ( x ) = x 4 . C h o o s e t h e c o r r e c t a n s w e r . ( A ) f i s o n e − o n e o n t o ( B ) f i s m a n y − o n e o n t o . ( C ) f i s o n e − o n e b u t n o t o n t o ( D ) f i s n e i t h e r o n e − o n e n o r o n t o . \begin{array}{l}\mathrm{Letf}:\mathrm{R}\to \mathrm{R}\quad \mathrm{be}\quad \mathrm{defined}\quad \mathrm{as}\quad \mathrm{f}\left(\mathrm{x}\right)={\mathrm{x}}^{4}.\quad \mathrm{Choose}\quad \mathrm{the}\quad \mathrm{correct}\\ \mathrm{answer}.\\ \left(\mathrm{A}\right)\quad \mathrm{f}\quad \mathrm{is}\quad \mathrm{one}-\mathrm{one}\quad \mathrm{onto}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\mathrm{\hspace{0.17em}}\left(\mathrm{B}\right)\mathrm{fismany}-\mathrm{one}\quad \mathrm{onto}.\\ (\mathrm{C}\quad )\mathrm{f}\quad \mathrm{is}\quad \mathrm{one}-\mathrm{one}\quad \mathrm{but}\quad \mathrm{not}\quad \mathrm{onto}\hspace{0.17em}\hspace{0.17em}\left(\mathrm{D}\right)\mathrm{f}\quad \mathrm{is}\quad \mathrm{n}\quad \mathrm{either}\quad \mathrm{one}-\mathrm{one}\quad \\ \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \mathrm{noronto}.\end{array} Letf : R → R be defined as f ( x ) = x 4 . Choose the correct answer . ( A ) f is one − one onto ( B ) fismany − one onto . ( C ) f is one − one but not onto ( D ) f is n either one − one noronto .
Q.
I f f : R → R b e g i v e n b y , f ( x ) = ( 3 − x 3 ) 1 3 t h e n f o f ( x ) i s ( A ) x 1 3 ( B ) x 3 ( C ) x ( D ) ( 3 − x 3 ) . \begin{array}{l}\mathrm{If}\quad \mathrm{f}:\quad \mathrm{R}\to \mathrm{R}\quad \mathrm{be}\quad \mathrm{given}\quad \mathrm{by},\quad \mathrm{f}\left(\mathrm{x}\right)={(3-{\mathrm{x}}^{3})}^{\frac{1}{3}}\mathrm{\hspace{0.17em}}\mathrm{then}\quad \mathrm{f}\quad \mathrm{of}\quad \left(\mathrm{x}\right)\quad \mathrm{is}\\ \left(\mathrm{A}\right){\mathrm{x}}^{\frac{1}{3}}\hspace{0.17em}\hspace{0.17em}\left(\mathrm{B}\right){\mathrm{x}}^{3}\left(\mathrm{C}\right)\quad \mathrm{x}\left(\mathrm{D}\right)\quad (3-{\mathrm{x}}^{3}).\end{array} If f : R → R be given by , f ( x ) = ( 3 − x 3 ) 3 1 then f of ( x ) is ( A ) x 3 1 ( B ) x 3 ( C ) x ( D ) ( 3 − x 3 ) .
Q.
L e t f : X → Y b e a n i n v e r t i b l e f u n c t i o n . S h o w t h a t t h e i n v e r s e o f f − 1 i s f , i . e . , ( f − 1 ) − 1 = f . \begin{array}{l}\mathrm{Let}\quad \mathrm{f}:\mathrm{X}\to \mathrm{Y}\quad \mathrm{be}\quad \mathrm{aninvertible}\quad \mathrm{function}.\quad \mathrm{Show}\quad \mathrm{that}\quad \mathrm{the}\quad \mathrm{inverse}\\ \mathrm{of}\quad {\mathrm{f}}^{-1}\quad \mathrm{is}\quad \mathrm{f},\mathrm{i}.\mathrm{e}.,\quad {\left({\mathrm{f}}^{-1}\right)}^{-1}=\mathrm{f}.\end{array} Let f : X → Y be aninvertible function . Show that the inverse of f − 1 is f , i . e . , ( f − 1 ) − 1 = f .
Q.
L e t f : X → Y b e a n i n v e r t i b l e f u n c t i o n . S h o w t h a t f h a s u n i q u e i n v e r s e . {Let f :X→Y be an invertible function.Show that f has unique inverse.} L e t f : X → Y b e an in v er t ib l e f u n c t i o n . S h o w t ha t f ha s u ni q u e in v erse .
Q.
C o n s i d e r r m f : r m R + → r m [ − 5 , r m ∞ ) r m g i v e n r m b y r m f ( x ) r m = r m 9 x 2 r m + r m 6 x − 5. r m S h o w r m t h a t r m f r m i s r m i n v e r t i b l e r m w i t h r m f − 1 ( y ) = ( ( y + 6 ) − 1 3 ) . C o n s i d e r rm{ } f : rm{ } R_{+} \rightarrow rm{ } \left[\right. - 5 , rm{ } \infty \left.\right) rm{ } g i v e n rm{ } b y rm{ } f \left(\right. x \left.\right) rm{ } = rm{ } 9 x^{2} rm{ } + rm{ } 6 x - 5 . rm{ } \\ S h o w rm{ } t h a t rm{ } f rm{ } i s rm{ } i n v e r t i b l e rm{ } w i t h rm{ } f^{- 1} \left(\right. y \left.\right) = \left(\right. \frac{\left(\right. \sqrt{y + 6} \left.\right) - 1}{3} \left.\right) . C o n s i d err m f : r m R + → r m [ − 5 , r m ∞ ) r m g i v e n r m b yr m f ( x ) r m = r m 9 x 2 r m + r m 6 x − 5. r m S h o w r m t ha t r m f r m i sr m in v er t ib l er m w i t h r m f − 1 ( y ) = ( 3 ( y + 6 ) − 1 ) .
Q.
C o n s i d e r f : R → R g i v e n b y f ( x ) = 4 x + 3. S h o w t h a t f i s i n v e r t i b l e . F i n d t h e i n v e r s e o f f . \begin{array}{l}\mathrm{Consider}\quad \mathrm{f}\quad :\quad \mathrm{R}\to \quad \mathrm{Rgiven}\quad \mathrm{by}\quad \mathrm{f}\left(\mathrm{x}\right)=4\mathrm{x}+3.\quad \mathrm{Show}\quad \mathrm{that}\quad \mathrm{f}\quad \mathrm{is}\\ \mathrm{invertible}.\quad \mathrm{Find}\quad \mathrm{the}\quad \mathrm{inverse}\quad \mathrm{off}.\end{array} Consider f : R → Rgiven by f ( x ) = 4 x + 3. Show that f is invertible . Find the inverse off .
Q.
Let f , g and h be functions from R to R. Show that
(f + g)oh = foh + goh
(f. g)oh = (foh) . (goh)
Q.
L e t f : { 1 , 3 , 4 } → { 1 , 2 , 5 } a n d g : { 1 , 2 , 5 } → { 1 , 3 } b e g i v e n b y f = { ( 1 , 2 ) , ( 3 , 5 ) , ( 4 , 1 ) } a n d g = { ( 1 , 3 ) , ( 2 , 3 ) , ( 5 , 1 ) } . W r i t e d o w n g o f . \begin{array}{l}\mathrm{Let}\quad \mathrm{f}:\quad \{1,3,4\}\to \{1,\quad 2,\quad 5\}\quad \mathrm{and}\quad \mathrm{g}:\{1,\quad 2,\quad 5\}\to \{1,\quad 3\}\mathrm{be}\quad \mathrm{given}\\ \mathrm{by}\quad \mathrm{f}=\left\{\right(1,\quad 2),(3,\quad 5),(4,\quad 1\left)\right\}\quad \mathrm{and}\quad \mathrm{g}=\left\{\right(1,\quad 3),\quad (2,\quad 3),\quad (5,1\left)\right\}.\\ \mathrm{Write}\quad \mathrm{down}\quad \mathrm{go}\quad \mathrm{f}.\end{array} Let f : { 1 , 3 , 4 } → { 1 , 2 , 5 } and g : { 1 , 2 , 5 } → { 1 , 3 } be given by f = { ( 1 , 2 ) , ( 3 , 5 ) , ( 4 , 1 ) } and g = { ( 1 , 3 ) , ( 2 , 3 ) , ( 5 , 1 ) } . Write down go f .
Q.
L e t f : R → R b e d e f i n e d a s f ( x ) = 3 x . C h o o s e t h e c o r r e c t a n s w e r . ( A ) f i s o n e − o n e o n t o ( B ) f i s m a n y − o n e o n t o ( C ) f i s o n e − o n e b u t n o t o n t o ( D ) f i s n e i t h e r o n e − o n e n o r o n t o . \begin{array}{l}\mathrm{Let}\quad \mathrm{f}:\mathrm{R}\to \mathrm{R}\quad \mathrm{be}\quad \mathrm{defined}\quad \mathrm{asf}\left(\mathrm{x}\right)=3\mathrm{x}.\mathrm{Choose}\quad \mathrm{the}\quad \mathrm{correct}\\ \mathrm{answer}.\\ \left(\mathrm{A}\right)\mathrm{f}\hspace{0.17em}\hspace{0.17em}\mathrm{isone}-\mathrm{one}\quad \mathrm{onto}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\hspace{0.17em}\quad \quad \quad \quad \quad \quad \quad \quad \quad \hspace{0.17em}\hspace{0.17em}\mathrm{\hspace{0.17em}}\left(\mathrm{B}\right)\mathrm{f}\hspace{0.17em}\hspace{0.17em}\mathrm{is}\quad \mathrm{many}-\mathrm{one}\quad \mathrm{on}\quad \mathrm{to}\\ \left(\mathrm{C}\right)\mathrm{f}\hspace{0.17em}\hspace{0.17em}\mathrm{isone}-\mathrm{one}\quad \mathrm{but}\quad \mathrm{not}\quad \mathrm{onto}\quad \; \quad \; \quad \left(\mathrm{D}\right)\mathrm{f}\mathrm{\hspace{0.17em}}\mathrm{is}\quad \mathrm{neither}\quad \mathrm{one}-\mathrm{one}\quad \mathrm{nor}\quad \mathrm{onto}.\end{array} Let f : R → R be defined asf ( x ) = 3 x . Choose the correct answer . ( A ) f isone − one onto ( B ) f is many − one on to ( C ) f isone − one but not onto ( D ) f is neither one − one nor onto .
Q.
Given a non empty set X, consider P(X) which is the set of all subsets of X. Define the relation R in P(X) as follows: For subsets A, B in P(X), ARB if and only
A ⊂ B A\subset B A ⊂ B . Is R an equivalence relatio on P(X)? Justify your answer.
NCERT Solutions for Class 12 Maths Chapter 1 – Relations & Functions
Q1.
Given two functions f:N→N and g:N→N such that f(x)=x+1 and
g(x)=x−1, if x>1x+1, if x<1.
Show that gof is onto but f is not onto.
Ans:
Given f(x)=x+1.
Step 1: Show that f is not onto
Range of f is {2,3,4,...} because for any x∈N, f(x)=x+1 ≥ 2.
But 1 ∈ N and there is no x ∈ N such that f(x)=1 (since x+1=1 gives x=0, not in N).
Hence, f is not onto .
Step 2: Find (g∘f)(x)
(g∘f)(x)=g(f(x))=g(x+1).
For x∈N, x+1 > 1 always, so we use g(t)=t−1 when t>1.
Therefore, g(x+1)=(x+1)−1=x.
So, (g∘f)(x)=x for all x∈N.
Step 3: Show that g∘f is onto
Let y∈N. Choose x=y. Then (g∘f)(x)=x=y.
So every y∈N has a preimage.
Hence, g∘f is onto .
Q2.
Let A = R − {3} and B = R − {1}. Consider the function f:A→B defined by
f(x) = (x − 1)/(x − 3). Is f one-one and onto? Justify your answer.
Ans:
Given f(x)= (x−1)/(x−3), domain A=R−{3}, codomain B=R−{1}.
1) Check one-one (injective)
Assume f(x1)=f(x2). Then
(x1−1)/(x1−3) = (x2−1)/(x2−3).
Cross-multiplying:
(x1−1)(x2−3) = (x2−1)(x1−3).
Expand both sides:
x1x2 − 3x1 − x2 + 3 = x1x2 − 3x2 − x1 + 3
Cancel x1x2 and 3 from both sides:
−3x1 − x2 = −3x2 − x1
Bring like terms together:
−3x1 + x1 = −3x2 + x2
−2x1 = −2x2
x1 = x2
Hence, f is one-one .
2) Check onto (surjective)
Let y ∈ B (i.e., y ≠ 1). We must find x ∈ A such that f(x)=y.
y = (x−1)/(x−3)
⇒ y(x−3)=x−1
⇒ yx − 3y = x − 1
⇒ yx − x = 3y − 1
⇒ x(y−1)=3y−1
⇒ x = (3y−1)/(y−1).
Since y ≠ 1, denominator (y−1) ≠ 0, so x is defined.
Now check x ≠ 3 (so that x ∈ A):
If x=3, then (3y−1)/(y−1)=3
⇒ 3y−1 = 3y−3, which gives −1 = −3 (impossible).
So x ≠ 3 always.
Therefore, for every y ∈ B, there exists x ∈ A such that f(x)=y.
Hence, f is onto .
Conclusion: f is one-one and onto .
Q3.
Let f, g and h be functions from R to R. Show that
(f + g)∘h = f∘h + g∘h
(f · g)∘h = (f∘h) · (g∘h)
Ans:
Let x ∈ R.
(i) Prove (f+g)∘h = f∘h + g∘h
LHS:
((f+g)∘h)(x) = (f+g)(h(x))
= f(h(x)) + g(h(x))
RHS:
(f∘h + g∘h)(x) = (f∘h)(x) + (g∘h)(x)
= f(h(x)) + g(h(x))
Hence, LHS = RHS. Therefore, (f + g)∘h = f∘h + g∘h.
(ii) Prove (f·g)∘h = (f∘h)·(g∘h)
LHS:
((f·g)∘h)(x) = (f·g)(h(x))
= f(h(x)) · g(h(x))
RHS:
((f∘h)·(g∘h))(x) = (f∘h)(x) · (g∘h)(x)
= f(h(x)) · g(h(x))
Hence, LHS = RHS. Therefore, (f·g)∘h = (f∘h)·(g∘h).
Q4.
Consider f:R+ → [−5, ∞) given by f(x)=9x²+6x−5.
Show that f is invertible with f⁻¹(y) = ( √(y+6) − 1 ) / 3.
Ans:
Given f(x)=9x²+6x−5, where x ∈ R+.
Step 1: Show f is one-one on R+
f'(x)=18x+6.
For x>0, 18x+6 > 0, so f is strictly increasing on R+.
Hence, f is one-one on R+ and therefore invertible on its range.
Step 2: Find inverse
Put y = 9x²+6x−5.
y+5 = 9x²+6x
Complete the square:
9x²+6x = 9(x² + (2/3)x)
= 9[(x + 1/3)² − (1/9)]
= 9(x + 1/3)² − 1
So, y+5 = 9(x + 1/3)² − 1
⇒ y+6 = 9(x + 1/3)²
⇒ (y+6)/9 = (x + 1/3)²
Since x ∈ R+, take positive square root:
√(y+6)/3 = x + 1/3
⇒ x = ( √(y+6) − 1 )/3
Therefore, f⁻¹(y) = ( √(y+6) − 1 ) / 3 .
Q5.
Consider the binary operation * on the set {1,2,3,4,5} defined by
a*b = min{a,b}. Write the operation table of *.
Ans:
Since a*b = min{a,b}, each entry is the smaller of the row number and column number.
*
1
2
3
4
5
1
1
1
1
1
1
2
1
2
2
2
2
3
1
2
3
3
3
4
1
2
3
4
4
5
1
2
3
4
5
Q6.
Let f:R→R be defined as f(x)=10x+7. Find g:R→R such that g∘f = f∘g = IR .
Ans:
Since g∘f = IR , g is the inverse of f.
Let y = f(x) = 10x+7.
Solve for x:
10x = y−7
x = (y−7)/10
Therefore, f⁻¹(y) = (y−7)/10.
Hence, g(x) = (x−7)/10 .
Now check:
g(f(x)) = g(10x+7) = (10x+7−7)/10 = x.
f(g(x)) = f((x−7)/10) = 10((x−7)/10)+7 = x.
So, g∘f = f∘g = IR .
Q7.
Given a non-empty set X, consider P(X) (set of all subsets of X). Define relation R in P(X) as:
For A, B ∈ P(X), ARB if and only if A ⊂ B.
Is R an equivalence relation on P(X)? Justify your answer.
Ans:
For R to be an equivalence relation, it must be reflexive, symmetric, and transitive .
Reflexive: For any A, we must have ARA i.e., A ⊂ A.
But A ⊂ A is false (a set is not a proper subset of itself).
So, R is not reflexive .
Since reflexive property fails, R cannot be an equivalence relation.
Conclusion: R is not an equivalence relation on P(X).
Q8.
Let f:R→R be defined as f(x)=x⁴. Choose the correct answer:
(A) f is one-one onto
(B) f is many-one onto
(C) f is one-one but not onto
(D) f is neither one-one nor onto
Ans:
f(x)=x⁴.
Not one-one: Because f(1)=1 and f(−1)=1, but 1 ≠ −1. So f is many-one.
Not onto: Range of x⁴ is [0, ∞). But codomain is R, so negative numbers are not achieved.
Hence, f is not onto.
Therefore, the correct option is (D) f is neither one-one nor onto .
Q9.
Let f:R→R be defined as f(x)=3x. Choose the correct answer:
(A) f is one-one onto
(B) f is many-one onto
(C) f is one-one but not onto
(D) f is neither one-one nor onto
Ans:
f(x)=3x.
One-one: If 3x1=3x2 then x1=x2.
Onto: For any y ∈ R, choose x = y/3 ∈ R. Then f(x)=3(y/3)=y.
Hence, f is one-one and onto .
Correct option: (A)
Q10.
Let f:{1,3,4}→{1,2,5} and g:{1,2,5}→{1,3} be given by
f={(1,2),(3,5),(4,1)} and g={(1,3),(2,3),(5,1)}. Write down g∘f.
Ans:
We need g(f(x)) for each x in domain {1,3,4}.
f(1)=2 ⇒ g(2)=3, so (g∘f)(1)=3
f(3)=5 ⇒ g(5)=1, so (g∘f)(3)=1
f(4)=1 ⇒ g(1)=3, so (g∘f)(4)=3
Therefore,
g∘f = {(1,3),(3,1),(4,3)} .
FAQs – Relations & Functions
1) One-one aur onto function mein difference kya hai?
One-one : different inputs → different outputs. Onto : codomain ka har element image hota hai.
2) Invertible function kaise pehchane?
Function invertible tab hota hai jab wo one-one ho (aur given codomain/range ke hisaab se inverse define ho sake).
3) Composition (g∘f) ka matlab kya hota hai?
Pehle f apply hota hai, phir uske output par g: (g∘f)(x)=g(f(x)) .
4) Equivalence relation ke 3 conditions kya hain?
Reflexive, Symmetric, Transitive — teeno satisfy kare tab equivalence relation hota hai.
5) x⁴ function R→R onto kyun nahi hota?
Kyuki x⁴ ka output kabhi negative nahi aata, isliye R ke negative numbers cover nahi hote.