English

Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d) if ad (b + c) = bc (a + d). Show that R is an equivalence relation.

Advertisements
Advertisements

Question

Let N denote the set of all natural numbers and R be the relation on N × N defined by (a, b) R (c, d) if ad (b + c) = bc (a + d). Show that R is an equivalence relation.

Advertisements

Solution

To prove a relation R is an equivalence relation, it will be sufficient to prove it as a reflexive, symmetric and transitive relation.

i) Reflexivity:
Let (a, b) be an arbitrary element of N × N.
Now,
a, b ∈ N

ab(a+b)=ba(a+b)

(a,b)R(a,b)

∴ (a, b)R(a, b) for all (a, b) ∈ N × N
Hence, R is reflexive.

ii) Symmetry:
Let (a, b), (c, d) be an arbitrary element of N × N such that (a, b)R(c, d).

 ad(b+c)=bc(a+d)

cb(d+a)=da(c+b)

(c,d)R(a,b)

∴ (a, b)R(c, d) ⇒ (c, d)R(a, b) for all (a, b), (c, d) ∈ N × N
Hence, R is symmetric.

iii) Transitivity:
Let (a, b), (c, d), (e, f) be an arbitrary element of N × N such that (a, b)R(c, d) and (c, d)R(e, f).

ad(b+c)=bc(a+d)

adb+adc=abc+bcd     

cd(ab)=ab(cd)      .....(1)

Also,cf(d+e)=de(c+f)

cfd+cfe=dec+def       

cd(fe)=ef(dc)  ....(2)

From (1) and (2), we have

`(a−b)/(f−e)=−(ab)/(ef)`

aefbef=abf+aeb

aef+abf=aeb+bef

af(b+e)=be(a+f)

(a, b)R(e, f)

∴(a, b)R(c, d) and (c, d)R(e, f) ⇒ (a, b)R(e, f) for all (a, b), (c, d), (e, f) ∈ N × N
Hence, R is transitive.
Thus, R being reflexive, symmetric and transitive, is an equivalence relation on N × N.

shaalaa.com
  Is there an error in this question or solution?
2014-2015 (March) Delhi Set 1

RELATED QUESTIONS

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. Also, obtain the equivalence class [(2, 5)].


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


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.


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.


Show that the relation R, defined in the set A of all polygons as R = {(P1, P2) : P1 and P2 have the same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right-angled triangle T with sides 3, 4 and 5?


Define an equivalence relation ?


Let A = {0, 1, 2, 3} and R be a relation on A defined as
R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}
Is R reflexive? symmetric? transitive?


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, _____________________ .


Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is ______.


For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.


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


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


Write the relation in the Roster form and hence find its domain and range :
R1 = {(a, a2) / a is prime number less than 15}


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


The following defines a relation on N:
x + y = 10, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.


Consider the non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then R is ______.


Every relation which is symmetric and transitive is also reflexive.


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


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


A relation R on a non – empty set A is an equivalence relation if it is ____________.


A relation R in set A = {1, 2, 3} is defined as R = {(1, 1), (1, 2), (2, 2), (3, 3)}. Which of the following ordered pair in R shall be removed to make it an equivalence relation in A?


Given triangles with sides T1: 3, 4, 5; T2: 5, 12, 13; T3: 6, 8, 10; T4: 4, 7, 9 and a relation R inset of triangles defined as R = `{(Delta_1, Delta_2) : Delta_1  "is similar to"  Delta_2}`. Which triangles belong to the same equivalence class?


Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.

A = {S, D}, B = {1,2,3,4,5,6}

  • Let R ∶ B → B be defined by R = {(x, y): y is divisible by x} is ____________.

There are 600 student in a school. If 400 of them can speak Telugu, 300 can speak Hindi, then the number of students who can speak both Telugu and Hindi is:


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?


A relation 'R' in a set 'A' is called a universal relation, if each element of' A' is related to :-


Statement 1: The intersection of two equivalence relations is always an equivalence relation.

Statement 2: The Union of two equivalence relations is always an equivalence relation.

Which one of the following is correct?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×