Precious F.

Eusebio
Logic & Set Theory
Bachelor of Secondary Education major in Mathematics / 2nd Year / Block 1
Ma’ am Sharon Galicha
Assessment Tasks 4

3
2 x +2 x
4.1 Let f, g : R → R be the functions f(x) = 2x and g(x) = 2 . Show that f = g.
x +1
f (x)=2 x
3
2 x +2 x
g(x )= 2
x +1
¿ f (g(x ))
3
2 x +2 x
¿f( 2
)
x +1
3
2(2 x ) +2(2 x)
¿
(2 x )2+1
¿4 x
4.2
a. Define g : ℤ → ℤ by g(n) = 3n − 2.
(i) Is g one-to-one? Prove or give a counterexample.
 G is one - to - one. Why? Because g(n 1) = g(n2) which means 3n1 - 2 = 3n2 - 2. If g(n1)
= g(n2) then n1 = n2 so g is one - to - one.
(ii) Is g onto? Prove or give a counterexample.
 Take m = 3. If g is onto then there should be an ∈ ℤ such that g(n) = 3. That is, 3n -
5
2 = 3. Solving for n we find which is not an integer. Hence, g is not onto.
3
b. Define G : R → R by G(x) = 3x − 2. Is G onto? Prove or give a counterexample.
 Let ∈ ℤ. Is there an x ∈ ℤ such that f(x) = y? That is 3x - 2 = y. But solving for x we
find x
4.3 Let f : X → Y and g : Y → Z be two bijective functions. Show that (g◦f) −1 exists and (g ◦
f) −1 = f −1 ◦ g −1 .
 f:X→Y
g:Y→Z
(g◦f)−1 = lx and (f◦g)−1 ly where lx denotes the identity function on x.
 Proof:
Given, f and g are bijective functions.
To prove that g o f is bijective, with (g o f)-1 = f -1o g-1.
It is sufficient to prove that:
i. (f -1 o g-1) o (g o f) = IX, and
ii. (g o f)o( f -1o g-1) = IZ.
Now, ( f -1 o g-1) o (g o f) = {( f -1 o g-1) o g} o f {'.' l o (m o n) = (l o m) o n}
= { f -1 o (g-1 o g)} o f
= ( f -1oIY)of {'.' g-1og = IY}
= f-1of { '.' f-1oI = f-1}
= IX
Hence, (f -1o g-1)o(g o f) =IX …… ( i)
Similarly, (g o f)o( f -1o g-1)
={(g o f) o f--1} o g-1
={g 0 (f o f--1} o g-1
=(g 0 Ix) o g-1
=g o g-1 = Iz
(g o f)o( f -1o g-1) =IZ ……. (ii)
From equations (i) and (ii),
(g o f)-1 = f -1 o g-1
Hence, the composition of two invertible functions is also invertible.