Review the key concepts, formulae, and examples before starting your quiz.
🔑Concepts
Composition of Functions: Let and be two functions. The composition of and , denoted by , is defined as the function given by for all . For the composition to exist, the range of must be a subset of the domain of .
Invertible Function: A function is defined to be invertible if there exists a function such that and . The function is called the inverse of and is denoted by . A function is invertible if and only if it is bijective (both one-to-one and onto).
Properties of Composition: Composition of functions is associative, meaning , but it is generally NOT commutative, i.e., .
Inverse of Composition: If and are two invertible functions, then is also invertible with .
📐Formulae
💡Examples
Problem 1:
Let be defined by . Find .
Solution:
We have .
Explanation:
To find , we substitute the entire expression of into the variable of the function itself. After simplifying the powers, we find that the composition results in the identity function .
Problem 2:
Show that the function defined by is its own inverse.
Solution:
Let . To find the inverse, we solve for in terms of : This expression is of the form if was its own inverse. Let's check : Wait, if , then . Let's re-verify: For to be its own inverse, must be .
Explanation:
A function is its own inverse if . This usually happens when solving for yields the same functional form . In CBSE exams, proving and is the standard way to prove invertibility.
Problem 3:
Consider given by . Show that is invertible with the inverse .
Solution:
Step 1: Check Injectivity (One-to-One). Let . Since , . Thus, is one-to-one.
Step 2: Check Surjectivity (Onto). Let . Let . Since , , so is a real number in . Thus, is onto.
Step 3: Find Inverse. Since is bijective, it is invertible. The inverse is .
Explanation:
To prove invertibility, we demonstrate that the function is both injective and surjective. The inverse is found by solving for x in terms of y.
Problem 4:
Let be defined as and be defined as . Find and check if it is equal to .
Solution:
Step 1: Calculate .
Step 2: Calculate .
Step 3: Compare results. Since , we conclude .
Explanation:
This example demonstrates that function composition is not commutative. The order in which functions are applied significantly changes the result.