UNIT- 1

RELATIONS AND FUNCTIONS

Recall all the definition of the chapter relation and functions which have been discussed in class XI.

ORDERED PAIR: Two elements a and b listed in a specified order,form an ordered pair,denoted by (a,b).In
an ordered pair (a ,b); a is regarded as the first element and b is regarded as the second element.

Note : 1(a,b) ≠(b,a)

2) Equality of ordered pairs (a,b)=(c,d) iff a=c , b=d.

CARTESIAN PRODUCT OF TWO SETS:Let A and B be two non empty sets.the set of all ordered pairs
(a,b) such that a ∈ A∧b ∈ B is called the Cartesian products of set A and B and is denoted by A × BThus ,
A × B= { ( a , b ) :a ∈ A∧b ∈ B } .

Example: If A={ 1,2,3 }∧B= { c , d } then A × B= { (1 , c ) , ( 1 , d ) , ( 2 , c ) . ( 2 , d ) . ( 3 , c ) . ( 3 , d ) } .

Note : 1)B× A={( b , a ) :b ∈ B∧∈a ∈ A }.

2)if A=∅∨B=∅ the A × B=∅ .
3) A × B ≠ B × A .
4)If n ( A ) =m∧n ( B )=n , then n ( A × B ) =mn .
5)If n ( A ) =m∧n ( B )=n ,then number of subsets of A × B=2mn.
6)
RELATION: Let A and B be two sets.Then a relation R from a set A to set B is a subset of A × B .Thus,R is a
relation from A to B ⇔R ⊆ A × B .
NOTE:1)If R is a relation from a non-empty set A to B and (a,b)∈ R ,then we write aRb which is read as “a is
related to b by the relation R”.If (a,b)does not belong to R ,then we write “a is not related to b by the relation R.

2)If n ( A ) =m∧n ( B )=n ,then number of relations from A ¿ B is 2mn and no.of non-empty relations are
2mn−1.

3) Since ∅ is subset of every set ,therefore ∅ is also a relation from a set A to set B and is called the
empty relation and the smallest relation from a set A to set B.

4) Since every set is subset of itself ,therefore A × B ⊆ A × B,thus A × B is also a relation from a set A to
set B and is known as universal relation from a set A to set B .It is also known as the largest relation from asset
A to set B.

DOMAIN AND RANGE OF A RELATION: Let R be relation from a set A to a set B.Then the set of all the
first components or co-ordinates of the ordered pairs belonging to R is called the DOMAIN and the set of all
the second components or co-ordinates is called the RANGE of a relation R.

Note: RELATION ON A SET: Let A be the only non-empty set .then any subset of A × A is called a relation
on set A .

INVERSE OF A RELATION: Let A and B be two sets and R be relation from a set A to set B .Then ,the
inverse of R is denoted by R−1 ,is a relation from B to A nad is defined by R−1 ={ ( b , a ) : ( a , b ) ∈ R } .

Note:1)( a , b ) ∈ R iff (b ,a)∈ R−1.

2)Domain(R)= Range ( R−1 ¿ and Range (R) = Domain( R−1 ¿.

TYPES OF RELATIONS: In this section ,we intend to discuss various types of relations on a single set.

Reflexive Relation: A relation R on a set A is said to be reflexive if every element of A is related to itself.
Thus, R is reflexive iff ( a , a ) ∈ R ∀ a ∈ A.

Symmetric relation:A relationR on set A is said to be symmetric relation iff( a , b ) ∈ R ⟹ ( b , a ) ∈ R ∀ a , b ∈ R .

Transitive relation: A relation R on set A is said to be transitive iff

( a , b ) ∈ R∧( b , c ) ∈ R ⟹ ( a ,c ) ∈ R , ∀ a , b , c ∈ R .

Note: If (a ,b)∈ R but ( b , a ) ∉ R ,then also R is a transitive relation.

Equivalence Relation: A relation R on set A is said to be equivalence relation iff

i. R is reflexive
ii. R is symmetric
iii. R is transitive.

Anti-symmetric relation: Let A be any set.A relation R on set A is said to anti-symmetric relation iff
( a , b ) ∈ R∧( b , a ) ∈ R ⟹ a=b ∀ a , b∈ A .

Note: If (a ,b)∈ R but ( b , a ) ∉ R ,then also R is an anti-symmetric relation.

Partial order relation: A relation R is said to be anti-symmetric relation iff

i. R is reflexive
ii. R is anti-symmetric
iii. R is transitive.

QUESTIONS BASED ON THE ABOVE TOPIC:

Q1.Three relations R1 , R 2∧R3 are defined on the set A={a,b,c} as follows

(i) R1 = { (a,a),(a,b),(a,c),(b,b),(b,c),(c,a),(c,b),(c,c)}
(ii) R2 = { (a,b),(b,a),(a,c),(c,a)}
(iii) R3 = { (a,b),(b,c),(c,a)}.
Find whether each of R1 , R 2∧R3 is reflexive, symmetric and transitive.
Q2.Show that the relation R on the set A = {1,2,3} given by R= { (1,1),(2,2),(3,3),(1,2),(2,3)} is reflexive
but neither reflexive but neither symmetric nor transitive .
Q3.Show that the relation R on the set A={1,2,3} given by R = {(1,2).(2,1)} is symmetric but neither
reflexive nor transitive.
Q4.Check the following relations R and S for reflexivity,symmetry and transitivity:i)aRb iff b is divisible
by a where a,b ∈ N . ii ¿ l1 S l 2 iff l 1 is perpendicular ¿ l 2 ,where l 1∧l 2 are straight lines in a plane.
Q5.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.
Q6.Show that the relation R on the set Z of all integers defined by (x,y)∈ R ⇔ ( x− y ) is divisible by 3 is an
equivalence relation.

Relations and Functions (Topic: Equivalence Relation)

Q1.Let R be a relation on the set of all lines in a plane defined by (l 1 ,l 2 ¿∈ R ↔line l 1 is parallel to the line l 2
.Show that R is an equivalence relation.
Q2.Show that the relation ‘is congruent to ‘ on the set of all triangles in a plane is an equivalence relation.
Q3.Show that the relation R defined on the set of all triangles in a plane as R = {(T 1,T 2 ¿ : T 1 is similar ¿ T 2 } is an
equivalence relation.
Q4.Prove that the relation R on the set Z of all integers numbers defined by (x,y)∈ R ↔ x− yis divisible by n, is
an equivalence relation on Z.
Q5.Show that the relation R on the set A of all the books in a library of a college given by R
¿ {( x , y ) : x∧ y have same no . of pages },is an equivalence relation.
Q6.Show that the relation R on the set A ={1,2,3,4,5},given by R={(a ,b):|a−b| is even},is an equivalence
relation .Show that all the elements of {1,2,3} are related to each other and all the elements of {2,4} are
related to each other. But no elements of {1.3.5}is related to any elements of {2,4}.
Q7.Show that the relation R on the set A = { x ∈ Z ; 0 ≤ x ≤12 }={0,1,2,3,4,5,6,7,8,9,10,11,12},given by R=
{(a,b):|a−b|is a multiple of 4 } is an equivalence relation. Find the set of all elements related to 1.
Q8.Show that the relation R on the set A of points in a plane ,given by R={(P,Q):Distance of the point P from
the origin is same as the distance of the point Q from the origin},is an equivalence relation.Further show
j876tfcxthat the set of all points related to a point to a point P≠(0,0) is the circle passing through P with
origin as centre.
Q9.Prove that the relation R on the set N × N defined by (a,b)R(c,d) iff a+ d=b+ c for all (a,b),(c,d)∈ N × N .
Q10. Let N be the set of all natural numbers and let R be relation on N × N ,defined by (a,b)R(c,d) iff ad=bc
for all (a,b),(c,d)∈ N × N .
Q11. Let N denote the set of all natural numbers and R be the relation on N × N defined by (a,b) R (c,d) iff
ad (b+c) = bc (a+b).Check whether R is an equivalence relation on N × N .
Q12. Prove that the relation “congruence modulo m” on the set Z of all integers is an equivalence relation.
Q13. If R and S are two equivalence relations on a set A ,then R∩S is also an equivalence relation on set A.
Q14. If R is an equivalence relation on a set A, then R−1 is also an equivalence relation on set A.
Q15. Let Z be the set of integers.Show that the relation R= {(a,b):a,b∈ Z and a+b is even }is an equivalence
relation on Z.
Q16. Let S be a relation on the set R of all the real nos.defined by S ={(a,b)∈ R × R : a2+ b2=1 }.Prove that S is
not an equivalence relation on R.
Q17. If R and S are equivalence relations on a set A then prove that R∪S may not be an equivalence relation.
Q18. Let L be the set of all lines in XY-plane and R be the relation in L defined as R = {( L1 , L2 ¿: L1 is∥¿ L2 }.
Show that R is an equivalence relation.Find the set of all lines related to the line y=2 x +4.
Q19. Given a non-empty set X ,consider P(X) which is the set of all subsets of X .Define a relation in P(X) as
follows: For subsets A,B in P(X), A R B If Ais⊂of B .Is R an equivalence relation on P(X)?Justify your
answer.

TOPIC:FUNCTIONS

DEF.Let A and B be two non empty sets.A relation f from a set A to set B i.e.a subset of A × B is called a
function from A to B if
i) for each a ∈ A ∃ b ∈ B such that ( a ,b)∈ f
(ii) ( a , b ) ∈ fand ( a , c ) ∈ fthen b=c .
OR
Let A and B be two non-empty sets.then a function f from a set A to set B is a rule or method or
correspondence which associates every element of set A with unique element of set B.It is denoted by f : A → B
and is read as f is a function from a set A to set B.
Note: 1) If f : A → B is a function such that f ( x )= y ,then y is called the image of x and x is called the pre-image
of y.

2) The set A is called the domain of the function and the set B is called the co-domain of the function.
The set of all the elements of set B which has pre-image in set A is called the range of the function. Thus,
f ( A )={ f ( x ) : x ∈ A }=range of f .

3)If A and B are two sets having m and n elements respectively,then total numbers of function from A
to B is n m .
 4)A function f : A → B is called a real valued function if B is subset of set of real numbers R. If A and B
both are subsets of R (set of real no.) then f is called a real function.

KINDS OF FUNCTION:

1) ONE –ONE FUNCTION (INJECTION) OR INJECTIVE FUNCTION.

A function f : A → Bis said to be one –one function if different elements of set A has different image in set B.
OR
A function f : A → Bis said to be one –one function if for all a , b ∈ A such that f ( a )=f ( b ) ⟹ a=b .
OR
A function f : A → Bis said to be one –one function if for all a , b ∈ A such that a ≠ b ⟹ f ( a ) ≠ f ( b ) .

2) ONTO FUNCTION (SURJECTION) OR SURJECTIVE FUNCTION.

A function f : A → Bis said to be onto function if every element of set B has pre-image in set A .
OR
A function f : A → Bis said to be onto function if ∀ y ∈ B ∃ x ∈ A such that f ( x ) = y .

Relations and Functions ( TOPIC : FUNCTIONS )

Q1. Let A be the set of all 50 students of class XII in a central school.Let f : A → N be a function defined by
f ( x )=Roll number of student x .Show that f is one-one but not onto.
Q2. Show that the function f : N → N ,given by f ( x )=2 x , is one-one but not onto.
Q3. Show that the function f : R → R, given by f ( x )=2 x ,is one-one and onto.
Q4. Show that the function f : R → R, defined as f ( x )=x 2 ,is neither one-one nor onto.
Q5. Show that the function f : R → R ,defined as f ( x )=x 3 ,is a bijection.
1
Q6. Show that the function f : R 0 → R 0 ,defined as f ( x )= ,is one-one onto,where R0 is the set of all non-zero
x
real numbers. Is the result is true, if the domain R0 is replaced by N with co-domain being same as R0.
Q7. Prove that the greatest integers function f : R → R ,given by f ( x )= [ x ] , is neither one-one nor onto, where [
x] denotes the greatest integer less than or equal to x .
Q8. Show that the modulus function f : R → R , given by ( x )=|x| , is neither one-one nor onto.
Q9. Let C and R be the set of all complex numbers and all real numbers respectively.Then show that f :C → R
given by f ( z )=| z|,∀ z ∈C is neither one-one nor onto.
Q10. Show that the function f : R → R ,given by f ( x )=ax+ b ,where a,b∈ R,a ≠ 0 is a bijection.
Q11. Show that the function f : R → R,given by f ( x )=cosx,∀ x ∈ R ,is neither one-one nor onto.
x−1
Q12. Let A=R− {2 } ∧B=R− {1 } .If f : A → B is a mapping defined by f ( x )= ,show that f is bijective.
x−2
x
Q13. Show that the function f : R → {x ∈ R:−1< x <1 } defined by f ( x )= , x ∈ R is one-one onto function.
1+|x|
Q14. Let A and B be two sets such that f : A × B → B × A defined by f ( a ,b )=(b , a) is a bijection.
Q15. Let A be any non-empty set .Then ,prove that the identity function on set A is a bijection.
Q16. Show that the function f : R → R given by f ( x )=x 3 + x is a bijection.
n+ 1
Q17. Show that f : N → N defined by f ( n ) =
{
2
n
2
, if n is odd

, if n is even
is many-one onto function.

Q18. Show that the function f : N → N given by f ( n )=n−(−1 )n for all n ∈ N is a bijection.
Q19. Let f : N −{ 1 } → N be defined by,f ( n )=t h e h ig h est prim e factor of n.Show that f is neither one-one nor
onto . Find the range of f .
n+1 ,if n iseven
Q20. Let f : N ∪ { 0 } → N ∪{0} be defined by f ( n )= {n−1, if n is odd
.Show that f is bijection.
Q21. Let A be a finite set .If f : A → A is a one-one function,show that f is onto also.
Q22. Let A be a finite se t.If f : A → A is an onto function,show that f is one one also.
Q23. Let A={1,2}.Find all the one to one functions from A to A.
Q24. Consider the identity function I N : N → N defined by I N ( x )=x ∀ x ∈ N .
π π
[ ] [ ]
Q25. Consider the function f : 0 , → R ,given by f ( x )=sinx and g : 0 , → R given by g ( x )=cosx .Show
2 2
that f ∧gare one-one,but f +g is not one-one.
Q26. Show that f : R → R ,given by f ( x )=x− [ x ] , is neither one-one nor onto.

COMPOSITION OF FUNCTIONS:

DEF.Let f : A → B∧g :B → Cbe two functions.Then a function gof : A → C defined by (

gof ¿ ( x )=g ( f ( x ) ) ∀ x ∈ A . is called the composition of f ∧g .
Note: 1)gof exists iff the range of f is subset of domain of g.
2)fog exists if range of g is a subset of domain of f.

PROPERTIES OF COMPOSITION OF FUNCTION:

1)The composition of functions is not commutataive.

2)the composition of function is associative i.e. if f , g , hare three functions such that (fog ¿ oh∧fo ( goh) exist (
fog ¿ oh=fo ( goh ) .

3)The composition of two bijections is a bijection i.e.if f and g are bijective function,then gof is also bijective.

4)let f : A → B . then fo I A=I B Of =fi . e . the composition of any function with the identity function is the
function itself.

5)let f : A → B , g :B → A be two functions such that gof =I A.Then,f is an injection and g is surjection.

6)let f : A → B , g :B → A be two functions such that fog=I B .Then,f is a surjection and g is an injection.

7) let f : A → B , g :B → A be two functions.Then ,

i. gof : A → C ⟹ g: B →C is onto .
ii. gof : A → C is one−one ⟹ f : A → B is one−one .
iii. gof : A → C is onto∧g :B → C is one−one ⟹ f : A → B is onto.
iv. gof : A → C is one−one∧f : A → B is onto ⟹ g :B → C is one one .

INVERSE OF A FUNCTION:

Let f : A → B be a bijection.Then a function g :B → A which associates each element y ∈ B to a unique element

x ∈ A such that f ( x )= y is called the inverse of f . i.e.f ( x )= y ⇔ g ( y )=x . The inverse of f is generally denoted
by f −1.

Note:1)If f : A → B is a bijection,then f −1 : B → A is such that f ( x )= y ⇔ f −1 ( y )=x .

 2)a function f : A → Bis also said to be invertible iff f is bijective i.e. one –one and onto.

METHOD TO FIND THE INVERSE:

Let f : A → B be a bijection.To find the inverse of f we follow the following steps:

STEP 1: Put f ( x )= y , where y ∈ B∧x ∈ A .

STEP 2: Solvef ( x )= y to obtain x in terms of y.

STEP 3: In the relation obtained in step II replace x by f −1 ( y ) to obtain the required inverse of f .

PROPERTIES OF INVERSE OF A FUNCTION:

1) The inverse of bijection is unique.

2) The inverse of a bijection is also a bijection.

3) If f : A → Bis a bijection and g :B → A is the inverse of f,then fog=I B∧gof =I A where I A∧I B are the identity
functions on the sets A and B.

4) If f : A → B∧g :B → C are two bijections , then gof : A →C is a b ijection∧ ( gof )−1 =f −1 o g−1 .

5) If f : A → B∧g :B → Abe two functions such that gof =I A ∧fog=I B .Then f ∧gare bijections and g=f −1 .

NOTE:Followinf algorithm is also used to find the inverse of invertible functions:

ALGORITHM:

STEP 1)Obtain the function and check its bijectivity.

STEP 2)If f is a bijection,then it is invertible.In order to find the inverse of f ,put fo f −1 ( x )=x ⟹ f ( f −1 ( x ) ) =x .

STEP 3)Use the formula for f(x) and replace x by f −1 ( x ) in it to obtain LHS of f ( f −1 ( x ) )=x .Solve the equation
for f −1 ( x ) ¿ get f −1 .

QUESTIONS BASED ON THE ABOVE TOPIC:

Q1.Prove that the function f : R → R defined as f ( x )=2 x−3 is invertible and find f −1.
Q2.Show that the function f : R → R is given by f ( x )=x 2 +1 is not invertible.
x
Q3.Show that f : R−{−1 } → R−{ 1 } givenby f ( x )= is invertible .Also find f −1.
x +1
Q4.If the function f : [ 1 , ∞ ) → [ 1 , ∞ ) defined by f ( x )=2 x ( x−1 ) is invertible ,find f −1 ( x ) .
2 x−1
Q5.Show that the function f : R → Rdefined by f ( x )= , x ∈ R is one one and onto.Also find the inverse
3
of f.
4 x +3 2 2
Q6.If f ( x )= , x ≠ ,show that f 0 f ( x ) =x , ∀ x ≠ .What is inverse of f.
6 x−4 3 3
−4 −4 4 x+3
Q7.Consider f : R− { }
3
→ R−{
3
} given by f ( x )=
3 x+ 4
.S how that f is bijective.Find the inverse of f

and hence find f −1 ( 0 )∧x such that f −1 ( x )=2.

Q8.Let f : N → N be a function defined as f ( x )=9 x 2 +6 x−5.Show that f : N → S,where S is the range of f,is
invertible.Find the inverse of f and hence find f −1 ( 43 )∧f −1 ( 163 ) .
Q9.Let f :¿ → R be a function defined as f ( x )=9 x 2 +6 x−5.Prove that f is not invertible.Modify,only the co-
domain of f to make f invertible and then find its inverse.
Q10.Consider f : R+ ¿→¿ ¿ be a function defined as f ( x )=9 x 2 +6 x−5.Show that f is invertible. Find the
inverse of f.
Q11.Find the value of the parameter α for which the function f ( x )=1+ αx , α ≠0 is the inverse of itself.
Q12.Let f : N → Y be a function defined as f ( x )=4 x +3 , whe ℜ Y ={ y ∈ N : y =4 x +3 for some x ∈ N }.Show
that f is invertible. Find its inverse.
Q13.Let Y ={n2 :n ∈ N }⸦ N .Consider f : N → Y given by f ( n )=n2 .Show that f is invertible. Find the inverse
of f.
x
Q14.Show that f : [−1.1 ] → R , givenby f ( x )= is one one.Find the inverse of the function
x +1
f : [−1,1 ] → Range ( f ) .
Q15.Let f : R → R be defined as f ( x )=10 x +7.Find the function g : R → R such that fog=gof =I R .
Q16.Consider f : R+ ¿→¿ ¿ given by f ( x )=x 2 +4 .Show that f is invertible with inverse f −1 of f given by
f −1 ( x )= √ x−4, where R is the set of all non-negative real numbers.
+¿ ¿

x−2
Q17.Let A =R-{3} and B =R-{1}.Consider the function f : A → B defined by f ( x )= .Show that f is
x−3
one-one and onto and hence find f −1 .
Q18.If f : R → R∧g : R → R be functions defined by f ( x )=x 2 +1∧g ( x )=sinx , thenfind fog∧gof .
Q19.If f ( x )= √ x ( x >0 )∧g ( x ) =x 2−1 are two real functions,find fog∧gof . Is fog=gof .
Q20. Let A={−1,0,1,2 } . B= {−4.−2,0,2 }∧f , g : A → B be functions defined by
1
| |
f ( x )=x 2−x , x ∈ A∧g ( x )=2 x− −1, x ∈ A .
2