हिंदी

Define the relation R in the set N × N as follows: For (a, b), (c, d) ∈ N × N, (a, b) R (c, d) if ad = bc. Prove that R is an equivalence relation in N × N. - Mathematics

Advertisements
Advertisements

प्रश्न

Define the relation R in the set N × N as follows:

For (a, b), (c, d) ∈ N × N, (a, b) R (c, d) if ad = bc. Prove that R is an equivalence relation in N × N.

योग
Advertisements

उत्तर

Let (a, b), (c, d) ∈ N × N.

Then we have ab = ba  .....(By the commutative property of multiplication of natural numbers)

⇒ (a, b) R (a, b)

Hence, R is reflexive.

Let (a, b), (c, d) ∈ N × N such that (a, b) R (c, d).

Then ad = bc

⇒ cb = da  ......(By the commutative property of multiplication of natural numbers)

⇒ (c, d) R (a, b)

Hence, R is symmetric.

Let (a, b), (c, d), (e, f) ∈ N × N such that (a, b) R (c, d) and (c, d) R (e, f).

Then ad = bc, cf = de

⇒ adcf = bcde

⇒ af = be

⇒ (a, b) R (e, f)

Hence, R is transitive.

Since, R is reflexive, symmetric and transitive, R is an equivalence relation on N × N.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
2022-2023 (March) Sample

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

Let A = {abc} and the relation R be defined on A as follows: R = {(aa), (bc), (ab)}. Then, write minimum number of ordered pairs to be added in R to make it reflexive and transitive.


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 R be a relation on the set A of ordered pair of integers defined by (x, y) R (u, v) if xv = yu. Show that R is an equivalence relation.


Let C be the set of all complex numbers and Cbe the set of all no-zero complex numbers. Let a relation R on Cbe defined as

`z_1 R  z_2  ⇔ (z_1 -z_2)/(z_1 + z_2)` is real for all z1, z2 ∈ C0.

Show that R is an equivalence relation.


Write the smallest reflexive relation on set A = {1, 2, 3, 4}.


Let R = {(x, y) : |x2 − y2| <1) be a relation on set A = {1, 2, 3, 4, 5}. Write R as a set of ordered pairs.


Define an equivalence relation ?


If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.


State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} to be transitive ?


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 the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs


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


Let A = {2, 3, 4, 5, ..., 17, 18}. Let '≃' be the equivalence relation on A × A, cartesian product of Awith itself, defined by (a, b) ≃ (c, d) if ad = bc. Then, the number of ordered pairs of the equivalence class of (3, 2) is _______________ .


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


Mark the correct alternative in the following question:

Let R be a relation on the set N of natural numbers defined by nRm if n divides m. 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.


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 × A.


Let A = {6, 8} and B = {1, 3, 5}.
Let R = {(a, b)/a∈ A, b∈ B, a – b is an even number}. Show that R is an empty relation from A to B.


Let A = {a, b, c} and the relation R be defined on A as follows:
R = {(a, a), (b, c), (a, b)}.
Then, write minimum number of ordered pairs to be added in R to make R reflexive and transitive


Give an example of a map which is not one-one but onto


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


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


Total number of equivalence relations defined in the set S = {a, b, c} is ____________.


Let the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4}. Then [1], the equivalence class containing 1, is:


A general election of Lok Sabha is a gigantic exercise. About 911 million people were eligible to vote and voter turnout was about 67%, the highest ever


Let I be the set of all citizens of India who were eligible to exercise their voting right in the general election held in 2019. A relation ‘R’ is defined on I as follows:

R = {(V1, V2) ∶ V1, V2 ∈ I and both use their voting right in the general election - 2019}

  • Mr. Shyam exercised his voting right in General Election-2019, then Mr. Shyam is related to which of the following?

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


Given a non-empty set X, define the relation R in P(X) as follows:

For A, B ∈ P(X), (4, B) ∈ R iff A ⊂ B. Prove that R is reflexive, transitive and not symmetric.


If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×