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.
उत्तर
(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
संबंधित प्रश्न
Given an example of a relation. Which is Reflexive and symmetric but not transitive.
Let A be the set of all human beings in a town at a particular time. Determine whether of 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 of the following relation is reflexive, symmetric and transitive:
R = {(x, y) : x is father of and y}
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.
Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.
Is it true that every relation which is symmetric and transitive is also reflexive? Give reasons.
An integer m is said to be related to another integer n if m is a multiple of n. Check if the relation is symmetric, reflexive and transitive.
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?
Given the relation R = {(1, 2), (2, 3)} on the set A = {1, 2, 3}, add a minimum number of ordered pairs so that the enlarged relation is symmeteric, transitive and reflexive.
Show that the relation R defined by R = {(a, b) : a – b is divisible by 3; a, b ∈ Z} is an equivalence relation.
Let n be a fixed positive integer. Define a relation R on Z as follows:
(a, b) ∈ R ⇔ a − b is divisible by n.
Show that R is an equivalence relation on Z.
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?
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
A = {1, 2, 3, 4, 5, 6, 7, 8} and if R = {(x, y) : y is one half of x; x, y ∈ A} is a relation on A, then write R as a set of ordered pairs.
Let A = {2, 3, 4, 5} and B = {1, 3, 4}. If R is the relation from A to B given by a R b if "a is a divisor of b". Write R as a set of ordered pairs.
If A = {a, b, c}, then the relation R = {(b, c)} on A is _______________ .
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 _______________ .
A relation ϕ from C to R is defined by x ϕ y ⇔ | x | = y. Which one is correct?
Let A = {1, 2, 3} and B = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ________________ .
If A = {1, 2, 3}, then a relation R = {(2, 3)} on A is _____________ .
If f (x) = `(4x + 3)/(6x - 4) , x ≠ 2/3`, show that fof (x) = x for all ` x ≠ 2/3` . Also, find the inverse of f.
Show that the relation R defined by (a, b)R(c,d) ⇒ a + d = b + c on the A x A , where A = {1, 2,3,...,10} is an equivalence relation. Hence write the equivalence class [(3, 4)]; a, b, c,d ∈ A.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find (A × B) ∪ (A × C).
Write the relation in the Roster form and hence find its domain and range:
R2 = `{("a", 1/"a") "/" 0 < "a" ≤ 5, "a" ∈ "N"}`
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
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 maximum number of equivalence relations on the set A = {1, 2, 3} are ______.
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.
A relation R on a non – empty set A is an equivalence relation if it is ____________.
Let us define a relation R in R as aRb if a ≥ b. Then R 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 ____________.
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 ____________.