A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Cochain Complexes and Cohomology

Research Depth 105 in the knowledge graph ☐ I know this ☆ Set as goal
5topics build on this
472prerequisites beneath it
See this on the map →
Chain Complexes and the Boundary OperatorGroup Homomorphisms+2 more→→Singular CohomologyThe Cup Product
algebraic-topology cohomology cochain-complexes duality

Core Idea

A cochain complex is obtained by dualizing a chain complex: replacing each chain group C_n with the dual group Hom(C_n, G) (typically G = Z) and reversing the direction of the maps. The coboundary operator dn goes "upward" from Cn to Cn+1, and cohomology Hn = ker(dn)/im(dn-1) measures the failure of cocycles to be coboundaries. While cohomology carries the same information as homology for spaces over a field, over the integers it carries strictly more information due to the universal coefficient theorem, and the cup product gives cohomology a ring structure that homology lacks.

Explainer

Cohomology is the dual theory to homology, obtained by applying the Hom functor to the chain complex. Given a chain complex C_* with boundary operators d_n : C_n -> C_{n-1}, and a coefficient group G (typically Z, Q, or Z/pZ), the cochain group C^n(X; G) = Hom(C_n(X), G) consists of all group homomorphisms from the n-th chain group to G. A cochain f in Cn assigns an element of G to each singular n-simplex — it "evaluates" chains rather than being a chain itself. The coboundary operator dn : Cn -> Cn+1 is defined by d^n(f) = f compose d_{n+1}: it precomposes a cochain with the boundary map, pulling it up one dimension.

The fundamental property dn+1 compose dn = 0 follows immediately from d compose d = 0 in the chain complex. This makes (C^*, d^*) a cochain complex — a sequence of abelian groups with maps going "upward" in dimension whose composition is zero. The n-th cohomology group is H^n(X; G) = ker(dn) / im(dn-1). Elements of ker(dn) are called cocycles — cochains that vanish on boundaries. Elements of im(dn-1) are called coboundaries — cochains that are the coboundary of a lower-dimensional cochain. Two cocycles represent the same cohomology class when they differ by a coboundary.

The relationship between homology and cohomology is governed by the universal coefficient theorem, which states (for integer coefficients) that H^n(X; Z) fits into a short exact sequence 0 -> Ext(H_{n-1}(X), Z) -> H^n(X; Z) -> Hom(H_n(X), Z) -> 0. When the homology groups are free abelian (no torsion), the Ext term vanishes and H^n(X; Z) = Hom(H_n(X), Z), the usual algebraic dual. Torsion in homology produces additional torsion in cohomology, shifted by one degree — this is the "extra information" that cohomology carries over the integers.

The deepest reason to study cohomology alongside homology is the cup product, which gives H^*(X; R) = direct sum H^n(X; R) the structure of a graded ring (when R is a commutative ring). This multiplicative structure is invisible from the homology side and provides a strictly finer topological invariant. Poincare duality — the statement that H^k(M) = H_{n-k}(M) for a closed oriented n-manifold M — is most naturally expressed in cohomological terms. Characteristic classes (Stiefel-Whitney, Chern, Pontryagin), which classify vector bundles, live in cohomology. Obstruction theory, which determines when maps with certain properties exist, is formulated cohomologically. Cohomology is not merely the "dual of homology" but a richer and more structured invariant in its own right.

Practice Questions 4 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Binary Operations and Algebraic Structures → Group Definition and Examples → Basic Properties of Groups → Group Homomorphisms → Group Isomorphisms → Cayley's Theorem → Cosets and Lagrange's Theorem → Normal Subgroups → Quotient Groups → First Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → First Isomorphism Theorem for Groups → Third Isomorphism Theorem for Groups → First Isomorphism Theorem for Rings → Integral Domains → Principal Ideal Domains → Unique Factorization Domains → Polynomial Rings → Field Extensions → Algebraic and Transcendental Elements → Splitting Fields → Finite Fields → Galois Groups → Fundamental Theorem of Galois Theory → Second Isomorphism Theorem for Groups → Direct Products of Groups → Classification of Finite Abelian Groups → Chain Complexes and the Boundary Operator → Simplicial Homology Groups → Singular Homology Groups → Homology with Coefficients → Cochain Complexes and Cohomology

Longest path: 106 steps · 472 total prerequisite topics

Prerequisites (4)

Leads To (2)