मराठी

Prove that the Relation R on Z Defined by (A, B) ∈ R ⇔ a − B is Divisible by 5 is an Equivalence Relation on Z.

Advertisements
Advertisements

प्रश्न

Prove that the relation R on Z defined by
(a, b) ∈ R ⇔ a − b is divisible by 5
is an equivalence relation on Z.

बेरीज
Advertisements

उत्तर

We observe the following properties of relation R.

Reflexivity :

Let a be an arbitrary element of R. Then,

⇒ a−a = 0 = 0 × 5

⇒ a−a is divisible by 5

⇒ (a, a) ∈ R for all a ∈ Z

So, R is reflexive on Z.

Symmetry :

Let (a, b) ∈ R

⇒ a−b is divisible by 5

⇒ a−b = 5p for some p ∈ Z

⇒ b−a = 5 (−p)

Here, −p ∈ Z                      [ Since p ∈ Z]

⇒ b−a is divisible by 5

⇒ (b, a) ∈ R for all a, b ∈ Z

So, R is symmetric on Z.

Transitivity :

Let (a, b) and (b, c) ∈ R

⇒ a−b is divisible by 5

⇒ a−b = 5p for some Z

Also, b−c is divisible by 5

⇒ b−c = 5q for some Z

Adding the above two, we get

a −b + b−c = 5p + 5q

⇒ a−c = 5 ( p + q )

⇒ a−c is divisible by 5

Here,  p + q ∈ Z

⇒ (a, c) ∈ R for all a, c ∈ Z

So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
पाठ 1: Relations - Exercise 1.2 [पृष्ठ २६]

APPEARS IN

आर.डी. शर्मा Mathematics Volume 1 and 2 [English] Class 12
पाठ 1 Relations
Exercise 1.2 | Q 3 | पृष्ठ २६

संबंधित प्रश्‍न

Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have the same number of pages} is an equivalence relation.


Let R be the relation in the set N given by R = {(a, b) : a = b – 2, b > 6}. Choose the correct answer.


Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.


Is it true that every relation which is symmetric and transitive is also reflexive? Give reasons.


Give an example of a relation which is reflexive and transitive but not symmetric?


Give an example of a relation which is symmetric and transitive but not reflexive?


Give an example of a relation which is symmetric but neither reflexive nor transitive?


Let A = {1, 2, 3} and R = {(1, 2), (1, 1), (2, 3)} be a relation on A. What minimum number of ordered pairs may be added to R so that it may become a transitive relation on A.


Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b},  is an equivalence relation.


Let Z be the set of integers. Show that the relation
 R = {(a, b) : a, b ∈ Z and a + b is even}
is an equivalence relation on Z.


Write the domain of the relation R defined on the set Z of integers as follows:-
(a, b) ∈ R ⇔ a2 + b2 = 25


Write the identity relation on set A = {a, b, c}.


Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.


For the set A = {1, 2, 3}, define a relation R on the set A as follows:
R = {(1, 1), (2, 2), (3, 3), (1, 3)}
Write the ordered pairs to be added to R to make the smallest equivalence relation.


Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,


The relation 'R' in N × N such that
(a, b) R (c, d) ⇔ a + d = b + c is ______________ .


If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from A to B defined by 'x is greater than y'. The range of R is ______________ .


Let A = {1, 2, 3} and B = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ________________ .


Let R be the relation on the set A = {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Then, _____________________ .


Show that the relation R on the set Z of all integers, given by R = {(a,b) : 2 divides (a-b)} is an equivalence relation.


Let A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}. Is R reflexive? symmetric? transitive?


Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.


Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from B to A


The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.


Which of the following is not an equivalence relation on I, the set of integers: x, y


Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.


If f(x) = `1 - 1/"x", "then f"("f"(1/"x"))` ____________.


Let S = {1, 2, 3, 4, 5} and let A = S x S. Define the relation R on A as follows:
(a, b) R (c, d) iff ad = cb. Then, R is ____________.


The relation R is defined on the set of natural numbers as {(a, b) : a = 2b}. Then, R-1 is given by ____________.


Given set A = {a, b, c}. An identity relation in set A is ____________.


If A is a finite set consisting of n elements, then the number of reflexive relations on A is


If f(x + 2a) = f(x – 2a), then f(x) is:


Let a set A = A1 ∪ A2 ∪ ... ∪ Ak, where Ai ∩ Aj = Φ for i ≠ j, 1 ≤ i, j ≤ k. Define the relation R from A to A by R = {(x, y): y ∈ Ai if and only if x ∈ Ai, 1 ≤ i ≤ k}. Then, R is ______.


Let A = {1, 2, 3, 4} and let R = {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A. Then R is ______.


Read the following passage:

An organization conducted bike race under two different categories – Boys and Girls. There were 28 participants in all. Among all of them, finally three from category 1 and two from category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project.
Let B = {b1, b2, b3} and G = {g1, g2}, where B represents the set of Boys selected and G the set of Girls selected for the final race.

Based on the above information, answer the following questions:

  1. How many relations are possible from B to G? (1)
  2. Among all the possible relations from B to G, how many functions can be formed from B to G? (1)
  3. Let R : B `rightarrow` B be defined by R = {(x, y) : x and y are students of the same sex}. Check if R is an equivalence relation. (2)
    OR
    A function f : B `rightarrow` G be defined by f = {(b1, g1), (b2, g2), (b3, g1)}. Check if f is bijective. Justify your answer. (2)

Which relation is an example of an Empty Relation for \(A=\{1,2\}\)?


A relation \(R\) is transitive if which condition is satisfied?


Which pair of relations are called trivial relations?


What should be checked to determine whether a relation is symmetric?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×