1

CBSE

Relation Functions Revision

CLASS 12 - MATHEMATICS

Time Allowed: 3 hours Maximum Marks : 113

Section A b) Reflexive and transitive but not symmetric

c) Reflexive and symmetric but not transitive
1) The function f : X→ Y defined by f(x) = sin x is one d) An equivalence relation
- one but not onto, if X and Y respectively equal to [1]
11) State True or False: [3]
a) [0,π
[ π ]and ] [0, 1] (a) The relation R on the set A = 1, 2, 3 defined as R
b) −
[ π]2 , π
2 and [- 1, 1] = 1, 1), (1, 2), (2, 1), (3, 3) is reflexive, symmetric
c) 0, 2 and [- 1, 1] and transitive. [1]
d) R and R
(b) Let R = (3, 1), (1, 3), (3, 3) be a relation defined
2) Which of the following is not an equivalence relation on on the set A = 1, 2, 3. Then R is symmetric,
Z? [1] transitive but not reflexive. [1]
a) A R b⇔ a - b is an even integer (c) Every relation which is symmetric and transitive is
b) A R b⇔ a + b is an even integer also reflexive. [1]
c) A R b⇔ a < b 12) Fill in the blanks: [5]
d) A R b⇔ a = b (a) A relation R defined on a set A is said to be
3) F : R→ R : f (x) = x2 is [1] an relation, if R is reflexive, symmetric and
a) Many - one and into b) One - one and into transitive. [1]
c) One - one and onto d) Many - one and onto (b) A relation R on a set A is called , if (a1 , a2 )
4) A function f: X→ Y is said to be one – one and onto ∈ R and (a2 , a3 ) ∈ R implies that (a1 , a3 ) ∈ R, for
if [1] a1 , a2 , a3 ∈ A. [1]
(c) A function f : X→ Y is said to be a function,
a) f is one – one
if it is both one - one and onto. [1]
b) F is onto
c) F is both one – one and onto (d) A relation R in a set A is called , if (a1 , a2 )
d) F is either one – one or onto ∈ implies (a2 , a1 ) ∈ R, for all a1 , a2 ∈ A. [1]
(e) A relation R in a set A is called , if (a1 , a2 )
5) If A = a, b, c, d, then a relation R = (a, b), (b, a), (a,
∈ R implies (a2 , a1 ) ∈ R, for all a1 , a2 ∈ A. [1]
a) on A is [1]
13) Show that the function f :N→ N, defined
a) Asymmetric only n+1
if n is odd
by f (n) = 2 , is one one and onto
b) Symmetric only
2 , if n is even
n

c) Symmetric and transitive only function. [1]

d) Reflexive and transitive only 14) Give an example of a relation which is symmetric but
6) Identity relation R on a set A is [1] neither reflexive nor transitive. [1]
a) Reflexive only b) Transitive only 15) If A = a, b, c, d and f = a, b), (b, d), (c, a), (d, c),
c) Equivalence d) Symmetric only show that f is one - one from A onto A. Find f - 1 [1]
16) Given A = 2, 3, 4, B = 2, 5, 6, 7. Construct an example
7) Let A = 1, 2, 3. Then number of equivalence relations of a mapping from A to B which is not injective. [1]
containing (1, 2) is [1] 17) Let R be the relation on the set Z of all integers de-
a) 4 b) 3 fined by (x, y)∈ R ⇒ x - y is divisible by n Prove
c) 1 d) 2 that: (x, y) ∈ R ⇒ (y, x) ∈ R for all x, y ∈ Z. [1]
8) Let A = 3, 5. Then number of reflexive relations on A 18) Let N be the set of natural numbers and R be the relation
is [1] on N× N defined by (a, b) R (c, d) iff ad = bc for all
a) 4 b) 8 a, b, c, d ∈ N. Show that R is an equivalence relation.
c) 2 d) 0 [2]
19) Check whether the relation R in the set Z of integers
x
2, if x is even
9) Let f : Z→ Z be given by f (x) = defined as R = (a, b) : a + b isdivisible by 2 is reflex-
0, if x is odd
ive, symmetric or transitive. Write the equivalence class
. Then f is [1]
containing 0 i.e. [0]. [2]
a) Onto but not one - one 20) Let R = (a, b) : a, b∈ Z and (a + b) is even. Show
b) Neither one - one nor onto that R is an equivalence relation on Z. [2]
c) One - one but not onto 21) Show that the function f: N→ N given by f (1) = f (2)
d) One - one and onto = 1 and f (x) = x - 1, for every x > 2, is onto but
not one - one. [2]
10) Let A = 1, 2, 3 and let R = (1,1), (2, 2), (3, 3), (1, 3),
22) Let A = 1, 2, 3, 4 and R = (1,1), (2,2), (3,3), (4,4),
(3, 2), (1, 2). Then, R is [1]
(1,2), (1,3), (3,2). Show that R is reflexive and transitive
a) Symmetric and transitive but not reflexive but not symmetric. [2]
 2

23) A function f is defined from R→ R as f(x) = ax + b, such that f(a, b) = (b, a) is a bijective function. [3]
such that f(1) = 1 and f(2) = 3. Find function f(x). 35) Let A be the set of all triangles in a plane and let R
Hence, check whether function f(x) is one - one and be a relation in A, defined by R =(∆1 , ∆2 ) : ∆1 ∼ = ∆2 ,
onto or not. [2] then show that R is an equivalence relation on A. [3]
24) Given a non - empty set X, let X : P (X)× P (X) → 36) Show that a function f:R → R defined as f(x) = 5x−3 4 is
P (X) be defined as A × B = (A – B) ∪ (B – A), ∀ both one - one and onto. [3]
A, B ∈ P (X). Show that the empty set ϕ is the identity 37) In the set of natural numbers N, define a relation R as
for the operation × and all the elements A of P (X) are follows:
invertible with A - 1 = A. (Hint: (A − ϕ) ∪ (ϕ − A) = A ∀ n, m ∈ N, nRm if on division by 5 each of the
and (A - A) ∪ (A - A) = A × A = ϕ ) [2] integers n and m leaves the remainder less than 5, i.e.
25) Determine whether the below relation is reflexive, sym- one of the numbers 0, 1, 2, 3 and 4. Show that R is
metric and transitive: equivalence relation. Also, obtain the pairwise disjoint
Relation R in the set N of natural numbers is defined as subsets determined by R. [3]
R = (x, y) : y = x + 5 and x < 4 [2] 38) Show that the function f : R→ R defined by f (x) =
26) F: R→ R be defined as f(x) = 3x check whether the x2 +1 , ∀x ∈ R , is neither one - one nor onto. [5]
x

function is one - one ,onto or other. [2] 39) Let L be the set of all lines in xy plane and R be the
27) Show that the function f : N→ N : f(x) = x3 is one - relation in L define as R = (L1 , L2 ) : L1 || L2 . Show
one into. [2] that R is an equivalence relation. Find the set of all lines
28) Prove that a function f: [0,∞ ) → [- 5, ∞ ) defined as related to the line y = 2x + 4. [5]
f(x) = 4x2 + 4x - 5 is both one - one and onto. [3] 40) Let A = 1, 2, 3, ....9 and R be the relation in A× A
29) Given a non - empty set X, define the relation R in defined by (a, b) R (c, d) if a + d = b + c for (a, b),
P(X) as follows: (c, d) in A× A. Prove that R is an equivalence relation
For A, B ∈ P(X), (A, B) ∈ R iff A ⊂ B. Prove that R and also obtain the equivalence class [(2, 5)]. [5]
is reflexive, transitive and not symmetric. [3] 41) Show that the relation R in the set A = 1, 2, 3, 4, 5
30) Give an example of a relation, which is: given by R = (a, b) : |a - b| is even, is an equivalence
i. Symmetric but neither reflexive nor transitive. relation. Show that all the elements of 1, 3, 5 are related
ii. Transitive but neither reflexive nor symmetric. to each other and all the elements of 2, 4 are related to
iii. Reflexive and symmetric but not transitive. each other. But no element of 1, 3, 5 is related to any
iv. Reflexive and transitive but not symmetric. element of 2, 4. [5]
[3] 42) Let A = R - 3, B = R - 1]. Iff : A → B be defined
31) Show that the relation S in the set R of real numbers by f (x) = x−2
x−3 ∀x ∈ A . Then, show that f is bijective.
defined as S = (a, b): a, b∈ Rand a ≤ b3 is neither [5]
reflexive nor symmetric nor transitive. [3] 43) Show that the function f: R0 → R0, defined as f (x) = x1
32) Let R = (a, b ) :a ,b∈ N and a < b]. Show that , is one - one onto, where R0 is the set non - zero real
R is a binary relation on N, which is neither reflexive numbers. Is the result true, if the domain R0 is replaced
nor symmetric. Show that R is transitive. by N with co - domain being same as R0 ? [5]
Hint: Since R ⊂ N × N , so it is a binary relation on 44) Let f : W→ W be defined as f(n) = n - 1, if n is odd
N. [3] and f(n) = n + 1, if n is even. Show that f is invertible.
33) A relation R is defined on a set of real numbersR as Find the inverse of f. Here, W is the set of all whole
R = (x, y): x· y is an irrational number. numbers. [5]
Check whether R is reflexive, symmetric and transitive 45) Show that the function f : R - 3→ R - 1 given
or not. [3] by f (x) = x−3
x−2
is a bijection. [5]
34) Let A and B be sets. Show that f : A× B → B × A