An inverse of a morphism f:XYf : X \to Y in a category (or an element of a monoid) is another morphism f 1:YXf^{-1} : Y \to X which is both a left-inverse (a retraction) as well as a right-inverse (a section) of ff, in that

ff 1:YXY f \circ f^{-1} : Y \to X \to Y

equals the identity morphism on YY and

f 1f:XYX f^{-1} \circ f : X \to Y \to X

equals the identity morphism on XX.


  • A morphism which has an inverse is called an isomorphism.

  • The inverse f 1f^{-1} is unique if it exists.

  • The inverse of an inverse morphism is the original morphism, (f 1) 1=f(f^{-1})^{-1} = f.

  • A category in which all morphisms have inverses is called a groupoid.

  • An amusing exercise is to show that if f,g,hf,g,h are morphisms such that fg,ghf\circ g,\; g\circ h are defined and are isomorphisms, then f,g,hf,g,h are all isomorphisms.

In non-associative contexts

These can be a little more complicated; see quasigroup for some discussion of the one-object version.

Revised on April 26, 2017 14:17:04 by Urs Schreiber (