मराठी

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.

Advertisements
Advertisements

प्रश्न

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.

बेरीज
Advertisements

उत्तर

Here (a, b)R(c,d) ⇒ a + d = b + c on A x A, where A =  {1, 2,3,...,10} .

Reflexivity: Let (a, b) be an arbitrary element of A x A. Then, (a,b) ∈ A x A `forall` a, b ∈  A.


So, a + b = b + a 
⇒ (a,b) R (a,b).


Thus, (a,b) R (a,b) `forall` (a,b) ∈  A x A.
Hence R is reflexive.


Symmetry: Let (a,b), (c,d) ∈ A x A be such that (a,b) R (c,d).


Then, a + d = b + c 
⇒ c + b = d + a 
⇒ (c,d ) R (a,b).


Thus, (a,b) R (c,d)
⇒ (c,d) R (a,b) `forall` (a,b), (c,d) ∈  A x A.
Hence R is symmetric.


Transitivity: Let (a,b),(c,d),(e,f) ∈  A x A be such that (a,b) R (c,d) R (e,f).

Then, a + d = b + c and c + f = d + e
⇒ (a+d) + (c+f)
= (b + c) + (d+e)

⇒ a + f = b + e
⇒ (a, b) R (e,f).


That is (a,b) R (c,d) and (c,d) R (e,f)
⇒ (a,b) R (e,f) `forall` (a,b), (c,d), (e,f) ∈  A x A.

Hence R is transitive.

Since R is reflexive, symmetric and transitive so, R is an equivalence relation as well.

For the equivalence class of [(3, 4)], we need to find (a,b) s.t. (a,b) R (3,4)
⇒ a + 4 = b + 3
⇒ b - a = 1.

So, [(3,4)] = {(1,2),(2,3),(3,4),(4,5),(5,6),(6,7),(7,8),(8,9),(9,10)}.

shaalaa.com
  या प्रश्नात किंवा उत्तरात काही त्रुटी आहे का?
2015-2016 (March) All India Set 1 E

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

Determine whether the following relation is reflexive, symmetric and transitive:

Relation R in the set N of natural numbers defined as R = {(x, y) : y = x + 5 and x < 4}.


Show that the relation R in the set {1, 2, 3} given by R = {(1, 2), (2, 1)} is symmetric but neither reflexive nor transitive.


Show that the relation R in the set A = {1, 2, 3, 4, 5} given by R = {(a, b) : |a − b| is even}, is an equivalence relation. Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are related to each other. But no element of {1, 3, 5} is related to any element of {2, 4}.


Given an example of a relation. Which is reflexive and symmetric but not transitive.


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


Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.


The following relation is defined on the set of real numbers.
aRb if a – b > 0

Find whether relation is reflexive, symmetric or transitive.


The following relation is defined on the set of real numbers.  aRb if |a| ≤ b

Find whether relation is reflexive, symmetric or transitive.


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


Defines a relation on N:

x + 4y = 10, x, y ∈ N

Determine the above relation is reflexive, symmetric and transitive.


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


Write the smallest equivalence relation on the set A = {1, 2, 3} ?


R is a relation on the set Z of integers and it is given by
(x, y) ∈ R ⇔ | x − y | ≤ 1. Then, R is ______________ .


Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on set A = a, b, c. Then, R is _______________ .


If R is the largest equivalence relation on a set A and S is any relation on A, then _____________ .


If R is a relation on the set A = {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3)}, then R is ____________ .


Mark the correct alternative in the following question:

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 _______________ .


Show that the relation S in the set A = [x ∈ Z : 0 ≤ x ≤ 12] given by S = [(a, b) : a, b ∈ Z, ∣a − b∣ is divisible by 3] is an equivalence relation.


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


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


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


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


If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is ______.


The relation R on the set A = {1, 2, 3} defined as R = {{1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and transitive.


If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.


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 be a relation on B defined by R = {(1,2), (2,2), (1,3), (3,4), (3,1), (4,3), (5,5)}. Then R is:

A relation 'R' in a set 'A' is called reflexive, if


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×