Kan Extensions

Executive summary

The universal way to extend a functor

Given K: A → B and T: A → C, a Kan extension is the best approximation to a functor B → C restricting to T. Left and right versions are the left and right adjoints of restriction along K, and both are computed by colimits and limits over comma categories. Adjoints, limits and induced representations are all instances, and in this stream the left Kan extension is what defines the homology of a small category.

Learning objectives

State the universal property of the left and right Kan extensions.
Write the colimit and limit formulas.
Identify the adjunction with restriction.
Recognise familiar constructions as Kan extensions.

Section 01The universal property

Restriction along K gives K^*: Fun(B, C) → Fun(A, C). Its left and right adjoints, when they exist, are the left and right Kan extensions:

Lan_K ⊣ K^* ⊣ Ran_K

So a natural transformation out of Lan_KT is exactly a natural transformation out of T after restriction, and dually.

(Lan_K T)(b) = colim_{(a, Ka → b)} T(a)

Everything is a Kan extension

Mac Lane's slogan. Limits and colimits are Kan extensions along the functor to the one-object category; adjoints are Kan extensions along an identity; induced representations are Kan extensions along a subgroup inclusion. Recognising the pattern collapses several constructions into one.

Section 02Standard instances

Constructions that are Kan extensions
Construction	Kan extension along
Colimit of a diagram	The functor from the index category to the terminal category
Limit of a diagram	The same, right version
Induced module Λ ⊗_Γ −	The inclusion of a subring, left version
Coinduced module Hom_Γ(Λ, −)	The same, right version
Left adjoint of a functor	That functor, applied to the identity
Homology of a small category	The functor to the terminal category, left derived
Sheafification	A Kan extension followed by a localisation

Why the comma category appears

The colimit formula is taken over the objects of A equipped with a map from their image to b — the comma category K ↓ b. That indexing is what makes the construction universal rather than ad hoc, and it is why existence requires the target to have enough colimits.

Section 03Existence and exactness

Stage 01Pointwise existenceIf C has all small colimits and A is small, Lan_KT exists and is computed pointwise by the formula.
Stage 02Left adjoint behaviourBeing a left adjoint, Lan_K preserves colimits and is right exact in an abelian setting.
Stage 03Derived versionWhen the target is abelian, Lan_K can be derived; its left derived functors are the homology of the relevant comma categories.
Stage 04Grothendieck sequenceComposing Kan extensions gives a Grothendieck spectral sequence relating the derived functors of the pieces.

Kan extensions need not restrict back to the original functor

K^*Lan_KT is not generally isomorphic to T — only when K is fully faithful. The word ‘extension’ is therefore slightly optimistic in the general case, and assuming the restriction returns T is a real error.

ReferenceFrequently asked questions

Do Kan extensions always exist?

Not always. Pointwise existence needs the target to have the relevant colimits or limits and the source to be small. Without those hypotheses a Kan extension may fail to exist, or exist without being computed by the formula.

What is the connection with induced representations?

For a subgroup inclusion viewed as a functor of one-object categories, the left Kan extension is induction and the right is coinduction. Shapiro's lemma is then the statement that these adjoints are exact enough to commute with taking derived functors.

Why are Kan extensions relevant to homological algebra?

Because deriving them produces homology theories. The homology of a small category, the homology of a group and the homology of a simplicial object are all left derived Kan extensions along a suitable functor.

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 Kan 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 Kan Extensions as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—extensions, extension, section, left, right—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.