Advertisements
Advertisements
प्रश्न
Give an example of a relation which is symmetric and transitive but not reflexive?
Advertisements
उत्तर
Let A = {−5, −6}
The relation R on a set A is defined as follows:
R = {−5, −6), (−6, −5), (−5, −5)}
The relation R is not reflexive because (−6, −6) ∉ R.
∴ R is not reflexive.
⇒ The relation R is symmetric because (−5, −6) ∈ R and (−6, −5) ∈ R.
∴ R is symmetric.
⇒ And, if (−5, −6) and (−6, −5) ∈ R, then (−5, −5) ∈ R
∴ R is transitive.
Hence, the relation R is symmetric and transitive but not reflexive.
APPEARS IN
संबंधित प्रश्न
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 points in a plane given by R = {(P, Q) : distance of the point P from the origin is the 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 the origin as its centre.
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}
Three relations R1, R2 and R3 are defined on a set A = {a, b, c} as follows:
R1 = {(a, a), (a, b), (a, c), (b, b), (b, c), (c, a), (c, b), (c, c)}
R2 = {(a, a)}
R3 = {(b, c)}
R4 = {(a, b), (b, c), (c, a)}.
Find whether or not each of the relations R1, R2, R3, R4 on A is (i) reflexive (ii) symmetric and (iii) transitive.
Give an example of a relation which is reflexive and symmetric but not transitive?
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.
Defines a relation on N :
x + y = 10, x, y∈ N
Determine the above relation is reflexive, symmetric and transitive.
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?
Show that the relation R on the set A = {x ∈ Z ; 0 ≤ x ≤ 12}, given by R = {(a, b) : a = b}, is an equivalence relation. Find the set of all elements related to 1.
If R = {(x, y) : x2 + y2 ≤ 4; x, y ∈ Z} is a relation on Z, write the domain of R.
Write the identity relation on set A = {a, b, c}.
State the reason for the relation R on the set {1, 2, 3} given by R = {(1, 2), (2, 1)} to be transitive ?
If A = {1, 2, 3}, then a relation R = {(2, 3)} on A is _____________ .
Show that the relation R on the set Z of all integers, given by R = {(a,b) : 2 divides (a-b)} is an equivalence relation.
For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.
If A = {a, b, c}, B = (x , y} find A × B.
If A = {a, b, c}, B = (x , y} find A × A.
Let A = {1, 2, 3, 4}, B = {4, 5, 6}, C = {5, 6}. Find A × (B ∩ C).
Write the relation in the Roster form and hence find its domain and range :
R1 = {(a, a2) / a is prime number less than 15}
Consider the set A = {1, 2, 3} and R be the smallest equivalence relation on A, then R = ______
Let n be a fixed positive integer. Define a relation R in Z as follows: ∀ a, b ∈ Z, aRb if and only if a – b is divisible by n. Show that R is an equivalance relation
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
symmetric but neither reflexive nor transitive
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
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 + 4y = 10 x, y ∈ N.
Determine which of the above relations are reflexive, symmetric and transitive.
Let us define a relation R in R as aRb if a ≥ b. Then R is ______.
Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.
Which of the following is not an equivalence relation on I, the set of integers: x, y
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. 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 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 ____________.
Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.
A = {S, D}, B = {1,2,3,4,5,6}
- Raji wants to know the number of relations possible from A to B. How many numbers of relations are possible?
Sherlin and Danju are playing Ludo at home during Covid-19. While rolling the dice, Sherlin’s sister Raji observed and noted the possible outcomes of the throw every time belongs to set {1,2,3,4,5,6}. Let A be the set of players while B be the set of all possible outcomes.
A = {S, D}, B = {1,2,3,4,5,6}
- Let R: B → B be defined by R = {(1,1),(1,2), (2,2), (3,3), (4,4), (5,5), (6,6)}, then R 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.
- Ravi wishes to form all the relations possible from B to G. How many such relations are possible?
There are 600 student in a school. If 400 of them can speak Telugu, 300 can speak Hindi, then the number of students who can speak both Telugu and Hindi is:
A relation in a set 'A' is known as empty relation:-
What should be checked to determine whether a relation is reflexive?
Which combination of properties is required for an equivalence relation?
