Mathematics•The Künneth Formula
Universal Coefficients and the Dual Künneth Formula
Recovering homology and cohomology with arbitrary coefficients from the integral case, with an Ext or Tor correction.
Integral homology determines everything, up to an extension
The universal coefficient theorems express homology and cohomology with coefficients in a module A in terms of integral homology. For homology the correction is a Tor term one degree down; for cohomology it is an Ext term one degree up. Both sequences split non-naturally. Together they say that integral homology determines all other coefficient versions — but only up to an extension, and the extension data is genuinely lost if the splitting is used carelessly.
Learning objectives
- State both universal coefficient theorems.
- Explain the degree shift in each direction.
- Identify when the correction term vanishes.
- Explain the consequence for cohomology detecting torsion.
Section 01The two theorems
For a chain complex of free modules over a PID:
| Homology | Cohomology | |
|---|---|---|
| Main term | Hn ⊗ A | Hom(Hn, A) |
| Correction | Tor1(Hn−1, A) | Ext1(Hn−1, A) |
| Correction position | On the right | On the left |
| Degree of correction | One lower | One lower, contributing to degree n |
| Splits | Yes, non-naturally | Yes, non-naturally |
In homology the correction is a quotient; in cohomology it is a submodule. Getting this backwards produces wrong conclusions about which classes are detected, and the error is not visible from the shape of the sequence alone.
Section 02When corrections vanish
Field coefficients
Both Tor and Ext vanish over a field, so homology and cohomology are dual vector spaces and everything is clean.
Free homology
If Hn−1 is free then Tor and Ext against it vanish, and both sequences reduce to their main terms.
Torsion homology, integral coefficients
Ext1(ℤ/m, ℤ) = ℤ/m, so torsion in degree n−1 appears in cohomology in degree n. This is why integral cohomology sees torsion one degree up.
Torsion in Hn−1 contributes to Hn, not to Hn−1. Reading off torsion from cohomology therefore requires the shift to be applied, and forgetting it is a standard source of errors when comparing homology and cohomology tables.
Section 03Why splitting is not natural
A splitting exists for each complex separately, but a map of complexes need not commute with chosen splittings. Concretely, in topology the induced maps on cohomology do not respect the decomposition into Hom and Ext parts.
Any statement about induced maps, cup products or naturality must be phrased using the short exact sequence. The direct sum decomposition is a statement about isolated objects and cannot be propagated along morphisms.
ReferenceFrequently asked questions
Why does cohomology have an Ext term and homology a Tor term?
Because cohomology applies Hom, which is left exact with Ext as its derived functor, while homology applies tensor, which is right exact with Tor as its derived functor. The position of the correction follows the exactness direction of the functor involved.
Can cohomology be recovered from homology completely?
Up to the extension recorded by the short exact sequence. With field coefficients the answer is yes and cohomology is the dual of homology; integrally, the extension can be non-trivial and the two carry genuinely different information.
What is the dual Künneth formula?
The statement computing the cohomology of a product in terms of the cohomology of the factors, with an Ext correction term, under finiteness hypotheses. It is less symmetric than the homology version because Hom does not commute with infinite direct sums.
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 Universal Coefficients and the Dual Künneth Formula. 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 Universal Coefficients and the Dual Künneth Formula as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—homology, universal, coefficients, formula, correction—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 Universal Coefficients and the Dual Künneth Formula?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which assumption about homology would change the result most if it proved false?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What evidence would allow an independent reviewer to reproduce or challenge the conclusion?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which boundary, exception or failure case has not yet been tested?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What must be handed over, monitored or reviewed after the immediate work is complete?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Authoritative references and use notes
The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.
- MIT OpenCourseWare — Number Theory I — Massachusetts Institute of Technology. Used for algebraic and analytic number theory. Accessed 2026-08-13.
- MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
- Page ID
- KV-MATH-0136
- Taxonomy
- ENG-MATH — Engineering / Mathematics
- Collection
- COL-HOMALG-001
- Topic stream
- HA-KUNNETH
- Version
- 1.1.0 / content 2026.08
- Last reviewed
- 2026-08-06