2 Sets and functions

2.9 Invertibility

Definition 2.9.1.

Let f:XY.

  • A left inverse to f is a function g:YX such that gf=idX.

  • A right inverse to f is a function h:YX such that fh=idY.

  • An inverse (or a two sided inverse) to f is a function k:YX which is a left and a right inverse to f.

We say f is invertible if it has a two sided inverse.

Notice that if g is left inverse to f then f is right inverse to g. A function can have more than one left inverse, or more than one right inverse: you will investigate this further in the problem sets.

The idea is that a left inverse “undoes” its right inverse, in the sense that if you have a function f with a left inverse g, and you start with xX and apply f to get to f(x)Y, then doing g gets you back to where you started because g(f(x))=x.

Example 2.9.1.
  • f:[0,),f(x)=x2 has a right inverse g:[0,),g(x)=x. f(g(x))=x for all x[0,). It is not the case that g is a left inverse to f because g(f(1))1.

  • This function f does not have a left inverse. Suppose h is left inverse to f, so that hf=id. Then h(f(1))=1, so h(1)=1. Similarly h(f(1))=1, so h(1)=1. Impossible! (The problem, as we will see in the next section, is that f isn’t one-to-one.)

  • The function g has a left inverse, f. But it does not have a right inverse. If gh=id then g(h(1))=1 so g(h(1))=1. But there’s no element of [0,) that g takes to 1. (This time the problem is that g isn’t onto.)