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
संबंधित प्रश्न
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set A = {1, 2, 3, ..., 13, 14} defined as R = {(x, y) : 3x − y = 0}.
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}.
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set A of human beings in a town at a particular time given by R = {(x, y) : x is exactly 7 cm taller than y}.
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.
The following relation is defined on the set of real numbers.
aRb if a – b > 0
Find whether relation is reflexive, symmetric or transitive.
Is it true that every relation which is symmetric and transitive is also reflexive? Give reasons.
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 ?
Write the identity relation on set A = {a, b, c}.
If R = {(x, y) : x + 2y = 8} is a relation on N by, then write the range of R.
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.
Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.
R is a relation on the set Z of integers and it is given by
(x, y) ∈ R ⇔ | x − y | ≤ 1. Then, R is ______________ .
The relation R defined on the set A = {1, 2, 3, 4, 5} by
R = {(a, b) : | a2 − b2 | < 16} is given by ______________ .
Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.
Show that the relation R on the set Z of integers, given by R = {(a,b):2divides (a - b)} is an equivalence relation.
For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, transitive but not symmetric
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
symmetric but neither reflexive nor transitive
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
A relation R on a non – empty set A is an equivalence relation if it is ____________.
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 A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f is ____________.
An organization conducted a bike race under 2 different categories-boys and girls. Totally there were 250 participants. Among all of them finally, three from Category 1 and two from Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his college project. Let B = {b1,b2,b3} G={g1,g2} where B represents the set of boys selected and G the set of girls who were selected for the final race.
Ravi decides to explore these sets for various types of relations and functions.
- Ravi wishes to form all the relations possible from B to G. How many such relations are possible?
Find: `int (x + 1)/((x^2 + 1)x) dx`
The number of surjective functions from A to B where A = {1, 2, 3, 4} and B = {a, b} 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.
Let a set A = A1 ∪ A2 ∪ ... ∪ Ak, where Ai ∩ Aj = Φ for i ≠ j, 1 ≤ i, j ≤ k. Define the relation R from A to A by R = {(x, y): y ∈ Ai if and only if x ∈ Ai, 1 ≤ i ≤ k}. Then, R is ______.
