FUNCTION
Function: A function takes an element from a set and maps it to a
UNIQUE element in another set.
Let A and B be nonempty sets. A function f from A to B is an
assignment of exactly one element of B to each element of A. We
write f (a) = b if b is the unique element of B assigned by the function f
to the element a of A. If f is a function from A to B, we write f : A →
B.
Let f1 and f2 be functions from A to R. Then f1 + f2 and f1f2 are also
functions from A to R defined for all x ∈ A by
(f1 + f2)(x) = f1(x) + f2(x),
(f1f2)(x) = f1(x)f2(x).
EXAMPLE 6 Let f1 and f2 be functions from R to R such that f1(x) =
x2 and f2(x) = x − x2. What are the functions f1 + f2 and f1f2?
Solution: From the definition of the sum and product of functions, it
follows that
((f1 + f2)(x) = f1(x) + f2(x) = x2 + (x − x2) = x
and
(f1f2)(x) = x2(x − x2) = x3 − x4.
Example: Let A = {a, b, c, d, e} and B = {1, 2, 3, 4} with
f (a) = 2, f (b) = 1, f (c) = 4, f (d) = 1, and f (e) = 1.
So, The image of the subset S = {b, c, d} is the set f (S) = {1, 4}.
One-to-one Function: A function is
one-to-one if each element in the co-
domain has a unique pre-image.
A function is said to be injective if it is
one-to-one.
EXAMPLE 8 Determine whether the function f from {a, b, c, d} to {1,
2, 3, 4, 5} with f (a) = 4, f (b) = 5, f (c) = 1, and f (d) = 3 is one-to-one.
Solution: The function f is one-to-one because f takes on different
values at the four elements of its domain.
EXAMPLE 9 Determine whether the function f (x) = x2 from the set of
integers to the set of integers is one-to-one.
Solution: The function f (x) = x2 is not one-to-one because, for instance, f
(1) = f (−1) = 1, but 1 =’−1.
Note that the function f (x) = x2 with its domain restricted to Z+ is
one-to-one.
Onto Function: A function is
onto if each element in the co-
domain is an image of some pre-
image.
A function f is called surjective if
it is onto.
EXAMPLE 12 Let f be the function from {a, b, c, d} to {1, 2, 3}
defined by f (a) = 3, f (b) = 2, f (c) = 1, and f (d) = 3. Is f an onto
function?
Solution: Because all three elements of the codomain are images of
elements in the domain, we see that f is onto.
EXAMPLE 13 Is the function f (x) = x2 from the set of integers to the
set of integers onto?
Solution: The function f is not onto because there is no integer x with x2
= −1,
EXAMPLE 14 Is the function f (x) = x + 1 from the set of integers to
the set of integers onto?
Solution: This function is onto, because for every integer y there is an
integer x such that f (x) = y.
Bijection: The function f is a one-to-one correspondence, or a bijection,
if it is both one-to-one and onto. We also say that such a function is
bijective.
EXAMPLE 16 Let f be the function from {a, b, c, d} to {1, 2, 3, 4} with
f (a) = 4, f (b) = 2, f (c) = 1, and f (d) = 3. Is f a bijection?
Solution: The function f is one-to-one and onto. It is one-to-one because
no two values in the domain are assigned the same function value. It
is onto because all four elements of the codomain are images of
elements in the domain. Hence, f is a bijection.
Inverse Functions: Let f be a one-to-one correspondence from the set A
to the set B. The inverse function of f is the function that assigns to an
element b belonging to B the
unique element a in A such that f
(a) = b. The inverse function of f is
denoted by f −1. Hence, f −1(b) = a
when f (a) = b.
Composite Function: Let g be a function from the set A to the set B and
let f be a function from the set B to the set C. The composition of the
functions f and g, denoted for all a ∈ A by f ◦ g, is defined by (f ◦ g)(a) =
f (g(a)).