Mapping or Functions:

If A and B are two non-empty sets, then a relation ‘f‘ from set A to set B is said to be a function or
mapping,

● If every element of set A is associated with unique element of set B.

● The function ‘f’ from A to B is denoted by f : A → B.

● If f is a function from A to B and x ∈ A, then f(x) ∈ B where f(x) is called the image of x under f and x is
called the pre image of f(x) under ‘f’.

Note:

For f to be a mapping from A to B:

● Every element of A must have image in B. Adjoining figure does not represent a mapping since the
element d in set A is not associated with any element of set B.

0Save

● No element of A must have more than one image. Adjoining figure does not represent a mapping
since element b in set A is associated with two elements d, f of set B.

0Save

● Different elements of A can have the same image in B. Adjoining figure represents a mapping.
0Save

Note:

Every mapping is a relation but every relation may not be a mapping.

Function as a special kind of relation:

Let us recall and review the function as a special kind of relation suppose, A and B are two non-empty
sets, then a rule 'f' that associates each element of A with a unique element of B is called a function or a
mapping from A to B.

If 'f' is a mapping from A to B,

we express it as f: A → B

we read it as 'f' is a function from A to B.

If ‘f ' is a function from A to B and x∈A and y∈B, then we say that y is the image of element x under the
function ' f ' and denoted it by f(x).

Therefore, we write it as y = f(x)

Here, element x is called the pre-image of y.

Thus, for a function from A to B.

● A and B should be non-empty.

● Each element of A should have image in B.

● No element of 'A' should have more than one image in 'B’.

Note:
● Two or more elements of A may have the same image in B.

● f : x → y means that under the function of 'f' from A to B, an element x of A has image y in B.

● It is necessary that every f image is in B but there may be some elements in B which are not f images
of any element of A.

Injective, Surjective and Bijective

"Injective, Surjective and Bijective" tells us about how a function behaves.

Let's look at that more closely:

A General Function points from each member of "A" to a member of "B".

It never has one "A" pointing to more than one "B", so one-to-many is not OK in
a function (so something like "f(x) = 7 or 9" is not allowed)

But more than one "A" can point to the same "B" (many-to-one is OK)

Injective means we won't have two or more "A"s pointing to the same "B".

So many-to-one is NOT OK (which is OK for a general function).

As it is also a function one-to-many is not OK

But we can have a "B" without a matching "A"

Injective is also called "One-to-One"

Surjective means that every "B" has at least one matching "A" (maybe more
than one).

There won't be a "B" left out.

Bijective means both Injective and Surjective together.

So there is a perfect "one-to-one correspondence" between the members of the

sets.

(But don't get that confused with the term "One-to-One" used to mean
injective).
Bijective functions have an inverse!

If every "A" goes to a unique "B", and every "B" has a matching "A" then we
can go back and forwards without being led astray.

Read Inverse Functions for more.