the composition of two transitive relations may not necessarily result in a transitive relation.
Transitivity means that if there is a relation R such that (a, b) ∈ R and (b, c) ∈ R, then (a, c) must also be in R.
Let's consider an example where this property does not hold for the composition of two transitive relations ρ1 and ρ2.
Suppose we have the set x = {1, 2, 3}, and let's define the relations ρ1 and ρ2 as follows:
ρ1 = {(1, 2), (2, 3)} ρ2 = {(2, 3), (3, 1)}
Both ρ1 and ρ2 are transitive relations because they satisfy the transitivity property on their own:
However, let's consider the composition ρ1°ρ2:
ρ1°ρ2 = {(1, 1), (1, 3), (2, 1), (2, 3), (3, 1), (3, 3)}
Note: that (1, 3) ∈ ρ1°ρ2 and (3, 1) ∈ ρ1°ρ2, but (1, 1) ∉ ρ1°ρ2. This breaks the transitivity property, as the element (1, 1) should be in the relation if (1, 3) and (3, 1) are in the relation.
This example demonstrates that the composition of the transitive relations ρ1 and ρ2, namely ρ1°ρ2, is not transitive. Thus, the answer is justified: ρ1°ρ2 is not a transitive relation.
The correct option is(B) ρ1°ρ2 is not transitive relation
Let α,β be the roots of the equation, ax2+bx+c=0.a,b,c are real and sn=αn+βn and \(\begin{vmatrix}3 &1+s_1 &1+s_2\\1+s_1&1+s_2 &1+s_3\\1+s_2&1+s_3 &1+s_4\end{vmatrix}=\frac{k(a+b+c)^2}{a^4}\) then k=
A relation R from a non-empty set B is a subset of the cartesian product A × B. The subset is derived by describing a relationship between the first element and the second element of the ordered pairs in A × B.
A relation f from a set A to a set B is said to be a function if every element of set A has one and only one image in set B. In other words, no two distinct elements of B have the same pre-image.
Relations and functions can be represented in different forms such as arrow representation, algebraic form, set-builder form, graphically, roster form, and tabular form. Define a function f: A = {1, 2, 3} → B = {1, 4, 9} such that f(1) = 1, f(2) = 4, f(3) = 9. Now, represent this function in different forms.