Yoneda Ext and n-Fold Extensions

Executive summary

Extn without resolutions

An element of Extⁿ(C, A) can be presented as an exact sequence with n intermediate terms running from A to C, modulo the equivalence generated by maps between such sequences. Splicing two of these gives the Yoneda product, making Ext^*(C, C) a graded ring. The description needs no projectives or injectives, so it defines Ext in categories where resolutions are unavailable.

Learning objectives

Describe an n-fold extension and the equivalence relation.
Splice extensions to form the Yoneda product.
Explain why the equivalence must be generated rather than direct.
Identify the Ext ring and its role.

Section 01n-fold extensions

0 → A → B_n → … → B₁ → C → 0

Two such sequences are congruent when there is a morphism between them fixing A and C. The relevant equivalence is the one generated by congruence, since congruence itself is not symmetric — a morphism in one direction need not have an inverse.

The relation must be generated

For n = 1 the short five lemma makes any congruence an isomorphism, so the relation is already an equivalence. For n ≥ 2 it is not, and taking the generated equivalence relation — chains of morphisms in either direction — is essential. This is a genuine subtlety, not a formality.

Section 02Splicing and the Yoneda product

AlgorithmSplicing two extensionsin: two extensions sharing a middle module → out: their splice

Take an m-fold extension of C by B and an n-fold extension of B by A.
Compose the surjection onto B with the injection out of B to join the sequences at B.
The result is an (m + n)-fold extension of C by A. Exactness at the junction holds because the image of one map is B, which is the kernel of the next.
On equivalence classes this induces the Yoneda product Ext^m(C, B) ⊗ Extⁿ(B, A) → Ext^m+n(C, A).
It is associative and agrees with composition of derived-functor classes.

Use

The Ext algebra

Ext^*_Λ(k, k) for an augmented algebra is a graded ring whose structure encodes deep information — the Steenrod algebra arises this way.

Use

Group cohomology ring

H^*(G, k) = Ext^*_k[G](k, k) is a graded-commutative ring, and its spectrum is the support variety of modular representation theory.

Use

Obstruction theory

A class in Ext² is precisely the obstruction to extending a partial construction, and the Yoneda product composes successive obstructions.

Section 03Why the description matters

RobustnessNo resolutions needed

Defined in any abelian category, including those without enough projectives or injectives. Agrees with the derived-functor definition whenever that exists.

StructureThe product is visible

The ring structure on Ext is transparent as splicing, whereas from resolutions it requires constructing chain maps and comparing them.

Two descriptions, complementary strengths

Resolutions make Ext computable; Yoneda extensions make it interpretable. Most working arguments compute with a resolution and then interpret the answer as an extension class — particularly in degree 2, where the class is an obstruction.

ReferenceFrequently asked questions

Is the Yoneda definition equivalent to the derived functor one?

Yes, whenever the latter is defined — that is, when the category has enough projectives or enough injectives. The isomorphism is natural and respects the products.

Why is the equivalence relation generated rather than direct?

Because a morphism between n-fold extensions need not be invertible for n ≥ 2, so congruence is only a preorder. The equivalence it generates allows chains alternating in direction, which is what makes the classes a group.

What does an element of Ext<sup>2</sup> obstruct?

The extension of a module structure or a partial map over one further stage. In group cohomology H²(G, A) obstructs the existence of an extension realising a given action; in deformation theory it obstructs extending a first-order deformation to second order.

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 Yoneda Ext and n-Fold 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 Yoneda Ext and n-Fold Extensions as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—yoneda, n-fold, extensions, splicing, product—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 Yoneda Ext and n-Fold Extensions?