Modules generalise vector spaces by allowing coefficients from a ring; category language then organises objects, morphisms and universal constructions. The central discipline is to distinguish element calculations from map-level or universal properties. This page consolidates the relevant material from the supplied algebra source into a stand-alone handbook chapter.
Learning pathModules and Categories
LevelAdvanced
FormatHandbook guide
Read time12 min
Executive summary
This chapter develops functors, natural transformations and adjunctions as part of a connected advanced-algebra learning sequence. The emphasis is on definitions, hypotheses, structural results and repeatable methods rather than historical narrative.
The source material is theorem-rich. Accordingly, the handbook presentation separates vocabulary from results and then adds a verification workflow so that each statement can be applied safely. Mathematical examples in the source are treated as examples, not as universal rules.
Problem-solving workflow
Identify the coefficient ring and whether modules are left, right or bimodules.
State the maps and verify linearity before using kernels, images or exactness.
Use exact sequences to record how subobjects and quotients fit together.
When a construction is defined universally, verify both existence and uniqueness of the mediating map.
For projective or injective arguments, convert lifting or extension properties into split exact sequences where possible.
For limits or colimits, track the direction of every structure map.
Core definitions
Definition
Recall that obj(C) denotes the class of all the objects in a category C. If C and D are categories, then a functor T : C →D is a function such that (i) if A ∈obj(C), then T (A) ∈obj(D); (ii) if f : A →A′ in C, then T ( f ): T (A) →T (A′) in D; (iii) if A f→A′ g→A′′ in C, then T (A) T ( f ) →T (A′) T (g) →T (A′′) in D and T (g f ) = T (g)T ( f ); (iv) for every A ∈obj(C), T (1A) = 1T (A).
Definition
If C and D are categories, then a contravariant functor T : C →D is a function such that (i) if C ∈obj(C), then T (C) ∈obj(D); (ii) if f : C →C′ in C, then T ( f ): T (C′) →T (C) in D; (iii) if C f→C′ g→C′′ in C, then T (C′′) T (g) →T (C′) T ( f ) →T (C) in D and T (g f ) = T ( f )T (g); (iv) for every A ∈obj(C), T (1A) = 1T (A). To distinguish them from contravariant functors, the functors defined earlier are called covariant functors.
Definition
If C and D are pre-additive categories, then a functor T : C →D, of either variance, is called an additive functor if, for every pair of morphisms f, g : A →B, we have T ( f + g) = T ( f ) + T (g). Every covariant functor T : C →D gives rise to functions TAB : Hom(A, B) →Hom(T A, T B), for every A and B, defined by h ↦T (h). If T is an additive functor between pre-additive categories, then each TAB is a homomorphism of abelian groups; the analogous statement for contravariant functors is also true. Here is a modest generalization of Corollary 7.34.
Definition
A covariant functor T : RMod →Ab is called left exact if exactness of 0 →A i→B p→C implies exactness of 0 →T (A) T (i) −→T (B) T (p) −→T (C). Thus, Theorem 7.44 shows that covariant Hom functors HomR(X, ) are left exact functors. Investigation of the cokernel of HomR(X, ) is done in homological algebra; it is involved with a functor called Ext1 R(X, ). There is an analogous result for contravariant Hom functors.
Definition
A contravariant functor T : RMod →Ab is called left exact if exactness of A i→B p→C →0 implies exactness of 0 →T (C) T (p) −→T (B) T (i) −→T (A). Thus, Theorem 7.46 shows that contravariant Hom functors HomR( , Y) are left exact functors.12 There is a converse of Theorem 7.46; a dual statement holds for covariant Hom functors.
Definition
A covariant functor T : RMod →Ab is an exact functor if exactness of 0 →A i→B p→C →0 implies exactness of 0 →T (A) T (i) −→T (B) T (p) −→T (C) →0. An exact contravariant functor is defined similarly.
Definition
An R-module F is called a free R-module if F is isomorphic to a direct sum of copies of R: that is, there is a (possibly infinite) index set I with F = i∈I Ri, where Ri = ⟨bi⟩∼= R for all i. We call B = {bi : i ∈I} a basis of F. A free Z-module is a free abelian group, and every commutative ring R, when considered as a module over itself, is itself a free R-module. From our discussion of direct sums, we know that each m ∈F has a unique expression of the form m = i∈I ribi, where ri ∈R and almost all ri = 0. A basis of a free module has a strong resemblence to a basis of a vector space. There is a straightforward generalization of Theorem 3.92 from finite-dimensional vector spaces to arbitrary free modules (in particular, to infinite-dimensional vector spaces).
Principal results and structural facts
Key result
If T : C →D is a functor, and if f : A →B is an equivalence in C, then T ( f ) is an equivalence in D.
Key result
If T : RMod →Ab is an additive functor of either variance, then T preserves finite direct sums: T (A1 ⊕· · · ⊕An) ∼= T (A1) ⊕· · · ⊕T (An).
Key result
If 0 →A i→B p→C is an exact sequence of R-modules, and if X is an R-module, then there is an exact sequence 0 →HomR(X, A) i∗→HomR(X, B) p∗ →HomR(X, C).
Key result
If A i→B p→C →0 is an exact sequence of R-modules, and if Y is an R-module, then there is an exact sequence 0 →HomR(C, Y) p∗ →HomR(B, Y) i∗ →HomR(A, Y).
Key result
Let i : B′ →B and p: B →B′′ be R-maps, where R is a commutative ring. If, for every R-module M, 0 →HomR(B′′, M) p∗ −→HomR(B, M) i∗ −→HomR(B′, M) is an exact sequence, then so is B′ i −→B p −→B′′ →0. 12These functors are called left exact because the functored sequence has 0 →on the left.
Key result
Let F be a free R-module, and let B = {bi : i ∈I} be a basis of F. If M is any R-module and if γ : B →M is any function, then there exists a unique R-map g : F →M with g(bi) = γ (bi) for all i ∈I. F g B γ M
Source-grounded examples
Worked source example
(i) If C is a category and B ∈obj(C), then the contravariant Hom functor T B : C →Sets is defined, for all C ∈obj(C), by T B(C) = Hom(C, B) and if f : C →C′ in C, then T B( f ): Hom(C′, B) →Hom(C, B) is given by T B( f ): h ↦h f. We call T B( f ) the induced map, and we denote it by T B( f ) = f ∗: h ↦h f. Because of the importance of this example, we verify the axioms, showing that T B is a (contravariant) functor. Note that the composite h f makes sense: C h f f C′ h B. Given homomorphisms C f→C′ g→C′′, let us compare the functions (g f )∗, f ∗g∗: Hom(C′′, B) →Hom(C, B). If h ∈Hom(C′′, B) (i.e., if h : C′′ →B), then (g f )∗: h ↦h(g f ); on the other hand, f ∗g∗: h ↦hg ↦(hg) f, as desired. Finally, if f is the identity map 1C : C →C, then (1C)∗: h ↦h1C = h Functors for all h ∈Hom(C, B), so that (1C)∗= 1Hom(C,B). If Hom( , B) is denoted by T B, then Theorem 7.33 says that the contravariant functor T B converts sums to products: T B( i Ai ) ∼= i T B(Ai). (ii) If R is a commutative ring and C is an R-module, then the contravariant Hom functor RMod →Sets has more structure. We show that if f : C →C′ is an R-map, then the induced map f ∗: HomR(C′, B) →HomR(C, B), given by h ↦h f , is an R-map between R-modules. First, f ∗is additive: If g, h ∈Hom(C′, B), then for all c′ ∈C′, f ∗(g + h) = (g + h) f : c′ ↦(g + h) f (c′) = g f c′ + h f c′ = ( f ∗(g) + f ∗(h))(c′), so that f ∗(g + h) = f ∗(g) + f ∗(h). Second, f ∗preserves scalars. Recall that if r ∈R and h ∈Hom(A, B), then rh : a ↦h(ra). Thus, f ∗(rh): c′ ↦(rh) f (c′) = h(r f (c′)), while r f ∗(h) = r(hf ): c′ ↦h f (rc′). These are the same, because r f (c′) = f (rc′), and so f ∗(rh) = r f ∗(h). In particular, if R is a field, then the HomR’s are vector spaces and the induced maps are linear transformations. A special case of this is the dual space functor Homk( , k), where k is a field. ◀ It is easy to see, as in Proposition 7.41, that every contravariant functor preserves equivalences; that is, if T : C →D is a contravariant functor, and if f : C →C′ is an equivalence in C, then T ( f ) is an equivalence in D.
Worked source example
Even if the map i : A →B in the original exact sequence is assumed to be injective, the functored sequence need not end with “→0;” that is, i∗: HomR(B, Y) →HomR(A, Y) may fail be surjective. We claim that HomZ(Q, Z) = 0. Suppose that f : Q →Z and f (a/b) ̸= 0 for some a/b ∈Q. If f (a/b) = m, then, for all n > 0, nf (a/nb) = f (na/nb) = f (a/b) = m. Thus, m is divisible by every positive integer n, and this contradicts the fundamental theorem of arithmetic. If we apply the functor HomZ( , Z) to the short exact sequence 0 →Z i→Q p→Q/Z →0, where i is the inclusion and p is the natural map, then the induced map i∗: HomZ(Q, Z) →HomZ(Z, Z) cannot be surjective, for HomZ(Q, Z) = {0} while HomZ(Z, Z) ̸= {0}, because it contains 1Z. ◀
How to reason with these results
Most advanced-algebra problems become manageable when the representation is separated from the invariant structure. Begin with the definition, then decide whether the problem is asking for an elementwise calculation, a statement about a morphism, or a classification up to isomorphism. That choice determines the correct proof language.
When a theorem gives a structural conclusion, do not jump directly to the conclusion. Write the hypotheses next to the object you are studying and check them one by one. If a hypothesis fails, either strengthen the object, pass to a quotient or localisation where the theorem applies, or use a more elementary argument.
For computational work, record each transformation together with the equivalence relation it preserves. In algebra, row operations, similarity, quotienting, localisation and isomorphism preserve different kinds of information. A calculation is useful only when the preserved structure matches the question.
Common failure modes
Failure mode
Control
Treating a module as a vector space when the coefficient ring is not a field.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Reversing arrows in contravariant constructions.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Calling a sequence exact without checking equality of image and kernel at each object.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Using a universal construction without proving uniqueness.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Confusing direct products with direct sums in infinite families.
Return to the definition or theorem hypotheses and verify the missing condition before continuing.
Verification checklist
The ambient set, ring, field, group, module or category has been stated.
Every operation and map used is well-defined in that setting.
The hypotheses of each structural result have been checked before use.
Representatives, coordinates or generators have not been confused with the underlying object.
Existence and uniqueness have been separated where both matter.
The final result has been checked against the original defining relation or universal property.
Quick questions
What should I identify first in a problem about functors, natural transformations and adjunctions?
Start with the ambient algebraic structure, its operation or maps, and the exact hypotheses. Most incorrect solutions begin by using a familiar rule that is not valid in the stated structure.
How should definitions be used in proofs?
Expand the definition at the point where it becomes useful. Definitions are not background prose; they are the conditions that determine what must be proved and which implications are available.
When is a structural theorem safer than direct calculation?
Use a structural theorem when its hypotheses are satisfied and the calculation would otherwise depend on arbitrary coordinates, representatives or generators. The theorem usually identifies an invariant that survives those choices.
How can a final answer be checked?
Substitute the result back into the defining relation, verify any required closure or map property, and check edge cases such as zero, the identity, the empty object or degenerate quotients where relevant.
Connections within the handbook
Source basis: supplied advanced algebra reference. Source-identifying authorship, publisher information, acknowledgements and biographical material are intentionally omitted. Mathematical terminology and results are retained in handbook form.
