Modules and Module Homomorphisms

Executive summary

Linear algebra without the guarantee of a basis

A module over a ring is what a vector space becomes when the scalars are no longer a field: addition and scalar multiplication behave as expected, but bases need not exist, submodules need not be direct summands, and a surjection need not split. Every difficulty in homological algebra traces back to one of those three failures. Exact sequences are the notation for keeping track of them, and the snake lemma is the first genuinely powerful consequence.

Learning objectives

Define modules, submodules and quotient modules over a general ring.
State exactness and read a short exact sequence correctly.
Apply the five lemma and the short five lemma.
Derive the connecting homomorphism of the snake lemma.
Explain which vector-space facts fail for modules and why.

Section 01Modules and their morphisms

A left module over a ring Λ with unit is an abelian group M with an action Λ × M → M that is associative, distributive on both sides and unital. A homomorphism respects both operations, and Hom(M, N) is itself an abelian group — a Λ-module when Λ is commutative.

What survives from vector spaces and what does not
Property over a field	Over a general ring
Every module is free	Fails — free modules are special
Every submodule is a direct summand	Fails — this is exactly semisimplicity
Every surjection splits	Fails — splitting defines projectivity
Every injection splits	Fails — splitting defines injectivity
Rank is well defined	Usually, but not over every ring
Sub and quotient constructions work	Survives unchanged

The three failures are the subject

Projective modules are those for which surjections onto them split; injective modules are those for which injections out of them split; Ext measures the failure of a specific extension to split. The entire apparatus is a bookkeeping system for these three phenomena.

Section 02Exactness

A sequence A →^f B →^g C is exact at B when im f = ker g. A short exact sequence

0 → A →^μ B →^ε C → 0

says exactly that μ is injective, ε is surjective, and im μ = ker ε — so C is B/A. It is the basic unit of information in the subject: a statement that B is built from A and C, without saying how.

Exact is not the same as split

A short exact sequence records that B is an extension of C by A. It does not say B ≅ A ⊕ C. Deciding when it does is the extension problem, and Ext¹ is its answer. Reading exactness as though it implied a direct sum is the most common beginner's error in this material.

Section 03Diagram lemmas

Two lemmas do most of the routine work. Both are proved by diagram chasing, and both hold in any abelian category.

AlgorithmThe snake lemmain: a commutative diagram with exact rows → out: the connecting map ∂

Given a commutative diagram with exact rows, two rows connected by vertical maps α, β, γ.
Take c ∈ ker γ and lift it to b ∈ B along the surjection. Possible because the top row is exact.
Then β(b) maps to 0 in C′, so β(b) comes from a′ ∈ A′.
The class of a′ in coker α is independent of the lift chosen. This is the content of the lemma.
Define ∂(c) = [a′]. The resulting sequence ker α → ker β → ker γ → coker α → coker β → coker γ is exact.

Lemma

Five lemma

In a commutative diagram with exact rows and five columns, if the outer two pairs are isomorphisms then the middle one is too.

Lemma

Short five lemma

For a map of short exact sequences, if the two outer maps are isomorphisms so is the middle one. Used constantly to recognise equivalent extensions.

Lemma

Nine lemma

A 3×3 diagram with exact columns and two exact rows has its third row exact. Follows from the snake lemma.

ReferenceFrequently asked questions

Why insist on left modules rather than right?

Convention only. A right Λ-module is a left module over the opposite ring, so nothing is lost. The distinction matters when both act at once — bimodules — and when forming tensor products, where a right module meets a left module.

Does the snake lemma need the rows to be short exact?

The rows need to be exact where the chase happens: surjective on the right of the top row and injective on the left of the bottom row. The commonly stated version with short exact rows is the convenient special case.

Is diagram chasing valid in a general abelian category?

Yes, though elements do not literally exist there. The Freyd–Mitchell embedding theorem lets any small abelian category be embedded in a module category, so element-based proofs transfer. Members or generalised elements give an intrinsic alternative.

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 Modules and Module Homomorphisms. 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 Modules and Module Homomorphisms as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—lemma, modules, module, exact, short—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 Modules and Module Homomorphisms?