Lecture Notes in

DSCRETE
MATHEMATCS


Joe Mari D. Reyes
POLYTECHNC UNVERSTY OF THE PHLPPNES

CHAPTER 1: aaa
Definition 1.1 Let A, B . A function f: AB is simply a rule assigning each
element a A a unique b B. f b is uniquely assign to a, we will write b = f(a) or
f: ab. We call the set A as the domain of f and B as the codomain of f.
#emark:
1. f f is a function AB and f(a)=b
1
and f(a)=b
2
then b
1
=b
2
.
Hb. 1
Let A = B = . Define f(x) = x
2
, x f: xx
2

f(-2) = (-2)
2
= 4 and f(2) = (2)
2
= 4
f(-2) = f(2)
Hb. 2
Let Z be the set of all integers and Q = {
m
n
: m,n 5, n0}
Define f: 5 by f(
m
n
) = m
f(
1
2
) = 1, f(
5
2
) = 5, f(
2
4
) = 2 is f a function? NO.
1
2
=
2
4
but f(
1
2
) f(
2
4
).
Definition 1.2 Let f: AB be a function A
1
A. We define f[A
1
] = {f(a): aA
1
}. n
particular A
1
= A, then f[A] = {f(a): aA} is called the 7,nge of f. (mf := f[A]). Certainly,
f[A]B is f[A] = B.

Hb. 3
f: , define f(x) = x
2
. Let A
1
= [-1,1]
f[[-1,1]] = [0,1], f[[10,11]] = [100,121]
f[] = [0,]
Definition 1.3 Let . The function id
A
: AA, defined by id
A
(a) = a is called the identity
function.
ercise 1
1. When f = g?
Ans. f dom f = dom g
f f(x) = g(x) xdom f
Definition 1.4 omposition. Let f: AB, g: BC. We define the composition of g with f
as the function gf: AC define as (gf)(a) = g(f(a))
A B C


gf


f

%%f%% %f%
Hb. 4
f: define f(x) = x
3
g: define g(x) = V
3
gf: fg:
(gf)(x) = g(f(x)) (fg)(x) = f(g(x))
= g(x
3
) = f(V
3
)
= V
3
3
= (V
3
)
3
= x = x
= id
R
(x) = id
R
(x)
= gf = id
R
= fg = id
R

#emark:
1. gf fg in general
ercise 2
1. f f: AB, g: BC, h: CD then show that f(gh) = (fg)h
Let f, g, h be functions such that f: AB, g: BC, h: CD
Let xA, show [f(gh)](x) = [(fg)h](x)
[f(gh)](x) = f[(gh)(x)] = f(g(h(x))
[(fg)h](x) = (fg)(h(x)) = f(g(h(x))
f(g(h(x)) = f(g(h(x))
f(gh) = (fg)h
Definition 1.5 We say that a function f: AB is
1. injective or one-to-one iff f(a
1
) = f(a
2
) = a
1
= a
2
( aA).
1. su7jective or onto iff f[A] = B.
1. bijective or one-to-one co77espondence iff it is one-to-one and onto.
#emarks:
1. f is one-to-one a
1
a
2

f(a
1
) f(a
2
).
2. f is onto B f[A] bB, aA such that f(a) = b.
Hb. 5
Let A = B = and let m, b , m0.
Define f: by f(x) = mx + b, x (linear functions on ). Show that f is bijective
i. Let x
1
, x
2
. Assume f(x
1
) = f(x
2
).
By definition of f,
f(x
1
) = mx
1
+ b and f(x
2
) = mx
2
+ b
f(x
1
) = f(x
2
) mx
1
+ b = mx
2
+ b
= mx
1
= mx
2

= x
1
= x
2
since m0
f is one-to-one.
ii. Let y . We need to show x such that f(x) = y
y =
-b
m
, m0
Take x =
-b
m
, then f(x) = f(
-b
m
) = m(
-b
m
) + b = m
f is onto.
f is a bijection
Hb. 6
f m = 1, b = 0 then f(x) = y = id
R
(x)
= id
R
: is a bijection.
Hb. 7
f A is id a bijection from A to A?
id
A
(a
1
)

= id
A
(a
2
)

=

a
1
= a
2
=

id
A
is one-to-one.
id
A
(A)

= A = id
A
is onto.
Therefore, f is a bijection.

Hb. 8
f: define f(x) = x
2
.
s f one-to-one? No, since f(-2) = 4 = f(2) but -2 2.
s f onto? No, since f[] = [0,]
Therefore, f is not a bijection.
Hb. 9
Let: 5 7 5 be defined by (n) = 3n
s one-to-one? Yes, Let n
1
, n
2
5 . f y(n
1
) = y(n
2
) then 3n
1
= 3n
2
=

n
1
= n
2

s onto? No, since [5] = {(n): n 5 } = {0,3,-3,6,-6,9,-9,.} 5
Therefore, is not bijective though it's one-to-one.
Hb. 10
Let A = {a, b, c} and B = { }
Every onto function from A to B is not one-to-one
aa
bb
c c
%eorem 1.1 Given a function f: AB. f is bijective if and only if there is a bijective
function g: BA such that gf = id
A
and fg = id
B
aim: bB, a A such that f(a) = b
Let bB that there is an a A such that f(a) = b follows from the ontoness of f.
Suppose a' A such that f(a') = b = f(a') = f(a) = a' = a since f is one-to-one.
!roof:
(=) Assume f: AB is bijective. Define g: BA by bB, g(b) = a f(a) = b
Now, gf: AA. (gf)(a) = g(f(a)) = g(b) = a = id
A
(a) gf = id
A

n similar manner, fg: BB. (fg)(b) = f(g(b)) = f(a) = b = id
B
(b) fg = id
B
Show g: BA is bijective
i. Let b
1
, b
2
B. f g(b
1
) = g(b
2
) then f(g(b
1
) = f(g(b
2
)
(fg)(b
1
) = (fg)(b
2
)
= id
B
(b
1
) = id
B
(b
2
)
= b
1 =
b
2
Therefore g is one-to-one.
ii. Let a A. Consider f(a) B, so g(b) = g(f(a)) = (gf)(a) = id
A
(a)
Therefore g is onto.
Therefore g is bijective.
(;) Assume now that a bijective g: BA such that gf = id
A
and fg = id
B
Show f: AB is one-to-one and onto
i. Let a
1
, a
2

A. f f(a
1
) = f(a
2
) then g(f(a
1
)) = g(f(a
2
))
(gf)(a
1
) = (gf)(a
2
)
= id
A
(a
1
) = id
A
(a
2
)
= a
1 =
a
2
Therefore g is one-to-one.
ii. Let b B. Consider g(b) A, then take a = g(b)
= f(a) = f(g(b)) = (fg)(b) = id
B
(b) = b
Therefore g is onto.
g is bijective.
#emark:
1. f: AB is bijective bijective g: BA such that gf = id
A
and fg = id
B
ercise 3
1. How many g is there?
Ans. Only one. Suppose g': BA such that g'f = id
A
and fg' = id
B
= g' = id
A
g' = (gf) g' = g (fg') = g id
B
= g
Definition 1.6 Let f: AB be a bijective function. The unique bijective g: BA such that
gf = id
A
and fg = id
B
is called the inve7se of f denoted as f
-1.
Moreover, f
-1

f = id
A
and
f

f
-1
= id
B
.
f f is a one-to-one function that is the set of ordered pairs (x,y) then there is a function
f
-1
, called the inverse of f, that is the set of ordered pairs (y,x) defined by x = f
-1
(y) if and
only if y = f(x).
Furthermore, the domain of f
-1
is the range of f and the range of f
-1
is the domain of f.
Hb. 11
Let A = {1, 2, 3}. : AA
1 1 1 3
2 2 2 2
3 3 3 3

-1

-1
= id
A
=
-1
, id
A
: AA, id
A
-1
= id
A

ercise 4
1. Suppose f: AB, g: BC are bijections. What can be said about gf: AC?
s gf one-to-one? Let a
1,
a
2

A. f (gf)(a
1
) = (gf)(a
2
), g(f(a
1
)) = g(f(a
2
)) = f(a
1
) = f(a
2
)
since g is one-to-one a
1
= a
2.
Therefore gf is one-to-one
s gf onto? Let c C since g: BC is onto then b B such that g(b) = c.
Since b B and f: AB is onto, then a A such that f(a) = b a A such that
(gf)(a) = g(f(a)) = g(b) = c. Therefore gf is onto
Therefore gf: AC is a bijection.
Since gf: AC is a bijection, the (gf)
-1
: AC is also a bijection. Moreover
(gf)
-1
= f
-1
g
-1

(f
-1
g
-1
) (gf)

= id
A

(gf) (f
-1
g
-1
) = id
C