MATHEMATICS

MATHEMATICS RELATIONS AND FUNCTIONS

3. Let A = (x ∈Z : 0 ≤ x ≤ 12}.

Show that R = {(a, b) : a, b ∈ A; |a – b| is divisible by 4} is an equivalence relation. Find the

set of all elements related to 1. Also write the equivalence class [2]. (C.B.S.E 2018)

4. Prove that the function f: [0, ∞) → R given by f(x) = 9x2 + 6x – 5 is not invertible. Modify the
co-domain of the function f to make it invertible, and hence find f-1. (C.B.S.E. Sample Paper
2018-19

Assertion and Reason Questions-

1. Two statements are given-one labelled Assertion (A) and the other labelled Reason (R).
Select the correct answer to these questions from the codes(a), (b), (c) and (d) as given below.

a) Both A and R are true and R is the correct explanation of A.

b) Both A and R are true but R is not the correct explanation of A.
c) A is true but R is false.
d) A is false and R is also false.

Assertion(A): Let L be the set of all lines in a plane and R be the relation in L defined as R = {(L1,
L2): L1 is perpendicular to L2}.R is not equivalence realtion.

Reason (R): R is symmetric but neither reflexive nor transitive

2. Two statements are given-one labelled Assertion (A) and the other labelled Reason (R).
Select the correct answer to these questions from the codes(a), (b), (c) and (d) as given below.

a) Both A and R are true and R is the correct explanation of A.

b) Both A and R are true but R is not the correct explanation of A.
c) A is true but R is false.
d) A is false and R is also false.

Assertion (A): = {(T1, T2): T1 is congruent to T2}. Then R is an equivalence relation.

Reason(R): Any relation R is an equivalence relation, if it is reflexive, symmetric and transitive.

Case Study Questions-

1. Consider the mapping f: A → B is defined by f(x) = x - 1 such that f is a bijection.

Based on the above information, answer the following questions.

(i) Domain of f is:

MATHEMATICS RELATIONS AND FUNCTIONS

a) R - {2}
b) R
c) R - {1, 2}
d) R - {0}

(ii) Range of f is:

a) R
b) R - {2}
c) R - {0}
d) R - {1, 2}

(iii) If g: R - {2} → R - {1} is defined by g(x) = 2f(x) - 1, then g(x) in terms of x is:

(iv) The function g defined above, is:

a) One-one
b) Many-one
c) into
d) None of these

(v) A function f(x) is said to be one-one if.

a. f(x1) = f(x2) ⇒ -x1 = x2

b. f(-x1) = f(-x2) ⇒ -x1 = x2
c. f(x1) = f(x2) ⇒ x1 = x2
d. None of these

2. A relation R on a set A is said to be an equivalence relation on A iff it is:

I. Reflexive i.e., (a, a) ∈ R ∀ a ∈ A.

II. Symmetric i.e., (a, b) ∈ R ⇒ (b, a) ∈ R ∀ a, b ∈ A.
III. Transitive i.e., (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R ∀ a, b, c ∈ A.

Based on the above information, answer the following questions.

MATHEMATICS RELATIONS AND FUNCTIONS

(i) If the relation R = {(1, 1), (1, 2), (1, 3), (2, 2), (2, 3), (3, 1), (3, 2), (3, 3)} defined on the set
A = {1, 2, 3}, then R is:

a) Reflexive
b) Symmetric
c) Transitive
d) Equivalence

(ii) If the relation R = {(1, 2), (2, 1), (1, 3), (3, 1)} defined on the set A = {1, 2, 3}, then R is:

a) Reflexive
b) Symmetric
c) Transitive
d) Equivalence

(iii) If the relation R on the set N of all natural numbers defined as R = {(x, y): y = x + 5 and x
< 4}, then R is:

a) Reflexive
b) Symmetric
c) Transitive
d) Equivalence

(iv) If the relation R on the set A = {1, 2, 3, ........., 13, 14} defined as R = {(x, y): 3x - y = O},
then R is:

a) Reflexive
b) Symmetric
c) Transitive
d) Equivalence

(v) If the relation R on the set A = {I, 2, 3} defined as R = {(1, 1), (1, 2), (1, 3), (2, 1), (2, 2), (2,
3), (3, 1), (3, 2), (3, 3)}, then R is:

a) Reflexive only
b) Symmetric only
c) Transitive only
d) Equivalence

Answer Key-
Multiple Choice questions-
(b) R is reflexive and transitive but not symmetric
MATHEMATICS RELATIONS AND FUNCTIONS

Assertion and Reason Answers-

1. (a) Both A and R are true and R is the correct explanation of A.

2. (a) Both A and R are true and R is the correct explanation of A.

Case Study Answers-

1. Answer :

(i) (a) R - {2}

Solution:

For f(x) to be defined x - 2; ≠ 0 i.e., x; ≠ 2.

∴ Domain of f = R - {2}
MATHEMATICS RELATIONS AND FUNCTIONS

(ii) (b) R - {2}

Solution:

Let y = f(x), then

⇒ xy - 2y = x - 1 ⇒ xy - x = 2y -

Since, x ∈∈ R - {2}, therefore y ≠ 1

Hence, range of f = R - {1}

(iii)
Solution:

We have, g(x) = 2f(x) - 1

(iv) (a) One-one

Solution:

⇒ x1x2 - 2x1 = x1x2 - 2x2 ⇒ 2x1 = 2x2 ⇒ x1 = x2

Thus, g(x1) = g(x2) ⇒ x1 = x2

Hence, g(x) is one-one.

(v) (c) f(x1) = f(x2) ⇒ x1 = x2

2. Answer :

(i) (a) Reflexive

MATHEMATICS RELATIONS AND FUNCTIONS

Solution:

Clearly, (1, 1), (2, 2), (3, 3), ∈ R. So, R is reflexive on A.

Since, (1, 2) ∈ R but (2, 1) ∉ R. So, R is not symmetric on A.

Since, (2, 3), ∈ R and (3, 1) ∈ R but (2, 1) ∉ R. So, R is not transitive on A.

(ii) (b) Symmetric

Solution:

Since, (1, 1), (2, 2) and (3, 3) are not in R. So, R is not reflexive on A.

Now, (1, 2) ∈ R ⇒ (2, 1) ∈ R and (1, 3) ∈ R ⇒ (3, 1) ∈ R. So, R is symmetric,

Clearly, (1, 2) ∈ R and (2, 1) ∈ R but (1, 1) ∉ R. So, R is not transitive on A.

(iii) (c) Transitive

Solution:

We have, R = {(x, y): y = x + 5 and x < 4}, where x, y ∈ N.

∴ R = {(1, 6), (2, 7), (3, 8)}

Clearly, (1, 1), (2, 2) etc. are not in R. So, R is not reflexive.

Since, (1, 6) ∈ R but (6, 1) ∉ R. So, R is not symmetric.

Since, (1, 6) ∈ R and there is no order pair in R which has 6 as the first element.

Same is the case for (2, 7) and (3, 8). So, R is transitive.

(iv) (d) Equivalence

Solution:

We have, R = {(x, y): 3x - y = 0}, where x, y ∈ A = {1,2, ......, 14}.

∴ R = {(1, 3), (2, 6), (3, 9), (4, 12)}

Clearly, (1, 1) ∉ R. So, R is not reflexive on A.

Since, (1, 3) ∈ R but (3, 1) ∉ R. So, R is not symmetric on A.

MATHEMATICS RELATIONS AND FUNCTIONS

Since, (1, 3) ∈ Rand (3, 9) ∈ R but (1, 9) ∉ R. So, R is not transitive on A.

(v) (d) Equi0076alence

Solution:

Clearly, (1, 1), (2, 2), (3, 3) ∈ R. So, R is reflexive on A.

We find that the ordered pairs obtained by interchanging the components of ordered
pairs in R are also in R. So, R is symmetric on A. For 1, 2, 3 ∈ A such that (1, 2) and (2, 3)
are in R implies that (1, 3) is also, in R. So, R is transitive on A. Thus, R is an equivalence
relation.