Advertisements
Advertisements
Question
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.
Advertisements
Solution
(i) Test for reflexivity:
Since, `(z_1 -z_1)/(z_1 + z_1)`= 0, which is a real number.
So, (z1, z1) ∈ R
Hence, R is relexive relation.
(ii) Test for symmetric:
Let ( z1, z2 ) ∈ R.
Then `(z_1 -z_2)/(z_1 + z_2) =x`, where x is real
⇒ − `(z_1 -z_2)/(z_1 + z_2) = -x `
⇒ `(z_2 -z_1)/(z_2 + z_1)` = −x, is also a real number
So, (z2, z1) ∈ R
Hence, R is symmetric relation.
(iii) Test for transivity:
Let (z1, z2) ∈ R and (z2, z3) ∈ R.
Then,
`(z_1 -z_2)/(z_1 + z_2) x,`where x is a real number.
⇒ z1 − z2 = xz1 + xz2
⇒ z1 − xz1 = z2 + xz2
⇒ z1 (1 − x) = z2 (1 + x)
⇒ `z_1/z_2 = (1 +x )/(1-x)` ...(1)
Also,
`(z_2 -z_3)/(z_2+ z_3)`= y, where y is a real number.
⇒ z2 − z3= yz2 + Yz3
⇒z2 − yz2 = z3 + yz3
⇒ z2 (1 − y) = z3 (1 + y)
⇒ `z_2/z_3 = ((1+y))/((1 -y))` ...(2)
Dividing (1) and (2), we get
`z_1/z_3= ((1+x)/(1-x)) xx ((1-y)/(1 +y))` = z, where z is a real number.
`(z_1 -z_3)/(z_1+ z_3) = (z-1 ) /(z+1), which is real `
⇒ (z1, z3) ∈ R
Hence, R is transitive relation
From (i), (ii), and (iii),
R is an equivalenve relation.
APPEARS IN
RELATED QUESTIONS
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)].
If R=[(x, y) : x+2y=8] is a relation on N, write the range of R.
Given an example of a relation. Which is transitive but neither reflexive nor symmetric.
Let R be the relation in the set {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Choose the correct answer.
Let A be the set of all human beings in a town at a particular time. Determine whether the following relation is reflexive, symmetric and transitive:
R = {(x, y) : x and y work at the same place}
Let A be the set of all human beings in a town at a particular time. Determine whether the following relation is reflexive, symmetric and transitive:
R = {(x, y) : x and y live in the same locality}
Let A be the set of all human beings in a town at a particular time. Determine whether the following relation is reflexive, symmetric and transitive:
R = {(x, y) : x is wife of y}
Let A = {1, 2, 3}, and let R1 = {(1, 1), (1, 3), (3, 1), (2, 2), (2, 1), (3, 3)}, R2 = {(2, 2), (3, 1), (1, 3)}, R3 = {(1, 3), (3, 3)}. Find whether or not each of the relations R1, R2, R3 on A is (i) reflexive (ii) symmetric (iii) transitive.
The following relation is defined on the set of real numbers.
aRb if 1 + ab > 0
Find whether relation is reflexive, symmetric or 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 it reflexive and transitive.
Show that the relation R, defined in the set A of all polygons as R = {(P1, P2) : P1 and P2 have the same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right-angled triangle T with sides 3, 4 and 5?
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.
Let A = {3, 5, 7}, B = {2, 6, 10} and R be a relation from A to B defined by R = {(x, y) : x and y are relatively prime}. Then, write R and R−1.
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 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 _____________ .
Mark the correct alternative in the following question:
The maximum number of equivalence relations on the set A = {1, 2, 3} is _______________ .
For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.
Show that the relation S in the set A = [x ∈ Z : 0 ≤ x ≤ 12] given by S = [(a, b) : a, b ∈ Z, ∣a − b∣ is divisible by 3] is an equivalence relation.
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 = {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
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 not one-one but onto
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 following defines a relation on N:
x + 4y = 10 x, y ∈ N.
Determine which of the above relations are reflexive, symmetric and transitive.
Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.
Let A = {1, 2, 3}, then the relation R = {(1, 1), (1, 2), (2, 1)} on A is ____________.
Let R be a relation on the set N of natural numbers denoted by nRm ⇔ n is a factor of m (i.e. n | m). Then, R is ____________.
Total number of equivalence relations defined in the set S = {a, b, c} is ____________.
The relation R = {(1,1),(2,2),(3,3)} on {1,2,3} is ____________.
The value of k for which the system of equations x + ky + 3z = 0, 4x + 3y + kz = 0, 2x + y + 2z = 0 has nontrivial solution is
A market research group conducted a survey of 2000 consumers and reported that 1720 consumers like product P1 and 1450 consumers like product P2. What is the least number that must have liked both the products?
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 ______.
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?
For \(A=\{1,2\}\), which relation is the Universal Relation?
Which relation demonstrates a symmetric relation?
A relation \(R\) is transitive if which condition is satisfied?
