Cohomology of Finite Cyclic Groups

Executive summary

Period two, forever

For a cyclic group of order m generated by t, the elements t − 1 and the norm N = 1 + t + … + t^m−1 alternate as the differentials of a free resolution of period 2. Cohomology is therefore periodic with period 2 in positive degrees, alternating between the kernel of one map modulo the image of the other. This is the only infinite family that is completely computable by hand, and it is the standard testing ground.

Learning objectives

Write down the periodic resolution.
Compute the cohomology in each degree.
Identify the norm and difference maps.
Explain the periodicity and its relation to Tate cohomology.

Section 01The periodic resolution

… → ℤ[G] →^t−1 ℤ[G] →^N ℤ[G] →^t−1 ℤ[G] →^ε ℤ → 0

Exactness rests on two identities in ℤ[G]: N(t − 1) = 0, and the kernel of multiplication by t − 1 is generated by N, and conversely.

Why the period is 2

Two maps suffice to generate an exact sequence, and applying them alternately continues it indefinitely. Cyclic groups are the basic example of groups with periodic cohomology; the general characterisation is that a finite group has periodic cohomology exactly when every abelian subgroup is cyclic.

Section 02The computation

Applying Hom_ℤ[G](−, A) turns the resolution into A with the maps t − 1 and N acting alternately. So

Cohomology of a cyclic group of order m
Degree	Hⁿ(G, A)
0	A^G = ker(t − 1)
n ≥ 1 odd	ker N / im(t − 1)
n ≥ 2 even	A^G / N·A = ker(t − 1) / im N

With trivial coefficients A = ℤ, the maps are 0 and multiplication by m, giving

H⁰ = ℤ, H^odd = 0, H^{even ≥ 2} = ℤ/mℤ

Homology is the mirror image

H₀ = ℤ, H_odd = ℤ/mℤ, H_{even ≥ 2} = 0. The parity swap between homology and cohomology is a consequence of the universal coefficient theorem and its degree shift.

Section 03Tate cohomology

For a finite group the norm map N: A_G → A^G connects homology and cohomology, and splicing them through its kernel and cokernel gives Tate cohomology Ĥⁿ for all integers n.

Ĥ⁰ = A^G / NA, Ĥ⁻¹ = ker N / IA

Complete periodicity

For a cyclic group, Tate cohomology is periodic with period 2 in every degree, positive and negative. This is what makes cyclic groups the model case in class field theory, where the Herbrand quotient — the ratio of the orders of the two Tate groups — is a central computational tool.

ReferenceFrequently asked questions

Why does the resolution alternate between two maps?

Because the kernel of multiplication by t − 1 on the group ring is generated by N, and the kernel of N is generated by t − 1. Each map's kernel is the other's image, so alternating them produces an exact sequence indefinitely.

Which finite groups have periodic cohomology?

Exactly those in which every abelian subgroup is cyclic — equivalently, those acting freely on a sphere. Cyclic and generalised quaternion groups are the standard examples.

Is the Herbrand quotient useful outside class field theory?

It is used wherever a cyclic group acts and orders need comparing — notably in the arithmetic of number fields and in the study of units. Its multiplicativity in short exact sequences makes it a convenient invariant.

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 Cohomology of Finite Cyclic Groups. 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 Cohomology of Finite Cyclic Groups as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—cohomology, periodic, cyclic, resolution, tate—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 Cohomology of Finite Cyclic Groups?