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 R defined as R = {(a, b) : a ≤ b}, is reflexive and transitive but not symmetric.
Check whether the relation R in R defined by R = {(a, b) : a ≤ b3} is reflexive, symmetric or 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}.
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.
Test whether the following relation R3 is (i) reflexive (ii) symmetric and (iii) transitive:
R3 on R is defined by (a, b) ∈ R3 `⇔` a2 – 4ab + 3b2 = 0.
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.
Defines a relation on N:
xy is square of an integer, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
If R and S are transitive relations on a set A, then prove that R ∪ S may not be a transitive relation on A.
Let C be the set of all complex numbers and C0 be the set of all no-zero complex numbers. Let a relation R on C0 be 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.
If R = {(x, y) : x2 + y2 ≤ 4; x, y ∈ Z} is a relation on Z, write the domain of R.
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 a reflexive relation ?
If a relation R is defined on the set Z of integers as follows:
(a, b) ∈ R ⇔ a2 + b2 = 25. Then, domain (R) is ___________
If A = {1, 2, 3}, B = {1, 4, 6, 9} and R is a relation from A to B defined by 'x is greater than y'. The range of R is ______________ .
If A = {1, 2, 3}, then a relation R = {(2, 3)} on A is _____________ .
In the set Z of all integers, which of the following relation R is not an equivalence relation ?
Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into ______ pairwise disjoint subsets
Consider the set A = {1, 2, 3} and the relation R = {(1, 2), (1, 3)}. R is a transitive relation.
Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n. Show that R is an equivalance relation
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from B to A
Give an example of a map which is one-one but not onto
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 ______.
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.
Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.
Every relation which is symmetric and transitive is also reflexive.
Let A = {1, 2, 3}. Which of the following is not an equivalence relation on A?
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let R = {(L1, L2 ): L1 is parallel to L2 and L1: y = x – 4} then which of the following can be taken as L2?
Let N be the set of all natural numbers and R be a relation on N × N defined by (a, b) R (c, d) `⇔` ad = bc for all (a, b), (c, d) ∈ N × N. Show that R is an equivalence relation on N × N. Also, find the equivalence class of (2, 6), i.e., [(2, 6)].
Let L be a set of all straight lines in a plane. The relation R on L defined as 'perpendicular to' is ______.
