Composite Function Classification of Function

Bhujbal Knowledge City
Bhujbal Academy of Science and Commerce (Junior College)

th
Class: 12 (JEE-A) Subject: Mathematics Date: 22/10/2020
Chapter: Function Topic- Composite and Classification of Function Lecture -6
Composite Functions:- A composite function is generally a function that is written

inside another function. Composition of a function is done by substituting one function
into another function.
For example, f [g (x)] is the composite function of f (x) and g (x). The composite function f [g
(x)] is read as “f of g of x”. The function g (x) is called an inner function and the function f (x) is
called an outer function. Hence, we can also read f [g (x)] as “the function g is the inner function
of the outer function f”.
Note:- Hence for the gof of two functions f and g the range of f must be the subset of the
domain of g.
Similarly we can define fog=f [g(x)] and for the existence of fog(x), range of g must be
subset of domain of f.
Some other compositions of functions are:-
f[f(x)]=fof and g[g(x)]=gog

So basically we have to remember that for the composition of two functions the
range of the inner function must be the subset of the domain of the outer function.
f:AB and g : B  C ….g [f(x)]= gof exists
Let g : A  B and f : B  C ….f [g(x)]=fog exists

Ex.2
Let f(x)=√ and g(x)= √ then find the domain of the following
(i)fog(x) (ii) gof(x) (iii) fof(x) (iv) gog(x)
Sol. We solved this question in the classroom.
Ex.3
Ex.4
Classification of Functions
1.One –one Function or injective mapping:- One-to-One functions define that each
element of one set say Set (A) is mapped with a unique element of another set, say, Set (B).
Or
It could be defined as each element of Set A has a unique element on Set B.
In brief, let us consider ‘f’ is a function whose domain is set A. The function is said to be injective
if for all x and y in A,
Whenever f(x1)=f(x2), then x1=x2
And equivalently, if x1 ≠ x2, then f(x1) ≠ f(x2)
One to One Graph – Horizontal Line Test
An injective function can be determined by the horizontal line test or geometric test.
1. If a horizontal line intersects the graph of the function, more than one time, then the function
is not mapped as one-to-one.
2. If a horizontal line can intersect the graph of the function only a single time, then the
function is mapped as one-to-one.
Is Parabola a one to one function?

No, a parabola is not a 1-1 function. It can be proved by the horizontal line test.
A parabola is represented by the function f(x) = x2
Now, if we draw the horizontal lines, then it will intersect the parabola at two points in the graph.
Hence, for each value of x, there will be two output for a single input.
Examples of Injective Function
 The identity function X → X is always injective.

 If function f: R→ R, then f(x) = 2x is injective.
 If function f: R→ R, then f(x) = 2x+1 is injective.
 If function f: R→ R, then f(x) = x2 is not an injective function, because here if x = -1, then
f(-1) = 1 = f(1). Hence, the element of codomain is not discrete here.
 If function f: R→ R, then f(x) = x/2 is injective.
 If function f: R→ R, then f(x) = x3 is injective.
 If function f: R→ R, then f(x) = 4x+5 is injective.
Note that:- The composition of any two one-to-one functions is itself one-to-one.
2. Many to One Function:- If any two or more elements of set A are connected with a single
element of set B, then we call this function as Many one function.
How to decide whether the mapping is one-one injective or many one
3. Onto function or mapping (Surjection):-
A function f : A  B is onto if each element of B has its pre-image in A. Therefore, if
f 1 (y)  A, y  B then function is onto. In other words, Range of f = Co-domain of f.
e.g. The following arrow-diagram shows onto function.
Fig.2 in Set B element 4 has not any pre-image is Set A so this is not a onto mapping.
Note:-The composition of any two onto functions is itself onto.

Number of onto function (surjection) : If A and B are two sets having m and n elements respectively such that
n
1  n  m, then number of onto functions from A to B is (1)
r 1
n r n
Cr r m .
Method to find onto or into function:-

(a) Solve f (x )  y by taking x as a function of y i.e., g(y) (say).
(b) Now if g(y) is defined for each y  co-domain and g(y)  domain for y  co-domain, then
f (x ) is onto and if any one of the above requirements is not fulfilled, then f (x ) is into.
How to decide whether the mapping surjective(onto) or into ?
Bijective Mapping:-
Some More Solved Examples from NCERT:-
Ex. 13 Show that greatest integer function f:R->R=[x] neither one- one nor onto.
Sol.

Composite Function Classification of Function

Uploaded by

Copyright:

Available Formats

Composite Function Classification of Function

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Composite Function Classification of Function

Uploaded by

Copyright:

Available Formats

Bhujbal Knowledge City

Bhujbal Academy of Science and Commerce (Junior College)

Composite Functions:- A composite function is generally a function that is written

Some other compositions of functions are:-

f[f(x)]=fof and g[g(x)]=gog

f:AB and g : B  C ….g [f(x)]= gof exists

Let g : A  B and f : B  C ….f [g(x)]=fog exists

(i)fog(x) (ii) gof(x) (iii) fof(x) (iv) gog(x)

Sol. We solved this question in the classroom.

Is Parabola a one to one function?

Examples of Injective Function

 The identity function X → X is always injective.

Note:-The composition of any two onto functions is itself onto.

Method to find onto or into function:-

You might also like