English

Show that the Relation R Defined by R = {(A, B) : a – B is Divisible by 3; A, B ∈ Z} is an Equivalence Relation.

Advertisements
Advertisements

Question

Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.

Sum
Advertisements

Solution

We observe the following relations of relation R.

Reflexivity : 

Let a be an arbitrary element of R. Then,

aa=0=0 × 3

⇒ aa is divisible by 3

⇒ (a, a∈ R for all ∈ Z

So, R is reflexive on Z.

Symmetry :

Let (a, b∈ R

⇒ ab is divisible by 3

⇒ ab 3p for some ∈ Z

⇒ b=3 (p)

Here, ∈ Z

⇒ ba is divisible by 3

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

So, R is symmetric on Z.

Transitivity:

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

⇒ ab and bc are divisible by 3

⇒ ab=3p for some ∈ Z

and b− 3q for some ∈ Z

Adding the above two, we get

  − b b− c3p3q

⇒ a=3 (p+q)

Here, p+∈ Z

⇒ ac is divisible by 3

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

So, R is transitive on Z.

Hence, R is an equivalence relation on Z.

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Relations - Exercise 1.2 [Page 26]

APPEARS IN

R.D. Sharma Mathematics Volume 1 and 2 [English] Class 12
Chapter 1 Relations
Exercise 1.2 | Q 1 | Page 26

RELATED QUESTIONS

Show that the relation R in R defined as R = {(a, b) : a ≤ b}, is reflexive and transitive but not symmetric.


Show that the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12} given by R = {(a, b) : a = b} is an equivalence relation. Find the set of all elements related to 1.


Given an example of a relation. Which is symmetric but neither reflexive nor transitive.


Three relations R1, R2 and R3 are defined on a set A = {a, b, c} as follows:
R1 = {(a, a), (a, b), (a, c), (b, b), (b, c), (c, a), (c, b), (c, c)}
R2 = {(a, a)}
R3 = {(b, c)}
R4 = {(a, b), (b, c), (c, a)}.

Find whether or not each of the relations R1, R2, R3, R4 on A is (i) reflexive (ii) symmetric and (iii) transitive.


Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.


If = {1, 2, 3, 4} define relations on A which have properties of being reflexive, symmetric and transitive ?


An integer m is said to be related to another integer n if m is a multiple of n. Check if the relation is symmetric, reflexive and transitive.


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


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 n be a fixed positive integer. Define a relation R on Z as follows:
(a, b) ∈ R ⇔ a − b is divisible by n.
Show that R is an equivalence relation on Z.


Let S be a relation on the set R of all real numbers defined by
S = {(a, b) ∈ R × R : a2 + b2 = 1}
Prove that S is not an equivalence relation on R.


If R and S are relations on a set A, then prove that R and S are symmetric ⇒ R ∩ S and R ∪ S are symmetric ?


Mark the correct alternative in the following question:

Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b for all a, b  T. Then, R is ____________ .


Show that the relation R defined by (a, b)R(c,d) ⇒ a + d = b + c   on the A x A  , where A =  {1, 2,3,...,10}  is an equivalence relation. Hence write the equivalence class [(3, 4)]; a, b, c,d ∈ A.


If A = {a, b, c}, B = (x , y} find A × A.


Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∩ C).


Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∪ C).


R = {(a, b) / b = a + 1, a ∈ Z, 0 < a < 5}. Find the Range of R.


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?


Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if and only if l is perpendicular to m ∀ l, m ∈ L. Then R is ______.


Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive


Give an example of a map which is neither one-one nor onto


Let A = {1, 2, 3, ... 9} and R be the relation in A × A defined by (a, b) R(c, d) if a + d = b + c for (a, b), (c, d) in A × A. Prove that R is an equivalence relation and also obtain the equivalent class [(2, 5)]


Let A = {1, 2, 3} and consider the relation R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}. Then R is ______.


Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.


Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 – b2| < 8. Then R is given by ______.


Every relation which is symmetric and transitive is also reflexive.


Let R be the relation on N defined as by x + 2 y = 8 The domain of R is ____________.


Let A = {1, 2, 3}, then the relation R = {(1, 1), (1, 2), (2, 1)} on A is ____________.


Let `"f"("x") = ("x" - 1)/("x" + 1),` then f(f(x)) is ____________.


Let us define a relation R in R as aRb if a ≥ b. 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 = {1, 2, 3} and a relation R = {(1, 2), (2, 1)}, the relation R will be ____________.


A market research group conducted a survey of 2000 consumers and reported that 1720 consumers like product P1 and 1450 consumers like product P2. What is the least number that must have liked both the products?


Which statement defines a Universal Relation?


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


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


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×