Advertisements
Advertisements
प्रश्न
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
उत्तर
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(a−b)=ab(c−d) .....(1)
Also,cf(d+e)=de(c+f)
⇒cfd+cfe=dec+def
⇒cd(f−e)=ef(d−c) ....(2)
From (1) and (2), we have
`(a−b)/(f−e)=−(ab)/(ef)`
⇒aef−bef=−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.
APPEARS IN
संबंधित प्रश्न
Show that the relation R in the set R of real numbers, defined as R = {(a, b) : a ≤ b2} is neither reflexive nor symmetric nor transitive.
Show that the relation R in the set A of points in a plane given by R = {(P, Q) : distance of the point P from the origin is the same as the distance of the point Q from the origin} is an equivalence relation. Further, show that the set of all points related to a point P ≠ (0, 0) is the circle passing through P with the origin as its centre.
The following relation is defined on the set of real numbers.
aRb if a – b > 0
Find whether relation is reflexive, symmetric or transitive.
If A = {1, 2, 3, 4} define relations on A which have properties of being reflexive, transitive but not symmetric ?
Give an example of a relation which is reflexive and transitive but not symmetric?
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.
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 O be the origin. We define a relation between two points P and Q in a plane if OP = OQ. Show that the relation, so defined is an equivalence relation.
Define a reflexive relation ?
The relation R defined on the set A = {1, 2, 3, 4, 5} by
R = {(a, b) : | a2 − b2 | < 16} is given by ______________ .
Show that the relation R on the set Z of integers, given by R = {(a,b):2divides (a - b)} is an equivalence relation.
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 = {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}
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 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
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 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 ∀ a, b ∈ T. Then R is ______.
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
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 ______.
Which of the following is not an equivalence relation on I, the set of integers: x, y
Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.
Given set A = {a, b, c}. An identity relation in set A is ____________.
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 ____________.
Find: `int (x + 1)/((x^2 + 1)x) dx`
Let R = {(x, y) : x, y ∈ N and x2 – 4xy + 3y2 = 0}, where N is the set of all natural numbers. Then the relation R is ______.
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?
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.
