1

Functions
CS/APMA 202
Rosen section 1.8
Aaron Bloomfield
2
Definition of a function
A function takes an element from a set
and maps it to a UNIQUE element in
another set
3
Function terminology
R Z
f
4.3
4
Domain
Co-domain
Pre-image of 4
Image of 4.3
f maps R to Z
f(4.3)
4
More functions
1
2
3
4
5
a
bb
cccc
dd
e
A string length function
A
B
C
D
F
Alice
Bob
Chris
Dave
Emma
A class grade function
Domain Co-domain
A pre-image
of 1
The image
of A
5
Even more functions
1
2
3
4
5
a
bb
cccc
dd
e
Not a valid function!
Also not a valid function!

1
2
3
4
5
a
e
i
o
u
Some function
Range
6
Function arithmetic
Let f
1
(x) = 2x
Let f
2
(x) = x
2


f
1
+f
2
= (f
1
+f
2
)(x) = f
1
(x)+f
2
(x) = 2x+x
2


f
1
*f
2
= (f
1
*f
2
)(x) = f
1
(x)*f
2
(x) = 2x*x
2
= 2x
3

7
One-to-one functions
1
2
3
4
5
a
e
i
o

A one-to-one function
1
2
3
4
5
a
e
i
o

A function that is
not one-to-one
A function is one-to-one if each element in
the co-domain has a unique pre-image
8
More on one-to-one
Injective is synonymous with one-to-one
A function is injective
A function is an injection if it is one-to-one

Note that there can
be un-used elements
in the co-domain
1
2
3
4
5
a
e
i
o

A one-to-one function
9
Onto functions
1
2
3
4
5
a
e
i
o

A function that
is not onto
A function is onto if each element in the
co-domain is an image of some pre-image
1
2
3
4

a
e
i
o
u
An onto function
10
1
2
3
4

a
e
i
o
u
An onto function
More on onto
Surjective is synonymous with onto
A function is surjective
A function is an surjection if it is onto

Note that there can
be multiply used
elements in the
co-domain
11
Onto vs. one-to-one
Are the following functions onto, one-to-
one, both, or neither?
1
2
3
4
a
b
c
1
2
3
a
b
c
d
1
2
3
4
a
b
c
d
1
2
3
4
a
b
c
d
1
2
3
4
a
b
c
1-to-1, not onto
Onto, not 1-to-1
Both 1-to-1 and onto Not a valid function
Neither 1-to-1 nor onto
13
Bijections
Consider a function that is
both one-to-one and onto:

Such a function is a one-to-one
correspondence, or a bijection
1
2
3
4
a
b
c
d
14
Identity functions
A function such that the image and the
pre-image are ALWAYS equal

f(x) = 1*x
f(x) = x + 0

The domain and the co-domain must be
the same set
15
Inverse functions
R R
f
4.3
8.6
Let f(x) = 2*x
f
-1
f(4.3)
f
-1
(8.6)
Then f
-1
(x) = x/2
16
More on inverse functions
Can we define the inverse of the following
functions?






An inverse function can ONLY be done defined
on a bijection
1
2
3
4
a
b
c
1
2
3
a
b
c
d
What is f
-1
(2)?
Not onto!
What is f
-1
(2)?
Not 1-to-1!
17
Compositions of functions
Let (f g)(x) = f(g(x))

Let f(x) = 2x+3 Let g(x) = 3x+2

g(1) = 5, f(5) = 13

Thus, (f g)(1) = f(g(1)) = 13
18
Compositions of functions
g f
f g
g(a)
f(a)
(f g)(a)
g(a)
f(g(a))
a
A
B C
19
Compositions of functions
g f
f g
g(1)
f(5)
(f g)(1)
g(1)=5
f(g(1))=13
1
R
R R
Let f(x) = 2x+3 Let g(x) = 3x+2
f(g(x)) = 2(3x+2)+3 = 6x+7
20
Compositions of functions
Does f(g(x)) = g(f(x))?

Let f(x) = 2x+3 Let g(x) = 3x+2

f(g(x)) = 2(3x+2)+3 = 6x+7
g(f(x)) = 3(2x+3)+2 = 6x+11


Function composition is not commutative!
Not equal!
21
Graphs of functions
Let f(x)=2x+1

Plot (x, f(x))





This is a plot
of f(x)
x=1
f(x)=3
x=2
f(x)=5
22
Useful functions
Floor: x means take the greatest integer
less than or equal to the number


Ceiling: x( means take the lowest integer
greater than or equal to the number

round(x) = floor(x+0.5)
23
Rosen, question 8 (1.8)
Find these values

1.1
1.1(
-0.1
-0.1(
2.99(
-2.99(
+(
+ ( + (


1
2
-1
0
3
-2
+1 = 3/2 = 1
0 + 1 + ( = 3/2( = 2
24
Ceiling and floor properties
Let n be an integer
(1a) x = n if and only if n x < n+1
(1b) x( = n if and only if n-1 < x n
(1c) x = n if and only if x-1 < n x
(1d) x( = n if and only if x n < x+1
(2) x-1 < x x = x( < x+1
(3a) -x = - x(
(3b) -x( = - x
(4a) x+n = x+n
(4b) x+n( = x(+n
25
Ceiling property proof
Prove rule 4a: x+n = x+n
Where n is an integer
Will use rule 1a: x = n if and only if n x <
n+1
Direct proof!
Let m = x
Thus, m x < m+1 (by rule 1a)
Add n to both sides: m+n x+n < m+n+1
By rule 4a, m+n = x+n
Since m = x, m+n also equals x+n
Thus, x+n = m+n = x+n
26
Factorial
Factorial is denoted by n!

n! = n * (n-1) * (n-2) * * 2 * 1

Thus, 6! = 6 * 5 * 4 * 3 * 2 * 1 = 720

Note that 0! is defined to equal 1
27
Proving function problems
Rosen, question 32, 1.8
Let f be a function from A to B, and let S
and T be subsets of A. Show that

) ( ) ( ) ( )
) ( ) ( ) ( )
T f S f T S f b
T f S f T S f a


_
=
28
Proving function problems
Rosen, question 32 (a): f(SUT) = f(S) U f(T)
Will show that each side is a subset of the other
Two cases!
Show that f(SUT) _ f(S) U f(T)
Let b e f(SUT). Thus, b=f(a) for some aeS U T
Either aeS, in which case bef(S)
Or aeT, in which case bef(T)
Thus, bef(S) U f(T)
Show that f(S) U f(T) _ f(S U T)
Let b e f(S) U f(T)
Either b e f(S) or b e f(T) (or both!)
Thus, b = f(a) for some a e S or some a e T
In either case, b = f(a) for some a e S U T
29
Proving function problems
Rosen, question 32 (b): f(ST) _ f(S) f(T)

Let b e f(ST). Then b = f(a) for some a e ST
This implies that a e S and a e T
Thus, b e f(S) and b e f(T)
Therefore, b e f(S) f(T)
30
Proving function problems
Rosen, question 62, 1.8
Let f be an invertible function from Y to Z
Let g be an invertible function from X to Y
Show that the inverse of fg is:
(fg)
-1
= g
-1
f
-1


31
Proving function problems
Rosen, question 62, 1.8
Thus, we want to show,
for all zeZ and xeX





The second equality is similar
( ) ( ) ( )
( ) ( ) ( ) x x g f f g
z z f g g f
=
=


) (
) (
1 1
1 1


( ) ( ) ( ) ( ) ( ) ( )
( ) ( ) ( )
( ) ( ) ( )
( )
z
z f f
z f g g f
z f g g f
z f g g f z f g g f
=
=
=
=
=

) (
) (
) (
) ( ) (
1
1 1
1 1
1 1 1 1

32
Quick survey
I felt I understood the material in this slide set
a) Very well
b) With some review, Ill be good
c) Not really
d) Not at all
33
Quick survey
The pace of the lecture for this slide set was
a) Fast
b) About right
c) A little slow
d) Too slow
34
Quick survey
How interesting was the material in this slide
set? Be honest!
a) Wow! That was SOOOOOO cool!
b) Somewhat interesting
c) Rather borting
d) Zzzzzzzzzzz