Chapter :4

Functions

05/23/23 (c)2001-2003, Michael P. Frank 1

 Function: Formal Definition
• Def. 1: Let A and B be sets, a function from
A to B (f: A  B) is an assignment of
exactly one elements of B to each element
of A. where f(a) = b , and a  A, bB.

05/23/23 (c)2001-2003, Michael P. Frank 2

 Graphical Representations
• Functions can be represented graphically in
several ways: f

• •b
a

A B
Like Venn diagrams

05/23/23 (c)2001-2003, Michael P. Frank 3

 Some Function Terminology
• If it is written that f:AB, and f(a)=b
(where aA & bB), then we say:
– A is the domain of f.
– B is the codomain of f.
– b is the image of a under f.
– a is a pre-image of b under f.
• In general, b may have more than 1 pre-image.
– The range RB of f is R={b | a f(a)=b }.
– If f is a function from A to B, we say that A maps B.

05/23/23 (c)2001-2003, Michael P. Frank 4

 Range versus Codomain
• The range of a function might not be its
whole codomain.
• The codomain is the set that the function is
declared to map all domain values into.
• The range is the particular set of values in
the codomain that the function actually
maps elements of the domain to.

05/23/23 (c)2001-2003, Michael P. Frank 5

 Example
Let f: Z  Z such that
f(x) = x2
The domain and the codomain is all integers.
The range of f is the set positive integers N

05/23/23 (c)2001-2003, Michael P. Frank 6

 Example
• let A={1,2,3} B={1,2,3,4,5}
• Determine whether the following is
function from A B or not
• F1={(1,5), (2,2), (3,2)} Yes
• F2={(1,2) ,(2,3) ,(2,5), (3,3)} No

05/23/23 (c)2001-2003, Michael P. Frank 7

 Function Representations
A function can be specified in different ways:
•Formula ex: f(x) = x +1
•Graph: ex: function f: A  B
A = { a , b , c} and B = { 2 , 3, 4} f(a) = 2, f(b) = 4 f(c) = 3

•List: F={(a,2),(b,4),(c,3)}

05/23/23 (c)2001-2003, Michael P. Frank 8

 Function Representations
• We can represent a function f:AB as a set
of ordered pairs {(a,f(a)) | aA}.
• Note that a, there is only 1 pair (a,b).
Ex: function f: A  B
A = { a , b , c} and B = { 2 , 3, 4} f(a) = 2, f(b) = 4 f(c) = 3

F={(a,2),(b,4),(c,3)}

05/23/23 (c)2001-2003, Michael P. Frank 9

 Function Operator Example
 ,× (“plus”,“times”) are binary operators
over R. (Normal addition & multiplication.)
• Therefore, we can also add and multiply
functions f,g:RR:
– (f  g):RR, where (f  g)(x) = f(x)  g(x)
– (f × g):RR, where (f × g)(x) = f(x) × g(x)

05/23/23 (c)2001-2003, Michael P. Frank 10

 Function Operator Example
• Ex: 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 f1 f2?
 
(f1 + f2)(x) = f1(x) + f2(x) = x2 + (x –x2) = x
(f1 f2)(x) = f1(x) f2(x) = x2 * (x –x2) = x3 – x4

05/23/23 (c)2001-2003, Michael P. Frank 11

 Identity function
Identity function on A is the function
f:A  A , where f(x) = x

05/23/23 (c)2001-2003, Michael P. Frank 12

 Identity Function Illustrations
• The identity function:

•
• • y y = I(x) = x
• •
• •
• •

Domain and range x

05/23/23 (c)2001-2003, Michael P. Frank 13

 Functions Types
A. One –To - One (injective) 
A function f is One- to –One if and only if f(x) = f(y)
implies that x =y for all x and y in the domain of f.

xy ( f(x) = f(y)  x = y)

or
xy (x  y  f(x)  f(y) )

05/23/23 (c)2001-2003, Michael P. Frank 14

 One-to-One Illustration
• (graph representations of functions that are
(or not) one-to-one:
• • • •
• • • • •
• • • •
• • • •
• • •
• • • •
• •
•
Not one-to-one Not even a
One-to-one function!

05/23/23 (c)2001-2003, Michael P. Frank 15

 Functions Types
Ex: 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.

05/23/23 (c)2001-2003, Michael P. Frank 16

 Functions Types
Ex: Determine whether the functions f:ZZ is one-to-one or
not.
1.f(x) = x2
 Sol: The function f(x) = x2 is not one-to-one because
f(1) = f(-1) = 1 but 1  -1

2. f(x)=x+5
 it is one-to-one

05/23/23 (c)2001-2003, Michael P. Frank 17

 Functions Types
B. Onto (Surjective)
A function f:AB is onto or surjective iff its
range is equal to its codomain

(bB, aA: f(a)=b).

05/23/23 (c)2001-2003, Michael P. Frank 18

 Functions Types
Ex: let the function f from {a, b, c, d} to { 1, 2 ,3}
defined by f(a) = 3, f(b)= 2, f(c)=1, f(d) = 3, is f onto?

05/23/23 (c)2001-2003, Michael P. Frank 19

 Functions Types
Ex: is the function f(x) = x2 from Z ­ Z Onto
function.
 
Sol.: It is not onto function, since there is no
integer x such that f(x) = -1

05/23/23 (c)2001-2003, Michael P. Frank 20

 Functions Types
C. One- to –one correspondence (bijective)

A function is bijective if and only if it is both

one-to-one and onto

Ex: identity function f(x) = x is bijective

05/23/23 (c)2001-2003, Michael P. Frank 21

 Functions Types

05/23/23 (c)2001-2003, Michael P. Frank 22

 Composition Function
Note match here.

• For functions g:AB and f:BC, there is a

special operator called compose (“○”).
– It composes (creates) a new function out of f
and g by applying f to the result of applying g.
– We say (f○g):AC, where (f○g)(a) :≡ f(g(a)).
– Note g(a)B, so f(g(a)) is defined and C.
– is non-commuting. (Generally, f○g  g○f.)

05/23/23 (c)2001-2003, Michael P. Frank

 Composition Function
Note match here.

Ex: Let f(x) = 2x + 3 and g(x) = 3x + 2 what

is the composition of f and g if they both are
from R to R?
( f  g)(x) = f(g(x)) = f (3x + 2) = 6x + 7
( g  f)(x) = g(f(x)) = g (2x + 3) = 6x + 11

 ( f  g)(x)  ( g  f) (x)

05/23/23 (c)2001-2003, Michael P. Frank

 Inverse Function
For bijections f:AB, there exists an inverse of f,
written f 1:BA, where f(a) = b and f –1(b) = a

which is the unique function such that

– (where IA is the identity function on A)

f 1  f  I A

05/23/23 (c)2001-2003, Michael P. Frank 25

 Inverse Function
Ex: let f be the function from {a, b, c} to {1, 2, 3}
such that f(a)=2, f(b)=3, f(c)=1, is f bijective and
what is its inverse if it is?
 Sol.: f is bijective because it ‘s one-to-one and onto
f -1(2)=a, f -1(3)=b, f -1(1)=c

05/23/23 26
 Inverse Function
• Ex: Let f be the function from Z to Z with
f(x) = x + 1, is f bijective?

• Sol.: It is bijective and the inverse is

f(y)=y -1
 f -1(x)=x-1

05/23/23 (c)2001-2003, Michael P. Frank 27

 Inverse Function
EX: Find the inverse function of f(x)=3x+2

05/23/23 (c)2001-2003, Michael P. Frank 28

 Floor And Ceiling Function
• Floor function x: the floor of real
number x is the largest integer that is less
than or equal to x.

• Ceiling function x: the ceiling of real

number x is the smallest integer that is
greater than or equal to x.

05/23/23 (c)2001-2003, Michael P. Frank 29

 Visualizing Floor & Ceiling
• Real numbers “fall to their floor” or “rise to
their ceiling.” 3
. 1.6=2

• Note that if xZ, 2 . 1.6

1 .
x   x & 1.6=1

0
x   x . 1.4= 1
1 .
• Note that if xZ, 2 .
1.4

1.4= 2
x = x = x. 3 .. . 3
3=3= 3

05/23/23 (c)2001-2003, Michael P. Frank 30

 Floor And Ceiling Function
• Ex: what is the value of the following?
• 1/2 = 0 1/2 = 1
• -1/2 = -1 -1/2 = 0
• 3.1 = 3 3.1 = 4
• 7=7 7 =7

Note: x-1 < x  x  x < x + 1

05/23/23 (c)2001-2003, Michael P. Frank 31