Week - 1

FAQ
Activity Question
Mathematics for Data Science - 1

1. Suppose the relation R = {(Snail, Frog), (Bird, Bird), (Fox, Frog), (Snail, Fox)} is
defined on the set S = {Snail, Fox, Bird, Frog}.
i. The relation R on the set S is(are)
(a) Reflexive
(b) Symmetric
(c) Transitive
(d) None of these.
Solution:
We have relation R = {(Snail, Frog), (Bird, Bird), (Fox, Frog), (Snail, Fox)} de-
fined on the set S = {Snail, Fox, Bird, Frog}.
A relation R on a set A is said to be a reflexive relation if (a, a) ∈ R, ∀a ∈ A. Snail
∈ S but (Snail, Snail) ∈/ R, so R is not a reflexive relation.
Hence, option (a) is not correct.
A relation R on a set A is said to be a symmetric relation if (a, b) ∈ R implies that
(b, a) also belongs to R.
Since (Snail, Frog) ∈ R but (Frog, Snail) ∈ / R, R is not symmetric.
So, option (b) is not correct.
A relation R on a set A is said to be a transitive relation if (a, b) ∈ R and (b, c) ∈ R
implies that (a, c) belongs to R.
(Snail, Fox) ∈ R, (Fox, Frog) ∈ R and (Snail, Frog) belongs to R. Similarly, (Bird,
Bird) ∈ R. Hence R is a transitive relation and so option (c) is correct.

ii. Let P be a subset of [(S × S) \ R]. What is the set of possible cardinalities of P ?
(a) {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}
(b) {}
(c) {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}
(d) {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12}
Solution:
We have |S| = 4 and |R| = 4.
So, cardinality of the set S × S, |S × S| = |S| × |S| = 4× 4 = 16.
And |(S × S)\R| = 16-4 = 12.
Since P is a subset of (S ×S)\R, so cardinality of P can be any natural number less
than or equal to 12. So, possible cardinalities of set P is {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 1, 12}.
Hence, option (d) is correct.

1
 iii. What is the minimum number of elements of the Cartesian product S × S that
need to be added to R such that the relation becomes symmetric?
(a) 4
(b) 8
(c) 2
(d) 3

Solution:
Given R = {(Snail, Frog), (Bird, Bird), (Fox, Frog), (Snail, Fox)}.
In order to make R a symmetric relation, we must do the following. Since (Snail, Frog)
∈ R, it is necessary that (Frog, Snail) must also be in R. So, add (Frog, Snail) to R.
Similarly, corresponding to (Fox, Frog) and (Snail, Fox), we must add (Frog, Fox) and
(Snail, Fox) respectively to R. Corresponding to (Bird, Bird) ∈ R, we need not add
(Bird, Bird) again as we do not add duplicates to a set. So, the minimum number of
elements of Cartesian product S × S that have to be added to R such that the relation
becomes symmetric is three. Hence option (d) is correct.

2. Suppose f : Z → Z is a function defined by f (x) = Ax + B. For which of the following

integer values of A and B, is the given function bijective?

(a) A = 0, B = { z | z ∈ Z}
(b) A = {-1, 1}, B = {z | z ∈ Z}
(c) B = {-1, 1}, A = 0
(d) B = 0, A = { z | z ∈ Z}

Solution:
To solve this, let us go through each option.
Option (a): Suppose we substitute A = 0 and B with some element b ∈ B in given
function f .
Then f (x) = b. That is, f is a constant function. So, range of f, R(f ) = {b}. R(f ) 6=
codomain of f ( i.e Z). Hence, function f is not surjective. Since a function is bijective
if and only if it is both injective as well as surjective, it follows that f is not bijective.
Now, consider option (b): In this case, if we substitute A = −1 and B with some b ∈ B
in f , then f (x) = −x + b. To check if it is injective, let there exist two distinct elements
in the domain x1 , x2 ∈ Z such that

f (x1 ) = f (x2 ) =⇒ −x1 + b = −x2 + b =⇒ x1 = x2 .

From above, we see that as no two distinct elements in the domain will give the same
image. Hence x1 , x2 ∈ Z can not be distinct.
So, f is an injective function.
Now, to show that f is surjective, let us assume y ∈ Z (codomain of f ) =⇒ −y + b ∈ Z
which is given as domain of f .

2
 f (−y + b) = −(−y + b) + b = y.
That is, we have an element −y + b in Z (domain of f ) such that f (−y + b) = y.
Hence, function f is surjective.
So, when A = -1, and B is b ∈ B, function f is bijective.
Similarly for 1 ∈ A and any element b ∈ B, function f is bijective. So, for otion (b),
function f is bijective .
Now, for option (c): If A = 0 and for any element of B, it is same case as option (a).
Hence, for option (c), function f is not bijective.
Now, for option (d): It is given that B = 0 and A is set of integers. So we choose 0 from
A and substitute A = 0 ∈ Z in the given function f .
Then f (x) = 0 which is again a constant function and it is the same case as option (a).
So, function f is not surjective.
So, for option (d), function f is again not a bijective function.
Hence, the only correct option is option (b).

3. Which of the following intervals are subsets of [2, 3]?

(a) ( (0, 2.3] ∪ (2.3 , 3] ) ∩ (0, 2.3)

(b) ( (2, 2.5] ∪ (2.5 , 4] ) \ (0, 2.3)
(c) ( (2, 2.5] ∪ (2.5 , 4] ) ∩ (0, 3)
(d) ( (0, 2.3] ∪ (2.2 , 3] ) \ (0, 2.3)

Solution:
Let us go through the options:
Option (a): ( (0, 2.3] ∪ (2.3 , 3] ) ∩ (0, 2.3) = (0 , 3] ∩ (0, 2.3) = (0, 2.3). And 1 ∈ (0,
2.3) but 1 ∈
/ [2, 3].
Hence, (0, 2.3) can not be a subset of [2, 3]. So, this option is not correct.

Option (b): ( (2, 2.5] ∪ (2.5, 4] ) \ (0, 2.3) = (2, 4] \ (0, 2.3) = [2.3, 4]. And 4 ∈ [2.3,
4] but 4 ∈
/ [2, 3].
Hence, [2.3, 4] can not be a subset of [2, 3]. So, this option is not correct.

Option (c): ( (2, 2.5] ∪ (2.5 , 4] ) ∩ (0, 3) = (2, 4]∩ (0, 3) = (2, 3) ⊂ [2, 3]. So, this
option is correct.

Option (d): ( (0, 2.3] ∪ (2.2 , 3] ) \ (0, 2.3) = (0, 3] \ (0, 2.3) = [2.3, 3 ] ⊂ [2, 3]. So,
this option is correct.

3
4. The domain and range of the function that is shown in the Figure 1.1 are [m, x] and
[n, y] respectively, where m, n, x, y ∈ R.

Figure 1.1

i. What are the values of m, n respectively?

(a) 0, 3
(b) -4, 1
(c) -4, 9
(d) 2, 6
ii. What are the values of x, y respectively?
(a) 9, 9
(b) -4, 9
(c) 1, 9
(d) 2, 6

Solution:

Given that f : [m, x] → [n, y].

From the Figure 1.1, on X-axis the input set for the function f is the closed interval [-4,

4
 9] and the output set for the function f is the close interval [1, 9].
So, let us compare [m, x] with input set interval [-4, 9] and [n, y] with output set interval
[1, 9].
We will get m = −4, x = 9, n = 1, y = 9.
Hence, in question (i), the second option is correct and in question (ii), the first option
is correct.

5. Let B = {Anil, Ramu, Suraj} and G = {Neha, Keerthi} be the sets of boys and girls
respectively. Ramu is brother of Neha, Anil is brother of Keerthi, Suraj is brother of
Neha and Keerthi.
Let us define a relation R as follows,
R = {(a, b) | (a, b) ∈ B × G, a is brother of b}. Which of the following will be R?

(a) {(Anil, Keerthi), (Suraj, Neha), (Ramu, Neha), (Suraj, Keerthi)}

(b) {(Anil, Keerthi), (Ramu, Keerthi), (Ramu, Neha), (Suraj, Neha)}
(c) {(Anil, Neha), (Ramu, Keerthi), (Ramu, Neha), (Suraj, Keerthi)}
(d) {(Anil, Keerthi), ( Ramu, Neha), (Suraj, Neha), (Ramu, Keerthi), (Anil, Neha),
(Suraj, Keerthi)}

Solution:
Given B = {Anil, Ramu, Suraj} and G = {Neha, Keerthi}. Ramu is brother of Neha,
Anil is brother of Keerthi, Suraj is brother of Neha and Keerthi. Hence, they are all
siblings.
R = {(a, b) | (a, b) ∈ B × G, a is brother of b}.
Therefore, R is the set B × G and elements of R correspond to those given in option d.
Hence, option (d) is correct.

6. Let x ∈ R. Which of the following functions is(are) injective?

√
(a) f (x) = 10 − x
7x+6
(b) f (x) = 3x
(c) f (x) = 2x + 9
(5x+4)(2x−3)
(d) f (x) = 2

Solution:
For each function, we have to take those x from the set R such that the function is well
defined.
Now, let us go through
√ the options:
Option (a): f (x) = 10 − x.
Observe that, domain(f ) = { x ∈ R|10 − x ≥ 0 i.e x ≤ 10}
Remark: Square root of any real number is positive. So, this function is a
well defined function.

5
To check if the function is injective, let there exist two distinct elements in the domain
x1 , x2 ∈ R such that
f (x1 ) = f (x2 )
√ √
=⇒ 10 − x1 = 10 − x2
Squaring both sides, we get,
10 − x1 = 10 − x2

=⇒ x1 = x2 .
It follows that no two distinct elements in the domain will give the same image. Hence
x1 , x2 ∈ R are not distinct. Therefore, this function is injective.

Option (b): f (x) = 7x+6

3x
, x 6= 0
Observe that , domain(f ) = R \ {0}
Again, let there exist two distinct elements in the domain x1 , x2 ∈ R \ {0} such that

f (x1 ) = f (x2 )
7x1 + 6 7x2 + 6
=⇒ =
3x1 3x2
6 0, after re-arranging, we get,
Since x1 , x2 =

7x1 x2 + 6x2 = 7x1 x2 + 6x1

=⇒ x1 = x2
Using the same reasoning as in option (a), this function is also injective.

Option (c): f (x) = 2x + 9

Let there exist two distinct elements in the domain x1 , x2 ∈ R such that

f (x1 ) = f (x2 )

=⇒ 2x1 + 9 = 2x2 + 9
=⇒ x1 = x2
Using the same reasoning as in option (a), it follows that this function is also injective.

(5x+4)(2x−3)
Option (d): f (x) = 2
.

Substitute x = − 45 and x = 32 in the given function. Then, we get f (x) = 0 in both

cases. For two different inputs, we get same output. So, this function is not injective.