Preliminaries
Lemma (L3.3)
Injective homomorphisms are monomorphisms in
Proof
Indeed, they are injective as set functions and hence have left inverses (as set functions).
Lemma (L3.4)
Surjective homomorphisms are epimorphisms in
Proof
Similarly, they are surjective as set functions and hence equality can be established in where right inverses exist for all surjections (assuming axiom of choice).
Kernels
Proposition (K1)
Kernels exist in
Proof
This proof is more abstract than necessary.
Let be a homomorphism and let be another homomorphism such that In other words
Consider the set
Note that implies and similarly So is a submodule of hence let be an inclusion of into
Let’s find Using the canonical decomposition we can factor as a surjection followed by the inclusion But since itself is a submodule of (it is a module and, by hypothesis, it is a subset of ) we have yet another inclusion Let
Now, the upper triangle of this diagram commutes by canonical decomposition The right triangle commutes since The left triangle commutes since we’ve defined Thus, the whole diagram commutes. Hence, exists and fits the requirement that
By L3.3 we know that is a monomorphism and hence for any other morphism satisfying we know that So is unique.
Thus, satisfies the universal property of in
Proposition (K2)
Let be an -module homomorphism. Then is trivial if and only if is injective as a set function.
Proof
Suppose is trivial and let such that Now, observe that
and so by construction of kernel in K1. But is trivial and hence or forcing to be injective.
Conversely, suppose is injective as a set function. Let be such that (that is, ). Since is a homomorphism, we know that . Since is injective, implies So is trivial.
Proposition (K3)
Monomorphisms in are injective as set functions, and every injective morphism is a monomorphism.
Proof
From L3.3 we know that injective morphisms are monomorphisms.
Suppose is a monomorphism. Now, take the inclusion and note that But also, note that
Since is a monomorphism, and since inclusions are injective, is trivial. By K2 we know that this forces to be injective.
Proposition (K4)
Every monomorphism in identifies its domain with the kernel of some morphism.
Proof
Let be a monomorphism. Since is a submodule of , we can form the quotient with the projection Note that
By canonical decomposition we know that the restriction is surjective. By K3 we know that it must be injective. Being a surjective and injective homomorphism it is a bijection. Hence, it is an isomorphism. So as required.
Cokernels
Proposition (C1)
Cokernels exist in
Proof
Suppose is a homomorphism and let be an arbitrary morphism such that Since is a submodule of we can form a quotient with a surjection
Recall that by the universal property of quotients, the morphism factors uniquely as as long as
Since composing gives the zero morphism, must send to so but this is equivalent to
What if there is some other morphism be such that Well, since is an epimorphism (L3.4) it must be that
Thus, satisfies the universal property of in
Proposition (C2)
Let be an -module homomorphism. Then is trivial if and only if is surjective as a set function.
Proof
Suppose is trivial. The quotient map has as its kernel, but since the codomain is trivial, its kernel must be the whole So , so is surjective.
Conversely, suppose is surjective as a set function. So its image is the whole , and is trivial.
Proposition (C3)
Epimorphisms in are surjective as set functions, and every surjective morphism is an epimorphism.
Proof
From L3.4 we know that surjective morphisms are epimorphisms.
Suppose is an epimorphism. Now, take the projection and note that But also, note that
Since is an epimorphism, and since quotient projections are surjective, is trivial. By C2 we know that this forces to be surjective.
Proposition (C4)
Every epimorphism in identifies its codomain with the cokernel of some morphism.
Proof
Let be an epimorphism.
Consider with the inclusion We have the short exact sequence
and so