Nama : Monika Basar

Nim : 2017.V.1.0045

Mata kuliah : Struktur Aljabar

Injective, surjective and bijective functions

1. Definition of function
Function or mapping is a relation (relationship) from the set A to the set B,
where every x ∊ A is paired (linked) with one and only one y ∊ B. if the function is
named f, then the function is written with symbols f : AB (read: f map A to B).
a. Injective
Injective means we won’t have two or more “A” pointing to the same “B”.
A function f : A B is said to be injective (or one-to-one, or 1-1) if for any
x,y ∊ A, f(x) = f(y) implies x = y.
Alternatively, we can use the contrapositive formulation: x ≠ y implies f(x) ≠ f(y),
although practice usually the former is more effective.
Note :
injective functions are precisely those functions f whose inverse relation f −1 is also
a function.
b. Surjective
Surjective means that every B has at least one matching “A” (maybe more than one).
A function f : A B is said to be surjective (or onto) if rng (f) = B. That is, for
every b ∊ B there is some a ∊ A for which f(a) = b.
c. Bijective
Bijective means both injective ang surjective together. Think of it as a “perfect
pairing” between he sets: every one has a partner and no one is left out.
A function f : A B is said to be bijective (or one-to-one and onto) if it is both
injective and surjective. We also say that f is a one-to-one correspondence.

2. Theorem
The composition of injective functions is injective and the composition of surjective is
surjective, thus the composition of bijective functions is bijective. That is, let f : A B
and g : B C.
  If f,g are injective, then so is f ο g
 If f,g are surjective, then so is f ο g
 If f,g are bijective, then so is f ο g

As we established earlier, if f : A B is injective, then restriction of the inverse

relation f : rng(f)
−1
A is a functions. Moreover, if f : A B is bijective, then
rng(f) = B, and so the inverse relation f : B
−1
A is a function it self. The next theorem
says that even more is true if f : A B is bijective, then f −1 : B A is also
bijective.

Suppose f : A B is bijective, then the inverse function f −1 : B A is also

bijective .

Example :

1) Example of an injective function problem:

Given that A = {x | 1 ≤ x ≤ 4, x natural number member} and B = {even number less than
12}, so that B = {2, 4, 6, 8, 10}.

If x is a member of set A and y is a member of set B, where y = f (x), then the range of
the function f (x) = 2x is

f (1) = 2 (1) = 2

f (2) = 2 (2) = 4

f (3) = 2 (3) = 6

f (4) = 2 (4) = 8

Range or Rf = {(1,2), (2, 4), (3, 6), (4, 8)}

Note, there are still members B, namely 10 who are not paired with member A.

2) Examples of subjective problems:

Given that A = {-1, 0, 1, 2} and B = {0, 1, 4}

If x is a member of set A and y is a member of set B, where y = f (x), then the range of
the function f (x) = x² is

f (-1) = (-1) ² = 1

f (0) = (0) ² = 0
 f (1) = (1) ² = 1

f (2) = (2) ² = 4

Range or Rf = {(-1, 1), (0, 0), (1, 1), (2, 4)}

Note, member B, namely 1, is paired with two members A. There is no member B who is
not paired.

3) Examples of wise questions:

Given that A = {-1, 0, 1, 2} and B = {-1, 0, 1, 8}

If x is a member of set A and y is a member of set B, where y = f (x), then the range of
the function f (x) = x³ is

f (-1) = (-1) ³ = -1

f (0) = (0) ³ = 0

f (1) = (1) ³ = 1

f (2) = (2) ³ = 8

Range or Rf = {(-1, -1), (0, 0), (1, 1), (2, 8)}

Note, each member A is exactly paired with one member B