0% found this document useful (0 votes)
69 views170 pages

Relation & Functions 4th June

Relation and functions

Uploaded by

Saksham Sethi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
69 views170 pages

Relation & Functions 4th June

Relation and functions

Uploaded by

Saksham Sethi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 170

Relations and Functions

● Relations
● Types of Relations
● Functions and its classifications
● Composition of Functions
● Inverse of a function
Relations and Functions
Critical Topics in the Chapter
● Types of relations
● Composition of functions
Relations
Relations
Lets first do the basic recall of relations, we covered in 11th.
Relations
Cartesian Product of two sets:
Let A and B be two non-empty sets.
The Cartesian product of the sets A and B is defined as
A × B = { (a, b) : a ∈ A and b ∈ B }
Relations
Cartesian Product of two sets:
Let A and B be two non-empty sets.
The Cartesian product of the sets A and B is defined as
A × B = { (a, b) : a ∈ A and b ∈ B }

Relation:
Any subset of A × B is defined as a relation from set A to set B,

where A and B are non-empty sets


Relations
Relation:
Any subset of A × B is defined as a relation from set A to set B,

where A and B are non-empty sets

Remark :
Relation from A to A is also called relation on A.
Relations
Description of relations
There are three ways of writing a relation.
Let us do it by examples

Let A = {1, 2, 3} & B = {1, 3, 5, 7}

(1) R = {(1,1), (2, 3), (3, 5)}


Relations
Description of relations
There are three ways of writing a relation.
Let us do it by examples

Let A = {1, 2, 3} & B = {1, 3, 5, 7}

(1) R = {(1,1), (2, 3), (3, 5)}

(or)

(2) R = {(a, b) | b = 2a – 1, a ∈ A and b ∈ B}


Relations
Description of relations
There are three ways of writing a relation.
Let us do it by examples

Let A = {1, 2, 3} & B = {1, 3, 5, 7}

(1) R = {(1,1), (2, 3), (3, 5)}

(or)

(2) R = {(a, b) | b = 2a – 1, a ∈ A and b ∈ B}

(or)

(3) a R b ⇔ b = 2a – 1; a ∈ A and b ∈ B
Q Let A = {1, 2, 3, …, 14}. Define a relation R from A to A by
R = {(x, y): x - 3y = 0, where x, y ∈ A}. Write down the
domain, codomain and range of R.
Solution:

We have, A = {1, 2, 3, …. , 14}


R = {(x, y) : x = 3y , x, y ∈ A}
= {(3, 1), (6, 2), (9, 3), (12, 4)}

Domain of R = {3, 6, 9, 12}


Range of R = {1, 2, 3, 4}
Codomain of R is set A.
Write relation on A defined as: xRy ⇔ y = x2 , where
Q
A = {1, -1, 2, 3, 4}. Also write domain and range of R.
Solution:

We have, A = {1, -1, 2, 3, 4}


R = {(x, y) : y = x2 , x, y ∈ A}
= {(1, 1), (-1, 1), (2, 4)}

Domain of R = {1, -1, 2}


Range of R = {1, 4}
Relations

Result :
If n(A) = p and n(B) = q then number of relations that
can be defined from A to B is 2pq.
Relations
Inverse of Relation
If R is a relation on set A, then the relation R−1 on A ,defined by
R−1 = {(y, x) : (x, y) ∈ R} is called an inverse relation to A.
Clearly,

Domain (R−1) = Range of (R)


Range of (R−1) = domain of (R).
If A = {1, 2, 3} and B = {1, 3, 5}, and R is a relation from
Q
A to B, defined as x R y ⇔ y = 2x - 1, then Find the
inverse relation R-1
Solution:
R is a relation from {1, 2, 3} to {1, 3, 5} defined by y = 2x - 1
Now, y = 2x - 1
Putting x = 1, 2, 3, we get y = 1, 3, 5 respectively
⇒ (1, 1) ∈ R, (2, 3) ∈ R and (3, 5) ∈ R
So, R = {(1, 1), (2, 3), (3, 5)}
Thus, R-1 = {(1, 1), (3, 2), (5, 3)}
Q Find the inverse relation R-1 if R is a relation from
{11, 12, 13} to {8, 10, 12} defined by y = x - 3.
Solution:

R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x - 3


Now, y = x - 3
Putting x = 11, 12, 13, we get y = 8, 9, 10 respectively
⇒ {11, 8} ∈ R, (12, 9) ∉ R and (13, 10) ∈ R
Thus, R = {(11, 8), (13, 10)}
⇒ R-1 = {(8, 11), (10, 13)}
Now we start with the Relations Topic of 12th syllabus, which
primarily covers Types of relation.
Types of Relations
Types of Relations
(1) Empty Relation: Let A be a set and ɸ ⊂ A ✕ A, it follows that ɸ is a
relation on A which is called the empty relation.

(2) Universal Relation: Let A be a set and A ✕ A ⊆ A ✕ A, it follows that


A ✕ A is a relation on A, which is called the universal relation.

(3) Identity Relation: If every element of A is related to itself only, then


the relation is called identity relation.
Symbolically, the relation IA = {(a, a) : a ∈ A} is called an Identity
relation on A.
Types of Relations
4. Reflexive Relation
Types of Relations
4. Reflexive Relation

A Relation R on a set A is said to be reflexive, if every element of A is related to


itself. Thus if R is reflexive, then (a, a) ∈ R, ∀ a ∈ A.
Types of Relations
4. Reflexive Relation

A Relation R on a set A is said to be reflexive, if every element of A is related to


itself. Thus if R is reflexive, then (a, a) ∈ R, ∀ a ∈ A.

For example,

1) let A = {1, 2, 3,4} then R = {(1,1), (2,2), (3,3), (4,4), (1,2), (2,4)}

2) let A = {1, 2, 3,4} then R = {(1,1), (2,2), (3,3), (4,4)}

3) let A = {1, 2, 3} then R1 = {(x, y) | y ≥ x} is a reflexive relation on A.


Types of Relations
5. Symmetric Relation
Types of Relations
5. Symmetric Relation

A relation R on a set A is said to be a symmetric relation iff


(a, b) ∈ R ⇒ (b, a) ∈ R, ∀ a, b ∈ A
Types of Relations
5. Symmetric Relation

A relation R on a set A is said to be a symmetric relation iff


(a, b) ∈ R ⇒ (b, a) ∈ R, ∀ a, b ∈ A

For example, let A = {2, 4, 6} then


R = {(2, 4), (2, 6), (4, 4), (4, 2), (6, 2)} is a symmetric relation on A.
Types of Relations
6. Transitive Relation
Types of Relations
6. Transitive Relation
Relation R on set A is transitive if xRy and yRz ⇒ xRz
Types of Relations
6. Transitive Relation
Relation R on set A is transitive if xRy and yRz ⇒ xRz

NOTE :
Relation is NOT transitive only when x R y and y R z, but .
In all other situations R is Transitive.
Types of Relations
6. Transitive Relation
Relation R on set A is transitive if xRy and yRz ⇒ xRz

Let A = {1, 2, 3, 4, 5}

(1) R1 = {(1, 2), (2, 3), (1, 3)}

(2) R2 = {(1, 2), (2, 3), (1, 3), (4, 5), (5, 1)}

(3) R3 = {(1, 3), (2, 4)}


Types of Relations
6. Transitive Relation
Relation R on set A is transitive if xRy and yRz ⇒ xRz

Let A = {1, 2, 3, 4, 5}

(1) R1 = {(1, 2), (2, 3), (1, 3)} : It is transitive relation.

(2) R2 = {(1, 2), (2, 3), (1, 3), (4, 5), (5, 1)} : It is not a transitive relation.

(3) R3 = {(1, 3), (2, 4)} : It is transitive relation.


If a relation R on the set {1, 2, 3} be defined by
Q
(i) R = {(1, 2)}, then R is:
Solution: (ii)R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}, then R is:
IIT 2005

Q Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)}
be a relation on A = {3, 6, 9, 12}. Relation R is

A Reflexive and transitive only

B Reflexive only

C An equivalence relation

D Reflexive and symmetric only


IIT 2005

Q Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3, 12), (3, 6)}
be a relation on A = {3, 6, 9, 12}. Relation R is

A Reflexive and transitive only

B Reflexive only

C An equivalence relation

D Reflexive and symmetric only


Solution:

Given A = {3, 6, 9, 12}


Since (3, 3), (6, 6), (9, 9), (12, 12) ∈ R
Thus its reflexive relation (12, 6) ∉ R
Here, (6, 12) ∈ R, but
Thus R is not symmetric
Here, (3, 6) ∈ R and (6, 12) ∈ R, also (3, 12) ∈ R
So relation is transitive also.
Consider the binary relation R on the set A = {a, b, c} given by
Q
R = {(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)}. Then R is
Consider the binary relation R on the set A = {a, b, c} given by
Q
R = {(a, b), (b, a), (c, c), (c, a), (a, a), (b, b), (a, c)}. Then R is

Ans: reflexive and symmetric but not transitive


JEE Main 6th Apr, 2024-S2

Q Let A = {1, 2, 3, 4, 5}. Let R be a relation on A defined by xRy if and only if


4x ≤ 5y. Let m be the number of elements in R and n be the minimum
number of elements from A x A that are required to be added to R to
make it symmetric. Then m + n is equal to :

A 24

B 23

C 25

D 26
JEE Main 6th Apr, 2024-S2

Q Let A = {1, 2, 3, 4, 5}. Let R be a relation on A defined by xRy if and only if


4x ≤ 5y. Let m be the number of elements in R and n be the minimum
number of elements from A x A that are required to be added to R to
make it symmetric. Then m + n is equal to :

A 24

B 23

C 25

D 26
Solution:

Given : 4x ≤ 5y, then


R = {(1, 1), (1, 2), (1, 3), (1, 4), (1, 5), (2, 2), (2, 3), (2, 4), (2, 5),
(3, 3), (3, 4), (3, 5), (4, 4), (4, 5), (5, 4), (5, 5)}
So, m = 16

Now to make R a symmetric relation we have to add

{(2, 1), (3, 2), (4, 3), (3, 1), (4, 2), (5, 3), (4, 1), (5, 2), (5, 1)}

i.e. n = 9

So m + n = 25
JEE Main 30th Jan, 2023-S1

Q The minimum number of elements that must be added to


the relation R = {(a, b), (b, c)} on the set {a, b, c} so that it
becomes symmetric and transitive is :

A 3

B 4

C 5

D 7
JEE Main 30th Jan, 2023-S1

Q The minimum number of elements that must be added to


the relation R = {(a, b), (b, c)} on the set {a, b, c} so that it
becomes symmetric and transitive is :

A 3

B 4

C 5

D 7
Solution:

R={(a, b), (b, c)}

For symmetric relation (b, a), (c, b) must be added in R

For transitive relation (a, c), (a, a), (b, b), (c, c), (c, a) must be added in R

So, minimum number of element = 7


Consider a relation of whole numbers defined as
Q
x R y ⇔ x ≤ y2. Prove that its reflexive but neither
symmetric nor transitive.
Solution:

Clearly, it is reflexive as (a, a) ∈ R as a ≤ a2


But, if (1, 2) ∈ R
Then (2, 1) ∉ R
So it is not symmetric
Now, let us consider
(5, 3) ∈ R, (3, 2) ∈ R
But (5, 2) ∉ R
Thus R is not transitive.
Let S be the set of all real numbers. Show that the
Q
relation R = {(a, b) : 1 + ab > 0} on S is reflexive
and symmetric but not transitive.
Solution:

Since 1 + a . a = 1 + a2 > 0, ∀ a ∈ S
∴ (a, a) ∈ R
∴ R is reflexive
Also, (a, b) ∈ R ⇒ 1 + ab > 0 ⇒ 1 + ba > 0
⇒ (b, a) ∈ R
∴ R is symmetric
∵ (a, b) ∈ R and (b, c) ∈ R need not imply (a, c) ∈ R.
As (0.25, -3) ∈ R and (-3, -4) ∈ R but (0.25, -4) ∉ R.
So, R is not transitive
Q The relation R given by {(x, y) : x2 - 3xy + 2y2 = 0, ∀ x, y ∈ R} is

A Reflexive only

Reflexive and Symmetric but


B not transitive

Symmetric and transitive but


C not reflexive

Reflexive and transitive but


D not symmetric
Q The relation R given by {(x, y) : x2 - 3xy + 2y2 = 0, ∀ x, y ∈ R} is

A Reflexive only

Reflexive and Symmetric but


B not transitive

Symmetric and transitive but


C not reflexive

Reflexive and transitive but


D not symmetric
Solution:
Q Let R be a relation on N × N defined by (a, b) R (c, d)
if and only if ad(b - c) = bc(a - d). Then R is

A Only reflexive

B Only Symmetric

C Both reflexive and symmetric

D Neither reflexive nor symmetric


Q Let R be a relation on N × N defined by (a, b) R (c, d)
if and only if ad(b - c) = bc(a - d). Then R is

A Only reflexive

B Only Symmetric

C Both reflexive and symmetric

D Neither reflexive nor symmetric


Solution:
Types of Relations
7. Equivalence Relation

Relation R defined on any set A is equivalence relation if


R is reflexive
R is symmetric
R is transitive
Q Let R be a relation defined on N as x R y
if 3x + 11y is a multiple of 7, x, y ∊ N. Then R is

A an equivalence relation

B transitive but not symmetric

C not reflexive

D symmetric but not transitive


Q Let R be a relation defined on N as x R y
if 3x + 11y is a multiple of 7, x, y ∊ N. Then R is

A an equivalence relation

B transitive but not symmetric

C not reflexive

D symmetric but not transitive


Solution:
For R to be reflexive, (x, x) ∈ R If (x, y) ∈ R and (y, z) ∈ R, then
⇒ 3x + 11x = 14x, which is a multiple of 7 3x + 11y = 7m, 3y + 11z = 7n
∴ R is reflexive ⇒ 3x + 14y + 11z = 7(m + n)
⇒ 3x + 11z = 7(m + n) - 14y
If (x, y) ∈ R, then ⇒ 3x + 11z = 7(m + n - 2y)
3x + 11y = 7m ∴ (x, z) ∈ R
Now, 14(x + y) = 7n Hence, R is Transitive
3x + 11y + 3y + 11x = 7n
∴ 3y + 11x = 7(n - m)
∴ (y, x) ∈ R
Hence, R is symmetric
Show that relation R defined on the set A = {0 , 1 , 2 , …. , 12}
Q
given by R = {(a, b) | a − b is multiple of 4} is an equivalence
relation. Also find elements related to 3.
Solution:
A = {0, 1, 2, …., 12} Transitivity: Let a, b, c ∈ A

R = {(a, b) | a − b is multiple of 4} Such that (a, b) ∈ R and (b, c) ∈ R

Reflexivity: For any a ∈ A ∴ a − b is multiple of 4

(a, a) ∈ R and (b − c) is multiple of 4

As, a − a = 0 is multiple of 4. ∴ (a − b) = 4λ, and (b − c) = 4𝜇

So, R is reflexive. for some λ, 𝜇 ∈ N


Add these equations
Symmetric: Let a, b ∈ A Such that (a, b) ∈ R
a − b + b − c = 4λ + 4𝜇
∴ a − b is multiple of 4
a − c = 4(λ + 𝜇)
⇒ a − b = 4λ for some λ ∈ z
So, (a − c) is multiple of 4
∴ (b − a) = 4(−λ)
Thus, it is transitive
So, (b − a) is multiple of 4 ⇒ (b − a) ∈ R
So, R is an equivalence relation.
It is symmetric
Solution:

Elements related to 3
Let x be the element of A such that (x, 3) ∈ R
Then (x − 3) is multiple of 4
∴ (x − 3) = 0, 4, 8, 12, ….
⇒ x = 3, 7, 11, 15, …
set A = {0, 1, 2, …. , 12}
x = 3, 7, 11
Q (a) Let A = {3, 5,6}. Then the number of reflexive
relations on set A is ______.
(b) Let B = {1, 2, 3, 4}. Then the number of
symmetric relations on set B is ______.
(c) Let C = {a, b, c, d}. Then the number of
equivalence relations on set C is ______.

Result :
(i) number of reflexive relations =
(ii) number of symmetric relations =
(iii) number of reflexive & symmetric relations =
Q (a) Let A = {3, 5,6}. Then the number of reflexive
relations on set A is ______.
(b) Let B = {1, 2, 3, 4}. Then the number of
Solution: symmetric relations on set B is ______.

Result :
(i) number of reflexive relations =
(ii) number of symmetric relations =
(iii) number of reflexive & symmetric relations =
Q (c) Let C = {a, b, c, d}. Then the number of
Solution: equivalence relations on set C is ______.
JEE Main 30th Jan 2024, S2

Q The number of symmetric relations defined on the set


{1, 2, 3, 4} which are not reflexive is _____.
JEE Main 30th Jan 2024, S2

Q The number of symmetric relations defined on the set


{1, 2, 3, 4} which are not reflexive is _____.

Ans: 960
Solution:
Types of Relations
Antisymmetric Relation
The relation R is said to be antisymmetric on a set A,
if xRy and yRx hold only when x = y.
Functions
Functions
Let A and B be two non-empty sets. Then a function f : A → B is a rule
which associates each element of A to unique element of B.

Notations:
f:A→B
> > >
f f f

A B A B A B

> >
f f

A B A B
Classification of Functions
Classification of Functions
(a) One-one and many-one
(b) Onto and into

NOTE :
One-one → Injective
Onto → Surjective
One-one and onto → Bijective
Classification of Functions

> >
f f

A B A B

> >
f f

A B A B
Check whether the following functions are one-one
Q
or many-one.
(a) y = x2 ; x ∈ R (b) y = x2 ; x ∈ R+
Check whether the following functions are one-one
Q
or many-one.
(a) y = x2 ; x ∈ R
Solution:
Ist Method: II Method:

Thus is not one-


one.

X
Check whether the following functions are one-one
Q
or many-one.
(b) y = x2 ; x ∈ R+
Solution:
Since

Thus for positive values


is positive, thus is increasing in its domain.
Thus, It is one-one.
Check whether the following function is one-one or
Q
many-one : y = x2 – 4x
Solution:
Ist Method: II Method:

Given f(x) = x2 − 4x f(x) = x2 − 4x


f(x1) = f(x2) f’(x) = 2x − 4
x12 − 4x1 = x22 − 4x2 −
+
(x12 − x22) − (4x1 − 4x2) = 0
−∞ 2
(x1 − x2) (x1 + x2 − 4) = 0 ∞
So again
Since, it is not monotonic
Either x1 − x2 = 0 or x1 + x2 − 4 = 0
Thus f(x) is many-one
Thus, it is not one-one
JEE Main 29th Jan, 2023 - S1

A f (x) is one-one in [1, ∞) but


not in (-∞, ∞)

B f (x) is one-one in (-∞, ∞)

C f (x) is many-one in (-∞, -1)

D f (x) is many-one in (1, ∞ )


JEE Main 29th Jan, 2023 - S1

A f (x) is one-one in [1, ∞) but


not in (-∞, ∞)

B f (x) is one-one in (-∞, ∞)

C f (x) is many-one in (-∞, -1)

D f (x) is many-one in (1, ∞ )


Solution:

Clearly, f (x) is one-one in [1, ∞) but not in (-∞, ∞)


Check whether the following functions are onto or into.
Q
(a) f : R → [−4, 1] defined as

(b) f : [0, 2𝞹] → [1, 26] defined as f(x) = (3 sin x - 4 cos x)2 + 1
Check whether the following functions are onto or into.
Q
(a) f : R → [−4, 1] defined as
Solution:

Now x is defined if

- + -

-∞ -4 1 ∞

y [- 4, 1)
Since [- 4, 1) [- 4, 1]
Thus f(x) is into.
Check whether the following functions are onto or into.
Q
(b) f : [0, 2𝞹] → [1, 26] defined as f(x) = (3 sin x - 4 cos x)2 + 1
Solution:

As

Thus,

And,

Hence,

Therefore, f (x) is onto


Check whether the following functions is onto or into.
Q

f : N → N defined as
Solution:

For n ∈ even, i.e. 2, 4, 6, 8, 10, ….


,
We will get

For n ∈ odd, i.e. 1, 3, 5, 7, 9, ….., we will get

Thus, we will get all natural numbers.


Thus, function is onto.
Q If f: R → S, defined by f(x) = sin 3x - √3 cos x + 1, is onto,
then find the set S.
Solution:
Q If f : R → S defined as f(x) = x2 – 5x + 6 is an onto function
then S must be

D None of these
Q If f : R → S defined as f(x) = x2 – 5x + 6 is an onto function
then S must be

D None of these
Solution:
Here,
Now,

Here, we know that, for f(x)

Range is
Q Let f: R → [1, ∞) be defined as .
If f(x) is surjective, then

D
Q Let f: R → [1, ∞) be defined as .
If f(x) is surjective, then

D
Solution:
Composition of Functions
Composition of Functions
Composition of f(x) and g(x) is denoted as fog(x) and gof(x) and
it is defined as :
(a) fog(x) = f(g(x))
(b) gof(x) = g(f(x))

If f(x) = sin x and g(x) = x2 . Then,


(a) fog(x) = (b) gof(x) =
Composition of Functions
Composition of f(x) and g(x) is denoted as fog(x) and gof(x) and
it is defined as :
(a) fog(x) = f(g(x))
(b) gof(x) = g(f(x))

If f(x) = sin x and g(x) = x2 . Then,


(a) fog(x) = f(g(x)) (b) gof(x) = g(f(x))
= sin(g(x)) = g(f(x))
= sin(x2) = (f(x))2 = (sin x)2
Let f(x) = x2 and g(x) = 2x , then the solution set of
Q
fog(x) = gof(x) is

A R

B {0}

C {0, 2}

D None of these
Let f(x) = x2 and g(x) = 2x , then the solution set of
Q
fog(x) = gof(x) is

A R

B {0}

C {0, 2}

D None of these
Solution:
Q Let Then for what value

of 𝝰 is f(f(x)) = x for all x ?


Solution:
Composition of Functions
Let us consider f : A → B and g : B → C defined as
f(x) = 3x – 1 and g(x) = 3x where
A = {1, 2, 3}, B = {2, 3, 5, 8} , C = {2, 6, 9, 15, 24} then:

gof ( __ ) =

gof ( __ ) =

Observation :
gof : A → C
Composition of Functions
Definition
If f : A → B and g : B → C are two functions, then composition of f and g

denoted by gof is defined as a function gof : A → C given by

gof(x) = g(f(x)), ∀ x ∈ A

* Clearly, range of f(x) must be subset of domain of g(x)


Q Let where [ . ] denotes the GIF. Then

find the value of f {f (−2.3)}.


Solution:
Q Let f be a function defined by x ≠ 3, 2 ;

f k(x) denote the composition of f with itself taken k times


i.e., f 3(x) = f(f(f(x))), then which one of the following in NOT
correct ?

A f 2012(2009) = 2009

D f 2012(2012) = 2012
Q Let f be a function defined by x ≠ 3, 2 ;

f k(x) denote the composition of f with itself taken k times


i.e., f 3(x) = f(f(f(x))), then which one of the following in NOT
correct ?

A f 2012(2009) = 2009

D f 2012(2012) = 2012
Solution:
JEE Main 31st Jan 2024, S1

A -4

D 4
JEE Main 31st Jan 2024, S1

A -4

D 4
Solution:
JEE Main 10th April 2023 S-1

Q If , then the

least value of is:

A 2

B 4

C 8

D 0
JEE Main 10th April 2023 S-1

Q If , then the

least value of is:

A 2

B 4

C 8

D 0
Solution:
Q

then find fog(x).


Solution:
Solution:
JEE Main 5th April, 2024 - S2

Q Let f, g : R → R be defined as : f(x) = | x - 1| and

Then the function f(g(x) is

A neither one-one nor onto

B one-one but not onto

C Both one-one and onto

D Onto but not one-one


JEE Main 5th April, 2024 - S2

Q Let f, g : R → R be defined as : f(x) = | x - 1| and

Then the function f(g(x) is

A neither one-one nor onto

B one-one but not onto

C Both one-one and onto

D Onto but not one-one


Solution:
Inverse of Function
Inverse of Function
Consider a function f : {1, 2, 3} → {3, 6, 9} defined as f(x) = 3x

f(1) = 3 f

f(2) = 6 1 3
f(3) = 9
2 6

3 9
A B
Inverse of Function
Consider g : {3, 6, 9} → {1, 2, 3} defined as , then

f(1) = 3 f g(3)= 1
f(2) = 6 g(6)= 2
f(3) = 9 1 3 g(9)= 3

2 6

3 9
A B
g
Inverse of Function
Try to observe in previous example

fog(x) = x ∀ x (i.e., fog is identity function from B to B i.e. IB) and

gof(x) = x ∀ x (i.e., gof is identity function from A to A i.e. IA)


Inverse of Function
Definition

A function f : X → Y is said to be invertible, if there exists a function

g : Y → X such that gof = Ix and fog = Iy. The function g(x) is called

inverse of f(x) and is denoted as f-1(x)


Inverse of Function
Algorithm to find Inverse of function

Step 1: Write y = f(x) and replace x y


Step 2: Find value of y. This is f-1(x)
Find inverse function of following:
Q
Find inverse function of following:
Q
Solution:
Find inverse function of following:
Q
Solution:
Find inverse function of following:

Squaring both sides


Find inverse function of following:
Q
Solution:
Q Let g(x) be the inverse of , then
g(x) can be :

D
Q Let g(x) be the inverse of , then
g(x) can be :

D
Solution:
Q Let be a function defined as

If gof(x) = x, then
Q Let be a function defined as

If gof(x) = x, then

Ans: 7
Solution:
Solution:
Q If f(x) is an invertible function and g(x) = 2f(x) + 5,
then the value of g-1(x) is

D
Q If f(x) is an invertible function and g(x) = 2f(x) + 5,
then the value of g-1(x) is

D
Solution:
Q If f : [1, ∞) → [2, ∞) is given by then f-1(x) is :

NOTE :
Inverse of a function is unique.
Q If f : [1, ∞) → [2, ∞) is given by then f-1(x) is :

D
Solution:
Q For what values of ⍺ the function y = ⍺x + 3 is inverse of itself.
Solution:

According to question

By comparing coefficients

Taking common,
Remark :
Previous question can also be asked as:
Let f(x) = ⍺x + 3, then for what values of ‘⍺’, f(f(x)) = x , ∀ x.
Inverse of Function

Remark :
(fog)-1 = g-1 of-1
Inverse of Function

NOTE :
A function is invertible iff it is bijective.
Inverse of Function

NOTE :
A function is invertible iff it is bijective.

In this case f-1 is not a function.


Inverse of Function

NOTE :
A function is invertible iff it is bijective.

In this case f-1 is not a function.


JEE Main 25th July, 2021 - S2

Consider function f : A → B and g : B → C (A, B, C ⊆ R)


Q
such that (gof)-1 exists then:

A f and g both are one-one

B f and g both are onto

C f is one-one and g is onto

D f is onto and g is one-one


JEE Main 25th July, 2021 - S2

Consider function f : A → B and g : B → C (A, B, C ⊆ R)


Q
such that (gof)-1 exists then:

A f and g both are one-one

B f and g both are onto

C f is one-one and g is onto

D f is onto and g is one-one


Solution:

∴ (gof)-1 exist ⇒ gof is bijective


⇒ ‘f’ must be one-one and ‘g’ must be ONTO
Inverse of Function

NOTE :
(a) Graph of y = f-1(x) is reflection of graph of y = f(x) about y = x.
For example.
(i) ex and ln x (ii) y = x2 ; x ≥ 0 and
Inverse of Function

NOTE :
(a) Graph of y = f-1(x) is reflection of graph of y = f(x) about y = x.
For example.
(i) ex and ln x (ii) y = x2 ; x ≥ 0 and

(b) Solutions of f(x) = x and f-1(x) = x are same.


Q If is defined as f(x) = x2 - 3x + 4, then

find solution of x = f -1 (x).


Solution:
Solution of x = f -1 (x) is same as that of solution of x = f(x)

You might also like