To determine the properties of the function \( f(x) = 10 - x^2 \), we'll analyze its behavior regarding injectivity (one-one) and surjectivity (onto).
A function is one-one if different inputs produce different outputs. Suppose \( f(a) = f(b) \), then:
\(10 - a^2 = 10 - b^2\)
This simplifies to:
\(a^2 = b^2\)
Which implies:
\(a = b\) or \(a = -b\)
Since \(a = b\) is not the only possible outcome (as shown by \(a = -b\)), \(f(x)\) is not injective.
A function is onto if for every \(y \in \mathbb{R}\), there exists an \(x \in \mathbb{R}\) such that \(f(x) = y\).
Given \(f(x) = 10 - x^2\), we solve for \(x^2\):
\(x^2 = 10 - y\)
This implies \(y \leq 10\) (since \(x^2 \geq 0\)). Every \(y \leq 10\) can be achieved by some real \(x\), for example, \(x = \sqrt{10 - y}\) or \(x = -\sqrt{10 - y}\).
Thus, \(f(x)\) covers all \(y \leq 10\), confirming \(f(x)\) is surjective.
\(f(x)\) is onto but not one-one. Therefore, the correct answer is: \(f\) is onto but not one-one.
The given function is:
\[ f(x) = 10 - x^2. \]
Step 1: Check for one-one.
A function \(f\) is one-one if for \(f(x_1) = f(x_2)\), we have \(x_1 = x_2\). Assume:
\[ f(x_1) = f(x_2) \implies 10 - x_1^2 = 10 - x_2^2. \]
Simplify:
\[ x_1^2 = x_2^2 \implies x_1 = \pm x_2. \]
Since \(x_1 \neq x_2\) in general, the function is not one-one.
Step 2: Check for onto.
A function \(f\) is onto if for every \(y \in \mathbb{R}\), there exists an \(x \in \mathbb{R}\) such that \(f(x) = y\). Rearrange:
\[ f(x) = 10 - x^2 \quad \text{to solve for } x: \] \[ y = 10 - x^2 \implies x^2 = 10 - y. \]
For \(x^2 \geq 0\), we require \(10 - y \geq 0\), or:
\[ y \leq 10. \]
The function \(f(x)\) maps \(x \in \mathbb{R}\) to \(y \in (-\infty, 10]\). Hence, \(f\) is onto.
Conclusion: The function \(f(x) = 10 - x^2\) is onto but not one-one.
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 \]