Advertisements
Advertisements
प्रश्न
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 father of y}
Advertisements
उत्तर
(i) Reflexivity:
Let x be an arbitrary element of R.
Then, x is father of x cannot be true since no one can be father of himself.
So, R is not a reflexive relation.
(ii) Symmetric:
Let (x, y) ∈ R
⇒ x is father of y.
⇒ y is son/daughter of x.
⇒ (y, x) ∉ R
So, R is not a symmetric relation.
(iii) Transitivity:
Let (x, y) ∈ R and (y, z) ∈ R.
Then, x is father of y and y is father of z.
⇒ x is grandfather of z.
⇒ (x, z) ∉ R
So, R is not a transitive relation.
Hence, R is not reflexive, not symmetric and not transitive.
संबंधित प्रश्न
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set N of natural numbers defined as R = {(x, y) : y = x + 5 and x < 4}.
Determine whether the following relation is reflexive, symmetric and transitive:
Relation R in the set Z of all integers defined as R = {(x, y) : x – y is an integer}.
Show that the relation R in the set R of real numbers, defined as R = {(a, b) : a ≤ b2} is neither reflexive nor symmetric nor 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.
Show that the relation R in the set A of all the books in a library of a college, given by R = {(x, y) : x and y have the same number of pages} is an equivalence relation.
Given an example of a relation. Which is transitive but neither reflexive nor symmetric.
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.
Show that the relation '≥' on the set R of all real numbers is reflexive and transitive but not symmetric ?
Let Z be the set of integers. Show that the relation
R = {(a, b) : a, b ∈ Z and a + b is even}
is an equivalence relation on Z.
Let R be the relation defined on the set A = {1, 2, 3, 4, 5, 6, 7} by R = {(a, b) : both a and b are either odd or even}. Show that R is an equivalence relation. Further, show that all the elements of the subset {1, 3, 5, 7} are related to each other and all the elements of the subset {2, 4, 6} are related to each other, but no element of the subset {1, 3, 5, 7} is related to any element of the subset {2, 4, 6}.
If R and S are transitive relations on a set A, then prove that R ∪ S may not be a transitive relation on A.
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
If R = {(x, y) : x + 2y = 8} is a relation on N by, then write the range of R.
Define a transitive relation ?
Let R be the equivalence relation on the set Z of the integers given by R = { (a, b) : 2 divides a - b }.
Write the equivalence class [0].
Write the smallest equivalence relation on the set A = {1, 2, 3} ?
R is a relation on the set Z of integers and it is given by
(x, y) ∈ R ⇔ | x − y | ≤ 1. Then, R is ______________ .
Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.
Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is ______.
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 = ______
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from A to B which is not injective
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from B to A
The following defines a relation on N:
x + y = 10, x, y ∈ N
Determine which of the above relations are reflexive, symmetric and transitive.
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 and also obtain the equivalent class [(2, 5)]
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 – b2| < 8. Then R is given by ______.
Let A = { 2, 3, 6 } Which of the following relations on A are reflexive?
Total number of equivalence relations defined in the set S = {a, b, c} is ____________.
A relation 'R' in a set 'A' is called a universal relation, if each element of' A' is related to :-
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)].
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?
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.
Which statement defines a Universal Relation?
Which statement about the Identity Relation is correct?
What should be checked to determine whether a relation is symmetric?
