Introduction to Functions
A function 'f' from a set A to a set B, denoted , is a special type of relation where every element in set A (the domain) is associated with exactly one element in set B (the codomain). The set of all outputs is called the range.
We can classify functions based on how the elements of the domain are mapped to the elements of the codomain.
1. One-one Function (Injection)
A function is one-one (or injective) if distinct elements in the domain A have distinct images in the codomain B.
Alternatively, if , then .
- Graphical Test (Horizontal Line Test): A function is one-one if and only if no horizontal line intersects its graph more than once.
- Example: is a one-one function. If , then , which implies .
- Non-Example: is not one-one because and . Different inputs (-2 and 2) have the same output.
2. Many-one Function
A function is many-one if it is not one-one. This means there are at least two different elements in the domain A that have the same image in the codomain B.
- Example: The function is a many-one function because and .
3. Onto Function (Surjection)
A function is onto (or surjective) if every element in the codomain B is the image of at least one element in the domain A. In other words, the range of the function is equal to its codomain.
- Example: Let be defined by . For any 'y' in the codomain , we can find an in the domain such that . Thus, the range is , and the function is onto.
- Non-Example: Let be defined by . The range of this function is , which is a proper subset of the codomain . For instance, there is no real number x for which . Therefore, the function is not onto.
4. Into Function
A function is an into function if it is not onto. This means there is at least one element in the codomain that is not the image of any element in the domain.
- Example: The function from to is an into function.
5. Bijective Function (One-one and Onto)
A function is bijective if it is both one-one (injective) and onto (surjective). Bijective functions are also known as one-to-one correspondences.
- Importance: A function has an inverse if and only if it is bijective.
- Example: The function defined by is bijective. It is one-one (as shown before) and onto (for any , we can find ).
Example 1: Checking One-one (Injective)
Question: Show that the function defined by is one-one.
Explanation: A function is one-one (or injective) if different inputs always produce different outputs. To prove this algebraically, we assume and show that this necessarily implies .
Assume : For any , let . This gives us .
Solve for : Taking the cube root of both sides, we get , which simplifies to .
Conclusion: Since our assumption leads directly to the conclusion , the function is one-one.
Graphically, this function passes the Horizontal Line Test, as any horizontal line will intersect the graph of at most once.
Example 2: Checking Onto (Surjective)
Question: Show that the function defined by is onto.
Explanation: A function is onto (or surjective) if its range is equal to its codomain. This means that for any element in the codomain, there is at least one element in the domain (a pre-image) such that .
- Set : Let be an arbitrary element in the codomain . We set , which gives us .
- Solve for in terms of : To find the pre-image, we solve for : .
- Check if the pre-image is valid: For any real number (positive, negative, or zero), its real cube root, , is also a well-defined real number. This value of belongs to the domain .
- Conclusion: Since for every in the codomain, we found a pre-image in the domain, the function is onto.
Example 3: Many-one and Into Function
Question: Let be defined by . Classify the function.
Explanation: 1. Checking for One-one / Many-one: A function is one-one if different inputs give different outputs. Let's test two different inputs.
- Let and . Clearly, .
- .
- . Since different inputs (-2 and 2) produce the same output (4), the function is many-one.
2. Checking for Onto / Into: A function is onto if its range equals its codomain.
- Codomain: The codomain is given as the set of all integers,
- Range: The range is the set of all possible outputs. Since , the outputs are all perfect squares: Range = The range is a proper subset of the codomain. For example, the number 2 is in the codomain, but there is no integer such that . Therefore, 2 has no pre-image.
Since the range is not equal to the codomain, the function is into.
Conclusion: The function is many-one and into.
Example 4: Bijective Function
Question: Is the function defined by bijective?
Explanation: A function is bijective if it is both one-one (injective) and onto (surjective).
1. Check for One-one:
Assume for in the domain.
Cross-multiply:
.
Since implies , the function is one-one.
2. Check for Onto:
Let be an arbitrary element in the codomain . We set and solve for .
.
For any in the codomain, we can find a corresponding . Since the codomain is , the denominator will never be zero, so a valid exists for every . The function is onto.
Conclusion: Since the function is both one-one and onto, it is bijective.
Example 5: Modulus Function
Question: Classify the function defined by .
Explanation: 1. Check for One-one / Many-one: Let's test two different inputs, and . . . Since different inputs produce the same output, the function is many-one.
2. Check for Onto / Into:
- Codomain: The codomain is all real numbers, .
- Range: The range of the modulus function is the set of all non-negative real numbers, . Since the range is not equal to the codomain (e.g., -1 is in the codomain but has no pre-image), the function is into.
Conclusion: The function is many-one and into.
Example 6: Signum Function
Question: Classify the function defined by .
Explanation: First, recall the definition of the Signum function:
1. Check for One-one / Many-one: Let's test two different positive inputs, and .
.
.
Since many different inputs map to the same output (all positive numbers map to 1), the function is many-one.
2. Check for Onto / Into:
- Codomain: The codomain is the set of all integers, .
- Range: The range is the set of all possible outputs, which is just .
Since the range is a proper subset of the codomain (e.g., the integer 2 is in the codomain but has no pre-image), the function is into.
Conclusion: The function is many-one and into.
Example 7: One-one but not Onto
Question: Let be defined by . Classify the function.
Explanation: The domain and codomain are the set of natural numbers .
1. Check for One-one: Assume for .
.
Since implies , the function is one-one.
2. Check for Onto:
- Codomain: .
- Range: The set of outputs is . So, the range is .
The range is not equal to the codomain. Specifically, the number 1 is in the codomain but is not in the range; it has no pre-image in the domain (since would require , which is not a natural number).
Therefore, the function is not onto (it is an into function).
Conclusion: The function is one-one and into.
Example 8: Many-one and Onto
Question: Let be defined by . Classify the function.
Explanation: This question is similar to Example 3, but the codomain has been changed.
1. Check for One-one / Many-one: The domain is still . As before, different inputs like and give the same output . Therefore, the function is many-one.
2. Check for Onto / Into:
- Codomain: The codomain is explicitly given as the set of all non-negative real numbers, .
- Range: The range of the function is also the set of all non-negative real numbers, .
Since the range is equal to the codomain, the function is onto.
Conclusion: The function is many-one and onto.
Example 9: Proving a function is NOT one-one
Question: Show that from is not one-one.
Explanation: To prove a function is not one-one, we only need to find a single counter-example: a pair of distinct inputs, and , such that their outputs are the same, i.e., .
Choose two different inputs: Let's choose and . Clearly, .
Calculate their outputs: .
.
Conclusion: We have found two different inputs, 0 and , that produce the same output, 1. Therefore, the function is not one-one (it is many-one). Due to its periodic nature, there are infinitely many such examples.
Example 10: Using Derivatives to Check Injectivity
Question: Show that given by is injective.
Explanation: A powerful method for checking injectivity (one-one) of a differentiable function is to analyze its derivative, . If the derivative is always positive or always negative across the entire domain, the function is strictly monotonic (always increasing or always decreasing), which guarantees it is one-one.
Find the derivative:
Analyze the sign of the derivative: To determine if is always positive or negative, we can try to factor it or check its discriminant. Let's complete the square.
Conclusion: The term is always greater than or equal to 0. Therefore, is always greater than or equal to 1.
This means is always positive for all .
Since the derivative is always positive, the function is strictly increasing, and therefore it is injective (one-one).