Types of Functions
Types of Functions
(b) f (−2) = (−2)2 + 6(−2) + 2 = −6. Thus −2 → −6 or as an ordered pair, (−2, −6).
(d)
f (x + 1) = (x + 1)2 + 6(x + 1) + 2
= (x2 + 2x + 1 + 6x + 6 + 2)
= x2 + 8x + 9.
(e)
f (n − 2) = (n − 2)2 + 6(n − 2) + 2
= n2 − 4n + 4 + 6n − 12 + 2
= n2 + 2n − 6 or as an ordered pair, ((n − 2), (n2 + 2n − 6)
Thus (n − 2) → n2 + 2n − 6
f (x+h)−f (x)
Example 1.5.10 Let f (x) = 2x2 − 1. Let h > 0. Find the value of h
.
f (x + h) = 2(x + h)2 − 1
= 2(x2 + 2hx + h2 ) − 1
DW Ddumba 19
A function is one-to-one if and only if each element in the domain is mapped into a unique
element of the co-domain (range).
A one to one function is a function in which every element in the range of the function
corresponds with one and only one element in the domain.
Thus g is 1 − 1.
Example 1.6.3 The function f : R → R defined by f (x) = 2x + 1 is injective.
Example 1.6.4 The function g : R → R defined by g(x) = x2 is not injective, because
(for example) g(1) = 1 = g(−1). However, if g is redefined so that its domain is the
non-negative real numbers [0, +∞), then g is injective.
A one-to-one function is one in which each x has only one y and each y has at most one
x to form ordered pairs.
Example 1.6.5 Let the function f : R → R be defined by the equation f (x) = 3x + 2
where R is the set of real numbers. Each real number will be mapped onto a unique image
by the function f (x) = 3x + 2. Hence f is a one-to-one function.
Example 1.6.6 Let the function f : R → R be defined by the formula f (x) = 3x2 + 2
Verify whether or not f is a one-to-one function.
The negative values of R are mapped onto the same elements as the corresponding positive
elements. For example, when x = −2, f(−2) = 14 and f (2) = 14. The images of two real
numbers −2 and 2 are the same number equal to 14. It follows that f is NOT a one-to-one
function.
Definition 1.6.1 A one to one function is also called an injective function.
DW Ddumba 21
r 4
h
o 2
q 5
A
"O ne-to-O ne" B
N O T "O ne-to-O ne"
Theorem 1.6.1 The Horizontal Line Test: If a function is one to one, then the function
not only passes the vertical line test, but it also passes the horizontal line test.
Definition 1.6.2 The Horizontal Line Test : If a horizontal line only intersects with the
graph of a function once, then this function is one-to-one. If a horizontal line intersects
the graph of the function more than once, then this function is not one to one.
Failthe test(notinjective)
Passes the test(injective)
1.6.4 Onto-Functions
If f is a function of A into B. Sometimes the range, f (A) does not exhaust all the elements
of the set B called the co-domain. The range is therefore a subset of the co-domain. If
each member of the co-domain is an image of at least one member of A then f is a function
of A ONTO B and is therefore an onto function.
Definition 1.6.3 A function f from A to B is called onto if for all b in B there is an a
in A such that f (a) = b. All elements in B are used. Such functions are referred to as
surjective.
r 4 r 4
h 8
o 2 h
2
q 5 1
q 5
A B
A B
"O nto"
N O T "O nto"
(allelem ents in B are used)
(the 8 and 1 in SetB are notused)
A function is said to be onto if all in range is an image (is a result of the transformation
- mapping)
Example 1.6.10 Is f (x) = 3x − 4 onto where f : R → R?
Proof: Let a, b ∈ N be such that f (a) = f (b). This implies a2 = b2 by the definition of f .
Thus a = b or a = −b. Since the domain of f is the set of natural numbers (positive
integers), both a and b must be non-negative. Thus a = b. This shows
∀a, ∀b, [f (a) = f (b) ⇒ a = b]
which shows f is injective.
Example 1.6.17 Prove that the function g : N → N, defined by g(n) = n3 , is surjective.
Proof: The numbers 1 and 2 are in the domain of g and are not equal, but g(1) = g(2) = 0.
Thus g is not injective.
Example 1.6.19 Prove that the function f : N → N be defined by f (n) = n2 , is not
surjective.
Proof: The number 3 is an element of the codomain, N. However, 3 is not the square of
any integer. Therefore, there is no element of the domain that maps to the number 3, so
f is not surjective.
Let A and B be any sets and f be a function from A into B, that is, f : A → B. The
inverse function maps elements in B into those in A, that is f −1 : B → A. The domain
of the function f is the range of f −1 and the range of f is the domain of f −1 .
Definition 1.6.5 Suppose f : A → B is a bijection. Then the inverse of f , denoted
f −1 : B → A
is the function defined by the rule
f −1 (y) = x if and only if f (x) = y
26 Calculus I: Lecture Notes
2. solving the new equation with y as the subject of the equation, that is, y = ... and
3. replacing y by f −1 (x).
This function is surely one-to-one and onto (verify this). It is therefore possible to find
its inverse. The function f (x) = 2x + 4 can be written as y = 2x + 4. Now, interchanging
x and y gives x = 2y + 4. Making y the subject of the equation gives y = x−4
2
. The inverse
function f −1 (x) = x−4
2
= 1
2
x − 2.
x
f (x) =
x−2
Exercise 1.3 Find the inverse of the function f : R − (2) → R − (1) defined by
x−1
f (x) =
x+2
Exercise 1.4 Find the inverse of the function f : R → (−∞, 1) defined by f (x) = 1−ex .
Theorem 1.6.2 Let A and B are any sets and the function f : A → B be one-to-one
and onto (the inverse function exists) (f −1 of) : A → A is the identity function on A
similarly the composite function (fof −1 ) : B → B is the identity function on B.
1
= 3x2 − +3
x
(x + 2)(x − 2)
=
(x − 2)
= (x + 2)
The domain of this function in the set of real numbers excludes x = 2 since for
x = 2 we have f2 (x) = 0.
(5) Composite functions
Given two functions g(x), f(x), their composite function denoted by fog(x) is de-
fined as fog (x) = f (g(x))
or gof (x) = g (f (x))
Example 1.6.39 Given that f (x) = 3x and g(x) = x2 , then
fog (x) = f (x2 ) = 3x2
gof (x) = g (3x) = (3x)2 = 9x2
Example 1.6.40 Given that h(x) = 2x and g(x) = 5x, then
hog (x) = h (5x) = 2(5x) = 10x
goh (x) = g (2x) = 5(2x) = 10x
Example 1.6.41 Let f1(x) = x2 +3x +2 and f2 (x) = x +3. Compute and simplify
(if possible) (f2 of1 )(x) and (f1of2 )(x).
(f2 of1 )(x) = f2 (f1 (x))
= f2 (x2 + 3x + 2)
= (x2 + 3x + 2) + 3
= x2 + 3x + 5
To compute (f1of2 )(x), substitute f2 into f1
(f1 of2 )(x) = f1 (f2 (x))
= f1 (x + 3)
= (x + 3)2 + 3(x + 3) + 2
= x2 + 6x + 9 + 3x + 9 + 2
= x2 + 9x + 20
30 Calculus I: Lecture Notes
Note that in this case commutativity does not hold that is,
1
Example 1.6.42 Let f1 (x) = x
and f2 (x) = x2 . Compute and simplify (if possible)
(f2 of1 )(x) and (f1 of2 )(x).
1
= .
x2
Note that in this case the composite functions commute, that is, (f2 of1 )(x) =
(f1 of2 )(x).
Example 1.6.43
t−1 , t ≤ −3
3
g(t) = 2t , −3 < t ≤ 9
4 − 6t, t > 9
Example 1.6.44
x2 + 1 , x≥0
f (x) =
−x − 9 , x<0
Definition 1.6.9 A polynomial function f is one that can be written in the form
f (x)
g(x) =
h(x)
f (x + nT ) = f (x)
That means the function repeats itself as the rate of T intervals of x. For example the
function f (x) = sin x is periodic with period 2π since sin(x + 2nπ) = sin x for all n = 1,
2, . . .
Definition 1.6.13 The floor function or greatest integer function is the function
defined as follows: for a real number x, the floor of x, denoted bxc, is the greatest integer
less than or equal to x.
The floor of x is sometimes referred to as the integer part or integral value of x. (Is the
integer just below - on the left)
Example 1.6.45
Example 1.6.46
b1.7c = 1, bπc = 3 and b−3.2c = −4
The floor of x satisfies the following inequality.
Definition 1.6.14 The ceiling function or smallest integer function is the function
defined as follows: for a real number x, the ceiling of x, denoted dxe, is the smallest integer
not less than x. (The integer just above - on the right)
Example 1.6.47
Example 1.6.48
d1.7e = 2, dπe = 4 and d−3.2e = −3
The ceiling of x satisfies the following inequality.
x ≤ dxe < x + 1
Definition 1.6.15 The sign function is the function, denoted sgn, defined as
−1 , x<0
sgn(x) = 0, x=0
1, x>0
x
sgn(x) =
|x|