The document Classification Of Functions JEE Notes | EduRev is a part of the JEE Course Mathematics For JEE.

All you need of JEE at this link: JEE

**1. One-One Function (Injective mapping):** A function f: A → B is said to be a one-one function or injective mapping if different elements of A have different f images in B. Thus for x_{1}, x_{2} ∈ A & f(x_{1}), f(x_{2}) ∈ B, f(x_{1}) = f(x_{2}) ⇔ x_{1} = x_{2} or x_{1} ≠ x_{2} ⇔ f(x_{1}) ≠ f(x_{2}).

**Diagrammatically an injective mapping can be shown as**

OR

**Remark: ****(i)** Any function which is entirely increasing or decreasing in its domain, is one-one.**(ii)** If any line parallel to x-axis cuts the graph of the function at most at one point, then the function is one-one.

**Q.1. ****Determine if the function given below is one to one. ****(i) To each state of India assign its Capital****Ans.** This is not one to one function because each state of India has not different capital.

**(ii) Function = {(2, 4), (3, 6), (-1, -7)} ****Ans.**** **The above function is one to one because each value of range has different value of domain.

**(iii) f(x) = |x|****Ans. **Here to check whether the given function is one to one or not, we will consider some values of x (domain) and from the given function find the value of range(y).

From the above table we can see that an element in the range repeats, then this is not a one to one function.**Q.2. ****Without using graph prove that the function****F : R → R defiend by f (x) = 4 + 3x is one-to-one****Ans. **For a function to be one-one function if

F (x_{1}) = F (x_{1}) ⇒ x_{1 }**= **x_{2 }∀ x_{1, }x_{2 }∈ domain

∴ Now f (x_{1}) = f (x_{2}) gives

4 + 3x_{1} = 4 + 3x_{2} or x_{1 =} x_{2}

∴ F is a one-one function.

**(2) Many-One function: **A function f: A → B is said to be a many one function if two or more elements of A have the same f image in B. Thus f: A → B is many one if for

x_{1}, x_{2} ∈ A, f(x_{1}) = f(x_{2}) but x_{1}≠ x_{2}

**Diagrammatically a many one mapping can be shown as**

OR

**Remark: ****(i)** A continuous function f(x) which has at least one local maximum or local minimum, is many-one. In other words, if a line parallel to x-axis cuts the graph of the function at least at two points, then f is many-one.**(ii)** If a function is one-one, it cannot be many-one and vice versa.**(iii)** If f and g both are one-one, then fog and gof would also be one-one (if they exist).

**Q.3. Without using graph check the following function f: R → R defined by f (x) = x ^{2} is one-to-one or not ?**

But here if x = 1 then f(1) = (1)

And if x = -1 then f(-1) =(-1)

Clearly, x = 1 and x = -1 both have same image

So given function is not one to one i.e many to one function

In other words, we can say that a function which is not one to one that can be known as many to one.

**Example 16. Show that the function f(x) = (x ^{2} - 8x + 18)/(x^{2} + 4x + 30) **

A function is one-one if f(x

Since f(x_{1}) = f(x_{2}) does not imply x_{1} = x_{2} alone, f(x) is not a one-one function.**Example 17. Let f be an injective function such that ****f(x) f(y) + 2 = f(x) + f(y) + f(xy) ∀ x, y ∈ R.****If f(4) = 65 and f(0) ≠ 2, then show that f(x) – 1= x ^{3} for x ∈ R**

Putting x = y = 0 in equation (i), we get f(0) f(0) + 2 = f(0) + f(0) + f(0)

or (f(0))

Again putting x = y = 1 in equation (i) and repeating the above steps, we get (f(1) – 2) (f(1) – 1) = 0

But f(1) ≠ 1 as f(x) is injective.

∴ f(1) = 2 ...(iii)

Now putting y = 1/x in equation (i), we get

Let f(x) – 1 = g(x)

from equation (iv), we get g(x) g(1/x) = 1 which is only possible when

g(x) = ± x^{n}

f(x) = ± x^{n} + 1

or f(x) = ± x^{n} + 1 or 65 = ± 4^{n} + 1

or 4n = 64 = (4)^{3}

n = 3

f(x) = x^{3} + 1 or f(x) – 1 = x^{3} (neglecting negative sign)

**3. Onto-function (Surjective mapping):** If the function f: A → B ^{ }is such that each element in B (co-domain) is the f image of atleast one element in A, then we say that f is a function of A 'onto' B. Thus ^{ }f: A → B is surjective if ∀ b ∈ B, ∃ some a ∈^{ }such that f (a) = b.

**Diagramatically surjective mapping can be shown as **

OR

**Note that:** if range ≡ co-domain, then f(x) is onto.

**Q.4. If f: R → R is defined as f (x)= 3x + 7, x ∈ R, then show that f is an onto function.****Ans. **We have f (x) = 3x + 7, x ∈ R . Let b ∈ R so that f (x) = b ⇒ 3x + 7 = b or

x = (b - 7)/3. Since b ∈ R, (b - 7)/3 ∈ R.

⇒ b is image of (b - 7)/3 where b is arbitrary.

Hence f (x) is an onto function.

**4. Into function:** If f: A → B ^{ }is such that there exists at least one element in co-domain which is not the image of any element in domain, then f(x) is into.

**Diagramatically into function can be shown as**

**Remark: ****(i)** If a function is onto, it cannot be into and vice versa.**(ii) **If f and g are both onto, then gof or fog would be onto (if exists).

Thus a function can be one of these four types:**(a)** One-one onto (injective & surjective)

**(b)** One-one into (injective but not surjective)

**(c)** Many-one onto (surjective but not injective)

**(d)** many-one into (neither surjective nor injective)

**Remark: ****(i)** If f is both injective & surjective, then it is called a **Bijective** function. Bijective functions are also named as invertible, non singular or biuniform functions.**(ii)** If a set A contains n distinct elements then the number of different functions defined from A → A is n^{n} & out of it n ! are one-one.**(iii)** The composite of two bijections is a bijection i.e. if f & g are two bijections such that gof is defined, then gof is also a bijection.

**Q.5. Let f: N → I be a function defined as f(x) = x – 1000. Determine whether f(x) is into or onto.Ans.**

Let y ∈ I such that f(x) = y ,where x∈ N

⇒ x – 1000 = y

⇒ x = y + 1000 = g(y)

Here g(y) is defined for each y ∈ I, but g(y) ∉ N for y ≤ – 1000.

Hence f(x) is into.

F : R → R defined by f (x) = 4x

∴ 4x

⇒ x

⇒ x

⇒ x

x

It has no real value of x

∴ F is a one-one function.

Again let y = (x) where y ∈ codomain, x ∈ domain.

We have y = 4x

or

∴ For each y ∈ codomain ∃ x ∈ domain such that f (x) = y.

Thus F is onto function.

∴ F is a bijection.

**Example 18. ****A function is defined as , f: D → R f(x) = cot ^{-1} (sgn x) + sin^{-1}(x - {x}) (where {x} denotes the fractional part function) Find the largest domain and range of the function. State with reasons whether the function is injective or not. Also draw the graph of the function.**

**Example 19. Find the linear function(s) which map the interval [0 _{ }, 2_{ }] onto [1 , 4_{ }].**

f (0) = 1 & f (2) = 4 ⇒ b = 1 & a =3/2

or f (0) = 4 & f (2) = 1 ⇒ b = 4 & a = -3/2

f(x) = 3x/2 + 1 or f(x) = 4 - 3x/2

f'(x) ≥ 0 for all x ∈complete domain and equality holds at discrete points only

∴ f(x) is strictly increasing on R. Hence f(x) is one-one

f(x) is a non monotonic continuous function. Hence it is not injective.

For f(x) to be surjective, A should be equal to its range. From graph, range is [2, 6]

∴ A ≡ [2, 6]**Example 21. If f and g be two linear functions from [-1, 1] onto [0, 2] and **** be defined by**

**Solution.** Let h be a linear function from [-1, 1] onto [0, 2].

Let h(x) = ax + b, then h'(x) = a

If a > 0, then h(x) is an increasing function & h(–1) = 0 and h(1) = 2 ⇒ –a + b = 0 and a + b = 2 ⇒ a = 1 & b = 1.

Hence h(x) = x + 1.

If a < 0, then h(x) is a decreasing function & h(–1) = 2 and h(1) = 0 ⇒ –a + b = 2 and a + b = 0 ⇒ a = –1 & b = 1.

Hence h(x) = 1 – x

Now according to the question f(x) = 1 + x & g(x) = 1 - x

or f(x) = 1 – x & g(x) = 1 + x

,

In both cases, |Ø(Ø(x)) + Ø(Ø(1/x)) |

Offer running on EduRev: __Apply code STAYHOME200__ to get INR 200 off on our premium plan EduRev Infinity!

353 videos|269 docs|272 tests