FUNCTIONS
FUNCTIONS
Domain of a function:
Codomain of a function:
f: A ⇢ B is one-one
⇒ a ≠ b ⇒ f(a) ≠ f(b) for all a, b ∈ A
⇒ f(a) = f(b) ⇒ a = b for all a, b ∈ A
Many-One function:
Into Function:
A function which is both one-one and onto (both injective and surjective) is
called one-one correspondent(bijective) function.
f : A ⇢ B is one-one correspondent (bijective) if:
one-one i.e. f(a) = f(b) ⇒ a = b for all a, b ∈ A
onto i.e. for each b ∈ B, there exists a ∈ A such that f(a) = b.
Inverse of a function:
Step 1: First, substitute f (x), with y. This helps us to facilitate the rest
of the process.
−1
Step 4: Replace y by f (x) , since this is the inverse function.
Sol
x +4
f ( x )= y=
2 x−5
y+4
x=
2 y−5
5x+4
y=
2 x−1
−1 5 x+ 4
f (x)=
2 x−1
Example 2
Composition of functions :-
Let f : A → B and g : B → C be two functions. Then the composition of f and g, denoted by g ∘ f,
is defined as the function g ∘ f : A → C given by g ∘ f (x) = g(f (x)), ∀ x ∈ A.
The order of function is an important thing while dealing with the composition of functions
since (f ∘ g) (x) is not equal to (g ∘ f) (x).
Example: If f(x) = 3x+1 and g(x) = x2 , then f o g (x) implies f(g(x)) = f(x2) = 3x2+1.
If we reverse the function operation, such as g of f of x, g(f(x)) = g(3x+1) = (3x+1)2