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 moreSingular 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesSet Operations: Union, Intersection, and ComplementProof by CasesProving by Cases and ExhaustionVacuous Truth and Trivial CasesProof by Cases (Proof by Exhaustion)Mathematical InductionBinary Operations and Algebraic StructuresGroup Definition and ExamplesBasic Properties of GroupsGroup HomomorphismsGroup IsomorphismsCayley's TheoremCosets and Lagrange's TheoremNormal SubgroupsQuotient GroupsFirst Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsFirst Isomorphism Theorem for GroupsThird Isomorphism Theorem for GroupsFirst Isomorphism Theorem for RingsIntegral DomainsPrincipal Ideal DomainsUnique Factorization DomainsPolynomial RingsField ExtensionsAlgebraic and Transcendental ElementsSplitting FieldsFinite FieldsGalois GroupsFundamental Theorem of Galois TheorySecond Isomorphism Theorem for GroupsDirect Products of GroupsClassification of Finite Abelian GroupsChain Complexes and the Boundary OperatorSimplicial Homology GroupsSingular Homology GroupsHomology with CoefficientsCochain Complexes and Cohomology

Longest path: 106 steps · 472 total prerequisite topics

Prerequisites (4)

Leads To (2)