Monomorphism

A morphism that is left-cancellative under composition.
Monomorphism

Definition

Let C\mathcal C be a . A morphism f:XYf : X \to Y is a monomorphism (or mono) if for every object ZZ and all morphisms g1,g2:ZXg_1,g_2 : Z \to X,

fg1=fg2g1=g2, f\circ g_1 = f\circ g_2 \quad \Longrightarrow \quad g_1 = g_2,

where \circ denotes .

Equivalently: ff is mono iff it is left-cancellative with respect to composition.

Notes:

Examples

  1. In Set\mathbf{Set}, monomorphisms are exactly .
  2. In Grp\mathbf{Grp}, monomorphisms are exactly injective group homomorphisms.
  3. In R-ModR\text{-}\mathbf{Mod} (and in Ab\mathbf{Ab}), monomorphisms are exactly injective module homomorphisms.