0% found this document useful (0 votes)
113 views12 pages

Mathematics XII - Exercise 1.2: Relations and Functions

The document contains 9 questions regarding functions and their properties of injectivity, surjectivity, and bijectivity. Some key examples analyzed include: 1) A function from real numbers to real numbers defined as f(x) = 1/x, which is shown to be bijective. 2) Various functions from natural numbers to natural numbers involving squares and cubes of inputs, some shown to be injective but not surjective. 3) Common functions like greatest integer, modulus, and signum functions analyzed and shown to be neither injective nor surjective. 4) A function from sets A to B shown to be injective based on its inputs and outputs.
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)
113 views12 pages

Mathematics XII - Exercise 1.2: Relations and Functions

The document contains 9 questions regarding functions and their properties of injectivity, surjectivity, and bijectivity. Some key examples analyzed include: 1) A function from real numbers to real numbers defined as f(x) = 1/x, which is shown to be bijective. 2) Various functions from natural numbers to natural numbers involving squares and cubes of inputs, some shown to be injective but not surjective. 3) Common functions like greatest integer, modulus, and signum functions analyzed and shown to be neither injective nor surjective. 4) A function from sets A to B shown to be injective based on its inputs and outputs.
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/ 12

Chapter 1

Relations and
Functions

• Mathematics XII
• Exercise 1.2

WWW.TIWARIACADEMY.COM
(www.tiwariacademy.com)

(Class – XII)

Exercise 1.2
Question 1:
1
Show that the function f: 𝐑 ∗ → 𝐑 ∗ defined by 𝑓(𝑥) = is one-one and onto,
𝑥

where 𝐑 ∗ is the set of all non-zero real numbers. Is the result true, if the domain
𝐑 ∗ is replaced by N with co-domain being same as 𝐑 ∗ ?

Answer 1:
1
It is given that f: R * → R * is defined by f(x) =
x

For one – one:


Let x, y ∈ R * such that f(x) = f(y)
1 1
⇒ =
x y

⇒x = y
∴ f is one – one.
For onto:
1
It is clear that for y ∈ R * , there exists x = ∈ R * [as y ≠ 0] such that
y
1
f(x) = =y
1
(y)
∴ f is onto.
Thus, the given function f is one – one and onto.
1
Now, consider function g: N → R * defined by g(x) =
x
We have,
1 1
𝑔(𝑥1 ) = 𝑔(𝑥2 ) ⇒ = ⇒ 𝑥1 = 𝑥2
𝑥1 𝑥2

A Free web support in Education


(www.tiwariacademy.com)

(Class – XII)

∴ g is one – one.
Further, it is clear that g is not onto as for 1.2 ∈ R * there does not exit any x in N
1
such that g(x) = .
1.2
Hence, function g is one-one but not onto.

Question 2:
Check the injectivity and surjectivity of the following functions:
(i) f: N → N given by f(x) = x2
(ii) f: Z → Z given by f(x) = x2
(iii) f: R → R given by f(x) = x2
(iv) f: N → N given by f(x) = x3
(v) f: Z → Z given by f(x) = x3

Answer 2:
(i) f: N → N is given by f(x) = x2
It is seen that for x, y ∈ N, f(x) = f(y) ⇒ x2 = y2 ⇒ x = y.
∴ f is injective.
Now, 2 ∈ N. But, there does not exist any x in N such that f(x) = x2 = 2.
∴ f is not surjective.
Hence, function f is injective but not surjective.

(ii) f: Z → Z is given by f(x) = x2


It is seen that f(−1) = f(1) = 1, but −1 ≠ 1.
∴ f is not injective.
Now, −2 ∈ Z. But, there does not exist any element x ∈ Z such that

A Free web support in Education


(www.tiwariacademy.com)

(Class – XII)

f(x) = −2 or x2 = −2.
∴ f is not surjective.
Hence, function f is neither injective nor surjective.

(iii) f: R → R is given by f(x) = x2


It is seen that f(−1) = f(1) = 1, but −1 ≠ 1.
∴ f is not injective.
Now, −2 ∈ R. But, there does not exist any element x ∈ R such that
f(x) = −2 or x2 = −2.
∴ f is not surjective.
Hence, function f is neither injective nor surjective.

(iv) f: N → N given by f(x) = x3


It is seen that for x, y ∈ N, f(x) = f(y) ⇒ x3 = y3 ⇒ x = y.
∴ f is injective.
Now, 2 ∈ N. But, there does not exist any element x ∈ N such that
f(x) = 2 or x3 = 2.
∴ f is not surjective
Hence, function f is injective but not surjective.
(v) f: Z → Z is given by f(x) = x3
It is seen that for x, y ∈ Z, f(x) = f(y) ⇒ x3 = y3 ⇒ x = y.
∴ f is injective.
Now, 2 ∈ Z. But, there does not exist any element x ∈ Z such that
f(x) = 2 or x3 = 2.
∴ f is not surjective.
Hence, function f is injective but not surjective.

A Free web support in Education


(www.tiwariacademy.com)

(Class – XII)

Question 3:
Prove that the Greatest Integer 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.

Answer 3:
f: R → R is given by, f(x) = [x]
It is seen that f(1.2) = [1.2] = 1, f(1.9) = [1.9] = 1.
∴ f(1.2) = f(1.9), but 1.2 ≠ 1.9.
∴ f is not one – one.
Now, consider 0.7 ∈ R.
It is known that f(x) = [x] is always an integer. Thus, there does not exist any
element x ∈ R such that f(x) = 0.7.
∴ f is not onto.
Hence, the greatest integer function is neither one – one nor onto.

Question 4:
Show that the Modulus Function f: R → R given by 𝑓(𝑥) = |𝑥|, is neither one –
one nor onto, where |𝑥| is x, if x is positive or 0 and |𝑥| is − x, if x is negative.

Answer 4:
x, if x ≥ 0
f: R → R is given by f(x) = |x| = {
-x, if x < 0
It is clear that f(-1) = |-1| = 1 and f(1) = |1| = 1
∴ f(−1) = f(1), but −1 ≠ 1.
∴ f is not one – one.
Now, consider −1 ∈ R.
It is known that f(x) = |𝑥| is always non-negative. Thus, there does not exist any
element x in domain R such that f(x) = |𝑥| = −1.

A Free web support in Education


(www.tiwariacademy.com)

(Class – XII)

∴ f is not onto.
Hence, the modulus function is neither one-one nor onto.

Question 5:
1, 𝑖𝑓 𝑥 > 0
Show that the Signum Function f: R → R, given by 𝑓(𝑥) = { 0, 𝑖𝑓 𝑥 = 0
−1, 𝑖𝑓 𝑥 < 0
is neither one-one nor onto.
Answer 5:
1, if x > 0
f: R → R is given by f(x) = { 0, if x = 0
-1, if x < 0
It is seen that f(1) = f(2) = 1, but 1 ≠ 2.
∴ f is not one – one.
Now, as f(x) takes only 3 values (1, 0, or −1) for the element −2 in co-domain
R, there does not exist any x in domain R such that f(x) = −2.
∴ f is not onto.
Hence, the Signum function is neither one – one nor onto.
Question 6:
Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function
from A to B. Show that f is one – one.
Answer 6:
It is given that A = {1, 2, 3}, B = {4, 5, 6, 7}.
f: A → B is defined as f = {(1, 4), (2, 5), (3, 6)}.
∴ f (1) = 4, f (2) = 5, f (3) = 6
It is seen that the images of distinct elements of A under f are distinct.
Hence, function f is one – one.

A Free web support in Education


(www.tiwariacademy.com)

(Class – XII)

Question 7:
In each of the following cases, state whether the function is one – one, onto or
bijective.
Justify your answer.
(i) f: R → R defined by f(x) = 3 − 4x
(ii) f: R → R defined by f(x) = 1 + x2

Answer 7:
(i) f: R → R is defined as f(x) = 3 − 4x.
Let x1 , x2 ∈ R such that f(x1 ) = f(x2 )
⇒ 3-4x1 = 3-4x2
⇒ -4x1 = -4x2
⇒ x1 = x2
∴ f is one – one.
3-y
For any real number (y) in R, there exists in R such that
4
3-y 3-y
f( ) = 3-4 ( ) = y
4 4
∴ f is onto.
Hence, f is bijective.

(ii) f: R → R is defined as f(x) = 1 + x2


Let x1 , x2 ∈ R such that f(x1 ) = f(x2 )
⇒ 1+ x12 = 1 + x22
⇒ x12 = x22
⇒ x1 = ± x2
∴ f(x1 ) = f(x2 ) does not imply that x1 = x2

A Free web support in Education


(www.tiwariacademy.com)

(Class – XII)

For example f(1) = f(-1) = 2


∴ f is not one – one.
Consider an element −2 in co-domain R.
It is seen that f(x) = 1 + x2 is positive for all x ∈ R.
Thus, there does not exist any x in domain R such that f(x) = −2.
∴ f is not onto.
Hence, f is neither one – one nor onto.

Question 8:
Let A and B be sets. Show that f: A × B → B × A such that (a, b) = (b, a) is
bijective function.

Answer 8:
f: A × B → B × A is defined as f(a, b) = (b, a).
Let (a1 , b1 ), (a2 , b2 ) ∈ A × B such that f(a1 , b1 ) = f(a2 , b2 )
⇒ (b1 , a1 ) = (b2 , a2 )
⇒ b1 = b2 and a1 = a2
⇒ (a1 , b1 ) = (a2 , b2 )
∴ f is one – one.
Now, let (b, a) ∈ B × A be any element.
Then, there exists (a, b) ∈ A × B such that f(a, b) = (b, a). [By definition of f ]
∴ f is onto.
Hence, f is bijective.

A Free web support in Education


(www.tiwariacademy.com)

(Class – XII)

Question 9:
n+1
, if n is odd
Let f: N → N be defined by f(n) = { n2 for all n ∈ N
, if n is even
2
State whether the function f is bijective. Justify your answer.

Answer 9:
n+1
, if n is odd
f: N → N is defined as f(n) = { n2 for all n ∈ N
, if n is even
2

It can be observed that:


1+1 2
f(1) = = 1 and f(2) = = 1 [By definition of f(n)]
2 2
f(1) = f(2), where 1 ≠ 2
∴ f is not one-one.
Consider a natural number (n) in co-domain N.
Case I: n is odd
∴ n = 2r + 1 for some r ∈ N. Then, there exists 4r + 1∈ N such that
4r + 1 + 1
f(4r + 1) = = 2r + 1
2
Case II: n is even
∴ n = 2r for some r ∈ N. Then, there exists 4r ∈ N such that
4r
f(4r) = = 2r.
2

∴ f is onto.
Hence, f is not a bijective function.

A Free web support in Education


(www.tiwariacademy.com)

(Class – XII)

Question 10:
Let A = R − {3} and B = R − {1}. Consider the function f: A → B defined by
𝑥−2
(𝑥) = ( ) . Is f one-one and onto? Justify your answer.
𝑥−3

Answer 10:
x-2
A = R − {3}, B = R − {1} and f: A → B defined by f(x) = ( )
x-3
Let x, y ∈ A such that f(x) = f(y)
x-2 y-2
⇒ =
x-3 y-3
⇒ (x – 2)(y – 3) = (y – 2)(x – 3)
⇒ xy – 3x – 2y + 6 = xy – 2x – 3y + 6
⇒ – 3x – 2y = – 2x – 3y ⇒ x = y
∴ f is one-one.
Let y ∈ B = R − {1}. Then, y ≠ 1.
The function f is onto if there exists x ∈ A such that f(x) = y.
Now, f(x) = y
x-2
⇒ =y
x-3

⇒ x – 2 = xy – 3y ⇒ x(1 – y) = – 3y + 2
2-3y
⇒x= ∈A [y ≠ 1]
1-y
2-3y
Thus, for any y ∈ B, there exists ∈ A such that
1-y

2-3y
2-3y ( 1-y ) -2 2-3y-2 + 2y -y
f( )= = = =y
1-y 2-3y 2-3y-3 + 3y -1
( 1-y ) -3

∴ f is onto.
Hence, function f is one – one and onto.

A Free web support in Education


(www.tiwariacademy.com)

(Class – XII)

Question 11:
Let f: R → R be defined as f(x) = x4. 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

Answer 11:
f: R → R is defined as f(x) = x4.
Let x, y ∈ R such that f(x) = f(y).
⇒ x4 = y4
⇒x=±y
∴ f(x) = f(y) does not imply that x = y.
For example f(1) = f(–1) = 1
∴ f is not one-one.
Consider an element 2 in co-domain R. It is clear that there does not exist any x
in domain R such that f(x) = 2.
∴ f is not onto.
Hence, function f is neither one – one nor onto.
The correct answer is D.

Question 12:
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

Answer 12:
f: R → R is defined as f(x) = 3x.
Let x, y ∈ R such that f(x) = f(y).

10

A Free web support in Education


(www.tiwariacademy.com)

(Class – XII)

⇒ 3x = 3y
⇒x=y
∴f is one-one.
y y
Also, for any real number (y) in co-domain R, there exists in R such that f ( ) =
3 3
y
3( ) = y
3

∴ f is onto.
Hence, function f is one – one and onto.
The correct answer is A.

11

A Free web support in Education

You might also like