Resolutions for Group Cohomology

Executive summary

One resolution that always works, and several that are smaller

The bar resolution has free generators indexed by tuples of group elements, so it exists for every group and yields explicit cocycle formulas — the derivation condition in degree 1 and the factor set condition in degree 2 both read off it directly. It is also far too large for computation. Resolutions built from a presentation, or from a contractible space on which the group acts freely, are the practical alternatives.

Learning objectives

Write the bar resolution and its differential.
Read the cocycle and coboundary conditions in low degrees.
Explain the normalisation and why it is harmless.
Construct the start of a resolution from a presentation.

Section 01The bar resolution

B_n is free over ℤ[G] on symbols [g₁|…|g_n], with differential

∂[g₁|…|g_n] = g₁[g₂|…] + ∑_i (−1)ⁱ[…|g_ig_i+1|…] + (−1)ⁿ[g₁|…|g_n−1]

Exactness is proved by an explicit contracting homotopy over ℤ, which is why the construction works for every group with no hypotheses at all.

Explicit but unusable at scale

B_n has |G|ⁿ free generators. For a group of order 60 the degree-4 term already has nearly 13 million generators. The bar resolution is for deriving formulas, not for computing.

Section 02Cocycles in low degrees

What the bar resolution gives explicitly
Degree	Cochain	Cocycle condition	Coboundary
1	f: G → A	f(gh) = f(g) + g·f(h)	f(g) = g·a − a
2	f: G² → A	g·f(h,k) − f(gh,k) + f(g,hk) − f(g,h) = 0	f(g,h) = g·c(h) − c(gh) + c(g)
3	f: G³ → A	The four-term alternating identity	From a 2-cochain

The degree-2 condition is the factor set condition

It is exactly the associativity requirement for a multiplication on A × G twisted by f. So H² classifying extensions is not an analogy — the cocycle condition is associativity, read off the resolution.

Section 03Smaller resolutions

Alternative

Normalised bar resolution

Quotient by degenerate generators, those with some g_i = 1. Chain homotopy equivalent to the full bar resolution, and appreciably smaller.

Alternative

From a presentation

A presentation with generators and relations gives the first two terms of a free resolution, with the differential expressed by Fox derivatives. Enough for H¹ and H².

Alternative

Geometric

A contractible complex with free G-action gives a resolution by its cellular chains. For a free group, a tree; for a surface group, the hyperbolic plane.

Alternative

Periodic

For cyclic groups, period 2 as described separately. For groups with periodic cohomology in general, a periodic resolution exists.

Alternative

Koszul-type

For elementary abelian groups in characteristic p, the resolution has polynomial and exterior structure, and the cohomology ring is computable.

Alternative

Minimal

Over a local ring such as a group algebra in modular characteristic, minimal resolutions give the Betti numbers directly.

ReferenceFrequently asked questions

Is the normalised bar resolution equivalent to the full one?

Yes — the degenerate subcomplex is acyclic, so the quotient map is a chain homotopy equivalence. Cohomology can therefore be computed with normalised cochains, which is the usual convention.

How much of a resolution does a presentation give?

The first two steps: free on the generators, then the relation module. That determines H¹ and H², which is why Hopf's formula for H₂ can be read off a presentation.

Why is the bar resolution still taught?

Because it is the source of the explicit cocycle formulas that give the low-degree interpretations, and because its existence for arbitrary groups makes the general theory unconditional. Its impracticality is separate from its theoretical role.

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 Resolutions for Group Cohomology. 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 Resolutions for Group Cohomology as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—resolution, resolutions, normalised, section, cohomology—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 Resolutions for Group Cohomology?