Section 2: Problem 5 Solution
Working problems is a crucial part of learning mathematics. No one can learn topology merely by poring over the definitions, theorems, and examples that are worked out in the text. One must work part of it out for oneself. To provide that opportunity is the purpose of the exercises.
James R. Munkres
In general, let us denote the identity function for a set
by
. That is, define
to be the function given by the rule
for all
. Given
, we say that a function
is a left inverse for
if
; and we say that
is a right inverse for
if
.
(a) Show that if
has a left inverse,
is injective; and if
has a right inverse,
is surjective.
(b) Give an example of a function that has a left inverse but no right inverse.
(c) Give an example of a function that has a right inverse but no left inverse.
(d) Can a function have more than one left inverse? More than one right inverse?
(e) Show that if
has both a left inverse
and a right inverse
, then
is bijective and
.
(a) Apply 4 (c) and (e) using the fact that the identity function is bijective.
(b)
has at least two left inverses
and, for example,
but no right inverses (it is not surjective).
(c)
has two right inverses
and
but no left inverse (it is not injective).
(d) See (b) and (c).
(e) It follows from (a) that
is bijective, i.e. for each
there is unique
such that
. Now,
, and
, and, since
is injective,
as well.