Isomorphism

A morphism that has a two-sided inverse in a category.
Isomorphism

Definition

Let C\mathcal C be a . A morphism f:XYf : X \to Y is an isomorphism if there exists a morphism g:YXg : Y \to X such that

gf=1Xandfg=1Y, g\circ f = 1_X \quad\text{and}\quad f\circ g = 1_Y,

where 1X1_X and 1Y1_Y are the and \circ is .

The morphism gg is unique if it exists, and is denoted f1f^{-1}. In this case, XX and YY are said to be isomorphic (in C\mathcal C).

Related notions:

Examples

  1. In Set\mathbf{Set}, the isomorphisms are exactly the .
  2. In Grp\mathbf{Grp}, the isomorphisms are exactly group isomorphisms (bijective homomorphisms).
  3. In R-ModR\text{-}\mathbf{Mod}, the isomorphisms are exactly RR-linear maps with RR-linear inverses (invertible module homomorphisms).