A relation $f$ from $A$ to $B$ is a **function** if:
Aevery element of $B$ has exactly one preimage in $A$
B$A$ and $B$ are equal sets
Csome elements of $A$ have multiple images in $B$
Devery element of $A$ has exactly one image in $B$
Answer & Solution
Correct answer: D. every element of $A$ has exactly one image in $B$
Standard definition: $f: A \to B$ is a function iff every element of $A$ has **one and only one** image in $B$.
- **A** describes injectivity-from-B, not the basic function property.
- **C** describes a non-function relation.
Related questions
Penalty for wrong answers : THERE WILL BE PENALTY FOR WRONG ANSWERS MARKED BY A CANDIDATE Penalty for wrong answers : THERE WILL BE PENALTY FOR WRONG ANSWERS MARKED BY A CANDIDATE For [[1,2],[2,4]], the determinant equals:If A is invertible, |A^{−1}| equals:For a 3 × 3 non-singular A with |A| = 5, the value of |adj A| is:For a non-singular square matrix A of order n, |adj A| equals:For non-singular A, B of the same order, (AB)^{−1} equals:For a non-singular A, (A^{−1})^{−1} equals: