CHAPTER 2 (PART 2)

FUNCTIONS
OUTLINE

 Functions
 One-to-one and onto Functions
 Inverse Function
 Function Composition
 Floor, Ceiling, Factorial
FUNCTIONS

Definition: Let A and B be nonempty sets. A function f from A to B, denoted

f : A → B is an assignment of each element of A to exactly one element of B.
We write f(a) = b if b is the unique element of B assigned by the
function f to the element a of A.
 Functions are sometimes Students Grades
called mappings or A
transformations. Carlota Rodriguez
B

Sandeep Patel C

Jalen Williams D

F
Kathy Scott
FUNCTIONS

 A function f : A → B can also be defined as a subset of A×B (a relation). A

function f : A → B , is a relation from A to B that satisfies two properties:
 Every element in A is related to some element in B.
 No element in A is related to more than one element in B.

A
a
B
x
b
y
c
d z
 FUNCTIONS

Given a function f: A → B:
 We say f maps A to B or
f is a mapping from A to B.
 A is called the domain of f.
 B is called the codomain of f.
 If f(a) = b,
 then b is called the image of a under f.
 a is called the preimage of b.
 The range of f is the set of all images of points in A under f. We denote it by
f(A).
 Two functions are equal when they have the same domain, the same codomain
and map each element of the domain to the same element of the codomain.
 QUESTIONS
f(a) = ? z A B
a
The image of d is ? z x

b
The domain of f is ? A y
c
The codomain of f is ? B
d z
The preimage of y is ? b
f(A) = ? {y, z}
The preimage(s) of z is (are) ? {a,c,d}
INJECTIONS
Definition: A function f is said to be one-to-one , or
injective, if and only if f(a) = f(b) implies that a = b for
all a and b in the domain of f. A function is said to be
an injection if it is one-to-one.
A B
a x

v
b
y
c
z
d

w
SURJECTIONS
Definition: A function f from A to B is called onto or
surjective, if and only if for every element
there is an element with . A
function f is called a surjection if it is onto.

A B
a x

b
y
c
z
d
BIJECTIONS
Definition: A function f is a one-to-one
correspondence, or a bijection, if it is both one-to-one
and onto (surjective and injective).

A
a
B
x

b
y
c

d z

w
ONE-TO-ONE AND ONTO FUNCTIONS
FUNCTIONS
FUNCTIONS
SHOWING THAT F IS ONE-TO-ONE OR
ONTO
SHOWING THAT F IS ONTO FUNCTION

Example : 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: Yes, f is onto since all three elements of the
codomain are images of elements in the domain.

If the codomain were changed to {1, 2, 3, 4}, f would not be

onto.
ONE-TO-ONE AND ONTO
FUNCTIONS
Example : Is the function f(x) = x2 from the set of integers
onto?
Solution: No, f is not onto because there is no integer x with
x2 = −1, for example.

Example :
SHOWING THAT F IS ONE-TO-ONE AND
ONTO
Example 1:

Example 2:
INVERSE FUNCTIONS
Definition: Let f be a bijection from A to B. Then the
inverse of f, denoted , is the function from B to A
defined as
No inverse exists unless f is a bijection. Why?
INVERSE FUNCTIONS

A f
B A B
a V V
a

b b
W W
c c

d X X
d

Y Y
QUESTIONS

Example 1: Let f be the function from {a,b,c} to {1,2,3} such that f(a) = 2, f(b) =
3, and f(c) = 1. Is f invertible and if so what is its inverse?

Solution: The function f is invertible because it is a one-

to-one correspondence. The inverse function f-1 reverses
the correspondence given by f, so f-1 (1) = c, f-1 (2) = a,
and f-1 (3) = b.
QUESTIONS

Example 2: Let f: Z  Z be such that f(x) = x + 1. Is f invertible, and if so, what

is its inverse?

Solution: The function f is invertible because it is a one-

to-one correspondence. The inverse function f-1 reverses
the correspondence so f-1 (y) = y – 1.
QUESTIONS

Example 3: Let f: R → R be such that .

Is f invertible, and if so, what is its inverse?

Solution: The function f is not invertible because it is

not one-to-one .
COMPOSITION
Definition: Let f: B → C, g: A → B. The composition of
f with g, denoted is the function from A to C
defined by
COMPOSITION

g f
A B C A C
V a
a h h
b i b
W i
c
c
X j
d
d j
Y
COMPOSITION

Example 1: If and ,
then

and
COMPOSITION QUESTIONS

Example 2: Let f and g be functions from the set of integers to the set of integers
defined by f(x) = 2x + 3 and g(x) = 3x + 2.
What is the composition of f and g, and also the composition of g and f ?
Solution:
(f∘g) (x)= f(g(x))
= f(3x + 2) = 2(3x + 2) + 3 = 6x + 7
(g∘f) (x)= g(f(x))
= g(2x + 3) = 3(2x + 3) + 2 = 6x + 11
FUNCTION, INVERSE AND COMPOSITION

Consider the following:

IDENTITY FUNCTION

Given a set X, define a function Ix from X to X by

Ix (x) = x for all x in X.

Ix is called the identity function on X because whatever input to the identity function
the output comes out unchanged.
EQUALITY OF FUNCTIONS

Example:
EQUALITY OF FUNCTIONS

Solution:
BOOLEAN FUNCTIONS
Solution:
EXERCISE 1
Find the inverse function of
 EXERCISE 2
Find and where and , are functions from R to R.

• Identify whether f  g  g  f
 EXERCISE 3
Find and where and , are functions from R to R.

• Identify whether ( f  g ) 1  g 1  f 1
 EXERCISE 4
Find and where and , are functions from R to R.

• Identify whether ( g  f ) 1  f 1  g 1
 GRAPHS OF FUNCTIONS

 Let f be a function from the set A to the set B. The graph of the function f
is the set of ordered pairs {(a,b) | a ∈A and f(a) = b}.

Graph of f(n) = 2n + 1 Graph of f(x) = x2

from Z to Z from Z to Z
SOME IMPORTANT FUNCTIONS

The floor function, denoted

is the largest integer less than or equal to x.
The ceiling function, denoted
is the smallest integer greater than or equal to x

Example:
FLOOR AND CEILING FUNCTIONS

Graph of (a) Floor and (b) Ceiling Functions

FLOOR AND CEILING FUNCTIONS
FACTORIAL FUNCTION

Definition: f: N → Z+ , denoted by f(n) = n! is the product of the first n positive integers when n
is a nonnegative integer.

f(n) = 1 ∙ 2 ∙∙∙ (n – 1) ∙ n, f(0) = 0! = 1

Examples:
f(1) = 1! = 1 Stirling’s Formula:

f(2) = 2! = 1 ∙ 2 = 2

f(6) = 6! = 1 ∙ 2 ∙ 3∙ 4∙ 5 ∙ 6 = 720

f(20) = 2,432,902,008,176,640,000.