Answ

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 9

New horizon scholars school

CBSE Affiliation No.1130470


Kavesar, Ghodbunder Road, Thane (W)-400615
Grade : XII : ANSWER KEY : Mathematics (041)
Name : ______________________________________________________ Date: ____________
Div : _________

Ch 1: Relations and functions


1

4
5 (c)

7 (a)

8 Let A be a set.
Then, Identity relation IA=IA is reflexive, since (a, a) ∈ A ∀a
The converse of it need not be necessarily true.

Consider the set A = {1, 2, 3}


Here,

Relation R = {(1, 1), (2, 2) , (3, 3), (2, 1), (1, 3)} is reflexive on A.

However, R is not an identity relation.

9 (i) Given R1 on Q0 defined by (a, b) ∈ R1 ⇔ a = 1/b.


Reflexivity:

Let a be an arbitrary element of R1.


Then, a ∈ R1
⇒ a ≠1/a for all a ∈ Q0
So, R1 is not reflexive.
Symmetry:

Let (a, b) ∈ R1
Then, (a, b) ∈ R1
Therefore we can write ‘a’ as a =1/b
⇒ b = 1/a
⇒ (b, a) ∈ R1
So, R1 is symmetric.
Transitivity:

Here, (a, b) ∈R1 and (b, c) ∈R2


⇒ a = 1/b and b = 1/c
⇒ a = 1/ (1/c) = c
⇒ a ≠ 1/c
⇒ (a, c) ∉ R1
So, R1 is not transitive.

(ii) Given R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5


Now we have check whether R2 is reflexive, symmetric and transitive.
Reflexivity:
Let a be an arbitrary element of R2.
Then, a ∈ R2
On applying the given condition we get,
⇒ | a−a | = 0 ≤ 5
So, R1 is reflexive.
Symmetry:
Let (a, b) ∈ R2
⇒ |a−b| ≤ 5 [Since, |a−b| = |b−a|]
⇒ |b−a| ≤ 5
⇒ (b, a) ∈ R2
So, R2 is symmetric.
Transitivity:
Let (1, 3) ∈ R2 and (3, 7) ∈R2
⇒|1−3|≤5 and |3−7|≤5
But |1−7| ≰5
⇒ (1, 7) ∉ R2
So, R2 is not transitive.
(iii) Given R3 on R defined by (a, b) ∈ R3 ⇔ a2 – 4ab + 3b2 = 0.
Now we have check whether R2 is reflexive, symmetric and transitive.
Reflexivity:
Let a be an arbitrary element of R3.
Then, a ∈ R3
⇒ a2 − 4a × a+ 3a2= 0
So, R3 is reflexive
Symmetry:
Let (a, b) ∈ R3
⇒ a2−4ab+3b2=0
But b2−4ba+3a2≠0 for all a, b ∈ R
So, R3 is not symmetric.
Transitivity:
Let (1, 2) ∈ R3 and (2, 3) ∈ R3
⇒ 1 − 8 + 6 = 0 and 4 – 24 + 27 = 0
But 1 – 12 + 9 ≠ 0
So, R3 is not transitive.

10 First let R be a relation on A


It is given that set A of ordered pair of integers defined by (x, y) R (u, v) if xv = y u
Now we have to check whether the given relation is equivalence or not.
To prove equivalence relation it is necessary that the given relation should be reflexive, symmetric and
transitive.
Reflexivity:
Let (a, b) be an arbitrary element of the set A.
Then, (a, b) ∈ A
⇒ab=ba
⇒ (a, b) R (a, b)
Thus, R is reflexive on A.
Symmetry:
Let (x, y) and (u, v) ∈A such that (x, y) R (u, v). Then,
xv=yu
⇒vx=uy
⇒uy=vx
⇒ (u, v) R (x, y)
So, R is symmetric on A.
Transitivity:
Let (x, y), (u, v) and (p, q) ∈R such that (x, y) R (u, v) and (u, v) R (p, q)
⇒ x v = y u and u q = v p
Multiplying the corresponding sides, we get
xv×uq=yu×vp
⇒xq=yp
⇒ (x, y) R (p, q)
So, R is transitive on A.
Therefore R is reflexive, symmetric and transitive.
Hence, R is an equivalence relation on A.

11 a
12 c
13 d
14 c
15

16

17 1.
Given f: Q − {3} → Q, defined by f (x) = (2x +3)/(x-3)
Now we have to check for the given function is injection, surjection and bijection condition.
Injection test:

Let x and y be any two elements in the domain (Q − {3}), such that f(x) = f(y).
f(x) = f(y)
(2x + 3)/(x – 3) = (2y + 3)/(y – 3)
(2x + 3) (y − 3) = (2y + 3) (x − 3)
2xy − 6x + 3y − 9 = 2xy − 6y + 3x − 9
9x = 9y
x=y
So, f is an injection.
Surjection test:
Let y be any element in the co-domain (Q − {3}), such that f(x) = y for some element x in Q (domain).
f(x) = y
(2x + 3)/(x – 3) = y
2x + 3 = x y − 3y
2x – x y = −3y − 3
x (2−y) = −3 (y + 1)
x = -3(y + 1)/(2 – y) which is not defined at y = 2.
So, f is not a surjection and f is not a bijection.

2.
Given f: R → R, defined by f(x) = sin2x + cos2x
Now we have to check for the given function is injection, surjection and bijection condition.
Injection condition:
f(x) = sin2x + cos2x
We know that sin2x + cos2x = 1
So, f(x) = 1 for every x in R.
So, for all elements in the domain, the image is 1.
So, f is not an injection.

Surjection condition:

Range of f = {1}

Co-domain of f = R

Both are not same.


So, f is not a surjection and f is not a bijection.

3.
Given f: R → R, defined by f(x) = 5x3 + 4
Now we have to check for the given function is injection, surjection and bijection condition.
Injection test:

Let x and y be any two elements in the domain (R), such that f(x) = f(y).
f(x) = f(y)
5x3 + 4 = 5y3 + 4
5x3= 5y3
x3 = y3
x=y
So, f is an injection.
Surjection test:
Let y be any element in the co-domain (R), such that f(x) = y for some element x in R (domain).
f(x) = y
5x3+ 4 = y
x3 = (y – 4)/5 ∈ R
So, f is a surjection and f is a bijection.

18
19

20

21 Given f: R → R be defined by f(x) = x3 −3


Injectivity of f:

Let x and y be two elements in domain (R),


Such that, x3 − 3 = y3 − 3
⇒ x3 = y3
⇒x=y
So, f is one-one.
Surjectivity of f:

Let y be in the co-domain (R)


Such that f(x) = y
⇒ x3 – 3 = y
⇒ x3 = y + 3
⇒ x = ∛(y+3) in R
⇒ f is onto.
So, f is a bijection

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy