Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
75 views

Subjective & Injective Functions

1) A function is one-to-one (injective) if each input maps to a unique output, with no inputs mapping to the same output. A function is onto (surjective) if each output in the codomain is the image of at least one input. 2) A bijective function is both one-to-one and onto, mapping each input to a unique output and having all possible outputs as images. 3) The inverse of a bijective function reverses the input and output sets, providing a function from the codomain back to the domain.

Uploaded by

Mana Gargi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
75 views

Subjective & Injective Functions

1) A function is one-to-one (injective) if each input maps to a unique output, with no inputs mapping to the same output. A function is onto (surjective) if each output in the codomain is the image of at least one input. 2) A bijective function is both one-to-one and onto, mapping each input to a unique output and having all possible outputs as images. 3) The inverse of a bijective function reverses the input and output sets, providing a function from the codomain back to the domain.

Uploaded by

Mana Gargi
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

QA – Subjective and Injective Function

SURBJECTIVE AND INJECTIVE FUNCTIONS

Function

Many one One one (or injective)

Many inputs produce Only one input produce any output


One output one output i.e., no two inputs produce same

Function

Into Onto (or subjective)

There is at least one Every element of B is necessarily


element of B which is an output (or image) of an element of A.
not the output (or image)
of any element of A.

One to One (or Injective) Function


A function f is said to be one-to-one if it does not have the same output for two distinct
values in its domain.
For example, f (x) = x3 is one to one whereas f (x) = x2 is not, as f (1) = 1 and f (-1) = 1
In order to show that a function f : A B is one-one we may take any x, y A such that f (x)
= f (y) and try to show that x = y.
Graphically , if every horizontal line intersects the graph of a given function at not more than
one point, i.e., the function is strictly increasing (or decreasing) then the function is one-
one.

Functions which are not one to one are called many-one function.

Proprietary and Confidential ABS Classes 1


QA – Subjective and Injective Function

One many function does not exist.


Onto (or Subjective Function)
If a function f : A B is such that each element in B is the output of at least one element in
A, then we say that f is function of A ‘onto’ B.
In order to show that a function f : A B is onto we start with any y B and try to find x
such that f (x) = y.
Bi-jective Function: If a function f is both one-to-one and onto then f is said to be a
bijective function e.g., an identity function is a bijective function.
INVERSE FUNCTION
Inverse of a function: If f:A B is a bijection, we can define a new function from B to A
which associates each element y B to its pre-image f-1 (y) A. Such a function is known as
the inverse of function f and is denoted by f-1.

 Inverse of a function is defined if the function is one-to-one and onto.


 In the inverse function inputs and outputs interchange their roles.
 Inverse of a function is not defined if the given function is a many-one function or
into function or both.
 If the graph of a function f (x) is symmetric about the line y = x, then f (x) and f-1 (x)
are identical function.

is the inverse function of

Summary:

1) One-to-one: A function f is one-to-one (injective), if & only if whenever f(x) = f(y), x = y i.e.
no two different input can give the same output.

Example: The function f(x) = x2, positive and negative values of x will give the same value of y. So it is
not one to one

2) Onto: A function f from a set A to a set B is onto (subjective), if and only if for every
element y of B , there is an element x in A such that f(x) = y , that is, f is onto if and only if
f( A ) = B .

Example: The function f(x) = 2x . A is a set of natural numbers and B is a set of even. So every elemnt
in B is an output of some element in A. Therefore it is an onto function

3) Bijection: A function is called a bijection, if it is both onto and one-to-one.

Example: The function f(x) = 2x . A is a set of natural numbers and B is a set of even. So every elemnt
in B is an output of some element in A. Therefore it is an onto function

Proprietary and Confidential ABS Classes 2


QA – Subjective and Injective Function

Also every element in A will give a distinct output in B. therefore it is an into function. Therefore it is
a bijection fuction,

Every bijection has a function called the inverse function.

Proprietary and Confidential ABS Classes 3

You might also like