Show that the relation R defined in the set A of all triangles as R = {(T1, T2): T1 is similar to T2}, is equivalence relation. Consider three right angle triangles T1 with sides 3, 4, 5, T2 with sides 5, 12, 13 and T3 with sides 6, 8, 10. Which triangles among T1, T2 and T3 are related?
R = {(T1, T2): T1 is similar to T2}
R is reflexive since every triangle is similar to itself.
Further, if (T1, T2) ∈ R, then T1 is similar to T2.
⇒ T2 is similar to T1.
⇒ (T2, T1) ∈R
∴R is symmetric
Now,
Let (T1, T2), (T2, T3) ∈ R.
⇒ T1 is similar to T2 and T2 is similar to T3.
⇒ T1 is similar to T3.
⇒ (T1, T3) ∈ R
∴ R is transitive.
Thus, R is an equivalence relation.
Now, we can observe that:
\(\frac {3} {6}\)=\(\frac {4} {8}\)= \(\frac {5} {10}\)= \(\bigg(\frac{1}{2}\bigg)\)
∴The corresponding sides of triangles T1 and T3 are in the same ratio.
Then, triangle T1 is similar to triangle T3.
Hence, T1 is related to T3.
A school is organizing a debate competition with participants as speakers and judges. $ S = \{S_1, S_2, S_3, S_4\} $ where $ S = \{S_1, S_2, S_3, S_4\} $ represents the set of speakers. The judges are represented by the set: $ J = \{J_1, J_2, J_3\} $ where $ J = \{J_1, J_2, J_3\} $ represents the set of judges. Each speaker can be assigned only one judge. Let $ R $ be a relation from set $ S $ to $ J $ defined as: $ R = \{(x, y) : \text{speaker } x \text{ is judged by judge } y, x \in S, y \in J\} $.
During the festival season, a mela was organized by the Resident Welfare Association at a park near the society. The main attraction of the mela was a huge swing, which traced the path of a parabola given by the equation:\[ x^2 = y \quad \text{or} \quad f(x) = x^2 \]
Relation is said to be empty relation if no element of set X is related or mapped to any element of X i.e, R = Φ.
A relation R in a set, say A is a universal relation if each element of A is related to every element of A.
R = A × A.
Every element of set A is related to itself only then the relation is identity relation.
Let R be a relation from set A to set B i.e., R ∈ A × B. The relation R-1 is said to be an Inverse relation if R-1 from set B to A is denoted by R-1
If every element of set A maps to itself, the relation is Reflexive Relation. For every a ∈ A, (a, a) ∈ R.
A relation R is said to be symmetric if (a, b) ∈ R then (b, a) ∈ R, for all a & b ∈ A.
A relation is said to be transitive if, (a, b) ∈ R, (b, c) ∈ R, then (a, c) ∈ R, for all a, b, c ∈ A
A relation is said to be equivalence if and only if it is Reflexive, Symmetric, and Transitive.