Definition of a Function
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. This is one of the most important concepts in mathematics.
For a relation to be a function, it must satisfy two conditions:
- The domain of the function must be the entire set A.
- No two distinct ordered pairs in the function can have the same first element.
Function Notation
- We denote a function 'f' from A to B as .
- If , we write . Here, 'b' is the image of 'a' under 'f', and 'a' is the preimage of 'b'.
Classification of Functions (Mappings)
One-one function (Injection): A function is one-one if every element in the domain A has a distinct image in the codomain B. Mathematically, . Graphically, this can be checked with the Horizontal Line Test (a horizontal line should never intersect the graph more than once).
Onto function (Surjection): A function is onto if every element in the codomain B is the image of at least one element in the domain A. In other words, the Range must be equal to the Codomain.
Bijective function (One-one and Onto): A function is a bijection if it is both injective (one-one) and surjective (onto).
Standard Function Types
- Identity Function: .
- Constant Function: , where c is a constant.
- Modulus Function: .
- Signum Function: .
- Greatest Integer Function (GIF): .
Example 1: Identifying Functions from Relations
Question: Examine if the relation is a function.
Solution:
This is not a function. The first element, 2, corresponds to two different images (2 and 4). This violates the 'one and only one image' rule.
Example 2: Finding Domain of a Radical Function
Question: Find the domain of the real function .
Solution:
For the square root to be defined, the expression inside must be non-negative.
So, the Domain is .
Example 3: Finding Domain of a Rational Function
Question: Find the domain of the function .
Solution: The function is defined for all real numbers except where the denominator is zero. We set the denominator to zero: . The roots are and . The domain is all real numbers except these two values. Domain = .
Example 4: Finding Range of a Modulus Function
Question: Find the range of the function .
Solution: The standard modulus function, , has a range of . Since our function is multiplied by -1, all the output values will be negative or zero. Therefore, the range of is .
Example 5: Evaluating the Greatest Integer Function
Question: Find the values of (i) (ii) .
Solution:
(i) The greatest integer less than or equal to 7.3 is 7. So, .
(ii) The integers less than or equal to -4.8 are -5, -6, -7, … The greatest among these is -5. So, .
Example 6: Classifying Functions (Injective/Surjective)
Question: Classify the following functions as injective, surjective, bijective, or neither.
(i) defined by .
(ii) defined by .
Solution:
(i) For :
Injective Check: Let . Then . It is injective.
Surjective Check: The range of a linear function is , which is equal to the codomain . It is surjective.
Conclusion: Since it is both injective and surjective, it is a bijection.
(ii) For :
- Injective Check: Let . Then . For example, and . Since different inputs can give the same output, it is not injective.
- Surjective Check: The range of is . The codomain is . Since the range is not equal to the codomain, it is not surjective.
- Conclusion: It is neither injective nor surjective.