Advertisements
Advertisements
Question
Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is ______.
Options
1
2
3
4
Advertisements
Solution
Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, 3) which are reflexive and symmetric but not transitive is 1.
Explanation:
The given set is A = {1, 2, 3}.
The smallest relation containing (1, 2) and (1, 3) which is reflexive and symmetric, but not transitive is given by:
R = {(1, 1), (2, 2), (3, 3), (1, 2), (1, 3), (2, 1), (3, 1)}
This is because relation R is reflexive as (1, 1), (2, 2), (3, 3) ∈ R.
Relation R is symmetric since (1, 2), (2, 1) ∈ R and (1, 3), (3, 1) ∈ R.
But relation R is not transitive as (3, 1), (1, 2) ∈ R, but (3, 2) ∉ R.
Now, if we add any two pairs (3, 2) and (2, 3) (or both) to relation R, then relation R will become transitive.
Hence, the total number of desired relations is one.
APPEARS IN
RELATED QUESTIONS
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.
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.
Given a non-empty set X, consider P(X), which is the set of all subsets of X. Define the relation R in P(X) as follows:
For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify your answer.
Let A = {x ∈ Z : 0 ≤ x ≤ 12}. Show that R = {(a, b) : a, b ∈ A, |a – b| is divisible by 4}is an equivalence relation. Find the set of all elements related to 1. Also write the equivalence class [2]
The binary operation *: R x R → R is defined as a *b = 2a + b Find (2 * 3)*4
Test whether the following relation R2 is (i) reflexive (ii) symmetric and (iii) transitive:
R2 on Z defined by (a, b) ∈ R2 ⇔ |a – b| ≤ 5
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.
Defines a relation on N :
x > y, x, y ∈ N
Determine the above relation is reflexive, symmetric and transitive.
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.
Write the identity relation on set A = {a, b, c}.
Write the smallest reflexive relation on set A = {1, 2, 3, 4}.
Let R = {(x, y) : |x2 − y2| <1) be a relation on set A = {1, 2, 3, 4, 5}. Write R as a set of ordered pairs.
Let the relation R be defined on N by aRb iff 2a + 3b = 30. Then write R as a set of ordered pairs
Write the smallest equivalence relation on the set A = {1, 2, 3} ?
Let R be a relation on the set N given by
R = {(a, b) : a = b − 2, b > 6}. Then,
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 ________________ .
The relation R = {(1, 1), (2, 2), (3, 3)} on the set {1, 2, 3} 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:
Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b for all a, b T. Then, R is ____________ .
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 ___________ .
Let R be a relation on the set N of natural numbers defined by nRm if n divides m. Then R is ______.
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 R reflexive and transitive
If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
symmetric but neither reflexive nor transitive
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
a mapping from B to A
Give an example of a map which is one-one but not onto
The relation R on the set A = {1, 2, 3} defined as R = {{1, 1), (1, 2), (2, 1), (3, 3)} is reflexive, symmetric and transitive.
R = {(1, 1), (2, 2), (1, 2), (2, 1), (2, 3)} be a relation on A, then R is ____________.
If A is a finite set containing n distinct elements, then the number of relations on A is equal to ____________.
Let `"f"("x") = ("x" - 1)/("x" + 1),` then f(f(x)) is ____________.
The relation R is defined on the set of natural numbers as {(a, b) : a = 2b}. Then, R-1 is given by ____________.
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?
On the set N of all natural numbers, define the relation R by a R b, if GCD of a and b is 2. Then, R is
A relation in a set 'A' is known as empty relation:-
Given a non-empty set X, define the relation R in P(X) as follows:
For A, B ∈ P(X), (4, B) ∈ R iff A ⊂ B. Prove that R is reflexive, transitive and not symmetric.
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)].
If a relation R on the set {a, b, c} defined by R = {(b, b)}, then classify the relation.
