Adjoint Functors

Executive summary

Left adjoints preserve colimits; right adjoints preserve limits

Functors F and G are adjoint when there is a natural bijection between morphisms FA → B and A → GB. Almost every construction met so far is half of an adjunction — free and forgetful, tensor and Hom, restriction and coinduction. The payoff is immediate: left adjoints preserve colimits, hence are right exact, and right adjoints preserve limits, hence are left exact. The exactness properties that generate Ext and Tor are consequences of adjointness, not coincidences.

Learning objectives

State the adjunction bijection and its naturality.
Identify the unit and counit and the triangle identities.
Write the tensor-hom adjunction and read off exactness.
Explain why adjoints preserve limits or colimits.
Use adjointness to transport projectives and injectives.

Section 01The definition

Hom_D(FA, B) ≅ Hom_C(A, GB) naturally in A and B

F is the left adjoint, G the right adjoint. Equivalently, there are natural transformations η: 1 → GF (unit) and ε: FG → 1 (counit) satisfying the triangle identities.

Adjoint pairs that appear throughout this subject
Left adjoint	Right adjoint	Consequence
Free module on a set	Forgetful to sets	Free modules are projective
M ⊗_Λ −	Hom_ℤ(M, −)	Tensor is right exact; Hom is left exact
Restriction of scalars	Hom_Λ(Λ′, −) (coinduction)	Produces enough injectives
Extension of scalars Λ′ ⊗ −	Restriction of scalars	Change-of-rings spectral sequences
Abelianisation	Inclusion of abelian groups	H₁(G) is the abelianisation
Left Kan extension	Restriction along a functor	Homology of small categories

Section 02Exactness for free

AlgorithmWhy left adjoints are right exactin: an adjunction → out: right exactness of the left adjoint

Let F be left adjoint to G, and let A → B → C → 0 be exact.
For any object X, Hom(FC, X) ≅ Hom(C, GX) by adjointness.
Hom(−, GX) is left exact and contravariant, so it carries the exact sequence to an exact sequence 0 → Hom(C, GX) → Hom(B, GX) → Hom(A, GX).
Transporting back, 0 → Hom(FC, X) → Hom(FB, X) → Hom(FA, X) is exact for every X. Naturality is what allows the transport.
Since this holds for all X, FA → FB → FC → 0 is exact.

The organising principle

Left adjoints preserve all colimits — coproducts, cokernels, pushouts, directed colimits. Right adjoints preserve all limits. Right exactness and left exactness are the special cases visible in an abelian category.

Section 03Tensor-hom and its uses

Hom_Λ(M ⊗_Γ N, P) ≅ Hom_Γ(N, Hom_Λ(M, P))

Consequence

Tensor is right exact

It is a left adjoint, so it preserves cokernels. Its failure of left exactness is measured by Tor.

Consequence

Adjoints preserve projectives and injectives

If the right adjoint is exact, the left adjoint preserves projectives; if the left adjoint is exact, the right adjoint preserves injectives. This is how enough injectives is proved.

Consequence

Change of rings

Restriction and extension of scalars are adjoint, and comparing their derived functors produces the change-of-rings spectral sequences.

Adjoints are unique

If a left adjoint exists it is unique up to natural isomorphism, so ‘the’ left adjoint is well defined. This is the same uniqueness argument as for universal properties, and indeed an adjunction is a family of universal properties.

ReferenceFrequently asked questions

Does every functor have an adjoint?

No. The adjoint functor theorem gives conditions — preservation of limits plus a solution set condition — but they are genuine hypotheses. Many natural functors have an adjoint on one side only.

What do the triangle identities say?

That the unit followed by the counit, suitably whiskered, is the identity on each side. They are what make the bijection coherent, and checking them is the standard way to verify a proposed adjunction.

Why does adjointness matter for computing Ext?

Because it lets a computation be moved to a more convenient category. Change-of-rings results and the Grothendieck spectral sequence both rest on an adjunction, and both are used to reduce an intractable Ext to a computable one.

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 Adjoint Functors. 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 Adjoint Functors as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—adjoint, adjoints, preserve, section, functors—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.