Monomorphism
Collection
context | C … category |
definiendum | f∈it |
inclusion | f:C[A,B] |
postulate | ⟨A,∏A1A⟩ … pullback of f along itself |
Equivalent definitions
The arrow f:C[A,B] is mono of for all g,h:C[C,A] holds
f∘g=f∘h⟹g=h.
In Set, this can be rewritten as the definition of injections:
f(x)=g(y)⟹x=y.
Theorems
The pullback of a mono is mono.
Discussion
The categorical definition above can easily be understood by considering Set, where the pullback A×BA is the set of pairs ⟨a,d⟩∈A×A for which f(a)=f(d).
Say f is not an injection and hence collapses two different terms a,d∈A into a single value, i.e. f(a)=f(d). The pullback object then contains ⟨a,a⟩ and ⟨d,d⟩, but also ⟨a,d⟩ and ⟨d,a⟩. So A×BA is bigger than A. On the other hand, if f is an injection, then for any a, the pullback only contains ⟨a,a⟩. We get A×BA≅A.
The definition “⟨A,∏A1A⟩ is a pullback of f along itself” implies that A is already a valid pullback object, because f doesn't collapse any information. Dually, the definition of an epimorphism (surjections in Set) implies that A is a valid pushout A+BA, an object which generally contains less information than A.
A stepwise characterization of a monomorphism from the pullback, with a focus on the universal property, is given in pullback.