Let S = {a,b,c} and T= {1,2,3}.
Find \(F^{-1}\) of the following functions F from S to T, if it exists.
I. F={(a,3),(b,2),(c,1)}
II. F={(a,2),(b,1),(c,1)}
S = {a, b, c}, T = {1, 2, 3}
(i) F: S \(\to\) T is defined as:
F = {(a, 3), (b, 2), (c, 1)}
\(\Rightarrow\) F (a) = 3, F (b) = 2, F(c) = 1
Therefore, F−1: T \(\to\) S is given by
\(F^{-1}\) = {(3, a), (2, b), (1, c)}.
(ii) F: S \(\to\) T is defined as:
F = {(a, 2), (b, 1), (c, 1)}
Since F (b) = F (c) = 1,
F is not one-one.
Hence, F is not invertible i.e., \(F^{-1}\) does not exist.
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\} $.