Advertisements
Advertisements
Question
Give an example of a relation which is reflexive and symmetric but not transitive?
Advertisements
Solution
Let A = {4, 6, 8}
Let the relation R defined on a set A be as follows:
R = {(4, 4), (6, 6), (8, 8), (4, 6), (6, 4), (6, 8), (8, 6)}
⇒ The relation R is reflexive because for every element a ∈ A, (a, a) ∈ R, i.e., (4, 4), (6, 6), (8, 8) ∈ R.
∴ R is Reflexive.
⇒ The relation R is symmetric, because (a, b) ∈ R and (b, a) ∈ R, for all a, b ∈ R.
∴ R is symmetric.
⇒ The relation R is not transitive, because (4, 6), (6, 8) ∈ R, but (4, 8) ∉ R.
∴ R is not transitive.
Thus, R is reflexive and symmetric but not transitive.
APPEARS IN
RELATED QUESTIONS
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. Also, obtain the equivalence class [(2, 5)].
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}.
Given an example of a relation. Which is reflexive and symmetric but not transitive.
Given an example of a relation. Which is reflexive and transitive but not symmetric.
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]
Show that the relation R on the set Z of integers, given by
R = {(a, b) : 2 divides a – b}, is an equivalence relation.
Let S be a relation on the set R of all real numbers defined by
S = {(a, b) ∈ R × R : a2 + b2 = 1}
Prove that S is not an equivalence relation on R.
If R = {(x, y) : x2 + y2 ≤ 4; x, y ∈ Z} is a relation on Z, write the domain of R.
If R = {(x, y) : x + 2y = 8} is a relation on N by, then write the range of R.
If R is a symmetric relation on a set A, then write a relation between R and R−1.
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.
Define a reflexive relation ?
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 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].
Let A = {0, 1, 2, 3} and R be a relation on A defined as
R = {(0, 0), (0, 1), (0, 3), (1, 0), (1, 1), (2, 2), (3, 0), (3, 3)}
Is R reflexive? symmetric? transitive?
Let the relation R be defined on the set A = {1, 2, 3, 4, 5} by R = {(a, b) : | a2- b2 | < 8}. Write R as a set of ordered pairs.
Write the smallest equivalence relation on the set A = {1, 2, 3} ?
A relation R is defined from {2, 3, 4, 5} to {3, 6, 7, 10} by : x R y ⇔ x is relatively prime to y. Then, domain of R is ______________ .
R is a relation from {11, 12, 13} to {8, 10, 12} defined by y = x − 3. Then, R−1 is ______________ .
If R is a relation on the set A = {1, 2, 3} given by R = {(1, 1), (2, 2), (3, 3)}, then R is ____________ .
For the matrix A = `[(2,3),(5,7)]`, find (A + A') and verify that it is a symmetric matrix.
Write the relation in the Roster form and hence find its domain and range :
R1 = {(a, a2) / a is prime number less than 15}
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 = ______
Let Z be the set of integers and R be the relation defined in Z such that aRb if a – b is divisible by 3. Then R partitions the set Z into ______ pairwise disjoint subsets
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
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
an injective mapping from A to B
Give an example of a map which is neither one-one nor onto
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.
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.
Which of the following is not an equivalence relation on I, the set of integers: x, y
Let `"f"("x") = ("x" - 1)/("x" + 1),` then f(f(x)) 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 ____________.
Students of Grade 9, planned to plant saplings along straight lines, parallel to each other to one side of the playground ensuring that they had enough play area. Let us assume that they planted one of the rows of the saplings along the line y = x − 4. Let L be the set of all lines which are parallel on the ground and R be a relation on L.
Answer the following using the above information.
- Let R = `{ ("L"_1, "L"_2) ∶ "L"_1 bot "L"_2 "where" "L"_1, "L"_2 in "L" }` which of the following is true?
A relation in a set 'A' is known as empty relation:-
Let R1 and R2 be two relations defined as follows :
R1 = {(a, b) ∈ R2 : a2 + b2 ∈ Q} and
R2 = {(a, b) ∈ R2 : a2 + b2 ∉ Q}, where Q is the set of all rational numbers. Then ______
