Advertisements
Advertisements
प्रश्न
Let Z be the set of all integers and Z0 be the set of all non-zero integers. Let a relation R on Z × Z0be defined as (a, b) R (c, d) ⇔ ad = bc for all (a, b), (c, d) ∈ Z × Z0,
Prove that R is an equivalence relation on Z × Z0.
Advertisements
उत्तर
We observe the following properties of R.
Reflexivity :
Let (a, b) be an arbitrary element of Z × Z0. Then,
(a, b) ∈ Z × Z0
⇒ a, b ∈ Z, Z0
⇒ ab = ba
⇒ (a, b) ∈ R for all (a, b) ∈ Z × Z0
So, R is reflexive on Z × Z0.
Symmetry :
Let (a, b), (c, d) ∈ Z×Z0 such that (a, b) R (c, d). Then,(a, b) R (c, d)
⇒ ad = bc
⇒ cb = da
⇒ (c, d) R (a, b)
Thus,
(a, b) R (c, d)⇒ (c, d) R (a, b) for all (a, b), (c, d) ∈ Z× Z0
So, R is symmetric on Z×Z0.
Transitivity :
Let(a,b), (c,d),(e,f) ∈N × N0suchthat a,b) R(c,d) and(c,d) R(e,f).Then,
a, b) R (c, d)⇒ ad =bc (c, d) R (e, f) ⇒ cf =de } ⇒ (ad) (cf)=(bc) (de)
⇒ af=be
⇒ (a, b) R (e, f)
Thus,
(a, b) R (c, d) and (c, d ) R (e, f) ⇒ (a, b) R (e, f)
⇒(a, b) R (e, f) for all values (a, b), (c, d), (e, f) ∈ N × N0
So, R is transitive on N × N0.
APPEARS IN
संबंधित प्रश्न
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. Also, obtain the equivalence class [(2, 5)].
Check whether the relation R defined in the set {1, 2, 3, 4, 5, 6} as R = {(a, b) : b = a + 1} is reflexive, symmetric or transitive.
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.
Given an example of a relation. Which is symmetric and transitive but not reflexive.
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.
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 R be the relation in the set N given by R = {(a, b) : a = b – 2, b > 6}. Choose the correct answer.
Test whether the following relation R2 is (i) reflexive (ii) symmetric and (iii) transitive:
R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5
Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?
Give an example of a relation which is transitive but neither reflexive nor symmetric?
Defines a relation on N :
x + y = 10, x, y∈ N
Determine the above relation is reflexive, symmetric and transitive.
m is said to be related to n if m and n are integers and m − n is divisible by 13. Does this define an equivalence relation?
If R and S are relations on a set A, then prove that R is reflexive and S is any relation ⇒ R ∪ S is reflexive ?
If R = {(x, y) : x2 + y2 ≤ 4; x, y ∈ Z} is a relation on Z, write the domain of R.
If R = {(x, y) : x + 2y = 8} is a relation on N by, then write the range of R.
Define a symmetric relation ?
State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} to be transitive ?
Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : | a2- b2 | < 8}. Write R as a set of ordered pairs.
The relation R defined on the set A = {1, 2, 3, 4, 5} by
R = {(a, b) : | a2 − b2 | < 16} is given by ______________ .
Let R be the relation over the set of all straight lines in a plane such that l1 R l2 ⇔ l 1⊥ l2. Then, R is _____________ .
A relation ϕ from C to R is defined by x ϕ y ⇔ | x | = y. Which one is correct?
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).
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 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 following defines a relation on N:
x is greater than y, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
The following defines a relation on N:
x + y = 10, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
The maximum number of equivalence relations on the set A = {1, 2, 3} are ______.
R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is ____________.
Let `"f"("x") = ("x" - 1)/("x" + 1),` then f(f(x)) 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 R be the relation “is congruent to” on the set of all triangles in a plane is ____________.
A relation R in set A = {1, 2, 3} is defined as R = {(1, 1), (1, 2), (2, 2), (3, 3)}. Which of the following ordered pair in R shall be removed to make it an equivalence relation in A?
The relation R = {(1,1),(2,2),(3,3)} on {1,2,3} is ____________.
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.
Which relation is identified as an equivalence relation?
Which combination of properties is required for an equivalence relation?
