XII- Relations and Functions
XII- Relations and Functions
Relations
relation R and we wrie
it as
say that a is related to b under the
If(a, b) ¬ R, we
'a Rb'. to any
called an enpty relation, if
no element of Ais related
A relation R in a set A is
clement ofA, i.e. R = . related to
called a universal relation, if each element ofA is
Arelation R in a set Ais
every element ofA, 1.e. R =A
X A.
called:
Arelation R in a set A is
Reflexive, if (a, a) e R, for every aE A.
Symmetric, if (a,,a,) e R implies that (ag, a,)
e R for alla,, a, e A.
Transitive, if (a,. az) e Rand (a,, a4) e Rimplies that (a,
az) e Rfor all a,, az, ag EA.
relation if Ris reflexive, symmetric
Arelation R in aset Ais said to be an equivalence
and transitive.
andne S, then the equivalence class of n.
1fR is an equivalence relation on a set S,
S:xRn}
denoted as (n], is defined as (2] = {xe
equivalence relation on
1fR is an equivalence relation on a set A, then R is also an
set A
Functions
A function f: X Yis defined to be one-one (or injective), if the images of distinct
elements ofX under faredistinct, ie.,for every x, x e X,f*) =fug) implies x, =
X,. Otherwise, f is called many-one.
Afunction f:X’ Yis said to be onto (or surjective), if every element of Yis the
image of some element of X under f, ie. for every y e Y, there exists an element xin
X such that /(x) =y.
Afunction f:X’ Yis said to be bijective iff is both one-one and onto.
> Let f:A’ Band let x, y e A. Then x = y fx) = fo) is always true from the
definition of function and so this fact can not be used to prove injectivity of a
funcion. To prove injectivity of function, we use f(r) =f() ’x=y.
Composition of Functions
º Iff:A’B and g :B ’Care one-one function, then gof:A ’C is one-one function.
> Iff:A ’Band g: B ’Care onto function, then gof:A ’Cis onto function.
> The composiion of any function with the identity function is the function itself.
Invertible Function
Iffis invertible, then fmust be one-one and onto and iff is
must be inverible.
one-one and onto then
Iff: X’Y and g:Y’Zare two invertible functions. Then gof is also an
funcion with (gof)=[og. invertible
The inverse of an invertible (bijective)
function is unique.
The inverse of abijective funcion is also a
bijective function.
Iff:A ’ Bis a bijetive funcion andg:B ’A is
fog = I, where I, and are identity inverse of f, then gof = l and
º Iff:A ’ Bis an invertible
funcions, on sets Aand B respectively.
function, then inverse of f is fie.(f=f
º If be the inverse of f, hen fof
=['of = I.
The graph of a function and its inverse
are always symmeric with
y= xi.e. graph of afuncion and its respect to the line
y= x.
inveTSe are images of each other about the line
6 Mathematics-XIl
eCommon Mislakes (CM) MIND MAP
Sudents get conhused between the terms co-domain and range.
Always rcmcmlber that he range is always a subset of co-domain.
Students sometimes gct confuscd between identity rclation and reflexive relation.
Areflexive relation R on a set Ais a relation where every element of the set is related to itself.
In other words, for every element ain set A, (a, a) must be in the relation i.e. Vae A, (a, a) ¬ R
An identity relation I in a set Ais a special type of reflexive relation where only each element is
related to itself. and no other pairs are included, ie. I ={(a, a): a e A}
Students often mistakenly view a relation as non-transitive if (a, b) is present in the relation but
b. ) isnot, which is incorrect. If corresponding to (a, b) e Rwe do not have (b, c) eRto check
ir transitivity thenwe say that R is a transitivc relation
Students often make the mistake of providing examples where formal proof is required.
Examples are typically used todisprOve or countera given statement.
RNe a statcment, we must rely on a general explanation or formal reasoning.
Suudents sometimes confuse many-one functions with onto functions.
Suppose afunctionf:X ’
Y
Kisan onto function, every element of Yis the image of some element of Xunder f.
Ifis amany-one function, not every element of Yis necessarily associated with an element of X.
Sudents get confused in understanding the mapping of composite functions.
fof = fV) ’ fis input inf gog = gg(x)) ’gis input in g
fog = figlx) gis input inf ’ fis input in g
Identity function in domain off
’ Identity function in domain off
Q140. Arelation Rdefined on set A={x:*eZ and 0<xs 10} as R= {(, y) : x= y}is given
to be an equivalence relation. The number of equivalence classes is:
(a) 1 (b) 2 (c) 10 (d) 11
[CBSE 2024 (65/1/2)]
I92. Let A= (1, 3, 5). Then the number of equivalencerelations in Acontaining (1, 3) is:
(a) 1 (c) 3 (d) 4
(b) 2 [CBSE 2020 (65/2/1)]
Q143. Let fe) =/log (2x -*). Then, domain off is:
(c) (-0, 1] (d) None of these
(a) (0, 2) (b) [1, 2]
[HOTS)
numbers) defined
*14. Afunctionf: R. R (where R. is the set of all non-negative real
by f(«) = 4x + 3 is:
(6) onto but not one-one
(a) one-one but not onto
(d) neither one-one nor onto
(c) both one-one and onto (CBSE 2024 (65/1/1)]
Q145. Assertion (A) : The number of onto functions from a set P containing 5 elements
set Q containing 2 elements is 30. to a
Q 148. Check if the relation R in the set R of real numbers deined as R = {(a, b) : a <hs
(2) symmetric, (i2) transitive. [CBSE 2020 (65/5/1), (65/5/2), (65/5/3)
Q149. Show that the relation R in the set A = {1, 2, 3, 4, 5, 6} given by R ={(a, b) : la - b| is
divisible by 2} is an equivalence relation. [CBSE 2020 (65/3/1), (65/3/2), (65/3/3)|
O 150. Check whether the relation R in the set Z of integers defined as R = {a, b) : a t b
is divisible by 2"} is reflexive, symmetric or transitive. Write the equivalence clasS
containing 0, i.e. [0]. [CBSE SÌP 2021]
O151. Check whether the relation R in the set R of real numbers, defined
by
R= {a, b) : 1+ ab > 0}, is reflexive, symmetric or transitive. [CBSE SOP 2019]
Q152. A relation Ron set A= {-4, -3, -2,-1,0, 1,2,3.4} be defined as R = {(x,
y) : x +y 1s an
integer divisible by 2}. Show that R is an equivalence relation. Also, write the equivalente
class [2] [CBSE 2024 (65/3/1)]
3x
part (), what changes can be
fx) = 8-5x becomes a function? (CFQby CESE]
1 Mathematics-XII
Prove that the function fis surjetive, wheref:N ’N such that
Q156.
if n is odd
9
fn) =
if n is even
18. A person without family is not complete in this world because family is an integral part of all of us
Human beings are considered as the social animals living in group called as family. Family plays many
important roles throughout the life.
Mr. D.N. Sharma is an honest person who is living happily with his
family. He has a son Vidya and a daughter Madhulika. Mr. Vidya
has 2 sons Tarun and Gajender and a daughter Suman while Mrs.
Madhulika has 2 sons Shashank and Pradeep and 2 daughters
Sweety and Anju. They all lived together and everyone shares
equal responsibilities within the family. Every member of the family
emotionally attaches to each other in their happiness and sadness.
They help each other in their bad times which give the feeling of
security.
Alamily provides love, warmth and security to its all members throughout the life which makes 1t
a complete lamily. Agood and healthy family makes a good society and ultimately a good sooCiety
involves in making a good country.
Based on the above information, answer the
following questions:
Consider relation Rin he set A of members of Mr. D. N. Sharma and his family at a particular time:
() 11R = {(0,)): x and y live in the same locality}, then show that R is
rellexive Telde
(0) I1 R= {(x, y) :x is exactly 7 cm aller than y}, then show that R is not
symmetet
(m) 1fR= {(x, ):x is wife of y}, then show that R is
transitive.
Mathematics-XII
LetA beethe
set of male members of afamily, A =(Grand father, Father, Son) and B he the set of their
19. B =(Model I, Model 2, Model 3)
diflerent models,
3 cars of
Grand father
Model 1
Father Model 2
Model 3
Son