Advertisements
Advertisements
Question
Show that the relation R, defined in the set A of all polygons as R = {(P1, P2) : P1 and P2 have the same number of sides}, is an equivalence relation. What is the set of all elements in A related to the right-angled triangle T with sides 3, 4 and 5?
Advertisements
Solution
We observe the following properties on R:
Reflexivit:
Let P1 be an arbitrary element of A.
Then, polygon P1 and P1 have the same number of sides, since they are one and the same.
⇒ (P1, P1) ∈ R for all P1 ∈ A
So, R is reflexive on A.
Symmetry:
Let (P1, P2) ∈ R
⇒ P1 and P2 have the same number of sides.
⇒ P2 and P1 have the same number of sides.
⇒ (P2, P1) ∈ R for all P1, P2 ∈ A
So, R is symmetric on A.
Transitivity:
Let (P1, P2), (P2, P3) ∈ R
⇒ P1 and P2 have the same number of sides and P2 and P3 have the same number of sides.
⇒ P1, P2 and P3 have the same number of sides.
⇒ P1 and P3 have the same number of sides.
⇒ (P1, P3) ∈ R for all P1, P3 ∈ A
So, R is transitive on A.
Hence, R is an equivalence relation on the set A.
Also, the set of all the triangles ∈ A is related to the right angle triangle T with the sides 3, 4, and 5.
APPEARS IN
RELATED QUESTIONS
If R=[(x, y) : x+2y=8] is a relation on N, write the range of R.
Given an example of a relation. Which is symmetric and transitive but not reflexive.
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]
Let R be a relation defined on the set of natural numbers N as
R = {(x, y) : x, y ∈ N, 2x + y = 41}
Find the domain and range of R. Also, verify whether R is (i) reflexive, (ii) symmetric (iii) transitive.
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 A = {2, 3, 4, 5} and B = {1, 3, 4}. If R is the relation from A to B given by a R b if "a is a divisor of b". Write R as a set of ordered pairs.
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.
Let R = {(a, a), (b, b), (c, c), (a, b)} be a relation on set A = a, b, c. Then, R is _______________ .
If R is the largest equivalence relation on a set A and S is any relation on A, then _____________ .
If A = {1, 2, 3}, then a relation R = {(2, 3)} on A is _____________ .
Let R be the relation on the set A = {1, 2, 3, 4} given by R = {(1, 2), (2, 2), (1, 1), (4, 4), (1, 3), (3, 3), (3, 2)}. Then, _____________________ .
Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is ______.
In the set Z of all integers, which of the following relation R is not 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 × A.
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 ∪ 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 relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of the following:
an injective mapping from A to B
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 us define a relation R in R as aRb if a ≥ b. Then R is ______.
Every relation which is symmetric and transitive is also reflexive.
Let A = {1, 2, 3} and R = {(1, 2), (2, 3), (1, 3)} be a relation on A. Then, R is ____________.
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 A = {1, 2, 3, …. n} and B = {a, b}. Then the number of surjections from A into B 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?
Find: `int (x + 1)/((x^2 + 1)x) dx`
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
The number of surjective functions from A to B where A = {1, 2, 3, 4} and B = {a, b} is
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 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 ______
Let R = {(x, y) : x, y ∈ N and x2 – 4xy + 3y2 = 0}, where N is the set of all natural numbers. Then the relation R is ______.
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?
For \(A=\{1,2\}\), which relation is the Universal Relation?
Which pair of relations are called trivial relations?
What should be checked to determine whether a relation is symmetric?
