Categories and Morphisms

Executive summary

Arrows first, elements never

A category is objects, morphisms between them, associative composition and identities. Nothing in that definition mentions elements, so every notion must be recast in terms of arrows: a monomorphism is left-cancellable rather than injective, an epimorphism right-cancellable rather than surjective. For modules these agree with the familiar meanings; in other categories they come apart, and knowing where is part of using the language safely.

Learning objectives

State the axioms of a category and give the standard examples.
Define mono, epi and iso by cancellation.
Give a category where epi is not surjective.
Explain why arrow-theoretic definitions are necessary.

Section 01The definition and examples

A category C consists of a class of objects, a set C(A, B) of morphisms for each ordered pair, an associative composition, and an identity at each object. That is the whole definition.

Standard categories in this subject
Category	Objects	Morphisms
Set	Sets	Functions
Ab	Abelian groups	Group homomorphisms
Mod_Λ	Left Λ-modules	Λ-homomorphisms
Ch(C)	Chain complexes in C	Chain maps
Grp	Groups	Group homomorphisms
A group G	One object	The elements of G, composition = multiplication
A poset	Its elements	One arrow x → y when x ≤ y

A category need not be a category of structures

A single group is a category with one object, and a partially ordered set is a category with at most one arrow between objects. Keeping these in mind stops the intuition from collapsing into ‘sets with structure’, which is where the arrow-theoretic definitions start to matter.

Section 02Mono, epi and iso

Monomorphismμf = μg ⇒ f = g

Left-cancellable. In module categories this coincides with injective.

Epimorphismfε = gε ⇒ f = g

Right-cancellable. In module categories this coincides with surjective — but not in every category.

Epi does not mean surjective

In the category of rings, the inclusion ℤ ↪ ℚ is an epimorphism: any two ring maps out of ℚ agreeing on ℤ are equal, because a ring map is determined on fractions. It is plainly not surjective. In Hausdorff spaces, epimorphisms are the maps with dense image. Assuming epi means surjective is the standard trap.

An isomorphism is a morphism with a two-sided inverse. Mono and epi together do not imply iso in general — the ring inclusion above is both and is not an isomorphism. In abelian categories they do, which is one of the properties that makes abelian categories comfortable.

Section 03Working without elements

Technique

Universal properties

Characterise an object by the maps into or out of it. Determines the object up to unique isomorphism, and transplants to any category.

Technique

Diagram chasing by embedding

Freyd–Mitchell embeds any small abelian category in a module category, so element-based proofs of diagram lemmas are valid in general.

Technique

Generalised elements

Treat a morphism X → A as an ‘element of A of shape X’. Recovers element-style reasoning intrinsically.

Why bother

Because the theorems of homological algebra are wanted for modules, for sheaves of modules, for chain complexes and for functor categories. Proving them once in arrow language covers all of these; proving them with elements covers only the first.

ReferenceFrequently asked questions

Is a category the same as a class of structures?

No. Many categories — a group viewed as a one-object category, a poset, a category of paths — have objects that are not structured sets at all. The definition asks only for arrows and composition.

Why require Hom to be a set?

To avoid size paradoxes. Categories with this property are called locally small; nearly every category in this subject is. Without it, constructions like the functor category can fail to exist.

Do monomorphisms always have kernels?

Only in categories with enough structure. In an abelian category every morphism has a kernel and a cokernel, and a monomorphism is exactly a morphism with zero kernel — which restores the familiar picture.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Categories and Morphisms. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Categories and Morphisms as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—categories, elements, section, morphisms, objects—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Categories and Morphisms?