Cofree Modules and Essential Extensions

Executive summary

Cofree supplies injectives; essential extensions make them minimal

Free modules are built by taking direct sums of the ring; cofree modules are built by applying Hom_ℤ(Λ, −) to a divisible abelian group. That functor is right adjoint to restriction of scalars, and because restriction is exact, the adjoint carries injectives to injectives — which is how the category of Λ-modules is shown to have enough injectives. Essential extensions then identify, among all injectives containing a module, the smallest one.

Learning objectives

Construct cofree modules and state the defining adjunction.
Explain why the construction yields enough injectives.
Define essential extensions and give examples.
State the existence and uniqueness of the injective hull.

Section 01Cofree modules

For an abelian group D, the cofree Λ-module on D is Hom_ℤ(Λ, D), with Λ acting by shifting the argument. Its defining property mirrors freeness with the arrows reversed:

Hom_Λ(M, Hom_ℤ(Λ, D)) ≅ Hom_ℤ(M, D)

FreeΛ ⊗_ℤ S

Left adjoint to the forgetful functor. Maps OUT of a free module are arbitrary functions on a basis.

CofreeHom_ℤ(Λ, D)

Right adjoint to the forgetful functor. Maps INTO a cofree module are arbitrary group homomorphisms into D.

Why this produces injectives

The forgetful functor is exact, so its right adjoint preserves injective objects. Take D divisible, hence injective over ℤ; then Hom_ℤ(Λ, D) is an injective Λ-module. Embedding M in a divisible group and applying the adjunction embeds M in it.

Section 02Essential extensions

An extension M ⊆ E is essential when every non-zero submodule of E meets M non-trivially — equivalently, no non-zero submodule of E intersects M in zero.

Example

ℤ ⊆ ℚ

Essential: every non-zero subgroup of ℚ contains a non-zero integer multiple, hence meets ℤ.

Example

ℤ/pℤ ⊆ ℤ(p^∞)

Essential: every non-zero subgroup of the Prüfer group contains the unique subgroup of order p.

Non-example

M ⊆ M ⊕ N

Not essential when N ≠ 0, since the summand N meets M in zero. Direct summands are the opposite of essential.

Essential and injective are complementary

A module is injective exactly when it has no proper essential extensions — it cannot be enlarged without adding something detached. This reformulation is what makes the hull construction work.

Section 03The injective hull

AlgorithmExistence and uniqueness of the injective hullin: a module M → out: its injective hull E(M)

Embed M in some injective I, which is possible by the cofree construction.
Consider the essential extensions of M inside I; by Zorn's lemma there is a maximal one, E.
E is injective: a maximal essential extension inside an injective has no proper essential extension.
E is minimal among injectives containing M, and any two such are isomorphic over M. Uniqueness is up to non-canonical isomorphism fixing M.
Write E = E(M), the injective hull.

Uniqueness is not canonicity

The hull is unique up to isomorphism fixing M, but the isomorphism is not unique. Constructions depending on a chosen hull must be checked for independence of that choice — the same discipline that resolutions require.

ReferenceFrequently asked questions

Is there a projective analogue of the injective hull?

The projective cover, but it does not always exist. Rings over which every module has one are called perfect, and they are comparatively rare — ℤ is not among them. This is a genuine asymmetry, not a gap in the theory.

Why does the adjunction preserve injectivity?

Because Hom(−, right adjoint applied to D) is naturally isomorphic to Hom(forgetful of −, D), and the forgetful functor is exact. A composite of an exact functor with an exact Hom is exact, which is precisely injectivity of the target.

Are minimal injective resolutions unique?

Yes, up to isomorphism, if each stage is taken to be the injective hull of the preceding cokernel. The resulting Bass numbers are genuine invariants of the module, which is why minimal resolutions are preferred in commutative algebra.

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 Cofree Modules and Essential Extensions. 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 Cofree Modules and Essential Extensions as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—cofree, essential, modules, extensions, injective—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 Cofree Modules and Essential Extensions?