Advertisements
Advertisements
प्रश्न
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 be the set of all points in a plane such that
A={P : P is a point in the plane}
Let R be the relation such that R={(P, Q) : P, Q∈A and OP=OQ, where O is the origin}
We observe the following properties of R.
Reflexivity: Let P be an arbitrary element of R.
The distance of a point P will remain the same from the origin.
So, OP = OP
⇒ (P, P) ∈ R
So, R is reflexive on A.
Symmetry : Let (P, Q) ∈ R
⇒ OP = OQ
⇒ OQ = OP
⇒ (Q, P) ∈ R
So, R is symmetric on A.
Transitivity: Let (P, Q), (Q, R) ∈ R
⇒ OP= OQ and OQ = OR
⇒ OP= OQ = OR
⇒ OP = OR
⇒ (P, R) ∈ R
So, R is transitive on A.
Hence, R is an equivalence relation on A.
APPEARS IN
संबंधित प्रश्न
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 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 origin as centre.
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 live in the same locality}
Prove that every identity relation on a set is reflexive, but the converse is not necessarily true.
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.
Defines a relation on N :
x > y, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
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.
Let R be a relation on the set A of ordered pair of integers defined by (x, y) R (u, v) if xv = yu. Show that R is an equivalence relation.
If R and S are relations on a set A, then prove that R and S are symmetric ⇒ R ∩ S and R ∪ S are symmetric ?
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 ?
Write the identity relation on set A = {a, b, c}.
If A = {3, 5, 7} and B = {2, 4, 9} and R is a relation given by "is less than", write R as a set ordered pairs.
Let R = {(a, a3) : a is a prime number less than 5} be a relation. Find the range of R.
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 the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs
If R is a relation on the set A = {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3)}, then R is ____________ .
If A = {a, b, c, d}, then a relation R = {(a, b), (b, a), (a, a)} on A is _____________ .
In the set Z of all integers, which of the following relation R is not an equivalence relation ?
Mark the correct alternative in the following question:
For real numbers x and y, define xRy if `x-y+sqrt2` is an irrational number. Then the relation R is ___________ .
If A = {a, b, c}, B = (x , y} find A × B.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∩ C).
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
Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is ______.
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
reflexive, transitive but not symmetric
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is ______.
Let A = { 2, 3, 6 } Which of the following relations on A are reflexive?
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
A relation R on a non – empty set A is an equivalence relation if it is ____________.
Let A = {1, 2, 3, …. n} and B = {a, b}. Then the number of surjections from A into B is ____________.
Let A = {x : -1 ≤ x ≤ 1} and f : A → A is a function defined by f(x) = x |x| then f 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?
Given set A = {a, b, c}. An identity relation in set A is ____________.
If A is a finite set consisting of n elements, then the number of reflexive relations on A is
Which one of the following relations on the set of real numbers R is an equivalence relation?
Let A = {1, 2, 3, 4} and let R = {(2, 2), (3, 3), (4, 4), (1, 2)} be a relation on A. Then R is ______.
Let A = {3, 5}. Then number of reflexive relations on A is ______.
