Advertisements
Advertisements
प्रश्न
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
उत्तर
(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
संबंधित प्रश्न
Show that the relation R in the set A = {x ∈ Z : 0 ≤ x ≤ 12} given by R = {(a, b) : |a − b| is a multiple of 4} is an equivalence relation. Find the set of all elements related to 1.
The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4
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}
The following relation is defined on the set of real numbers.
aRb if 1 + ab > 0
Find whether relation is reflexive, symmetric or transitive.
Give an example of a relation which is reflexive and symmetric but not transitive?
Give an example of a relation which is symmetric and transitive but not reflexive?
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.
Defines a relation on N :
x > y, 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 A = {2, 3, 4, 5, ..., 17, 18}. Let '≃' be the equivalence relation on A × A, cartesian product of Awith itself, defined by (a, b) ≃ (c, d) if ad = bc. Then, the number of ordered pairs of the equivalence class of (3, 2) is _______________ .
The relation 'R' in N × N such that
(a, b) R (c, d) ⇔ a + d = b + c is ______________ .
A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by : x R y ⇔ x is relatively prime to y. Then, domain of R is ______________ .
Let R be a relation on N defined by x + 2y = 8. The domain of R is _______________ .
If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .
Mark the correct alternative in the following question:
Let L denote the set of all straight lines in a plane. Let a relation R be defined by lRm if l is perpendicular to m for all l, m ∈ L. Then, R is ______________ .
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6} Find (A × B) ∩ (A × C).
In the set of natural numbers N, define a relation R as follows: ∀ n, m ∈ N, nRm if on division by 5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1, 2, 3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets determined by R
Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ______
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.
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 map which is neither one-one nor onto
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
Every relation which is symmetric and transitive is also reflexive.
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
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 ____________.
Let S = {1, 2, 3, 4, 5} and let A = S x S. Define the relation R on A as follows:
(a, b) R (c, d) iff ad = cb. 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 ____________.
Given set A = {a, b, c}. An identity relation in set A 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.
- Let R: B → B be defined by R = {(x, y): x and y are students of same sex}, Then this relation R is ____________.
In a group of 52 persons, 16 drink tea but not coffee, while 33 drink tea. How many persons drink coffee but not tea?
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?
A relation 'R' in a set 'A' is called reflexive, if
lf A = {x ∈ z+ : x < 10 and x is a multiple of 3 or 4}, where z+ is the set of positive integers, then the total number of symmetric relations on A is ______.
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)].
A relation R on (1, 2, 3) is given by R = {(1, 1), (2, 2), (1, 2), (3, 3), (2, 3)}. Then the relation R is ______.
