Exercise 1.
1. Show that the function f : R* → R* defined by f(x) = 1/x is one-one and onto,
where R* is the set of all non-zero real numbers. Is the result true, if
the domain R* is replaced by N with co-domain being same as R*?
Given function is: f(x) = 1/x
one-one:- Let x1, x2 ∈ R*
such that f(x1) = f(x2),
⇒ 1/x1 = 1/x2 (R* = R − {0})
⇒ x2 = x1
⇒ x1 = x2
Thus, f is one-one.
onto:- since f(x) = 1/x , ∀ x ∈ R*
Range of f = R* = Co-domain of f.
Thus, f is onto.
OR
Let y ∈ R* (co-domain)
and let f(x) = y
⇒ 1/x = y
⇒ x = 1/y
since, y ≠ 0,
we get x = 1/y ∈ R* (Domain)
Hence, f is one-one and onto function ∀ y ∈ R*
i.e. f is bijective function.
Now, g : N → R* by g(x) = 1/x
one-one:- Let, g(x1) = g(x2) x 1, x 2 ∈ N
⇒ 1/x1 = 1/x2
⇒ x2 = x1
⇒ x1 = x2
So, g is one-one.
onto:- since g(x) = 1/x , ∀ x ∈ N
Page 1
Range of g = {1, 1/2, 1/3, 1/4, ...}
and co-domain of g = R*
Range of g ≠ codomain of g
So, g is not onto.
--- PAGE 2 ---
2. Check the injectivity and surjectivity of the following functions.
(i) f : N → N given by f(x) = x2
→ Given:- f(x) = x2 , ∀ x ∈ N
Injective (one-one): Let x1, x2 ∈ N,
f(x1) = f(x2)
⇒ x12 = x22
⇒ x1 = x2 (•• x1, x2 ∈ N)
So, f is injective.
Surjective (onto): since f(x) = x2 ; x ∈ N
Range of f = {12, 22, 32, .......}
= {1, 4, 9, .......} ≠ N
But co-domain of f = N = {1, 2, 3, 4, 5, ...}
∴ Range of f ≠ codomain of f
so, f is not surjective.
∴ f is injective but not surjective.
(ii) f : Z → Z given by f(x) = x2
→ Given:- f(x) = x2 , ∀ x ∈ Z
Injective:- Let x1, x2 ∈ Z,
f(x1) = f(x2)
⇒ x12 = x22
⇒ x1 = ± x2 (•• x1, x2 ∈ Z)
Thus, f is not injective.
( e.g., f(1) = f(-1) = 1 but 1 ≠ -1)
Page 2
Surjective:- since, f(x) = x2 , x ∈ Z
Range of f = {02, (±1)2, (±2)2, .......}
= {0, 1, 4, ...} ≠ Z
But, co-domain of f = Z = {0, ±1, ±2, ±3, ...}
∴ Range of f ≠ codomain of f.
(ie, negative integers have no pre-images in the domain)
Thus, f is not surjective.
∴ f is neither injective nor surjective.
--- PAGE 3 ---
(iii) f : R → R given by f(x) = x2
→ Given: f(x) = x2 , ∀ x ∈ R.
Injective:- Let x1, x2 ∈ R,
f(x1) = f(x2)
⇒ x12 = x22
⇒ x1 = ± x2
Thus f is not injective.
{for eg, f(2) = f(-2) ⇒ 2 ≠ -2}
Surjective:- since, f(x) = x2 ; x ∈ R
Range of f = Set of non-negative real numbers = R+ ∪ {0}
But, co-domain of f = set of all real numbers = R
Range of f ≠ Co-domain of f
Thus, f is not surjective.
∴ f is neither injective nor surjective.
(iv) f : N → N given by f(x) = x3
→ Given f(x) = x3 , ∀ x ∈ N
Injective:- Let x1, x2 ∈ N,
f(x1) = f(x2)
⇒ x13 = x23
Page 3
⇒ x1 = x2
f is injective.
Surjective:- Range of f = {13, 23, 33...} = {1, 8, 27, ...} ≠ N
∴ Range of f ≠ domain of f
Thus f is not surjective.
∴ f is injective but not surjective.
(v) f : Z → Z given by f(x) = x3
→ Given function is f(x) = x3 , ∀ x ∈ Z
Injective: Let, x1, x2 ∈ Z
f(x1) = f(x2)
--- PAGE 4 ---
⇒ x13 = x23
⇒ x1 = x2
Thus, f is injective.
Surjective:- Range of f = {03, (±1)3, (±2)3, ......}
= {0, ±1, ±8, ............} ≠ Z
But, co-domain of f = Z = {0, ±1, ±2, ±3, ....}
Range of f ≠ codomain of f.
Thus, f is not surjective.
∴ f is injective but not surjective.
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.
→ Given function is f(x) = [x]
Injective: Let x ∈ R, then
Since, f(2) = 2 and f(2.5) = 2
and f(0) = 0, f(0.1) = 0.
⇒ f(0) = f(0.1) ⇒ 0 ≠ 0.1
∴ f is not one-one.
Page 4
Surjective:- Range of f = set of integers = Z
But, co-domain of f = set of real numbers = R
Range of f ≠ codomain of f.
∴ f is not onto.
∴ f is neither one-one nor onto.
4) Show that the modulus function f:R→R given by f(x)=|x| is neither one-
one nor onto, where |x| is positive x if x is positive or 0, and is -x if x
is negative.
→ Given function is f(x) = |x|
f(x) = { x, if x ≥ 0 ; -x, if x < 0 }
Injective: Let x1, x2 ∈ R, f(x1) = f(x2) ⇒ |x1| = |x2| ⇒ x1 ≠ x2
for example; f(1) = 1 = f(-1) ⇒ 1 ≠ -1.
So, f is not one-one.
--- PAGE 5 ---
Surjective:- Range of f = set of non-negative real numbers.
i.e., Range of f = [0, ∞) = R≥0
But, co-domain of f = R = (−∞, ∞)
Range of f ≠ codomain of f
So f is not onto.
∴ f is neither one-one nor onto.
5) Show that the signum function f: R→R, given by f(x) = { 1, if x > 0 ; 0,
if x = 0 ; -1, if x < 0 } is neither one-one, nor onto.
→ since, f(1) = 1 = f(2)
Here, f(x1) = f(x2) ⇒ x1 ≠ x2 ( • 1 ≠ 2 )
so, f is not one-one.
Also, Range of f = {1, 0, -1}
But, codomain of f = R
∴ Range of f ≠ codomain of f.
∴ f is not onto.
∴ f is neither one-one nor onto.
Page 5
6) Let A={1,2,3} B={4,5,6,7} and f={(1,4),(2,5),(3,6)} be a function from A
to B. Show that f is one-one.
→ Given: f = {(1,4), (2,5), (3,6)}
⇒ f(1) = 4, f(2) = 5 and f(3) = 6
• Different elements of domain have different images in the co-domain.
∴ f is one-one.
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.
(i) f(x) = 3 - 4x, ∀ x ∈ R
one-one:- Let, x1, x2 ∈ R
such that f(x1) = f(x2)
--- PAGE 6 ---
⇒ 3 - 4x1 = 3 - 4x2
⇒ -4x1 = -4x2
⇒ x1 = x 2
• f is one-one.
Onto:- Let any y ∈ R (Codomain).
Let f(x) = y
⇒ 3 - 4x = y
⇒ 4x = 3 - y
⇒ x = (3 - y)/4 ∈ R (Domain)
• corresponding to every y ∈ R there exist x ∈ R such that f(x) = y.
∴ f is onto.
Hence, f is a bijective function.
(ii) f(x) = 1 + x2
one-one:- Here, f(1) = 1 + 1 = 2.
Also f(-1) = 1 + 1 = 2
• f(1) = f(-1) but 1 ≠ -1,
∴ f is not one-one.
onto:- Range of f = [1, ∞)
Page 6
(Range of f contains only those real numbers ≥ 1)
But, Co-domain of f = R = (−∞, ∞)
Range of f ≠ codomain of f.
∴ f is not onto.
Thus, f is neither one-one nor onto.
Page 7